15 #ifndef __MLPACK_METHODS_NEIGHBOR_SEARCH_NEIGHBOR_SEARCH_STAT_HPP
16 #define __MLPACK_METHODS_NEIGHBOR_SEARCH_NEIGHBOR_SEARCH_STAT_HPP
27 template<
typename SortPolicy>
53 firstBound(SortPolicy::WorstDistance()),
54 secondBound(SortPolicy::WorstDistance()),
55 bound(SortPolicy::WorstDistance()),
56 lastDistanceNode(NULL),
63 template<
typename TreeType>
65 firstBound(SortPolicy::WorstDistance()),
66 secondBound(SortPolicy::WorstDistance()),
67 bound(SortPolicy::WorstDistance()),
68 lastDistanceNode(NULL),
NeighborSearchStat(TreeType &)
Initialization for a fully initialized node.
void *& LastDistanceNode()
Modify the last distance evaluation node.
double secondBound
The second bound on the node's neighbor distances (B_2).
Linear algebra utility functions, generally performed on matrices or vectors.
double lastDistance
The last distance evaluation.
Extra data for each node in the tree.
double FirstBound() const
Get the first bound.
void * lastDistanceNode
The last distance evaluation node.
NeighborSearchStat()
Initialize the statistic with the worst possible distance according to our sorting policy...
double firstBound
The first bound on the node's neighbor distances (B_1).
double & Bound()
Modify the overall bound (it should be the better of the two bounds).
double & FirstBound()
Modify the first bound.
double LastDistance() const
Get the last distance calculation.
double & SecondBound()
Modify the second bound.
double bound
The better of the two bounds.
double SecondBound() const
Get the second bound.
void * LastDistanceNode() const
Get the last distance evaluation node.
double Bound() const
Get the overall bound (the better of the two bounds).
double & LastDistance()
Modify the last distance calculation.