* passing in unsanitized user data then a malicious user could force it. A light shuffle of the
 * data using an unpredictable seed should normally be enough to thwart this attack.
 *
 * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes
 * indexes} is generally less than the total time taken to compute each of them separately, and

                if (callCount % 2 == 0) {
                    return createMockRescorerBuilder();
                }
                return null;
            }
        };

        // Test multiple calls
        Map<String, Object> params = new HashMap<>();
        params.put("test", "value");

        assertNull(queryRescorer.evaluate(params)); // First call - odd

        // Assert
        // sendrecv for open is called once
        verify(mockDcerpcHandle, times(1)).sendrecv(any(MsrpcSamrOpenDomain.class));
        // sendrecv for close is called only once, even if close() is called multiple times
        verify(mockDcerpcHandle, times(1)).sendrecv(any(MsrpcSamrCloseHandle.class));
    }

    @Test
    void close_shouldThrowSmbExceptionOnRpcError() throws IOException {
        // Arrange

        SecretKey secretKey = keyGen.generateKey();
        Key key = new KerberosKey(null, secretKey.getEncoded(), KerberosConstants.DES_ENC_TYPE, 0);
        byte[] data = new byte[32]; // Dummy data, must be multiple of 8
        byte[] decrypted = KerberosEncData.decrypt(data, key, KerberosConstants.DES_ENC_TYPE);
        assertNotNull(decrypted);
        // With dummy data, we can't verify the content, just that it decrypts without error

        String output = testOutput.toString();
        assertTrue(output.contains("test message"));
    }

    @Test
    void testSetInstanceMultipleTimes() {
        // Test setting instance multiple times
        PrintStream stream1 = new PrintStream(new ByteArrayOutputStream());
        PrintStream stream2 = new PrintStream(new ByteArrayOutputStream());

        LogStream.setInstance(stream1);

   * loading the value for this key, simply waits for that thread to finish and returns its loaded
   * value. Note that multiple threads can concurrently load values for distinct keys.
   *
   * <p>This method does not alter the state of this {@code CacheBuilder} instance, so it can be
   * invoked again to create multiple independent caches.
   *
   * @param loader the cache loader used to obtain new values

    } catch (Throwable e) {
      throw closer.rethrow(e);
    } finally {
      closer.close();
    }
  }

  /**
   * Concatenates multiple {@link ByteSource} instances into a single source. Streams returned from
   * the source will contain the concatenated data from the streams of the underlying sources.
   *

        // Test with leading/trailing spaces
        result = execJob.logSuffix("  another suffix  ");
        assertEquals("another_suffix", execJob.logSuffix);

        // Test with multiple spaces
        result = execJob.logSuffix("multi  space  suffix");
        assertEquals("multi__space__suffix", execJob.logSuffix);
    }

    // Test timeout setter
    public void test_timeout() {

     */
    long deadline = System.nanoTime() + unit.toNanos(timeout);
    int added = 0;
    while (added < numElements) {
      // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple
      // elements already available (e.g. LinkedBlockingQueue#drainTo locks only once)
      added += q.drainTo(buffer, numElements - added);

import java.util.Set;
import java.util.function.BiConsumer;
import org.jspecify.annotations.Nullable;

/**
 * A collection that maps keys to values, similar to {@link Map}, but in which each key may be
 * associated with <i>multiple</i> values. You can visualize the contents of a multimap either as a
 * map from keys to <i>nonempty</i> collections of values:
 *
 * <ul>
 *   <li>a → 1, 2
 *   <li>b → 3
 * </ul>
 *