KDTree             62 modules/ml/src/kdtree.cpp KDTree::KDTree()
KDTree             68 modules/ml/src/kdtree.cpp KDTree::KDTree(InputArray _points, bool _copyData)
KDTree             75 modules/ml/src/kdtree.cpp KDTree::KDTree(InputArray _points, InputArray _labels, bool _copyData)
KDTree            158 modules/ml/src/kdtree.cpp void KDTree::build(InputArray _points, bool _copyData)
KDTree            164 modules/ml/src/kdtree.cpp void KDTree::build(InputArray __points, InputArray __labels, bool _copyData)
KDTree            168 modules/ml/src/kdtree.cpp     std::vector<KDTree::Node>().swap(nodes);
KDTree            274 modules/ml/src/kdtree.cpp int KDTree::findNearest(InputArray _vec, int K, int emax,
KDTree            417 modules/ml/src/kdtree.cpp void KDTree::findOrthoRange(InputArray _lowerBound,
KDTree            474 modules/ml/src/kdtree.cpp void KDTree::getPoints(InputArray _idx, OutputArray _pts, OutputArray _labels) const
KDTree            519 modules/ml/src/kdtree.cpp const float* KDTree::getPoint(int ptidx, int* label) const
KDTree            528 modules/ml/src/kdtree.cpp int KDTree::dims() const
KDTree             56 modules/ml/src/kdtree.hpp     CV_WRAP KDTree();
KDTree             58 modules/ml/src/kdtree.hpp     CV_WRAP KDTree(InputArray points, bool copyAndReorderPoints = false);
KDTree             60 modules/ml/src/kdtree.hpp     CV_WRAP KDTree(InputArray points, InputArray _labels,
KDTree            430 modules/ml/src/knearest.cpp     KDTree tr;