25 #ifndef __MLPACK_CORE_TREE_BINARY_SPACE_TREE_DUAL_TREE_TRAVERSER_HPP
26 #define __MLPACK_CORE_TREE_BINARY_SPACE_TREE_DUAL_TREE_TRAVERSER_HPP
35 template<
typename BoundType,
36 typename StatisticType,
39 template<
typename RuleType>
104 #include "dual_tree_traverser_impl.hpp"
106 #endif // __MLPACK_CORE_TREE_BINARY_SPACE_TREE_DUAL_TREE_TRAVERSER_HPP
size_t & NumScores()
Modify the number of times a node combination was scored.
RuleType & rule
Reference to the rules with which the trees will be traversed.
A dual-tree traverser for binary space trees; see dual_tree_traverser.hpp.
Linear algebra utility functions, generally performed on matrices or vectors.
size_t numVisited
The number of node combinations that have been visited during traversal.
size_t NumVisited() const
Get the number of visited combinations.
size_t & NumPrunes()
Modify the number of prunes.
size_t & NumBaseCases()
Modify the number of times a base case was calculated.
size_t & NumVisited()
Modify the number of visited combinations.
A binary space partitioning tree, such as a KD-tree or a ball tree.
size_t numScores
The number of times a node combination was scored.
size_t numPrunes
The number of prunes.
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 NumScores() const
Get the number of times a node combination was scored.
size_t numBaseCases
The number of times a base case was calculated.
size_t NumPrunes() const
Get the number of prunes.