public void testSetFuture_stackOverflow() {
    SettableFuture<String> orig = SettableFuture.create();
    SettableFuture<String> prev = orig;
    for (int i = 0; i < 100000; i++) {
      SettableFuture<String> curr = SettableFuture.create();
      prev.setFuture(curr);
      prev = curr;
    }
    // prev represents the 'innermost' future
    prev.set("done");

  @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++) {
      int dividend = r.nextInt();
      int divisor = r.nextInt();
      // Test that the Euclidean property is preserved:
      assertThat(
              dividend

  @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

    assertThat(Doubles.ensureCapacity(ARRAY1, 0, 1)).isSameInstanceAs(ARRAY1);
    assertThat(Doubles.ensureCapacity(ARRAY1, 1, 1)).isSameInstanceAs(ARRAY1);
    assertThat(Arrays.equals(new double[] {1.0, 0.0, 0.0}, Doubles.ensureCapacity(ARRAY1, 2, 1)))
        .isTrue();
  }

  public void testEnsureCapacity_fail() {
    assertThrows(IllegalArgumentException.class, () -> Doubles.ensureCapacity(ARRAY1, -1, 1));

          double z = aa.addAndGet(i, y);
          assertBitEquals(x + y, z);
          assertBitEquals(x + y, aa.get(i));
        }
      }
    }
  }

  static final long COUNTDOWN = 100000;

  class Counter extends CheckedRunnable {
    final AtomicDoubleArray aa;
    volatile long counts;

    Counter(AtomicDoubleArray a) {
      aa = a;
    }

        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

    @BeforeEach
    void setUp() {
        resourceManager = ResourceManager.getInstance();
        // Configure with shorter intervals for testing
        resourceManager.configure(1000, 100, true, true);
    }

    /**
     * Test resource for tracking
     */
    static class TestResource implements AutoCloseable {
        private final AtomicBoolean closed = new AtomicBoolean(false);

        assertThat(map.equals(copy), is(true));
    }

    /**
     * @throws Exception
     */
    @Test
    public void testPerformance() throws Exception {
        int num = 100000;
        Map<String, Object> hmap = new HashMap<String, Object>();
        Map<String, Object> amap = new ArrayMap<String, Object>();

        long start = System.currentTimeMillis();

  @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

labels.facet_contentLength_10k=content_length:[0 TO 9999]\t\
labels.facet_contentLength_10kto100k=content_length:[10000 TO 99999]\t\
labels.facet_contentLength_100kto500k=content_length:[100000 TO 499999]\t\
labels.facet_contentLength_500kto1m=content_length:[500000 TO 999999]\t\
labels.facet_contentLength_1m=content_length:[1000000 TO *]\n\
labels.facet_filetype_title:\
labels.facet_filetype_html=filetype:html\t\