*/
  @CanIgnoreReturnValue
  boolean addNode(N node);

  /**
   * Adds an edge connecting {@code nodeU} to {@code nodeV} if one is not already present, and sets
   * a value for that edge to {@code value} (overwriting the existing value, if any).
   *
   * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be
   * undirected.
   *

                  }

                  @Override
                  public List<String> order(List<String> insertionOrder) {
                    return new ArrayList<>(Sets.newTreeSet(insertionOrder));
                  }
                })
            .named("ForwardingNavigableSet[SafeTreeSet] with standard implementations")
            .withFeatures(
                CollectionSize.ANY,

    assertFalse(
        "Two Sets should not be equal if exactly one of them contains null.",
        getSet().equals(other));
  }

  @CollectionSize.Require(absent = CollectionSize.ZERO)
  public void testEquals_smallerSet() {
    Collection<E> fewerElements = getSampleElements(getNumElements() - 1);
    assertFalse(
        "Sets of different sizes should not be equal.",

    assertFalse(
        "Two Sets should not be equal if exactly one of them contains null.",
        getSet().equals(other));
  }

  @CollectionSize.Require(absent = CollectionSize.ZERO)
  public void testEquals_smallerSet() {
    Collection<E> fewerElements = getSampleElements(getNumElements() - 1);
    assertFalse(
        "Sets of different sizes should not be equal.",

  private static final int[] binomial = new int[ARRAY_SIZE];
  private static final int[] positive = new int[ARRAY_SIZE];
  private static final int[] nonnegative = new int[ARRAY_SIZE];
  private static final int[] ints = new int[ARRAY_SIZE];

  @BeforeExperiment
  void setUp() {
    for (int i = 0; i < ARRAY_SIZE; i++) {
      exponent[i] = randomExponent();
      factorial[i] = RANDOM_SOURCE.nextInt(50);

        return getProperties().toString();
    }

    @Override
    public Collection<Object> values() {
        return getProperties().values();
    }

    /**
     * Sets the check interval for file modifications.
     *
     * @param checkInterval
     *            The new check interval in milliseconds.
     */
    public void setCheckInterval(final long checkInterval) {

        }

        /**
         * Gets the filter name for this SPNEGO configuration.
         *
         * @return The fully qualified class name of SpnegoAuthenticator
         */
        @Override
        public String getFilterName() {
            return SpnegoAuthenticator.class.getName();
        }

        /**
         * Gets the servlet context. This operation is not supported.
         *

     * <li>If <code>type</code> is a parameterized type, its raw type is returned.</li>
     * <li>If <code>type</code> is a wildcard type, its (first) upper bound is returned.</li>
     * <li>If <code>type</code> is a type variable and is a key in the given map, its actual type argument is returned.</li>
     * <li>If <code>type</code> is a type variable and is not a key in the given map, its (first) upper bound is returned.</li>

            }
            return null;
        }
        return session;
    }

    /**
     * Gets a session by ID.
     *
     * @param sessionId the session ID
     * @return the session, or null if not found or expired
     */
    public ChatSession getSession(final String sessionId) {

@NullUnmarked
public final class SetsFilterSortedSetTest
    extends AbstractFilteredSortedSetTest<SortedSet<Integer>> {
  @Override
  SortedSet<Integer> createUnfiltered(Iterable<Integer> contents) {
    TreeSet<Integer> result = Sets.newTreeSet(contents);
    // we have to make the result not Navigable
    return new ForwardingSortedSet<Integer>() {
      @Override
      protected SortedSet<Integer> delegate() {
        return result;
      }