@Override
		public Node next() {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			cur = next;
			next = next.next;
			atEnd = next == null;
			return cur;
		}
Construct a list iterator over the entries

A start of null implies one past the end of the list, i.e., {@code tail.next}

@param start the starting node
Ghidra/Framework/Generic/src/main/java/ghidra/generic/util/datastruct/TreeValueSortedMap.java