[mlpack-svn] r13397 - mlpack/trunk/src/mlpack/core/tree/cover_tree

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

Author: rcurtin
Date: 2012-08-15 12:45:38 -0400 (Wed, 15 Aug 2012)
New Revision: 13397

Modified:
   mlpack/trunk/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp
Log:
Comment out debug output for now.


Modified: mlpack/trunk/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp
===================================================================
--- mlpack/trunk/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp	2012-08-15 16:44:38 UTC (rev 13396)
+++ mlpack/trunk/src/mlpack/core/tree/cover_tree/dual_tree_traverser_impl.hpp	2012-08-15 16:45:38 UTC (rev 13397)
@@ -103,19 +103,19 @@
       std::map<int, std::vector<MapEntryType> > childMap;
       PruneMap(queryNode.Child(i), referenceMap, childMap);
 
-      Log::Debug << "Recurse into query child " << i << ": " <<
-          queryNode.Child(i).Point() << " scale " << queryNode.Child(i).Scale()
-          << "; this parent is " << queryNode.Point() << " scale " <<
-          queryNode.Scale() << std::endl;
+//      Log::Debug << "Recurse into query child " << i << ": " <<
+//          queryNode.Child(i).Point() << " scale " << queryNode.Child(i).Scale()
+//          << "; this parent is " << queryNode.Point() << " scale " <<
+//          queryNode.Scale() << std::endl;
       Traverse(queryNode.Child(i), childMap);
     }
 
     PruneMapForSelfChild(queryNode.Child(0), referenceMap);
 
     // Now we can use the existing map (without a copy) for the self-child.
-    Log::Warn << "Recurse into query self-child " << queryNode.Child(0).Point()
-        << " scale " << queryNode.Child(0).Scale() << "; this parent is "
-        << queryNode.Point() << " scale " << queryNode.Scale() << std::endl;
+//    Log::Warn << "Recurse into query self-child " << queryNode.Child(0).Point()
+//        << " scale " << queryNode.Child(0).Scale() << "; this parent is "
+//        << queryNode.Point() << " scale " << queryNode.Scale() << std::endl;
     Traverse(queryNode.Child(0), referenceMap);
   }