Struct dashmap::DashMap

source ·
pub struct DashMap<K, V, S = RandomState> { /* private fields */ }
Expand description

DashMap is an implementation of a concurrent associative array/hashmap in Rust.

DashMap tries to implement an easy to use API similar to std::collections::HashMap with some slight changes to handle concurrency.

DashMap tries to be very simple to use and to be a direct replacement for RwLock<HashMap<K, V, S>>. To accomplish this, all methods take &self instead of modifying methods taking &mut self. This allows you to put a DashMap in an Arc<T> and share it between threads while being able to modify it.

Documentation mentioning locking behaviour acts in the reference frame of the calling thread. This means that it is safe to ignore it across multiple threads.

Implementations§

source§

impl<K, V, S> DashMap<K, V, S>where K: Send + Sync + Eq + Hash, V: Send + Sync, S: Send + Sync + Clone + BuildHasher,

source

pub fn par_iter_mut(&self) -> IterMut<'_, K, V, S>

source§

impl<'a, K: 'a + Eq + Hash, V: 'a> DashMap<K, V, RandomState>

source

pub fn new() -> Self

Creates a new DashMap with a capacity of 0.

Examples
use dashmap::DashMap;

let reviews = DashMap::new();
reviews.insert("Veloren", "What a fantastic game!");
source

pub fn with_capacity(capacity: usize) -> Self

Creates a new DashMap with a specified starting capacity.

Examples
use dashmap::DashMap;

let mappings = DashMap::with_capacity(2);
mappings.insert(2, 4);
mappings.insert(8, 16);
source

pub fn with_shard_amount(shard_amount: usize) -> Self

Creates a new DashMap with a specified shard amount

shard_amount should greater than 0 and be a power of two. If a shard_amount which is not a power of two is provided, the function will panic.

Examples
use dashmap::DashMap;

let mappings = DashMap::with_shard_amount(32);
mappings.insert(2, 4);
mappings.insert(8, 16);
source

pub fn with_capacity_and_shard_amount( capacity: usize, shard_amount: usize ) -> Self

Creates a new DashMap with a specified capacity and shard amount.

shard_amount should greater than 0 and be a power of two. If a shard_amount which is not a power of two is provided, the function will panic.

Examples
use dashmap::DashMap;

let mappings = DashMap::with_capacity_and_shard_amount(32, 32);
mappings.insert(2, 4);
mappings.insert(8, 16);
source§

impl<'a, K: 'a + Eq + Hash, V: 'a, S: BuildHasher + Clone> DashMap<K, V, S>

source

pub fn into_read_only(self) -> ReadOnlyView<K, V, S>

Wraps this DashMap into a read-only view. This view allows to obtain raw references to the stored values.

source

pub fn with_hasher(hasher: S) -> Self

Creates a new DashMap with a capacity of 0 and the provided hasher.

Examples
use dashmap::DashMap;
use std::collections::hash_map::RandomState;

let s = RandomState::new();
let reviews = DashMap::with_hasher(s);
reviews.insert("Veloren", "What a fantastic game!");
source

pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> Self

Creates a new DashMap with a specified starting capacity and hasher.

Examples
use dashmap::DashMap;
use std::collections::hash_map::RandomState;

let s = RandomState::new();
let mappings = DashMap::with_capacity_and_hasher(2, s);
mappings.insert(2, 4);
mappings.insert(8, 16);
source

pub fn with_hasher_and_shard_amount(hasher: S, shard_amount: usize) -> Self

Creates a new DashMap with a specified hasher and shard amount

shard_amount should be greater than 0 and a power of two. If a shard_amount which is not a power of two is provided, the function will panic.

Examples
use dashmap::DashMap;
use std::collections::hash_map::RandomState;

let s = RandomState::new();
let mappings = DashMap::with_hasher_and_shard_amount(s, 32);
mappings.insert(2, 4);
mappings.insert(8, 16);
source

pub fn with_capacity_and_hasher_and_shard_amount( capacity: usize, hasher: S, shard_amount: usize ) -> Self

Creates a new DashMap with a specified starting capacity, hasher and shard_amount.

shard_amount should greater than 0 and be a power of two. If a shard_amount which is not a power of two is provided, the function will panic.

Examples
use dashmap::DashMap;
use std::collections::hash_map::RandomState;

let s = RandomState::new();
let mappings = DashMap::with_capacity_and_hasher_and_shard_amount(2, s, 32);
mappings.insert(2, 4);
mappings.insert(8, 16);
source

