@Override
		public boolean contains(Object o) {
			if (o instanceof Map.Entry<?, ?> e) {
				Object key = e.getKey();
				Object v = get(key);
				return Objects.equals(v, e.getValue());
			}
			return false;
		}
Class that provides a {@link Set} view of the entry set of this map that is backed live
by this map. Its main job is to translate from {@code Map.Entry<K, WeakValueRef<V>>} to 
{@code Map.Entry<K,V>}. The heavy lifting is done by the {@link EntryIterator}. The super 
class implements all the rest of the methods by leveraging the iterator. We implement
contains, remove, and clear as they can be implemented much more efficiently than the 
default implementation which iterates over all the values to do those operations.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/AbstractWeakValueMap.java