Google Git
Sign in
android / platform / external / rust / crates / hashlink / refs/heads/aml_con_341810060
commit73dfb43a1f493efa20cfe58232e5b1087dedcc30[log] [tgz]
authorAndroid Build Coastguard Worker <[email protected]>Fri Jul 07 04:49:37 2023 +0000
committerAndroid Build Coastguard Worker <[email protected]>Fri Jul 07 04:49:37 2023 +0000
tree6a58b521516f9270099a4bb3a83d40401f935e16
parent6230ec77330854b4d8fbbd98501af1e2a0aa4f87 [diff]
parent3fac601af78ca04f3f0829861ae23fc5681d0b41 [diff]
Snap for 10453563 from 3fac601af78ca04f3f0829861ae23fc5681d0b41 to mainline-conscrypt-release

Change-Id: I4f297a40aa644ba07c8ffab77e95c686686f66b6
tree: 6a58b521516f9270099a4bb3a83d40401f935e16
  1. .circleci/
  2. src/
  3. tests/
  4. LICENSE ⇨ LICENSE-APACHE
  5. .cargo_vcs_info.json
  6. .gitignore
  7. Android.bp
  8. Cargo.toml
  9. Cargo.toml.orig
  10. cargo2android.json
  11. CHANGELOG.md
  12. LICENSE-APACHE
  13. LICENSE-MIT
  14. METADATA
  15. MODULE_LICENSE_APACHE2
  16. OWNERS
  17. README.md
  18. TEST_MAPPING
README.md

hashlink -- HashMap-like containers that hold their key-value pairs in a user controllable order

Build Status Latest Version API Documentation

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.

Credit

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.

License

This library is licensed the same as linked-hash-map and hashbrown, it is licensed under either of:

at your option.