}

    @Test
    @DisplayName("Constants: values match Windows error codes")
    void constants_have_expected_values() {
        // Ensure each public constant has its documented numeric value (happy path)
        assertAll(() -> assertEquals(0, WinError.ERROR_SUCCESS), () -> assertEquals(5, WinError.ERROR_ACCESS_DENIED),

  /**
   * Internal constructor. Users should use {@link PairedStatsAccumulator#snapshot}.
   *
   * <p>To ensure that the created instance obeys its contract, the parameters should satisfy the
   * following constraints. This is the callers responsibility and is not enforced here.
   *
   * <ul>
   *   <li>Both {@code xStats} and {@code yStats} must have the same {@code count}.

                    // Message below is checked for in the MNG-2199 core IT.
                    problems.add(new ModelProblemCollectorRequest(Severity.FATAL, Version.V31)
                            .setMessage("Version must be a constant")
                            .setLocation(childModel.getLocation("")));

                } else {
                    if (rawChildVersionReferencesParent(rawChildModelVersion)) {

        transaction.name = "\\MAILSLOT\\browse";
        assertEquals("\\MAILSLOT\\browse", transaction.name, "Transaction name should be changeable");
    }

    @Test
    @DisplayName("Test default buffer size constant")
    void testBufferSizeConstant() {
        assertEquals(0xFFFF, SmbComTransaction.TRANSACTION_BUF_SIZE, "TRANSACTION_BUF_SIZE should be 0xFFFF");
    }

    @Test

        assertEquals(0, unicodeHash.length);
        // ANSI hash always returns 24 bytes
        assertEquals(24, ansiHash.length);
    }

    // Test ANONYMOUS constant
    @Test
    void testAnonymousConstant() {
        assertNotNull(NtlmPasswordAuthentication.ANONYMOUS);
        assertEquals("", NtlmPasswordAuthentication.ANONYMOUS.getDomain());

 * {@link QuantilesBenchmark}. These algorithms each calculate either a single quantile or multiple
 * quantiles. All algorithms modify the dataset they are given (the cost of a copy to avoid this
 * will be constant across algorithms).
 *
 * @author Pete Gillin
 * @since 20.0
 */
@NullUnmarked
enum QuantilesAlgorithm {

  /**

    return (object == null) ? -1 : Lists.lastIndexOfImpl(this, object);
  }

  @Override
  public boolean contains(@Nullable Object object) {
    return indexOf(object) >= 0;
  }

  // constrain the return type to ImmutableList<E>

  /**
   * Returns an immutable list of the elements between the specified {@code fromIndex}, inclusive,

    <suppress checks="RegexpHeader"
              files=".*[/\\]maven[/\\]src[/\\]main[/\\]java[/\\]org[/\\]apache[/\\].+"/>

    <!-- Ignore constant name for architecture tests since we want to use snake case there -->
    <suppress checks="ConstantName"
              files=".*[/\\]architecture-test[/\\]src[/\\]test[/\\]java[/\\]org[/\\]gradle[/\\].+" />

  }

  @SuppressWarnings("unchecked")
  private static <N> GraphConnections<N, Presence> connectionsOf(Graph<N> graph, N node) {
    Function<N, Presence> edgeValueFn =
        (Function<N, Presence>) Functions.constant(Presence.EDGE_EXISTS);
    return graph.isDirected()
        ? DirectedGraphConnections.ofImmutable(node, graph.incidentEdges(node), edgeValueFn)
        : UndirectedGraphConnections.ofImmutable(

 * supported. Null keys and values are supported.
 *
 * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and
 * amortized) constant time operations. Expected in the hashtable sense (depends on the hash
 * function doing a good job of distributing the elements to the buckets to a distribution not far