[mlpack-git] master: Define a general GreedySingleTreeTraverser. (f737ef7)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/mlpack
On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/3274b05fcc545c3b36f783316fea2e22f79c3d03...1c77230c7d3b9c45fb102cd3c632d9c7248e085e

>---------------------------------------------------------------

commit f737ef7637f20d401afe5b37e37a35406e446225
Author: MarcosPividori <marcos.pividori at gmail.com>
Date:   Tue Aug 16 03:44:29 2016 -0300

    Define a general GreedySingleTreeTraverser.


>---------------------------------------------------------------

f737ef7637f20d401afe5b37e37a35406e446225
 src/mlpack/core/tree/CMakeLists.txt                        | 2 ++
 src/mlpack/core/tree/greedy_single_tree_traverser_impl.hpp | 4 ++--
 2 files changed, 4 insertions(+), 2 deletions(-)

diff --git a/src/mlpack/core/tree/CMakeLists.txt b/src/mlpack/core/tree/CMakeLists.txt
index 5271772..ea38cbb 100644
--- a/src/mlpack/core/tree/CMakeLists.txt
+++ b/src/mlpack/core/tree/CMakeLists.txt
@@ -38,6 +38,8 @@ set(SOURCES
   cover_tree/traits.hpp
   cover_tree/typedef.hpp
   example_tree.hpp
+  greedy_single_tree_traverser.hpp
+  greedy_single_tree_traverser_impl.hpp
   hollow_ball_bound.hpp
   hollow_ball_bound_impl.hpp
   hrectbound.hpp
diff --git a/src/mlpack/core/tree/greedy_single_tree_traverser_impl.hpp b/src/mlpack/core/tree/greedy_single_tree_traverser_impl.hpp
index 723efb5..95eaa8b 100644
--- a/src/mlpack/core/tree/greedy_single_tree_traverser_impl.hpp
+++ b/src/mlpack/core/tree/greedy_single_tree_traverser_impl.hpp
@@ -23,7 +23,7 @@ GreedySingleTreeTraverser<TreeType, RuleType>::GreedySingleTreeTraverser(
 { /* Nothing to do. */ }
 
 template<typename TreeType, typename RuleType>
-GreedySingleTreeTraverser<TreeType, RuleType>::Traverse(
+void GreedySingleTreeTraverser<TreeType, RuleType>::Traverse(
     const size_t queryIndex,
     TreeType& referenceNode)
 {
@@ -38,7 +38,7 @@ GreedySingleTreeTraverser<TreeType, RuleType>::Traverse(
     // We are prunning all but one child.
     numPrunes += referenceNode.NumChildren() - 1;
     // Recurse the best child.
-    TreeTyp& bestChild = rule.GetBestChild(queryIndex, referenceNode);
+    TreeType& bestChild = rule.GetBestChild(queryIndex, referenceNode);
     Traverse(queryIndex, bestChild);
   }
 }