Struct weight_cache::WeightCache

pub struct WeightCache<K, V, S = RandomState> { /* fields omitted */ }

Implementations

impl<K: Hash + Eq, V: Weigheable> WeightCache<K, V>

pub fn new(capacity: NonZeroUsize) -> Self

impl<K: Hash + Eq, V: Weigheable, S: BuildHasher> WeightCache<K, V, S>

pub fn with_hasher(capacity: NonZeroUsize, hasher: S) -> Self

Create a WeightCache with a custom hasher.

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

Returns a reference to the value corresponding to the given key, if it exists.

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

Returns a mutable reference to the value corresponding to the given key, if it exists.

pub fn len(&self) -> usize

Returns the number of key-value pairs in the cache.

pub fn is_empty(&self) -> bool

Returns true if the cache contains no key-value pairs.

pub fn put(&mut self, key: K, value: V) -> Result<(), ValueTooBigError>

Inserts a key-value pair into the cache. Returns an error if the value is too bigger than the cache’s configured max size.

pub fn iter(&self) -> Iter<'_, K, V>

Returns an iterator over the cache’s key-value pairs in least- to most-recently-used order.

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>

Returns a mutable iterator over the cache’s key-value pairs in least- to most-recently-used order.

Trait Implementations

impl<K, V, S> Debug for WeightCache<K, V, S>

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

Formats the value using the given formatter.

impl<K: Hash + Eq, V: Weigheable> Default for WeightCache<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K: Hash + Eq, V, S: BuildHasher + Default> IntoIterator for WeightCache<K, V, S>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.