public ListIterator<RedBlackEntry<K, V>> iterator(boolean forward) {
		return new RedBlackTreeIterator(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