@Override
		public boolean hasNext() {
			while (nextValue == null && refMapIterator.hasNext()) {
				Entry<K, WeakValueRef<K, V>> next = refMapIterator.next();
				nextKey = next.getKey();
				nextValue = next.getValue().get();
			}
			return nextValue != null;
		}
This iterator works much like the {@link WeakValuesIterator}, except that this iterator
works on Map Entry objects.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/AbstractWeakValueMap.java