13#ifndef MLPACK_METHODS_RANN_RA_QUERY_STAT_HPP
14#define MLPACK_METHODS_RANN_RA_QUERY_STAT_HPP
34template<
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>
67 ar & BOOST_SERIALIZATION_NVP(bound);
68 ar & BOOST_SERIALIZATION_NVP(numSamplesMade);
75 size_t numSamplesMade;
Extra data for each node in the tree.
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()
Modify the bound.
RAQueryStat(const TreeType &)
Initialization for a node.
double Bound() const
Get the bound.
size_t NumSamplesMade() const
Get the number of samples made.
void serialize(Archive &ar, const unsigned int)
Serialize the statistic.
Linear algebra utility functions, generally performed on matrices or vectors.
The core includes that mlpack expects; standard C++ includes and Armadillo.