| BaseCase(const size_t queryIndex, const size_t referenceIndex) | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| baseCases | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| BaseCases() const | NeighborSearchRules< SortPolicy, MetricType, TreeType > | inline |
| BaseCases() | NeighborSearchRules< SortPolicy, MetricType, TreeType > | inline |
| CalculateBound(TreeType &queryNode) const | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| Candidate typedef | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| CandidateList typedef | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| candidates | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| epsilon | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| GetBestChild(const size_t queryIndex, TreeType &referenceNode) | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| GetBestChild(const TreeType &queryNode, TreeType &referenceNode) | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| GetResults(arma::Mat< size_t > &neighbors, arma::mat &distances) | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| InsertNeighbor(const size_t queryIndex, const size_t neighbor, const double distance) | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| k | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| lastBaseCase | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| lastQueryIndex | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| lastReferenceIndex | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| metric | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| MinimumBaseCases() const | NeighborSearchRules< SortPolicy, MetricType, TreeType > | inline |
| NeighborSearchRules(const typename TreeType::Mat &referenceSet, const typename TreeType::Mat &querySet, const size_t k, MetricType &metric, const double epsilon=0, const bool sameSet=false) | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| querySet | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| referenceSet | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| Rescore(const size_t queryIndex, TreeType &referenceNode, const double oldScore) const | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| Rescore(TreeType &queryNode, TreeType &referenceNode, const double oldScore) const | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| sameSet | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| Score(const size_t queryIndex, TreeType &referenceNode) | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| Score(TreeType &queryNode, TreeType &referenceNode) | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
| scores | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| Scores() const | NeighborSearchRules< SortPolicy, MetricType, TreeType > | inline |
| Scores() | NeighborSearchRules< SortPolicy, MetricType, TreeType > | inline |
| TraversalInfo() const | NeighborSearchRules< SortPolicy, MetricType, TreeType > | inline |
| TraversalInfo() | NeighborSearchRules< SortPolicy, MetricType, TreeType > | inline |
| traversalInfo | NeighborSearchRules< SortPolicy, MetricType, TreeType > | protected |
| TraversalInfoType typedef | NeighborSearchRules< SortPolicy, MetricType, TreeType > | |
