Home
last modified time | relevance | path

Searched refs:V (Results 1 – 25 of 153) sorted by relevance

1234567

/libcore/ojluni/annotations/flagged_api/java/util/
DMap.annotated.java30 public interface Map<K, V> {
40 public V get(java.lang.Object key); in get()
42 public V put(K key, V value); in put()
44 public V remove(java.lang.Object key); in remove()
46 public void putAll(java.util.Map<? extends K,? extends V> m); in putAll()
52 public java.util.Collection<V> values(); in values()
54 public java.util.Set<java.util.Map.Entry<K,V>> entrySet(); in entrySet()
60 public default V getOrDefault(java.lang.Object key, V defaultValue) { throw new RuntimeException("S… in getOrDefault()
62 public default void forEach(java.util.function.BiConsumer<? super K,? super V> action) { throw new … in forEach()
64 public default void replaceAll(java.util.function.BiFunction<? super K,? super V,? extends V> funct… in replaceAll() argument
[all …]
DHashMap.annotated.java30 public class HashMap<K, V> extends java.util.AbstractMap<K,V> implements java.util.Map<K,V>, java.l…
38 public HashMap(java.util.Map<? extends K,? extends V> m) { throw new RuntimeException("Stub!"); } in HashMap()
44 public V get(java.lang.Object key) { throw new RuntimeException("Stub!"); } in get()
48 public V put(K key, V value) { throw new RuntimeException("Stub!"); } in put()
50 public void putAll(java.util.Map<? extends K,? extends V> m) { throw new RuntimeException("Stub!");… in putAll()
52 public V remove(java.lang.Object key) { throw new RuntimeException("Stub!"); } in remove()
60 public java.util.Collection<V> values() { throw new RuntimeException("Stub!"); } in values()
62 public java.util.Set<java.util.Map.Entry<K,V>> entrySet() { throw new RuntimeException("Stub!"); } in entrySet()
64 public V getOrDefault(java.lang.Object key, V defaultValue) { throw new RuntimeException("Stub!"); } in getOrDefault()
66 public V putIfAbsent(K key, V value) { throw new RuntimeException("Stub!"); } in putIfAbsent()
[all …]
DTreeMap.annotated.java31 public class TreeMap<K, V> extends java.util.AbstractMap<K,V> implements java.util.NavigableMap<K,V…
37 public TreeMap(java.util.Map<? extends K,? extends V> m) { throw new RuntimeException("Stub!"); } in TreeMap()
39 public TreeMap(java.util.SortedMap<K,? extends V> m) { throw new RuntimeException("Stub!"); } in TreeMap()
47 public V get(java.lang.Object key) { throw new RuntimeException("Stub!"); } in get()
56 public V putFirst(K k, V v) { throw new RuntimeException("Stub!"); } in putFirst()
59 public V putLast(K k, V v) { throw new RuntimeException("Stub!"); } in putLast()
61 public void putAll(java.util.Map<? extends K,? extends V> map) { throw new RuntimeException("Stub!"… in putAll()
63 public V put(K key, V value) { throw new RuntimeException("Stub!"); } in put()
65 public V putIfAbsent(K key, V value) { throw new RuntimeException("Stub!"); } in putIfAbsent()
67 public V computeIfAbsent(K key, java.util.function.Function<? super K,? extends V> mappingFunction)… in computeIfAbsent()
[all …]
/libcore/ojluni/src/main/java/java/util/
DMap.java161 public interface Map<K, V> {
245 V get(Object key); in get()
273 V put(K key, V value); in put()
305 V remove(Object key); in remove()
329 void putAll(Map<? extends K, ? extends V> m); in putAll()
375 Collection<V> values(); in values()
393 Set<Map.Entry<K, V>> entrySet(); in entrySet()
427 interface Entry<K, V> {
448 V getValue(); in getValue()
470 V setValue(V value); in setValue()
[all …]
DLinkedHashMap.java194 public class LinkedHashMap<K,V>
195 extends HashMap<K,V>
196 implements SequencedMap<K,V>, Map<K, V>
223 static class Entry<K,V> extends HashMap.Node<K,V> {
224 Entry<K,V> before, after;
225 Entry(int hash, K key, V value, Node<K,V> next) { in Entry()
236 transient LinkedHashMap.Entry<K,V> head;
241 transient LinkedHashMap.Entry<K,V> tail;
254 private void linkNodeAtEnd(LinkedHashMap.Entry<K,V> p) { in linkNodeAtEnd()
256 LinkedHashMap.Entry<K,V> first = head; in linkNodeAtEnd()
[all …]
DReverseOrderSortedMapView.java33 class ReverseOrderSortedMapView<K, V> extends AbstractMap<K, V> implements SortedMap<K, V> {
34 final SortedMap<K, V> base;
37 private ReverseOrderSortedMapView(SortedMap<K, V> map) { in ReverseOrderSortedMapView()
42 public static <K, V> SortedMap<K, V> of(SortedMap<K, V> map) { in of()
43 if (map instanceof ReverseOrderSortedMapView<K, V> rosmv) { in of()
74 public V get(Object key) { in get()
82 public V put(K key, V value) { in put()
86 public void putAll(Map<? extends K, ? extends V> m) { in putAll()
90 public V remove(Object key) { in remove()
109 public Collection<V> values() {
[all …]
DTreeMap.java124 public class TreeMap<K,V>
125 extends AbstractMap<K,V>
126 implements NavigableMap<K,V>, Cloneable, java.io.Serializable
137 private transient TreeMapEntry<K,V> root;
197 public TreeMap(Map<? extends K, ? extends V> m) { in TreeMap()
211 public TreeMap(SortedMap<K, ? extends V> m) { in TreeMap()
262 for (TreeMapEntry<K,V> e = getFirstEntry(); e != null; e = successor(e)) in containsValue()
290 public V get(Object key) { in get()
291 TreeMapEntry<K,V> p = getEntry(key); in get()
321 public V putFirst(K k, V v) { in putFirst()
[all …]
DWeakHashMap.java135 public class WeakHashMap<K,V>
136 extends AbstractMap<K,V>
137 implements Map<K,V> {
159 Entry<K,V>[] table;
193 private Entry<K,V>[] newTable(int n) { in newTable()
194 return (Entry<K,V>[]) new Entry<?,?>[n]; in newTable()
253 public WeakHashMap(Map<? extends K, ? extends V> m) { in WeakHashMap()
285 private boolean matchesKey(Entry<K,V> e, Object key) { in matchesKey()
326 Entry<K,V> e = (Entry<K,V>) x; in expungeStaleEntries()
329 Entry<K,V> prev = table[i]; in expungeStaleEntries()
[all …]
DHashMap.java138 public class HashMap<K,V> extends AbstractMap<K,V>
139 implements Map<K,V>, Cloneable, Serializable {
280 static class Node<K,V> implements Map.Entry<K,V> {
283 V value;
284 Node<K,V> next;
286 Node(int hash, K key, V value, Node<K,V> next) { in Node()
294 public final V getValue() { return value; } in getValue()
301 public final V setValue(V newValue) { in setValue()
302 V oldValue = value; in setValue()
389 transient Node<K,V>[] table;
[all …]
DNavigableMap.java103 public interface NavigableMap<K,V> extends SortedMap<K,V> {
117 Map.Entry<K,V> lowerEntry(K key); in lowerEntry()
146 Map.Entry<K,V> floorEntry(K key); in floorEntry()
175 Map.Entry<K,V> ceilingEntry(K key); in ceilingEntry()
204 Map.Entry<K,V> higherEntry(K key); in higherEntry()
227 Map.Entry<K,V> firstEntry(); in firstEntry()
236 Map.Entry<K,V> lastEntry(); in lastEntry()
245 Map.Entry<K,V> pollFirstEntry(); in pollFirstEntry()
254 Map.Entry<K,V> pollLastEntry(); in pollLastEntry()
271 NavigableMap<K,V> descendingMap(); in descendingMap()
[all …]
DAbstractMap.java72 public abstract class AbstractMap<K,V> implements Map<K,V> {
116 Iterator<Entry<K,V>> i = entrySet().iterator(); in containsValue()
119 Entry<K,V> e = i.next(); in containsValue()
125 Entry<K,V> e = i.next(); in containsValue()
148 Iterator<Map.Entry<K,V>> i = entrySet().iterator(); in containsKey()
151 Entry<K,V> e = i.next(); in containsKey()
157 Entry<K,V> e = i.next(); in containsKey()
179 public V get(Object key) { in get()
180 Iterator<Entry<K,V>> i = entrySet().iterator(); in get()
183 Entry<K,V> e = i.next(); in get()
[all …]
/libcore/ojluni/src/main/java/java/util/concurrent/atomic/
DAtomicReference.java51 public class AtomicReference<V> implements java.io.Serializable {
64 private volatile V value;
71 public AtomicReference(V initialValue) { in AtomicReference()
87 public final V get() { in get()
97 public final void set(V newValue) { in set()
108 public final void lazySet(V newValue) { in lazySet()
122 public final boolean compareAndSet(V expectedValue, V newValue) { in compareAndSet()
143 public final boolean weakCompareAndSet(V expectedValue, V newValue) { in weakCompareAndSet()
157 public final boolean weakCompareAndSetPlain(V expectedValue, V newValue) { in weakCompareAndSetPlain()
169 public final V getAndSet(V newValue) { in getAndSet()
[all …]
DAtomicReferenceFieldUpdater.java90 public abstract class AtomicReferenceFieldUpdater<T,V> {
136 public abstract boolean compareAndSet(T obj, V expect, V update); in compareAndSet()
154 public abstract boolean weakCompareAndSet(T obj, V expect, V update); in weakCompareAndSet()
164 public abstract void set(T obj, V newValue); in set()
174 public abstract void lazySet(T obj, V newValue); in lazySet()
183 public abstract V get(T obj); in get()
193 public V getAndSet(T obj, V newValue) { in getAndSet()
194 V prev; in getAndSet()
214 public final V getAndUpdate(T obj, UnaryOperator<V> updateFunction) { in getAndUpdate()
215 V prev, next; in getAndUpdate()
[all …]
/libcore/luni/src/main/native/
DJniConstants.cpp47 #define JCLASS_CONSTANTS_LIST(V) \ argument
48 V(BooleanClass, "java/lang/Boolean") \
49 V(ByteBufferClass, "java/nio/ByteBuffer") \
50 V(DoubleClass, "java/lang/Double") \
51 V(ErrnoExceptionClass, "android/system/ErrnoException") \
52 V(FileDescriptorClass, "java/io/FileDescriptor") \
53 V(GaiExceptionClass, "android/system/GaiException") \
54 V(Inet6AddressClass, "java/net/Inet6Address") \
55 V(Inet6AddressHolderClass, "java/net/Inet6Address$Inet6AddressHolder") \
56 V(InetAddressClass, "java/net/InetAddress") \
[all …]
/libcore/ojluni/annotations/hiddenapi/java/util/
DHashMap.java31 public class HashMap<K, V> extends java.util.AbstractMap<K, V>
32 implements java.util.Map<K, V>, java.lang.Cloneable, java.io.Serializable {
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()
78 public V get(java.lang.Object key) { in get()
82 final java.util.HashMap.Node<K, V> getNode(int hash, java.lang.Object key) { in getNode()
90 public V put(K key, V value) { in put()
94 final V putVal(int hash, K key, V value, boolean onlyIfAbsent, boolean evict) { in putVal()
98 final java.util.HashMap.Node<K, V>[] resize() { in resize()
102 final void treeifyBin(java.util.HashMap.Node<K, V>[] tab, int hash) { in treeifyBin()
[all …]
DLinkedHashMap.java31 public class LinkedHashMap<K, V> extends java.util.HashMap<K, V> implements java.util.Map<K, V> {
45 public LinkedHashMap(java.util.Map<? extends K, ? extends V> m) { in LinkedHashMap()
53 private void linkNodeLast(java.util.LinkedHashMap.LinkedHashMapEntry<K, V> p) { in linkNodeLast()
58 java.util.LinkedHashMap.LinkedHashMapEntry<K, V> src, in transferLinks()
59 java.util.LinkedHashMap.LinkedHashMapEntry<K, V> dst) { in transferLinks()
67 java.util.HashMap.Node<K, V> newNode(int hash, K key, V value, java.util.HashMap.Node<K, V> e) { in newNode()
71 java.util.HashMap.Node<K, V> replacementNode( in replacementNode()
72 java.util.HashMap.Node<K, V> p, java.util.HashMap.Node<K, V> next) { in replacementNode()
76 java.util.HashMap.TreeNode<K, V> newTreeNode( in newTreeNode()
77 int hash, K key, V value, java.util.HashMap.Node<K, V> next) { in newTreeNode()
[all …]
/libcore/ojluni/annotations/flagged_api/java/util/concurrent/
DConcurrentSkipListMap.annotated.java40 …ss ConcurrentSkipListMap<K, V> extends java.util.AbstractMap<K,V> implements java.util.concurrent.…
46 public ConcurrentSkipListMap(java.util.Map<? extends K,? extends V> m) { throw new RuntimeException… in ConcurrentSkipListMap()
48 public ConcurrentSkipListMap(java.util.SortedMap<K,? extends V> m) { throw new RuntimeException("St… in ConcurrentSkipListMap()
50 public java.util.concurrent.ConcurrentSkipListMap<K,V> clone() { throw new RuntimeException("Stub!"… in clone()
54 public V get(java.lang.Object key) { throw new RuntimeException("Stub!"); } in get()
56 public V getOrDefault(java.lang.Object key, V defaultValue) { throw new RuntimeException("Stub!"); } in getOrDefault()
58 public V put(K key, V value) { throw new RuntimeException("Stub!"); } in put()
60 public V remove(java.lang.Object key) { throw new RuntimeException("Stub!"); } in remove()
70 public V computeIfAbsent(K key, java.util.function.Function<? super K,? extends V> mappingFunction)… in computeIfAbsent()
72 public V computeIfPresent(K key, java.util.function.BiFunction<? super K,? super V,? extends V> rem… in computeIfPresent() argument
[all …]
/libcore/ojluni/annotations/sdk/nullability/java/util/
DMap.annotated.java32 public interface Map<K, V> {
42 @libcore.util.Nullable public V get(@libcore.util.Nullable java.lang.Object key); in get()
44 @libcore.util.Nullable public V put(@libcore.util.NullFromTypeParam K key, @libcore.util.NullFromTy… in put()
46 @libcore.util.Nullable public V remove(@libcore.util.Nullable java.lang.Object key); in remove()
48 …il.Map<? extends @libcore.util.NullFromTypeParam K,? extends @libcore.util.NullFromTypeParam V> m); in putAll()
54 @libcore.util.NonNull public java.util.Collection<@libcore.util.NullFromTypeParam V> values(); in values()
56 …il.NonNull Entry<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V>> entrySet(); in entrySet()
62 …core.util.Nullable public default V getOrDefault(@libcore.util.Nullable java.lang.Object key, @lib… in getOrDefault()
64 …r @libcore.util.NullFromTypeParam K,? super @libcore.util.NullFromTypeParam V> action) { throw new… in forEach()
66 …omTypeParam K,? super @libcore.util.NullFromTypeParam V,? extends @libcore.util.NullFromTypeParam … in replaceAll() argument
[all …]
DHashMap.annotated.java31 public class HashMap<K, V> extends java.util.AbstractMap<K,V> implements java.util.Map<K,V>, java.l…
39 …libcore.util.NullFromTypeParam K, ? extends @libcore.util.NullFromTypeParam V> m) { throw new Runt… in HashMap()
45 @libcore.util.Nullable public V get(@libcore.util.Nullable java.lang.Object key) { throw new Runtim… in get()
49 @libcore.util.Nullable public V put(@libcore.util.NullFromTypeParam K key, @libcore.util.NullFromTy… in put()
51 …@libcore.util.NullFromTypeParam K,? extends @libcore.util.NullFromTypeParam V> m) { throw new Runt… in putAll()
53 @libcore.util.Nullable public V remove(@libcore.util.Nullable java.lang.Object key) { throw new Run… in remove()
61 @libcore.util.NonNull public java.util.Collection<@libcore.util.NullFromTypeParam V> values() { thr… in values()
63 …ll Entry<@libcore.util.NullFromTypeParam K, @libcore.util.NullFromTypeParam V>> entrySet() { throw… in entrySet()
65 @libcore.util.Nullable public V getOrDefault(@libcore.util.Nullable java.lang.Object key, @libcore.… in getOrDefault()
67 @libcore.util.Nullable public V putIfAbsent(@libcore.util.NullFromTypeParam K key, @libcore.util.Nu… in putIfAbsent()
[all …]
/libcore/ojluni/src/main/java/java/util/concurrent/
DExecutorCompletionService.java103 public class ExecutorCompletionService<V> implements CompletionService<V> {
106 private final BlockingQueue<Future<V>> completionQueue;
111 private static class QueueingFuture<V> extends FutureTask<Void> {
112 QueueingFuture(RunnableFuture<V> task, in QueueingFuture()
113 BlockingQueue<Future<V>> completionQueue) { in QueueingFuture()
118 private final Future<V> task;
119 private final BlockingQueue<Future<V>> completionQueue;
123 private RunnableFuture<V> newTaskFor(Callable<V> task) { in newTaskFor()
125 return new FutureTask<V>(task); in newTaskFor()
130 private RunnableFuture<V> newTaskFor(Runnable task, V result) { in newTaskFor()
[all …]
DConcurrentMap.java71 public interface ConcurrentMap<K,V> extends Map<K,V> {
86 default V getOrDefault(Object key, V defaultValue) { in getOrDefault()
87 V v; in getOrDefault()
110 default void forEach(BiConsumer<? super K, ? super V> action) { in forEach()
112 for (Map.Entry<K,V> entry : entrySet()) { in forEach()
114 V v; in forEach()
157 V putIfAbsent(K key, V value); in putIfAbsent()
220 boolean replace(K key, V oldValue, V newValue); in replace()
252 V replace(K key, V value); in replace()
285 default void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) { in replaceAll() argument
[all …]
DConcurrentSkipListMap.java112 public class ConcurrentSkipListMap<K,V> extends AbstractMap<K,V>
113 implements ConcurrentNavigableMap<K,V>, Cloneable, Serializable {
341 private transient Index<K,V> head;
345 private transient KeySet<K,V> keySet;
347 private transient Values<K,V> values;
349 private transient EntrySet<K,V> entrySet;
351 private transient SubMap<K,V> descendingMap;
360 static final class Node<K,V> {
362 V val;
363 Node<K,V> next;
[all …]
DConcurrentHashMap.java264 public class ConcurrentHashMap<K,V> extends AbstractMap<K,V>
265 implements ConcurrentMap<K,V>, Serializable {
625 static class Node<K,V> implements Map.Entry<K,V> {
628 volatile V val;
629 volatile Node<K,V> next;
631 Node(int hash, K key, V val) { in Node()
637 Node(int hash, K key, V val, Node<K,V> next) { in Node()
643 public final V getValue() { return val; } in getValue()
648 public final V setValue(V value) { in setValue()
664 Node<K,V> find(int h, Object k) { in find()
[all …]
/libcore/ojluni/src/main/java/sun/security/util/
DCache.java72 public abstract class Cache<K,V> {
91 public abstract void put(K key, V value); in put()
96 public abstract V get(Object key); in get()
106 public abstract V pull(Object key); in pull()
121 public abstract void accept(CacheVisitor<K,V> visitor); in accept()
127 public static <K,V> Cache<K,V> newSoftMemoryCache(int size) { in newSoftMemoryCache()
136 public static <K,V> Cache<K,V> newSoftMemoryCache(int size, int timeout) { in newSoftMemoryCache()
144 public static <K,V> Cache<K,V> newHardMemoryCache(int size) { in newHardMemoryCache()
152 public static <K,V> Cache<K,V> newNullCache() { in newNullCache()
153 return (Cache<K,V>) NullCache.INSTANCE; in newNullCache()
[all …]
/libcore/ojluni/annotations/hiddenapi/sun/security/util/
DMemoryCache.java22 class MemoryCache<K, V> extends sun.security.util.Cache<K, V> {
48 public synchronized void put(K key, V value) { in put()
52 public synchronized V get(java.lang.Object key) { in get()
68 public synchronized void accept(sun.security.util.Cache.CacheVisitor<K, V> visitor) { in accept()
72 private java.util.Map<K, V> getCachedEntries() { in getCachedEntries()
76 protected sun.security.util.MemoryCache.CacheEntry<K, V> newEntry( in newEntry()
77 K key, V value, long expirationTime, java.lang.ref.ReferenceQueue<V> queue) { in newEntry()
85 private final java.util.Map<K, sun.security.util.MemoryCache.CacheEntry<K, V>> cacheMap;
95 private final java.lang.ref.ReferenceQueue<V> queue;
102 private static interface CacheEntry<K, V> {
[all …]

1234567