1## [0.10.0] 2- API incompatible change: upgrade `hashbrown` to 0.15 (thank you @djc!). 3- API incompatible change: we now wrap `DefaultHashBuilder` and `DefaultHasher` 4 from `hashbrown` so that in the future upgrading `hashbrown` is not an API 5 incompatible change (thank you @djc!). 6 7## [0.9.1] 8- Bugfix: `LruCache::contains_key` should take `&self` and not move the entry as 9 though it is accessed. 10- Add basic `CursorMut` API to `HashMap` (thanks @olebedev!) 11- Bump `hashbrown` dependency to depend on a version of `hashbrown` past a 12 downstream `zerocopy` dependency. 13- Don't depend on default features of `hashbrown`, removes `allocator-api2` 14 dependency. 15 16## [0.9.0] 17- API incompatible change: Don't panic in `reserve` and `try_reserve` in cases 18 where a rehash is needed. Previously would panic, adds the proper bounds on 19 reserve methods to do a rehash (previously bounds were missing, and reserve 20 would result in panics). (Thank you @cuviper!) 21 22## [0.8.4] 23- Now builds with `#![no_std]`. 24 25## [0.8.3] 26- bump hashbrown to 0.14 27 28## [0.8.2] 29- bump hashbrown to 0.13 30 31## [0.8.1] 32- Add `retain_with_order` methods, equivalent to `retain` but which iterate 33 through the map in the proper linked list order 34 35## [0.8.0] 36- API incompatible change: No longer re-export hashbrown types so that bumping 37 hashbrown is no longer an API compatible change. 38- bump hashbrown to 0.12 39- Fix implementation of `shrink_to_fit` to not panic when called on non-empty 40 containers. 41 42## [0.7.0] 43- API incompatible change: depend on hashbrown 0.11, changes re-exported types. 44- Fix `LinkedHashSet::back` to take `&self` not `&mut self`. 45- API incompatible change: equality tests on `LinkedHashSet` are now *ordered*, 46 similar to `LinkedHashMap`. 47- Make the serde `Deserialize` implementations on `LinkedHashMap` and 48 `LinkedHashSet` generic on the `BuildHasher` type. 49- Add `to_back` and `to_front` methods for `LinkedHashMap` to control entry 50 order. 51 52## [0.6.0] 53- API incompatible change: depend on hashbrown 0.9, re-export renamed 54 hashbrown::TryReserveError type. 55- Add a `Debug` impl to `LruCache` (thanks @thomcc!) 56- Adjust trait bounds for `LinkedHashMap::retain`, `LinkedHashSet::default` to 57 be less strict (to match hashbrown) 58- Adjust trait bounds for all `Debug` impls to be less strict (to match 59 hashbrown). 60- Adjust trait bounds for all `IntoIterator` impls to be less strict (to match 61 hashbrown). 62- Adjust trait bounds for `LruCache::with_hasher`, `LruCache::capacity`, 63 `LruCache::len`, `LruCache::is_empty`, `LruCache::clear`, `LruCache::iter`, 64 `LruCache::iter_mut`, and `LruCache::drain` to be less strict 65- Add optional serde support for `LinkedHashMap` and `LinkedHashSet`. 66- Add `to_back` and `to_front` methods for LinkedHashSet to control entry order. 67 68## [0.5.1] 69- Add `LinkedHashMap::remove_entry` and `LruCache::remove_entry` 70- Add `LruCache::new_unbounded` constructor that sets capacity to usize::MAX 71- Add `LruCache::get` method to go with `LruCache::get_mut` 72- Add `LruCache::peek` and `LruCache::peek_mut` to access the cache without 73 moving the entry in the LRU list 74 75## [0.5.0] 76- API incompatible change: depend on hashbrown 0.7 77 78## [0.4.0] 79- API incompatible change: depend on hashbrown 0.6 80- Passes miri 81 82## [0.3.0] 83- Add some *minimal* documentation for methods that change the internal ordering. 84- Decide on a pattern for methods that change the internal ordering: the word 85 "insert" means that it will move an existing entry to the back. 86- Some methods have been renamed to conform to the above system. 87 88## [0.2.1] 89- Fix variance for LinkedHashMap (now covariant where appropriate) 90- Add Debug impls to many more associated types 91- Add LinkedHashSet 92- Add `LinkedHashMap::retain` 93 94## [0.2.0] 95- Move `linked_hash_map` into its own module 96- Add `LruCache` type ported from `lru-cache` crate into its own module 97- Add `LruCache` entry and raw-entry API 98- Add `linked_hash_map` `IntoIter` iterator that is different from `Drain` iterator 99- Make `Drain` iterator recycle freed linked list nodes 100 101## [0.1.0] 102- Initial release 103