pub fn hash_usize<T: Hash>(&self, item: &T) -> usize

Hash a given item to produce a usize. Uses the provided or default HashBuilder.

source

pub fn shards(&self) -> &[RwLock<HashMap<K, SharedValue<V>, S>>]

Allows you to peek at the inner shards that store your data. You should probably not use this unless you know what you are doing.

Requires the raw-api feature to be enabled.

Examples
use dashmap::DashMap;

let map = DashMap::<(), ()>::new();
println!("Amount of shards: {}", map.shards().len());
source

pub fn shards_mut(&mut self) -> &mut [RwLock<HashMap<K, SharedValue<V>, S>>]

Provides mutable access to the inner shards that store your data. You should probably not use this unless you know what you are doing.

Requires the raw-api feature to be enabled.

Examples
use dashmap::DashMap;
use dashmap::SharedValue;

let mut map = DashMap::<i32, &'static str>::new();
let shard_ind = map.determine_map(&42);
map.shards_mut()[shard_ind].get_mut().insert(42, SharedValue::new("forty two"));
assert_eq!(*map.get(&42).unwrap(), "forty two");
source

pub fn into_shards(self) -> Box<[RwLock<HashMap<K, SharedValue<V>, S>>]>

Consumes this DashMap and returns the inner shards. You should probably not use this unless you know what you are doing.

Requires the raw-api feature to be enabled.

See DashMap::shards() and DashMap::shards_mut() for more information.

source

pub fn determine_map<Q>(&self, key: &Q) -> usizewhere K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Finds which shard a certain key is stored in. You should probably not use this unless you know what you are doing. Note that shard selection is dependent on the default or provided HashBuilder.

Requires the raw-api feature to be enabled.

Examples
use dashmap::DashMap;

let map = DashMap::new();
map.insert("coca-cola", 1.4);
println!("coca-cola is stored in shard: {}", map.determine_map("coca-cola"));
source

pub fn determine_shard(&self, hash: usize) -> usize

Finds which shard a certain hash is stored in.

Requires the raw-api feature to be enabled.

Examples
use dashmap::DashMap;

let map: DashMap<i32, i32> = DashMap::new();
let key = "key";
let hash = map.hash_usize(&key);
println!("hash is stored in shard: {}", map.determine_shard(hash));
source

pub fn hasher(&self) -> &S

Returns a reference to the map’s BuildHasher.

Examples
use dashmap::DashMap;
use std::collections::hash_map::RandomState;

let hasher = RandomState::new();
let map: DashMap<i32, i32> = DashMap::new();
let hasher: &RandomState = map.hasher();
source

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

Inserts a key and a value into the map. Returns the old value associated with the key if there was one.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let map = DashMap::new();
map.insert("I am the key!", "And I am the value!");
source

pub fn remove<Q>(&self, key: &Q) -> Option<(K, V)>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Removes an entry from the map, returning the key and value if they existed in the map.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let soccer_team = DashMap::new();
soccer_team.insert("Jack", "Goalie");
assert_eq!(soccer_team.remove("Jack").unwrap().1, "Goalie");
source

pub fn remove_if<Q>( &self, key: &Q, f: impl FnOnce(&K, &V) -> bool ) -> Option<(K, V)>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Removes an entry from the map, returning the key and value if the entry existed and the provided conditional function returned true.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

use dashmap::DashMap;

let soccer_team = DashMap::new();
soccer_team.insert("Sam", "Forward");
soccer_team.remove_if("Sam", |_, position| position == &"Goalie");
assert!(soccer_team.contains_key("Sam"));
use dashmap::DashMap;

let soccer_team = DashMap::new();
soccer_team.insert("Sam", "Forward");
soccer_team.remove_if("Sam", |_, position| position == &"Forward");
assert!(!soccer_team.contains_key("Sam"));
source

pub fn remove_if_mut<Q>( &self, key: &Q, f: impl FnOnce(&K, &mut V) -> bool ) -> Option<(K, V)>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source

