13#ifndef MLPACK_METHODS_NEIGHBOR_SEARCH_NEIGHBOR_SEARCH_STAT_HPP
14#define MLPACK_METHODS_NEIGHBOR_SEARCH_NEIGHBOR_SEARCH_STAT_HPP
25template<
typename SortPolicy>
49 firstBound(SortPolicy::WorstDistance()),
50 secondBound(SortPolicy::WorstDistance()),
51 auxBound(SortPolicy::WorstDistance()),
58 template<
typename TreeType>
60 firstBound(SortPolicy::WorstDistance()),
61 secondBound(SortPolicy::WorstDistance()),
62 auxBound(SortPolicy::WorstDistance()),
70 firstBound = SortPolicy::WorstDistance();
71 secondBound = SortPolicy::WorstDistance();
72 auxBound = SortPolicy::WorstDistance();
94 template<
typename Archive>
97 ar & BOOST_SERIALIZATION_NVP(firstBound);
98 ar & BOOST_SERIALIZATION_NVP(secondBound);
99 ar & BOOST_SERIALIZATION_NVP(auxBound);
100 ar & BOOST_SERIALIZATION_NVP(lastDistance);
Extra data for each node in the tree.
double & SecondBound()
Modify the second bound.
double FirstBound() const
Get the first bound.
double AuxBound() const
Get the aux bound.
void Reset()
Reset statistic parameters to initial values.
double SecondBound() const
Get the second bound.
double & FirstBound()
Modify the first bound.
NeighborSearchStat(TreeType &)
Initialization for a fully initialized node.
double & LastDistance()
Modify the last distance calculation.
double LastDistance() const
Get the last distance calculation.
double & AuxBound()
Modify the aux bound.
NeighborSearchStat()
Initialize the statistic with the worst possible distance according to our sorting policy.
void serialize(Archive &ar, const unsigned int)
Serialize the statistic to/from an archive.
Linear algebra utility functions, generally performed on matrices or vectors.
The core includes that mlpack expects; standard C++ includes and Armadillo.