Struct fastcache::Cache

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

A not so accurate but performant time and capacity based cache.

Implementations

impl<K, V> Cache<K, V>where K: Eq + Hash + Clone, V: Clone,

pub fn new(capacity: usize, ttl: Duration) -> Self

Create a new cache with the given capacity and time-to-live (TTL) for values.

pub fn len(&self) -> usize

Get the number of elements in the cache.

pub fn capacity(&self) -> usize

Get the capacity of the cache.

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

Get the value associated with the given key, if it exists and is not expired.

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

Insert a key-value pair in the cache.

If the cache is full, it will evict the oldest entry.