MCPcopy Index your code
hub / github.com/djc/hashlink

github.com/djc/hashlink @v0.12.1

Chat with this repo
repository ↗ · DeepWiki ↗ · release v0.12.1 ↗ · + Follow
360 symbols 1,029 edges 9 files 8 documented · 2%
What it actually does AI analysis from the code graph — generated when you open this
loading…
README

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:

  • MIT license LICENSE-MIT or http://opensource.org/licenses/MIT
  • Apache License 2.0 LICENSE-APACHE or https://opensource.org/licenses/Apache-2.0

at your option.

Extension points exported contracts — how you extend this code

OptNonNullExt (Interface)
(no doc) [1 implementers]
src/linked_hash_map.rs

Core symbols most depended-on inside this repo

insert
called by 196
src/lru_cache.rs
as_ptr
called by 56
src/linked_hash_map.rs
finish
called by 25
src/lib.rs
from_key
called by 22
src/linked_hash_map.rs
entry
called by 22
src/lru_cache.rs
iter
called by 16
src/linked_hash_map.rs
iter
called by 16
src/lru_cache.rs
move_next
called by 15
src/linked_hash_map.rs

Shape

Method 210
Function 106
Class 40
Enum 3
Interface 1

Languages

Rust100%

Modules by API surface

src/linked_hash_map.rs135 symbols
src/linked_hash_set.rs60 symbols
tests/linked_hash_map.rs56 symbols
tests/linked_hash_set.rs36 symbols
src/lru_cache.rs29 symbols
src/lib.rs17 symbols
tests/lru_cache.rs11 symbols
src/serde.rs9 symbols
tests/serde.rs7 symbols

For agents

$ claude mcp add hashlink \
  -- python -m otcore.mcp_server <graph>

⬇ download graph artifact