private void processQueue() {
		WeakValue<? extends V> wk;
		while ((wk = (WeakValue<? extends V>) queue.poll()) != null) {
			Object k = reverseHash.remove(wk);
			if (k != null) {
				hash.remove(k);
			}
		}
	}
A hashtable-based <code>Map</code> implementation with <em>weak values</em>.

<P>This implementation uses two maps internally, which nearly doubles the memory requirements
over a traditional map.
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/pcodeCPort/utils/WeakHashMap2.java