| /aosp_15_r20/external/guava/android/guava/src/com/google/common/cache/ |
| H A D | LocalCache.java | 240 CacheBuilder<? super K, ? super V> builder, @CheckForNull CacheLoader<? super K, V> loader) { in LocalCache()
386 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight) { in referenceValue()
400 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight) { in referenceValue()
415 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight) { in referenceValue()
430 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight); in referenceValue()
445 Segment<K, V> segment, K key, int hash, @CheckForNull ReferenceEntry<K, V> next) { in newEntry()
452 Segment<K, V> segment, K key, int hash, @CheckForNull ReferenceEntry<K, V> next) { in newEntry()
457 <K, V> ReferenceEntry<K, V> copyEntry( in copyEntry()
458 Segment<K, V> segment, in copyEntry()
470 Segment<K, V> segment, K key, int hash, @CheckForNull ReferenceEntry<K, V> next) { in newEntry()
[all …]
|
| /aosp_15_r20/external/guava/guava/src/com/google/common/cache/ |
| H A D | LocalCache.java | 244 CacheBuilder<? super K, ? super V> builder, @CheckForNull CacheLoader<? super K, V> loader) { in LocalCache()
390 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight) { in referenceValue()
404 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight) { in referenceValue()
419 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight) { in referenceValue()
434 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight); in referenceValue()
449 Segment<K, V> segment, K key, int hash, @CheckForNull ReferenceEntry<K, V> next) { in newEntry()
456 Segment<K, V> segment, K key, int hash, @CheckForNull ReferenceEntry<K, V> next) { in newEntry()
461 <K, V> ReferenceEntry<K, V> copyEntry( in copyEntry()
462 Segment<K, V> segment, in copyEntry()
474 Segment<K, V> segment, K key, int hash, @CheckForNull ReferenceEntry<K, V> next) { in newEntry()
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/itertools/src/ |
| D | grouping_map.rs | 23 impl<V, K, F: FnMut(&V) -> K> MapSpecialCaseFn<V> for GroupingMapFn<F> { impl
30 pub(crate) fn new_map_for_grouping<K, I: Iterator, F: FnMut(&I::Item) -> K>( in new_map_for_grouping()
41 pub fn new<I, K, V>(iter: I) -> GroupingMap<I> in new() argument
110 pub fn aggregate<FO, R>(self, mut operation: FO) -> HashMap<K, R> in aggregate()
112 FO: FnMut(Option<R>, &K, V) -> Option<R>, in aggregate()
159 pub fn fold_with<FI, FO, R>(self, mut init: FI, mut operation: FO) -> HashMap<K, R> in fold_with()
161 FI: FnMut(&K, &V) -> R, in fold_with()
195 pub fn fold<FO, R>(self, init: R, operation: FO) -> HashMap<K, R> in fold()
198 FO: FnMut(R, &K, V) -> R, in fold()
230 pub fn reduce<FO>(self, mut operation: FO) -> HashMap<K, V> in reduce()
[all …]
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A 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 …]
|
| H A D | navigate.rs | 38 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
48 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
53 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
60 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
65 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
74 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
90 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
119 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
151 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
161 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| H A 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 …]
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A 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 …]
|
| H A D | navigate.rs | 38 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
48 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
53 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
60 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
65 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
74 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
90 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
119 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
151 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
161 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| H A 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 …]
|
| /aosp_15_r20/prebuilts/rust/linux-musl-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A 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 …]
|
| H A D | navigate.rs | 38 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
48 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
53 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
60 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
65 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
74 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
90 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
119 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
151 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
161 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| H A 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 …]
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.81.0.u1/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A 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 …]
|
| H A D | navigate.rs | 38 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
48 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
53 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
60 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
65 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
74 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
90 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
119 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
151 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
161 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| /aosp_15_r20/prebuilts/rust/linux-musl-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A 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 …]
|
| H A D | navigate.rs | 38 pub fn reborrow(&self) -> LeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
48 pub fn next_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_checked()
53 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a V)> { in next_back_checked()
60 pub fn next_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_checked()
65 pub fn next_back_checked(&mut self) -> Option<(&'a K, &'a mut V)> { in next_back_checked()
74 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_checked() argument
90 F: Fn(&Handle<NodeRef<BorrowType, K, V, marker::LeafOrInternal>, marker::KV>) -> R, in perform_next_back_checked() argument
119 fn reborrow(&self) -> LazyLeafHandle<marker::Immut<'_>, K, V> { in reborrow() argument
151 pub fn reborrow(&self) -> LazyLeafRange<marker::Immut<'_>, K, V> { in reborrow() argument
161 pub unsafe fn next_unchecked(&mut self) -> (&'a K, &'a V) { in next_unchecked()
[all …]
|
| H A 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 …]
|
| /aosp_15_r20/external/guava/guava/src/com/google/common/collect/ |
| H A D | MapMakerInternalMap.java | 165 private MapMakerInternalMap(MapMaker builder, InternalEntryHelper<K, V, E, S> entryHelper) { in MapMakerInternalMap()
294 S newSegment(MapMakerInternalMap<K, V, E, S> map, int initialCapacity); in newSegment()
406 LinkedStrongKeyStrongValueEntry(K key, int hash, StrongKeyStrongValueEntry<K, V> next) { in LinkedStrongKeyStrongValueEntry()
439 public StrongKeyStrongValueSegment<K, V> newSegment( in newSegment()
440 MapMakerInternalMap< in newSegment()
441 K, V, StrongKeyStrongValueEntry<K, V>, StrongKeyStrongValueSegment<K, V>> in newSegment()
448 public StrongKeyStrongValueEntry<K, V> copy( in copy()
449 StrongKeyStrongValueSegment<K, V> segment, in copy()
451 @CheckForNull StrongKeyStrongValueEntry<K, V> newNext) { in copy()
460 StrongKeyStrongValueSegment<K, V> segment, in setValue()
[all …]
|
| /aosp_15_r20/external/guava/android/guava/src/com/google/common/collect/ |
| H A D | MapMakerInternalMap.java | 165 private MapMakerInternalMap(MapMaker builder, InternalEntryHelper<K, V, E, S> entryHelper) { in MapMakerInternalMap()
294 S newSegment(MapMakerInternalMap<K, V, E, S> map, int initialCapacity); in newSegment()
406 LinkedStrongKeyStrongValueEntry(K key, int hash, StrongKeyStrongValueEntry<K, V> next) { in LinkedStrongKeyStrongValueEntry()
439 public StrongKeyStrongValueSegment<K, V> newSegment( in newSegment()
440 MapMakerInternalMap< in newSegment()
441 K, V, StrongKeyStrongValueEntry<K, V>, StrongKeyStrongValueSegment<K, V>> in newSegment()
448 public StrongKeyStrongValueEntry<K, V> copy( in copy()
449 StrongKeyStrongValueSegment<K, V> segment, in copy()
451 @CheckForNull StrongKeyStrongValueEntry<K, V> newNext) { in copy()
460 StrongKeyStrongValueSegment<K, V> segment, in setValue()
[all …]
|
| /aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/itertools-0.11.0/src/ |
| H A D | grouping_map.rs | 32 pub fn new<I, K, V>(iter: I) -> GroupingMap<I> in new() argument
99 pub fn aggregate<FO, R>(self, mut operation: FO) -> HashMap<K, R> in aggregate()
100 where FO: FnMut(Option<R>, &K, V) -> Option<R>, in aggregate()
139 pub fn fold<FO, R>(self, init: R, mut operation: FO) -> HashMap<K, R> in fold()
141 FO: FnMut(R, &K, V) -> R, in fold()
176 pub fn fold_first<FO>(self, mut operation: FO) -> HashMap<K, V> in fold_first()
177 where FO: FnMut(V, &K, V) -> V, in fold_first()
205 pub fn collect<C>(self) -> HashMap<K, C> in collect()
235 pub fn max(self) -> HashMap<K, V> in max()
260 pub fn max_by<F>(self, mut compare: F) -> HashMap<K, V> in max_by()
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/hashlink/src/ |
| D | linked_hash_map.rs | 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
[all …]
|
| /aosp_15_r20/libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 637 Node(int hash, K key, V val, Node<K,V> next) { in Node() method in ConcurrentHashMap.Node
759 static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) { in tabAt()
763 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i, in casTabAt()
768 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) { in setTabAt()
850 public ConcurrentHashMap(Map<? extends K, ? extends V> m) { in ConcurrentHashMap()
1086 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
1602 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
1613 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1635 boolean removeEntryIf(Predicate<? super Entry<K,V>> function) { in removeEntryIf()
1696 public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
[all …]
|
| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/gensrcs/libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentHashMap.java | 637 Node(int hash, K key, V val, Node<K,V> next) { in Node() method in ConcurrentHashMap.Node
759 static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) { in tabAt()
763 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i, in casTabAt()
768 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) { in setTabAt()
850 public ConcurrentHashMap(Map<? extends K, ? extends V> m) { in ConcurrentHashMap()
1086 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
1602 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
1613 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1635 boolean removeEntryIf(Predicate<? super Entry<K,V>> function) { in removeEntryIf()
1696 public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
[all …]
|
| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/19/libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ConcurrentHashMap.java | 637 Node(int hash, K key, V val, Node<K,V> next) { in Node() method in ConcurrentHashMap.Node
759 static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) { in tabAt()
763 static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i, in casTabAt()
768 static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) { in setTabAt()
850 public ConcurrentHashMap(Map<? extends K, ? extends V> m) { in ConcurrentHashMap()
1086 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
1602 public void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
1613 public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
1635 boolean removeEntryIf(Predicate<? super Entry<K,V>> function) { in removeEntryIf()
1696 public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
[all …]
|
| /aosp_15_r20/libcore/ojluni/annotations/hiddenapi/java/util/ |
| H A D | HashMap.java | 46 public HashMap(java.util.Map<? extends K, ? extends V> m) { in HashMap()
66 final void putMapEntries(java.util.Map<? extends K, ? extends V> m, boolean evict) { in putMapEntries()
102 final void treeifyBin(java.util.HashMap.Node<K, V>[] tab, int hash) { in treeifyBin()
106 public void putAll(java.util.Map<? extends K, ? extends V> m) { in putAll()
164 K key, java.util.function.Function<? super K, ? extends V> mappingFunction) { in computeIfAbsent()
170 java.util.function.BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in computeIfPresent()
176 java.util.function.BiFunction<? super K, ? super V, ? extends V> remappingFunction) { in compute()
187 public void forEach(java.util.function.BiConsumer<? super K, ? super V> action) { in forEach()
192 java.util.function.BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll()
217 java.util.HashMap.Node<K, V> newNode( in newNode()
[all …]
|