[mlpack-git] master: Display base cases and scores for single-tree mode. (5c11710)
gitdub at big.cc.gt.atl.ga.us
gitdub at big.cc.gt.atl.ga.us
Thu Mar 5 21:59:44 EST 2015
Repository : https://github.com/mlpack/mlpack
On branch : master
Link : https://github.com/mlpack/mlpack/compare/904762495c039e345beba14c1142fd719b3bd50e...f94823c800ad6f7266995c700b1b630d5ffdcf40
>---------------------------------------------------------------
commit 5c11710676edfe98dfa7bd209a419b1078796954
Author: Ryan Curtin <ryan at ratml.org>
Date: Mon Aug 25 21:23:04 2014 +0000
Display base cases and scores for single-tree mode.
>---------------------------------------------------------------
5c11710676edfe98dfa7bd209a419b1078796954
src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp | 6 ++++--
1 file changed, 4 insertions(+), 2 deletions(-)
diff --git a/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp b/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
index 12f8f46..33b2577 100644
--- a/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
+++ b/src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
@@ -252,7 +252,6 @@ void NeighborSearch<SortPolicy, MetricType, TreeType>::Search(
}
else if (singleMode)
{
-
// The search doesn't work if the root node is also a leaf node.
// if this is the case, it is suggested that you use the naive method.
assert(!(referenceTree->IsLeaf()));
@@ -263,8 +262,11 @@ void NeighborSearch<SortPolicy, MetricType, TreeType>::Search(
// Now have it traverse for each point.
for (size_t i = 0; i < querySet.n_cols; ++i)
traverser.Traverse(i, *referenceTree);
+
+ Log::Info << rules.Scores() << " node combinations were scored.\n";
+ Log::Info << rules.BaseCases() << " base cases were calculated.\n";
}
- else // Dual-tree recursion.referenceTree
+ else // Dual-tree recursion.
{
// Create the traverser.
typename TreeType::template DualTreeTraverser<RuleType> traverser(rules);
More information about the mlpack-git
mailing list