}

  /** https://github.com/google/guava/issues/1791 */
  public void testInfinity_bustyTimeElapsed() {
    RateLimiter limiter = RateLimiter.create(Double.POSITIVE_INFINITY, stopwatch);
    stopwatch.instant += 1000000;
    limiter.setRate(2.0);
    for (int i = 0; i < 5; i++) {
      limiter.acquire();
    }
    assertEvents(
        "R0.00", // First comes the saved-up burst, which defaults to a 1-second burst (2 requests).

  }

  /** https://github.com/google/guava/issues/1791 */
  public void testInfinity_bustyTimeElapsed() {
    RateLimiter limiter = RateLimiter.create(Double.POSITIVE_INFINITY, stopwatch);
    stopwatch.instant += 1000000;
    limiter.setRate(2.0);
    for (int i = 0; i < 5; i++) {
      limiter.acquire();
    }
    assertEvents(
        "R0.00", // First comes the saved-up burst, which defaults to a 1-second burst (2 requests).

 *
 * @author Sverre Sundsdal
 */
@NullUnmarked
public class MinMaxPriorityQueueBenchmark {
  @Param private ComparatorType comparator;

  // TODO(kevinb): add 1000000 back when we have the ability to throw
  // NotApplicableException in the expensive comparator case.
  @Param({"100", "10000"})
  private int size;

  @Param private HeapType heap;

  private Queue<Integer> queue;

certificate authorities of the host platform. This strategy maximizes connectivity, but it is subject to certificate authority attacks such as the [2011 DigiNotar attack](https://www.computerworld.com/article/2510951/cybercrime-hacking/hackers-spied-on-300-000-iranians-using-fake-google-certificate.html). It also assumes your HTTPS servers’ certificates are signed by a certificate authority.

Use [CertificatePinner](https://square.github.io/okhttp/4.x/okhttp/okhttp3/-certificate-pinner/) to restrict...

        if (timeout < 0) {
            throw new IllegalArgumentException(fieldName + " cannot be negative: " + timeout);
        }
        if (timeout > 3600000L) { // Max 1 hour
            throw new IllegalArgumentException(fieldName + " exceeds maximum (1 hour): " + timeout);
        }
    }

    /**
     * Sanitizes a string for safe logging (removes control characters)

    public DirectoryLeaseContext(Smb2LeaseKey key, int leaseState, DirectoryCacheScope scope) {
        this.leaseKey = key;
        this.leaseState = leaseState;
        this.cacheScope = scope;
        this.maxCacheAge = 30000; // 30 seconds default
        this.notificationEnabled = true;
        this.notificationFilter = 0;
    }

    @Override
    public byte[] getName() {
        return CONTEXT_NAME_BYTES;
    }

    /**

        String name;
        int level;

        /* Set jcifs.smb1 properties we know we want; soTimeout and cachePolicy to 30min.
         */
        Config.setProperty("jcifs.smb1.smb.client.soTimeout", "1800000");
        Config.setProperty("jcifs.smb1.netbios.cachePolicy", "1200");
        /* The Filter can only work with NTLMv1 as it uses a man-in-the-middle
         * techinque that NTLMv2 specifically thwarts. A real NTLM Filter would

        lenient().when(mockConfig.isUseWitness()).thenReturn(true);
        lenient().when(mockConfig.getWitnessHeartbeatTimeout()).thenReturn(120000L);
        lenient().when(mockConfig.getWitnessRegistrationTimeout()).thenReturn(300000L);
        lenient().when(mockConfig.getWitnessReconnectDelay()).thenReturn(1000L);
        lenient().when(mockConfig.isWitnessServiceDiscovery()).thenReturn(true);
    }

    @AfterEach
    void tearDown() {

    assertThat(log).containsExactly("run@100000")

    taskFaker.advanceUntil(150.µs)
    assertThat(log).containsExactly("run@100000", "run@150000")

    taskFaker.advanceUntil(299.µs)
    assertThat(log).containsExactly("run@100000", "run@150000")

    taskFaker.advanceUntil(300.µs)
    assertThat(log).containsExactly("run@100000", "run@150000", "run@300000")

    taskFaker.assertNoMoreTasks()

  @GwtIncompatible // Too slow in GWT (~3min fully optimized)
  public void testDivideRemainderEuclideanProperty() {
    // Use a seed so that the test is deterministic:
    Random r = new Random(0L);
    for (int i = 0; i < 1000000; i++) {
      long dividend = r.nextLong();
      long divisor = r.nextLong();
      // Test that the Euclidean property is preserved:
      assertThat(
              dividend