greedy_single_tree_traverser.hpp
Go to the documentation of this file.
1 
14 #ifndef MLPACK_CORE_TREE_GREEDY_SINGLE_TREE_TRAVERSER_HPP
15 #define MLPACK_CORE_TREE_GREEDY_SINGLE_TREE_TRAVERSER_HPP
16 
17 #include <mlpack/prereqs.hpp>
18 
19 namespace mlpack {
20 namespace tree {
21 
22 template<typename TreeType, typename RuleType>
24 {
25  public:
29  GreedySingleTreeTraverser(RuleType& rule);
30 
38  void Traverse(const size_t queryIndex, TreeType& referenceNode);
39 
41  size_t NumPrunes() const { return numPrunes; }
42 
44  size_t& MinBaseCases() { return minBaseCases; }
45 
47  size_t MinBaseCases() const { return minBaseCases; }
48 
49  private:
51  RuleType& rule;
52 
54  size_t numPrunes;
55 
58  size_t minBaseCases;
59 };
60 
61 } // namespace tree
62 } // namespace mlpack
63 
64 // Include implementation.
65 #include "greedy_single_tree_traverser_impl.hpp"
66 
67 #endif
strip_type.hpp
Definition: add_to_po.hpp:21
The core includes that mlpack expects; standard C++ includes and Armadillo.
GreedySingleTreeTraverser(RuleType &rule)
Instantiate the greedy single tree traverser with the given rule set.
size_t NumPrunes() const
Get the number of prunes.
void Traverse(const size_t queryIndex, TreeType &referenceNode)
Traverse the tree with the given point.
size_t & MinBaseCases()
Set value of minBaseCases.
size_t MinBaseCases() const
Get value of minBaseCases.