Struct FifoCache 

pub struct FifoCache<K, V> { /* private fields */ }

A First In, First Out (FIFO) cache for reusing expensive results. Keeps up to your chosen limit and removes the oldest added result when full.

Example

use tiny_cache::FifoCache;

let mut cache = FifoCache::new(2);
cache.insert("first", 10);
cache.insert("second", 20);
assert_eq!(cache.get(&"first"), Some(&10));

cache.insert("third", 30);
assert!(cache.get(&"first").is_none());
assert_eq!(cache.get(&"third"), Some(&30));
assert_eq!(cache.len(), 2);

Implementations

impl<K, V> FifoCache<K, V>

pub fn new(capacity: usize) -> FifoCache<K, V>

impl<K, V> FifoCache<K, V>

where K: Clone + Eq + Hash,

pub fn set_capacity(&mut self, capacity: usize)

Changes how many results to keep, removing the oldest added results if the limit shrinks.

pub fn insert(&mut self, key: K, value: V)

Saves a result to reuse later, removing the oldest added result if there is no room. Replacing an existing result does not move it to the back of the line.

pub fn get(&self, key: &K) -> Option<&V>

pub fn get_mut(&mut self, key: &K) -> Option<&mut V>

Lets you update a saved result without creating a replacement or changing its place in line.

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

Trait Implementations

impl<K, V> Debug for FifoCache<K, V>

where K: Debug, V: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.