Home
last modified time | relevance | path

Searched refs:BranchSt (Results 1 – 4 of 4) sorted by relevance

/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/
H A Dkdtree_index.h242 typedef BranchStruct<NodePtr, DistanceType> BranchSt; typedef
243 typedef BranchSt* Branch;
445 BranchSt branch; in getNeighbors()
448 Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_); in getNeighbors()
473 float epsError, Heap<BranchSt>* heap, DynamicBitset& checked) in searchLevel()
514 heap->insert( BranchSt(otherChild, new_distsq) ); in searchLevel()
H A Dhierarchical_clustering_index.h553 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()
H A Dkmeans_index.h508 Heap<BranchSt>* heap = new Heap<BranchSt>((int)size_); in findNeighbors()
513 BranchSt branch; in findNeighbors()
607 typedef BranchStruct<KMeansNodePtr, DistanceType> BranchSt; typedef
897 Heap<BranchSt>* heap) in findNN()
941 …hes(KMeansNodePtr node, const ElementType* q, DistanceType* domain_distances, Heap<BranchSt>* heap) in exploreNodeBranches()
962 heap->insert(BranchSt(node->childs[i],domain_distances[i])); in exploreNodeBranches()
H A Dkdtree_single_index.h284 typedef BranchStruct<NodePtr, DistanceType> BranchSt; typedef
285 typedef BranchSt* Branch;