• Home
  • Raw
  • Download

Lines Matching defs:K

195     pub fn into_read_only(self) -> ReadOnlyView<K, V, S> {  in into_read_only()
458 pub fn insert(&self, key: K, value: V) -> Option<V> { in insert()
475 pub fn remove<Q>(&self, key: &Q) -> Option<(K, V)> in remove()
504 pub fn remove_if<Q>(&self, key: &Q, f: impl FnOnce(&K, &V) -> bool) -> Option<(K, V)> in remove_if()
512 pub fn remove_if_mut<Q>(&self, key: &Q, f: impl FnOnce(&K, &mut V) -> bool) -> Option<(K, V)> in remove_if_mut()
533 pub fn iter(&'a self) -> Iter<'a, K, V, S, DashMap<K, V, S>> { in iter() argument
551 pub fn iter_mut(&'a self) -> IterMut<'a, K, V, S, DashMap<K, V, S>> { in iter_mut() argument
568 pub fn get<Q>(&'a self, key: &Q) -> Option<Ref<'a, K, V, S>> in get() argument
590 pub fn get_mut<Q>(&'a self, key: &Q) -> Option<RefMut<'a, K, V, S>> in get_mut() argument
617 pub fn try_get<Q>(&'a self, key: &Q) -> TryResult<Ref<'a, K, V, S>> in try_get() argument
645 pub fn try_get_mut<Q>(&'a self, key: &Q) -> TryResult<RefMut<'a, K, V, S>> in try_get_mut() argument
677 pub fn retain(&self, f: impl FnMut(&K, &mut V) -> bool) { in retain()
760 pub fn alter<Q>(&self, key: &Q, f: impl FnOnce(&K, V) -> V) in alter()
788 pub fn alter_all(&self, f: impl FnMut(&K, V) -> V) { in alter_all()
811 pub fn view<Q, R>(&self, key: &Q, f: impl FnOnce(&K, &V) -> R) -> Option<R> in view()
844 pub fn entry(&'a self, key: K) -> Entry<'a, K, V, S> { in entry() argument
852 pub fn try_entry(&'a self, key: K) -> Option<Entry<'a, K, V, S>> { in try_entry() argument
882 unsafe fn _get_read_shard(&'a self, i: usize) -> &'a HashMap<K, V, S> { in _get_read_shard()
888 unsafe fn _yield_read_shard(&'a self, i: usize) -> RwLockReadGuard<'a, HashMap<K, V, S>> { in _yield_read_shard()
894 unsafe fn _yield_write_shard(&'a self, i: usize) -> RwLockWriteGuard<'a, HashMap<K, V, S>> { in _yield_write_shard()
903 ) -> Option<RwLockReadGuard<'a, HashMap<K, V, S>>> { in _try_yield_read_shard()
912 ) -> Option<RwLockWriteGuard<'a, HashMap<K, V, S>>> { in _try_yield_write_shard()
918 fn _insert(&self, key: K, value: V) -> Option<V> { in _insert()
930 fn _remove<Q>(&self, key: &Q) -> Option<(K, V)> in _remove()
944 fn _remove_if<Q>(&self, key: &Q, f: impl FnOnce(&K, &V) -> bool) -> Option<(K, V)> in _remove_if()
957 let kptr: *const K = kptr; in _remove_if() constant
971 fn _remove_if_mut<Q>(&self, key: &Q, f: impl FnOnce(&K, &mut V) -> bool) -> Option<(K, V)> in _remove_if_mut()
984 let kptr: *const K = kptr; in _remove_if_mut() constant
998 fn _iter(&'a self) -> Iter<'a, K, V, S, DashMap<K, V, S>> { in _iter() argument
1002 fn _iter_mut(&'a self) -> IterMut<'a, K, V, S, DashMap<K, V, S>> { in _iter_mut() argument
1006 fn _get<Q>(&'a self, key: &Q) -> Option<Ref<'a, K, V, S>> in _get() argument
1019 let kptr: *const K = kptr; in _get() constant
1028 fn _get_mut<Q>(&'a self, key: &Q) -> Option<RefMut<'a, K, V, S>> in _get_mut() argument
1041 let kptr: *const K = kptr; in _get_mut() constant
1050 fn _try_get<Q>(&'a self, key: &Q) -> TryResult<Ref<'a, K, V, S>> in _try_get() argument
1066 let kptr: *const K = kptr; in _try_get() constant
1075 fn _try_get_mut<Q>(&'a self, key: &Q) -> TryResult<RefMut<'a, K, V, S>> in _try_get_mut() argument
1091 let kptr: *const K = kptr; in _try_get_mut() constant
1104 fn _retain(&self, mut f: impl FnMut(&K, &mut V) -> bool) { in _retain()
1118 fn _alter<Q>(&self, key: &Q, f: impl FnOnce(&K, V) -> V) in _alter()
1128 fn _alter_all(&self, mut f: impl FnMut(&K, V) -> V) { in _alter_all()
1136 fn _view<Q, R>(&self, key: &Q, f: impl FnOnce(&K, &V) -> R) -> Option<R> in _view()
1147 fn _entry(&'a self, key: K) -> Entry<'a, K, V, S> { in _entry() argument
1156 let kptr: *const K = kptr; in _entry() constant
1165 fn _try_entry(&'a self, key: K) -> Option<Entry<'a, K, V, S>> { in _try_entry() argument
1177 let kptr: *const K = kptr; in _try_entry() constant
1215 fn shl(self, pair: (K, V)) -> Self::Output { in shl()