public ListIterator<RedBlackEntry<K, V>> iterator(K key, boolean forward) {
		RedBlackEntry<K, V> entry =
			forward ? getEntryGreaterThanEqual(key) : getEntryLessThanEqual(key);

		return new RedBlackTreeIterator(entry, forward);
	}
Test if the set is empty.
@return true if the set is empty.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/RedBlackTree.java