Collector<T, A, R> collector, BiPredicate<? super R, ? super R> equivalence) {
    this.collector = checkNotNull(collector);
    this.equivalence = checkNotNull(equivalence);
  }

  /**
   * Different orderings for combining the elements of an input array, which must all produce the
   * same result.
   */
  enum CollectStrategy {
    /** Get one accumulator and accumulate the elements into it sequentially. */
    SEQUENTIAL {

- Updated static pods are restarted 2s faster by correcting a safe but non-optimal ordering bug. ([#116690](https://github.com/kubernetes/kubernetes/pull/116690), [@smarterclayton](https://github.com/smarterclayton)) [SIG Node]

    assertThat(network).isEqualTo(g2);
  }

  // Node/edge sets and node/edge connections are the same, but edge order differs.
  // (In this case the networks are considered equivalent; the edge add orderings are irrelevant.)
  @Test
  public void equivalent_edgeAddOrdersDiffer() {
    NetworkBuilder<Integer, String> builder =
        NetworkBuilder.from(network).allowsParallelEdges(true);

    assertThat(network).isEqualTo(g2);
  }

  // Node/edge sets and node/edge connections are the same, but edge order differs.
  // (In this case the networks are considered equivalent; the edge add orderings are irrelevant.)
  @Test
  public void equivalent_edgeAddOrdersDiffer() {
    NetworkBuilder<Integer, String> builder =
        NetworkBuilder.from(network).allowsParallelEdges(true);

    <!-- The priority is 60, as .webarchive files often contain
         (X)HTML content. The bplist magic must trump the XHTML
         magics further within the file. This must also be
         independent of the internal ordering of patterns within
         MimeTypes -->
    <magic priority="60">
      <match value="bplist" type="string" offset="0"/>
    </magic>
  </mime-type>

  <mime-type type="application/x-plist">

      Collector<T, A, R> collector, BiPredicate<? super R, ? super R> equivalence) {
    this.collector = checkNotNull(collector);
    this.equivalence = checkNotNull(equivalence);
  }

  /**
   * Different orderings for combining the elements of an input array, which must all produce the
   * same result.
   */
  @IgnoreJRERequirement // *should* be redundant with the one on CollectorTester
  enum CollectStrategy {

        assertEquals(WinError.WINERR_CODES.length, WinError.WINERR_MESSAGES.length, "Codes/messages length mismatch");

        // Exact content check to guard against accidental reordering or drift
        assertArrayEquals(
                new int[] { WinError.ERROR_SUCCESS, WinError.ERROR_ACCESS_DENIED, WinError.ERROR_REQ_NOT_ACCEP, WinError.ERROR_BAD_PIPE,

 *   <li>Inserting existing {@link UrlQueueImpl} objects into the queue.</li>
 *   <li>Deleting URL queues associated with a session.</li>
 *   <li>Deleting all URL queues.</li>
 *   <li>Offering a list of URLs to the queue, ensuring duplicates are not added.</li>
 *   <li>Polling (retrieving and removing) a URL from the queue.</li>
 *   <li>Saving the session (currently a no-op).</li>

must be distributed under the terms of Sections 1 and 2 above on a
medium customarily used for software interchange.

  If distribution of object code is made by offering access to copy
from a designated place, then offering equivalent access to copy the
source code from the same place satisfies the requirement to
distribute the source code, even though third parties are not

#### Updates to existing commands
* Printing and output
  * Import a numeric ordering sorting library and use it in the sorting printer. ([#40746](https://github.com/kubernetes/kubernetes/pull/40746), [@matthyx](https://github.com/matthyx))