[−][src]Trait dashmap::Map

pub trait Map<'a, K: 'a + Eq + Hash, V: 'a, S: 'a + Clone + BuildHasher> {
    pub fn _shard_count(&self) -> usize;

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

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

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

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

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

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

    pub fn _iter(&'a self) -> Iter<'a, K, V, S, Self>ⓘ
Notable traits for Iter<'a, K, V, S, M>
impl<'a, K: Eq + Hash, V, S: 'a + BuildHasher + Clone, M: Map<'a, K, V, S>> Iterator for Iter<'a, K, V, S, M>    type Item = RefMulti<'a, K, V, S>;

    where
        Self: Sized;

    pub 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;

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

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

    pub fn _shrink_to_fit(&self);

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

    pub fn _len(&self) -> usize;

    pub fn _capacity(&self) -> usize;

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

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

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

    pub fn _hasher(&self) -> S;

    pub fn _clear(&self) { ... }

    pub fn _contains_key<Q: ?Sized>(&'a self, key: &Q) -> bool
    where
        K: Borrow<Q>,
        Q: Hash + Eq,
    { ... }

    pub fn _is_empty(&self) -> bool { ... }
}

Implementation detail that is exposed due to generic constraints in public types.

Required methods

pub fn _shard_count(&self) -> usize[src]

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

Safety

The index must not be out of bounds.

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

Safety

The index must not be out of bounds.

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

Safety

The index must not be out of bounds.

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

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

pub 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]

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

Notable traits for Iter<'a, K, V, S, M>

impl<'a, K: Eq + Hash, V, S: 'a + BuildHasher + Clone, M: Map<'a, K, V, S>> Iterator for Iter<'a, K, V, S, M> type Item = RefMulti<'a, K, V, S>;
 where
    Self: Sized, [src]

pub 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]

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

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

pub fn _shrink_to_fit(&self)[src]

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

pub fn _len(&self) -> usize[src]

pub fn _capacity(&self) -> usize[src]

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

pub fn _alter_all(&self, f: impl FnMut(&K, V) -> V)[src]

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

pub fn _hasher(&self) -> S[src]

Loading content...

Provided methods

pub fn _clear(&self)[src]

pub fn _contains_key<Q: ?Sized>(&'a self, key: &Q) -> bool where
    K: Borrow<Q>,
    Q: Hash + Eq, [src]

pub fn _is_empty(&self) -> bool[src]

Loading content...

Implementors

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

Loading content...