Type Alias ShardedHashMap 

pub type ShardedHashMap<K, V> = Sharded<HashTable<(K, V)>>;

Aliased Type

pub enum ShardedHashMap<K, V> {
    Single(Lock<HashTable<(K, V)>>),
    Shards(Box<[CacheAligned<Lock<HashTable<(K, V)>>>; 32]>),
}

Variants

Single(Lock<HashTable<(K, V)>>)

Shards(Box<[CacheAligned<Lock<HashTable<(K, V)>>>; 32]>)

Implementations

impl<K: Eq, V> ShardedHashMap<K, V>

pub fn with_capacity(cap: usize) -> Self

pub fn len(&self) -> usize

impl<K: Eq + Hash, V> ShardedHashMap<K, V>

pub fn get<Q>(&self, key: &Q) -> Option<V>

where K: Borrow<Q>, Q: Hash + Eq, V: Clone,

pub fn get_or_insert_with(&self, key: K, default: impl FnOnce() -> V) -> V

where V: Copy,

pub fn insert_unique(&self, key: K, value: V)

Insert value into the ShardedHashMap with unique key.

This function panics if debug_assertions are enabled and uniqueness is violated. If uniqueness is violated but debug_assertions are disabled then lookups will arbitrarily return one of the inserted elements.

impl<K: Eq + Hash + Copy> ShardedHashMap<K, ()>

pub fn intern_ref<Q>(&self, value: &Q, make: impl FnOnce() -> K) -> K

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

pub fn intern<Q>(&self, value: Q, make: impl FnOnce(Q) -> K) -> K

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

impl<K: Eq + Hash + Copy + IntoPointer> ShardedHashMap<K, ()>

pub fn contains_pointer_to<T: Hash + IntoPointer>(&self, value: &T) -> bool

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.