NodePtr 388 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h root = new NodePtr[trees_]; NodePtr 523 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h root = new NodePtr[trees_]; NodePtr 563 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h NodePtr node = branch.node; NodePtr 617 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h void save_tree(FILE* stream, NodePtr node, int num) NodePtr 632 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h void load_tree(FILE* stream, NodePtr& node, int num) NodePtr 642 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs = pool.allocate<NodePtr>(branching_); NodePtr 681 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h void computeClustering(NodePtr node, int* dsindices, int indices_length, int branching, int level) NodePtr 711 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs = pool.allocate<NodePtr>(branching); NodePtr 746 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h void findNN(NodePtr node, ResultSet<DistanceType>& result, const ElementType* vec, int& checks, int maxChecks, NodePtr 810 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h NodePtr* root; NodePtr 92 modules/flann/include/opencv2/flann/kdtree_index.h tree_roots_ = new NodePtr[trees_]; NodePtr 156 modules/flann/include/opencv2/flann/kdtree_index.h tree_roots_ = new NodePtr[trees_]; NodePtr 242 modules/flann/include/opencv2/flann/kdtree_index.h void save_tree(FILE* stream, NodePtr tree) NodePtr 254 modules/flann/include/opencv2/flann/kdtree_index.h void load_tree(FILE* stream, NodePtr& tree) NodePtr 276 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr divideTree(int* ind, int count) NodePtr 278 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr node = pool_.allocate<Node>(); // allocate memory NodePtr 467 modules/flann/include/opencv2/flann/kdtree_index.h void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, NodePtr node, DistanceType mindist, int& checkCount, int maxCheck, NodePtr 495 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr bestChild = (diff < 0) ? node->child1 : node->child2; NodePtr 496 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr otherChild = (diff < 0) ? node->child2 : node->child1; NodePtr 519 modules/flann/include/opencv2/flann/kdtree_index.h void searchLevelExact(ResultSet<DistanceType>& result_set, const ElementType* vec, const NodePtr node, DistanceType mindist, const float epsError) NodePtr 532 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr bestChild = (diff < 0) ? node->child1 : node->child2; NodePtr 533 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr otherChild = (diff < 0) ? node->child2 : node->child1; NodePtr 603 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr* tree_roots_; NodePtr 289 modules/flann/include/opencv2/flann/kdtree_single_index.h void save_tree(FILE* stream, NodePtr tree) NodePtr 301 modules/flann/include/opencv2/flann/kdtree_single_index.h void load_tree(FILE* stream, NodePtr& tree) NodePtr 339 modules/flann/include/opencv2/flann/kdtree_single_index.h NodePtr divideTree(int left, int right, BoundingBox& bbox) NodePtr 341 modules/flann/include/opencv2/flann/kdtree_single_index.h NodePtr node = pool_.allocate<Node>(); // allocate memory NodePtr 542 modules/flann/include/opencv2/flann/kdtree_single_index.h void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, const NodePtr node, DistanceType mindistsq, NodePtr 564 modules/flann/include/opencv2/flann/kdtree_single_index.h NodePtr bestChild; NodePtr 565 modules/flann/include/opencv2/flann/kdtree_single_index.h NodePtr otherChild; NodePtr 616 modules/flann/include/opencv2/flann/kdtree_single_index.h NodePtr root_node_;