Change Log

Table of Contents

• Version 2.1.8
• Version 2.1.7
• Version 2.1.6
• Version 2.1.5
• Version 2.1.4
• Version 2.1.3
• Version 2.1.2
• Version 2.1.1
• Version 2.1.0
• Version 2.0.1
• Version 2.0.0
• Version 1.0.0 (unsupported)

Version 2.1.8

• Fixed Ticket #5 and Ticket #4 raised by Michał Garapich. Thanks for supporting the library by contributing bugs.

Version 2.1.7

• Greatly improves performance of nearest neighbor search and iteration on nearest neighbors; between 5 to 100 times. Major improvements to mapping iterators too, which improve insertion/removal times in the kd-tree. Major improvement on finding equals or simply find() in containers. Note: euclidian metric now uses a naive (but faster) computation instead of the hypot algorithm by default. Use SPATIAL_SAFE_ARITHMETICS to use the hypot algorithm.

Version 2.1.6

• Ticket #2 (https://sourceforge.net/p/spatial/tickets/2/) reported by Ed Baskerville has been solved. To solve it, C++11 support for compilation has been added to the library for Clang++ and G++. Additionally support for libc++ and Clang++ has also been added. Note that C++11 support only means it compiles when the compiler is set to be compliant with C++11. The library's API has yet so support new semantics such as rvalues, initialization lists, etc.

Version 2.1.5

• Ticket #3 (https://sourceforge.net/p/spatial/tickets/3/) reported by Michał Garapich has been solved. neighbor_iterator can now be used with const containers, as expected. Thanks for reporting the issue.

Version 2.1.4

• The mapping iterator is now dissociated from the containers, its header file and definition will not be pulled by default anymore when the containers include file are specified. So its include file "spatial/mapping_iterator.hpp" must be specified.
• A minor update for the developments on the feature_4 branch with improvements on the performance of the mapping iterator and the erase function for the idle_* family of containers.

Version 2.1.3

• Thanks to user Feldmarshall for reporting the bug: https://sourceforge.net/p/spatial/tickets/1/. Fixed in this version.

Version 2.1.2

• spatial::idle_point_multiset, spatial::idle_box_multiset and other non-rebalancing containers have the performance of the rebalance() function improved by 5 to 10 times.
• For rebalancing containers such as spatial::point_multiset, spatial::box_multiset, a new rebalancing policy called perfect_balancing. As its name implies, it attempts to balance the tree near perfectly.

Version 2.1.1

• spatial::idle_point_multiset, spatial::idle_box_multiset and other non-rebalancing containers where suffering from a bug on the rebalance() function that was only discovered recently. The problem only occurs in very large tree (with around 1,000,000 elements).

Version 2.1.0

• spatial::equal_iterator was rewritten independantly from spatial::region_iterator. This means that you can't call the predicate() accessors from spatial::region_iterator. This has been replaced by the model() and key_comp() accessors. The rest of the interface remains similar, and unless you were using predicate(), the changes will apply transparently.

Version 2.0.1

• Some minor improvements to documentation and examples. Plus some addition of tests and fixes.

Version 2.0.0

• This is version 2 of the library and since it's a major number update, it means it breaks compatibility with version 1.0.0. If you are using version 1.0.0, you should know that:
  • The default containers spatial::point_multiset, spatial::point_multimap, spatial::box_multiset, spatial::box_multimap are auto-rebalancing now. To use the non re-balancing version, refer to spatial::idle_point_multiset, spatial::idle_point_multimap, spatial::idle_box_multiset, spatial::idle_box_multimap.
  • sptial::pointset is now called spatial::point_multiset to reflect truly it's equivalence to multiset, and not set. Similar changes for spatial::box_multiset.
  • spatial::box_multiset (formerly spatial::boxset) does not multiply the dimension specified by 2 anymore. Instead it uses concept checking to make sure that the dimension given is even.
  • frozen containers are now renamed to idle, its functions are the same, but idle just take less characters to write, and provides a more accurate picture to programmers ('frozen' is often used to describe unmutable objects)
  • iterators have been vastly changed: their interface is now consistent, and the neighbor iterator works now correctly on MSVC9+. The design used for iterators resemble the design of Boost.Range, e.g: spatial::mapping_iterator, spatial::region_iterator, etc.
  • views have simply been removed. They were clumsily written and presented maintenance burden while providing strictly no advantage over the bare iterators. All their functions have been put in the global spatial namespace, e.g: spatial::mapping_begin(), spatial::region_range(), etc. The new interface is much more elegant and in line with the STL design.
  • range iterators have been renamed to spatial::region_iterator, because you can now request for a spatial::region_range() which returns a pair of iterators spatial::region_iterator_pair
  • a new set of iterator called spatial::ordered_iterator have been created, and they iterate all nodes in the tree in deterministic fashion, so that 2 trees build differently but containing the same values will be iterated in the same sequence

Version 1.0.0 (unsupported)

• First version, that is now unsupported, with:
  • multi-dimension template containers with unlimited number of dimensions to store points in space,
  • dimensions may be of different types,
  • static or dynamic time determination of the number of dimensions,
  • amortized complexity on insertion and removal,
  • use custom predicate to define a range of elements,
  • STL-compatible iterators that go over that range of elements,
  • flexible definition of a metric space for elements in the container,
  • STL-compatible iterators going from the nearest to the furthest neighbor of a point according to the metric space applied.
• Documentation
• Examples