Add all release dates

RELEASES.md

@@ -1,42 +1,42 @@
 # Releases
 
-## 0.5.3
+## 0.5.3 (2024-08-30)
 
 - Added an `insert_before` method to `OrderMap` and `OrderSet`, as an
   alternative to `shift_insert` with different behavior on existing entries.
 - Added `first_entry` and `last_entry` methods to `OrderMap`.
 - Added `From` implementations between `IndexedEntry` and `OccupiedEntry`.
 
-## 0.5.2
+## 0.5.2 (2024-08-13)
 
 - Added methods `OrderMap::append` and `OrderSet::append`, moving all items from
   one map or set into another, and leaving the original capacity for reuse.
 
-## 0.5.1
+## 0.5.1 (2024-08-01)
 
 - Added trait `MutableEntryKey` for opt-in mutable access to map entry keys.
 - Added method `MutableKeys::iter_mut2` for opt-in mutable iteration of map
   keys and values.
 
-## 0.5.0
+## 0.5.0 (2024-06-25)
 
 - Reinstated `ordermap` as a crate that wraps `indexmap` with stronger
   ordering semantics. It **does** consider order for `PartialEq` and `Eq`,
   also adding implementations of `PartialOrd`, `Ord`, and `Hash`. Methods
   like `remove` use the semantics of indexmap's `shift_remove`.
 
-## 0.4.2
+## 0.4.2 (2018-11-17)
 
 - Inserted more deprecation information in the documentation.
   Note: the crate ordermap has been renamed with no change in functionality
   to indexmap; please use it under its new name.
 
-## 0.4.1
+## 0.4.1 (2018-02-14)
 
 - Renamed crate to `indexmap`; the `ordermap` crate is now deprecated
   and the types `OrderMap/Set` now have a deprecation notice.
 
-## 0.4.0
+## 0.4.0 (2018-02-02)
 
 - This is the last release series for this `ordermap` under that name,
   because the crate is **going to be renamed** to `indexmap` (with types
@@ -55,35 +55,35 @@
 
 - Minimum Rust version requirement increased to Rust 1.18
 
-## 0.3.5
+## 0.3.5 (2018-01-14)
 
 - Documentation improvements
 
-## 0.3.4
+## 0.3.4 (2018-01-04)
 
 - The `.retain()` methods for `OrderMap` and `OrderSet` now
   traverse the elements in order, and the retained elements **keep their order**
 - Added new methods `.sort_by()`, `.sort_keys()` to `OrderMap` and
   `.sort_by()`, `.sort()` to `OrderSet`. These methods allow you to
   sort the maps in place efficiently.
 
-## 0.3.3
+## 0.3.3 (2017-12-28)
 
 - Document insertion behaviour better by @lucab
 - Updated dependences (no feature changes) by @ignatenkobrain
 
-## 0.3.2
+## 0.3.2 (2017-11-25)
 
 - Add `OrderSet` by @cuviper!
 - `OrderMap::drain` is now (too) a double ended iterator.
 
-## 0.3.1
+## 0.3.1 (2017-11-19)
 
 - In all ordermap iterators, forward the `collect` method to the underlying
   iterator as well.
 - Add crates.io categories.
 
-## 0.3.0
+## 0.3.0 (2017-10-07)
 
 - The methods `get_pair`, `get_pair_index` were both replaced by
   `get_full` (and the same for the mutable case).
@@ -98,71 +98,71 @@
 
 [#10]: https://github.com/indexmap-rs/indexmap/pull/10
 
-## 0.2.13
+## 0.2.13 (2017-09-30)
 
 - Fix deserialization to support custom hashers by @Techcable.
 - Add methods `.index()` on the entry types by @garro95.
 
-## 0.2.12
+## 0.2.12 (2017-09-11)
 
 - Add methods `.with_hasher()`, `.hasher()`.
 
-## 0.2.11
+## 0.2.11 (2017-08-29)
 
 - Support `ExactSizeIterator` for the iterators. By @Binero.
 - Use `Box<[Pos]>` internally, saving a word in the `OrderMap` struct.
 - Serde support, with crate feature `"serde-1"`. By @xfix.
 
-## 0.2.10
+## 0.2.10 (2017-04-29)
 
 - Add iterator `.drain(..)` by @stevej.
 
-## 0.2.9
+## 0.2.9 (2017-03-26)
 
 - Add method `.is_empty()` by @overvenus.
 - Implement `PartialEq, Eq` by @overvenus.
 - Add method `.sorted_by()`.
 
-## 0.2.8
+## 0.2.8 (2017-03-01)
 
 - Add iterators `.values()` and `.values_mut()`.
 - Fix compatibility with 32-bit platforms.
 
-## 0.2.7
+## 0.2.7 (2016-11-02)
 
 - Add `.retain()`.
 
-## 0.2.6
+## 0.2.6 (2016-11-02)
 
 - Add `OccupiedEntry::remove_entry` and other minor entry methods,
   so that it now has all the features of `HashMap`'s entries.
 
-## 0.2.5
+## 0.2.5 (2016-10-31)
 
 - Improved `.pop()` slightly.
 
-## 0.2.4
+## 0.2.4 (2016-10-22)
 
 - Improved performance of `.insert()` ([#3]) by @pczarn.
 
 [#3]: https://github.com/indexmap-rs/indexmap/pull/3
 
-## 0.2.3
+## 0.2.3 (2016-10-11)
 
 - Generalize `Entry` for now, so that it works on hashmaps with non-default
   hasher. However, there's a lingering compat issue since libstd `HashMap`
   does not parameterize its entries by the hasher (`S` typarm).
 - Special case some iterator methods like `.nth()`.
 
-## 0.2.2
+## 0.2.2 (2016-10-02)
 
 - Disable the verbose `Debug` impl by default.
 
-## 0.2.1
+## 0.2.1 (2016-10-02)
 
 - Fix doc links and clarify docs.
 
-## 0.2.0
+## 0.2.0 (2016-10-01)
 
 - Add more `HashMap` methods & compat with its API.
 - Experimental support for `.entry()` (the simplest parts of the API).
@@ -174,11 +174,11 @@
   `.get_index()`, `.get_index_mut()`, `.swap_remove_index()`,
   `.get_pair_index()`, `.get_pair_index_mut()`.
 
-## 0.1.2
+## 0.1.2 (2016-09-19)
 
 - Implement the 32/32 split idea for `Pos` which improves cache utilization
   and lookup performance.
 
-## 0.1.1
+## 0.1.1 (2016-09-16)
 
 - Initial release.