Searched refs:epsError (Results 1 – 2 of 2) sorted by relevance
/external/opencv3/modules/flann/include/opencv2/flann/ |
D | kdtree_index.h | 202 float epsError = 1+get_param(searchParams,"eps",0.0f); in findNeighbors() local 205 getExactNeighbors(result, vec, epsError); in findNeighbors() 208 getNeighbors(result, vec, maxChecks, epsError); in findNeighbors() 419 void getExactNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, float epsError) in getExactNeighbors() argument 427 searchLevelExact(result, vec, tree_roots_[0], 0.0, epsError); in getExactNeighbors() 437 …getNeighbors(ResultSet<DistanceType>& result, const ElementType* vec, int maxCheck, float epsError) in getNeighbors() argument 448 … searchLevel(result, vec, tree_roots_[i], 0, checkCount, maxCheck, epsError, heap, checked); in getNeighbors() 453 …searchLevel(result, vec, branch.node, branch.mindist, checkCount, maxCheck, epsError, heap, checke… in getNeighbors() 468 float epsError, Heap<BranchSt>* heap, DynamicBitset& checked) in searchLevel() argument 508 if ((new_distsq*epsError < result_set.worstDist())|| !result_set.full()) { in searchLevel() [all …]
|
D | kdtree_single_index.h | 243 float epsError = 1+get_param(searchParams,"eps",0.0f); in findNeighbors() local 247 searchLevel(result, vec, root_node_, distsq, dists, epsError); in findNeighbors() 543 std::vector<DistanceType>& dists, const float epsError) in searchLevel() argument 579 searchLevel(result_set, vec, bestChild, mindistsq, dists, epsError); in searchLevel() 584 if (mindistsq*epsError<=result_set.worstDist()) { in searchLevel() 585 searchLevel(result_set, vec, otherChild, mindistsq, dists, epsError); in searchLevel()
|