Struct CacheState 

pub struct CacheState<K, V> {
    pub capacity: usize,
    /* private fields */
}

Complete valid cache state ordered least- to most-recently used.

Fields

capacity: usize

Positive maximum number of entries.

Implementations

impl<K, V> CacheState<K, V>

pub fn entries(&self) -> &[CacheEntry<K, V>]

Entries ordered from next eviction candidate to most recently used.

pub fn len(&self) -> usize

Current retained entry count.

pub fn is_empty(&self) -> bool

Whether the cache currently retains no entry.

Trait Implementations

impl<K: Clone, V: Clone> Clone for CacheState<K, V>

fn clone(&self) -> CacheState<K, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for CacheState<K, V>

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

Formats the value using the given formatter.

impl<K: PartialEq, V: PartialEq> PartialEq for CacheState<K, V>

fn eq(&self, other: &CacheState<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Eq, V: Eq> Eq for CacheState<K, V>

impl<K, V> StructuralPartialEq for CacheState<K, V>