| 1 |
libkdtree++ NEWS |
| 2 |
================ |
| 3 |
|
| 4 |
17 Nov 2008: |
| 5 |
Again, it's almost Christmas. Recently a whole lot of bug have been fixed in |
| 6 |
version 0.6.3 of the library. You can find a summary of the fixes in the |
| 7 |
Changelog. For short: |
| 8 |
- you can now assign an existing tree to another tree without an ugly bug if |
| 9 |
your tree required parameters for the accessor, |
| 10 |
- now you can finally use the reverse iterator, |
| 11 |
- find() and erase() work properly based on the location given in argument, |
| 12 |
- the project is compatible with MSVC2005 |
| 13 |
- many more... |
| 14 |
|
| 15 |
02 Dec 2007: |
| 16 |
It's Christmas, and libkdtree++ packs in more power for the find |
| 17 |
and find_nearest functions. Performance improvement should be |
| 18 |
carried on with other part of the interface in the coming months. |
| 19 |
|
| 20 |
As a result of these modification, KDTree definition has been a |
| 21 |
little altered. The new definition includes a template for a |
| 22 |
distance calculator. This functor by default calcultes the square |
| 23 |
of th difference between two elements returned by the accessor. |
| 24 |
|
| 25 |
29 Sep 2007: |
| 26 |
Sylvain Bougerel spent some time cleaning up the code and build |
| 27 |
infrastructure of the code from Sourceforge, and I imported the |
| 28 |
results of his work to a git repository on git.debian.org today. |
| 29 |
|
| 30 |
http://git.debian.org/?p=libkdtree/libkdtree.git;a=summary |
| 31 |
|
| 32 |
Martin F. Krafft <[email protected]> |