tag | 753658367128f8a5eb04ded8c788031346c1be53 | |
---|---|---|
tagger | The Android Open Source Project <initial-contribution@android.com> | Wed Sep 08 11:25:40 2021 -0700 |
object | ac8ff581d6f15c59d0f4aaf672503b3bb2e8d815 |
Android S Beta 5
commit | ac8ff581d6f15c59d0f4aaf672503b3bb2e8d815 | [log] [tgz] |
---|---|---|
author | easoncylee <easoncylee@google.com> | Fri Jul 02 11:27:33 2021 +0800 |
committer | easoncylee <easoncylee@google.com> | Tue Jul 06 10:07:23 2021 +0800 |
tree | 14e202d86ff5a3bc6a55cccd1533a1e3863f13e1 | |
parent | eb62f240b959c196f0c218edc526612ae11f6008 [diff] |
Update vpnprofilestore_test to legacykeystore_test in TEST_MAPPING The test had been changed to legacykeystore_test from ag/14968529 Bug: 192796637 Test: presubmit Change-Id: I8d5307e9f08a908334070faab40093137b8b83d3
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.