5
* fixed build breakage, to allow it to be buildable when UNIT_TEST
8
* fixed a crasher with MSVC when comparing iterators of empty
9
search_result instances.
13
* fixed a bug where de-referencing copied search_result iterators
14
would return an uninitialized node data.
5
* re-implemented the filled storage for better performance, with two
6
separate implementations for zero and emtpy matrix types. The
7
newer implementation should improve object creation time
20
* re-implemented the filled storage for better performance, with two
21
separate implementations for zero and emtpy matrix types. The
22
newer implementation should improve object creation time
12
27
* flat_segment_tree
14
* fixed a crash on assignment by properly implementing assignment
29
* fixed a crash on assignment by properly implementing assignment
17
32
* fixed several bugs in shift_right():
19
* shifting of all existing nodes was not handled properly.
34
* shifting of all existing nodes was not handled properly.
21
36
* leaf nodes were not properly linked under certain conditions.
23
* shifting with skip node option was not properly skipping the
24
node at insertion position when the insertion position was at
38
* shifting with skip node option was not properly skipping the
39
node at insertion position when the insertion position was at
27
* implemented min_key(), max_key(), default_value(), clear() and
42
* implemented min_key(), max_key(), default_value(), clear() and
30
* fixed a bug in operator==() where two different containers were
31
incorrectly evaluated to be equal.
45
* fixed a bug in operator==() where two different containers were
46
incorrectly evaluated to be equal.
33
48
* added quickcheck test code.
41
* flat_segment_tree's search methods now return a std::pair of
42
const_iterator and bool, instead of just returning bool.
56
* flat_segment_tree's search methods now return a std::pair of
57
const_iterator and bool, instead of just returning bool.
44
* fixed a weird enum value mis-handling with mixed_type_matrix when
59
* fixed a weird enum value mis-handling with mixed_type_matrix when
45
60
compiled with MSVC++.
47
* added new insert() method to flat_segment_tree that takes a
48
positional hint in order to speed up insertion speed. Also, all
49
three insert() methods now return the start position of the
50
segment that an inserted segment belongs to.
52
* slight performance improvement on the insert methods of
55
* slight performance improvement on the iterators of
58
* re-organized the structure of flat_segment_tree to split it into
62
* added new insert() method to flat_segment_tree that takes a
63
positional hint in order to speed up insertion speed. Also, all
64
three insert() methods now return the start position of the
65
segment that an inserted segment belongs to.
67
* slight performance improvement on the insert methods of
70
* slight performance improvement on the iterators of
73
* re-organized the structure of flat_segment_tree to split it into
61
76
* properly support prefix, docdir, includedir configure options.
63
* support DESTDIR environment variable for make install.
78
* support DESTDIR environment variable for make install.
80
95
* added example files on how to use these data structures.
82
* fixed a bug in segment_tree::search_result object, to make it work
83
with empty result set.
97
* fixed a bug in segment_tree::search_result object, to make it work
98
with empty result set.
85
* fixed segment_tree to make it really usable outside of unit test
100
* fixed segment_tree to make it really usable outside of unit test
92
107
* lots of code cleanups.
94
* support for search result iterator in segment_tree and
95
rectangle_set, for better search performance.
109
* support for search result iterator in segment_tree and
110
rectangle_set, for better search performance.
97
112
* implemented rectnagle_set.