}

        @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

    assertEquals("test", entry.getValue());
    assertThrows(UnsupportedOperationException.class, () -> entry.setValue(1));
  }

  public void testPutAndGetInstance() {
    assertThat(map.putInstance(Integer.class, Integer.valueOf(5))).isNull();

    Integer oldValue = map.putInstance(Integer.class, Integer.valueOf(7));
    assertEquals(5, (int) oldValue);

    Integer newValue = map.getInstance(Integer.class);

pkg expvar, method (Func) String() string
pkg expvar, type Float struct
pkg expvar, type Func func() interface{}
pkg expvar, type Int struct
pkg expvar, type KeyValue struct
pkg expvar, type KeyValue struct, Key string
pkg expvar, type KeyValue struct, Value Var
pkg expvar, type Map struct
pkg expvar, type String struct
pkg expvar, type Var interface { String }
pkg expvar, type Var interface, String() string

      }
      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

      @ParametricNullness K key,
      boolean containedKey,
      @Nullable V oldValue,
      @ParametricNullness V newValue) {
    if (containedKey) {
      // The cast is safe because of the containedKey check.
      removeFromInverseMap(uncheckedCastNullableTToT(oldValue));
    }
    inverse.delegate.put(newValue, key);
  }

  @CanIgnoreReturnValue
  @Override
  public @Nullable V remove(@Nullable Object key) {

    /*
     * 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

      @ParametricNullness K key,
      boolean containedKey,
      @Nullable V oldValue,
      @ParametricNullness V newValue) {
    if (containedKey) {
      // The cast is safe because of the containedKey check.
      removeFromInverseMap(uncheckedCastNullableTToT(oldValue));
    }
    inverse.delegate.put(newValue, key);
  }

  @CanIgnoreReturnValue
  @Override
  public @Nullable V remove(@Nullable Object key) {

        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);
        }