2 - Add `retain_with_order` methods, equivalent to `retain` but which iterate
3 through the map in the proper linked list order
6 - API incompatible change: No longer re-export hashbrown types so that bumping
7 hashbrown is no longer an API compatible change.
8 - bump hashbrown to 0.12
9 - Fix implementation of `shrink_to_fit` to not panic when called on non-empty
13 - API incompatible change: depend on hashbrown 0.11, changes re-exported types.
14 - Fix `LinkedHashSet::back` to take `&self` not `&mut self`.
15 - API incompatible change: equality tests on `LinkedHashSet` are now *ordered*,
16 similar to `LinkedHashMap`.
17 - Make the serde `Deserialize` implementations on `LinkedHashMap` and
18 `LinkedHashSet` generic on the `BuildHasher` type.
19 - Add `to_back` and `to_front` methods for `LinkedHashMap` to control entry
23 - API incompatible change: depend on hashbrown 0.9, re-export renamed
24 hashbrown::TryReserveError type.
25 - Add a `Debug` impl to `LruCache` (thanks @thomcc!)
26 - Adjust trait bounds for `LinkedHashMap::retain`, `LinkedHashSet::default` to
27 be less strict (to match hashbrown)
28 - Adjust trait bounds for all `Debug` impls to be less strict (to match
30 - Adjust trait bounds for all `IntoIterator` impls to be less strict (to match
32 - Adjust trait bounds for `LruCache::with_hasher`, `LruCache::capacity`,
33 `LruCache::len`, `LruCache::is_empty`, `LruCache::clear`, `LruCache::iter`,
34 `LruCache::iter_mut`, and `LruCache::drain` to be less strict
35 - Add optional serde support for `LinkedHashMap` and `LinkedHashSet`.
36 - Add `to_back` and `to_front` methods for LinkedHashSet to control entry order.
39 - Add `LinkedHashMap::remove_entry` and `LruCache::remove_entry`
40 - Add `LruCache::new_unbounded` constructor that sets capacity to usize::MAX
41 - Add `LruCache::get` method to go with `LruCache::get_mut`
42 - Add `LruCache::peek` and `LruCache::peek_mut` to access the cache without
43 moving the entry in the LRU list
46 - API incompatible change: depend on hashbrown 0.7
49 - API incompatible change: depend on hashbrown 0.6
53 - Add some *minimal* documentation for methods that change the internal ordering.
54 - Decide on a pattern for methods that change the internal ordering: the word
55 "insert" means that it will move an existing entry to the back.
56 - Some methods have been renamed to conform to the above system.
59 - Fix variance for LinkedHashMap (now covariant where appropriate)
60 - Add Debug impls to many more associated types
62 - Add `LinkedHashMap::retain`
65 - Move `linked_hash_map` into its own module
66 - Add `LruCache` type ported from `lru-cache` crate into its own module
67 - Add `LruCache` entry and raw-entry API
68 - Add `linked_hash_map` `IntoIter` iterator that is different from `Drain` iterator
69 - Make `Drain` iterator recycle freed linked list nodes