13 #ifndef MLPACK_METHODS_RANN_RA_QUERY_STAT_HPP
14 #define MLPACK_METHODS_RANN_RA_QUERY_STAT_HPP
34 template<
typename SortPolicy>
42 RAQueryStat() : bound(SortPolicy::WorstDistance()), numSamplesMade(0) { }
47 template<
typename TreeType>
49 bound(SortPolicy::WorstDistance()),
54 double Bound()
const {
return bound; }
56 double&
Bound() {
return bound; }
64 template<
typename Archive>
75 size_t numSamplesMade;
double & Bound()
Modify the bound.
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.
size_t NumSamplesMade() const
Get the number of samples made.
The core includes that mlpack expects; standard C++ includes and Armadillo.
void Serialize(Archive &ar, const unsigned int)
Serialize the statistic.
RAQueryStat()
Initialize the statistic with the worst possible distance according to our sorting policy...
size_t & NumSamplesMade()
Modify the number of samples made.
double Bound() const
Get the bound.
RAQueryStat(const TreeType &)
Initialization for a node.