commit | e65a0e9359aae3a4f53e45fdd14f1066a3792e10 | [log] [tgz] |
---|---|---|
author | Jeff Vander Stoep <jeffv@google.com> | Tue Jul 26 23:11:39 2022 +0200 |
committer | Jeff Vander Stoep <jeffv@google.com> | Tue Jul 26 23:11:39 2022 +0200 |
tree | 870e95ec3f9afcf9e1335a32813740e8f76fa82a | |
parent | 2eccda875f69314816270c5ca2be1f3aa315949f [diff] |
Enable tests Now that fxhash has been imported, tests can be enabled. Test: atest Change-Id: I7b689cab58872fb1afa70fe9d08aefc16f751d21
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.
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.