*       timeout point. Similarly, a SMALL is always discriminable as larger than SHORT and smaller
 *       than MEDIUM. And so on. These constants are set to conservative values, but even so, if
 *       there is ever any doubt, they can all be increased in one spot to rerun tests on slower
 *       platforms.
 *   <li>All threads generated must be joined inside each test case method (or {@code fail} to do

        synchronized (sid_cache) {
            try {
                handle = DcerpcHandle.getHandle("ncacn_np:" + server + "[\\PIPE\\lsarpc]", auth);
                // NetApp doesn't like the 'generic' access mask values
                policyHandle = new LsaPolicyHandle(handle, null, 0x00000001);
                rpc = new MsrpcQueryInformationPolicy(policyHandle, (short) lsarpc.POLICY_INFO_ACCOUNT_DOMAIN, info);

    Object key = new Object();
    assertThat(cache.getUnchecked(key)).isNotNull();

    CacheTesting.simulateValueReclamation(cache, key);

    // this blocks if computation can't deal with partially-collected values
    assertThat(cache.getUnchecked(key)).isNotNull();
    assertThat(cache.size()).isEqualTo(1);
    assertThat(countingLoader.getCount()).isEqualTo(2);

    CacheTesting.simulateValueReclamation(cache, key);

            uniqueCounters.add(bytesToHex(counter));
        }

        // All nonces should be unique (high entropy from SecureRandom)
        assertEquals(sampleSize, uniqueCounters.size(), "All nonces should have unique values");

        // Verify that nonces have good entropy (not predictable)
        // With SecureRandom + counter XOR, they should all be different
        Set<String> uniqueNonces = new HashSet<>();

        }

        @Test
        @DisplayName("Should sign data correctly with zero signature field")
        void testSignZeroesSignatureField() {
            // Fill signature field with non-zero values
            for (int i = 0; i < SIGNATURE_LENGTH; i++) {
                data[SIGNATURE_OFFSET + i] = (byte) 0xFF;
            }

            digest.sign(data, 0, data.length, request, response);

    Object key = new Object();
    assertThat(cache.getUnchecked(key)).isNotNull();

    CacheTesting.simulateValueReclamation(cache, key);

    // this blocks if computation can't deal with partially-collected values
    assertThat(cache.getUnchecked(key)).isNotNull();
    assertThat(cache.size()).isEqualTo(1);
    assertThat(countingLoader.getCount()).isEqualTo(2);

    CacheTesting.simulateValueReclamation(cache, key);

     * or <code>toString()</code> is called, the names will attempt to be
     * resolved. If the names cannot be resolved (e.g. due to temporary
     * network failure), the said methods will return default values (usually
     * <code>S-X-Y-Z</code> strings of fragments of).
     * <p>
     * Alternatively <code>getSecurity(true)</code> may be used to resolve all
     * SIDs together and detect network failures.
     *

  @BeforeEach
  fun reset() {
    hpackReader = newReader(bytesIn)
    hpackWriter = Hpack.Writer(4096, false, bytesOut)
  }

  /**
   * Variable-length quantity special cases strings which are longer than 127 bytes.  Values such as
   * cookies can be 4KiB, and should be possible to send.
   *
   *  http://tools.ietf.org/html/draft-ietf-httpbis-header-compression-12#section-5.2
   */
  @Test
  fun largeHeaderValue() {

     * common functionality into the superclass and read wordCount
     * and byteCount worth of data.
     *
     * We will still use the readXxxWireFormat return values to
     * indicate how many bytes(note: readParameterWordsWireFormat
     * returns bytes read and not the number of words(but the
     * wordCount member DOES store the number of words)) we

Common examples of CPU bound operations are things that require complex math processing.

For example:

* **Audio** or **image processing**.
* **Computer vision**: an image is composed of millions of pixels, each pixel has 3 values / colors, processing that normally requires computing something on those pixels, all at the same time.