| commit | 65e1af8d9698ee59e49ab9ed40d026528ca54f06 | [log] [tgz] |
|---|---|---|
| author | Matthew Maurer <mmaurer@google.com> | Thu Mar 09 18:07:31 2023 +0000 |
| committer | Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com> | Thu Mar 09 18:07:31 2023 +0000 |
| tree | 6a58b521516f9270099a4bb3a83d40401f935e16 | |
| parent | 5604baaa78772ba220e1df4c0635cd7d37f4d379 [diff] | |
| parent | fd8a2f26a4f05ab2022d50f7bc6d60386ec6e732 [diff] |
Make hashlink available to product and vendor am: 4abea671a2 am: 443cb26528 am: a51da0140d am: fd8a2f26a4 Original change: https://android-review.googlesource.com/c/platform/external/rust/crates/hashlink/+/2476413 Change-Id: I85bf79231560d7e7ad7df961f5567f2f74bc468f Signed-off-by: Automerger Merge Worker <android-build-automerger-merge-worker@system.gserviceaccount.com>
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.