#data-structures

lru-cache

A cache that holds a limited number of key-value pairs

9 releases

0.1.2 Mar 21, 2019
0.1.1 Mar 29, 2017
0.1.0 Oct 7, 2016
0.0.7 Feb 19, 2016
0.0.2 Mar 26, 2015

#3 in Caching

Download history 28944/week @ 2019-12-17 20290/week @ 2019-12-24 23706/week @ 2019-12-31 37137/week @ 2020-01-07 33922/week @ 2020-01-14 36829/week @ 2020-01-21 38570/week @ 2020-01-28 40486/week @ 2020-02-04 38332/week @ 2020-02-11 39769/week @ 2020-02-18 40490/week @ 2020-02-25 43424/week @ 2020-03-03 44091/week @ 2020-03-10 43168/week @ 2020-03-17 44170/week @ 2020-03-24 38649/week @ 2020-03-31

126,034 downloads per month
Used in 582 crates (32 directly)

MIT/Apache

19KB
291 lines

WARNING: THIS PROJECT IS IN MAINTENANCE MODE, DUE TO INSUFFICIENT MAINTAINER RESOURCES

It works fine, but will generally no longer be improved.

We are currently only accepting changes which:

  • keep this compiling with the latest versions of Rust or its dependencies.
  • have minimal review requirements, such as documentation changes (so not totally new APIs).

A cache that holds a limited number of key-value pairs.

Documentation is available at https://contain-rs.github.io/lru-cache/lru_cache.


lib.rs:

A cache that holds a limited number of key-value pairs. When the capacity of the cache is exceeded, the least-recently-used (where "used" means a look-up or putting the pair into the cache) pair is automatically removed.

Examples

use lru_cache::LruCache;

let mut cache = LruCache::new(2);

cache.insert(1, 10);
cache.insert(2, 20);
cache.insert(3, 30);
assert!(cache.get_mut(&1).is_none());
assert_eq!(*cache.get_mut(&2).unwrap(), 20);
assert_eq!(*cache.get_mut(&3).unwrap(), 30);

cache.insert(2, 22);
assert_eq!(*cache.get_mut(&2).unwrap(), 22);

cache.insert(6, 60);
assert!(cache.get_mut(&3).is_none());

cache.set_capacity(1);
assert!(cache.get_mut(&2).is_none());

Dependencies

~65KB