| /prebuilts/go/linux-x86/src/internal/concurrent/ |
| D | hashtriemap.go | 29 func NewHashTrieMap[K, V comparable]() *HashTrieMap[K, V] {
48 func (ht *HashTrieMap[K, V]) Load(key K) (value V, ok bool) {
71 func (ht *HashTrieMap[K, V]) LoadOrStore(key K, value V) (result V, loaded bool) {
149 …t *HashTrieMap[K, V]) expand(oldEntry, newEntry *entry[K, V], newHash uintptr, hashShift uint, par…
184 func (ht *HashTrieMap[K, V]) CompareAndDelete(key K, old V) (deleted bool) {
284 func (ht *HashTrieMap[K, V]) iter(i *indirect[K, V], yield func(key K, value V) bool) bool {
326 func newIndirectNode[K, V comparable](parent *indirect[K, V]) *indirect[K, V] {
348 func newEntryNode[K, V comparable](key K, value V) *entry[K, V] {
356 func (e *entry[K, V]) lookup(key K, equal equalFunc) (V, bool) {
370 func (head *entry[K, V]) compareAndDelete(key K, value V, keyEqual, valEqual equalFunc) (*entry[K, …
|
| D | hashtriemap_test.go | 203 func testAll[K, V comparable](t *testing.T, m *HashTrieMap[K, V], testData map[K]V, yield func(K, V…
228 func expectPresent[K, V comparable](t *testing.T, key K, want V) func(got V, ok bool) {
242 func expectMissing[K, V comparable](t *testing.T, key K, want V) func(got V, ok bool) {
261 func expectLoaded[K, V comparable](t *testing.T, key K, want V) func(got V, loaded bool) {
275 func expectStored[K, V comparable](t *testing.T, key K, want V) func(got V, loaded bool) {
289 func expectDeleted[K, V comparable](t *testing.T, key K, old V) func(deleted bool) {
300 func expectNotDeleted[K, V comparable](t *testing.T, key K, old V) func(deleted bool) {
337 func dumpMap[K, V comparable](ht *HashTrieMap[K, V]) {
341 func dumpNode[K, V comparable](ht *HashTrieMap[K, V], n *node[K, V], depth int) {
|
| /prebuilts/rust/linux-x86/1.83.0/lib/rustlib/src/rust/vendor/hashbrown/src/ |
| D | raw_entry.rs | 107 pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V, S, A> { in raw_entry_mut() argument
156 pub fn raw_entry(&self) -> RawEntryBuilder<'_, K, V, S, A> { in raw_entry() argument
525 pub fn from_key<Q>(self, k: &Q) -> RawEntryMut<'a, K, V, S, A> in from_key() argument
558 pub fn from_key_hashed_nocheck<Q>(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S, A> in from_key_hashed_nocheck() argument
591 pub fn from_hash<F>(self, hash: u64, is_match: F) -> RawEntryMut<'a, K, V, S, A> in from_hash() argument
599 fn search<F>(self, hash: u64, mut is_match: F) -> RawEntryMut<'a, K, V, S, A> in search() argument
631 pub fn from_key<Q>(self, k: &Q) -> Option<(&'a K, &'a V)> in from_key()
662 pub fn from_key_hashed_nocheck<Q>(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> in from_key_hashed_nocheck()
670 fn search<F>(self, hash: u64, mut is_match: F) -> Option<(&'a K, &'a V)> in search()
702 pub fn from_hash<F>(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)> in from_hash()
[all …]
|
| D | rustc_entry.rs | 34 pub fn rustc_entry(&mut self, key: K) -> RustcEntry<'_, K, V, A> { in rustc_entry() argument
150 pub fn insert(self, value: V) -> RustcOccupiedEntry<'a, K, V, A> { in insert() argument
224 pub fn key(&self) -> &K { in key()
307 pub fn key(&self) -> &K { in key()
330 pub fn remove_entry(self) -> (K, V) { in remove_entry()
472 pub fn key(&self) -> &K { in key()
491 pub fn into_key(self) -> K { in into_key()
536 pub fn insert_entry(self, value: V) -> RustcOccupiedEntry<'a, K, V, A> { in insert_entry() argument
548 pub fn rustc_iter(&self) -> Iter<'_, K, V> { in rustc_iter() argument
556 pub fn rustc_iter(&self) -> Iter<'_, K, V> { in rustc_iter() argument
[all …]
|
| /prebuilts/rust/linux-musl-x86/1.83.0/lib/rustlib/src/rust/vendor/hashbrown/src/ |
| D | raw_entry.rs | 107 pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V, S, A> { in raw_entry_mut() argument
156 pub fn raw_entry(&self) -> RawEntryBuilder<'_, K, V, S, A> { in raw_entry() argument
525 pub fn from_key<Q>(self, k: &Q) -> RawEntryMut<'a, K, V, S, A> in from_key() argument
558 pub fn from_key_hashed_nocheck<Q>(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S, A> in from_key_hashed_nocheck() argument
591 pub fn from_hash<F>(self, hash: u64, is_match: F) -> RawEntryMut<'a, K, V, S, A> in from_hash() argument
599 fn search<F>(self, hash: u64, mut is_match: F) -> RawEntryMut<'a, K, V, S, A> in search() argument
631 pub fn from_key<Q>(self, k: &Q) -> Option<(&'a K, &'a V)> in from_key()
662 pub fn from_key_hashed_nocheck<Q>(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)> in from_key_hashed_nocheck()
670 fn search<F>(self, hash: u64, mut is_match: F) -> Option<(&'a K, &'a V)> in search()
702 pub fn from_hash<F>(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)> in from_hash()
[all …]
|
| D | rustc_entry.rs | 34 pub fn rustc_entry(&mut self, key: K) -> RustcEntry<'_, K, V, A> { in rustc_entry() argument
150 pub fn insert(self, value: V) -> RustcOccupiedEntry<'a, K, V, A> { in insert() argument
224 pub fn key(&self) -> &K { in key()
307 pub fn key(&self) -> &K { in key()
330 pub fn remove_entry(self) -> (K, V) { in remove_entry()
472 pub fn key(&self) -> &K { in key()
491 pub fn into_key(self) -> K { in into_key()
536 pub fn insert_entry(self, value: V) -> RustcOccupiedEntry<'a, K, V, A> { in insert_entry() argument
548 pub fn rustc_iter(&self) -> Iter<'_, K, V> { in rustc_iter() argument
556 pub fn rustc_iter(&self) -> Iter<'_, K, V> { in rustc_iter() argument
[all …]
|
| /prebuilts/rust/linux-musl-x86/1.82.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| D | navigate.rs | 37 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
47 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
52 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
59 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
64 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
73 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
89 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
118 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
150 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
160 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| D | map.rs | 208 fn clone(&self) -> BTreeMap<K, V, A> { in clone()
209 fn clone_subtree<'a, K: Clone, V: Clone, A: Allocator + Clone>( in clone() argument
212 ) -> BTreeMap<K, V, A> in clone()
299 fn get(&self, key: &Q) -> Option<&K> { in get()
307 fn take(&mut self, key: &Q) -> Option<K> { in take()
325 fn replace(&mut self, key: K) -> Option<K> { in replace()
440 pub(super) fn iter(&self) -> Iter<'_, K, V> { in iter() argument
674 pub const fn new_in(alloc: A) -> BTreeMap<K, V, A> { in new_in()
724 pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)> in get_key_value()
751 pub fn first_key_value(&self) -> Option<(&K, &V)> in first_key_value()
[all …]
|
| D | node.rs | 220 fn from_new_leaf<A: Allocator + Clone>(leaf: Box<LeafNode<K, V>, A>) -> Self { in from_new_leaf()
226 fn new_internal<A: Allocator + Clone>(child: Root<K, V>, alloc: A) -> Self { in new_internal()
235 internal: Box<InternalNode<K, V>, A>, in from_new_internal()
248 fn from_internal(node: NonNull<InternalNode<K, V>>, height: usize) -> Self { in from_internal()
258 fn as_internal_ptr(this: &Self) -> *mut InternalNode<K, V> { in as_internal_ptr()
266 fn as_internal_mut(&mut self) -> &mut InternalNode<K, V> { in as_internal_mut()
293 pub fn reborrow(&self) -> NodeRef<marker::Immut<'_>, K, V, Type> { in reborrow() argument
300 fn as_leaf_ptr(this: &Self) -> *mut LeafNode<K, V> { in as_leaf_ptr()
320 ) -> Result<Handle<NodeRef<BorrowType, K, V, marker::Internal>, marker::Edge>, Self> { in ascend() argument
377 fn into_leaf(self) -> &'a LeafNode<K, V> { in into_leaf()
[all …]
|
| /prebuilts/rust/linux-musl-x86/1.83.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| D | navigate.rs | 37 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
47 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
52 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
59 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
64 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
73 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
89 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
118 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
150 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
160 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| D | map.rs | 208 fn clone(&self) -> BTreeMap<K, V, A> { in clone()
209 fn clone_subtree<'a, K: Clone, V: Clone, A: Allocator + Clone>( in clone() argument
212 ) -> BTreeMap<K, V, A> in clone()
299 fn get(&self, key: &Q) -> Option<&K> { in get()
307 fn take(&mut self, key: &Q) -> Option<K> { in take()
325 fn replace(&mut self, key: K) -> Option<K> { in replace()
440 pub(super) fn iter(&self) -> Iter<'_, K, V> { in iter() argument
674 pub const fn new_in(alloc: A) -> BTreeMap<K, V, A> { in new_in()
724 pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)> in get_key_value()
751 pub fn first_key_value(&self) -> Option<(&K, &V)> in first_key_value()
[all …]
|
| D | node.rs | 220 fn from_new_leaf<A: Allocator + Clone>(leaf: Box<LeafNode<K, V>, A>) -> Self { in from_new_leaf()
226 fn new_internal<A: Allocator + Clone>(child: Root<K, V>, alloc: A) -> Self { in new_internal()
235 internal: Box<InternalNode<K, V>, A>, in from_new_internal()
248 fn from_internal(node: NonNull<InternalNode<K, V>>, height: usize) -> Self { in from_internal()
258 fn as_internal_ptr(this: &Self) -> *mut InternalNode<K, V> { in as_internal_ptr()
266 fn as_internal_mut(&mut self) -> &mut InternalNode<K, V> { in as_internal_mut()
293 pub fn reborrow(&self) -> NodeRef<marker::Immut<'_>, K, V, Type> { in reborrow() argument
300 fn as_leaf_ptr(this: &Self) -> *mut LeafNode<K, V> { in as_leaf_ptr()
320 ) -> Result<Handle<NodeRef<BorrowType, K, V, marker::Internal>, marker::Edge>, Self> { in ascend() argument
377 fn into_leaf(self) -> &'a LeafNode<K, V> { in into_leaf()
[all …]
|
| /prebuilts/rust/linux-x86/1.83.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| D | navigate.rs | 37 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
47 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
52 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
59 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
64 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
73 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
89 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
118 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
150 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
160 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| D | map.rs | 208 fn clone(&self) -> BTreeMap<K, V, A> { in clone()
209 fn clone_subtree<'a, K: Clone, V: Clone, A: Allocator + Clone>( in clone() argument
212 ) -> BTreeMap<K, V, A> in clone()
299 fn get(&self, key: &Q) -> Option<&K> { in get()
307 fn take(&mut self, key: &Q) -> Option<K> { in take()
325 fn replace(&mut self, key: K) -> Option<K> { in replace()
440 pub(super) fn iter(&self) -> Iter<'_, K, V> { in iter() argument
674 pub const fn new_in(alloc: A) -> BTreeMap<K, V, A> { in new_in()
724 pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)> in get_key_value()
751 pub fn first_key_value(&self) -> Option<(&K, &V)> in first_key_value()
[all …]
|
| D | node.rs | 220 fn from_new_leaf<A: Allocator + Clone>(leaf: Box<LeafNode<K, V>, A>) -> Self { in from_new_leaf()
226 fn new_internal<A: Allocator + Clone>(child: Root<K, V>, alloc: A) -> Self { in new_internal()
235 internal: Box<InternalNode<K, V>, A>, in from_new_internal()
248 fn from_internal(node: NonNull<InternalNode<K, V>>, height: usize) -> Self { in from_internal()
258 fn as_internal_ptr(this: &Self) -> *mut InternalNode<K, V> { in as_internal_ptr()
266 fn as_internal_mut(&mut self) -> &mut InternalNode<K, V> { in as_internal_mut()
293 pub fn reborrow(&self) -> NodeRef<marker::Immut<'_>, K, V, Type> { in reborrow() argument
300 fn as_leaf_ptr(this: &Self) -> *mut LeafNode<K, V> { in as_leaf_ptr()
320 ) -> Result<Handle<NodeRef<BorrowType, K, V, marker::Internal>, marker::Edge>, Self> { in ascend() argument
377 fn into_leaf(self) -> &'a LeafNode<K, V> { in into_leaf()
[all …]
|
| /prebuilts/rust/linux-x86/1.82.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| D | navigate.rs | 37 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
47 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
52 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
59 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
64 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
73 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
89 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
118 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
150 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
160 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| D | map.rs | 208 fn clone(&self) -> BTreeMap<K, V, A> { in clone()
209 fn clone_subtree<'a, K: Clone, V: Clone, A: Allocator + Clone>( in clone() argument
212 ) -> BTreeMap<K, V, A> in clone()
299 fn get(&self, key: &Q) -> Option<&K> { in get()
307 fn take(&mut self, key: &Q) -> Option<K> { in take()
325 fn replace(&mut self, key: K) -> Option<K> { in replace()
440 pub(super) fn iter(&self) -> Iter<'_, K, V> { in iter() argument
674 pub const fn new_in(alloc: A) -> BTreeMap<K, V, A> { in new_in()
724 pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)> in get_key_value()
751 pub fn first_key_value(&self) -> Option<(&K, &V)> in first_key_value()
[all …]
|
| D | node.rs | 220 fn from_new_leaf<A: Allocator + Clone>(leaf: Box<LeafNode<K, V>, A>) -> Self { in from_new_leaf()
226 fn new_internal<A: Allocator + Clone>(child: Root<K, V>, alloc: A) -> Self { in new_internal()
235 internal: Box<InternalNode<K, V>, A>, in from_new_internal()
248 fn from_internal(node: NonNull<InternalNode<K, V>>, height: usize) -> Self { in from_internal()
258 fn as_internal_ptr(this: &Self) -> *mut InternalNode<K, V> { in as_internal_ptr()
266 fn as_internal_mut(&mut self) -> &mut InternalNode<K, V> { in as_internal_mut()
293 pub fn reborrow(&self) -> NodeRef<marker::Immut<'_>, K, V, Type> { in reborrow() argument
300 fn as_leaf_ptr(this: &Self) -> *mut LeafNode<K, V> { in as_leaf_ptr()
320 ) -> Result<Handle<NodeRef<BorrowType, K, V, marker::Internal>, marker::Edge>, Self> { in ascend() argument
377 fn into_leaf(self) -> &'a LeafNode<K, V> { in into_leaf()
[all …]
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| D | issue37716.go | 12 type K struct { struct
13 a, b int32 // these get merged by the compiler into a single field, something typehash doesn't do
14 c float64
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/syntax/testdata/ |
| D | map.go | 24 func New[K, V any](compare func(K, K) int) *Map[K, V] {
31 func (m *Map[K, V]) find(key K) **node[K, V] {
49 func (m *Map[K, V]) Insert(key K, val V) bool {
61 func (m *Map[K, V]) Find(key K) (V, bool) {
|
| /prebuilts/go/linux-x86/src/internal/types/testdata/check/ |
| D | map0.go | 25 func New[K, V any](compare func(K, K) int) *Map[K, V] {
32 func (m *Map[K, V]) find(key K) **node[K, V] {
50 func (m *Map[K, V]) Insert(key K, val V) bool {
62 func (m *Map[K, V]) Find(key K) (V, bool) {
|
| /prebuilts/rust/linux-musl-x86/1.82.0/lib/rustlib/src/rust/vendor/hashbrown/src/ |
| D | rustc_entry.rs | 34 pub fn rustc_entry(&mut self, key: K) -> RustcEntry<'_, K, V, A> { in rustc_entry() argument
152 pub fn insert(self, value: V) -> RustcOccupiedEntry<'a, K, V, A> { in insert() argument
226 pub fn key(&self) -> &K { in key()
309 pub fn key(&self) -> &K { in key()
332 pub fn remove_entry(self) -> (K, V) { in remove_entry()
481 pub fn replace_entry(self, value: V) -> (K, V) { in replace_entry()
515 pub fn replace_key(self) -> K { in replace_key()
534 pub fn key(&self) -> &K { in key()
553 pub fn into_key(self) -> K { in into_key()
598 pub fn insert_entry(self, value: V) -> RustcOccupiedEntry<'a, K, V, A> { in insert_entry() argument
[all …]
|
| /prebuilts/rust/linux-x86/1.82.0/lib/rustlib/src/rust/vendor/hashbrown/src/ |
| D | rustc_entry.rs | 34 pub fn rustc_entry(&mut self, key: K) -> RustcEntry<'_, K, V, A> { in rustc_entry() argument
152 pub fn insert(self, value: V) -> RustcOccupiedEntry<'a, K, V, A> { in insert() argument
226 pub fn key(&self) -> &K { in key()
309 pub fn key(&self) -> &K { in key()
332 pub fn remove_entry(self) -> (K, V) { in remove_entry()
481 pub fn replace_entry(self, value: V) -> (K, V) { in replace_entry()
515 pub fn replace_key(self) -> K { in replace_key()
534 pub fn key(&self) -> &K { in key()
553 pub fn into_key(self) -> K { in into_key()
598 pub fn insert_entry(self, value: V) -> RustcOccupiedEntry<'a, K, V, A> { in insert_entry() argument
[all …]
|
| /prebuilts/rust/linux-x86/1.82.0/lib/rustlib/src/rust/library/std/src/collections/hash/ |
| D | map.rs | 249 pub fn with_capacity(capacity: usize) -> HashMap<K, V, RandomState> { in with_capacity()
281 pub const fn with_hasher(hash_builder: S) -> HashMap<K, V, S> { in with_hasher()
312 pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> HashMap<K, V, S> { in with_capacity_and_hasher()
359 pub fn keys(&self) -> Keys<'_, K, V> { in keys() argument
392 pub fn into_keys(self) -> IntoKeys<K, V> { in into_keys()
421 pub fn values(&self) -> Values<'_, K, V> { in values() argument
454 pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> { in values_mut() argument
487 pub fn into_values(self) -> IntoValues<K, V> { in into_values()
516 pub fn iter(&self) -> Iter<'_, K, V> { in iter() argument
551 pub fn iter_mut(&mut self) -> IterMut<'_, K, V> { in iter_mut() argument
[all …]
|
| /prebuilts/rust/linux-musl-x86/1.82.0/lib/rustlib/src/rust/library/std/src/collections/hash/ |
| D | map.rs | 249 pub fn with_capacity(capacity: usize) -> HashMap<K, V, RandomState> { in with_capacity()
281 pub const fn with_hasher(hash_builder: S) -> HashMap<K, V, S> { in with_hasher()
312 pub fn with_capacity_and_hasher(capacity: usize, hasher: S) -> HashMap<K, V, S> { in with_capacity_and_hasher()
359 pub fn keys(&self) -> Keys<'_, K, V> { in keys() argument
392 pub fn into_keys(self) -> IntoKeys<K, V> { in into_keys()
421 pub fn values(&self) -> Values<'_, K, V> { in values() argument
454 pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> { in values_mut() argument
487 pub fn into_values(self) -> IntoValues<K, V> { in into_values()
516 pub fn iter(&self) -> Iter<'_, K, V> { in iter() argument
551 pub fn iter_mut(&mut self) -> IterMut<'_, K, V> { in iter_mut() argument
[all …]
|