List<E> contents = copyToList(getMultiset());
    assertFalse(getMultiset().retainAll(singleton(e0())));
    expectContents(contents);
  }

  /**
   * Returns {@link Method} instances for the remove tests that assume multisets support duplicates
   * so that the test of {@code Multisets.forSet()} can suppress them.
   */
  @J2ktIncompatible
  @GwtIncompatible // reflection

    List<E> contents = copyToList(getMultiset());
    assertFalse(getMultiset().retainAll(singleton(e0())));
    expectContents(contents);
  }

  /**
   * Returns {@link Method} instances for the remove tests that assume multisets support duplicates
   * so that the test of {@code Multisets.forSet()} can suppress them.
   */
  @J2ktIncompatible
  @GwtIncompatible // reflection

 * multiple threads.
 *
 * <p>Because, in general, escaping operates on the code points of a string and not on its
 * individual {@code char} values, it is not safe to assume that {@code escape(s)} is equivalent to
 * {@code escape(s.substring(0, n)) + escape(s.substring(n))} for arbitrary {@code n}. This is
 * because of the possibility of splitting a surrogate pair. The only case in which it is safe to

        String retrievedMessage = exception.getMessage();
        assertEquals(testMessage, retrievedMessage);

        // Test that multiple calls return the same message
        assertEquals(retrievedMessage, exception.getMessage());
        assertEquals(retrievedMessage, exception.getMessage());
    }

    public void test_fillInStackTrace() {

     */
    @Nonnull
    String phase() default "";

    /**
     * Goal to fork. Note that specifying a phase overrides specifying a goal. The specified <code>goal</code> must be
     * another goal of the same plugin.
     * @return the goal
     */
    @Nonnull
    String goal() default "";

    /**
     * Lifecycle id of the lifecycle that defines {@link #phase()}. Only valid in combination with {@link #phase()}. If

    @Weak @Nullable Node<K, V> previous; // the previous node (with any key)
    @Nullable Node<K, V> nextSibling; // the next node with the same key
    @Weak @Nullable Node<K, V> previousSibling; // the previous node with the same key

    Node(@ParametricNullness K key, @ParametricNullness V value) {
      super(key, value);
    }
  }

        int referent1 = Encdec.dec_uint32le(buffer, 0);
        assertTrue(referent1 > 0); // Should be a positive referent ID

        ndrBuffer.reset();
        ndrBuffer.enc_ndr_referent(obj1, 2); // Same object, should get same referent
        assertEquals(4, ndrBuffer.getIndex());
        assertEquals(referent1, Encdec.dec_uint32le(buffer, 0));

        ndrBuffer.reset();

var GlobalContext, cancelGlobalContext = context.WithCancel(context.Background())

// restartProcess starts a new process passing it the active fd's. It
// doesn't fork, but starts a new process using the same environment and
// arguments as when it was originally started. This allows for a newly
// deployed binary to be started. It returns the pid of the newly started
// process when successful.
func restartProcess() error {

     * {@link #equals(Object)}, they have the same hashcode.
     *
     * @return a hash code value for this request
     */
    @Override
    int hashCode();

    /**
     * Returns {@code true} if the specified object is equal to this request.
     * Two requests are considered equal if they have the same type and all
     * significant fields are equal.
     *

    return super.asMap();
  }

  /**
   * Compares the specified object to this multimap for equality.
   *
   * <p>Two {@code ListMultimap} instances are equal if, for each key, they contain the same values
   * in the same order. If the value orderings disagree, the multimaps will not be considered equal.
   */
  @Override
  public boolean equals(@Nullable Object object) {
    return super.equals(object);
  }