}

    /**
     * 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
    public Builder<N> addNode(N node) {
      mutableGraph.addNode(node);

# ---------------
constraints.AssertFalse.message = {item} must be false.
constraints.AssertTrue.message = {item} must be true.
constraints.DecimalMax.message = {item} must be less than {value}.
constraints.DecimalMin.message = {item} must be greater than {value}.
constraints.Digits.message = {item} must be a number. (expected: <number>.<number>)
constraints.Future.message = {item} must be a future value.

# ---------------
constraints.AssertFalse.message = {item} must be false.
constraints.AssertTrue.message = {item} must be true.
constraints.DecimalMax.message = {item} must be less than {value}.
constraints.DecimalMin.message = {item} must be greater than {value}.
constraints.Digits.message = {item} must be a number. (expected: <number>.<number>)
constraints.Future.message = {item} must be a future value.

        supplied[0] = 1;
        supplied[1] = 2;

        // Release must not throw and must zero the supplied array
        assertDoesNotThrow(() -> impl.releaseBuffer(supplied));
        for (byte value : supplied) {
            assertEquals(0, value, "Released buffer must be zeroed even if not cached");
        }

        // Since cache cannot store, getBuffer must create a new buffer of configured size
        byte[] got = impl.getBuffer();

     *            A disposable resource. Must not be {@literal null}.
     */
    public static synchronized void addFirst(final Disposable disposable) {
        assertArgumentNotNull("disposable", disposable);
        disposables.addFirst(disposable);
    }

    /**
     * Unregisters a disposable resource.
     *
     * @param disposable
     *            A disposable resource. Must not be {@literal null}.
     */

      assertTrue(item + " must not be Object#equals to null", !item.equals(null));
      assertTrue(
          item + " must not be Object#equals to an arbitrary object of another class",
          !item.equals(NotAnInstance.EQUAL_TO_NOTHING));
      assertTrue(item + " must be Object#equals to itself", item.equals(item));
      assertEquals(
          "the Object#hashCode of " + item + " must be consistent",
          item.hashCode(),

          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
    public ImmutableValueGraph.Builder<N, V> addNode(N node) {

     *
     * @param parser
     *            The {@link SAXParser} to use. Must not be {@literal null}.
     * @param inputSource
     *            The {@link InputSource} containing the content to be parsed. Must not be {@literal null}.
     * @param handler
     *            The SAX {@link DefaultHandler} to use. Must not be {@literal null}.
     */

    /**
     * Do not instantiate.
     */
    protected PreparedStatementUtil() {
    }

    /**
     * Executes the query.
     *
     * @param ps
     *            {@link PreparedStatement}. Must not be {@literal null}.
     * @return {@link ResultSet}
     * @throws SQLRuntimeException
     *             If a {@link SQLException} occurs.
     */

   * {@code edge} will be undirected in this graph.
   *
   * <p>If this graph is directed, {@code endpoints} must be ordered.
   *
   * <p><b>{@code edge} must be unique to this graph</b>, just as a {@code Map} key must be. It must
   * also be non-null.
   *
   * <p>If either or both endpoints are not already present in this graph, this method will silently