/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | CopyOnWriteArrayList.java | 79 * <p>All elements are permitted, including {@code null}. 90 * @param <E> the type of elements held in this list 103 // Android-changed: renamed array -> elements for backwards compatibility b/33916927 104 private transient volatile Object[] elements; field in class:CopyOnWriteArrayList 111 return elements; 118 elements = a; 129 * Creates a list containing the elements of the specified 133 * @param c the collection of initially held elements 137 Object[] elements; 139 elements 188 indexOf(Object o, Object[] elements, int index, int fence) argument 209 lastIndexOf(Object o, Object[] elements, int index) argument 1070 COWIterator(Object[] elements, int initialCursor) argument [all...] |
H A D | ConcurrentHashMap.java | 97 * Iterators, Spliterators and Enumerations return elements reflecting the 123 * given number of elements. Also, for compatibility with previous 158 * arguments and/or return values. Because the elements of a 349 * elements is roughly 1 / (8 * #elements) under random hashes. 382 * using power-of-two expansion, the elements from each bin must 445 * Comparable elements, but may contain others, as well as 446 * elements that are Comparable but not necessarily Comparable for 450 * if elements are not comparable or compare as 0 then both left 453 * would be necessary if all elements wer 2156 public Enumeration<V> elements() { method in class:ConcurrentHashMap [all...] |
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | ConcurrentHashMap8Test.java | 177 static Set populatedSet(Integer[] elements) { argument 180 for (int i = 0; i < elements.length; i++) 181 assertTrue(a.add(elements[i])); 183 assertEquals(elements.length, a.size()); 325 * KeySetView.spliterator returns spliterator over the elements in this set 343 * keyset.clear removes all elements from the set 352 * keyset.contains returns true for added elements 361 * KeySets with equal elements are equal 379 * KeySet.containsAll returns true for collections with subset of elements 399 * KeySet.iterator() returns an iterator containing the elements o [all...] |
/libcore/luni/src/test/java/libcore/java/security/ |
H A D | ProviderTest.java | 1097 private static Map<String, String> mapOf(String... elements) { argument 1099 for (int i = 0; i < elements.length; i += 2) { 1100 ret.put(elements[i], elements[i + 1]); 1121 // Check that elements are correctly mapped to services. 1128 // Check that elements are in the provider hash map.
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | Hashtable.java | 95 * The Enumerations returned by Hashtable's keys and elements methods are 254 * @see #elements() 264 * Use the Enumeration methods on the returned object to fetch the elements 273 public synchronized Enumeration<V> elements() { method in class:Hashtable 1140 // Write out the length and count of elements 1177 // Read the original length of the array and number of elements 1179 int elements = s.readInt(); 1181 // Validate # of elements 1182 if (elements < 0) 1183 throw new StreamCorruptedException("Illegal # of Elements: " + elements); [all...] |
H A D | Vector.java | 59 * the {@link #elements() elements} method are <em>not</em> fail-fast. 90 * and is at least large enough to contain all the vector's elements. 92 * <p>Any array elements following the last element in the Vector are null. 161 * Constructs a vector containing the elements of the specified 165 * @param c the collection whose elements are to be placed into this 338 public Enumeration<E> elements() { method in class:Vector 685 * Returns an array containing all of the elements in this Vector 695 * Returns an array containing all of the elements in this Vector in the 702 * (i.e., the array has more elements tha [all...] |
H A D | Collections.java | 119 * {@linkplain Comparable natural ordering} of its elements. 120 * All elements in the list must implement the {@link Comparable} 121 * interface. Furthermore, all elements in the list must be 123 * must not throw a {@code ClassCastException} for any elements 126 * <p>This sort is guaranteed to be <i>stable</i>: equal elements will 142 * @throws ClassCastException if the list contains elements that are not 147 * detects that the natural ordering of the list elements is 163 * specified comparator. All elements in the list must be <i>mutually 166 * for any elements {@code e1} and {@code e2} in the list). 168 * <p>This sort is guaranteed to be <i>stable</i>: equal elements wil 5444 addAll(Collection<? super T> c, T... elements) argument [all...] |
/libcore/ojluni/src/main/java/java/lang/ |
H A D | String.java | 2431 * {@code CharSequence elements} joined together with a copy of 2443 * @param elements the elements to join together. 2445 * @return a new {@code String} that is composed of the {@code elements} 2448 * @throws NullPointerException If {@code delimiter} or {@code elements} 2454 public static String join(CharSequence delimiter, CharSequence... elements) { argument 2456 Objects.requireNonNull(elements); 2457 // Number of elements not likely worth Arrays.stream overhead. 2459 for (CharSequence cs: elements) { 2467 * {@code CharSequence elements} joine 2502 join(CharSequence delimiter, Iterable<? extends CharSequence> elements) argument [all...] |
/libcore/ojluni/src/main/java/java/security/ |
H A D | Provider.java | 644 public Enumeration<Object> elements() { method in class:Provider 646 return super.elements();
|
/libcore/luni/src/test/java/libcore/java/net/ |
H A D | URLConnectionTest.java | 3031 private Set<String> newSet(String... elements) { argument 3032 return new HashSet<String>(Arrays.asList(elements));
|