Searched refs:ByPtr (Results 1 – 5 of 5) sorted by relevance
/external/rust/crates/weak-table/src/ |
D | by_ptr.rs | 8 pub struct ByPtr<K>(K); struct 10 impl<K: WeakElement> WeakElement for ByPtr<K> { implementation 14 ByPtr(K::new(view)) in new() 22 impl<K: WeakElement> WeakKey for ByPtr<K> implementation
|
D | ptr_weak_key_hash_map.rs | 89 pub fn entry(&mut self, key: K::Strong) -> Entry<ByPtr<K>, V> { in entry() 164 pub fn iter(&self) -> Iter<ByPtr<K>, V> { in iter() 169 pub fn keys(&self) -> Keys<ByPtr<K>, V> { in keys() 174 pub fn values(&self) -> Values<ByPtr<K>, V> { in values() 179 pub fn iter_mut(&mut self) -> IterMut<ByPtr<K>, V> { in iter_mut() 184 pub fn values_mut(&mut self) -> ValuesMut<ByPtr<K>, V> { in values_mut() 189 pub fn drain(&mut self) -> Drain<ByPtr<K>, V> { in drain() 215 PtrWeakKeyHashMap(base::WeakKeyHashMap::<ByPtr<K>, V, S>::default()) in default() 248 PtrWeakKeyHashMap(base::WeakKeyHashMap::<ByPtr<K>, V, S>::from_iter(iter)) in from_iter() 284 type IntoIter = IntoIter<ByPtr<K>, V>; [all …]
|
D | ptr_weak_weak_hash_map.rs | 90 pub fn entry(&mut self, key: K::Strong) -> Entry<ByPtr<K>, V> { in entry() 163 pub fn iter(&self) -> Iter<ByPtr<K>, V> { in iter() 168 pub fn keys(&self) -> Keys<ByPtr<K>, V> { in keys() 173 pub fn values(&self) -> Values<ByPtr<K>, V> { in values() 178 pub fn drain(&mut self) -> Drain<ByPtr<K>, V> { in drain() 207 PtrWeakWeakHashMap(base::WeakWeakHashMap::<ByPtr<K>, V, S>::default()) in default() 218 PtrWeakWeakHashMap(base::WeakWeakHashMap::<ByPtr<K>, V, S>::from_iter(iter)) in from_iter() 246 type IntoIter = IntoIter<ByPtr<K>, V>; 255 type IntoIter = Iter<'a, ByPtr<K>, V>;
|
D | ptr_weak_hash_set.rs | 11 use super::by_ptr::ByPtr; 127 pub struct Iter<'a, T: 'a>(base::Keys<'a, ByPtr<T>, ()>); 142 pub struct IntoIter<T>(base::IntoIter<ByPtr<T>, ()>); 157 pub struct Drain<'a, T: 'a>(base::Drain<'a, ByPtr<T>, ()>);
|
D | lib.rs | 185 WeakKeyHashMap<by_ptr::ByPtr<K>, V, S> 223 WeakWeakHashMap<by_ptr::ByPtr<K>, V, S>
|