Struct ArcCache 

pub struct ArcCache<K, V, S = RandomState>
where
    K: Eq + Hash,
    S: BuildHasher,
{ /* private fields */ }

Implementations

impl<K, V> ArcCache<K, V>

where K: Eq + Hash,

pub fn new(capacity: usize) -> Result<Self, &'static str>

impl<K, V, S> ArcCache<K, V, S>

where K: Eq + Hash, S: BuildHasher,

pub fn with_hasher( capacity: usize, hash_builder: S, ) -> Result<Self, &'static str>

where S: Clone,

Creates an empty cache that can hold at most capacity items with the given hash builder.

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

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

pub fn insert(&mut self, key: K, value: V) -> bool

pub fn peek_mut(&mut self, key: &K) -> Option<&mut V>

where K: Clone + Hash + Eq,

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

where K: Clone + Hash + Eq,

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

pub fn clear(&mut self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn frequent_len(&self) -> usize

pub fn recent_len(&self) -> usize

pub fn inserted(&self) -> u64

pub fn evicted(&self) -> u64

pub fn removed(&self) -> u64

Trait Implementations

impl<'a, K, V, S> IntoIterator for &'a ArcCache<K, V, S>

where K: Eq + Hash, S: BuildHasher,

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = ArcCacheIterator<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.