insertPlacingAtEndOfIterationOrder(newNode);
    }

    // TODO(cpovirk): Don't perform rehash check if we replaced an existing entry (as in `put`)?
    rehashIfNecessary();
    return keyOrNull(oldNodeForValue);
  }

  private void rehashIfNecessary() {
    @Nullable Node<K, V>[] oldKToV = hashTableKToV;
    if (Hashing.needsResizing(size, oldKToV.length, LOAD_FACTOR)) {
      int newTableSize = oldKToV.length * 2;

      appendToValueSet(newEntry);
      multimapIterationChain.append(newEntry);
      hashTable[bucket] = newEntry;
      size++;
      modCount++;
      rehashIfNecessary();
      return true;
    }

    private void rehashIfNecessary() {
      if (Hashing.needsResizing(size, hashTable.length, VALUE_SET_LOAD_FACTOR)) {
        @SuppressWarnings("unchecked")
        ValueEntry<K, V>[] hashTable =

      appendToValueSet(newEntry);
      multimapIterationChain.append(newEntry);
      hashTable[bucket] = newEntry;
      size++;
      modCount++;
      rehashIfNecessary();
      return true;
    }

    private void rehashIfNecessary() {
      if (Hashing.needsResizing(size, hashTable.length, VALUE_SET_LOAD_FACTOR)) {
        @SuppressWarnings("unchecked")
        ValueEntry<K, V>[] hashTable =