}

  private static <K, V> void putEntryWithChecks(
      SortedMap<K, V> map, Entry<? extends K, ? extends V> entry) {
    K key = checkNotNull(entry.getKey());
    V value = checkNotNull(entry.getValue());
    if (map.containsKey(key)) {
      // When a collision happens, the colliding entry is the first entry
      // of the tail map.
      Entry<K, V> previousEntry = map.tailMap(key).entrySet().iterator().next();

                    + gasLocations.entrySet().stream()
                            .map(e -> e.getKey() + " defined on lines "
                                    + e.getValue().stream()
                                            .map(l -> String.valueOf(l.getLineNumber()))
                                            .collect(Collectors.joining(", ")))

    assertThrows(UnsupportedOperationException.class, () -> map.putAll(ImmutableMap.of("b", "2")));

    assertThrows(
        UnsupportedOperationException.class,
        () -> map.entrySet().iterator().next().setValue("one"));
  }

  public void testTransformRemoveEntry() {
    Map<String, Integer> underlying = new HashMap<>();
    underlying.put("a", 1);

        ArgumentCaptor<byte[]> cap = ArgumentCaptor.forClass(byte[].class);
        verify(this.mechContext, times(1)).initSecContext(cap.capture(), eq(0), eq(0));
        assertEquals(0, cap.getValue().length, "Optimistic token must be zero-length");
    }

    @ParameterizedTest
    @ValueSource(bytes = { 0x00, 0x7F, (byte) 0xFF })
    @DisplayName("initSecContext throws on invalid token type")

      BiMap<Country, String> result = EnumHashBiMap.create(Country.class);
      for (Object o : entries) {
        Entry<Country, String> entry = (Entry<Country, String>) o;
        result.put(entry.getKey(), entry.getValue());
      }
      return result;
    }

    @Override
    public SampleElements<Entry<Country, String>> samples() {
      return new SampleElements<>(
          immutableEntry(Country.CANADA, "DOLLAR"),

    expectAdded(nullKeyValueEntry);
  }

  @CanIgnoreReturnValue
  private V put(Entry<K, V> entry) {
    return getMap().put(entry.getKey(), entry.getValue());
  }

  /**
   * Returns the {@link Method} instance for {@link #testPut_nullKeyUnsupported()} so that tests of
   * {@link java.util.TreeMap} can suppress it with {@code

                Interpolation nt = new Interpolation(pa, interpolator::interpolate);
                nt.performFor(pa.getName(), "name", pa::setName);
                nt.performFor(pa.getValue(), "value", pa::setValue);
            });
            a.map(Activation::getJdk).ifPresent(ja -> new Interpolation(activation, interpolator::interpolate)
                    .performFor(ja, "jdk", activation::setJdk));
        }

        scriptCache = CacheBuilder.newBuilder()
                .maximumSize(scriptCacheSize)
                .removalListener((final RemovalNotification<String, CachedScript> notification) -> {
                    notification.getValue().close();
                })
                .build();
        if (oldCache != null) {
            oldCache.invalidateAll();
        }
    }

    /**

  }

  /**
   * @since 12.0
   */
  @Override
  public void putAll(Map<? extends K, ? extends V> m) {
    for (Entry<? extends K, ? extends V> entry : m.entrySet()) {
      put(entry.getKey(), entry.getValue());
    }
  }

  @Override
  public void cleanUp() {}

  @Override
  public long size() {
    throw new UnsupportedOperationException();
  }

  @Override

                if (size() > maxHandles) {
                    // Release least recently used non-persistent handle
                    if (eldest.getValue().type != HandleType.PERSISTENT) {
                        releaseHandle(eldest.getValue());
                        return true;
                    }
                }
                return false;
            }
        };
    }
}
```