BaseCase(const size_t queryIndex, const size_t referenceIndex) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
Candidate typedef | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
CandidateList typedef | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
candidates | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
firstLeafExact | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
GetResults(arma::Mat< size_t > &neighbors, arma::mat &distances) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
InsertNeighbor(const size_t queryIndex, const size_t neighbor, const double distance) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
k | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
metric | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
NumDistComputations() | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | inline |
numDistComputations | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
NumEffectiveSamples() | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | inline |
numSamplesMade | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
numSamplesReqd | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
querySet | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
RASearchRules(const arma::mat &referenceSet, const arma::mat &querySet, const size_t k, MetricType &metric, const double tau=5, const double alpha=0.95, const bool naive=false, const bool sampleAtLeaves=false, const bool firstLeafExact=false, const size_t singleSampleLimit=20, const bool sameSet=false) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
referenceSet | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
Rescore(const size_t queryIndex, TreeType &referenceNode, const double oldScore) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
Rescore(TreeType &queryNode, TreeType &referenceNode, const double oldScore) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
sameSet | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
sampleAtLeaves | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
samplingRatio | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
Score(const size_t queryIndex, TreeType &referenceNode) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
Score(const size_t queryIndex, TreeType &referenceNode, const double baseCaseResult) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
Score(TreeType &queryNode, TreeType &referenceNode) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
Score(TreeType &queryNode, TreeType &referenceNode, const double baseCaseResult) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |
Score(const size_t queryIndex, TreeType &referenceNode, const double distance, const double bestDistance) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
Score(TreeType &queryNode, TreeType &referenceNode, const double distance, const double bestDistance) | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
singleSampleLimit | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
TraversalInfo() const | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | inline |
TraversalInfo() | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | inline |
traversalInfo | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | private |
TraversalInfoType typedef | mlpack::neighbor::RASearchRules< SortPolicy, MetricType, TreeType > | |