| addSubtree(const KDTreeNodeT< DATA, DIM > *current) | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inlineprivate |
| build(std::vector< KDTreeNodeInfoT< DATA, DIM >> &eltList, const KDTreeBoxT< DIM > ®ion) | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inline |
| clear() | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inline |
| clearTree() | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inlineprivate |
| closestNeighbour | lar_content::KDTreeLinkerAlgo< DATA, DIM > | private |
| dist2(const KDTreeNodeInfoT< DATA, DIM > &a, const KDTreeNodeInfoT< DATA, DIM > &b) const | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inlineprivate |
| empty() | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inline |
| findNearestNeighbour(const KDTreeNodeInfoT< DATA, DIM > &point, const KDTreeNodeInfoT< DATA, DIM > *&result, float &distance) | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inline |
| getNextNode() | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inlineprivate |
| initialEltList | lar_content::KDTreeLinkerAlgo< DATA, DIM > | private |
| KDTreeLinkerAlgo() | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inline |
| medianSearch(int low, int high, int treeDepth) | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inlineprivate |
| nodePool_ | lar_content::KDTreeLinkerAlgo< DATA, DIM > | private |
| nodePoolPos_ | lar_content::KDTreeLinkerAlgo< DATA, DIM > | private |
| nodePoolSize_ | lar_content::KDTreeLinkerAlgo< DATA, DIM > | private |
| recBuild(int low, int high, int depth, const KDTreeBoxT< DIM > ®ion) | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inlineprivate |
| recNearestNeighbour(unsigned depth, const KDTreeNodeT< DATA, DIM > *current, const KDTreeNodeInfoT< DATA, DIM > &point, const KDTreeNodeT< DATA, DIM > *&best_match, float &best_dist) | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inlineprivate |
| recSearch(const KDTreeNodeT< DATA, DIM > *current, const KDTreeBoxT< DIM > &trackBox) | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inlineprivate |
| root_ | lar_content::KDTreeLinkerAlgo< DATA, DIM > | private |
| search(const KDTreeBoxT< DIM > &searchBox, std::vector< KDTreeNodeInfoT< DATA, DIM >> &resRecHitList) | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inline |
| size() | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inline |
| ~KDTreeLinkerAlgo() | lar_content::KDTreeLinkerAlgo< DATA, DIM > | inline |