Object newValue = new Object();
        assertThat(cache.asMap().replace(entry.getKey(), newValue))
            .isSameInstanceAs(entry.getValue());
        assertThat(cache.asMap().replace(entry.getKey(), newValue, entry.getValue())).isTrue();
        Object newKey = new Object();
        assertThat(cache.asMap().replace(newKey, entry.getValue())).isNull();

        }

        @Override
        @ParametricNullness
        public V getValue() {
          return ArrayMap.this.getValue(index);
        }

        @Override
        @ParametricNullness
        public V setValue(@ParametricNullness V value) {
          return ArrayMap.this.setValue(index, value);
        }
      };
    }

    @Override

      }
      alertListenerIfPresent(key, oldValue.getValue(), RemovalCause.REPLACED);
      return oldValue.getValue();
    }
  }

  @CanIgnoreReturnValue
  @Override
  public @Nullable V remove(@Nullable Object key) {
    synchronized (lock) {
      Timestamped<V> stamped = cachingHashMap.remove(key);
      if (stamped != null) {
        V value = stamped.getValue();
        // `key` was in the cache, so it's a K.

   */
  private void replaceValueInEntry(int entry, @ParametricNullness V newValue, boolean force) {
    checkArgument(entry != ABSENT);
    int newValueHash = smearedHash(newValue);
    int newValueIndex = findEntryByValue(newValue, newValueHash);
    if (newValueIndex != ABSENT) {
      if (force) {
        removeEntryValueHashKnown(newValueIndex, newValueHash);

    /*
     * We inherit equals() and hashCode() instead of overriding them to use keyEquivalence and
     * valueEquivalence.
     */

    @Override
    public V setValue(V newValue) {
      put(getKey(), newValue);
      return super.setValue(newValue); // done after put() so that it happens only if put() succeeds
    }
  }

  final class EntryIterator extends HashIterator<Entry<K, V>> {

    @Override

    /*
     * We inherit equals() and hashCode() instead of overriding them to use keyEquivalence and
     * valueEquivalence.
     */

    @Override
    public V setValue(V newValue) {
      put(getKey(), newValue);
      return super.setValue(newValue); // done after put() so that it happens only if put() succeeds
    }
  }

  final class EntryIterator extends HashIterator<Entry<K, V>> {

    @Override

        V previousValue = oldValue.get();
        if (previousValue == null) {
          V newValue = loader.load(key);
          return set(newValue) ? futureValue : immediateFuture(newValue);
        }
        ListenableFuture<V> newValue = loader.reload(key, previousValue);
        if (newValue == null) {
          return immediateFuture(null);
        }

        V previousValue = oldValue.get();
        if (previousValue == null) {
          V newValue = loader.load(key);
          return set(newValue) ? futureValue : immediateFuture(newValue);
        }
        ListenableFuture<V> newValue = loader.reload(key, previousValue);
        if (newValue == null) {
          return immediateFuture(null);
        }

                return entry;
              }

              @Override
              @ParametricNullness
              public V setValue(@ParametricNullness V newValue) {
                checkArgument(apply(getKey(), newValue));
                return super.setValue(newValue);
              }
            };
          }
        };
      }
    }

    @Override
    Set<K> createKeySet() {

    // different value
    assertFalse(segment.replace(key, hash, oldValue, newValue));
    assertEquals(1, segment.count);
    assertThat(segment.get(key, hash)).isEqualTo(newValue);

    // cleared
    segment.setWeakValueReferenceForTesting(entry, oldValueRef);
    oldValueRef.clear();
    assertFalse(segment.replace(key, hash, oldValue, newValue));
    assertEquals(0, segment.count);