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

#902 in Database interfaces

Download history 406883/week @ 2024-11-30 518426/week @ 2024-12-07 430022/week @ 2024-12-14 146319/week @ 2024-12-21 205347/week @ 2024-12-28 425919/week @ 2025-01-04 506195/week @ 2025-01-11 385463/week @ 2025-01-18 420812/week @ 2025-01-25 482068/week @ 2025-02-01 487741/week @ 2025-02-08 452562/week @ 2025-02-15 537363/week @ 2025-02-22 526327/week @ 2025-03-01 557622/week @ 2025-03-08 472187/week @ 2025-03-15

2,186,577 downloads per month
Used in 1,756 crates (75 directly)

MIT/Apache

20KB
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

~220KB