Struct Lru 

pub struct Lru<K: Ord + Clone, V> {
    pub max_len: usize,
    pub max_weight: u64,
    /* private fields */
}

a least-recently-used map

Fields

max_len: usize

entries at most (0: no limit)

max_weight: u64

summed weight at most (0: no limit)

Implementations

impl<K: Ord + Clone, V> Lru<K, V>

pub fn new(max_len: usize, max_weight: u64) -> Lru<K, V>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn weight(&self) -> u64

the summed weight of the entries

pub fn contains(&self, k: &K) -> bool

pub fn peek(&self, k: &K) -> Option<&V>

an entry without counting it as a use

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

an entry; it becomes the most recently used

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

an entry to change in place; it becomes the most recently used

pub fn insert(&mut self, k: K, v: V, weight: u64) -> Vec<(K, V)>

stores an entry (replacing one with the same key) as the most recently used; the entries that had to go for the limits, oldest first

pub fn remove(&mut self, k: &K) -> Option<V>

pub fn pop_lru(&mut self) -> Option<(K, V)>

takes the least recently used entry

pub fn clear(&mut self)

pub fn keys(&self) -> impl Iterator<Item = &K>

the keys, least recently used first

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

the entries in key order (no use counted)

Trait Implementations

impl<K: Clone + Ord + Clone, V: Clone> Clone for Lru<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Ord + Clone, V: Debug> Debug for Lru<K, V>

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

Formats the value using the given formatter.

impl<K: Eq + Ord + Clone, V: Eq> Eq for Lru<K, V>

impl<K: PartialEq + Ord + Clone, V: PartialEq> PartialEq for Lru<K, V>

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<K: PartialEq + Ord + Clone, V: PartialEq> StructuralPartialEq for Lru<K, V>