Home
last modified time | relevance | path

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

/external/opencv3/modules/flann/include/opencv2/flann/
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()
Dkmeans_index.h499 int maxChecks = get_param(searchParams,"checks",32); in findNeighbors() local
501 if (maxChecks==FLANN_CHECKS_UNLIMITED) { in findNeighbors()
509 findNN(root_, result, vec, checks, maxChecks, heap); in findNeighbors()
512 while (heap->popMin(branch) && (checks<maxChecks || !result.full())) { in findNeighbors()
514 findNN(node, result, vec, checks, maxChecks, heap); in findNeighbors()
892 …sNodePtr node, ResultSet<DistanceType>& result, const ElementType* vec, int& checks, int maxChecks, in findNN() argument
911 if (checks>=maxChecks) { in findNN()
925 findNN(node->childs[closest_center],result,vec, checks, maxChecks, heap); in findNN()
Dkdtree_index.h201 int maxChecks = get_param(searchParams,"checks", 32); in findNeighbors() local
204 if (maxChecks==FLANN_CHECKS_UNLIMITED) { in findNeighbors()
208 getNeighbors(result, vec, maxChecks, epsError); in findNeighbors()
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/
DGraggBulirschStoerIntegrator.java122 private int maxChecks; field in GraggBulirschStoerIntegrator
222 this.maxChecks = (maxNumChecks <= 0) ? 1 : maxNumChecks; in setStabilityCheck()
495 if (performTest && (j <= maxChecks) && (k < maxIter)) { in tryStep()