Struct MemoryCache

pub struct MemoryCache<K: Hash, T: Clone> { /* private fields */ }

A high performant in-memory cache with S3-FIFO + TinyLFU

Implementations

impl<K: Hash, T: Clone + Send + Sync + 'static> MemoryCache<K, T>

pub fn new(size: usize) -> Self

Create a new MemoryCache with the given size.

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

Fetch the key and return its value in addition to a CacheStatus.

pub fn put(&self, key: &K, value: T, ttl: Option<Duration>)

Insert a key and value pair with an optional TTL into the cache.

An item with zero TTL of zero will not be inserted.

pub fn remove(&self, key: &K)

Remove a key from the cache if it exists.

pub fn multi_get<'a, I>(&self, keys: I) -> Vec<(Option<T>, CacheStatus)>

where I: Iterator<Item = &'a K>, K: 'a,

This is equivalent to MemoryCache::get but for an arbitrary amount of keys.

pub fn multi_get_with_miss<'a, I>( &self, keys: I, ) -> (Vec<(Option<T>, CacheStatus)>, Vec<&'a K>)

where I: Iterator<Item = &'a K>, K: 'a,

Same as MemoryCache::multi_get but returns the keys that are missing from the cache.