}

    @Test
    @DisplayName("parse sets mechanismToken and flags parsed")
    void parseSetsMechanismToken() throws IOException {
        TestSpnegoToken t = new TestSpnegoToken();
        byte[] raw = new byte[] { 5, 6 };
        t.parse(raw);
        assertTrue(t.isParsed(), "parse should mark parsed");
        assertArrayEquals(raw, t.getMechanismToken(), "parse should set mechanismToken");
    }

    @Test

package com.google.common.graph;

import java.util.Collection;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * An interface for <a
 * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data,
 * whose edges have associated non-unique values.
 *
 * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes.
 *

    }

    // Ensures set(null) resets the buffer to empty and does not NPE
    @Test
    @DisplayName("set(null) resets to empty")
    void set_null_resetsToEmpty() {
        // Arrange
        SecurityBlob blob = new SecurityBlob(new byte[] { 1, 2, 3 });

        // Act
        blob.set(null);

        // Assert

        /*
         * We can't inherit the normal implementation (which calls
         * Sets.removeAllImpl(Set, *Collection*)) because, under some
         * circumstances, it attempts to call columnKeySet().iterator().remove,
         * which is unsupported.
         */
        checkNotNull(c);
        return Sets.removeAllImpl(this, c.iterator());
      }

      @Override

     */
    @Override
    public boolean isFragment() {
        return queryBuilder.isFragment();
    }

    /**
     * Sets the query name.
     *
     * @param queryName the query name to set
     * @return the query builder
     */
    @Override
    public QueryBuilder queryName(final String queryName) {
        return queryBuilder.queryName(queryName);
    }

      }
    }
    // If we get here then the Listener TOMBSTONE was set, which means the future is done, call
    // the listener.
    executeListener(listener, executor);
  }

  /**
   * Sets the result of this {@code Future} unless this {@code Future} has already been cancelled or
   * set (including {@linkplain #setFuture set asynchronously}). When a call to this method returns,

            }
        }
        return -1;
    }

    /**
     * Gets the set of session IDs for all currently running processes.
     *
     * @return set of session IDs for running processes
     */
    public Set<String> getRunningSessionIdSet() {
        return runningProcessMap.keySet();
    }

    /**
     * Sets the timeout for process destruction.
     *

     * Gets the number of credits this request requires.
     *
     * @return number of credits this request requires
     */
    int getCreditCost();

    /**
     * Sets the number of request credits.
     *
     * @param credits the number of credits to set
     */
    void setRequestCredits(int credits);

    /**
     * Checks if this is a cancel request.
     *
     * @return whether this is a cancel request
     */

      @SuppressWarnings("unchecked") // all supported methods are covariant
      ImmutableSet<E> set = (ImmutableSet<E>) elements;
      if (!set.isPartialView()) {
        return set;
      }
    }
    Object[] array = elements.toArray();
    return construct(array.length, array);
  }

  /**
   * Returns an immutable set containing each of {@code elements}, minus duplicates, in the order

import java.util.Collection;
import java.util.Set;
import org.jspecify.annotations.Nullable;

/**
 * An interface for <a
 * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data,
 * whose edges are anonymous entities with no identity or information of their own.
 *
 * <p>A graph is composed of a set of nodes and a set of edges connecting pairs of nodes.
 *