/libcore/luni/src/main/java/java/lang/ref/ |
H A D | ReferenceQueue.java | 156 // Find the last element in unenqueued. 157 Reference<?> last = unenqueued; 158 while (last.pendingNext != unenqueued) { 159 last = last.pendingNext; 162 last.pendingNext = list; 163 last = list; 164 while (last.pendingNext != list) { 165 last = last [all...] |
/libcore/luni/src/main/java/java/text/ |
H A D | CharacterIterator.java | 68 * @return the index one past the last character of the iteration. 85 public char last(); method in interface:CharacterIterator
|
H A D | IcuIteratorWrapper.java | 53 @Override public int last() { method in class:IcuIteratorWrapper 54 return wrapped.last();
|
H A D | SimpleDateFormat.java | 274 int next, last = -1, count = 0; 281 validatePatternCharacter((char) last); 284 if (last == next) { 285 last = -1; 287 last = next; 293 && (last == next || (next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z'))) { 294 if (last == next) { 298 validatePatternCharacter((char) last); 300 last = next; 305 validatePatternCharacter((char) last); [all...] |
H A D | BreakIterator.java | 56 * {@code first()}, {@code last()}, {@code next()}, and {@code previous()} that 73 * after the last character is 1 plus the length of the string.</li> 136 * int end = boundary.last(); 159 * Print the last element: 164 * int end = boundary.last(); 192 * int last = wb.following(pos); 195 * for (int p = last; p < current; p++) { 197 * return last; 199 * last = current; 338 * Returns the position of last boundar 409 public abstract int last(); method in class:BreakIterator [all...] |
/libcore/luni/src/main/java/java/util/ |
H A D | SortedSet.java | 69 * Returns the last element in this {@code SortedSet}. The last element is 72 * @return the last element. 76 public E last(); method in interface:SortedSet
|
H A D | MiniEnumSet.java | 61 private E last; field in class:MiniEnumSet.MiniEnumSetIterator 73 last = enums[ordinal]; 78 return last; 82 if (last == null) { 86 MiniEnumSet.this.remove(last); 87 last = null;
|
H A D | HugeEnumSet.java | 69 private E last; field in class:HugeEnumSet.HugeEnumSetIterator 102 last = enums[ordinal]; 107 return last; 111 if (last == null) { 115 HugeEnumSet.this.remove(last); 116 last = null; 179 // zero out unused bits on the last element
|
H A D | BitSet.java | 250 int last = 64 * longCount; 251 if (fromIndex >= last || fromIndex == toIndex) { 254 if (toIndex > last) { 255 toIndex = last; 273 // first fill in the first and last indexes in the new BitSet 291 // apply the last x bits of newBits[i+1] to the current 387 int last = 64 * longCount; 388 if (fromIndex >= last) { 391 if (toIndex > last) { 392 toIndex = last; [all...] |
H A D | LinkedList.java | 542 * Returns the last element in this {@code LinkedList}. 544 * @return the last element 549 Link<E> last = voidLink.previous; 550 if (last != voidLink) { 551 return last.data; 582 * index of the last occurrence. 586 * @return the index of the last occurrence of the object, or -1 if it was 693 * Removes the last object from this {@code LinkedList}. 704 Link<E> last = voidLink.previous; 705 if (last ! [all...] |
H A D | WeakHashMap.java | 556 Entry<K, V> entry, last = null; 564 if (last == null) { 567 last.next = entry.next; 572 last = entry; 669 Entry<K, V> entry, last = null; 674 last = entry; 680 last = entry; 686 if (last == null) { 689 last.next = entry.next;
|
/libcore/luni/src/main/java/java/net/ |
H A D | HttpURLConnection.java | 630 int last = mark + 3; 631 if (last > response.length()) { 632 last = response.length(); 634 responseCode = Integer.parseInt(response.substring(mark, last)); 635 if (last + 1 <= response.length()) { 636 responseMessage = response.substring(last + 1);
|
/libcore/luni/src/main/java/java/util/jar/ |
H A D | ManifestReader.java | 108 // if the last line break is missed, the line 144 int last = pos; 164 valueBuffer.write(buf, mark, last - mark); 175 last = pos; 178 valueBuffer.write(buf, mark, last - mark);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/ |
H A D | AttributedCharacterIteratorTest.java | 38 assertEquals("Wrong last", 'g', it.current()); 94 assertEquals("Wrong last", 10, it.getIndex()); 100 * @tests java.text.AttributedCharacterIterator#last() 106 assertEquals("Wrong last1", 'g', it.last()); 108 assertEquals("Wrong last2", 's', it.last()); 110 assertEquals("Wrong last3", 'r', it.last()); 112 assertTrue("Wrong last4", it.last() == CharacterIterator.DONE); 125 assertEquals("Wrong last", 'g', it.next());
|
H A D | StringCharacterIteratorTest.java | 249 * @tests java.text.StringCharacterIterator.last() 253 assertEquals('e', fixture.last()); 255 assertEquals('e', fixture.last()); 257 assertEquals('e', fixture.last()); 260 assertEquals('e', fixture.last()); 262 assertEquals('t', fixture.last()); 384 assertEquals('x', fixture.last()); 451 it1.last(); 486 * @tests java.text.StringCharacterIterator#last() 491 assertEquals("Wrong last cha [all...] |
H A D | BreakIteratorTest.java | 119 assertEquals(0, iterator.last()); 121 assertEquals(TEXT.length(), iterator.last()); 161 iterator.last();
|
/libcore/luni/src/main/java/java/lang/ |
H A D | StringToReal.java | 271 char last = s.charAt(length - 1); 272 if (last == 'y' || last == 'N') { 312 char last = s.charAt(length - 1); 313 if (last == 'y' || last == 'N') {
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | LinkedBlockingDeque.java | 65 * or "last" (for prev links). 107 * Invariant: (first == null && last == null) || 113 * Pointer to last node. 114 * Invariant: (first == null && last == null) || 115 * (last.next == null && last.item != null) 117 transient Node<E> last; field in class:LinkedBlockingDeque 192 if (last == null) 193 last = node; 202 * Links node as last elemen [all...] |
H A D | ConcurrentLinkedDeque.java | 96 * "last" node terminating any chain of next references starting at 97 * a live node. The "first" and "last" nodes may or may not be live. 98 * The "first" and "last" nodes are always mutually reachable. 101 * next reference in the first or last node to a fresh node 106 * first or last node. Active nodes cannot be unlinked. 120 * The head and tail are only approximations to the first and last 143 * prev links from the last node. However, this is not true for 192 * dummy node, NEXT_TERMINATOR, and not the last active node. 196 * find the last (active) node, for enqueueing a new node, we need 232 * - head may not be reachable from the first or last nod 537 unlinkLast(Node<E> last, Node<E> prev) argument 742 Node<E> last() { method in class:ConcurrentLinkedDeque [all...] |
H A D | LinkedBlockingQueue.java | 97 * - null, meaning there is no successor (this is the last node) 118 * Invariant: last.next == null 120 private transient Node<E> last; field in class:LinkedBlockingQueue 168 // assert last.next == null; 169 last = last.next = node; 231 last = head = new Node<E>(null); 497 if (last == p) 498 last = trail; 668 head = last; [all...] |
H A D | ConcurrentLinkedQueue.java | 91 * - There is exactly one (last) Node with a null next reference, 92 * which is CASed when enqueueing. This last Node can be 122 * to be two or more steps away from the first/last node. 207 * A node from which the last node on list (that is, the unique 210 * - the last node is always reachable from tail via succ() 301 // p is last node 491 Node<E> beginningOfTheEnd = null, last = null; 496 beginningOfTheEnd = last = newNode; 498 last.lazySetNext(newNode); 499 last [all...] |
/libcore/luni/src/main/java/java/io/ |
H A D | SerializationHandleMap.java | 77 int last = (index + length - 1) % length; 78 while (index != last) {
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | ConcurrentSkipListMapTest.java | 131 * lastKey returns last key 185 Integer last = (Integer)i.next(); 186 assertEquals(last, one); 190 assertTrue(last.compareTo(k) < 0); 191 last = k; 204 Integer last = (Integer)i.next(); 205 assertEquals(last, five); 209 assertTrue(last.compareTo(k) > 0); 210 last = k; 223 Integer last [all...] |
H A D | TreeMapTest.java | 130 * lastKey returns last key 184 Integer last = (Integer)i.next(); 185 assertEquals(last, one); 189 assertTrue(last.compareTo(k) < 0); 190 last = k; 203 Integer last = (Integer)i.next(); 204 assertEquals(last, five); 208 assertTrue(last.compareTo(k) > 0); 209 last = k; 222 Integer last [all...] |
/libcore/luni/src/test/java/libcore/java/sql/ |
H A D | OldResultSetTest.java | 208 target.absolute(-1); // last 286 target.last(); 291 target.last(); 307 //after last 329 target.last(); 468 assertTrue(target.last());
|