_dims | KDTreeSpace::KDTree< KE, VTYPE > | private |
_leftKD | KDTreeSpace::KDTree< KE, VTYPE > | private |
_pivot | KDTreeSpace::KDTree< KE, VTYPE > | private |
_rightKD | KDTreeSpace::KDTree< KE, VTYPE > | private |
_splitDim | KDTreeSpace::KDTree< KE, VTYPE > | private |
BestMatchLimitedSet_t typedef | KDTreeSpace::KDTree< KE, VTYPE > | |
BestMatchSet_t typedef | KDTreeSpace::KDTree< KE, VTYPE > | |
calcSqDist(const KE *i1, const KE *i2) | KDTreeSpace::KDTree< KE, VTYPE > | |
choosePivot(const ItemPtrVector_t &iElemsPtrList) | KDTreeSpace::KDTree< KE, VTYPE > | private |
getNearestNeighboursBBF(const KE &iTarget, int iNbBestMatches, int iNbSearchSteps) | KDTreeSpace::KDTree< KE, VTYPE > | |
init(const ItemPtrVector_t &iElemsPtrList) | KDTreeSpace::KDTree< KE, VTYPE > | private |
ItemPtrVector_t typedef | KDTreeSpace::KDTree< KE, VTYPE > | |
ItemPtrVectorIt_t typedef | KDTreeSpace::KDTree< KE, VTYPE > | |
ItemVector_t typedef | KDTreeSpace::KDTree< KE, VTYPE > | |
ItemVectorIt_t typedef | KDTreeSpace::KDTree< KE, VTYPE > | |
KDTree(const ItemVector_t &iElemsList, int iDimensions) | KDTreeSpace::KDTree< KE, VTYPE > | |
KDTree(const ItemPtrVector_t &iElemsPtrList, int iDimensions) | KDTreeSpace::KDTree< KE, VTYPE > | |
QueueEntryList_t typedef | KDTreeSpace::KDTree< KE, VTYPE > | |
recurseNearestNeighboursBBF(const KE &iTarget, HyperRectangle< KE, VTYPE > &iHR, BestMatchLimitedSet_t &ioBestMatches, QueueEntryList_t &ioSearchQueue, int &ioRemainingUnqueues) | KDTreeSpace::KDTree< KE, VTYPE > | private |
~KDTree() | KDTreeSpace::KDTree< KE, VTYPE > | |