*/
    @Nonnull
    Optional<Path> getPath();

    /**
     * Gets the source of the project to build.
     * This is an alternative to specifying a path, allowing the project to be built from
     * a model source such as a string or input stream.
     *
     * @return an optional containing the source of the project, or empty if not specified
     */
    @Nonnull

   *     / value map
   * @param factory supplier of new, empty maps that will each hold all column key / value mappings
   *     for a given row key
   * @throws IllegalArgumentException if {@code backingMap} is not empty
   * @since 10.0
   */
  public static <R, C, V> Table<R, C, V> newCustomTable(

        assertNotNull(creator1);
        assertNotNull(creator2);
        assertNotSame(creator1, creator2);
    }

    // Test with empty strings
    public void test_emptyStrings() {
        ComponentUtil.setFessConfig(new FessConfig.SimpleImpl() {
            private static final long serialVersionUID = 1L;

            @Override

   * added.
   *
   * @throws NullPointerException if {@code exceptions} is null
   * @throws IllegalArgumentException if {@code exceptions} is empty
   */
  static RuntimeException create(Collection<? extends Throwable> exceptions) {
    if (exceptions.size() == 0) {
      throw new IllegalArgumentException("Can't create an ExceptionCollection with no exceptions");

    public CharSource asCharSource(Charset charset) {
      checkNotNull(charset);
      return CharSource.empty();
    }

    @Override
    public byte[] read() {
      return bytes; // length is 0, no need to clone
    }

    @Override
    public String toString() {
      return "ByteSource.empty()";
    }
  }

  private static final class ConcatenatedByteSource extends ByteSource {

      if (!finished) {
        // processRemaining does teardown we always want to do -- the folding together of the four
        // rolling CRCs.  So we call it on an empty ByteBuffer if we didn't already.
        processRemaining(EMPTY);
      }
      return HashCode.fromInt(~crc0);
    }

    static final int[] byteTable = {
      0x00000000, 0xf26b8303, 0xe13b70f7, 0x1350f3f4, 0xc79a971f, 0x35f1141c,

      return this;
    }

    // Holder object for values that might be null and/or empty.
    static class ValueHolder {
      @Nullable String name;
      @Nullable Object value;
      @Nullable ValueHolder next;
    }

    /**
     * Holder object for values that cannot be null or empty (will be printed unconditionally). This

        assertFalse(rule2.match(responseData));
        assertTrue(rule3.match(responseData));
    }

    /**
     * Test rule with empty string ID
     */
    public void test_emptyStringRuleId() {
        TestRule rule = new TestRule("", new TestResponseProcessor("empty"), true);

        assertEquals("", rule.getRuleId());
        assertNotNull(rule.getResponseProcessor());

  // Graph query methods

  /**
   * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
   * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
   * and ending with the same node.
   *
   * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
   */
  public static <N> boolean hasCycle(Graph<N> graph) {

  // Graph query methods

  /**
   * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
   * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
   * and ending with the same node.
   *
   * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
   */
  public static <N> boolean hasCycle(Graph<N> graph) {