}
    }

    // subsequent calls should call the loader again, not get the old exception
    assertThrows(UncheckedExecutionException.class, () -> cache.getUnchecked("bar"));
    assertThat(callCount.get()).isEqualTo(2);
  }

  /**
   * Test-helper method that performs {@code nThreads} concurrent calls to {@code cache.get(key)} or

 * tailored to that use case.
 *
 * <p>This uses the same efficient implementation as {@link Ordering#leastOf(Iterable, int)},
 * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
 * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
 * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log

        public boolean isFinished() {
            return finished;
        }

        /**
         * Stops the crawling operation gracefully.
         * If a data store is currently active, this method calls
         * its stop method to halt the crawling process.
         */
        public void stopCrawling() {
            if (dataStore != null) {
                dataStore.stop();
            }
        }

      }
    }

    // subsequent calls should call the loader again, not get the old exception
    assertThrows(UncheckedExecutionException.class, () -> cache.getUnchecked("bar"));
    assertThat(callCount.get()).isEqualTo(2);
  }

  /**
   * Test-helper method that performs {@code nThreads} concurrent calls to {@code cache.get(key)} or

        ResponseData responseData = new ResponseData();
        responseData.setUrl("http://example.com");

        // Multiple calls should return same result
        boolean firstResult = rule.match(responseData);
        boolean secondResult = rule.match(responseData);
        boolean thirdResult = rule.match(responseData);

      @Nullable Object value;
      @Nullable ValueHolder next;
    }

    /**
     * Holder object for values that cannot be null or empty (will be printed unconditionally). This
     * helps to shortcut most calls to isEmpty(), which is important because the check for emptiness
     * is relatively expensive. Use a subtype so this also doesn't need any extra storage.
     */

     * The configuration string format is "clientName:pattern,clientName:pattern,..."
     * Results are cached to improve performance on subsequent calls.
     *
     * @param value the client rule configuration string
     * @return a list of pairs containing client names and their corresponding compiled patterns
     */

     */
    ContiguousSet<Integer> enormous = ContiguousSet.create(Range.<Integer>all(), integers());
    assertTrue(enormous instanceof RegularContiguousSet);
    // We can't use reserializeAndAssert because it calls hashCode, which is enormously slow.
    ContiguousSet<Integer> enormousReserialized = reserialize(enormous);
    assertEquals(enormous, enormousReserialized);
  }

      if (!firstTimeSeen) {
        /*
         * We've seen this, so we've seen its causes, too. No need to re-add them. (There's one case
         * where this isn't true, but we ignore it: If we record an exception, then someone calls
         * initCause() on it, and then we examine it again, we'll conclude that we've seen the whole
         * chain before when in fact we haven't. But this should be rare.)
         */
        return false;
      }

        assertThrows(IllegalStateException.class, () -> auth.getPassword());
        assertThrows(IllegalStateException.class, () -> auth.getPasswordAsCharArray());
    }

    /**
     * Test multiple close() calls (idempotency)
     */
    @Test
    @DisplayName("Test close() method is idempotent")
    public void testCloseIdempotent() {