public boolean containsKey(K key) {
		RedBlackEntry<K, V> node = getNode(key);
		return node != null;
	}
Returns true if the key is in the set.
@param key the key whose presence is to be tested.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/RedBlackTree.java