tag | 62b3eec69c6b26e130ca9096c9bb97d869b86603 | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Wed Apr 24 20:07:43 2024 -0700 |
object | 1ca1cb5983e0c696e3450de52afd6cce1876c0c7 |
aml_sta_341615000 (11423312,com.google.android.go.os.statsd,com.google.android.os.statsd)
commit | 1ca1cb5983e0c696e3450de52afd6cce1876c0c7 | [log] [tgz] |
---|---|---|
author | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Fri Jul 07 05:05:42 2023 +0000 |
committer | Android Build Coastguard Worker <android-build-coastguard-worker@google.com> | Fri Jul 07 05:05:42 2023 +0000 |
tree | 6a58b521516f9270099a4bb3a83d40401f935e16 | |
parent | 41636fe5a5c304487996a48efc564383ca55b734 [diff] | |
parent | 3fac601af78ca04f3f0829861ae23fc5681d0b41 [diff] |
Snap for 10453563 from 3fac601af78ca04f3f0829861ae23fc5681d0b41 to mainline-os-statsd-release Change-Id: I93d92b583ed6d1eebe38bbf307ce6d2e6626da2d
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.