Struct rustls::limited_cache::LimitedCache

pub(crate) struct LimitedCache<K: Clone + Hash + Eq, V> {
    map: HashMap<K, V>,
    oldest: VecDeque<K>,
}

A HashMap-alike, which never gets larger than a specified capacity, and evicts the oldest insertion to maintain this.

The requested capacity may be rounded up by the underlying collections. This implementation uses all the allocated storage.

This is inefficient: it stores keys twice.

Fields

map: HashMap<K, V>

oldest: VecDeque<K>

Implementations

impl<K, V> LimitedCache<K, V>

where K: Eq + Hash + Clone + Debug, V: Default,

pub(crate) fn new(capacity_order_of_magnitude: usize) -> Self

Create a new LimitedCache with the given rough capacity.

pub(crate) fn get_or_insert_default_and_edit( &mut self, k: K, edit: impl FnOnce(&mut V), )

pub(crate) fn insert(&mut self, k: K, v: V)

pub(crate) fn get<Q: Hash + Eq + ?Sized>(&self, k: &Q) -> Option<&V>

where K: Borrow<Q>,

pub(crate) fn get_mut<Q: Hash + Eq + ?Sized>(&mut self, k: &Q) -> Option<&mut V>

where K: Borrow<Q>,

pub(crate) fn remove<Q: Hash + Eq + ?Sized>(&mut self, k: &Q) -> Option<V>

where K: Borrow<Q>,