/dalvik/dx/src/com/android/dx/util/ |
H A D | IntIterator.java | 25 * Checks to see if the iterator has a next value. 27 * @return true if next() will succeed 32 * Returns the next value in the iterator. 34 * @return next value 35 * @throws java.util.NoSuchElementException if no next element exists 37 int next(); method in interface:IntIterator
|
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | Iterator.java | 26 * If a collection has been changed since its creation, methods {@code next} and 38 * @see #next 44 * Returns the next object in the iteration, i.e. returns the element in 47 * @return the next object. 53 public E next(); method in interface:Iterator 56 * Removes the last object returned by {@code next} from the collection. 57 * This method can only be called once after {@code next} was called. 63 * if {@code next} has not been called, or {@code remove} has 64 * already been called after the last call to {@code next}.
|
H A D | Random.java | 102 protected synchronized int next(int bits) { method in class:Random 108 * Returns the next pseudo-random, uniformly distributed {@code boolean} value 115 return next(1) != 0; 124 * @see #next 150 return ((((long) next(26) << 27) + next(27)) / (double) (1L << 53)); 162 return (next(24) / 16777216f); 206 * @see #next 211 return next(32); 226 return (int) ((n * (long) next(3 [all...] |
H A D | AbstractSet.java | 84 Object next = it.next(); 85 result += next == null ? 0 : next.hashCode(); 108 if (collection.contains(it.next())) { 116 result = remove(it.next()) || result;
|
H A D | AbstractCollection.java | 84 if (add(it.next())) { 111 it.next(); 140 if (object.equals(it.next())) { 146 if (it.next() == null) { 178 if (!contains(it.next())) { 242 if (object.equals(it.next())) { 249 if (it.next() == null) { 292 if (collection.contains(it.next())) { 334 if (!collection.contains(it.next())) { 360 array[index++] = it.next(); [all...] |
H A D | LinkedList.java | 46 Link<ET> previous, next; field in class:LinkedList.Link 51 next = n; 72 link = link.next; 86 Link<ET> next = link.next; 87 Link<ET> newLink = new Link<ET>(object, link, next); 88 link.next = newLink; 89 next.previous = newLink; 102 return link.next != list.voidLink; 109 public ET next() { method in class:LinkedList.LinkIterator [all...] |
H A D | AbstractSequentialList.java | 49 // int next = it.nextIndex(); 51 // it.add(colIt.next()); 54 // return next != it.nextIndex(); 58 // BUG: previous/next inconsistant. We care for list 62 it.add(colIt.next()); 71 return listIterator(location).next(); 89 E result = it.next(); 100 E result = it.next();
|
H A D | ListIterator.java | 30 * Inserts the specified object into the list between {@code next} and 49 * @see #next 65 * Returns the next object in the iteration. 67 * @return the next object. 73 public E next(); method in interface:ListIterator 76 * Returns the index of the next object in the iteration. 78 * @return the index of the next object, or the size of the list if the 82 * @see #next 111 * Removes the last object returned by {@code next} or {@code previous} from 117 * if {@code next} o [all...] |
H A D | Date.java | 413 char next = offset < length ? string.charAt(offset) : '\r'; 416 if (next == '(') { 420 if (next == ')') { 424 next = ' '; 431 if ('a' <= next && next <= 'z' || 'A' <= next && next <= 'Z') { 433 } else if ('0' <= next && next < [all...] |
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/atomic/ |
H A D | AtomicInteger.java | 122 int next = current + 1; 123 if (compareAndSet(current, next)) 136 int next = current - 1; 137 if (compareAndSet(current, next)) 151 int next = current + delta; 152 if (compareAndSet(current, next)) 164 int next = current + 1; 165 if (compareAndSet(current, next)) 166 return next; 177 int next [all...] |
H A D | AtomicLong.java | 133 long next = current + 1; 134 if (compareAndSet(current, next)) 147 long next = current - 1; 148 if (compareAndSet(current, next)) 162 long next = current + delta; 163 if (compareAndSet(current, next)) 175 long next = current + 1; 176 if (compareAndSet(current, next)) 177 return next; 188 long next [all...] |
H A D | AtomicIntegerArray.java | 152 int next = current + 1; 153 if (compareAndSet(i, current, next)) 167 int next = current - 1; 168 if (compareAndSet(i, current, next)) 183 int next = current + delta; 184 if (compareAndSet(i, current, next)) 198 int next = current + 1; 199 if (compareAndSet(i, current, next)) 200 return next; 213 int next [all...] |
H A D | AtomicLongArray.java | 148 long next = current + 1; 149 if (compareAndSet(i, current, next)) 163 long next = current - 1; 164 if (compareAndSet(i, current, next)) 179 long next = current + delta; 180 if (compareAndSet(i, current, next)) 195 long next = current + 1; 196 if (compareAndSet(i, current, next)) 197 return next; 210 long next [all...] |
H A D | AtomicIntegerFieldUpdater.java | 124 int next = current + 1; 125 if (compareAndSet(obj, current, next)) 139 int next = current - 1; 140 if (compareAndSet(obj, current, next)) 155 int next = current + delta; 156 if (compareAndSet(obj, current, next)) 169 int next = current + 1; 170 if (compareAndSet(obj, current, next)) 171 return next; 184 int next [all...] |
/dalvik/libcore/json/src/main/java/org/json/ |
H A D | JSONTokener.java | 37 * The index of the next character. 62 * the next number or identifier. 93 * Determine if the source string still contains characters that next() 103 * Get the next character in the source string. 105 * @return The next character, or 0 if past the end of the source string. 107 public char next() { method in class:JSONTokener 118 * Consume the next character, and check that it matches a specified 124 public char next(char c) throws JSONException { method in class:JSONTokener 125 char n = next(); 135 * Get the next 143 public String next(int n) throws JSONException { method in class:JSONTokener [all...] |
/dalvik/libcore/sql/src/main/java/java/sql/ |
H A D | SQLException.java | 38 * <li>A chain to a next {@code Exception}, if relevant, which can give access 55 private SQLException next = null; field in class:SQLException 133 return next; 162 if (next != null) { 163 next.setNextException(ex); 165 next = ex;
|
H A D | SQLWarning.java | 90 * Gets the next {@code SQLWarning} chained to this {@code SQLWarning} object. 98 SQLException next = super.getNextException(); 99 if (next == null) { 102 if (next instanceof SQLWarning) { 103 return (SQLWarning) next;
|
/dalvik/libcore/text/src/main/java/java/text/ |
H A D | CharacterIterator.java | 101 * @return the character at the next index, or {@code DONE} if the next 105 public char next(); method in interface:CharacterIterator
|
H A D | RuleBasedBreakIterator.java | 102 * @see java.text.BreakIterator#next() 105 public int next() { method in class:RuleBasedBreakIterator 106 return wrapped.next(); 112 * @see java.text.BreakIterator#next(int) 115 public int next(int n) { method in class:RuleBasedBreakIterator 116 return wrapped.next(n);
|
/dalvik/libcore/archive/src/main/java/java/util/jar/ |
H A D | InitManifest.java | 70 addAttribute(it.next(), current); 83 String line = it.next(); 96 addAttribute(it.next(), current); 143 byte next; 164 next = inbuf[inbufPos++]; 166 if (next != '\n') { 168 next = '\r'; 176 } else if (next == '\r') { 181 if (next == ' ') { 182 out.write(next); [all...] |
/dalvik/vm/mterp/armv5te/ |
H A D | OP_INVOKE_DIRECT_EMPTY.S | 5 FETCH_ADVANCE_INST(3) @ advance to next instr, load rINST
|
H A D | OP_NOP.S | 2 FETCH_ADVANCE_INST(1) @ advance to next instr, load rINST
|
/dalvik/vm/alloc/ |
H A D | HeapTable.c | 83 table = table->next; 89 prevTable->next = table->next; 90 table->next = *tableP; 118 table->next = *tableP; 148 table->next = *tableP; 159 LargeHeapRefTable *next = table->next; local 162 table = next; 191 *pTable = table->next; [all...] |
/dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
H A D | CollationElementIteratorTest.java | 62 iterator.next(); 70 method = "next", 78 int order = iterator.next(); 82 order = iterator.next(); 112 int order = iterator.next(); 116 order = iterator.next(); 141 int order = iterator.next(); 145 order = iterator.next(); 166 int order = iterator.next(); 169 order = iterator.next(); [all...] |
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
H A D | LinkedBlockingQueue.java | 67 Node<E> next; field in class:LinkedBlockingQueue.Node 127 last = last.next = new Node<E>(x); 135 Node<E> first = head.next; 192 add(it.next()); 440 Node<E> first = head.next; 456 Node<E> p = head.next; 463 p = p.next; 467 trail.next = p.next; 483 for (Node<E> p = head.next; 624 public E next() { method in class:LinkedBlockingQueue.Itr [all...] |