/**
   * Adds {@code node} if it is not already present.
   *
   * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null.
   *
   * @return {@code true} if the graph was modified as a result of this call
   */
  @CanIgnoreReturnValue
  boolean addNode(N node);

  /**
   * Adds an edge connecting {@code nodeU} to {@code nodeV} if one is not already present.
   *

  /**
   * Adds {@code node} if it is not already present.
   *
   * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null.
   *
   * @return {@code true} if the graph was modified as a result of this call
   */
  @CanIgnoreReturnValue
  boolean addNode(N node);

  /**
   * Adds an edge connecting {@code nodeU} to {@code nodeV} if one is not already present, and sets

        assertEquals("Retention should be RUNTIME", RetentionPolicy.RUNTIME, retention.value());
    }

    // Test annotation target elements
    @Test
    public void test_targetElements() {
        final Target target = CustomSize.class.getAnnotation(Target.class);
        assertNotNull(target, "Target annotation should be present");

        assertEquals("Retention should be RUNTIME", RetentionPolicy.RUNTIME, retention.value());
    }

    // Test annotation target elements
    @Test
    public void test_targetElements() {
        final Target target = UriType.class.getAnnotation(Target.class);
        assertNotNull(target, "Target annotation should be present");

  /**
   * Removes {@code node} if it is present; all edges incident to {@code node} will also be removed.
   *
   * @return {@code true} if the network was modified as a result of this call
   */
  @CanIgnoreReturnValue
  boolean removeNode(N node);

  /**
   * Removes {@code edge} from this network, if it is present.
   *

    }

    /**
     * Adds an edge connecting {@code nodeU} to {@code nodeV} if one is not already present.
     *
     * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be
     * undirected.
     *
     * <p>If {@code nodeU} and {@code nodeV} are not already present in this graph, this method will
     * silently {@link #addNode(Object) add} {@code nodeU} and {@code nodeV} to the graph.

      this.mutableValueGraph =
          graphBuilder.copy().incidentEdgeOrder(ElementOrder.<N>stable()).build();
    }

    /**
     * Adds {@code node} if it is not already present.
     *
     * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null.
     *
     * @return this {@code Builder} object
     */
    @CanIgnoreReturnValue

        assertNotNull(option);

        // Verify the field naming is set to CAMEL_TO_LOWER_SNAKE
        OptionalThing<JsonFieldNaming> fieldNamingOpt = option.getFieldNaming();
        assertTrue("Field naming should be present", fieldNamingOpt.isPresent());
        assertEquals(JsonFieldNaming.CAMEL_TO_LOWER_SNAKE, fieldNamingOpt.get());
    }

    @Test
    public void test_provideMappingOption_notNull() {

        .any(gradle.startParameter.taskNames::contains)


/**
 * Returns a new provider that takes its value from at most one
 * of the given providers. If no input provider is present, the output
 * provider will not be present. If more than one input provider
 * has a value specified, the resulting provider will throw an
 * exception when queried.
 */
fun <T: Any> atMostOneOf(vararg providers: Provider<T>): Provider<T> {

    public void test_ofNullable_optionalEntityBehavior() {
        // Test with present value
        String presentValue = "present";
        OptionalEntity<String> presentOptional = OptionalUtil.ofNullable(presentValue);

        assertTrue(presentOptional.isPresent());
        assertEquals("present", presentOptional.get());
        assertEquals("present", presentOptional.orElse("default"));

        // Test with null value