Searched defs:next (Results 51 - 75 of 86) sorted by relevance

1234

/libcore/ojluni/src/main/java/java/util/concurrent/
H A DPriorityBlockingQueue.java863 int cursor; // index of next element to return
875 public E next() { method in class:PriorityBlockingQueue.Itr
H A DThreadLocalRandom.java197 protected int next(int bits) { method in class:ThreadLocalRandom
1052 * The next seed for default constructors.
H A DArrayBlockingQueue.java99 /** items index for next take, poll, peek or remove */
102 /** items index for next put, offer, or add */
778 Node next; field in class:ArrayBlockingQueue.Itrs.Node
780 Node(Itr iterator, Node next) { argument
782 this.next = next;
824 p = o.next;
837 final Node next = p.next;
843 p.next
1166 public E next() { method in class:ArrayBlockingQueue.Itr
[all...]
H A DConcurrentLinkedDeque.java114 * ("prev") and successor ("next") nodes:
116 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
125 * "last" node terminating any chain of next references starting at
130 * next reference in the first or last node to a fresh node
137 * A "self-link" is a next or prev reference that is the same node:
138 * p.prev == p or p.next == p
145 * (p.prev == null && p.next != p) ||
146 * (p.next == null && p.prev != p)
169 * any time, the set of live nodes maintained by prev and next
170 * links are identical, that is, the live nodes found via next
294 volatile Node<E> next; field in class:ConcurrentLinkedDeque.Node
528 unlinkFirst(Node<E> first, Node<E> next) argument
1411 public E next() { method in class:ConcurrentLinkedDeque.AbstractItr
[all...]
H A DForkJoinTask.java438 ExceptionNode next; field in class:ForkJoinTask.ExceptionNode
441 ExceptionNode(ForkJoinTask<?> task, Throwable ex, ExceptionNode next, argument
445 this.next = next;
466 for (ExceptionNode e = t[i]; ; e = e.next) {
529 ExceptionNode next = e.next;
532 t[i] = next;
534 pred.next = next;
[all...]
H A DLinkedBlockingDeque.java96 * self-link implicitly means to jump to "first" (for next links)
130 Node<E> next; field in class:LinkedBlockingDeque.Node
147 * (last.next == null && last.item != null)
222 node.next = f;
246 l.next = node;
260 Node<E> n = f.next;
263 f.next = f; // help GC
290 p.next = null;
302 Node<E> n = x.next;
308 p.next
1022 Node<E> next; field in class:LinkedBlockingDeque.AbstractItr
1092 public E next() { method in class:LinkedBlockingDeque.AbstractItr
[all...]
H A DLinkedTransferQueue.java158 * first unmatched node on match and CASing the next field of the
209 * pointer updates: Threads may sometimes shortcut the "next" link
215 * of costly-to-reclaim garbage caused by the sequential "next"
223 * pointer, we set the "next" link of the previous head to point
227 * adds some further complexity to traversal: If any "next"
356 * to be removed, we can unsplice s by CASing the next field of
361 * (i.e., with null next), then it is pinned as the target node
454 volatile Node next; field in class:LinkedTransferQueue.Node
550 (Node.class.getDeclaredField("next"));
615 Node n = q.next; // updat
1002 public final E next() { method in class:LinkedTransferQueue.Itr
[all...]
H A DScheduledThreadPoolExecutor.java273 * Sets the next time to run for a periodic task.
886 * the leader, it waits only for the next delay to elapse, but
1296 int cursor; // index of next element to return; initially 0
1307 public Runnable next() { method in class:ScheduledThreadPoolExecutor.DelayedWorkQueue.Itr
H A DSynchronousQueue.java141 * except that nodes that appear to be the next ones to become
235 volatile SNode next; // next node in stack field in class:SynchronousQueue.TransferStack.SNode
249 return cmp == next &&
295 (SNode.class.getDeclaredField("next"));
317 static SNode snode(SNode s, Object e, SNode next, int mode) { argument
320 s.next = next;
358 casHead(h, h.next); // pop cancelled node
367 if ((h = head) != null && h.next
537 volatile QNode next; // next node in queue field in class:SynchronousQueue.TransferQueue.QNode
[all...]
/libcore/ojluni/src/main/java/java/util/zip/
H A DZipFile.java533 return next();
536 public ZipEntry next() { method in class:ZipFile.ZipEntryIterator
/libcore/xml/src/main/java/org/xmlpull/v1/
H A DXmlPullParser.java30 * <p>There are two key methods: next() and nextToken(). While next() provides
40 * <p>The method <a href="#next()">next()</a> advances the parser to the
41 * next event. The int value returned from next determines the current parser
45 * <p>Th following event types are seen by next()<dl>
49 * (when in validating mode next() will not report ignorable whitespace, use nextToken() instead)
54 * <p>after first next() or nextToken() (or any other next*() metho
934 int next() method in interface:XmlPullParser
[all...]
/libcore/luni/src/test/java/libcore/xml/
H A DXmlPullParserFactoryTest.java354 public int next() throws XmlPullParserException, IOException { method in class:XmlPullParserFactoryTest.XmlPullParserStub
/libcore/ojluni/src/main/java/java/text/
H A DAttributedString.java166 Map.Entry<? extends Attribute, ?> entry = iterator.next();
248 for (char c = text.current(); text.getIndex() < endIndex; c = text.next())
272 Attribute attributeKey = itr.next();
397 Map.Entry<? extends Attribute, ?> entry = iterator.next();
668 Attribute key = iterator.next();
701 * Sets the attributes for the range from offset to the next run break
719 Map.Entry<Attribute, Object> entry = iterator.next();
835 public char next() { method in class:AttributedString.AttributedStringIterator
/libcore/ojluni/src/main/java/java/util/
H A DArrayList.java800 * returned by an initial call to {@link ListIterator#next next}.
844 // anyway (and cause next() to throw) so saving this value will guarantee that the
849 int cursor; // index of next element to return
858 public E next() { method in class:ArrayList.Itr
1131 public E next() {
H A DHashtable.java300 for (HashtableEntry<?,?> e = tab[i] ; e != null ; e = e.next) {
339 for (HashtableEntry<?,?> e = tab[index] ; e != null ; e = e.next) {
367 for (HashtableEntry<?,?> e = tab[index] ; e != null ; e = e.next) {
412 old = old.next;
415 e.next = (HashtableEntry<K,V>)newMap[index];
470 for(; entry != null ; entry = entry.next) {
497 for(HashtableEntry<K,V> prev = null ; e != null ; prev = e, e = e.next) {
501 prev.next = e.next;
503 tab[index] = e.next;
1269 HashtableEntry<K,V> next; field in class:Hashtable.HashtableEntry
1271 HashtableEntry(int hash, K key, V value, HashtableEntry<K,V> next) argument
1395 public T next() { method in class:Hashtable.Enumerator
[all...]
H A DIdentityHashMap.java716 boolean indexValid; // To avoid unnecessary next computation
761 // next() calls to return it again. The likelihood of
796 // into a slot that may later be returned by next(),
798 // next() calls. It is OK that our copy will have
824 public K next() { method in class:IdentityHashMap.KeyIterator
831 public V next() { method in class:IdentityHashMap.ValueIterator
841 public Map.Entry<K,V> next() { method in class:IdentityHashMap.EntryIterator
998 if (c.contains(i.next())) {
1092 if (i.next() == o) {
1215 if (c.contains(i.next())) {
[all...]
H A DLinkedList.java99 * (last.next == null && last.item != null)
147 l.next = newNode;
163 pred.next = newNode;
174 final Node<E> next = f.next;
176 f.next = null; // help GC
177 first = next;
178 if (next == null)
181 next.prev = null;
200 prev.next
873 private Node<E> next; field in class:LinkedList.ListItr
887 public E next() { method in class:LinkedList.ListItr
972 Node<E> next; field in class:LinkedList.Node
975 Node(Node<E> prev, E element, Node<E> next) argument
997 public E next() { method in class:LinkedList.DescendingIterator
[all...]
H A DVector.java1084 * returned by an initial call to {@link ListIterator#next next}.
1130 // anyway (and cause next() to throw) so saving this value will guarantee that the
1135 int cursor; // index of next element to return
1143 public E next() { method in class:Vector.Itr
H A DWeakHashMap.java168 * The next size value at which to resize (capacity * load factor).
327 Entry<K,V> next = p.next;
330 table[i] = next;
332 prev.next = next;
333 // Must not null out e.next;
340 p = next;
357 * entries that will be removed before next attempted access
370 * entries that will be removed before next attempte
705 Entry<K,V> next; field in class:WeakHashMap.Entry
710 Entry(Object key, V value, ReferenceQueue<Object> queue, int hash, Entry<K,V> next) argument
832 public V next() { method in class:WeakHashMap.ValueIterator
838 public K next() { method in class:WeakHashMap.KeyIterator
844 public Map.Entry<K,V> next() { method in class:WeakHashMap.EntryIterator
[all...]
H A DHashMap.java213 * Node.next) to better preserve locality, and to slightly
282 Node<K,V> next; field in class:HashMap.Node
284 Node(int hash, K key, V value, Node<K,V> next) { argument
288 this.next = next;
418 * The next size value at which to resize (capacity * load factor).
573 if ((e = first.next) != null) {
580 } while ((e = e.next) != null);
640 if ((e = p.next) == null) {
641 p.next
1418 Node<K,V> next; // next entry to return field in class:HashMap.HashIterator
1465 public final K next() { return nextNode().key; } method in class:HashMap.KeyIterator
1470 public final V next() { return nextNode().value; } method in class:HashMap.ValueIterator
1475 public final Map.Entry<K,V> next() { return nextNode(); } method in class:HashMap.EntryIterator
1745 newNode(int hash, K key, V value, Node<K,V> next) argument
1750 replacementNode(Node<K,V> p, Node<K,V> next) argument
1755 newTreeNode(int hash, K key, V value, Node<K,V> next) argument
1760 replacementTreeNode(Node<K,V> p, Node<K,V> next) argument
1809 TreeNode(int hash, K key, V val, Node<K,V> next) argument
[all...]
/libcore/ojluni/src/main/java/java/util/concurrent/locks/
H A DStampedLock.java310 volatile WNode next; field in class:StampedLock.WNode
347 long s, next; // bypass acquireWrite in fully unlocked case only
349 U.compareAndSwapLong(this, STATE, s, next = s + WBIT)) ?
350 next : acquireWrite(false, 0L));
360 long s, next;
362 U.compareAndSwapLong(this, STATE, s, next = s + WBIT)) ?
363 next : 0L);
383 long next, deadline;
384 if ((next = tryWriteLock()) != 0L)
385 return next;
[all...]
/libcore/ojluni/src/main/native/
H A Dzip_util.h182 unsigned int next; /* hash chain: index into jzfile->entries */ member in struct:jzcell
231 struct jzfile *next; /* next zip file in search list */ member in struct:jzfile
235 jint metacurrent; /* the next empty slot in metanames array */
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/io/
H A DSerializationStressTest2.java506 public DeepNesting next; field in class:SerializationStressTest2.DeepNesting
514 next = null;
521 next(prev);
523 prev = prev.next(new DeepNesting(i * 1.0F));
537 if (inst.next == null || this.next == null)
538 return inst.next == this.next; // both null
539 return this.next.equals(inst.next);
542 public DeepNesting next(DeepNesting ivt) { method in class:SerializationStressTest2.DeepNesting
553 public DeepNestingWithWriteObject next; field in class:SerializationStressTest2.DeepNestingWithWriteObject
590 public DeepNestingWithWriteObject next(DeepNestingWithWriteObject ivt) { method in class:SerializationStressTest2.DeepNestingWithWriteObject
[all...]
/libcore/ojluni/src/main/java/java/io/
H A DObjectOutputStream.java2345 /* number of mappings in table/next available handle */
2353 /* maps handle value -> next candidate handle value */
2354 private int[] next; field in class:ObjectOutputStream.HandleTable
2364 next = new int[initialCapacity];
2371 * Assigns next available handle to given object, and returns handle
2375 if (size >= next.length) {
2394 for (int i = spine[index]; i >= 0; i = next[i]) {
2425 next[handle] = spine[index];
2446 int newLength = (next.length << 1) + 1;
2448 System.arraycopy(next,
[all...]
/libcore/ojluni/src/main/java/java/sql/
H A DResultSet.java40 * before the first row. The <code>next</code> method moves the
41 * cursor to the next row, and because it returns <code>false</code>
138 * to retrieve the next result from a sequence of multiple results.
155 * <code>next</code> makes the first row the current row; the
158 * When a call to the <code>next</code> method returns <code>false</code>,
165 * subsequent call to <code>next</code>.
168 * to the method <code>next</code> will
177 boolean next() throws SQLException; method in interface:ResultSet
198 * re-executed, or is used to retrieve the next result from a
433 * read prior to getting the value of any other column. The next
[all...]

Completed in 374 milliseconds

1234