responseHeaderMap.put(values[0], list);
            }
            final String[] keyValue = StringUtils.split(values[1], ":", 2);
            if (keyValue.length == 2) {
                list.add(new Pair<>(keyValue[0].trim(), keyValue[1].trim()));
            } else if (keyValue.length == 1) {
                list.add(new Pair<>(keyValue[0].trim(), StringUtil.EMPTY));
            } else {

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

      backingMap.put(element, occurrences);
      size += occurrences;
      return 0;
    }
    int oldCount = backingMap.getValue(entryIndex);
    long newCount = (long) oldCount + (long) occurrences;
    checkArgument(newCount <= Integer.MAX_VALUE, "too many occurrences: %s", newCount);
    backingMap.setValue(entryIndex, (int) newCount);
    size += occurrences;
    return oldCount;
  }

  @CanIgnoreReturnValue
  @Override