| buildTree(size_t count, size_t *pIndexes) | GClasses::GKdTree | |
| canGeneralize() | GClasses::GNeighborFinderGeneralizing | inlinevirtual |
| computePivotAndGoodness(size_t count, size_t *pIndexes, size_t attr, double *pOutPivot, double *pOutGoodness) | GClasses::GKdTree | protected |
| data() | GClasses::GNeighborFinder | inline |
| distance(size_t i) | GClasses::GNeighborFinderGeneralizing | inlinevirtual |
| findNearest(size_t k, size_t index) | GClasses::GKdTree | virtual |
| findNearest(size_t k, const GVec &vector) | GClasses::GKdTree | virtual |
| findNearest(size_t k, const GVec &vec, size_t nExclude) | GClasses::GKdTree | protected |
| findWithinRadius(double squaredRadius, size_t index) | GClasses::GKdTree | virtual |
| findWithinRadius(double squaredRadius, const GVec &vector) | GClasses::GKdTree | virtual |
| findWithinRadius(double squaredRadius, const GVec &vec, size_t nExclude) | GClasses::GKdTree | protected |
| GKdTree(const GMatrix *pData, GDistanceMetric *pMetric=NULL, bool ownMetric=false) | GClasses::GKdTree | |
| GNeighborFinder(const GMatrix *pData) | GClasses::GNeighborFinder | inline |
| GNeighborFinderGeneralizing(const GMatrix *pData, GDistanceMetric *pMetric=NULL, bool ownMetric=false) | GClasses::GNeighborFinderGeneralizing | |
| insertionSortNeighbors(size_t start, size_t end) | GClasses::GNeighborFinderGeneralizing | protected |
| isCached() | GClasses::GNeighborFinder | inlinevirtual |
| isGreaterOrEqual(const double *pPat, size_t attr, double pivot) | GClasses::GKdTree | |
| m_dists | GClasses::GNeighborFinderGeneralizing | protected |
| m_maxLeafSize | GClasses::GKdTree | protected |
| m_neighs | GClasses::GNeighborFinderGeneralizing | protected |
| m_ownMetric | GClasses::GNeighborFinderGeneralizing | protected |
| m_pData | GClasses::GNeighborFinder | protected |
| m_pMetric | GClasses::GNeighborFinderGeneralizing | protected |
| m_pRoot | GClasses::GKdTree | protected |
| m_size | GClasses::GKdTree | protected |
| medianDistanceToNeighbor(GMatrix &data, size_t n) | GClasses::GKdTree | static |
| metric() | GClasses::GNeighborFinderGeneralizing | inline |
| neighbor(size_t i) | GClasses::GNeighborFinderGeneralizing | inlinevirtual |
| reoptimize() | GClasses::GKdTree | virtual |
| root() | GClasses::GKdTree | inline |
| setMaxLeafSize(size_t n) | GClasses::GKdTree | inline |
| sortNeighbors(size_t start=0, size_t end=INVALID_INDEX) | GClasses::GNeighborFinderGeneralizing | |
| splitIndexes(size_t count, size_t *pIndexes, size_t attr, double pivot) | GClasses::GKdTree | protected |
| test() | GClasses::GKdTree | static |
| ~GKdTree() | GClasses::GKdTree | virtual |
| ~GNeighborFinder() | GClasses::GNeighborFinder | inlinevirtual |
| ~GNeighborFinderGeneralizing() | GClasses::GNeighborFinderGeneralizing | virtual |
1.8.11