NewYour coding agent can read the release notes before it upgrades.Set up the MCP server →
crates.io · #344 most downloaded on crates.io
HashMap-like containers that hold their key-value pairs in a user controllable order
Last release 1 months ago
07 Sep 2026
Ships fairly regularly
a new release about every 4 months
Nearly every release is documented
notes for 22 of 22 stable releases
Nothing withdrawn
no release was ever pulled
7 years old
22 releases · first in 2019
Add LinkedHashMap::insert_front() by @AlexanderSchuetz97 in #54
add various missing utility functions by @AlexanderSchuetz97 in #51
One column per quarter.
Upgrades to hashbrown 0.17. What's Changed Prepare 0.12 by @djc in #44
Add basic GH Actions CI setup by @djc in #45
The hashlink crate now has @djc as its new maintainer. Thanks to @kyren for starting and maintaining this crate until now!
API incompatible change: upgrade hashbrown to 0.15 (thank you @djc!).
hashbrown to 0.15 (thank you @djc!).DefaultHashBuilder and DefaultHasher
from hashbrown so that in the future upgrading hashbrown is not an API
incompatible change (thank you @djc!).Bugfix: LruCache::contains_key should take &self and not move the entry as though it is accessed.
LruCache::contains_key should take &self and not move the entry asCursorMut API to HashMap (thanks @olebedev!)hashbrown dependency to depend on a version of hashbrown past azerocopy dependency.hashbrown, removes allocator-api2API incompatible change: Don't panic in reserve and try_reserve in cases where a rehash is needed. Previously would panic, adds the proper bounds on r
API incompatible change: Don't panic in reserve and try_reserve in cases where a rehash is needed. Previously would panic, adds the proper bounds on reserve methods to do a rehash (previously bounds were missing, and reserve would result in panics). (Thank you @cuviper)
Now builds with #![no_std] .
Now builds with #![no_std].
- bump hashbrown to 0.14
- bump hashbrown to 0.13
(cargo-release) hashlink version 0.8.1
(cargo-release) hashlink version 0.8.1
retain_with_order methods, equivalent to retain but which iterate
through the map in the proper linked list order(cargo-release) hashlink version 0.8.0
(cargo-release) hashlink version 0.8.0
shrink_to_fit to not panic when called on non-empty
containers.API incompatible change: depend on hashbrown 0.11, changes re-exported types.
LinkedHashSet::back to take &self not &mut self.LinkedHashSet are now ordered,
similar to LinkedHashMap.Deserialize implementations on LinkedHashMap and
LinkedHashSet generic on the BuildHasher type.to_back and to_front methods for LinkedHashMap to control entry
order.API incompatible change: depend on hashbrown 0.9, re-export renamed hashbrown::TryReserveError type.
Debug impl to LruCache (thanks @thomcc!)LinkedHashMap::retain, LinkedHashSet::default to
be less strict (to match hashbrown)Debug impls to be less strict (to match
hashbrown).IntoIterator impls to be less strict (to match
hashbrown).LruCache::with_hasher, LruCache::capacity,
LruCache::len, LruCache::is_empty, LruCache::clear, LruCache::iter,
LruCache::iter_mut, and LruCache::drain to be less strictLinkedHashMap and LinkedHashSet.to_back and to_front methods for LinkedHashSet to control entry order.Add LinkedHashMap::remove_entry and LruCache::remove_entry
LinkedHashMap::remove_entry and LruCache::remove_entryLruCache::new_unbounded constructor that sets capacity to usize::MAXLruCache::get method to go with LruCache::get_mutLruCache::peek and LruCache::peek_mut to access the cache without
moving the entry in the LRU listAPI incompatible change: depend on hashbrown 0.7
API incompatible change: depend on hashbrown 0.6
Add some *minimal* documentation for methods that change the internal ordering.
Fix variance for LinkedHashMap (now covariant where appropriate)
LinkedHashMap::retainMove linked_hash_map into its own module
linked_hash_map into its own moduleLruCache type ported from lru-cache crate into its own moduleLruCache entry and raw-entry APIlinked_hash_map IntoIter iterator that is different from Drain iteratorDrain iterator recycle freed linked list nodes- Initial release
Your coding agent can read these notes before it upgrades. Set up the MCP server →