Lines Matching defs:K
133 pub fn iter(&self) -> Iter<K, V> { in iter()
152 pub fn iter_mut(&mut self) -> IterMut<K, V> { in iter_mut()
171 pub fn drain(&mut self) -> Drain<'_, K, V> { in drain() argument
198 pub fn keys(&self) -> Keys<K, V> { in keys()
203 pub fn values(&self) -> Values<K, V> { in values()
208 pub fn values_mut(&mut self) -> ValuesMut<K, V> { in values_mut()
215 pub fn front(&self) -> Option<(&K, &V)> { in front()
227 pub fn back(&self) -> Option<(&K, &V)> { in back()
241 F: FnMut(&K, &mut V) -> bool, in retain()
277 pub fn entry(&mut self, key: K) -> Entry<'_, K, V, S> { in entry() argument
300 pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)> in get_key_value()
334 pub fn insert(&mut self, k: K, v: V) -> Option<V> { in insert()
352 pub fn replace(&mut self, k: K, v: V) -> Option<V> { in replace()
375 pub fn remove_entry<Q>(&mut self, k: &Q) -> Option<(K, V)> in remove_entry()
387 pub fn pop_front(&mut self) -> Option<(K, V)> { in pop_front()
406 pub fn pop_back(&mut self) -> Option<(K, V)> { in pop_back()
497 F: FnMut(&K, &mut V) -> bool, in retain_with_order()
541 pub fn raw_entry(&self) -> RawEntryBuilder<'_, K, V, S> { in raw_entry() argument
549 pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V, S> { in raw_entry_mut() argument
772 pub fn key(&self) -> &K { in key()
811 pub fn key(&self) -> &K { in key()
816 pub fn remove_entry(self) -> (K, V) { in remove_entry()
863 pub fn insert_entry(mut self, value: V) -> (K, V) { in insert_entry()
872 pub fn replace_entry(mut self, value: V) -> (K, V) { in replace_entry()
882 pub fn replace_key(mut self) -> K { in replace_key()
901 pub fn key(&self) -> &K { in key()
906 pub fn into_key(self) -> K { in into_key()
932 pub fn from_key<Q>(self, k: &Q) -> Option<(&'a K, &'a V)> in from_key()
942 pub fn from_key_hashed_nocheck<Q>(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> in from_key_hashed_nocheck()
955 ) -> Option<(&'a K, &'a V)> { in from_hash()
996 pub fn from_key<Q>(self, k: &Q) -> RawEntryMut<'a, K, V, S> in from_key() argument
1006 pub fn from_key_hashed_nocheck<Q>(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S> in from_key_hashed_nocheck() argument
1018 mut is_match: impl FnMut(&K) -> bool, in from_hash() argument
1067 pub fn or_insert(self, default_key: K, default_val: V) -> (&'a mut K, &'a mut V) in or_insert()
1084 pub fn or_insert_with<F>(self, default: F) -> (&'a mut K, &'a mut V) in or_insert_with()
1086 F: FnOnce() -> (K, V), in or_insert_with()
1105 F: FnOnce(&mut K, &mut V), in and_modify()
1128 pub fn key(&self) -> &K { in key()
1133 pub fn key_mut(&mut self) -> &mut K { in key_mut()
1138 pub fn into_key(self) -> &'a mut K { in into_key()
1158 pub fn get_key_value(&self) -> (&K, &V) { in get_key_value()
1167 pub fn get_key_value_mut(&mut self) -> (&mut K, &mut V) { in get_key_value_mut()
1176 pub fn into_key_value(self) -> (&'a mut K, &'a mut V) { in into_key_value()
1211 pub fn replace_key(&mut self, key: K) -> K { in replace_key()
1224 pub fn remove_entry(self) -> (K, V) { in remove_entry()
1239 pub fn insert(self, key: K, value: V) -> (&'a mut K, &'a mut V) in insert()
1249 pub fn insert_hashed_nocheck(self, hash: u64, key: K, value: V) -> (&'a mut K, &'a mut V) in insert_hashed_nocheck()
1262 key: K, in insert_with_hasher()
1265 ) -> (&'a mut K, &'a mut V) in insert_with_hasher()
1389 pub(crate) fn iter(&self) -> Iter<'_, K, V> { in iter() argument
1401 pub(crate) fn iter(&self) -> Iter<'_, K, V> { in iter() argument
1413 pub(crate) fn iter(&self) -> Iter<'_, K, V> { in iter() argument
1530 fn next(&mut self) -> Option<(&'a K, &'a V)> { in next()
1553 fn next(&mut self) -> Option<(&'a K, &'a mut V)> { in next()
1577 fn next(&mut self) -> Option<(K, V)> { in next()
1600 fn next(&mut self) -> Option<(K, V)> { in next()
1622 fn next_back(&mut self) -> Option<(&'a K, &'a V)> { in next_back()
1639 fn next_back(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back()
1656 fn next_back(&mut self) -> Option<(K, V)> { in next_back()
1671 fn next_back(&mut self) -> Option<(K, V)> { in next_back()
1733 fn clone(&self) -> Keys<'a, K, V> { in clone() argument
1744 fn next(&mut self) -> Option<&'a K> { in next()
1756 fn next_back(&mut self) -> Option<&'a K> { in next_back()
1864 fn into_iter(self) -> Iter<'a, K, V> { in into_iter() argument
1874 fn into_iter(self) -> IterMut<'a, K, V> { in into_iter() argument
1884 fn into_iter(mut self) -> IntoIter<K, V> { in into_iter()
1982 unsafe fn put_entry(&mut self, entry: (K, V)) { in put_entry()
1987 unsafe fn entry_ref(&self) -> &(K, V) { in entry_ref()
1992 unsafe fn key_ref(&self) -> &K { in key_ref()
1997 unsafe fn entry_mut(&mut self) -> &mut (K, V) { in entry_mut()
2002 unsafe fn take_entry(&mut self) -> (K, V) { in take_entry()
2023 unsafe fn ensure_guard_node<K, V>(head: &mut Option<NonNull<Node<K, V>>>) { in ensure_guard_node() argument
2041 unsafe fn attach_before<K, V>(mut to_attach: NonNull<Node<K, V>>, mut node: NonNull<Node<K, V>>) { in attach_before() argument
2054 unsafe fn detach_node<K, V>(mut node: NonNull<Node<K, V>>) { in detach_node() argument
2060 unsafe fn push_free<K, V>( in push_free()
2061 free_list: &mut Option<NonNull<Node<K, V>>>, in push_free()
2062 mut node: NonNull<Node<K, V>>, in push_free()
2069 unsafe fn pop_free<K, V>( in pop_free()
2070 free_list: &mut Option<NonNull<Node<K, V>>>, in pop_free()
2071 ) -> Option<NonNull<Node<K, V>>> { in pop_free()
2081 unsafe fn allocate_node<K, V>(free_list: &mut Option<NonNull<Node<K, V>>>) -> NonNull<Node<K, V>> { in allocate_node() argument
2103 unsafe fn drop_value_nodes<K, V>(guard: NonNull<Node<K, V>>) { in drop_value_nodes() argument
2116 unsafe fn drop_free_nodes<K, V>(mut free: Option<NonNull<Node<K, V>>>) { in drop_free_nodes() argument
2125 unsafe fn remove_node<K, V>( in remove_node()
2126 free_list: &mut Option<NonNull<Node<K, V>>>, in remove_node()
2127 mut node: NonNull<Node<K, V>>, in remove_node()
2128 ) -> (K, V) { in remove_node()
2159 fn drop_later(&mut self, node: NonNull<Node<K, V>>) { in drop_later()