Lines Matching defs:next
117 * volatile-writes of table elements and entry "next" fields
160 * of two, at least two to avoid immediate resizing on next use
266 volatile HashEntry<K,V> next;
268 HashEntry(int hash, K key, V value, HashEntry<K,V> next) {
272 this.next = next;
276 * Sets next field with volatile write semantics. (See above
291 (k.getDeclaredField("next"));
451 e = e.next;
487 * reused because their next fields won't change.
507 HashEntry<K,V> next = e.next;
509 if (next == null) // Single node on list
514 for (HashEntry<K,V> last = next;
516 last = last.next) {
525 for (HashEntry<K,V> p = e; p != lastRun; p = p.next) {
567 e = e.next;
600 e = e.next;
628 HashEntry<K,V> next = e.next;
634 setEntryAt(tab, index, next);
636 pred.setNext(next);
644 e = next;
658 for (e = entryForHash(this, hash); e != null; e = e.next) {
682 for (e = entryForHash(this, hash); e != null; e = e.next) {
994 e != null; e = e.next) {
1022 e != null; e = e.next) {
1064 for (e = entryAt(tab, i); e != null; e = e.next) {
1331 * Set nextEntry to first node of next non-empty table
1356 if ((nextEntry = e.next) == null)
1376 public final K next() { return super.nextEntry().key; }
1384 public final V next() { return super.nextEntry().value; }
1389 * Custom Entry class used by EntryIterator.next(), that relays
1420 public Map.Entry<K,V> next() {
1518 for (e = entryAt(tab, i); e != null; e = e.next) {