/libcore/ojluni/src/main/java/java/text/ |
H A D | CharacterIterator.java | 54 * by calling setIndex(), first(), and last(). 76 * for(char c = iter.last(); c != CharacterIterator.DONE; c = iter.previous()) { 126 * @return the last character in the text, or DONE if the text is empty 129 public char last(); method in interface:CharacterIterator 177 * @return the index after the last character in the text
|
H A D | IcuIteratorWrapper.java | 105 * when there is overlap between the last group of characters in the expression preceding the 110 * "x[xy]*x" will match through to the last x (i.e., "<strong>xxyxyyyxyxyxxyxyx</strong>yy", 281 public int last() { method in class:IcuIteratorWrapper 282 return wrapped.last(); 309 * Advances the iterator backwards, to the last boundary preceding this one. 311 * @return The position of the last boundary position preceding this one. 340 * Sets the iterator to refer to the last boundary position before the 343 * @return The position of the last boundary before the starting position.
|
H A D | MessageFormat.java | 304 * When a single argument is parsed more than once in the string, the last match 318 * multiple occurrences of the same argument would return the last match. For 711 * in the pattern string, then the format used for the last such 1050 * to the index after the last character used (parsing does not necessarily 1235 int last = result.length(); 1286 if (last != result.length()) { 1289 (last))); 1290 last = result.length(); 1297 if (last != result.length()) { 1302 last [all...] |
H A D | MergeCollation.java | 101 PatternEntry last = findLastWithNoExtension(i-1); 104 tmp.addToBuffer(result, false, withWhiteSpace, last); 112 PatternEntry last = findLastWithNoExtension(i-1); 115 tmp.addToBuffer(result, false, withWhiteSpace, last); 310 // most likely entry is last one 323 throw new ParseException("couldn't find last entry: "
|
H A D | BreakIterator.java | 146 * int end = boundary.last(); 167 * Print last element: 171 * int end = boundary.last(); 195 * int last = wb.following(pos); 198 * for (int p = last; p < current; p++) { 200 * return last; 202 * last = current; 249 * and following(int) when either the first or last text boundary has been 263 * Returns the last boundary. The iterator's current position is set 264 * to the last tex 268 public abstract int last(); method in class:BreakIterator [all...] |
H A D | StringCharacterIterator.java | 85 * @param end Index of the character following the last character 133 * Implements CharacterIterator.last() for String. 134 * @see CharacterIterator#last 136 public char last() method in class:StringCharacterIterator
|
/libcore/ojluni/src/main/java/java/lang/ref/ |
H A D | ReferenceQueue.java | 264 // Find the last element in unenqueued. 265 Reference<?> last = unenqueued; 266 while (last.pendingNext != unenqueued) { 267 last = last.pendingNext; 270 last.pendingNext = list; 271 last = list; 272 while (last.pendingNext != list) { 273 last = last [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | SortedSet.java | 216 * Returns the last (highest) element currently in this set. 218 * @return the last (highest) element currently in this set 221 E last(); method in interface:SortedSet
|
H A D | LinkedList.java | 91 * Invariant: (first == null && last == null) || 97 * Pointer to last node. 98 * Invariant: (first == null && last == null) || 99 * (last.next == null && last.item != null) 101 transient Node<E> last; field in class:LinkedList 130 last = newNode; 138 * Links e as last element. 141 final Node<E> l = last; 143 last [all...] |
H A D | DualPivotQuicksort.java | 102 * @param right the index of the last element, inclusive, to be sorted 152 if (run[count] == right++) { // The last run contains one element 183 for (int last; count > 1; count = last) { 184 for (int k = (last = 0) + 2; k <= count; k += 2) { 193 run[++last] = hi; 199 run[++last] = right; 211 * @param right the index of the last element, inclusive, to be sorted 269 int last = a[right]; 271 while (last < [all...] |
H A D | Properties.java | 655 int last = 0; 662 if (last != current) 663 bw.write(comments.substring(last, current)); 682 last = current + 1; 686 if (last != current) 687 bw.write(comments.substring(last, current));
|
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | Streams.java | 64 // All elements are traversed if from == upTo & last == 0 67 // 1 if the range is closed and the last element has not been traversed 70 private int last; field in class:Streams.RangeIntSpliterator 76 private RangeIntSpliterator(int from, int upTo, int last) { argument 79 this.last = last; 92 else if (last > 0) { 93 last = 0; 106 int hLast = last; 108 last 194 private int last; field in class:Streams.RangeLongSpliterator 200 RangeLongSpliterator(long from, long upTo, int last) argument [all...] |
/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/util/concurrent/ |
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 533 unlinkLast(Node<E> last, Node<E> prev) argument 738 Node<E> last() { method in class:ConcurrentLinkedDeque [all...] |
H A D | LinkedBlockingDeque.java | 68 * or "last" (for prev links). 110 * Invariant: (first == null && last == null) || 116 * Pointer to last node. 117 * Invariant: (first == null && last == null) || 118 * (last.next == null && last.item != null) 120 transient Node<E> last; field in class:LinkedBlockingDeque 195 if (last == null) 196 last = node; 205 * Links node as last elemen [all...] |
H A D | LinkedBlockingQueue.java | 100 * - null, meaning there is no successor (this is the last node) 121 * Invariant: last.next == null 123 private transient Node<E> last; field in class:LinkedBlockingQueue 171 // assert last.next == null; 172 last = last.next = node; 234 last = head = new Node<E>(null); 496 if (last == p) 497 last = trail; 649 head = last; [all...] |
/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/ojluni/src/test/java/util/stream/bootlib/java/util/stream/ |
H A D | LambdaTestHelpers.java | 219 T last = i.next(); 222 assertTrue(last.compareTo(t) <= 0); 223 assertTrue(t.compareTo(last) >= 0); 224 last = t; 237 T last = i.next(); 240 assertTrue(comp.compare(last, t) <= 0); 241 assertTrue(comp.compare(t, last) >= 0); 242 last = t;
|
/libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/ |
H A D | LambdaTestHelpers.java | 220 T last = i.next(); 223 assertTrue(last.compareTo(t) <= 0); 224 assertTrue(t.compareTo(last) >= 0); 225 last = t; 238 T last = i.next(); 241 assertTrue(comp.compare(last, t) <= 0); 242 assertTrue(comp.compare(t, last) >= 0); 243 last = t;
|
/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());
|
/libcore/ojluni/src/main/java/sun/security/validator/ |
H A D | PKIXValidator.java | 166 * Returns the length of the last certification path that is validated by 172 * @return the length of the last certification path passed to 255 X509Certificate last = chain[chain.length - 1]; 256 X500Principal issuer = last.getIssuerX500Principal(); 257 X500Principal subject = last.getSubjectX500Principal(); 259 isSignatureValid(trustedSubjects.get(issuer), last)) { 273 // temporarily set last cert as sole trust anchor
|
/libcore/libart/src/main/java/java/lang/ |
H A D | StringFactory.java | 82 int last = offset + byteCount; 85 while (idx < last) { 107 if (idx + utfCount > last) {
|