Searched refs:last (Results 1 - 25 of 47) sorted by relevance

12

/libcore/luni/src/main/java/java/text/
H A DCharacterIterator.java68 * @return the index one past the last character of the iteration.
85 public char last(); method in interface:CharacterIterator
H A DRuleBasedBreakIterator.java62 @Override public int last() { method in class:RuleBasedBreakIterator
63 return wrapped.last();
H A DSimpleDateFormat.java265 int next, last = -1, count = 0;
272 validatePatternCharacter((char) last);
275 if (last == next) {
276 last = -1;
278 last = next;
284 && (last == next || (next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z'))) {
285 if (last == next) {
289 validatePatternCharacter((char) last);
291 last = next;
296 validatePatternCharacter((char) last);
[all...]
H A DBreakIterator.java58 * {@code first()}, {@code last()}, {@code next()}, and {@code previous()} that
75 * after the last character is 1 plus the length of the string.</li>
138 * int end = boundary.last();
161 * Print the last element:
166 * int end = boundary.last();
194 * int last = wb.following(pos);
197 * for (int p = last; p &lt; current; p++) {
199 * return last;
201 * last = current;
365 * Returns the position of last boundar
440 public abstract int last(); method in class:BreakIterator
[all...]
H A DStringCharacterIterator.java76 * the index one past the last character to iterate.
173 * @return the index one past the last character of the iteration.
200 public char last() { method in class:StringCharacterIterator
/libcore/luni/src/main/java/java/util/
H A DSortedSet.java69 * 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 DMiniEnumSet.java61 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 DHugeEnumSet.java69 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 DBitSet.java250 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 DLinkedList.java542 * 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 DWeakHashMap.java556 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;
H A DTreeMap.java388 Node<K, V> adjacent = (left.height > right.height) ? left.last() : right.first();
612 return immutableCopy(root == null ? null : root.last());
619 Node<K, V> result = root.last();
632 return root.last().getKey();
794 * last node in the tree.
819 return left.last();
848 * Returns the last node in this subtree.
850 public Node<K, V> last() { method in class:TreeMap.Node
867 protected Node<K, V> last; field in class:TreeMap.MapIterator
885 last
996 public K last() { method in class:TreeMap.KeySet
1581 public K last() { method in class:TreeMap.BoundedMap.BoundedKeySet
[all...]
/libcore/luni/src/main/java/java/net/
H A DHttpURLConnection.java622 int last = mark + 3;
623 if (last > response.length()) {
624 last = response.length();
626 responseCode = Integer.parseInt(response.substring(mark, last));
627 if (last + 1 <= response.length()) {
628 responseMessage = response.substring(last + 1);
/libcore/luni/src/main/java/java/util/jar/
H A DManifestReader.java108 // 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/support/src/test/java/tests/support/
H A DSupport_Configuration.java202 int last = 0;
205 int dot = InetTestIP.indexOf('.', last);
207 last, dot));
208 last = dot + 1;
210 addr[3] = (byte) Integer.parseInt(InetTestIP.substring(last));
223 int last = 0;
226 int dot = nonLocalAddressBytesString.indexOf('.', last);
229 last, dot));
230 last = dot + 1;
233 .substring(last));
[all...]
/libcore/luni/src/main/java/java/lang/
H A DStringToReal.java252 char last = s.charAt(length - 1);
253 if (last == 'y' || last == 'N') {
293 char last = s.charAt(length - 1);
294 if (last == 'y' || last == 'N') {
/libcore/luni/src/main/java/java/util/concurrent/
H A DLinkedBlockingDeque.java65 * 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 DConcurrentLinkedDeque.java98 * "last" node terminating any chain of next references starting at
99 * a live node. The "first" and "last" nodes may or may not be live.
100 * The "first" and "last" nodes are always mutually reachable.
103 * next reference in the first or last node to a fresh node
108 * first or last node. Active nodes cannot be unlinked.
122 * The head and tail are only approximations to the first and last
145 * prev links from the last node. However, this is not true for
194 * dummy node, NEXT_TERMINATOR, and not the last active node.
198 * find the last (active) node, for enqueueing a new node, we need
234 * - head may not be reachable from the first or last nod
539 unlinkLast(Node<E> last, Node<E> prev) argument
744 Node<E> last() { method in class:ConcurrentLinkedDeque
[all...]
H A DLinkedBlockingQueue.java97 * - 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 DConcurrentLinkedQueue.java91 * - 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/libdvm/src/main/java/java/lang/reflect/
H A DProxy.java120 int last = name.lastIndexOf('.');
121 String p = last == -1 ? "" : name.substring(0, last);
/libcore/luni/src/main/java/java/io/
H A DSerializationHandleMap.java77 int last = (index + length - 1) % length;
78 while (index != last) {
/libcore/luni/src/test/java/libcore/java/sql/
H A DOldResultSetTest.java208 target.absolute(-1); // last
286 target.last();
291 target.last();
307 //after last
329 target.last();
468 assertTrue(target.last());
/libcore/crypto/src/main/java/org/conscrypt/
H A DTrustManagerImpl.java238 X509Certificate last = wholeChain.get(wholeChain.size() - 1);
240 TrustAnchor cachedTrust = trustedCertificateIndex.findByIssuerAndSignature(last);
248 // the server. Extract the cert, compare it to the last element in the chain, and add it
251 if (next != last) {
253 last = next;
255 // if next == last then we found a self-signed cert and the chain is done
498 // we have a KeyStore and the issuer of the last cert in
/libcore/libart/src/main/java/java/lang/
H A DString.java246 int last = offset + byteCount;
249 while (idx < last) {
271 if (idx + utfCount > last) {
768 // Note: last character not copied!
857 // Note: last character not copied!
872 // NOTE last character not copied!
1055 * Returns the last index of the code point {@code c}, or -1.
1075 * Returns the last index of the code point {@code c}, or -1.
1109 * Searches in this string for the last index of the specified string. The
1282 int last
[all...]

Completed in 696 milliseconds

12