Lines Matching defs:next
162 * The next size value at which to resize (capacity * load factor).
437 for (Entry<K,V> e = table[0]; e != null; e = e.next) {
469 e = e.next) {
498 for (Entry<K,V> e = table[i]; e != null; e = e.next) {
517 for (Entry<K,V> e = table[0]; e != null; e = e.next) {
545 for (Entry<K,V> e = table[i]; e != null; e = e.next) {
597 Entry<K,V> next = e.next;
602 e.next = newTable[i];
604 e = next;
679 Entry<K,V> next = e.next;
686 table[i] = next;
688 prev.next = next;
693 e = next;
715 Entry<K,V> next = e.next;
720 table[i] = next;
722 prev.next = next;
727 e = next;
757 for (Entry e = tab[i] ; e != null ; e = e.next)
769 for (Entry e = tab[i] ; e != null ; e = e.next)
808 Entry<K,V> next;
816 next = n;
906 Entry<K,V> next; // next entry to return
915 while (index < t.length && (next = t[index++]) == null)
921 return next != null;
927 Entry<K,V> e = next;
931 if ((next = e.next) == null) {
933 while (index < t.length && (next = t[index++]) == null)
953 public V next() {
959 public K next() {
965 public Map.Entry<K,V> next() {