• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1
2[/ Copyright 2008 Daniel James.
3 / Distributed under the Boost Software License, Version 1.0. (See accompanying
4 / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
5
6[template ticket[number]'''<ulink
7    url="https://svn.boost.org/trac/boost/ticket/'''[number]'''">'''#[number]'''</ulink>''']
8
9[template pull_request[number][@https://github.com/boostorg/unordered/pull/[number] GitHub #[number]]]
10
11[section:changes Change Log]
12
13[h2 Review Version]
14
15Initial review version, for the review conducted from 7th December 2007 to
1616th December 2007.
17
18[h2 1.35.0 Add-on - 31st March 2008]
19
20Unofficial release uploaded to vault, to be used with Boost 1.35.0. Incorporated
21many of the suggestions from the review.
22
23* Improved portability thanks to Boost regression testing.
24* Fix lots of typos, and clearer text in the documentation.
25* Fix floating point to `std::size_t` conversion when calculating sizes from
26  the max load factor, and use `double` in the calculation for greater accuracy.
27* Fix some errors in the examples.
28
29[h2 Boost 1.36.0]
30
31First official release.
32
33* Rearrange the internals.
34* Move semantics - full support when rvalue references are available, emulated
35  using a cut down version of the Adobe move library when they are not.
36* Emplace support when rvalue references and variadic template are available.
37* More efficient node allocation when rvalue references and variadic template
38  are available.
39* Added equality operators.
40
41[h2 Boost 1.37.0]
42
43* Rename overload of `emplace` with hint, to `emplace_hint` as specified in
44  [@http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2008/n2691.pdf n2691].
45* Provide forwarding headers at `<boost/unordered/unordered_map_fwd.hpp>` and
46  `<boost/unordered/unordered_set_fwd.hpp>`.
47* Move all the implementation inside `boost/unordered`, to assist
48  modularization and hopefully make it easier to track changes in subversion.
49
50[h2 Boost 1.38.0]
51
52* Use [@boost:/libs/core/swap.html `boost::swap`].
53* [@https://svn.boost.org/trac/boost/ticket/2237 Ticket 2237]:
54  Document that the equality and inequality operators are undefined for two
55  objects if their equality predicates aren't equivalent. Thanks to Daniel
56  Krügler.
57* [@https://svn.boost.org/trac/boost/ticket/1710 Ticket 1710]:
58  Use a larger prime number list. Thanks to Thorsten Ottosen and Hervé
59  Brönnimann.
60* Use
61  [@boost:/libs/type_traits/doc/html/boost_typetraits/category/alignment.html
62  aligned storage] to store the types. This changes the way the allocator is
63  used to construct nodes. It used to construct the node with two calls to
64  the allocator's `construct` method - once for the pointers and once for the
65  value. It now constructs the node with a single call to construct and
66  then constructs the value using in place construction.
67* Add support for C++0x initializer lists where they're available (currently
68  only g++ 4.4 in C++0x mode).
69
70[h2 Boost 1.39.0]
71
72* [@https://svn.boost.org/trac/boost/ticket/2756 Ticket 2756]: Avoid a warning
73  on Visual C++ 2009.
74* Some other minor internal changes to the implementation, tests and
75  documentation.
76* Avoid an unnecessary copy in `operator[]`.
77* [@https://svn.boost.org/trac/boost/ticket/2975 Ticket 2975]: Fix length of
78  prime number list.
79
80[h2 Boost 1.40.0]
81
82* [@https://svn.boost.org/trac/boost/ticket/2975 Ticket 2975]:
83  Store the prime list as a preprocessor sequence - so that it will always get
84  the length right if it changes again in the future.
85* [@https://svn.boost.org/trac/boost/ticket/1978 Ticket 1978]:
86  Implement `emplace` for all compilers.
87* [@https://svn.boost.org/trac/boost/ticket/2908 Ticket 2908],
88  [@https://svn.boost.org/trac/boost/ticket/3096 Ticket 3096]:
89  Some workarounds for old versions of borland, including adding explicit
90  destructors to all containers.
91* [@https://svn.boost.org/trac/boost/ticket/3082 Ticket 3082]:
92  Disable incorrect Visual C++ warnings.
93* Better configuration for C++0x features when the headers aren't available.
94* Create less buckets by default.
95
96[h2 Boost 1.41.0 - Major update]
97
98* The original version made heavy use of macros to sidestep some of the older
99  compilers' poor template support. But since I no longer support those
100  compilers and the macro use was starting to become a maintenance burden it
101  has been rewritten to use templates instead of macros for the implementation
102  classes.
103
104* The container object is now smaller thanks to using `boost::compressed_pair`
105  for EBO and a slightly different function buffer - now using a bool instead
106  of a member pointer.
107
108* Buckets are allocated lazily which means that constructing an empty container
109  will not allocate any memory.
110
111[h2 Boost 1.42.0]
112
113* Support instantiating the containers with incomplete value types.
114* Reduced the number of warnings (mostly in tests).
115* Improved codegear compatibility.
116* [@http://svn.boost.org/trac/boost/ticket/3693 Ticket 3693]:
117  Add `erase_return_void` as a temporary workaround for the current
118  `erase` which can be inefficient because it has to find the next
119  element to return an iterator.
120* Add templated find overload for compatible keys.
121* [@http://svn.boost.org/trac/boost/ticket/3773 Ticket 3773]:
122  Add missing `std` qualifier to `ptrdiff_t`.
123* Some code formatting changes to fit almost all lines into 80 characters.
124
125[h2 Boost 1.43.0]
126
127* [@http://svn.boost.org/trac/boost/ticket/3966 Ticket 3966]:
128  `erase_return_void` is now `quick_erase`, which is the
129  [@http://home.roadrunner.com/~hinnant/issue_review/lwg-active.html#579
130  current forerunner for resolving the slow erase by iterator], although
131  there's a strong possibility that this may change in the future. The old
132  method name remains for backwards compatibility but is considered deprecated
133  and will be removed in a future release.
134* Use Boost.Exception.
135* Stop using deprecated `BOOST_HAS_*` macros.
136
137[h2 Boost 1.45.0]
138
139* Fix a bug when inserting into an `unordered_map` or `unordered_set` using
140  iterators which returns `value_type` by copy.
141
142[h2 Boost 1.48.0 - Major update]
143
144This is major change which has been converted to use Boost.Move's move
145emulation, and be more compliant with the C++11 standard. See the
146[link unordered.compliance compliance section] for details.
147
148The container now meets C++11's complexity requirements, but to do so
149uses a little more memory. This means that `quick_erase` and
150`erase_return_void` are no longer required, they'll be removed in a
151future version.
152
153C++11 support has resulted in some breaking changes:
154
155* Equality comparison has been changed to the C++11 specification.
156  In a container with equivalent keys, elements in a group with equal
157  keys used to have to be in the same order to be considered equal,
158  now they can be a permutation of each other. To use the old
159  behavior define the macro `BOOST_UNORDERED_DEPRECATED_EQUALITY`.
160
161* The behaviour of swap is different when the two containers to be
162  swapped has unequal allocators. It used to allocate new nodes using
163  the appropriate allocators, it now swaps the allocators if
164  the allocator has a member structure `propagate_on_container_swap`,
165  such that `propagate_on_container_swap::value` is true.
166
167* Allocator's `construct` and `destroy` functions are called with raw
168  pointers, rather than the allocator's `pointer` type.
169
170* `emplace` used to emulate the variadic pair constructors that
171  appeared in early C++0x drafts. Since they were removed it no
172  longer does so. It does emulate the new `piecewise_construct`
173  pair constructors - only you need to use
174  `boost::piecewise_construct`. To use the old emulation of
175  the variadic constructors define
176  `BOOST_UNORDERED_DEPRECATED_PAIR_CONSTRUCT`.
177
178[h2 Boost 1.49.0]
179
180* Fix warning due to accidental odd assignment.
181* Slightly better error messages.
182
183[h2 Boost 1.50.0]
184
185* Fix equality for `unordered_multiset` and `unordered_multimap`.
186* [@https://svn.boost.org/trac/boost/ticket/6857 Ticket 6857]:
187  Implement `reserve`.
188* [@https://svn.boost.org/trac/boost/ticket/6771 Ticket 6771]:
189  Avoid gcc's `-Wfloat-equal` warning.
190* [@https://svn.boost.org/trac/boost/ticket/6784 Ticket 6784]:
191  Fix some Sun specific code.
192* [@https://svn.boost.org/trac/boost/ticket/6190 Ticket 6190]:
193  Avoid gcc's `-Wshadow` warning.
194* [@https://svn.boost.org/trac/boost/ticket/6905 Ticket 6905]:
195  Make namespaces in macros compatible with `bcp` custom namespaces.
196  Fixed by Luke Elliott.
197* Remove some of the smaller prime number of buckets, as they may make
198  collisions quite probable (e.g. multiples of 5 are very common because
199  we used base 10).
200* On old versions of Visual C++, use the container library's implementation
201  of `allocator_traits`, as it's more likely to work.
202* On machines with 64 bit std::size_t, use power of 2 buckets, with Thomas
203  Wang's hash function to pick which one to use. As modulus is very slow
204  for 64 bit values.
205* Some internal changes.
206
207[h2 Boost 1.51.0]
208
209* Fix construction/destruction issue when using a C++11 compiler with a
210  C++03 allocator ([ticket 7100]).
211* Remove a `try..catch` to support compiling without exceptions.
212* Adjust SFINAE use to try to support g++ 3.4 ([ticket 7175]).
213* Updated to use the new config macros.
214
215[h2 Boost 1.52.0]
216
217* Faster assign, which assigns to existing nodes where possible, rather than
218  creating entirely new nodes and copy constructing.
219* Fixed bug in `erase_range` ([ticket 7471]).
220* Reverted some of the internal changes to how nodes are created, especially
221  for C++11 compilers. 'construct' and 'destroy' should work a little better
222  for C++11 allocators.
223* Simplified the implementation a bit. Hopefully more robust.
224
225[h2 Boost 1.53.0]
226
227* Remove support for the old pre-standard variadic pair constructors, and
228  equality implementation. Both have been deprecated since Boost 1.48.
229* Remove use of deprecated config macros.
230* More internal implementation changes, including a much simpler
231  implementation of `erase`.
232
233[h2 Boost 1.54.0]
234
235* Mark methods specified in standard as `noexpect`. More to come in the next
236  release.
237* If the hash function and equality predicate are known to both have nothrow
238  move assignment or construction then use them.
239
240[h2 Boost 1.55.0]
241
242* Avoid some warnings ([ticket 8851], [ticket 8874]).
243* Avoid exposing some detail functions via. ADL on the iterators.
244* Follow the standard by only using the allocators' construct and destroy
245  methods to construct and destroy stored elements. Don't use them for internal
246  data like pointers.
247
248[h2 Boost 1.56.0]
249
250* Fix some shadowed variable warnings ([ticket 9377]).
251* Fix allocator use in documentation ([ticket 9719]).
252* Always use prime number of buckets for integers. Fixes performance
253  regression when inserting consecutive integers, although makes other
254  uses slower ([ticket 9282]).
255* Only construct elements using allocators, as specified in C++11 standard.
256
257[h2 Boost 1.57.0]
258
259* Fix the `pointer` typedef in iterators ([ticket 10672]).
260* Fix Coverity warning
261  ([@https://github.com/boostorg/unordered/pull/2 GitHub #2]).
262
263[h2 Boost 1.58.0]
264
265* Remove unnecessary template parameter from const iterators.
266* Rename private `iterator` typedef in some iterator classes, as it
267  confuses some traits classes.
268* Fix move assignment with stateful, propagate_on_container_move_assign
269  allocators ([ticket 10777]).
270* Fix rare exception safety issue in move assignment.
271* Fix potential overflow when calculating number of buckets to allocate
272  ([@https://github.com/boostorg/unordered/pull/4 GitHub #4]).
273
274[h2 Boost 1.62.0]
275
276* Remove use of deprecated `boost::iterator`.
277* Remove `BOOST_NO_STD_DISTANCE` workaround.
278* Remove `BOOST_UNORDERED_DEPRECATED_EQUALITY` warning.
279* Simpler implementation of assignment, fixes an exception safety issue
280  for `unordered_multiset` and `unordered_multimap`. Might be a little slower.
281* Stop using return value SFINAE which some older compilers have issues
282  with.
283
284[h2 Boost 1.63.0]
285
286* Check hint iterator in `insert`/`emplace_hint`.
287* Fix some warnings, mostly in the tests.
288* Manually write out `emplace_args` for small numbers of arguments -
289  should make template error messages a little more bearable.
290* Remove superfluous use of `boost::forward` in emplace arguments,
291  which fixes emplacing string literals in old versions of Visual C++.
292* Fix an exception safety issue in assignment. If bucket allocation
293  throws an exception, it can overwrite the hash and equality functions while
294  leaving the existing elements in place. This would mean that the function
295  objects wouldn't match the container elements, so elements might be in the
296  wrong bucket and equivalent elements would be incorrectly handled.
297* Various reference documentation improvements.
298* Better allocator support ([ticket 12459]).
299* Make the no argument constructors implicit.
300* Implement missing allocator aware constructors.
301* Fix assigning the hash/key equality functions for empty containers.
302* Remove unary/binary_function from the examples in the documentation.
303  They are removed in C++17.
304* Support 10 constructor arguments in emplace. It was meant to support up to 10
305  arguments, but an off by one error in the preprocessor code meant it only
306  supported up to 9.
307
308[h2 Boost 1.64.0]
309* Initial support for new C++17 member functions:
310  `insert_or_assign` and `try_emplace` in `unordered_map`,
311* Initial support for `merge` and `extract`.
312  Does not include transferring nodes between
313  `unordered_map` and `unordered_multimap` or between `unordered_set` and
314  `unordered_multiset` yet. That will hopefully be in the next version of
315  Boost.
316
317[h2 Boost 1.65.0]
318
319* Add deprecated attributes to `quick_erase` and `erase_return_void`.
320  I really will remove them in a future version this time.
321* Small standards compliance fixes:
322  * `noexpect` specs for `swap` free functions.
323  * Add missing `insert(P&&)` methods.
324
325[h2 Boost 1.66.0]
326
327* Simpler move construction implementation.
328* Documentation fixes ([pull_request 6]).
329
330[h2 Boost 1.67.0]
331
332* Improved C++17 support:
333  * Add template deduction guides from the standard.
334  * Use a simple implementation of `optional` in node handles, so
335    that they're closer to the standard.
336  * Add missing `noexcept` specifications to `swap`, `operator=`
337    and node handles, and change the implementation to match.
338    Using `std::allocator_traits::is_always_equal`, or our own
339    implementation when not available, and
340    `boost::is_nothrow_swappable` in the implementation.
341* Improved C++20 support:
342  * Use `boost::to_address`, which has the proposed C++20 semantics,
343    rather than the old custom implementation.
344* Add `element_type` to iterators, so that `std::pointer_traits`
345  will work.
346* Use `std::piecewise_construct` on recent versions of Visual C++,
347  and other uses of the Dinkumware standard library,
348  now using Boost.Predef to check compiler and library versions.
349* Use `std::iterator_traits` rather than the boost iterator traits
350  in order to remove dependency on Boost.Iterator.
351* Remove iterators' inheritance from `std::iterator`, which is
352  deprecated in C++17, thanks to Daniela Engert
353  ([@https://github.com/boostorg/unordered/pull/7 PR#7]).
354* Stop using `BOOST_DEDUCED_TYPENAME`.
355* Update some Boost include paths.
356* Rename some internal methods, and variables.
357* Various testing improvements.
358* Miscellaneous internal changes.
359
360[endsect]
361