e6ec42d462
* Fix trees parsing behavior in hierarchical_clustering_index: Before, when maxCheck was reached in the first descent of a tree, time was still wasted parsing the next trees till their best leaf, just to skip the points stored there. Now we can choose either to keep this behavior, and so we skip parsing other trees after reaching maxCheck, or we choose to do one descent in each tree, even if in one tree we reach maxCheck. * Apply the same change to kdtree. As each leaf contains only 1 point (unlike hierarchical_clustering), difference is visible if trees > maxCheck * Add the new explore_all_trees parameters to miniflann * Adapt the FlannBasedMatcher read_write test to the additional search parameter * Adapt java tests to the additional parameter in SearchParams * Fix the ABI dumps failure on SearchParams interface change * Support of ctor calling another ctor of the class is only fully supported from C+11 |
||
|---|---|---|
| .. | ||
| ocl | ||
| test_agast.cpp | ||
| test_akaze.cpp | ||
| test_brisk.cpp | ||
| test_descriptors_invariance.cpp | ||
| test_descriptors_invariance.impl.hpp | ||
| test_descriptors_regression.cpp | ||
| test_descriptors_regression.impl.hpp | ||
| test_detectors_invariance.cpp | ||
| test_detectors_invariance.impl.hpp | ||
| test_detectors_regression.cpp | ||
| test_detectors_regression.impl.hpp | ||
| test_drawing.cpp | ||
| test_fast.cpp | ||
| test_invariance_utils.hpp | ||
| test_keypoints.cpp | ||
| test_main.cpp | ||
| test_matchers_algorithmic.cpp | ||
| test_mser.cpp | ||
| test_nearestneighbors.cpp | ||
| test_orb.cpp | ||
| test_precomp.hpp | ||
| test_utils.cpp | ||