Google Git
Sign in
android / platform / external / rust / crates / hashlink / a4c3513959f54e7983a48fe3abde64306a08930a
commita4c3513959f54e7983a48fe3abde64306a08930a[log] [tgz]
authorJames Farrell <[email protected]>Tue Aug 06 16:51:45 2024 +0000
committerJames Farrell <[email protected]>Tue Aug 06 16:51:45 2024 +0000
tree5dfdb0b5d22e3e19fd44ad28b39ede29cacfd831
parenta17e1660971e1dc73fb9dd5e1652a2780e7d919a [diff]
Update Android.bp by running cargo_embargo

Test: ran cargo_embargo
Change-Id: I4ea51179cc478286ca7f7b5e5aa516abe1125c79
1 file changed
tree: 5dfdb0b5d22e3e19fd44ad28b39ede29cacfd831
  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. cargo_embargo.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.