Struct SharedMap 

pub struct SharedMap<K: Eq + Clone + Hash, V>(/* private fields */);

Concurrent map wrapper over DashMap providing ergonomic scoped access.

Implementations

impl<K: Eq + Hash + Clone, V> SharedMap<K, V>

pub fn new() -> Self

Create a new concurrent map.

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

where V: Clone,

Get an owned clone of a value.

This releases the map entry guard immediately, so the entry may be removed or replaced while the caller is still using the clone. Use this only when stale clones are acceptable. Prefer Self::with or Self::with_mut when later work depends on the entry still being present.

pub fn with<F, R>(&self, key: &K, f: F) -> Option<R>

where F: FnOnce(&V) -> R,

Read a value for a key using a closure.

Caution: f runs while the entry guard is held. Avoid re-entering this SharedMap from inside the closure.

pub fn with_mut<F, R>(&self, key: &K, f: F) -> Option<R>

where F: FnOnce(&mut V) -> R,

Mutate a value for a key using a closure.

Caution: f runs while the entry guard is held. Avoid re-entering this SharedMap from inside the closure.

pub fn with_mut_or_insert_with<F, D, R>(&self, key: K, default: D, f: F) -> R

where F: FnOnce(&mut V) -> R, D: FnOnce() -> V,

Mutate an entry, inserting a value produced by default when absent.

pub fn with_mut_or_default<F, R>(&self, key: K, f: F) -> R

where V: Default, F: FnOnce(&mut V) -> R,

Mutate an entry, inserting its default value when absent.

pub fn for_each<F, Ret>(&self, f: F)

where F: FnMut(K, &V) -> Ret,

Iterate over all entries immutably.

Caution: f runs while an iterator entry guard is held. Avoid re-entering this SharedMap from inside the closure.

pub fn for_each_mut<F, Ret>(&self, f: F)

where F: FnMut(K, &mut V) -> Ret,

Iterate over all entries mutably.

Caution: f runs while an iterator entry guard is held. Avoid re-entering this SharedMap from inside the closure.

pub fn try_for_each_mut<F, E>(&self, f: F) -> Result<(), E>

where F: FnMut(K, &mut V) -> Result<(), E>,

Fallible mutable iteration over all entries.

Caution: f runs while an iterator entry guard is held. Avoid re-entering this SharedMap from inside the closure.

pub fn try_for_each<F, E>(&self, f: F) -> Result<(), E>

where F: FnMut(K, &V) -> Result<(), E>,

Fallible iteration over all entries.

Caution: f runs while an iterator entry guard is held. Avoid re-entering this SharedMap from inside the closure.

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

Insert a key-value pair.

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

Remove a key.

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

Check if a key exists.

pub fn retain<F>(&self, f: F)

where F: FnMut(&K, &mut V) -> bool,

Retain entries matching predicate.

Caution: f runs while DashMap is mutating internal shards. Avoid re-entering this SharedMap from inside the predicate.

pub fn keys(&self) -> Vec<K>

where K: Clone,

Collect all keys.

pub fn len(&self) -> usize

Number of entries.

pub fn is_empty(&self) -> bool

Check if empty.

pub fn clear(&self)

Clears the collection.

Trait Implementations

impl<K: Eq + Clone + Hash, V> Clone for SharedMap<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Eq + Clone + Hash, V: Debug> Debug for SharedMap<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K: Eq + Hash + Clone, V> Default for SharedMap<K, V>

fn default() -> Self

Returns the “default value” for a type.