mlpack
|
Extra data for each node in the tree. More...
#include <ra_query_stat.hpp>
Public Member Functions | |
RAQueryStat () | |
Initialize the statistic with the worst possible distance according to our sorting policy. | |
template<typename TreeType > | |
RAQueryStat (const TreeType &) | |
Initialization for a node. | |
double | Bound () const |
Get the bound. | |
double & | Bound () |
Modify the bound. | |
size_t | NumSamplesMade () const |
Get the number of samples made. | |
size_t & | NumSamplesMade () |
Modify the number of samples made. | |
template<typename Archive > | |
void | serialize (Archive &ar, const uint32_t) |
Serialize the statistic. | |
Extra data for each node in the tree.
For neighbor searches, each node only needs to store a bound on neighbor distances.
Every query is required to make a minimum number of samples to guarantee the desired approximation error. The 'numSamplesMade' keeps track of the minimum number of samples made by all queries in the node in question.