#data-structures

lru-cache

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

10 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

#5 in Caching

Download history 11240/week @ 2019-01-20 12136/week @ 2019-01-27 12159/week @ 2019-02-03 13676/week @ 2019-02-10 12730/week @ 2019-02-17 15042/week @ 2019-02-24 16612/week @ 2019-03-03 17331/week @ 2019-03-10 18074/week @ 2019-03-17 16496/week @ 2019-03-24 17025/week @ 2019-03-31 20159/week @ 2019-04-07 17910/week @ 2019-04-14 14741/week @ 2019-04-21 15555/week @ 2019-04-28

61,141 downloads per month
Used in 275 crates (29 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

~527KB