Lines Matching defs:next
163 * The next size value at which to resize (capacity * load factor).
395 Entry<K,V> next = p.next;
398 table[i] = next;
400 prev.next = next;
401 // Must not null out e.next;
408 p = next;
425 * entries that will be removed before next attempted access
438 * entries that will be removed before next attempted access
471 e = e.next;
499 e = e.next;
521 for (Entry<K,V> e = tab[i]; e != null; e = e.next) {
588 Entry<K,V> next = e.next;
591 e.next = null; // Help GC
599 e.next = dest[i];
602 e = next;
673 Entry<K,V> next = e.next;
678 tab[i] = next;
680 prev.next = next;
684 e = next;
703 Entry<K,V> next = e.next;
708 tab[i] = next;
710 prev.next = next;
714 e = next;
755 for (Entry<K,V> e = tab[i]; e != null; e = e.next)
767 for (Entry<K,V> e = tab[i]; e != null; e = e.next)
780 Entry<K,V> next;
787 int hash, Entry<K,V> next) {
791 this.next = next;
844 * between hasNext and next
874 entry = entry.next;
879 /** The common parts of next() across different types of iterators */
887 entry = entry.next;
908 public V next() {
914 public K next() {
920 public Map.Entry<K,V> next() {