/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 | 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 | 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 | 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
|
H A D | AttributedString.java | 95 Map last = null; 108 if (mapsDiffer(last, attrs)) { 111 last = attrs; 195 * @param endIndex Index of the character following the last character 220 * @param endIndex Index of the character following the last character 335 * @param endIndex Index of the character following the last character of the range. 359 * @param endIndex Index of the character following the last 576 * @param endIndex the index of the character following the last character 718 * Returns true if the attributes specified in last and attrs differ. 720 private static boolean mapsDiffer(Map last, Ma argument 807 public char last() { method in class:AttributedString.AttributedStringIterator [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 | TreeSet.java | 400 public E last() { method in class:TreeSet
|
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 | TreeMap.java | 1165 public E last() { return m.lastKey(); } method in class:TreeMap.KeySet 1785 DescendingSubMapEntryIterator(TreeMapEntry<K,V> last, argument 1787 super(last, fence); 1839 DescendingSubMapKeyIterator(TreeMapEntry<K,V> last, argument 1841 super(last, fence); 2180 * Returns the last Entry in the TreeMap (according to the TreeMap's 2567 * @param hi the last element index of this subtree. Initial should be 2640 * last `full' level of the complete binary tree produced by 2720 TreeMapEntry<K,V> fence; // one past last, or null
|
H A D | Collections.java | 477 * <p>This implementation traverses the list backwards, from the last 508 * This implementation traverses the list backwards, from the last element 1004 * Returns the starting position of the last occurrence of the specified 1015 * @param source the list in which to search for the last occurrence 1018 * @return the starting position of the last occurrence of the specified 1253 public E last() {return ss.last();} method in class:Collections.UnmodifiableSortedSet 2075 public E last() { method in class:Collections.SynchronizedSortedSet 2076 synchronized (mutex) {return ss.last();} 2805 public E last() { retur method in class:Collections.CheckedSortedSet [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/ |
H A D | AttributedStringTest.java | 111 public char last() { method in class:AttributedStringTest.testAttributedCharacterIterator
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | RefSortedMap.java | 96 SubMap(boolean hasFirst, K first, boolean hasLast, K last) { argument 100 this.end = last;
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentSkipListSet.java | 375 public E last() { method in class:ConcurrentSkipListSet
|
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...] |
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 | ConcurrentSkipListMap.java | 160 * must return the last non-null value held in the field. (Note: 1060 * Removes last entry; returns its snapshot. 1062 * @return null if empty, else snapshot of last entry 1106 /* ---------------- Finding and removing last element -------------- */ 1109 * Specialized version of find to get last valid node. 1110 * @return last node or null if empty 1153 * Specialized variant of findPredecessor to get predecessor of last 1154 * valid node. Needed when removing the last entry. It is possible 1157 * @return likely predecessor of last node 2239 /** the last nod 2345 public K last() { return m.lastKey(); } method in class:ConcurrentSkipListMap.KeySet [all...] |
/libcore/luni/src/test/java/libcore/java/text/ |
H A D | OldAttributedStringTest.java | 274 public char last() { method in class:OldAttributedStringTest.testAttributedCharacterIterator
|
/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/ojluni/src/main/java/sun/net/www/ |
H A D | ParseUtil.java | 544 // between first and last, inclusive 545 private static long lowMask(char first, char last) { argument 548 int l = Math.max(Math.min(last, 63), 0); 567 // between first and last, inclusive 568 private static long highMask(char first, char last) { argument 571 int l = Math.max(Math.min(last, 127), 64) - 64;
|
/libcore/ojluni/src/main/java/java/sql/ |
H A D | ResultSet.java | 49 * last row. It is possible to 159 * the cursor is positioned after the last row. Any 212 * the last column read had a value of SQL <code>NULL</code>. 218 * @return <code>true</code> if the last column value read was SQL 1046 * Retrieves whether the cursor is after the last row in 1053 * @return <code>true</code> if the cursor is after the last row; 1083 * Retrieves whether the cursor is on the last row of 1088 * whether the current row is the last row in the result set. 1093 * @return <code>true</code> if the cursor is on the last row; 1120 * last ro 1158 boolean last() throws SQLException; method in interface:ResultSet [all...] |
/libcore/ojluni/src/main/native/ |
H A D | zip_util.c | 1143 jzentry *last; local 1145 last = jz->cache; 1148 if (last != NULL) { 1150 free(last->name); 1151 if (last->extra) free(last->extra); 1152 if (last->comment) free(last->comment); 1153 free(last);
|
/libcore/ojluni/src/main/java/java/net/ |
H A D | URI.java | 998 * the last segment of this URI's path, if any, with the given URI's 1244 * occur as the first or last characters in a label. The rightmost 2176 int end = path.length() - 1; // Index of last char in path 2231 int end = path.length - 1; // Index of last char in path 2281 int end = path.length - 1; // Index of last char in path 2495 // between first and last, inclusive 2496 private static long lowMask(char first, char last) { argument 2499 int l = Math.max(Math.min(last, 63), 0); 2506 // between first and last, inclusive 2507 private static long highMask(char first, char last) { argument [all...] |