Searched defs:last (Results 1 - 23 of 23) sorted by relevance

/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 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;
346 * Returns the position of last boundar
421 public abstract int last(); method in class:BreakIterator
[all...]
H A DRuleBasedBreakIterator.java62 @Override public int last() { method in class:RuleBasedBreakIterator
63 return wrapped.last();
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
H A DAttributedString.java139 * @return the index one past the last character to iterate.
345 public char last() { method in class:AttributedString.AttributedIterator
477 * {@code iterator}, {@code end} is greater than the last
504 * {@code iterator}, {@code end} is greater than the last index +
H A DMessageFormat.java299 * When a single argument is parsed more than once in the string, the last match
314 * containing multiple occurrences of the same argument would return the last
740 * of the last one.
927 private int match(String string, ParsePosition position, boolean last, argument
949 && ((ch = string.charAt(offset)) == '}' || (!last && ch == ','))) {
1259 int last = 0;
1261 strings[i] = pattern.substring(last, offsets[i]);
1262 last = offsets[i];
1265 strings[strings.length - 1] = pattern.substring(last, pattern
/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 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 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 DTreeSet.java268 * Returns the last element in this set.
271 public E last() { method in class:TreeSet
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...]
H A DCollections.java892 @Override public E last() { method in class:Collections.SynchronizedSortedSet
894 return ss.last();
1380 @Override public E last() { method in class:Collections.UnmodifiableSortedSet
1381 return ss.last();
2079 * index of the last occurrence.
2087 * @return the beginning index of the last occurrence of {@code sublist} in
2102 // find the last element of sublist in the list to get a head start
2648 * Returns a last-in, first-out queue as a view of {@code deque}.
3353 @Override public E last() { method in class:Collections.CheckedSortedSet
3354 return ss.last();
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/
H A DAttributedStringTest.java111 public char last() { method in class:AttributedStringTest.testAttributedCharacterIterator
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DRefSortedMap.java96 SubMap(boolean hasFirst, K first, boolean hasLast, K last) { argument
100 this.end = last;
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentSkipListSet.java363 public E last() { method in class:ConcurrentSkipListSet
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 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.java96 * "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 DConcurrentSkipListMap.java140 * must return the last non-null value held in the field. (Note:
1159 /* ---------------- Finding and removing last element -------------- */
1162 * Specialized version of find to get last valid node.
1163 * @return last node or null if empty
1208 * Specialized variant of findPredecessor to get predecessor of last
1209 * valid node. Needed when removing the last entry. It is possible
1212 * @return likely predecessor of last node
1239 * Removes last entry; returns its snapshot.
1241 * @return null if empty, else snapshot of last entry
2167 /** the last nod
2291 public E last() { return m.lastKey(); } method in class:ConcurrentSkipListMap.KeySet
[all...]
/libcore/luni/src/main/java/libcore/icu/
H A DNativeBreakIterator.java98 public int last() { method in class:NativeBreakIterator
/libcore/luni/src/test/java/libcore/java/text/
H A DOldAttributedStringTest.java274 public char last() { method in class:OldAttributedStringTest.testAttributedCharacterIterator
/libcore/luni/src/main/java/java/sql/
H A DResultSet.java112 * in the forward direction, first to last.
118 * in the reverse direction, last to first.
151 * returns the last row.
160 * Moves the cursor to the end of the {@code ResultSet}, after the last row.
1135 * Gets if the cursor is after the last row of the {@code ResultSet}.
1137 * @return {@code true} if the cursor is after the last row in the {@code
1168 * Gets if the cursor is on the last row of the {@code ResultSet}
1170 * @return {@code true} if the cursor is on the last row in the {@code
1179 * Shifts the cursor position to the last row of the {@code ResultSet}.
1186 public boolean last() throw method in interface:ResultSet
[all...]
/libcore/benchmarks/libs/
H A Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/AllocationMeasurer ...

Completed in 249 milliseconds