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

5 releases (3 breaking)

✓ Uses Rust 2018 edition

0.4.0 Nov 18, 2019
0.3.0 Jul 12, 2019
0.2.1 Jul 8, 2019
0.2.0 Jul 6, 2019
0.1.0 Jul 6, 2019

#238 in Data structures

Download history 11/week @ 2019-10-02 10/week @ 2019-10-16 11/week @ 2019-10-23 8/week @ 2019-10-30 3/week @ 2019-11-06 23/week @ 2019-11-13 9/week @ 2019-11-20 18/week @ 2019-11-27 11/week @ 2019-12-04 37/week @ 2019-12-11 7/week @ 2019-12-25 2/week @ 2020-01-01 56/week @ 2020-01-08

51 downloads per month


2.5K 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.
    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
    .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, but it should probably still receive more review and testing.


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.


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

at your option.