BranchSt          553 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h         Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_);
BranchSt          561 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h         BranchSt branch;
BranchSt          747 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h                 Heap<BranchSt>* heap, std::vector<bool>& checked)
BranchSt          775 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h                     heap->insert(BranchSt(node->childs[i],domain_distances[i]));
BranchSt          238 modules/flann/include/opencv2/flann/kdtree_index.h     typedef BranchSt* Branch;
BranchSt          440 modules/flann/include/opencv2/flann/kdtree_index.h         BranchSt branch;
BranchSt          443 modules/flann/include/opencv2/flann/kdtree_index.h         Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_);
BranchSt          468 modules/flann/include/opencv2/flann/kdtree_index.h                      float epsError, Heap<BranchSt>* heap, DynamicBitset& checked)
BranchSt          509 modules/flann/include/opencv2/flann/kdtree_index.h             heap->insert( BranchSt(otherChild, new_distsq) );
BranchSt          284 modules/flann/include/opencv2/flann/kdtree_single_index.h     typedef BranchSt* Branch;
BranchSt          506 modules/flann/include/opencv2/flann/kmeans_index.h             Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_);
BranchSt          511 modules/flann/include/opencv2/flann/kmeans_index.h             BranchSt branch;
BranchSt          893 modules/flann/include/opencv2/flann/kmeans_index.h                 Heap<BranchSt>* heap)
BranchSt          937 modules/flann/include/opencv2/flann/kmeans_index.h     int exploreNodeBranches(KMeansNodePtr node, const ElementType* q, DistanceType* domain_distances, Heap<BranchSt>* heap)
BranchSt          958 modules/flann/include/opencv2/flann/kmeans_index.h                 heap->insert(BranchSt(node->childs[i],domain_distances[i]));