/libcore/luni/src/test/java/libcore/libcore/util/ |
H A D | TimeZoneFinderTest.java | 973 private static <X> List<X> list(X... values) { argument 974 return Arrays.asList(values);
|
/libcore/ojluni/src/lambda/java/java/lang/invoke/ |
H A D | MethodHandles.java | 121 MethodHandle insertArguments(MethodHandle target, int pos, Object... values) { return null; } argument
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | ProcessEnvironment.java | 254 public Collection<String> values() { method in class:ProcessEnvironment.StringEnvironment 255 return new StringValues(m.values());
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | LinkedHashMap.java | 149 * {@code c = lhm.keySet()} or {@code c = lhm.values()}, use 170 * @param <V> the type of mapped values 600 * Returns a {@link Collection} view of the values contained in this map. 615 * @return a view of the values contained in this map 617 public Collection<V> values() { method in class:LinkedHashMap 618 Collection<V> vs = values; 621 values = vs;
|
H A D | Hashtable.java | 35 * This class implements a hash table, which maps keys to values. Any 55 * time and space costs. Higher values decrease the space overhead but 240 * Tests if this hashtable maps no keys to values. 242 * @return <code>true</code> if this hashtable maps no keys to values; 263 * Returns an enumeration of the values in this hashtable. 267 * @return an enumeration of the values in this hashtable. 270 * @see #values() 541 * hashtable itself is copied, but the keys and values are not cloned. 556 t.values = null; 624 private transient volatile Collection<V> values; field in class:Hashtable 762 public Collection<V> values() { method in class:Hashtable [all...] |
H A D | IdentityHashMap.java | 36 * values). In other words, in an <tt>IdentityHashMap</tt>, two keys 59 * <tt>null</tt> values and the <tt>null</tt> key. This class makes no 119 * alternates holding keys and values. (This has better locality for large 696 * Returns a shallow copy of this identity hash map: the keys and values 1052 * Returns a {@link Collection} view of the values contained in this map. 1071 public Collection<V> values() { method in class:IdentityHashMap 1072 Collection<V> vs = values; 1075 values = vs; 1282 // Write out keys and values (alternating) 1309 // Read the keys and values, an [all...] |
H A D | WeakHashMap.java | 47 * <p> Both null values and the null key are supported. This class has 75 * is possible for the <tt>size</tt> method to return smaller values over 98 * turn, strongly refers to the key of the first value object. If the values 100 * to deal with this is to wrap values themselves within 127 * @param <V> the type of mapped values 907 * Returns a {@link Collection} view of the values contained in this map. 919 public Collection<V> values() { method in class:WeakHashMap 920 Collection<V> vs = values; 923 values = vs;
|
H A D | HashMap.java | 41 * <tt>null</tt> values and the <tt>null</tt> key. (The <tt>HashMap</tt> 68 * tradeoff between time and space costs. Higher values decrease the 124 * @param <V> the type of mapped values 166 * return values that are poorly distributed, as well as those in 186 * factorial(k)). The first values are: 399 * for keySet() and values(). 942 * Returns a {@link Collection} view of the values contained in this map. 954 * @return a view of the values contained in this map 956 public Collection<V> values() { method in class:HashMap 957 Collection<V> vs = values; [all...] |
H A D | TreeMap.java | 100 * @param <V> the type of mapped values 625 * values themselves are not cloned.) 837 * Returns a {@link Collection} view of the values contained in this map. 839 * <p>The collection's iterator returns the values in ascending order 857 public Collection<V> values() { method in class:TreeMap 858 Collection<V> vs = values; 861 values = vs; 1300 * Test two values for equality. Differs from o1.equals(o2) only in 1361 * backing map, and the other values are ignored. Otherwise, 2464 // Write out keys and values (alternatin [all...] |
H A D | Collections.java | 98 * a "small" sequential access list for each algorithm. The values below 102 * do well to validate the values of these parameters from time to time. 764 * <tt>list.size()</tt>, for all values of <tt>i</tt> between <tt>0</tt> 1470 * @param <V> the class of the map values 1513 private transient Collection<V> values; field in class:Collections.UnmodifiableMap 1527 public Collection<V> values() { method in class:Collections.UnmodifiableMap 1528 if (values==null) 1529 values = unmodifiableCollection(m.values()); 1530 return values; 2646 private transient Collection<V> values; field in class:Collections.SynchronizedMap 2664 public Collection<V> values() { method in class:Collections.SynchronizedMap 3659 public Collection<V> values() { return m.values(); } method in class:Collections.CheckedMap 4628 public Collection<V> values() {return emptySet();} method in class:Collections.EmptyMap 4929 private transient Collection<V> values; field in class:Collections.SingletonMap 4944 public Collection<V> values() { method in class:Collections.SingletonMap [all...] |
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | IntStream.java | 161 * {@code IntStream} of new values 229 * especially for large values of {@code maxSize}, since {@code limit(n)} 258 * especially for large values of {@code n}, since {@code skip(n)} 363 * function for combining two values 403 * function for combining two values 440 * function for combining two values, which must be 716 * Returns a sequential ordered stream whose elements are the specified values. 718 * @param values the elements of the new stream 721 public static IntStream of(int... values) { argument 722 return Arrays.stream(values); [all...] |
H A D | LongStream.java | 165 * {@code LongStream} of new values 233 * especially for large values of {@code maxSize}, since {@code limit(n)} 262 * especially for large values of {@code n}, since {@code skip(n)} 367 * function for combining two values 407 * function for combining two values 444 * function for combining two values, which must be 708 * Returns a sequential ordered stream whose elements are the specified values. 710 * @param values the elements of the new stream 713 public static LongStream of(long... values) { argument 714 return Arrays.stream(values); [all...] |
/libcore/ojluni/src/main/java/java/lang/invoke/ |
H A D | VarHandle.java | 69 * Trailing arguments to the invocation represent values of importance to the 80 * types of a VarHandle instance and the types for values of importance to the 110 * and for primitive values of at most 32 bits, and impose no observable 306 * widen primitive values, as if by {@link MethodHandle#asType asType} (see also 1623 private static Class<?>[] allocateParameters(int values, argument 1625 int size = ((receiver != null) ? 1 : 0) + intermediate.length + values; 1835 // Initial capacity of # values is sufficient to avoid resizes 1837 methodNameToAccessMode = new HashMap<>(AccessMode.values().length); 1838 for (AccessMode am : AccessMode.values()) { 2052 new MethodType[VarHandle.AccessType.values() [all...] |
H A D | MethodHandles.java | 76 * values to different callers. 1193 * @return a method handle which can load values from the field 1253 * @return a method handle which can store values into the field 1296 * and atomic update access modes compare values using their bitwise 1300 * Bitwise comparison of {@code float} values or {@code double} values, 1304 * comparing NaN values or comparing {@code -0.0} with {@code +0.0}. 1306 * and exchange operation with such values since the operation may 1308 * There are many possible NaN values that are considered to be 1316 * The values { 2789 insertArguments(MethodHandle target, int pos, Object... values) argument [all...] |
H A D | Transformers.java | 114 // We pre-calculate the ranges of values we have to copy through to the delegate 1694 private final Object[] values; field in class:Transformers.InsertArguments 1699 InsertArguments(MethodHandle target, int pos, Object[] values) { argument 1700 super(target.type().dropParameterTypes(pos, pos + values.length)); 1703 this.values = values; 1717 // Attach a stack frame writer so that we can copy the next |values.length| 1722 // Copy all the arguments supplied in |values|. 1726 for (int i = 0; i < values.length; ++i) { 1730 writer.putNextBoolean((boolean) values[ [all...] |
/libcore/ojluni/src/main/java/sun/invoke/util/ |
H A D | Wrapper.java | 167 for (Wrapper w : values()) { 187 for (Wrapper x : values()) { 201 for (Wrapper x : values()) { 233 /** Return the wrapper that wraps values of the given type. 254 /** Return the wrapper that wraps values into the given wrapper type. 263 for (Wrapper x : values()) 286 for (Wrapper x : values()) 325 for (Wrapper w : values()) { 587 public void copyArrayUnboxing(Object[] values, int vpos, Object a, int apos, int length) { argument 591 Object value = values[ 596 copyArrayBoxing(Object a, int apos, Object[] values, int vpos, int length) argument [all...] |
/libcore/ojluni/src/main/java/sun/security/x509/ |
H A D | AlgorithmId.java | 649 private static ObjectIdentifier oid(int ... values) { argument 650 return ObjectIdentifier.newInternal(values); 808 * Parameters include public values P and G, and may optionally specify 818 * Parameters may include public values P and G. 826 * Parameters may include public values P, Q, and G; or these may be 835 * Parameters may include public values P, Q, and G; or these may be
|
/libcore/luni/src/test/java/libcore/java/lang/invoke/ |
H A D | MethodHandleCombinersTest.java | 532 // short constant values are converted to int. 536 // char constant values are converted to int. 540 // int constant values are converted to int. 1426 // In all the cases below, the values printed will be 'a', 'b', 'c', 'd'. 1775 int [] values) 1777 for (int i = 0; i < values.length; ++i) { 1779 setter.invoke(values, i, value); 1780 assertEquals(values[i], value); 1781 assertEquals(getter.invoke(values, i), values[ 1773 arrayElementSetterGetter_delegate(MethodHandle getter, MethodHandle setter, int [] values) argument [all...] |
/libcore/ojluni/src/main/java/java/security/ |
H A D | Provider.java | 299 * Returns an unmodifiable Collection view of the property values 305 public Collection<Object> values() { method in class:Provider 307 return Collections.unmodifiableCollection(super.values()); 317 * provider's property values. 322 * denies access to set property values. 344 * provider's property values. 349 * denies access to set property values. 420 * provider's property values. 425 * denies access to set property values. 447 * provider's property values [all...] |
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | CollectionsTest.java | 86 testEmptyIterator(Collections.emptyMap().values().iterator()); 394 check_orderedCollection(map.values(), Arrays.asList(1, 2, 3, 4) /* expectedElementsInOrder */); 433 // different ones (StringBuilder and String) as values. 785 Collection<Integer> values = map.values(); 786 check_orderedCollection(values, Arrays.asList(1, 2, 3, 4)); 792 Collection<Integer> values = map.descendingMap().values(); 793 check_orderedCollection(values, Arrays.asList(4, 3, 2, 1)); 918 * @param valuesInOrder the expected values i 1199 check_unmodifiableOrderedCollection( Collection<V> values, List<V> elementsInOrder) argument [all...] |
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentSkipListMap.java | 106 * <em>not</em> permit the use of {@code null} keys or values because some 107 * null return values cannot be reliably distinguished from the absence of 112 * @param <V> the type of mapped values 161 * using otherwise impossible field values). Using plain nodes 318 * To produce random values without interference across threads, 381 /** Lazily initialized values collection */ 382 private transient Values<K,V> values; field in class:ConcurrentSkipListMap 394 values = null; 410 * Nodes hold keys and values, and are singly linked in sorted 414 * values fo 1858 public Collection<V> values() { method in class:ConcurrentSkipListMap 3061 public Collection<V> values() { method in class:ConcurrentSkipListMap.SubMap [all...] |
H A D | ConcurrentHashMap.java | 134 * mapped values are (perhaps transiently) not used or all take the 139 * java.util.concurrent.atomic.LongAdder} values and initializing via 155 * computing a snapshot summary of the values in a shared registry. 157 * functions with keys, values, entries, and (key, value) pairs as 158 * arguments and/or return values. Because the elements of a 162 * ordering, or on any other objects or values that may transiently 204 * extreme values, and then measure performance of using in-between 205 * values that trade off overhead versus throughput. 215 * and values in the map are never null, null serves as a reliable 262 * @param <V> the type of mapped values 822 private transient ValuesView<K,V> values; field in class:ConcurrentHashMap 1268 public Collection<V> values() { method in class:ConcurrentHashMap [all...] |