Home
last modified time | relevance | path

Searched refs:maxChecks (Results 1 – 3 of 3) sorted by relevance

/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/
H A Dhierarchical_clustering_index.h550 int maxChecks = get_param(searchParams,"checks",32); in findNeighbors() local
558 findNN(root[i], result, vec, checks, maxChecks, heap, checked); in findNeighbors()
562 while (heap->popMin(branch) && (checks<maxChecks || !result.full())) { in findNeighbors()
564 findNN(node, result, vec, checks, maxChecks, heap, checked); in findNeighbors()
746 …(NodePtr node, ResultSet<DistanceType>& result, const ElementType* vec, int& checks, int maxChecks, in findNN() argument
750 if (checks>=maxChecks) { in findNN()
779 findNN(node->childs[best_index],result,vec, checks, maxChecks, heap, checked); in findNN()
H A Dkmeans_index.h501 int maxChecks = get_param(searchParams,"checks",32); in findNeighbors() local
503 if (maxChecks==FLANN_CHECKS_UNLIMITED) { in findNeighbors()
511 findNN(root_, result, vec, checks, maxChecks, heap); in findNeighbors()
514 while (heap->popMin(branch) && (checks<maxChecks || !result.full())) { in findNeighbors()
516 findNN(node, result, vec, checks, maxChecks, heap); in findNeighbors()
896 …sNodePtr node, ResultSet<DistanceType>& result, const ElementType* vec, int& checks, int maxChecks, in findNN() argument
915 if (checks>=maxChecks) { in findNN()
929 findNN(node->childs[closest_center],result,vec, checks, maxChecks, heap); in findNN()
H A Dkdtree_index.h206 int maxChecks = get_param(searchParams,"checks", 32); in findNeighbors() local
209 if (maxChecks==FLANN_CHECKS_UNLIMITED) { in findNeighbors()
213 getNeighbors(result, vec, maxChecks, epsError); in findNeighbors()