15 #ifndef __MLPACK_METHODS_RANN_RA_QUERY_STAT_HPP 16 #define __MLPACK_METHODS_RANN_RA_QUERY_STAT_HPP 36 template<
typename SortPolicy>
49 template<
typename TreeType>
51 bound(SortPolicy::WorstDistance()),
66 template<
typename Archive>
size_t numSamplesMade
The minimum number of samples made by any query in this node.
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.
Extra data for each node in the tree.
void Serialize(Archive &ar, const unsigned int)
Serialize the statistic.
size_t NumSamplesMade() const
Get the number of samples made.
double & Bound()
Modify the bound.
Include all of the base components required to write MLPACK methods, and the main MLPACK Doxygen docu...
RAQueryStat(const TreeType &)
Initialization for a node.
double Bound() const
Get the bound.
size_t & NumSamplesMade()
Modify the number of samples made.
double bound
The bound on the node's neighbor distances.
RAQueryStat()
Initialize the statistic with the worst possible distance according to our sorting policy...