Sébastien Loriot 961b9d8557 add empty() method to kdtree ... handle case when kdtree is empty for all 4 nearest neighbor search method correct sort method of bounded_priority_queue (was sorting the complete vector even if not full) ==> fix the crash when k > nb input points Modify test suite to handle these particular cases		2010-05-11 12:52:53 +00:00
..
Building_kd_tree_with_ddim_points.cpp	cleanup extra ';'	2010-04-24 09:32:31 +00:00
Building_kd_tree_with_own_pointtype.cpp	* replaced CGAL_test_assert with ::assert, instead of CGAL_assertion	2008-03-19 13:45:36 +00:00
Circular_query.cpp	* replaced CGAL_test_assert with ::assert, instead of CGAL_assertion	2008-03-19 13:45:36 +00:00
Compare_methods.cpp	add empty() method to kdtree	2010-05-11 12:52:53 +00:00
Distance.h	…
Iso_rectangle_2_query.cpp	* replaced CGAL_test_assert with ::assert, instead of CGAL_assertion	2008-03-19 13:45:36 +00:00
K_neighbor_search_manhattan_distance_isobox_point.cpp	unsigned K parameter in orthogonal search	2008-07-27 16:46:13 +00:00
K_neighbor_search_with_circle.cpp	cleanup extra ';'	2010-04-24 09:32:31 +00:00
Orthogonal_incremental_neighbor_search.cpp	Replace Protect_FPU_rounding<true> pfr(CGAL_FE_TONEAREST)	2008-12-03 21:42:28 +00:00
Orthogonal_k_neighbor_search.cpp	unsigned K parameter in orthogonal search	2008-07-27 16:46:13 +00:00
Point.h	…
Range_searching.cpp	* replaced CGAL_test_assert with ::assert, instead of CGAL_assertion	2008-03-19 13:45:36 +00:00
Splitters.cpp	Replace Protect_FPU_rounding<true> pfr(CGAL_FE_TONEAREST)	2008-12-03 21:42:28 +00:00