[mlpack-svn] r13358 - mlpack/trunk/src/mlpack/core/tree/binary_space_tree
fastlab-svn at coffeetalk-1.cc.gatech.edu
fastlab-svn at coffeetalk-1.cc.gatech.edu
Tue Aug 7 09:53:53 EDT 2012
Author: rcurtin
Date: 2012-08-07 09:53:53 -0400 (Tue, 07 Aug 2012)
New Revision: 13358
Modified:
mlpack/trunk/src/mlpack/core/tree/binary_space_tree/dual_tree_traverser_impl.hpp
Log:
Fix spaces, and actually traverse to the left instead of just saying it and then
doing something else.
Modified: mlpack/trunk/src/mlpack/core/tree/binary_space_tree/dual_tree_traverser_impl.hpp
===================================================================
--- mlpack/trunk/src/mlpack/core/tree/binary_space_tree/dual_tree_traverser_impl.hpp 2012-08-07 05:27:29 UTC (rev 13357)
+++ mlpack/trunk/src/mlpack/core/tree/binary_space_tree/dual_tree_traverser_impl.hpp 2012-08-07 13:53:53 UTC (rev 13358)
@@ -41,9 +41,9 @@
const double score = rule.Score(query, referenceNode);
if (score == DBL_MAX)
- continue; // We can't improve this particular point.
+ continue; // We can't improve this particular point.
- for (size_t ref = referenceNode.Begin(); ref < referenceNode.End(); ++ref)
+ for (size_t ref = referenceNode.Begin(); ref < referenceNode.End(); ++ref)
rule.BaseCase(query, ref);
}
}
@@ -218,7 +218,7 @@
else
{
// Choose the left first.
- Traverse(*queryNode.Right(), *referenceNode.Right());
+ Traverse(*queryNode.Right(), *referenceNode.Left());
// Is it still valid to recurse to the right?
rightScore = rule.Rescore(*queryNode.Right(), *referenceNode.Right(),
More information about the mlpack-svn
mailing list