MLPACK
1.0.11
|
A dual-tree traverser for binary space trees; see dual_tree_traverser.hpp. More...
Public Member Functions | |
DualTreeTraverser (RuleType &rule) | |
Instantiate the dual-tree traverser with the given rule set. More... | |
size_t | NumBaseCases () const |
Get the number of times a base case was calculated. More... | |
size_t & | NumBaseCases () |
Modify the number of times a base case was calculated. More... | |
size_t | NumPrunes () const |
Get the number of prunes. More... | |
size_t & | NumPrunes () |
Modify the number of prunes. More... | |
size_t | NumScores () const |
Get the number of times a node combination was scored. More... | |
size_t & | NumScores () |
Modify the number of times a node combination was scored. More... | |
size_t | NumVisited () const |
Get the number of visited combinations. More... | |
size_t & | NumVisited () |
Modify the number of visited combinations. More... | |
void | Traverse (BinarySpaceTree &queryNode, BinarySpaceTree &referenceNode) |
Traverse the two trees. More... | |
Private Attributes | |
size_t | numBaseCases |
The number of times a base case was calculated. More... | |
size_t | numPrunes |
The number of prunes. More... | |
size_t | numScores |
The number of times a node combination was scored. More... | |
size_t | numVisited |
The number of node combinations that have been visited during traversal. More... | |
RuleType & | rule |
Reference to the rules with which the trees will be traversed. More... | |
RuleType::TraversalInfoType | traversalInfo |
Traversal information, held in the class so that it isn't continually being reallocated. More... | |
A dual-tree traverser for binary space trees; see dual_tree_traverser.hpp.
Definition at line 103 of file binary_space_tree.hpp.
mlpack::tree::BinarySpaceTree< BoundType, StatisticType, MatType, SplitType >::DualTreeTraverser< RuleType >::DualTreeTraverser | ( | RuleType & | rule | ) |
Instantiate the dual-tree traverser with the given rule set.
|
inline |
Get the number of times a base case was calculated.
Definition at line 75 of file dual_tree_traverser.hpp.
|
inline |
Modify the number of times a base case was calculated.
Definition at line 77 of file dual_tree_traverser.hpp.
|
inline |
Get the number of prunes.
Definition at line 60 of file dual_tree_traverser.hpp.
|
inline |
Modify the number of prunes.
Definition at line 62 of file dual_tree_traverser.hpp.
|
inline |
Get the number of times a node combination was scored.
Definition at line 70 of file dual_tree_traverser.hpp.
|
inline |
Modify the number of times a node combination was scored.
Definition at line 72 of file dual_tree_traverser.hpp.
|
inline |
Get the number of visited combinations.
Definition at line 65 of file dual_tree_traverser.hpp.
|
inline |
Modify the number of visited combinations.
Definition at line 67 of file dual_tree_traverser.hpp.
void mlpack::tree::BinarySpaceTree< BoundType, StatisticType, MatType, SplitType >::DualTreeTraverser< RuleType >::Traverse | ( | BinarySpaceTree & | queryNode, |
BinarySpaceTree & | referenceNode | ||
) |
Traverse the two trees.
This does not reset the number of prunes.
queryNode | The query node to be traversed. |
referenceNode | The reference node to be traversed. |
score | The score of the current node combination. |
|
private |
The number of times a base case was calculated.
Definition at line 93 of file dual_tree_traverser.hpp.
|
private |
The number of prunes.
Definition at line 84 of file dual_tree_traverser.hpp.
|
private |
The number of times a node combination was scored.
Definition at line 90 of file dual_tree_traverser.hpp.
|
private |
The number of node combinations that have been visited during traversal.
Definition at line 87 of file dual_tree_traverser.hpp.
|
private |
Reference to the rules with which the trees will be traversed.
Definition at line 81 of file dual_tree_traverser.hpp.
|
private |
Traversal information, held in the class so that it isn't continually being reallocated.
Definition at line 97 of file dual_tree_traverser.hpp.