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()),
62 template<
typename TreeType>
64 firstBound(SortPolicy::WorstDistance()),
65 secondBound(SortPolicy::WorstDistance()),
66 bound(SortPolicy::WorstDistance()),
87 template<
typename Archive>
93 ar &
CreateNVP(secondBound,
"secondBound");
95 ar &
CreateNVP(lastDistance,
"lastDistance");
NeighborSearchStat(TreeType &)
Initialization for a fully initialized node.
double secondBound
The second bound on the node's neighbor distances (B_2).
Linear algebra utility functions, generally performed on matrices or vectors.
FirstShim< T > CreateNVP(T &t, const std::string &name, typename boost::enable_if< HasSerialize< T >>::type *=0)
Call this function to produce a name-value pair; this is similar to BOOST_SERIALIZATION_NVP(), but should be used for types that have a Serialize() function (or contain a type that has a Serialize() function) instead of a serialize() function.
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).
Include all of the base components required to write MLPACK methods, and the main MLPACK Doxygen docu...
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.
void Serialize(Archive &ar, const unsigned int)
Serialize the statistic to/from an archive.
double SecondBound() const
Get the second bound.
double Bound() const
Get the overall bound (the better of the two bounds).
double & LastDistance()
Modify the last distance calculation.