#data-structures

hashlink

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

9 releases (breaking)

0.7.0 May 3, 2021
0.6.0 Oct 6, 2020
0.5.1 May 11, 2020
0.5.0 Mar 18, 2020
0.1.0 Jul 6, 2019

#81 in Database interfaces

Download history 54383/week @ 2021-08-17 55844/week @ 2021-08-24 53989/week @ 2021-08-31 60827/week @ 2021-09-07 70513/week @ 2021-09-14 66541/week @ 2021-09-21 70004/week @ 2021-09-28 67461/week @ 2021-10-05 73893/week @ 2021-10-12 70066/week @ 2021-10-19 66986/week @ 2021-10-26 74239/week @ 2021-11-02 77736/week @ 2021-11-09 80448/week @ 2021-11-16 59320/week @ 2021-11-23 77253/week @ 2021-11-30

309,595 downloads per month
Used in 390 crates (13 directly)

MIT/Apache

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

~370–540KB
~10K SLoC