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

#4 in #data-structures

Download history 25504/week @ 2019-07-26 25361/week @ 2019-08-02 27504/week @ 2019-08-09 25756/week @ 2019-08-16 24521/week @ 2019-08-23 23865/week @ 2019-08-30 24252/week @ 2019-09-06 24464/week @ 2019-09-13 24444/week @ 2019-09-20 26628/week @ 2019-09-27 25671/week @ 2019-10-04 27344/week @ 2019-10-11 27661/week @ 2019-10-18 27794/week @ 2019-10-25 29560/week @ 2019-11-01

76,768 downloads per month
Used in 382 crates (31 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

~66KB