Struct GdsfCache 

pub struct GdsfCache<K, V, S = DefaultHashBuilder> { /* private fields */ }

An implementation of a Greedy Dual-Size Frequency (GDSF) cache.

Implementations

impl<K: Hash + Eq, V: Clone, S: BuildHasher> GdsfCache<K, V, S>

pub fn with_hasher(cap: NonZeroUsize, hash_builder: S) -> Self

pub fn cap(&self) -> NonZeroUsize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn global_age(&self) -> f64

pub fn record_miss(&mut self, object_size: u64)

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

where K: Borrow<Q> + Clone, Q: ?Sized + Hash + Eq,

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

where K: Borrow<Q> + Clone, Q: ?Sized + Hash + Eq,

pub fn contains_key<Q>(&self, key: &Q) -> bool

where K: Borrow<Q>, Q: ?Sized + Hash + Eq,

pub fn put(&mut self, key: K, val: V, size: u64) -> Option<V>

where K: Clone,

pub fn pop<Q>(&mut self, key: &Q) -> Option<V>

where K: Borrow<Q>, Q: ?Sized + Hash + Eq,

pub fn clear(&mut self)

impl<K: Hash + Eq, V: Clone> GdsfCache<K, V, DefaultHashBuilder>

pub fn new(cap: NonZeroUsize) -> Self

Trait Implementations

impl<K: Hash + Eq, V: Clone, S: BuildHasher> CacheMetrics for GdsfCache<K, V, S>

fn metrics(&self) -> BTreeMap<String, f64>

Returns all metrics as key-value pairs in deterministic order

fn algorithm_name(&self) -> &'static str

Algorithm name for identification

impl<K: Debug, V: Debug, S: Debug> Debug for GdsfCache<K, V, S>

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

Formats the value using the given formatter.