Struct ritecache::LruCache[−][src]

pub struct LruCache<K: Eq + Hash, V, S: BuildHasher = DefaultHashBuilder, M: CountableMeter<K, V> = Count> { /* fields omitted */ }
Expand description

An LRU cache.

Implementations

Creates an empty cache that can hold at most capacity items.

Examples

ⓘ
use ritecache::{Cache, LruCache};
let mut cache: LruCache<i32, &str> = LruCache::new(10);

Creates an empty cache that can hold at most capacity as measured by meter.

You can implement the Meter trait to allow custom metrics.

Examples

ⓘ
use ritecache::{Cache, LruCache, Meter};
use std::borrow::Borrow;

/// Measure Vec items by their length
struct VecLen;

impl<K, T> Meter<K, Vec<T>> for VecLen {
    // Use `Measure = usize` or implement `CountableMeter` as well.
    type Measure = usize;
    fn measure<Q: ?Sized>(&self, _: &Q, v: &Vec<T>) -> usize
        where K: Borrow<Q>
    {
        v.len()
    }
}

let mut cache = LruCache::with_meter(5, VecLen);
cache.put(1, vec![1, 2]);
assert_eq!(cache.size(), 2);
cache.put(2, vec![3, 4]);
cache.put(3, vec![5, 6]);
assert_eq!(cache.size(), 4);
assert_eq!(cache.len(), 2);

Creates an empty cache that can hold at most capacity items with the given hash builder.

Returns an iterator over the cache’s key-value pairs in least- to most-recently-used order.

Accessing the cache through the iterator does not affect the cache’s LRU state.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(2);

cache.put(1, 10);
cache.put(2, 20);
cache.put(3, 30);

let kvs: Vec<_> = cache.iter().collect();
assert_eq!(kvs, [(&2, &20), (&3, &30)]);

Returns an iterator over the cache’s key-value pairs in least- to most-recently-used order, with mutable references to the values.

Accessing the cache through the iterator does not affect the cache’s LRU state. Note that this method is not available for cache objects using Meter implementations. other than Count.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(2);

cache.put(1, 10);
cache.put(2, 20);
cache.put(3, 30);

let mut n = 2;

for (k, v) in cache.iter_mut() {
    assert_eq!(*k, n);
    assert_eq!(*v, n * 10);
    *v *= 10;
    n += 1;
}

assert_eq!(n, 4);
assert_eq!(cache.get_mut(&2), Some(&mut 200));
assert_eq!(cache.get_mut(&3), Some(&mut 300));

Trait Implementations

Creates an empty cache that can hold at most capacity as measured by meter with the given hash builder.

Returns a reference to the value corresponding to the given key in the cache, if any.

Note that this method is not available for cache objects using Meter implementations other than Count.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(2);

cache.put(1, "a");
cache.put(2, "b");
cache.put(2, "c");
cache.put(3, "d");

assert_eq!(cache.get(&1), None);
assert_eq!(cache.get(&2), Some(&"c"));

Returns a mutable reference to the value corresponding to the given key in the cache, if any.

Note that this method is not available for cache objects using Meter implementations other than Count.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(2);

cache.put(1, "a");
cache.put(2, "b");
cache.put(2, "c");
cache.put(3, "d");

assert_eq!(cache.get_mut(&1), None);
assert_eq!(cache.get_mut(&2), Some(&mut "c"));

Returns a reference to the value corresponding to the key in the cache or None if it is not present in the cache. Unlike get, peek does not update the LRU list so the key’s position will be unchanged.

Example

ⓘ
use ritecache::{Cache, LruCache};
let mut cache = LruCache::new(2);

cache.put(1, "a");
cache.put(2, "b");

assert_eq!(cache.peek(&1), Some(&"a"));
assert_eq!(cache.peek(&2), Some(&"b"));

Returns a mutable reference to the value corresponding to the key in the cache or None if it is not present in the cache. Unlike get_mut, peek_mut does not update the LRU list so the key’s position will be unchanged.

Example

ⓘ
use ritecache::{Cache, LruCache};
let mut cache = LruCache::new(2);

cache.put(1, "a");
cache.put(2, "b");

assert_eq!(cache.peek_mut(&1), Some(&mut "a"));
assert_eq!(cache.peek_mut(&2), Some(&mut "b"));

Returns the value corresponding to the least recently used item or None if the cache is empty. Like peek, peek_lru does not update the LRU list so the item’s position will be unchanged.

Example

ⓘ
use ritecache::{Cache, LruCache};
let mut cache = LruCache::new(2);

cache.put(1, "a");
cache.put(2, "b");

assert_eq!(cache.peek_by_policy(), Some((&1, &"a")));

Checks if the map contains the given key.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(1);

cache.put(1, "a");
assert!(cache.contains(&1));

Inserts a key-value pair into the cache. If the key already existed, the old value is returned.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(2);

cache.put(1, "a");
cache.put(2, "b");
assert_eq!(cache.get_mut(&1), Some(&mut "a"));
assert_eq!(cache.get_mut(&2), Some(&mut "b"));

Removes the given key from the cache and returns its corresponding value.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(2);

cache.put(2, "a");

assert_eq!(cache.pop(&1), None);
assert_eq!(cache.pop(&2), Some("a"));
assert_eq!(cache.pop(&2), None);
assert_eq!(cache.len(), 0);

Removes and returns the least recently used key-value pair as a tuple.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(2);

cache.put(1, "a");
cache.put(2, "b");

assert_eq!(cache.pop_by_policy(), Some((1, "a")));
assert_eq!(cache.len(), 1);

Sets the size of the key-value pairs the cache can hold, as measured by the Meter used by the cache.

Removes least-recently-used key-value pairs if necessary.

Examples

ⓘ
use ritecache::{Cache, LruCache};

let mut cache = LruCache::new(2);

cache.put(1, "a");
cache.put(2, "b");
cache.put(3, "c");

assert_eq!(cache.get_mut(&1), None);
assert_eq!(cache.get_mut(&2), Some(&mut "b"));
assert_eq!(cache.get_mut(&3), Some(&mut "c"));

cache.set_capacity(3);
cache.put(1, "a");
cache.put(2, "b");

assert_eq!(cache.get_mut(&1), Some(&mut "a"));
assert_eq!(cache.get_mut(&2), Some(&mut "b"));
assert_eq!(cache.get_mut(&3), Some(&mut "c"));

cache.set_capacity(1);

assert_eq!(cache.get_mut(&1), None);
assert_eq!(cache.get_mut(&2), None);
assert_eq!(cache.get_mut(&3), Some(&mut "c"));

Returns the number of key-value pairs in the cache.

Returns the size of all the key-value pairs in the cache, as measured by the Meter used by the cache.

Returns the maximum size of the key-value pairs the cache can hold, as measured by the Meter used by the cache.

Examples

ⓘ
use ritecache::{Cache, LruCache};
let mut cache: LruCache<i32, &str> = LruCache::new(2);
assert_eq!(cache.capacity(), 2);

Returns true if the cache contains no key-value pairs.

Removes all key-value pairs from the cache.

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Formats the value using the given formatter. Read more

Extends a collection with the contents of an iterator. Read more

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements. Read more

The type of the elements being iterated over.

Which kind of iterator are we turning this into?

Creates an iterator from a value. Read more

The type of the elements being iterated over.

Which kind of iterator are we turning this into?

Creates an iterator from a value. Read more

The type of the elements being iterated over.

Which kind of iterator are we turning this into?

Creates an iterator from a value. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Performs the conversion.

Performs the conversion.

The resulting type after obtaining ownership.

Creates owned data from borrowed data, usually by cloning. Read more

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.