9d8a02aa46
rephrased documentation for capacity in Kd_tree
2014-03-28 14:50:18 +01:00
98e6007dd3
* Added the capacity() function to the Kd_tree.h and also added its documentation
...
* Added a test that checks the reserve() and capacity() function for Kd_tree
2014-03-26 18:02:04 +01:00
85894658ef
fixed copyright headers
2014-03-10 00:03:24 +01:00
1c355ef42a
1. "Snap_rounding_traits_2.h" "Snap_rounding_kd_2.h" "Kd_tree.h" "snap_rounding_data.cpp", Changed the File header signature to match the templated signatures.
...
2. Made the required changes in the concepts i.e. in "Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h"
3. Added documentation for the reserve() method of Kd_tree
4. Deleted the un maintained olk kd_tree package
2014-03-07 16:13:44 +01:00
0e14493632
1. "snap_rounding_data.cpp" Added Example usage in-code documentation. Removed the timer that recorded the amount of time taken by the snap_rounding. The timer was initally added to test the snap rounding running time difference using new Kd_trees
...
2. "Snap_rounding_kd_2.h" "Snap_rounding_traits_2.h" Added documentation and changed Copyright information and authors appropriately.
3. "kd_tree.h" Renamed the reserve_to_capacity() to reserve().
4. Snap_rounding_kd_new.h deleted
2014-03-01 18:58:40 +01:00
b46b37e7b2
reserve_to_capacity() method for Kd_tree.h that pre-allocated memory for points added. New Snap_rounding example added where the input data is taken from a file. Snap_rounding_kd_2.h modified to use the reserve_to_capacity method before creating the kd_tree. This improves the running time.
2014-02-18 01:41:44 +01:00
8f59fd9592
Turn QPL into LGPLv3+
2012-01-13 16:33:35 +00:00
28cac7eaaa
Introduce size_type as return type for Kd_tree::size()
2011-11-21 12:47:57 +00:00
751f3ba08b
the class Kd_tree is now read-only thread-safe using a mutex.
2011-09-08 16:12:51 +00:00
37b02012b6
fix const-correctness issue in the spatial searching package. In particular this
...
remove all mutable member variable and leave only one const_cast in the kd-kdtree private function
const_build. This function is called in const predicates when the tree is not already internally built.
The documentation has been update and a few typos fixed at the same time.
2011-09-07 09:04:52 +00:00
369498d1e5
Cancel revision 64607. There had been a problem with the branch.
...
| ------------------------------------------------------------------------
| r64607 | efif | 2011-07-05 17:27:04 +0200 (Tue, 05 Jul 2011) | 1 line
|
| Merged feature-branch Aos_2-new_functors-tau into next
| ------------------------------------------------------------------------
2011-07-06 11:11:58 +00:00
0c7b263dee
avoid log N reallocation steps when inserting N objects in a std::vector and add typedef Traits
2010-09-23 13:52:01 +00:00
975843b44e
add clear function that was documented but not implemented
2010-08-18 08:41:40 +00:00
8f720d178f
int -> size_t
2010-06-22 10:34:02 +00:00
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
ef264999b3
Renaming of Compact_container's construct_insert() to emplace() to match C++0x.
...
It breaks backward compat, but I doubt many people use Compact_container directly.
Make it use variadic templates, while at it.
2007-10-20 20:51:59 +00:00
88d0413012
allow empty tree and fix search for empty tree
2007-05-02 08:28:37 +00:00
db6a8f948c
Change CVS keywords to SVN style
2006-02-16 14:30:13 +00:00
1aad55d4cb
Change CVS keywords to SVN style
2006-02-14 10:08:15 +00:00
091f0804c0
Move packages to trunk root
2006-02-14 08:58:19 +00:00
Eric Berberich
Waqar Khan
Laurent Rineau
Andreas Fabri
Sébastien Loriot
Sylvain Pion
Laurent Saboret