this.keyOffset = 0;
    int tableSize = (size >= 2) ? ImmutableSet.chooseTableSize(size) : 0;
    this.keyHashTable =
        RegularImmutableMap.createHashTableOrThrow(alternatingKeysAndValues, size, tableSize, 0);
    Object valueHashTable =
        RegularImmutableMap.createHashTableOrThrow(alternatingKeysAndValues, size, tableSize, 1);
    this.inverse =
        new RegularImmutableBiMap<V, K>(valueHashTable, alternatingKeysAndValues, size, this);

        }
        outI++;
      }
      return outI == n ? hashTable : new Object[] {hashTable, outI, duplicateKey};
    }
  }

  @CheckForNull
  static Object createHashTableOrThrow(
      @Nullable Object[] alternatingKeysAndValues, int n, int tableSize, int keyOffset) {
    Object hashTablePlus = createHashTable(alternatingKeysAndValues, n, tableSize, keyOffset);