Searched refs:BranchSt (Results 1 – 4 of 4) sorted by relevance
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| D | kdtree_index.h | 237 typedef BranchStruct<NodePtr, DistanceType> BranchSt; typedef
238 typedef BranchSt* Branch;
440 BranchSt branch; in getNeighbors()
443 Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_); in getNeighbors()
468 float epsError, Heap<BranchSt>* heap, DynamicBitset& checked) in searchLevel()
509 heap->insert( BranchSt(otherChild, new_distsq) ); in searchLevel()
|
| D | hierarchical_clustering_index.h | 553 Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_); in findNeighbors()
561 BranchSt branch; in findNeighbors()
613 typedef BranchStruct<NodePtr, DistanceType> BranchSt; typedef
747 Heap<BranchSt>* heap, std::vector<bool>& checked) in findNN()
775 heap->insert(BranchSt(node->childs[i],domain_distances[i])); in findNN()
|
| D | kmeans_index.h | 506 Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_); in findNeighbors()
511 BranchSt branch; in findNeighbors()
605 typedef BranchStruct<KMeansNodePtr, DistanceType> BranchSt; typedef
893 Heap<BranchSt>* heap) in findNN()
937 …hes(KMeansNodePtr node, const ElementType* q, DistanceType* domain_distances, Heap<BranchSt>* heap) in exploreNodeBranches()
958 heap->insert(BranchSt(node->childs[i],domain_distances[i])); in exploreNodeBranches()
|
| D | kdtree_single_index.h | 283 typedef BranchStruct<NodePtr, DistanceType> BranchSt; typedef
284 typedef BranchSt* Branch;
|