#linked-hash-map #lru-cache #no-std

no-std hashlink

HashMap-like containers that hold their key-value pairs in a user controllable order

18 releases (10 breaking)

0.11.0 Oct 26, 2025
0.10.0 Dec 9, 2024
0.9.1 May 12, 2024
0.9.0 Jan 9, 2024
0.3.0 Jul 12, 2019

#11 in Data structures

Download history 2095563/week @ 2025-10-25 2099058/week @ 2025-11-01 2006501/week @ 2025-11-08 2359304/week @ 2025-11-15 1975975/week @ 2025-11-22 2178396/week @ 2025-11-29 2691979/week @ 2025-12-06 2605034/week @ 2025-12-13 1392686/week @ 2025-12-20 1260094/week @ 2025-12-27 2481966/week @ 2026-01-03 3010620/week @ 2026-01-10 3199787/week @ 2026-01-17 3324894/week @ 2026-01-24 3406009/week @ 2026-01-31 3514407/week @ 2026-02-07

13,971,048 downloads per month
Used in 6,135 crates (98 directly)

MIT/Apache

99KB
3K SLoC

hashlink -- HashMap-like containers that hold their key-value pairs in a user controllable order

Build Status Latest Version API Documentation

This crate is a fork of linked-hash-map that builds on top of hashbrown to implement more up to date versions of LinkedHashMap LinkedHashSet, and LruCache.

One important API change is that when a LinkedHashMap is used as a LRU cache, it allows you to easily retrieve an entry and move it to the back OR produce a new entry at the back without needlessly repeating key hashing and lookups:

let mut lru_cache = LinkedHashMap::new();
let key = "key".to_owned();
// Try to find my expensive to construct and hash key
let _cached_val = match lru_cache.raw_entry_mut().from_key(&key) {
    RawEntryMut::Occupied(mut occupied) => {
        // Cache hit, move entry to the back.
        occupied.to_back();
        occupied.into_mut()
    }
    RawEntryMut::Vacant(vacant) => {
        // Insert expensive to construct key and expensive to compute value,
        // automatically inserted at the back.
        vacant.insert(key.clone(), 42).1
    }
};

Or, a simpler way to do the same thing:

let mut lru_cache = LinkedHashMap::new();
let key = "key".to_owned();
let _cached_val = lru_cache
    .raw_entry_mut()
    .from_key(&key)
    .or_insert_with(|| (key.clone(), 42));

This crate contains a decent amount of unsafe code from handling its internal linked list, and the unsafe code has diverged quite a lot from the original linked-hash-map implementation. It currently passes tests under miri and sanitizers, but it should probably still receive more review and testing, and check for test code coverage.

Credit

There is a huge amount of code in this crate that is copied verbatim from linked-hash-map and hashbrown, especially tests, associated types like iterators, and things like Debug impls.

License

This library is licensed the same as linked-hash-map and hashbrown, it is licensed under either of:

at your option.

Dependencies

~475–780KB
~12K SLoC