9 releases

Uses old Rust 2015

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

#19 in Caching

Download history 142195/week @ 2022-12-01 137055/week @ 2022-12-08 119334/week @ 2022-12-15 75701/week @ 2022-12-22 95735/week @ 2022-12-29 135198/week @ 2023-01-05 142231/week @ 2023-01-12 139629/week @ 2023-01-19 162025/week @ 2023-01-26 172323/week @ 2023-02-02 160658/week @ 2023-02-09 147155/week @ 2023-02-16 159520/week @ 2023-02-23 158040/week @ 2023-03-02 175908/week @ 2023-03-09 167660/week @ 2023-03-16

692,192 downloads per month
Used in 1,202 crates (58 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

~71KB