Struct CountedHashMap 

pub struct CountedHashMap<K, V, S = DefaultHashBuilder> { /* private fields */ }

Implementations

impl<K, V> CountedHashMap<K, V>

where K: Eq + Hash,

pub fn new() -> Self

impl<K, V, S> CountedHashMap<K, V, S>

where K: Eq + Hash, S: BuildHasher + Clone + Default,

pub fn with_hasher(hasher: S) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn find<Q>(&self, q: &Q) -> Option<CountedHandle<'static>>

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

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

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

pub fn insert( &mut self, key: K, value: V, ) -> Result<CountedHandle<'static>, InsertError>

Insert a new key -> value and mint a token for the returned handle.

pub fn get(&self, h: &CountedHandle<'_>) -> CountedHandle<'static>

Mint another token for the same entry; used to clone a counted handle.

pub fn insert_with<F>( &mut self, key: K, default: F, ) -> Result<CountedHandle<'static>, InsertError>

where F: FnOnce() -> V,

Insert using a lazy value constructor; only calls default() when inserting.

pub fn put(&mut self, h: CountedHandle<'_>) -> PutResult<K, V>

Return a token for an entry; removes and returns (K, V) when count hits zero.

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

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

Trait Implementations

impl<K, V> Default for CountedHashMap<K, V>

where K: Eq + Hash,

fn default() -> Self

Returns the “default value” for a type.