Trait dashmap::Map [−][src]
Implementation detail that is exposed due to generic constraints in public types.
Required methods
fn _shard_count(&self) -> usize
[src]
unsafe fn _get_read_shard(
&'a self,
i: usize
) -> &'a HashMap<K, SharedValue<V>, S>
[src]
&'a self,
i: usize
) -> &'a HashMap<K, SharedValue<V>, S>
Safety
The index must not be out of bounds.
unsafe fn _yield_read_shard(
&'a self,
i: usize
) -> RwLockReadGuard<'a, HashMap<K, SharedValue<V>, S>>
[src]
&'a self,
i: usize
) -> RwLockReadGuard<'a, HashMap<K, SharedValue<V>, S>>
Safety
The index must not be out of bounds.
unsafe fn _yield_write_shard(
&'a self,
i: usize
) -> RwLockWriteGuard<'a, HashMap<K, SharedValue<V>, S>>
[src]
&'a self,
i: usize
) -> RwLockWriteGuard<'a, HashMap<K, SharedValue<V>, S>>
Safety
The index must not be out of bounds.
fn _insert(&self, key: K, value: V) -> Option<V>
[src]
fn _remove<Q: ?Sized>(&self, key: &Q) -> Option<(K, V)> where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,
fn _remove_if<Q: ?Sized>(
&self,
key: &Q,
f: impl FnOnce(&K, &V) -> bool
) -> Option<(K, V)> where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
&self,
key: &Q,
f: impl FnOnce(&K, &V) -> bool
) -> Option<(K, V)> where
K: Borrow<Q>,
Q: Hash + Eq,
fn _iter(&'a self) -> Iter<'a, K, V, S, Self>ⓘ where
Self: Sized,
[src]
Self: Sized,
fn _iter_mut(&'a self) -> IterMut<'a, K, V, S, Self>ⓘNotable traits for IterMut<'a, K, V, S, M>
impl<'a, K: Eq + Hash, V, S: 'a + BuildHasher + Clone, M: Map<'a, K, V, S>> Iterator for IterMut<'a, K, V, S, M> type Item = RefMutMulti<'a, K, V, S>;
where
Self: Sized,
[src]
Notable traits for IterMut<'a, K, V, S, M>
impl<'a, K: Eq + Hash, V, S: 'a + BuildHasher + Clone, M: Map<'a, K, V, S>> Iterator for IterMut<'a, K, V, S, M> type Item = RefMutMulti<'a, K, V, S>;
Self: Sized,
fn _get<Q: ?Sized>(&'a self, key: &Q) -> Option<Ref<'a, K, V, S>> where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,
fn _get_mut<Q: ?Sized>(&'a self, key: &Q) -> Option<RefMut<'a, K, V, S>> where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,
fn _shrink_to_fit(&self)
[src]
fn _retain(&self, f: impl FnMut(&K, &mut V) -> bool)
[src]
fn _len(&self) -> usize
[src]
fn _capacity(&self) -> usize
[src]
fn _alter<Q: ?Sized>(&self, key: &Q, f: impl FnOnce(&K, V) -> V) where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,
fn _alter_all(&self, f: impl FnMut(&K, V) -> V)
[src]
fn _entry(&'a self, key: K) -> Entry<'a, K, V, S>
[src]
fn _hasher(&self) -> S
[src]
Provided methods
fn _clear(&self)
[src]
fn _contains_key<Q: ?Sized>(&'a self, key: &Q) -> bool where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,
fn _is_empty(&self) -> bool
[src]
Implementors
impl<'a, K: 'a + Eq + Hash, V: 'a, S: 'a + BuildHasher + Clone> Map<'a, K, V, S> for DashMap<K, V, S>
[src]
fn _shard_count(&self) -> usize
[src]
unsafe fn _get_read_shard(
&'a self,
i: usize
) -> &'a HashMap<K, SharedValue<V>, S>
[src]
&'a self,
i: usize
) -> &'a HashMap<K, SharedValue<V>, S>
unsafe fn _yield_read_shard(
&'a self,
i: usize
) -> RwLockReadGuard<'a, HashMap<K, SharedValue<V>, S>>
[src]
&'a self,
i: usize
) -> RwLockReadGuard<'a, HashMap<K, SharedValue<V>, S>>
unsafe fn _yield_write_shard(
&'a self,
i: usize
) -> RwLockWriteGuard<'a, HashMap<K, SharedValue<V>, S>>
[src]
&'a self,
i: usize
) -> RwLockWriteGuard<'a, HashMap<K, SharedValue<V>, S>>
fn _insert(&self, key: K, value: V) -> Option<V>
[src]
fn _remove<Q: ?Sized>(&self, key: &Q) -> Option<(K, V)> where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,
fn _remove_if<Q: ?Sized>(
&self,
key: &Q,
f: impl FnOnce(&K, &V) -> bool
) -> Option<(K, V)> where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
&self,
key: &Q,
f: impl FnOnce(&K, &V) -> bool
) -> Option<(K, V)> where
K: Borrow<Q>,
Q: Hash + Eq,
fn _iter(&'a self) -> Iter<'a, K, V, S, DashMap<K, V, S>>ⓘ
[src]
fn _iter_mut(&'a self) -> IterMut<'a, K, V, S, DashMap<K, V, S>>ⓘNotable traits for IterMut<'a, K, V, S, M>
impl<'a, K: Eq + Hash, V, S: 'a + BuildHasher + Clone, M: Map<'a, K, V, S>> Iterator for IterMut<'a, K, V, S, M> type Item = RefMutMulti<'a, K, V, S>;
[src]
Notable traits for IterMut<'a, K, V, S, M>
impl<'a, K: Eq + Hash, V, S: 'a + BuildHasher + Clone, M: Map<'a, K, V, S>> Iterator for IterMut<'a, K, V, S, M> type Item = RefMutMulti<'a, K, V, S>;
fn _get<Q: ?Sized>(&'a self, key: &Q) -> Option<Ref<'a, K, V, S>> where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,
fn _get_mut<Q: ?Sized>(&'a self, key: &Q) -> Option<RefMut<'a, K, V, S>> where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,
fn _shrink_to_fit(&self)
[src]
fn _retain(&self, f: impl FnMut(&K, &mut V) -> bool)
[src]
fn _len(&self) -> usize
[src]
fn _capacity(&self) -> usize
[src]
fn _alter<Q: ?Sized>(&self, key: &Q, f: impl FnOnce(&K, V) -> V) where
K: Borrow<Q>,
Q: Hash + Eq,
[src]
K: Borrow<Q>,
Q: Hash + Eq,