#LRU #cache

lru

A LRU cache implementation

16 releases

0.1.15 Apr 13, 2019
0.1.13 Mar 12, 2019
0.1.11 Dec 11, 2018
0.1.10 Nov 7, 2018
0.1.1 Dec 31, 2016

#5 in Caching

Download history 428/week @ 2018-12-29 408/week @ 2019-01-05 622/week @ 2019-01-12 399/week @ 2019-01-19 703/week @ 2019-01-26 537/week @ 2019-02-02 1155/week @ 2019-02-09 697/week @ 2019-02-16 1138/week @ 2019-02-23 1426/week @ 2019-03-02 1258/week @ 2019-03-09 1630/week @ 2019-03-16 1768/week @ 2019-03-23 670/week @ 2019-03-30 1219/week @ 2019-04-06

4,410 downloads per month
Used in 7 crates (6 directly)

MIT license

42KB
793 lines

LRU Cache

Build Status codecov crates.io docs.rs License

Documentation

An implementation of a LRU cache. The cache supports put, get, get_mut and pop operations, all of which are O(1). This crate was heavily influenced by the LRU Cache implementation in an earlier version of Rust's std::collections crate.

Example

Below is a simple example of how to instantiate and use a LRU cache.

extern crate lru;

use lru::LruCache;

fn main() {
        let mut cache = LruCache::new(2);
        cache.put("apple", 3);
        cache.put("banana", 2);

        assert_eq!(*cache.get(&"apple").unwrap(), 3);
        assert_eq!(*cache.get(&"banana").unwrap(), 2);
        assert!(cache.get(&"pear").is_none());

        cache.put("pear", 4);

        assert_eq!(*cache.get(&"pear").unwrap(), 4);
        assert_eq!(*cache.get(&"banana").unwrap(), 2);
        assert!(cache.get(&"apple").is_none());

        {
            let v = cache.get_mut(&"banana").unwrap();
            *v = 6;
        }

        assert_eq!(*cache.get(&"banana").unwrap(), 6);
}

Dependencies

~404KB