Struct HashMap

pub struct HashMap<K, V, const N: usize> { /* private fields */ }

HashMap is a sharded hashmap which uses N buckets, each protected with an Read/Write lock. N gets rounded to nearest power of two.

Implementations

impl<'a, K: Clone + Send + Sync, V: Clone + Send + Sync, const N: usize> HashMap<K, V, N>

pub fn new() -> Self

new returns an instance with N shards. N gets rounded to nearest power of two.

pub fn new_arc() -> Arc<Self>

new_arc returns a new instance contained in an arc pointer.

pub fn with_shard(shards_size: usize) -> Self

with_shard returns a new instance with N shards. N gets rounded to nearest power of two.

pub fn get_shard(&'a self, key: K) -> (&'a Arc<RwLock<Shard<K, V>>>, u64)

where K: Hash + Eq + IKey<K>, V: Clone,

get_shard returns the shard lock along with its hash.

pub fn get_owned(&'a self, key: K) -> Option<V>

where K: Hash + Eq + IKey<K>, V: Clone,

get_owned returns the cloned value associated with the given key.

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

where K: Hash + Eq + IKey<K>,

insert inserts the given key, value pair into a shard based on the hash value of key.

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

where K: Hash + Eq + IKey<K>,

remove removes the entry associated with key from the corresponding shard.

pub fn contains(&self, key: K) -> bool

where K: Hash + Eq + IKey<K>,

contains returns whether any entry is associated with the given key.

pub fn len(&self) -> usize

len returns the sum of total number of all entries stored in each shard table.

pub fn into_iter(&self) -> IntoIter<K, V>

into_iter creates an iterator for shards.

Trait Implementations

impl<K: Clone + Send + Sync, V: Clone + Send + Sync, const N: usize> Default for HashMap<K, V, N>

fn default() -> Self

Returns the “default value” for a type.