public void testForUriStringBad() {
    assertThrows(IllegalArgumentException.class, () -> InetAddresses.forUriString(""));

    assertThrows(
        IllegalArgumentException.class, () -> InetAddresses.forUriString("192.168.999.888"));

    assertThrows(
        IllegalArgumentException.class, () -> InetAddresses.forUriString("www.google.com"));

    assertThrows(IllegalArgumentException.class, () -> InetAddresses.forUriString("[1:2e]"));

        final FessAdminAction action = createAction();
        assertThrows(IllegalArgumentException.class, () -> action.validateFilePath(""));
    }

    @Test
    public void test_validateFilePath_nullPath() {
        final FessAdminAction action = createAction();
        assertThrows(IllegalArgumentException.class, () -> action.validateFilePath(null));
    }

    @Test

        "1.2.3" | "1.2.4"
    }

    def "invalid version format is rejected"() {
        when:
        ReleasedVersionsHelperKt.bumpPatchVersion(version)

        then:
        thrown(IllegalArgumentException)

        where:
        version << ["9.4", "9", "9.4.0.1", "not.a.version", "9.4.0-SNAPSHOT"]
    }

   * possible.
   *
   * @param value a value between 0 and 2<sup>32</sup>-1 inclusive
   * @return the {@code int} value that, when treated as unsigned, equals {@code value}
   * @throws IllegalArgumentException if {@code value} is negative or greater than or equal to
   *     2<sup>32</sup>
   * @since 21.0
   */
  public static int checkedCast(long value) {

      checkNotNull(node);
      throw new IllegalArgumentException(String.format(NODE_NOT_IN_GRAPH, node));
    }
    return connections;
  }

  final N checkedReferenceNode(E edge) {
    N referenceNode = edgeToReferenceNode.get(edge);
    if (referenceNode == null) {
      checkNotNull(edge);
      throw new IllegalArgumentException(String.format(EDGE_NOT_IN_GRAPH, edge));
    }

    this.allowsSelfLoops = allowsSelfLoops;
    return this;
  }

  /**
   * Specifies the expected number of nodes in the graph.
   *
   * @throws IllegalArgumentException if {@code expectedNodeCount} is negative
   */
  @CanIgnoreReturnValue
  public GraphBuilder<N> expectedNodeCount(int expectedNodeCount) {
    this.expectedNodeCount = checkNonNegative(expectedNodeCount);

  }

  /**
   * Creates an {@code MonitorBasedArrayBlockingQueue} with the given (fixed) capacity and default
   * access policy.
   *
   * @param capacity the capacity of this queue
   * @throws IllegalArgumentException if {@code capacity} is less than 1
   */
  public MonitorBasedArrayBlockingQueue(int capacity) {
    this(capacity, false);
  }

  /**

    this.allowsSelfLoops = allowsSelfLoops;
    return this;
  }

  /**
   * Specifies the expected number of nodes in the graph.
   *
   * @throws IllegalArgumentException if {@code expectedNodeCount} is negative
   */
  @CanIgnoreReturnValue
  public ValueGraphBuilder<N, V> expectedNodeCount(int expectedNodeCount) {
    this.expectedNodeCount = checkNonNegative(expectedNodeCount);

   *
   * @param array a <i>nonempty</i> array of {@code float} values
   * @return the value present in {@code array} that is less than or equal to every other value in
   *     the array
   * @throws IllegalArgumentException if {@code array} is empty
   */
  @GwtIncompatible(
      "Available in GWT! Annotation is to avoid conflict with GWT specialization of base class.")
  public static float min(float... array) {

    this.allowsSelfLoops = allowsSelfLoops;
    return this;
  }

  /**
   * Specifies the expected number of nodes in the network.
   *
   * @throws IllegalArgumentException if {@code expectedNodeCount} is negative
   */
  @CanIgnoreReturnValue
  public NetworkBuilder<N, E> expectedNodeCount(int expectedNodeCount) {
    this.expectedNodeCount = checkNonNegative(expectedNodeCount);