#lru-cache #key-value #linked-hash-map #order #linked-list #hash-key #container

no-std hashlink

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

16 releases (8 breaking)

0.9.1 May 12, 2024
0.9.0 Jan 9, 2024
0.8.4 Aug 28, 2023
0.8.3 Jun 11, 2023
0.3.0 Jul 12, 2019

#39 in Data structures

Download history 595117/week @ 2024-07-29 613344/week @ 2024-08-05 650859/week @ 2024-08-12 659938/week @ 2024-08-19 699408/week @ 2024-08-26 668623/week @ 2024-09-02 712488/week @ 2024-09-09 638448/week @ 2024-09-16 716784/week @ 2024-09-23 698128/week @ 2024-09-30 738407/week @ 2024-10-07 739853/week @ 2024-10-14 817392/week @ 2024-10-21 814243/week @ 2024-10-28 834496/week @ 2024-11-04 824764/week @ 2024-11-11

3,323,380 downloads per month
Used in 2,761 crates (65 directly)

MIT/Apache

98KB
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

~1.5MB
~25K SLoC