[mlpack-svn] r13420 - mlpack/tags/mlpack-1.0.2/src/mlpack/tests

[fastlab-svn at coffeetalk-1.cc.gatech.edu]

Author: rcurtin
Date: 2012-08-15 14:54:13 -0400 (Wed, 15 Aug 2012)
New Revision: 13420

Modified:
   mlpack/tags/mlpack-1.0.2/src/mlpack/tests/tree_test.cpp
Log:
Ack, this change did not get propagated to the tag.


Modified: mlpack/tags/mlpack-1.0.2/src/mlpack/tests/tree_test.cpp
===================================================================
--- mlpack/tags/mlpack-1.0.2/src/mlpack/tests/tree_test.cpp	2012-08-15 18:40:31 UTC (rev 13419)
+++ mlpack/tags/mlpack-1.0.2/src/mlpack/tests/tree_test.cpp	2012-08-15 18:54:13 UTC (rev 13420)
@@ -1601,7 +1601,7 @@
   // The furthest point from the root will be (-5, -5), with a squared distance
   // of 50.  This means the scale of the root node should be 6 (because 2^6 =
   // 64).
-  BOOST_REQUIRE_EQUAL(tree.Scale(), 6);
+  BOOST_REQUIRE_EQUAL(tree.Scale(), 3);
 
   // Now loop through the tree and ensure that each leaf is only created once.
   arma::vec counts;
@@ -1617,10 +1617,10 @@
 
   // Each node must satisfy the covering principle (its children must be less
   // than or equal to a certain distance apart).
-  CheckCovering<CoverTree<>, LMetric<2> >(tree);
+  CheckCovering<CoverTree<>, LMetric<2, true> >(tree);
 
   // Each node's children must be separated by at least a certain value.
-  CheckSeparation<CoverTree<>, LMetric<2> >(tree, tree);
+  CheckSeparation<CoverTree<>, LMetric<2, true> >(tree, tree);
 }
 
 /**
@@ -1647,10 +1647,10 @@
 
   // Each node must satisfy the covering principle (its children must be less
   // than or equal to a certain distance apart).
-  CheckCovering<CoverTree<>, LMetric<2> >(tree);
+  CheckCovering<CoverTree<>, LMetric<2, true> >(tree);
 
   // Each node's children must be separated by at least a certain value.
-  CheckSeparation<CoverTree<>, LMetric<2> >(tree, tree);
+  CheckSeparation<CoverTree<>, LMetric<2, true> >(tree, tree);
 }
 
 /**