MLPACK  1.0.10
dual_tree_traverser.hpp
Go to the documentation of this file.
1 
25 #ifndef __MLPACK_CORE_TREE_BINARY_SPACE_TREE_DUAL_TREE_TRAVERSER_HPP
26 #define __MLPACK_CORE_TREE_BINARY_SPACE_TREE_DUAL_TREE_TRAVERSER_HPP
27 
28 #include <mlpack/core.hpp>
29 
30 #include "binary_space_tree.hpp"
31 
32 namespace mlpack {
33 namespace tree {
34 
35 template<typename BoundType,
36  typename StatisticType,
37  typename MatType,
38  typename SplitType>
39 template<typename RuleType>
40 class BinarySpaceTree<BoundType, StatisticType, MatType, SplitType>::
41  DualTreeTraverser
42 {
43  public:
47  DualTreeTraverser(RuleType& rule);
48 
56  void Traverse(BinarySpaceTree& queryNode,
57  BinarySpaceTree& referenceNode);
58 
60  size_t NumPrunes() const { return numPrunes; }
62  size_t& NumPrunes() { return numPrunes; }
63 
65  size_t NumVisited() const { return numVisited; }
67  size_t& NumVisited() { return numVisited; }
68 
70  size_t NumScores() const { return numScores; }
72  size_t& NumScores() { return numScores; }
73 
75  size_t NumBaseCases() const { return numBaseCases; }
77  size_t& NumBaseCases() { return numBaseCases; }
78 
79  private:
81  RuleType& rule;
82 
84  size_t numPrunes;
85 
87  size_t numVisited;
88 
90  size_t numScores;
91 
93  size_t numBaseCases;
94 
97  typename RuleType::TraversalInfoType traversalInfo;
98 };
99 
100 }; // namespace tree
101 }; // namespace mlpack
102 
103 // Include implementation.
104 #include "dual_tree_traverser_impl.hpp"
105 
106 #endif // __MLPACK_CORE_TREE_BINARY_SPACE_TREE_DUAL_TREE_TRAVERSER_HPP
107 
size_t NumScores() const
Get the number of times a node combination was scored.
size_t & NumScores()
Modify the number of times a node combination was scored.
size_t numBaseCases
The number of times a base case was calculated.
size_t NumVisited() const
Get the number of visited combinations.
size_t NumPrunes() const
Get the number of prunes.
size_t numScores
The number of times a node combination was scored.
size_t & NumBaseCases()
Modify the number of times a base case was calculated.
size_t & NumVisited()
Modify the number of visited combinations.
RuleType::TraversalInfoType traversalInfo
Traversal information, held in the class so that it isn't continually being reallocated.
size_t NumBaseCases() const
Get the number of times a base case was calculated.
size_t numVisited
The number of node combinations that have been visited during traversal.
RuleType & rule
Reference to the rules with which the trees will be traversed.
BinarySpaceTree(MatType &data, const size_t maxLeafSize=20)
Construct this as the root node of a binary space tree using the given dataset.
size_t & NumPrunes()
Modify the number of prunes.