expectAdded(entry(null, v3()));
  }

  @MapFeature.Require(SUPPORTS_PUT)
  @CollectionSize.Require(absent = ZERO)
  public void testMergePresent() {
    assertEquals(
        "Map.merge(present, value, function) should return function result",
        v4(),
        getMap()
            .merge(
                k0(),
                v3(),
                (oldV, newV) -> {

        assertTrue(
                !message.contains("[WARNING]") || message.contains("[WARNING] Deprecated plugin usage"),
                "Warnings should be filtered when errors are present or shown if explicitly included");
    }

    @Test
    void testExceptionMessageWithOnlyWarnings() {
        List<ProjectBuildingResult> results = new ArrayList<>();

import com.google.caliper.Benchmark;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import org.jspecify.annotations.NullUnmarked;

/**
 * Benchmark for HashMultiset.add for an already-present element.
 *
 * @author Louis Wasserman
 */
@NullUnmarked
public class HashMultisetAddPresentBenchmark {
  private static final int ARRAY_MASK = 0x0ffff;
  private static final int ARRAY_SIZE = 0x10000;

    if (containedKey && Objects.equals(value, get(key))) {
      return value;
    }
    if (force) {
      inverse().remove(value);
    } else {
      checkArgument(!containsValue(value), "value already present: %s", value);
    }
    V oldValue = delegate.put(key, value);
    updateInverseMap(key, containedKey, oldValue, value);
    return oldValue;
  }

  private void updateInverseMap(

    expectAdded(entry(null, v3()));
  }

  @MapFeature.Require(SUPPORTS_PUT)
  @CollectionSize.Require(absent = ZERO)
  public void testMergePresent() {
    assertEquals(
        "Map.merge(present, value, function) should return function result",
        v4(),
        getMap()
            .merge(
                k0(),
                v3(),
                (oldV, newV) -> {

   * endpoints are unordered and the graph is directed; it simply returns {@code false}. This is for
   * consistency with the behavior of {@link Collection#contains(Object)} (which does not generally
   * throw if the object cannot be present in the collection), and the desire to have this method's
   * behavior be compatible with {@code edges().contains(endpoints)}.
   *
   * @since 27.1
   */
  @Override

		// non-free version if one is present
		{
			vol:          newtierfi.Volume,
			name:         newtierfi.Name,
			inclFreeVers: true,
			afterFn:      xl.DeleteVersion,
			expectedFree: false,
		},
		// ToFileInfo with 'inclFreeVers = true' must return the latest free
		// version when no non-free versions are present.
		{
			vol:          newtierfi.Volume,

        + nodes()
        + ", edges: "
        + edgeIncidentNodesMap(this);
  }

  /**
   * Returns a {@link Set} whose methods throw {@link IllegalStateException} when the given edge is
   * not present in this network.
   *
   * @since 33.1.0
   */
  protected final <T> Set<T> edgeInvalidatableSet(Set<T> set, E edge) {
    return InvalidatableSet.of(

/**
 * Describes whether a target should be activated or not, and if that is required or optional.
 *
 * @param active Should the target be active?
 * @param optional Should the build continue if the target is not present?
 * @param recurse Should the target be activated and its children be activated?
 */
public record ActivationSettings(boolean active, boolean optional, boolean recurse) {

    /**
     * Default maximum read/write size (1MB)
     */
    public static final int DEFAULT_MAX_READ_WRITE_SIZE = 1048576; // 1MB

    /**
     * Private constructor to prevent instantiation
     */
    private RdmaCapabilities() {
        // Utility class
    }