private TestUtils() {
        // Utility class
    }

    /**
     * Creates a mock UpgradeContext with default settings.
     *
     * @return a mock UpgradeContext
     */
    public static UpgradeContext createMockContext() {
        return createMockContext(Paths.get("/project"));
    }

    /**
     * Creates a mock UpgradeContext with the specified working directory.
     *

    }
  }

  /**
   * Returns a builder that creates immutable sorted maps whose keys are ordered by their natural
   * ordering. The sorted maps use {@link Ordering#natural()} as the comparator.
   */
  public static <K extends Comparable<?>, V> Builder<K, V> naturalOrder() {
    return new Builder<>(Ordering.natural());
  }

  /**
   * Returns a builder that creates immutable sorted maps with an explicit comparator. If the

  /**
   * Creates a new min-max priority queue with default settings: natural order, no maximum size, no
   * initial contents, and an initial expected size of 11.
   */
  public static <E extends Comparable<E>> MinMaxPriorityQueue<E> create() {
    return new Builder<Comparable<E>>(Ordering.natural()).create();
  }

  /**

     * now-deprecated {@link #transitiveClosure(Graph)} method.
     */
    ADD_SELF_LOOPS_ALWAYS,
    /**
     * Add a self-loop to each node that is incident to a cycle of length one or greater in the
     * original graph.
     */
    ADD_SELF_LOOPS_FOR_CYCLES
  }

  /**
   * Returns the set of nodes that are reachable from {@code node}. Specifically, it returns all

  /**
   * Creates a new min-max priority queue with default settings: natural order, no maximum size, no
   * initial contents, and an initial expected size of 11.
   */
  public static <E extends Comparable<E>> MinMaxPriorityQueue<E> create() {
    return new Builder<Comparable<E>>(Ordering.natural()).create();
  }

  /**

		if !ok || p.readers[i] == nil {
			continue
		}
		if i == next {
			next++
			continue
		}
		// Move reader with index i to index next.
		// Do this by swapping next and i
		p.readers[next], p.readers[i] = p.readers[i], p.readers[next]
		p.readerToBuf[next] = i
		p.readerToBuf[i] = next
		next++
	}
}

// Returns if buf can be erasure decoded.

    private static final long serialVersionUID = -2154525994315946504L;

    /**
     * Creates a {@link ClIllegalStateException}.
     */
    public ClIllegalStateException() {
        super();
    }

    /**
     * Creates a {@link ClIllegalStateException}.
     *
     * @param message
     *            Message
     */

 * <ul>
 *   <li>{@link #suggest()}: Creates a new SuggestRequestBuilder for querying suggestions.</li>
 *   <li>{@link #popularWords()}: Creates a new PopularWordsRequestBuilder for querying popular words.</li>
 *   <li>{@link #refresh()}: Refreshes the suggestion indices.</li>
 *   <li>{@link #shutdown()}: Shuts down the thread pool.</li>
 *   <li>{@link #createIndexIfNothing()}: Creates a new index if no index exists.</li>

     */
    protected SchemaFactoryUtil() {
    }

    /**
     * Creates a {@link SchemaFactory} for W3C XML Schema.
     *
     * @return a {@link SchemaFactory} for W3C XML Schema
     */
    public static SchemaFactory newW3cXmlSchemaFactory() {
        return newW3cXmlSchemaFactory(false);
    }

    /**
     * Creates a {@link SchemaFactory} for W3C XML Schema.
     *
     * @param external

     */
    public LlmMessage() {
    }

    /**
     * Creates a new message with the specified role and content.
     *
     * @param role the message role
     * @param content the message content
     */
    public LlmMessage(final String role, final String content) {
        this.role = role;
        this.content = content;
    }

    /**
     * Creates a system message with the specified content.
     *