/libcore/ojluni/src/main/java/java/util/ |
H A D | ArrayList.java | 52 * specified beyond the fact that adding an element has constant amortized 64 * resizes the backing array; merely setting the value of an element is not 137 * first element is added. 145 * will be expanded to DEFAULT_CAPACITY when the first element is added. 225 // any size if not default element table 305 * Returns <tt>true</tt> if this list contains the specified element. 307 * at least one element <tt>e</tt> such that 310 * @param o element whose presence in this list is to be tested 311 * @return <tt>true</tt> if this list contains the specified element 318 * Returns the index of the first occurrence of the specified element 451 set(int index, E element) argument 481 add(int index, E element) argument [all...] |
H A D | ArrayDeque.java | 103 * The index of the element at the head of the deque (which is the 104 * element that would be removed by remove() or pop()); or an 110 * The index at which the next element would be added to the tail 188 * iterator. (The first element returned by the collection's 189 * iterator becomes the first element, or <i>front</i> of the 205 * Inserts the specified element at the front of this deque. 207 * @param e the element to add 208 * @throws NullPointerException if the specified element is null 219 * Inserts the specified element at the end of this deque. 223 * @param e the element t 456 public E element() { method in class:ArrayDeque [all...] |
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | Collectors.java | 274 * @param delimiter the delimiter to be used between each element 287 * @param delimiter the delimiter to be used between each element 328 * each input element before accumulation. 417 * Returns a {@code Collector} that produces the minimal element according 436 * Returns a {@code Collector} that produces the maximal element according 647 * @param <T> element type for the input and output of the reduction 690 * @param <T> element type for the input and output of the reduction 907 K key = Objects.requireNonNull(classifier.apply(t), "element cannot be mapped to a null key"); 1063 K key = Objects.requireNonNull(classifier.apply(t), "element cannot be mapped to a null key"); 1070 K key = Objects.requireNonNull(classifier.apply(t), "element canno [all...] |
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | ConcurrentLinkedQueueTest.java | 245 * peek returns next element, or null if empty 259 * element returns next element, or throws NSEE if empty 264 assertEquals(i, q.element()); 268 q.element(); 274 * remove removes next element, or throws NSEE if empty 482 * iterator.remove removes current element
|
H A D | PriorityQueueTest.java | 184 * Offer of comparable element succeeds 279 * peek returns next element, or null if empty 293 * element returns next element, or throws NSEE if empty 298 assertEquals(i, q.element()); 302 q.element(); 308 * remove removes next element, or throws NSEE if empty 462 * iterator.remove removes current element
|
H A D | LinkedListTest.java | 199 * peek returns next element, or null if empty 213 * element returns next element, or throws NSEE if empty 218 assertEquals(i, q.element()); 222 q.element(); 228 * remove removes next element, or throws NSEE if empty 420 * iterator.remove removes current element 472 * descendingIterator.remove removes current element 500 * peek returns element inserted with addFirst 509 * peekFirst returns element inserte [all...] |
H A D | PriorityBlockingQueueTest.java | 195 * Offer of comparable element succeeds 423 * peek returns next element, or null if empty 437 * element returns next element, or throws NSEE if empty 442 assertEquals(i, q.element()); 446 q.element(); 452 * remove removes next element, or throws NSEE if empty 597 * iterator.remove removes current element
|
H A D | ArrayBlockingQueueTest.java | 482 * peek returns next element, or null if empty 496 * element returns next element, or throws NSEE if empty 501 assertEquals(i, q.element()); 505 q.element(); 511 * remove removes next element, or throws NSEE if empty 727 * iterator.remove removes current element
|
H A D | ArrayDequeTest.java | 139 * peekFirst() returns element inserted with push 149 * pop() removes next element, or throws NSEE if empty 380 * remove() removes next element, or throws NSEE if empty 415 * peekFirst() returns next element, or null if empty 429 * peek() returns next element, or null if empty 443 * peekLast() returns next element, or null if empty 457 * element() returns first element, or throws NSEE if empty 462 assertEquals(i, q.element()); 466 q.element(); [all...] |
H A D | ConcurrentLinkedDequeTest.java | 143 * peekFirst() returns element inserted with push 153 * pop() removes first element, or throws NSEE if empty 395 * peek() returns next element, or null if empty 409 * element() returns first element, or throws NSEE if empty 414 assertEquals(i, q.element()); 418 q.element(); 424 * remove() removes next element, or throws NSEE if empty 459 * peekFirst() returns next element, or null if empty 473 * peekLast() returns next element, o [all...] |
H A D | DelayQueueTest.java | 463 * peek returns next element, or null if empty 479 * element returns next element, or throws NSEE if empty 484 assertEquals(new PDelay(i), q.element()); 488 q.element(); 494 * remove removes next element, or throws NSEE if empty 643 * iterator.remove removes current element
|
H A D | LinkedBlockingQueueTest.java | 471 * peek returns next element, or null if empty 485 * element returns next element, or throws NSEE if empty 490 assertEquals(i, q.element()); 494 q.element(); 500 * remove removes next element, or throws NSEE if empty 663 * iterator.remove removes current element
|
H A D | LinkedTransferQueueTest.java | 338 * peek returns next element, or null if empty 353 * element returns next element, or throws NoSuchElementException if empty 358 assertEquals(i, (int) q.element()); 362 q.element(); 369 * remove removes next element, or throws NoSuchElementException if empty 536 * iterator.remove() removes current element 779 * transfer waits until a poll occurs. The transfered element 840 * thread returns the element 862 * transfer waits until a take occurs. The transfered element [all...] |
H A D | SynchronousQueueTest.java | 308 * element() throws NoSuchElementException if no active putter 315 q.element(); 406 * element (if present) nulled out
|
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
H A D | DOMConfigurationImpl.java | 50 * element-content-whitespace = true 108 PARAMETERS.put("element-content-whitespace", new FixedParameter(true)); 145 * element-content-whitespace = true 154 // element-content-whitespace is always true 166 // element-content-whitespace is always true 251 * recompute element content whitespace, ID and schema type data. 434 ElementImpl element = (ElementImpl) node; 435 NamedNodeMap attributes = element.getAttributes();
|
/libcore/luni/src/test/java/libcore/java/lang/ |
H A D | OldThreadGroupTest.java | 383 for (ThreadGroup element : children) { 384 populateGroupsWithThreads(element, threadCount, out);
|
/libcore/luni/src/test/java/org/apache/harmony/regex/tests/java/util/regex/ |
H A D | PatternTest.java | 476 for (String element : patterns) { 478 Pattern.compile(element); 497 for (String element : patterns) { 498 Pattern.compile(element); 601 for (String element : neg_patterns) { 603 Pattern.compile(element); 604 fail("PatternSyntaxException was expected: " + element);
|
/libcore/luni/src/main/java/java/math/ |
H A D | BigInteger.java | 277 for (byte element : magnitude) { 278 if (element != 0) { 911 * Returns a two element {@code BigInteger} array containing
|
/libcore/luni/src/test/java/libcore/xml/ |
H A D | NormalizeTest.java | 62 "element-content-whitespace", "comments", "namespaces" }; 109 assertEquals(true, domConfiguration.getParameter("element-content-whitespace")); 110 assertUnsupported("element-content-whitespace", false); 111 assertSupported("element-content-whitespace", true); 569 private void assertChildren(Element element, String... texts) { argument 571 NodeList nodes = element.getChildNodes();
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | ArrayDequeTest.java | 471 * {@link java.util.ArrayDeque#element()} 478 assertEquals(testObjOne, testQue.element()); 481 assertEquals(testObjTwo, testQue.element()); 483 assertEquals(testObjThree, testQue.element()); 487 testQue.element();
|
H A D | IdentityHashMapTest.java | 93 assertTrue("cannot get element", empty.get("something") == "here"); 384 assertEquals("Assert 1: After removing non-null element size is incorrect", 0, hashMap.size()); 389 assertEquals("Assert 3: After removing null element size is incorrect", 0, hashMap.size()); 773 Object element = it.next(); 774 if (element == key) { 777 newset.add(element); 782 assertTrue("element is in newset ", !newset.contains(key)); 783 assertTrue("element not removed from keyset", !set.contains(key)); 784 assertTrue("element not removed from map", !map.containsKey(key));
|
H A D | ArraysTest.java | 4278 public void add(int element) { argument 4279 array[idx++] = element; 4296 public void add(long element) { argument 4297 array[idx++] = element; 4314 public void add(double element) { argument 4315 array[idx++] = element;
|
/libcore/luni/src/test/java/libcore/java/lang/reflect/ |
H A D | ReflectionTest.java | 419 private int count(List<?> list, Object element) { argument 422 if (o.equals(element)) {
|
/libcore/luni/src/test/java/libcore/java/net/ |
H A D | AbstractCookiesTest.java | 734 private void assertContains(Collection<String> collection, String element) { argument 736 if (c != null && c.equalsIgnoreCase(element)) { 740 fail("No " + element + " in " + collection);
|
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | LinkedHashMapTest.java | 259 for (E element : iterable) {
|