This is purely a bug fix release, and contain no new functionality
since 0.6.0.
This release fixes a bug in the iterator implementation of
flat_segment_tree. Prior to this release, the iterator would treat
the position immediately before the end position to be the end
position, which would result in incorrectly skipping the last data
position during iteration. This release contains a fix for that
bug.
It also contains fixes for various build errors and compiler
warnings.
Many thanks to David Tardon, Stephan Bergmann, Tomáš Chvátal,
and Markus Mohrhard for having submitted patches since the release
of 0.6.0.
mdds 0.6.0
* all
* added MSVS Solution file, to make it easier to build unit test
programs on Windows.
* mixed_type_matrix
* improved performance of size() method by caching it.
* multi_type_vector (new)
* new data structure to support efficient storage of data of different
types.
* multi_type_matrix (new)
* new data structure to eventually replace mixed_type_matrix. It uses
multi_type_vector as its backend storage.
mdds 0.5.4
* segment_tree
* fixed build breakage, to allow it to be buildable when UNIT_TEST
is not defined.
* fixed a crasher with MSVC when comparing iterators of empty
search_result instances.
* point_quad_tree
* fixed a bug where de-referencing copied search_result iterators
would return an uninitialized node data.
mdds 0.5.3
* mixed_type_matrix
* re-implemented the filled storage for better performance, with two
separate implementations for zero and emtpy matrix types. The
newer implementation should improve object creation time
considerably.
mdds 0.5.2
* flat_segment_tree
* fixed a crash on assignment by properly implementing assignment
operator().
* fixed several bugs in shift_right():
* shifting of all existing nodes was not handled properly.
* leaf nodes were not properly linked under certain conditions.
* shifting with skip node option was not properly skipping the
node at insertion position when the insertion position was at
the leftmost node.
* implemented min_key(), max_key(), default_value(), clear() and
swap().
* fixed a bug in operator==() where two different containers were
incorrectly evaluated to be equal.
* added quickcheck test code.
Multi-Dimensional Data Structure (mdds)
A collection of multi-dimensional data structure and indexing algorithm.
It implements the following data structure:
* flat segment tree
* segment tree
* rectangle set
