List<ResolverType> order = config.getResolveOrder();
        assertEquals(4, order.size());
        assertEquals(ResolverType.RESOLVER_LMHOSTS, order.get(0));
        assertEquals(ResolverType.RESOLVER_DNS, order.get(1));
        assertEquals(ResolverType.RESOLVER_WINS, order.get(2));
        assertEquals(ResolverType.RESOLVER_BCAST, order.get(3));
    }

    @Test

        TopKSelector::offer,
        TopKSelector::combine,
        TopKSelector::topK,
        Collector.Characteristics.UNORDERED);
  }

  /**
   * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified
   * {@code Comparator}) input elements, in descending order, as an unmodifiable {@code List}. Ties
   * are broken arbitrarily.
   *
   * <p>For example:
   *
   * {@snippet :

  val clients: List<Client>,
  val ianaSuites: IanaSuites,
  val orderBy: List<SuiteId>,
) {
  fun printGoogleSheet() {
    print("name")
    for (client in clients) {
      print("\t")
      print(client.nameAndVersion)
    }
    println()
    val sortedSuites =
      ianaSuites.suites.sortedBy { ianaSuite ->
        val index = orderBy.indexOfFirst { it.matches(ianaSuite) }

  @Parameters(name = "allowsSelfLoops={0}, incidentEdgeOrder={1}")
  public static Collection<Object[]> parameters() {
    return Arrays.asList(
        new Object[][] {
          {false, ElementOrder.unordered()},
          {true, ElementOrder.unordered()},
          {false, ElementOrder.stable()},
          {true, ElementOrder.stable()},
        });
  }

  private final boolean allowsSelfLoops;

  @Parameters(name = "allowsSelfLoops={0}, incidentEdgeOrder={1}")
  public static Collection<Object[]> parameters() {
    return Arrays.asList(
        new Object[][] {
          {false, ElementOrder.unordered()},
          {true, ElementOrder.unordered()},
          {false, ElementOrder.stable()},
          {true, ElementOrder.stable()},
        });
  }

  private final boolean allowsSelfLoops;

  @Parameters(name = "allowsSelfLoops={0}, incidentEdgeOrder={1}")
  public static Collection<Object[]> parameters() {
    return Arrays.asList(
        new Object[][] {
          {false, ElementOrder.unordered()},
          {true, ElementOrder.unordered()},
          {false, ElementOrder.stable()},
          {true, ElementOrder.stable()},
        });
  }

  private final boolean allowsSelfLoops;

    void testReadParametersWireFormatNonAlignedOffset() throws Exception {
        ByteBuffer buffer = ByteBuffer.allocate(100);
        buffer.order(ByteOrder.LITTLE_ENDIAN);

        // Create notification with non-aligned nextEntryOffset
        buffer.putInt(3); // Non-aligned nextEntryOffset (not divisible by 4)

    }

    @Test
    @DisplayName("Scenario: verify interaction order across multiple calls")
    void verifyInteractionOrder() throws Exception {
        // Arrange: stub simple returns
        when(handle.hasCapability(anyInt())).thenReturn(true);

        // Act: perform a series of calls to verify order
        handle.ensureDFSResolved();
        handle.hasCapability(7);
        handle.release();

    SortedSet<String> set =
        ImmutableSortedSet.orderedBy(STRING_LENGTH)
            .add("in", "the", "quick", "jumped", "over", "a")
            .build();
    assertThat(set).containsExactly("a", "in", "the", "over", "quick", "jumped").inOrder();
  }

  public void testExplicit_ordering_dupes() {
    SortedSet<String> set =
        ImmutableSortedSet.orderedBy(STRING_LENGTH)

  /** Returns an iterable whose iterator returns the given elements in order. */
  public static <E extends @Nullable Object> MinimalIterable<E> of(E... elements) {
    // Make sure to get an unmodifiable iterator
    return new MinimalIterable<>(asList(elements).iterator());
  }

  /**
   * Returns an iterable whose iterator returns the given elements in order. The elements are copied