Lines Matching refs:next
370 for (Entry<K,V> e = tab[i] ; e != null ; e = e.next) {
409 for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {
436 for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {
482 old = old.next;
488 e.next = newMap[index];
521 for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {
559 for (Entry<K,V> e = tab[index], prev = null ; e != null ; prev = e, e = e.next) {
563 prev.next = e.next;
565 tab[index] = e.next;
647 Map.Entry<K,V> e = it.next();
767 for (Entry e = tab[index]; e != null; e = e.next)
783 prev = e, e = e.next) {
787 prev.next = e.next;
789 tab[index] = e.next;
869 Map.Entry<K,V> e = i.next();
916 entry = entry.next;
952 entry = entry.next;
961 entryStack = entryStack.next;
1024 for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {
1042 Entry<K,V> next;
1044 protected Entry(int hash, K key, V value, Entry<K,V> next) {
1048 this.next = next;
1053 (next==null ? null : (Entry<K,V>) next.clone()));
1154 entry = e.next;
1165 public T next() {
1184 prev = e, e = e.next) {
1189 tab[index] = e.next;
1191 prev.next = e.next;