Lines Matching defs:K
31 pub fn key(&self) -> &K { in key()
39 pub fn into_key(self) -> K { in into_key()
48 pub fn or_default(self) -> RefMut<'a, K, V, S> in or_default() argument
60 pub fn or_insert(self, value: V) -> RefMut<'a, K, V, S> { in or_insert() argument
69 pub fn or_insert_with(self, value: impl FnOnce() -> V) -> RefMut<'a, K, V, S> { in or_insert_with() argument
79 ) -> Result<RefMut<'a, K, V, S>, E> { in or_try_insert_with() argument
87 pub fn insert(self, value: V) -> RefMut<'a, K, V, S> { in insert() argument
103 pub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V, S> in insert_entry() argument
126 pub(crate) unsafe fn new(shard: RwLockWriteGuard<'a, HashMap<K, V, S>>, key: K) -> Self { in new()
130 pub fn insert(mut self, value: V) -> RefMut<'a, K, V, S> { in insert() argument
151 pub fn insert_entry(mut self, value: V) -> OccupiedEntry<'a, K, V, S> in insert_entry() argument
160 let kptr: *const K = k; in insert_entry() constant
166 pub fn into_key(self) -> K { in into_key()
170 pub fn key(&self) -> &K { in key()
186 shard: RwLockWriteGuard<'a, HashMap<K, V, S>>, in new()
187 key: K, in new()
188 elem: (*const K, *mut V), in new()
205 pub fn into_ref(self) -> RefMut<'a, K, V, S> { in into_ref() argument
209 pub fn into_key(self) -> K { in into_key()
213 pub fn key(&self) -> &K { in key()
222 pub fn remove_entry(mut self) -> (K, V) { in remove_entry()
228 pub fn replace_entry(mut self, value: V) -> (K, V) { in replace_entry()