// The number of compression rounds.
  private final int c;
  // The number of finalization rounds.
  private final int d;
  // Two 64-bit keys (represent a single 128-bit key).
  private final long k0;
  private final long k1;

  /**
   * @param c the number of compression rounds (must be positive)
   * @param d the number of finalization rounds (must be positive)

   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,
   *       you can decrease the number of tasks from 15 and 10, killing off the final 5 tasks, and

     */
    protected static final float DEFAULT_LOAD_FACTOR = 0.75f;

    /**
     * Upper limit on the number of entries.
     */
    protected final int limitSize;

    /**
     * Creates an {@link LruHashMap}.
     *
     * @param limitSize the upper limit on the number of entries
     */
    public LruHashMap(final int limitSize) {
        this(limitSize, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR);

 */
public class IndexingHelper {
    /** Logger for this class */
    private static final Logger logger = LogManager.getLogger(IndexingHelper.class);

    /** Maximum number of retry attempts for failed operations */
    protected int maxRetryCount = 5;

    /** Default number of rows to process in a single batch */
    protected int defaultRowSize = 100;

    /**
     * Default constructor for indexing helper.

labels.user_surname=Nazwisko
labels.surame=Nazwisko
labels.user_mail=Adres e-mail
labels.mail=Adres e-mail
labels.user_employeeNumber=Numer pracownika
labels.employeeNumber=Numer pracownika
labels.user_telephoneNumber=Numer telefonu
labels.telephoneNumber=Numer telefonu
labels.user_homePhone=Telefon (domowy)
labels.homePhone=Telefon (domowy)
labels.user_homePostalAddress=Adres pocztowy (domowy)

    assertEquals(42, queue.maximumSize);
    checkNatural(queue);
  }

  private static final ImmutableList<Integer> NUMBERS = ImmutableList.of(4, 8, 15, 16, 23, 42);

  public void testCreation_withContents() {
    MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(NUMBERS);
    assertEquals(6, queue.size());
    assertEquals(11, queue.capacity());
    checkUnbounded(queue);
    checkNatural(queue);

    }

    /**
     * Gets the number of shards for the queue index.
     *
     * @return the number of queue shards
     */
    @Override
    public int getQueueShards() {
        return ComponentUtil.getFessConfig().getIndexDocumentCrawlerQueueNumberOfShardsAsInteger();
    }

    /**
     * Gets the number of shards for the data index.
     *
     * @return the number of data shards
     */
    @Override

regatable\":true,\"readFromDocValues\":true},{\"name\":\"order\",\"type\":\"number\",\"esTypes\":[\"integer\"],\"count\":0,\"scripted\":false,\"searchable\":true,\"aggregatable\":true,\"readFromDocValues\":true},{\"name\":\"queryId\",\"type\":\"string\",\"esTypes\":[\"keyword\"],\"count\":0,\"scripted\":false,\"searchable\":true,\"aggregatable\":true,\"readFromDocValues\":true},{\"name\":\"queryOffset\",\"type\":\"number\",\"esTypes\":[\"integer\"],\"count\":0,\"scripted\":false,\"searchable\":t...

   * Reads a count corresponding to a serialized map, multiset, or multimap. It returns the size of
   * a map serialized by {@link #writeMap(Map, ObjectOutputStream)}, the number of distinct elements
   * in a multiset serialized by {@link #writeMultiset(Multiset, ObjectOutputStream)}, or the number
   * of distinct keys in a multimap serialized by {@link #writeMultimap(Multimap,
   * ObjectOutputStream)}.
   */

 * the number of total, document, and query words.
 */
public class SuggestBody extends SuggestForm {
    /**
     * Constructs a new suggest body.
     */
    public SuggestBody() {
        // do nothing
    }

    /** The total number of words in the suggest index. */
    public Long totalWordsNum;

    /** The number of words from documents. */
    public Long documentWordsNum;