/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 | 24 * methods {@code next} and {@code hasNext()} may throw a {@code ConcurrentModificationException}. 38 * @see #next 43 * Returns the next object and advances the iterator. 45 * @return the next object. 50 public E next(); method in interface:Iterator 53 * Removes the last object returned by {@code next} from the collection. 54 * This method can only be called once between each call to {@code next}. 60 * if {@code next} has not been called, or {@code remove} has 61 * already been called after the last call to {@code next}.
|
H A D | Random.java | 99 protected synchronized int next(int bits) { method in class:Random 105 * Returns the next pseudo-random, uniformly distributed {@code boolean} value 111 return next(1) != 0; 120 * @see #next 144 return ((((long) next(26) << 27) + next(27)) / (double) (1L << 53)); 155 return (next(24) / 16777216f); 198 * @see #next 202 return next(32); 216 return (int) ((n * (long) next(3 [all...] |
H A D | AbstractSet.java | 80 Object next = it.next(); 81 result += next == null ? 0 : next.hashCode(); 103 if (collection.contains(it.next())) { 111 result = remove(it.next()) || result;
|
H A D | AbstractCollection.java | 77 if (add(it.next())) { 103 it.next(); 131 if (object.equals(it.next())) { 137 if (it.next() == null) { 168 if (!contains(it.next())) { 229 if (object.equals(it.next())) { 236 if (it.next() == null) { 278 if (collection.contains(it.next())) { 319 if (!collection.contains(it.next())) { 344 array[index++] = it.next(); [all...] |
H A D | LinkedList.java | 51 Link<ET> previous, next; field in class:LinkedList.Link 56 next = n; 77 link = link.next; 91 Link<ET> next = link.next; 92 Link<ET> newLink = new Link<ET>(object, link, next); 93 link.next = newLink; 94 next.previous = newLink; 107 return link.next != list.voidLink; 114 public ET next() { method in class:LinkedList.LinkIterator [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ |
H A D | DTMAxisTraverser.java | 38 * nodeHandle=myTraverser.next(myContext,nodeHandle)) 61 return next(context, context); 80 return next(context, context, extendedTypeID); 84 * Traverse to the next node after the current node. 94 * @return the next node in the iteration, or DTM.NULL. 97 public abstract int next(int context, int current); method in class:DTMAxisTraverser 100 * Traverse to the next node after the current node that is matched 112 * @return the next node in the iteration, or DTM.NULL. 115 public abstract int next(int context, int current, int extendedTypeID); method in class:DTMAxisTraverser
|
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/atomic/ |
H A D | AtomicInteger.java | 125 int next = current + 1; 126 if (compareAndSet(current, next)) 139 int next = current - 1; 140 if (compareAndSet(current, next)) 154 int next = current + delta; 155 if (compareAndSet(current, next)) 168 int next = current + 1; 169 if (compareAndSet(current, next)) 170 return next; 182 int next [all...] |
H A D | AtomicLong.java | 150 long next = current + 1; 151 if (compareAndSet(current, next)) 164 long next = current - 1; 165 if (compareAndSet(current, next)) 179 long next = current + delta; 180 if (compareAndSet(current, next)) 193 long next = current + 1; 194 if (compareAndSet(current, next)) 195 return next; 207 long next [all...] |
H A D | AtomicIntegerArray.java | 158 int next = current + 1; 159 if (compareAndSet(i, current, next)) 173 int next = current - 1; 174 if (compareAndSet(i, current, next)) 189 int next = current + delta; 190 if (compareAndSet(i, current, next)) 204 int next = current + 1; 205 if (compareAndSet(i, current, next)) 206 return next; 219 int next [all...] |
H A D | AtomicLongArray.java | 157 long next = current + 1; 158 if (compareAndSet(i, current, next)) 172 long next = current - 1; 173 if (compareAndSet(i, current, next)) 188 long next = current + delta; 189 if (compareAndSet(i, current, next)) 203 long next = current + 1; 204 if (compareAndSet(i, current, next)) 205 return next; 218 long next [all...] |
/dalvik/vm/compiler/ |
H A D | IntermediateRep.c | 34 mir->prev = mir->next = NULL; 36 bb->lastMIRInsn->next = mir; 38 mir->next = NULL; 49 mir->prev = mir->next = NULL; 52 mir->next = bb->firstMIRInsn; 67 lir->prev = lir->next = NULL; 69 cUnit->lastLIRInsn->next = lir; 71 lir->next = NULL; 87 prevLIR->next = newLIR; 89 newLIR->next [all...] |
/dalvik/vm/mterp/x86-atom/ |
H A D | OP_CONST_16.S | 32 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance 34 FGETOP_JMP 2, %eax # jump to next instruction; getop, jm
|
H A D | OP_NOP.S | 30 FINISH 1 # jump to next instruction
|
H A D | OP_CONST_HIGH16.S | 32 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance 35 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
|
H A D | OP_LONG_TO_DOUBLE.S | 34 FFETCH_ADV 1, %eax # %eax<- next instruction hi; fetch, advance 37 FGETOP_JMP 1, %eax # jump to next instruction; getop, jmp
|
H A D | OP_LONG_TO_FLOAT.S | 34 FFETCH_ADV 1, %eax # %eax<- next instruction hi; fetch, advance 37 FGETOP_JMP 1, %eax # jump to next instruction; getop, jmp
|
H A D | OP_MOVE.S | 35 FFETCH_ADV 1, %eax # %eax<- next instruction hi; fetch, advance 38 FGETOP_JMP 1, %eax # jump to next instruction; getop, jm
|
H A D | OP_MOVE_16.S | 33 FFETCH_ADV 3, %eax # %eax<- next instruction hi; fetch, advance 36 FGETOP_JMP 3, %eax # jump to next instruction; getop, jmp
|
H A D | OP_MOVE_FROM16.S | 32 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance 35 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
|
/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 52 private SQLException next = null; field in class:SQLException 127 return next; 155 if (next != null) { 156 next.setNextException(ex); 158 next = ex;
|
H A D | SQLWarning.java | 84 * Gets the next {@code SQLWarning} chained to this {@code SQLWarning} object. 91 SQLException next = super.getNextException(); 92 if (next == null) { 95 if (next instanceof SQLWarning) { 96 return (SQLWarning) next;
|
/dalvik/libcore/json/src/test/java/org/json/ |
H A D | JSONTokenerTest.java | 38 new JSONTokener(null).next(); 44 new JSONTokener(null).next(3); 50 new JSONTokener(null).next('A'); 108 assertEquals('\0', new JSONTokener("").next()); 110 new JSONTokener("").next(3); 115 new JSONTokener("").next('A'); 141 assertEquals('A', abcdeTokener.next()); 142 assertEquals('B', abcdeTokener.next('B')); 143 assertEquals("CD", abcdeTokener.next(2)); 145 abcdeTokener.next( [all...] |
/dalvik/libcore/text/src/main/java/java/text/ |
H A D | CharacterIterator.java | 90 * @return the character at the next index, or {@code DONE} if the next 93 public char next(); method in interface:CharacterIterator
|
/dalvik/libcore/xml/src/main/java/org/apache/xpath/axes/ |
H A D | SelfIteratorNoPredicate.java | 66 * Returns the next node in the set and advances the position of the 70 * @return The next <code>Node</code> in the set being iterated over, or 78 int next; 80 m_lastFetched = next = (DTM.NULL == m_lastFetched) 84 // m_lastFetched = next; 85 if (DTM.NULL != next) 89 return next;
|