| BaseCase(const size_t queryIndex, const size_t referenceIndex) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| GetResults(arma::Mat< size_t > &neighbors, arma::mat &distances) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| MinimumBaseCases() const | RASearchRules< SortPolicy, MetricType, TreeType > | inline |
| NumDistComputations() | RASearchRules< SortPolicy, MetricType, TreeType > | inline |
| NumEffectiveSamples() | RASearchRules< SortPolicy, MetricType, TreeType > | inline |
| 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) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| Rescore(const size_t queryIndex, TreeType &referenceNode, const double oldScore) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| Rescore(TreeType &queryNode, TreeType &referenceNode, const double oldScore) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| Score(const size_t queryIndex, TreeType &referenceNode) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| Score(const size_t queryIndex, TreeType &referenceNode, const double baseCaseResult) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| Score(TreeType &queryNode, TreeType &referenceNode) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| Score(TreeType &queryNode, TreeType &referenceNode, const double baseCaseResult) | RASearchRules< SortPolicy, MetricType, TreeType > | |
| TraversalInfo() const | RASearchRules< SortPolicy, MetricType, TreeType > | inline |
| TraversalInfo() | RASearchRules< SortPolicy, MetricType, TreeType > | inline |
| TraversalInfoType typedef | RASearchRules< SortPolicy, MetricType, TreeType > | |
