@Override public Map.Entry<K, V> next() { while (entries.isEmpty()) { if (nodes.isEmpty()) { throw new NoSuchElementException(); } final Node<K, V> nextNode = nodes.pop(); nextNode.visit(entries, nodes); } return entries.pop(); }
EntryIterator(Node<K, V> node) { entries = new ArrayDeque<>(); nodes = new ArrayDeque<>(); node.visit(entries, nodes); }
@Override public Map.Entry<K, V> next() { while (entries.isEmpty()) { if (nodes.isEmpty()) { throw new NoSuchElementException(); } final Node<K, V> nextNode = nodes.pop(); nextNode.visit(entries, nodes); } return entries.pop(); }
@Override public Map.Entry<K, V> next() { while (entries.isEmpty()) { if (nodes.isEmpty()) { throw new NoSuchElementException(); } final Node<K, V> nextNode = nodes.pop(); nextNode.visit(entries, nodes); } return entries.pop(); }
EntryIterator(Node<K, V> node) { entries = new ArrayDeque<>(); nodes = new ArrayDeque<>(); node.visit(entries, nodes); }
@Override public Map.Entry<K, V> next() { while (entries.isEmpty()) { if (nodes.isEmpty()) { throw new NoSuchElementException(); } final Node<K, V> nextNode = nodes.pop(); nextNode.visit(entries, nodes); } return entries.pop(); }
@Override public Map.Entry<K, V> next() { while (entries.isEmpty()) { if (nodes.isEmpty()) { throw new NoSuchElementException(); } final Node<K, V> nextNode = nodes.pop(); nextNode.visit(entries, nodes); } return entries.pop(); }
public EntryIterator(Node<K, V> node) { entries = new ArrayDeque<>(); nodes = new ArrayDeque<>(); node.visit(entries, nodes); }
EntryIterator(Node<K, V> node) { entries = new ArrayDeque<>(); nodes = new ArrayDeque<>(); node.visit(entries, nodes); }
EntryIterator(Node<K, V> node) { entries = new ArrayDeque<>(); nodes = new ArrayDeque<>(); node.visit(entries, nodes); }