pub fn iter(&'a self) -> Iter<'a, K, V, S, DashMap<K, V, S>>

Creates an iterator over a DashMap yielding immutable references.

Locking behaviour: May deadlock if called when holding a mutable reference into the map.

Examples
use dashmap::DashMap;

let words = DashMap::new();
words.insert("hello", "world");
assert_eq!(words.iter().count(), 1);
source

pub fn iter_mut(&'a self) -> IterMut<'a, K, V, S, DashMap<K, V, S>>

Iterator over a DashMap yielding mutable references.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let map = DashMap::new();
map.insert("Johnny", 21);
map.iter_mut().for_each(|mut r| *r += 1);
assert_eq!(*map.get("Johnny").unwrap(), 22);
source

pub fn get<Q>(&'a self, key: &Q) -> Option<Ref<'a, K, V, S>>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Get an immutable reference to an entry in the map

Locking behaviour: May deadlock if called when holding a mutable reference into the map.

Examples
use dashmap::DashMap;

let youtubers = DashMap::new();
youtubers.insert("Bosnian Bill", 457000);
assert_eq!(*youtubers.get("Bosnian Bill").unwrap(), 457000);
source

pub fn get_mut<Q>(&'a self, key: &Q) -> Option<RefMut<'a, K, V, S>>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Get a mutable reference to an entry in the map

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let class = DashMap::new();
class.insert("Albin", 15);
*class.get_mut("Albin").unwrap() -= 1;
assert_eq!(*class.get("Albin").unwrap(), 14);
source

pub fn try_get<Q>(&'a self, key: &Q) -> TryResult<Ref<'a, K, V, S>>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Get an immutable reference to an entry in the map, if the shard is not locked. If the shard is locked, the function will return TryResult::Locked.

Examples
use dashmap::DashMap;
use dashmap::try_result::TryResult;

let map = DashMap::new();
map.insert("Johnny", 21);

assert_eq!(*map.try_get("Johnny").unwrap(), 21);

let _result1_locking = map.get_mut("Johnny");

let result2 = map.try_get("Johnny");
assert!(result2.is_locked());
source

pub fn try_get_mut<Q>(&'a self, key: &Q) -> TryResult<RefMut<'a, K, V, S>>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Get a mutable reference to an entry in the map, if the shard is not locked. If the shard is locked, the function will return TryResult::Locked.

Examples
use dashmap::DashMap;
use dashmap::try_result::TryResult;

let map = DashMap::new();
map.insert("Johnny", 21);

*map.try_get_mut("Johnny").unwrap() += 1;
assert_eq!(*map.get("Johnny").unwrap(), 22);

let _result1_locking = map.get("Johnny");

let result2 = map.try_get_mut("Johnny");
assert!(result2.is_locked());
source

pub fn shrink_to_fit(&self)

Remove excess capacity to reduce memory usage.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

source

pub fn retain(&self, f: impl FnMut(&K, &mut V) -> bool)

Retain elements that whose predicates return true and discard elements whose predicates return false.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let people = DashMap::new();
people.insert("Albin", 15);
people.insert("Jones", 22);
people.insert("Charlie", 27);
people.retain(|_, v| *v > 20);
assert_eq!(people.len(), 2);
source

pub fn len(&self) -> usize

Fetches the total number of key-value pairs stored in the map.

Locking behaviour: May deadlock if called when holding a mutable reference into the map.

Examples
use dashmap::DashMap;

let people = DashMap::new();
people.insert("Albin", 15);
people.insert("Jones", 22);
people.insert("Charlie", 27);
assert_eq!(people.len(), 3);
source

pub fn is_empty(&self) -> bool

Checks if the map is empty or not.

Locking behaviour: May deadlock if called when holding a mutable reference into the map.

Examples
use dashmap::DashMap;

let map = DashMap::<(), ()>::new();
assert!(map.is_empty());
source

pub fn clear(&self)

Removes all key-value pairs in the map.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let stats = DashMap::new();
stats.insert("Goals", 4);
assert!(!stats.is_empty());
stats.clear();
assert!(stats.is_empty());
source

pub fn capacity(&self) -> usize

Returns how many key-value pairs the map can store without reallocating.

Locking behaviour: May deadlock if called when holding a mutable reference into the map.

source

pub fn alter<Q>(&self, key: &Q, f: impl FnOnce(&K, V) -> V)where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Modify a specific value according to a function.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let stats = DashMap::new();
stats.insert("Goals", 4);
stats.alter("Goals", |_, v| v * 2);
assert_eq!(*stats.get("Goals").unwrap(), 8);
Panics

If the given closure panics, then alter will abort the process

source

pub fn alter_all(&self, f: impl FnMut(&K, V) -> V)

Modify every value in the map according to a function.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let stats = DashMap::new();
stats.insert("Wins", 4);
stats.insert("Losses", 2);
stats.alter_all(|_, v| v + 1);
assert_eq!(*stats.get("Wins").unwrap(), 5);
assert_eq!(*stats.get("Losses").unwrap(), 3);
Panics

If the given closure panics, then alter_all will abort the process

source

pub fn view<Q, R>(&self, key: &Q, f: impl FnOnce(&K, &V) -> R) -> Option<R>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Scoped access into an item of the map according to a function.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

Examples
use dashmap::DashMap;

let warehouse = DashMap::new();
warehouse.insert(4267, ("Banana", 100));
warehouse.insert(2359, ("Pear", 120));
let fruit = warehouse.view(&4267, |_k, v| *v);
assert_eq!(fruit, Some(("Banana", 100)));
Panics

If the given closure panics, then view will abort the process

source

pub fn contains_key<Q>(&self, key: &Q) -> boolwhere K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Checks if the map contains a specific key.

Locking behaviour: May deadlock if called when holding a mutable reference into the map.

Examples
use dashmap::DashMap;

let team_sizes = DashMap::new();
team_sizes.insert("Dakota Cherries", 23);
assert!(team_sizes.contains_key("Dakota Cherries"));
source

pub fn entry(&'a self, key: K) -> Entry<'a, K, V, S>

Advanced entry API that tries to mimic std::collections::HashMap. See the documentation on dashmap::mapref::entry for more details.

Locking behaviour: May deadlock if called when holding any sort of reference into the map.

source

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

Advanced entry API that tries to mimic std::collections::HashMap. See the documentation on dashmap::mapref::entry for more details.

Returns None if the shard is currently locked.

source

pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>

Advanced entry API that tries to mimic std::collections::HashMap::try_reserve. Tries to reserve capacity for at least shard * additional and may reserve more space to avoid frequent reallocations.

Errors

If the capacity overflows, or the allocator reports a failure, then an error is returned.

Trait Implementations§

source§

impl<'a, K, V: 'a, S: BuildHasher + Clone, Q> BitAnd<&Q> for &'a DashMap<K, V, S>where K: Borrow<Q> + 'a + Eq + Hash, Q: Hash + Eq + ?Sized,

§

type Output = bool

The resulting type after applying the & operator.
source§

fn bitand(self, key: &Q) -> Self::Output

Performs the & operation. Read more
source§

impl<'a, K, V: 'a, S: BuildHasher + Clone, Q> BitOr<&Q> for &'a DashMap<K, V, S>where K: Borrow<Q> + 'a + Eq + Hash, Q: Hash + Eq + ?Sized,

§

type Output = RefMut<'a, K, V, S>

The resulting type after applying the | operator.
source§

fn bitor(self, key: &Q) -> Self::Output

Performs the | operation. Read more
source§

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

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<K: Eq + Hash + Debug, V: Debug, S: BuildHasher + Clone> Debug for DashMap<K, V, S>

source§

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

Formats the value using the given formatter. Read more
source§

impl<K, V, S> Default for DashMap<K, V, S>where K: Eq + Hash, S: Default + BuildHasher + Clone,

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<'de, K, V, S> Deserialize<'de> for DashMap<K, V, S>where K: Deserialize<'de> + Eq + Hash, V: Deserialize<'de>, S: BuildHasher + Clone + Default,

source§

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl<K: Eq + Hash, V, S: BuildHasher + Clone> Extend<(K, V)> for DashMap<K, V, S>

source§

fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, intoiter: I)

Extends a collection with the contents of an iterator. Read more
source§

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)
Extends a collection with exactly one element.
source§

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)
Reserves capacity in a collection for the given number of additional elements. Read more
source§

impl<K: Eq + Hash, V, S: BuildHasher + Clone + Default> FromIterator<(K, V)> for DashMap<K, V, S>

source§

fn from_iter<I: IntoIterator<Item = (K, V)>>(intoiter: I) -> Self

Creates a value from an iterator. Read more
source§

impl<K, V, S> FromParallelIterator<(K, V)> for DashMap<K, V, S>where K: Send + Sync + Eq + Hash, V: Send + Sync, S: Send + Sync + Clone + Default + BuildHasher,

source§

fn from_par_iter<I>(par_iter: I) -> Selfwhere I: IntoParallelIterator<Item = (K, V)>,

Creates an instance of the collection from the parallel iterator par_iter. Read more
source§

impl<'a, K: Eq + Hash, V, S: BuildHasher + Clone> IntoIterator for &'a DashMap<K, V, S>

§

type Item = RefMulti<'a, K, V, S>

The type of the elements being iterated over.
§

type IntoIter = Iter<'a, K, V, S, DashMap<K, V, S>>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<K: Eq + Hash, V, S: BuildHasher + Clone> IntoIterator for DashMap<K, V, S>

§

type Item = (K, V)

The type of the elements being iterated over.
§

type IntoIter = OwningIter<K, V, S>

Which kind of iterator are we turning this into?
source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more
source§

impl<'a, K, V, S> IntoParallelIterator for &'a DashMap<K, V, S>where K: Send + Sync + Eq + Hash, V: Send + Sync, S: Send + Sync + Clone + BuildHasher,

§

type Iter = Iter<'a, K, V, S>

The parallel iterator type that will be created.
§

type Item = RefMulti<'a, K, V, S>

The type of item that the parallel iterator will produce.
source§

fn into_par_iter(self) -> Self::Iter

Converts self into a parallel iterator. Read more
source§

impl<'a, K, V, S> IntoParallelIterator for &'a mut DashMap<K, V, S>where K: Send + Sync + Eq + Hash, V: Send + Sync, S: Send + Sync + Clone + BuildHasher,

§

type Iter = IterMut<'a, K, V, S>

The parallel iterator type that will be created.
§

type Item = RefMutMulti<'a, K, V, S>

The type of item that the parallel iterator will produce.
source§

fn into_par_iter(self) -> Self::Iter

Converts self into a parallel iterator. Read more
source§

impl<K, V, S> IntoParallelIterator for DashMap<K, V, S>where K: Send + Eq + Hash, V: Send, S: Send + Clone + BuildHasher,

§

type Iter = OwningIter<K, V, S>

The parallel iterator type that will be created.
§

type Item = (K, V)

The type of item that the parallel iterator will produce.
source§

fn into_par_iter(self) -> Self::Iter

Converts self into a parallel iterator. Read more
source§

impl<'a, K: 'a + Eq + Hash, V: 'a, S: 'a + BuildHasher + Clone> Map<'a, K, V, S> for DashMap<K, V, S>

source§

fn _shard_count(&self) -> usize

source§

unsafe fn _get_read_shard( &'a self, i: usize ) -> &'a HashMap<K, SharedValue<V>, S>

Safety Read more
source§

unsafe fn _yield_read_shard( &'a self, i: usize ) -> RwLockReadGuard<'a, HashMap<K, SharedValue<V>, S>>

Safety Read more
source§

unsafe fn _yield_write_shard( &'a self, i: usize ) -> RwLockWriteGuard<'a, HashMap<K, SharedValue<V>, S>>

Safety Read more
source§

unsafe fn _try_yield_read_shard( &'a self, i: usize ) -> Option<RwLockReadGuard<'a, HashMap<K, SharedValue<V>, S>>>

Safety Read more
source§

unsafe fn _try_yield_write_shard( &'a self, i: usize ) -> Option<RwLockWriteGuard<'a, HashMap<K, SharedValue<V>, S>>>

Safety Read more
source§

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

source§

fn _remove<Q>(&self, key: &Q) -> Option<(K, V)>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _remove_if<Q>( &self, key: &Q, f: impl FnOnce(&K, &V) -> bool ) -> Option<(K, V)>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _remove_if_mut<Q>( &self, key: &Q, f: impl FnOnce(&K, &mut V) -> bool ) -> Option<(K, V)>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _iter(&'a self) -> Iter<'a, K, V, S, DashMap<K, V, S>>

source§

fn _iter_mut(&'a self) -> IterMut<'a, K, V, S, DashMap<K, V, S>>

source§

fn _get<Q>(&'a self, key: &Q) -> Option<Ref<'a, K, V, S>>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _get_mut<Q>(&'a self, key: &Q) -> Option<RefMut<'a, K, V, S>>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _try_get<Q>(&'a self, key: &Q) -> TryResult<Ref<'a, K, V, S>>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _try_get_mut<Q>(&'a self, key: &Q) -> TryResult<RefMut<'a, K, V, S>>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _shrink_to_fit(&self)

source§

fn _retain(&self, f: impl FnMut(&K, &mut V) -> bool)

source§

fn _len(&self) -> usize

source§

fn _capacity(&self) -> usize

source§

fn _alter<Q>(&self, key: &Q, f: impl FnOnce(&K, V) -> V)where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _alter_all(&self, f: impl FnMut(&K, V) -> V)

source§

fn _view<Q, R>(&self, key: &Q, f: impl FnOnce(&K, &V) -> R) -> Option<R>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _entry(&'a self, key: K) -> Entry<'a, K, V, S>

source§

fn _try_entry(&'a self, key: K) -> Option<Entry<'a, K, V, S>>

source§

fn _hasher(&self) -> S

source§

fn _clear(&self)

source§

fn _contains_key<Q>(&'a self, key: &Q) -> boolwhere K: Borrow<Q>, Q: Hash + Eq + ?Sized,

source§

fn _is_empty(&self) -> bool

source§

impl<K, V, S> ParallelExtend<(K, V)> for &DashMap<K, V, S>where K: Send + Sync + Eq + Hash, V: Send + Sync, S: Send + Sync + Clone + BuildHasher,

source§

fn par_extend<I>(&mut self, par_iter: I)where I: IntoParallelIterator<Item = (K, V)>,

Extends an instance of the collection with the elements drawn from the parallel iterator par_iter. Read more
source§

impl<K, V, S> ParallelExtend<(K, V)> for DashMap<K, V, S>where K: Send + Sync + Eq + Hash, V: Send + Sync, S: Send + Sync + Clone + BuildHasher,

source§

fn par_extend<I>(&mut self, par_iter: I)where I: IntoParallelIterator<Item = (K, V)>,

Extends an instance of the collection with the elements drawn from the parallel iterator par_iter. Read more
source§

impl<K, V, H> Serialize for DashMap<K, V, H>where K: Serialize + Eq + Hash, V: Serialize, H: BuildHasher + Clone,

source§

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>where S: Serializer,

Serialize this value into the given Serde serializer. Read more
source§

impl<'a, K: 'a + Eq + Hash, V: 'a, S: BuildHasher + Clone> Shl<(K, V)> for &'a DashMap<K, V, S>

§

type Output = Option<V>

The resulting type after applying the << operator.
source§

fn shl(self, pair: (K, V)) -> Self::Output

Performs the << operation. Read more
source§

impl<'a, K, V: 'a, S: BuildHasher + Clone, Q> Shr<&Q> for &'a DashMap<K, V, S>where K: Borrow<Q> + 'a + Eq + Hash, Q: Hash + Eq + ?Sized,

§

type Output = Ref<'a, K, V, S>

The resulting type after applying the >> operator.
source§

fn shr(self, key: &Q) -> Self::Output

Performs the >> operation. Read more
source§

impl<'a, K, V: 'a, S: BuildHasher + Clone, Q> Sub<&Q> for &'a DashMap<K, V, S>where K: Borrow<Q> + 'a + Eq + Hash, Q: Hash + Eq + ?Sized,

§

type Output = Option<(K, V)>

The resulting type after applying the - operator.
source§

fn sub(self, key: &Q) -> Self::Output

Performs the - operation. Read more

Auto Trait Implementations§

§

impl<K, V, S = RandomState> !RefUnwindSafe for DashMap<K, V, S>

§

impl<K, V, S> Send for DashMap<K, V, S>where K: Send, S: Send, V: Send,

§

impl<K, V, S> Sync for DashMap<K, V, S>where K: Send + Sync, S: Send + Sync, V: Send + Sync,

§

impl<K, V, S> Unpin for DashMap<K, V, S>where S: Unpin,

§

impl<K, V, S> UnwindSafe for DashMap<K, V, S>where K: UnwindSafe, S: UnwindSafe, V: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<'data, I> IntoParallelRefIterator<'data> for Iwhere I: 'data + ?Sized, &'data I: IntoParallelIterator,

§

type Iter = <&'data I as IntoParallelIterator>::Iter

The type of the parallel iterator that will be returned.
§

type Item = <&'data I as IntoParallelIterator>::Item

The type of item that the parallel iterator will produce. This will typically be an &'data T reference type.
source§

fn par_iter(&'data self) -> <I as IntoParallelRefIterator<'data>>::Iter

Converts self into a parallel iterator. Read more
source§

impl<'data, I> IntoParallelRefMutIterator<'data> for Iwhere I: 'data + ?Sized, &'data mut I: IntoParallelIterator,

§

type Iter = <&'data mut I as IntoParallelIterator>::Iter

The type of iterator that will be created.
§

type Item = <&'data mut I as IntoParallelIterator>::Item

The type of item that will be produced; this is typically an &'data mut T reference.
source§

fn par_iter_mut( &'data mut self ) -> <I as IntoParallelRefMutIterator<'data>>::Iter

Creates the parallel iterator from self. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for Twhere T: for<'de> Deserialize<'de>,