tag | 887b84356c01b01529f2ba3e97e8706a876dc06c | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Wed May 11 05:12:48 2022 +0000 |
object | 0249166812f2b30a4b7e29165f25c83932755809 |
Android mainline 12.0.0 release 91
commit | 0249166812f2b30a4b7e29165f25c83932755809 | [log] [tgz] |
---|---|---|
author | Xin Li <delphij@google.com> | Sat Feb 20 15:50:49 2021 +0000 |
committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Sat Feb 20 15:50:49 2021 +0000 |
tree | 69609eba0194af44d59844c6df753b5c412889ee | |
parent | 40b52e5b2635f978b2f090a3fc636379f57dbb8f [diff] | |
parent | 737afc8506046121e4b14027bcaeea7022b75e1a [diff] |
[automerger skipped] Mark ab/7061308 as merged in stage. am: 25b6e21c78 -s ours am: f9adfd4e3f -s ours am: 737afc8506 -s ours am skip reason: Change-Id I09415f0842e511509490afd702b688be4c33d266 with SHA-1 1c858da4ae is in history Original change: undetermined MUST ONLY BE SUBMITTED BY AUTOMERGER Change-Id: I1958dfd160589a820df21013648f2fc06ad8f9ca
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.