Struct AsyncShardedHashMap 

pub struct AsyncShardedHashMap<K, V, S = FxBuildHasher>
where
    K: Eq + Hash + Clone + Send + Sync,
    V: Clone + Send + Sync,
    S: BuildHasher + Clone + Send + Sync,
{ /* private fields */ }

Available on crate feature async only.

Asynchronous sharded concurrent HashMap (Tokio RwLock).

Implementations

impl<K, V> AsyncShardedHashMap<K, V, FxBuildHasher>

where K: Eq + Hash + Clone + Send + Sync, V: Clone + Send + Sync,

pub fn new(shard_count: usize) -> Self

Create with default hasher.

Arguments

• shard_count: number of shards (0 defaults to DEFAULT_SHARDS).

Returns

• Self: new async sharded hash map.

impl<K, V, S> AsyncShardedHashMap<K, V, S>

where K: Eq + Hash + Clone + Send + Sync, V: Clone + Send + Sync, S: BuildHasher + Clone + Send + Sync,

pub fn with_shards_and_hasher(shard_count: usize, hasher: S) -> Self

Create with custom hasher.

Arguments

• shard_count: number of shards (0 defaults to `DEFAULT_SHARDS
• hasher: user-supplied hasher instance.

Returns

• Self: new async sharded hash map.

pub fn shard_count(&self) -> usize

Configured shard capacity.

Returns

• usize: number of shard slots.

pub async fn initialized_shards(&self) -> usize

Number of initialized shards.

Returns

• usize: count of allocated shards.

pub async fn insert(&self, key: K, value: V) -> Option<V>

Insert key/value asynchronously.

Arguments

• key: key to insert.
• value: value to associate with the key.

Returns

• Option<V>: previous value if the key was already present.

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

Get cloned value; uses try_read first (fast path, reduces scheduler churn).

Arguments

• key: key to look up.

Returns

• Option<V>: cloned value if the key exists.

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

Check if a key exists; uses try_read first (fast path, reduces scheduler churn).

Arguments

• key: key to check.

Returns

• bool: true if the key exists in the map, false otherwise.

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

Remove key.

Arguments

• key: key to remove.

Returns

• Option<V>: previous value if the key existed.

pub async fn len(&self) -> usize

Length (atomic).

Returns

• usize: total number of key/value pairs in the map.

pub async fn is_empty(&self) -> bool

Empty check.

Returns

• bool: true if the map contains no entries.

pub async fn clear(&self)

Clear (retains allocated shards).

Notes

• Resets length counter to zero.

pub async fn iter(&self) -> Vec<(K, V)>

Snapshot iteration (async).

Steps:

1. Snapshot Arc list of initialized shards under read lock of the shard vector.
2. For each shard: try try_read; fallback to await read.
3. Clone inner HashMaps (short critical sections).
4. If rayon enabled, parallel flatten of snapshots.

Returns a materialized Vec.

impl<K, V> AsyncShardedHashMap<K, V>

where K: Eq + Hash + Clone + Send + Sync + Serialize, V: Clone + Send + Sync + Serialize,

pub async fn async_snapshot_serializable( &self, ) -> AsyncShardedHashMapSnapshot<K, V>

Available on crate feature serde only.

Obtain a serializable snapshot wrapper (for serde).

Trait Implementations

impl<K, V, S> Clone for AsyncShardedHashMap<K, V, S>

where K: Eq + Hash + Clone + Send + Sync + Clone, V: Clone + Send + Sync + Clone, S: BuildHasher + Clone + Send + Sync + Clone,

fn clone(&self) -> AsyncShardedHashMap<K, V, S>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.