/libcore/ojluni/src/main/java/java/security/ |
H A D | SecureRandom.java | 498 final protected int next(int numBits) { method in class:SecureRandom 501 int next = 0; 505 next = (next << 8) + (b[i] & 0xFF); 508 return next >>> (numBytes*8 - numBits);
|
/libcore/ojluni/src/main/java/java/text/ |
H A D | PatternEntry.java | 207 public PatternEntry next() throws ParseException { method in class:PatternEntry.Parser
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | JumboEnumSet.java | 133 public E next() { method in class:JumboEnumSet.EnumSetIterator
|
H A D | RegularEnumSet.java | 100 public E next() { method in class:RegularEnumSet.EnumSetIterator
|
H A D | ServiceLoader.java | 360 nextName = pending.next(); 413 public S next() { method in class:ServiceLoader.LazyIterator 444 * {@link java.util.Iterator#next next} methods can therefore throw a 449 * exception or error is thrown as the next provider is located and 454 * iterator will make a best effort to locate and instantiate the next 491 public S next() { 493 return knownProviders.next().getValue(); 494 return lookupIterator.next();
|
H A D | AbstractList.java | 181 if (it.next()==null) 185 if (o.equals(it.next())) 332 * Index of element to be returned by subsequent call to next. 337 * Index of element returned by most recent call to next or 354 public E next() { method in class:AbstractList.Itr 358 E next = get(i); 361 return next; 521 E o1 = e1.next(); 522 Object o2 = e2.next(); 559 * {@code fromIndex}, and repeatedly calls {@code ListIterator.next} [all...] |
H A D | EnumMap.java | 178 keyType = m.keySet().iterator().next().getDeclaringClass(); 520 // Lower bound on index of next element to return 549 public K next() { method in class:EnumMap.KeyIterator 558 public V next() { method in class:EnumMap.ValueIterator 569 public Map.Entry<K,V> next() { method in class:EnumMap.EntryIterator
|
H A D | Random.java | 113 long next = current * 181783497276652981L; 114 if (seedUniquifier.compareAndSet(current, next)) 115 return next; 125 * number generator which is maintained by method {@link #next}. 174 * Generates the next pseudorandom number. Subclasses should 177 * <p>The general contract of {@code next} is that it returns an 182 * likely to be {@code 0} or {@code 1}. The method {@code next} is 194 * @return the next pseudorandom value from this random number 198 protected int next(int bits) { method in class:Random 312 * Returns the next pseudorando [all...] |
H A D | ArrayDeque.java | 110 * The index at which the next element would be added to the tail 597 * Index of element to be returned by subsequent call to next. 608 * Index of element returned by most recent call to next. 617 public E next() { method in class:ArrayDeque.DeqIterator 634 if (delete(lastRet)) { // if left-shifted, undo increment in next() 651 // concurrent modification exceptions than next(). As such, this is a less 674 public E next() { method in class:ArrayDeque.DescendingIterator
|
H A D | LinkedHashMap.java | 199 * LinkedHashMap.Entry<K, V> entry = map.entrySet().iterator.next() 218 LinkedHashMapEntry(int hash, K key, V value, Node<K,V> next) { argument 219 super(hash, key, value, next); 286 Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) { argument 289 new LinkedHashMapEntry<K,V>(q.hash, q.key, q.value, next); 294 TreeNode<K,V> newTreeNode(int hash, K key, V value, Node<K,V> next) { argument 295 TreeNode<K,V> p = new TreeNode<K,V>(hash, key, value, next); 300 TreeNode<K,V> replacementTreeNode(Node<K,V> p, Node<K,V> next) { argument 302 TreeNode<K,V> t = new TreeNode<K,V>(q.hash, q.key, q.value, next); 740 LinkedHashMapEntry<K,V> next; field in class:LinkedHashMap.LinkedHashIterator 780 public final K next() { return nextNode().getKey(); } method in class:LinkedHashMap.LinkedKeyIterator 785 public final V next() { return nextNode().value; } method in class:LinkedHashMap.LinkedValueIterator 790 public final Map.Entry<K,V> next() { return nextNode(); } method in class:LinkedHashMap.LinkedEntryIterator [all...] |
H A D | PriorityQueue.java | 490 * subsequent call to next. 495 * Index of element returned by most recent call to next, 515 * Element returned by the most recent call to next iff that 533 public E next() { method in class:PriorityQueue.Itr
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | DelayQueue.java | 87 * the leader, it waits only for the next delay to elapse, but 298 * this method returns the element that will expire next, 505 if (o == it.next()) { 534 int cursor; // index of next element to return 547 public E next() { method in class:DelayQueue.Itr
|
H A D | FutureTask.java | 355 volatile WaitNode next; field in class:FutureTask.WaitNode 373 WaitNode next = q.next; 374 if (next == null) 376 q.next = null; // unlink to help gc 377 q = next; 429 q.next = waiters, q); 470 s = q.next; 474 pred.next = s;
|
H A D | ConcurrentLinkedQueue.java | 124 * - There is exactly one (last) Node with a null next reference, 183 volatile Node<E> next; field in class:ConcurrentLinkedQueue.Node 214 * - (tmp = head).next != tmp || tmp != head 224 * node with node.next == null) can be reached in O(1) time. 232 * - tail.next may or may not be self-pointing to tail. 294 * Returns the successor of p, or the head node if p.next has been 299 Node<E> next = p.next; 300 return (p == next) ? head : next; 731 public E next() { method in class:ConcurrentLinkedQueue.Itr [all...] |
H A D | CopyOnWriteArrayList.java | 979 if (!it.hasNext() || !Objects.equals(elements[i], it.next())) 1067 /** Index of element to be returned by subsequent call to next. */ 1084 public E next() { method in class:CopyOnWriteArrayList.COWIterator 1498 public E next() { method in class:CopyOnWriteArrayList.COWSubListIterator 1500 return it.next(); 1541 action.accept(it.next());
|
H A D | LinkedBlockingQueue.java | 116 * self-link implicitly means to advance to head.next. 128 * - this Node, meaning the successor is head.next 131 Node<E> next; field in class:LinkedBlockingQueue.Node 150 * Invariant: last.next == null 200 // assert last.next == null; 201 last = last.next = node; 213 Node<E> first = h.next; 214 h.next = h; // help GC 510 return (count.get() > 0) ? head.next.item : null; 521 // p.next i 782 public E next() { method in class:LinkedBlockingQueue.Itr [all...] |
H A D | Phaser.java | 393 long n = s & PARTIES_MASK; // base of next state 449 long next = ((long)phase << PHASE_SHIFT) | adjust; 450 if (U.compareAndSwapLong(this, STATE, s, next)) 519 * next phase 544 * next phase 602 * advance to the next phase 689 long n = s & PARTIES_MASK; // base of next state 715 * @return the next arrival phase number, or the argument if it is 740 * @return the next arrival phase number, or the argument if it is 775 * @return the next arriva 1093 QNode next; field in class:Phaser.QNode [all...] |
/libcore/ojluni/src/main/java/sun/nio/fs/ |
H A D | UnixDirectoryStream.java | 150 // next entry to return 169 // Returns next entry (or null) 218 public synchronized Path next() { method in class:UnixDirectoryStream.UnixDirectoryIterator
|
H A D | UnixFileSystem.java | 186 private FileStore next; field in class:UnixFileSystem.FileStoreIterator 197 UnixMountEntry entry = entries.next(); 222 if (next != null) 224 next = readNext(); 225 return next != null; 229 public synchronized FileStore next() { method in class:UnixFileSystem.FileStoreIterator 230 if (next == null) 231 next = readNext(); 232 if (next == null) { 235 FileStore result = next; [all...] |
/libcore/ojluni/src/test/java/time/test/java/time/ |
H A D | TestLocalDate.java | 96 private LocalDate next(LocalDate date) { method in class:TestLocalDate 413 test = next(test);
|
/libcore/luni/src/test/java/libcore/java/text/ |
H A D | OldAttributedStringTest.java | 35 while ((ch = it.next()) != CharacterIterator.DONE) 175 while ((ch = it.next()) != CharacterIterator.DONE) 266 public char next() { method in class:OldAttributedStringTest.testAttributedCharacterIterator 468 it.next();
|
/libcore/ojluni/src/main/java/java/nio/file/ |
H A D | FileTreeWalker.java | 49 * ev = walker.next(); 125 * Events returned by the {@link #walk} and {@link #next} methods. 330 * Returns the next Event or {@code null} if there are no more events or 333 Event next() { method in class:FileTreeWalker 344 // get next entry in the directory 349 entry = iterator.next(); 356 // no next entry so close and pop directory, creating corresponding event
|
/libcore/ojluni/src/main/java/java/util/jar/ |
H A D | JarFile.java | 247 public JarEntry next() { method in class:JarFile.JarEntryIterator 257 return next(); 523 next: 530 continue next;
|
/libcore/ojluni/src/main/java/sun/net/www/ |
H A D | MessageHeader.java | 118 * Find the next value that corresponds to this key. 185 int next = -1; field in class:MessageHeader.HeaderIterator 202 next = index++; 210 public String next() { method in class:MessageHeader.HeaderIterator 214 return values [next]; 217 return next();
|
/libcore/ojluni/src/main/java/sun/nio/ch/ |
H A D | Util.java | 67 private int next(int i) { method in class:Util.BufferCache 90 while ((i = next(i)) != start) { 107 start = next(start); 131 int next = (start + count) % TEMP_BUF_POOL_SIZE; 132 buffers[next] = buf; 146 start = next(start);
|