} else if (isCollected(e)) {
if (isCollected(e)) { int newCount = this.count - 1; ++modCount;
if (map.valueEquivalence().equivalent(value, entryValue)) { explicitRemoval = true; } else if (isCollected(e)) {
/** * Returns {@code true} if the entry has been partially collected, meaning that either the key * is null, or the value is null and it is not computing. */ boolean isCollected(ReferenceEntry<K, V> entry) { if (entry.getKey() == null) { return true; } return isCollected(entry.getValueReference()); }
@Override public StrongKeyWeakValueEntry<K, V> copy( StrongKeyWeakValueSegment<K, V> segment, StrongKeyWeakValueEntry<K, V> entry, @NullableDecl StrongKeyWeakValueEntry<K, V> newNext) { if (Segment.isCollected(entry)) { return null; } return entry.copy(segment.queueForValues, newNext); }
if (isCollected(e)) { int newCount = this.count - 1; ++modCount;
} else if (isCollected(e)) {
if (isCollected(e)) { int newCount = this.count - 1; ++modCount;
if (map.valueEquivalence().equivalent(value, entryValue)) { explicitRemoval = true; } else if (isCollected(e)) {
if (isCollected(e)) { int newCount = this.count - 1; ++modCount;
if (map.valueEquivalence().equivalent(value, entryValue)) { explicitRemoval = true; } else if (isCollected(e)) {
if (isCollected(e)) { int newCount = this.count - 1; ++modCount;
} else if (isCollected(e)) {
@Override public WeakKeyWeakValueEntry<K, V> copy( WeakKeyWeakValueSegment<K, V> segment, WeakKeyWeakValueEntry<K, V> entry, @NullableDecl WeakKeyWeakValueEntry<K, V> newNext) { if (entry.getKey() == null) { // key collected return null; } if (Segment.isCollected(entry)) { return null; } return entry.copy(segment.queueForKeys, segment.queueForValues, newNext); }
@Override public StrongKeyWeakValueEntry<K, V> copy( StrongKeyWeakValueSegment<K, V> segment, StrongKeyWeakValueEntry<K, V> entry, @NullableDecl StrongKeyWeakValueEntry<K, V> newNext) { if (Segment.isCollected(entry)) { return null; } return entry.copy(segment.queueForValues, newNext); }
if (isCollected(e)) { int newCount = this.count - 1; ++modCount;
@Override public WeakKeyWeakValueEntry<K, V> copy( WeakKeyWeakValueSegment<K, V> segment, WeakKeyWeakValueEntry<K, V> entry, @NullableDecl WeakKeyWeakValueEntry<K, V> newNext) { if (entry.getKey() == null) { // key collected return null; } if (Segment.isCollected(entry)) { return null; } return entry.copy(segment.queueForKeys, segment.queueForValues, newNext); }
@Override public StrongKeyWeakValueEntry<K, V> copy( StrongKeyWeakValueSegment<K, V> segment, StrongKeyWeakValueEntry<K, V> entry, @NullableDecl StrongKeyWeakValueEntry<K, V> newNext) { if (Segment.isCollected(entry)) { return null; } return entry.copy(segment.queueForValues, newNext); }
@Override public WeakKeyWeakValueEntry<K, V> copy( WeakKeyWeakValueSegment<K, V> segment, WeakKeyWeakValueEntry<K, V> entry, @Nullable WeakKeyWeakValueEntry<K, V> newNext) { if (entry.getKey() == null) { // key collected return null; } if (Segment.isCollected(entry)) { return null; } return entry.copy(segment.queueForKeys, segment.queueForValues, newNext); }
@Override public StrongKeyWeakValueEntry<K, V> copy( StrongKeyWeakValueSegment<K, V> segment, StrongKeyWeakValueEntry<K, V> entry, @Nullable StrongKeyWeakValueEntry<K, V> newNext) { if (Segment.isCollected(entry)) { return null; } return entry.copy(segment.queueForValues, newNext); }