2 unstable releases

0.3.0 Jan 19, 2024
0.2.0 Mar 21, 2023

#132 in Concurrency

Download history 20685/week @ 2024-06-15 28654/week @ 2024-06-22 19790/week @ 2024-06-29 19596/week @ 2024-07-06 26410/week @ 2024-07-13 29005/week @ 2024-07-20 22462/week @ 2024-07-27 20590/week @ 2024-08-03 14703/week @ 2024-08-10 17529/week @ 2024-08-17 19645/week @ 2024-08-24 17623/week @ 2024-08-31 16774/week @ 2024-09-07 16521/week @ 2024-09-14 21223/week @ 2024-09-21 13371/week @ 2024-09-28

72,312 downloads per month
Used in 8 crates (3 directly)

MIT license

17KB
378 lines

CacheMap

CacheMap is a data structure for concurrently caching values.

The cache function will look up a value in the map, or generate and store a new one using the provided function.

This is a updated and maintained fork of hclarke/cachemap.

Example

use cachemap::CacheMap;
	
let m = CacheMap::new();

let fst = m.cache("key", || 5u32);
let snd = m.cache("key", || 7u32);

assert_eq!(*fst, *snd);
assert_eq!(*fst, 5u32);

Features

  • Can cache values concurrently (using &CacheMap<K,V> rather than &mut CacheMap<K,V>).
  • Returned references use the map's lifetime, so clients can avoid smart pointers.
  • Clients can optionally enable the dashmap feature, which uses dashmap internally and allows:
    • getting Arc<V> pointers, in case values need to outlive the map, and
    • adding Arc<V> directly, allowing unsized values, and re-using Arc<V>s from elsewhere.
  • Clients can optionally enable the abi_stable feature which will derive abi_stable::StableAbi on the type.

AntiFeatures

  • There is no cache invalidation: the only way to remove things from a CacheMap is to drop it.

Dependencies

~0–5.5MB
~21K SLoC