checkNotNull(keyFunction);
    checkNotNull(valueFunction);
    /*
     * We will always fail if there are duplicate keys, and the keys are always sorted by
     * the Comparator, so the entries can come in an arbitrary order -- so we report UNORDERED.
     */
    return Collector.of(
        () -> new ImmutableSortedMap.Builder<K, V>(comparator),
        (builder, input) -> builder.put(keyFunction.apply(input), valueFunction.apply(input)),

  // type V, PRED (representing predecessor), or an instance of type V (representing successor).
  private final Map<N, Object> adjacentNodeValues;

  /**
   * All node connections in this graph, in edge insertion order.
   *
   * <p>Note: This field and {@link #adjacentNodeValues} cannot be combined into a single
   * LinkedHashMap because one target node may be mapped to both a predecessor and a successor. A

 * {@code ObjectCountHashMap} minimizes object allocation and reduces memory footprint.
 *
 * <p>In the absence of element deletions, this will iterate over elements in insertion order.
 */
@GwtCompatible
@NullMarked
class ObjectCountHashMap<K extends @Nullable Object> {

  /** Creates an empty {@code ObjectCountHashMap} instance. */

   * higher value than you need can waste space and time, and a significantly lower value can lead
   * to thread contention. But overestimates and underestimates within an order of magnitude do not
   * usually have much noticeable impact. A value of one permits only one thread to modify the cache
   * at a time, but since read operations and cache loading computations can proceed concurrently,

 * of the Bloom filters that use them, thus they must be preserved as is (no updates allowed, only
 * introduction of new versions).
 *
 * <p>Important: the order of the constants cannot change, and they cannot be deleted - we depend on
 * their ordinal for BloomFilter serialization.
 *
 * @author Dimitris Andreou
 * @author Kurt Alfred Kluever
 */

        assertEquals("https://api.example.com/users", data.getUrl());
        assertEquals(1.2f, data.getWeight(), 0.001f);
    }

    public void test_orderIndependence() {
        // Test that order of method calls doesn't matter
        RequestData data1 = RequestDataBuilder.newRequestData().url("https://example.com").weight(1.5f).get().build();

 * we recommend reading the section on Access Control in Keith Brown's
 * "The .NET Developer's Guide to Windows Security" (which is also
 * available online).
 * <p>
 * Direct ACEs are evaluated first in order. The SID of the user performing
 * the operation and the desired access bits are compared to the SID
 * and access mask of each ACE. If the SID matches, the allow/deny flags
 * and access mask are considered. If the ACE is a "deny"

        return AbstractBaseGraph.this.nodeOrder();
      }

      @Override
      public ElementOrder<EndpointPair<N>> edgeOrder() {
        return ElementOrder.unordered(); // Graph doesn't define edge order
      }

      @Override
      public Set<N> adjacentNodes(N node) {
        return AbstractBaseGraph.this.adjacentNodes(node);
      }

      @Override
      public Set<N> predecessors(N node) {

        NegTokenInit init = new NegTokenInit(mechs, 0, null, null);

        NegTokenInit parsed = new NegTokenInit(init.toByteArray());
        assertArrayEquals(mechs, parsed.getMechanisms(), "Mechanism order must be preserved");
    }

    @Test
    @DisplayName("setContextFlag toggles bits correctly")
    void testSetAndGetContextFlags() {
        NegTokenInit init = new NegTokenInit();

         */
        @Override
        public int compareTo(final PathPattern other) {
            // Higher priority length comes first (descending order)
            return Integer.compare(other.priorityLength, this.priorityLength);
        }

        @Override
        public String toString() {