protected long requestedTime;
        /**
         * The list of facet fields and their values.
         */
        protected List<Map<String, Object>> facetField;
        /**
         * The list of facet queries and their counts.
         */
        protected List<Map<String, Object>> facetQuery;

        /**
         * Populates this response with search render data.

labels.related_content_term=Term
labels.related_content_title_details=Related Content
labels.related_query_configuration=Related Query
labels.related_query_list_term=Term
labels.related_query_queries=Queries
labels.related_query_term=Term
labels.related_query_title_details=Related Query
labels.crud_button_create=Create
labels.crud_button_update=Update
labels.crud_button_delete=Delete
labels.crud_button_back=Back

   * enter this monitor. This method is designed primarily for use in monitoring of the system
   * state.
   */
  public boolean hasQueuedThreads() {
    return lock.hasQueuedThreads();
  }

  /**
   * Queries whether the given thread is waiting to enter this monitor. Note that because
   * cancellations may occur at any time, a {@code true} return does not guarantee that this thread

     *
     * This method handles the complete search workflow including parameter processing,
     * query execution, result formatting, and logging. It supports automatic retry
     * with escaped queries if the initial search fails.
     *
     * @param searchRequestParams The search request parameters
     * @param data The search render data to populate with results

 *
 * <p>This class uses the life cycle methods to read in a list of starting URIs and save the set of
 * outstanding URIs when shutting down. Also, it takes advantage of the scheduling functionality to
 * rate limit the number of queries we perform.
 *
 * @author Luke Sandberg
 * @since 11.0
 */
@GwtIncompatible
@J2ktIncompatible
public abstract class AbstractScheduledService implements Service {

 *
 * <p>This class uses the life cycle methods to read in a list of starting URIs and save the set of
 * outstanding URIs when shutting down. Also, it takes advantage of the scheduling functionality to
 * rate limit the number of queries we perform.
 *
 * @author Luke Sandberg
 * @since 11.0
 */
@GwtIncompatible
@J2ktIncompatible
public abstract class AbstractScheduledService implements Service {

     * e.g. hash codes adversarially designed to go into ascending table locations, which keeps
     * construction O(n) (as desired) but then can have O(n) queries later.
     *
     * <p>If this returns false, then no query can take more than O(log n).
     *
     * <p>Note that for a RegularImmutableSet with elements with truly random hash codes, contains

     */
    <T extends @Nullable Object> boolean put(
        @ParametricNullness T object,
        Funnel<? super T> funnel,
        int numHashFunctions,
        LockFreeBitArray bits);

    /**
     * Queries {@code numHashFunctions} bits of the given bit array, by hashing a user element;
     * returns {@code true} if and only if all selected bits are set.
     */
    <T extends @Nullable Object> boolean mightContain(

labels.related_content_term=Zoekterm
labels.related_content_title_details=Gerelateerde inhoud
labels.related_query_configuration=Gerelateerde query
labels.related_query_list_term=Zoekterm
labels.related_query_queries=Queries
labels.related_query_term=Zoekterm
labels.related_query_title_details=Gerelateerde query
labels.crud_button_create=Maken
labels.crud_button_update=Bijwerken
labels.crud_button_delete=Verwijderen

   * for matchers that only match a few characters, and so on. In the worst-case scenario, it
   * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
   * matcher which is faster to query than the original.
   */
  @GwtIncompatible // SmallCharMatcher
  CharMatcher precomputedInternal() {
    BitSet table = new BitSet();