-bs-font-sans-serif);font-style:normal;font-weight:400;line-height:1.5;text-align:left;text-align:start;text-decoration:none;text-shadow:none;text-transform:none;letter-spacing:normal;word-break:normal;white-space:normal;word-spacing:normal;line-break:auto;font-size:var(--bs-tooltip-font-size);word-wrap:break-word;opacity:0}.tooltip.show{opacity:var(--bs-tooltip-opacity)}.tooltip .tooltip-arrow{display:block;width:var(--bs-tooltip-arrow-width);height:var(--bs-tooltip-arrow-height)}.tooltip .tool...

  }

  /**
   * Asserts that the collection under test contains exactly the elements it was initialized with
   * plus the given elements, according to {@link #expectContents(java.util.Collection)}. In other
   * words, for the default {@code expectContents()} implementation, the number of occurrences of
   * each given element has increased by one since the test collection was created, and the number

labels.facet_contentLength_5m=5MB -  
labels.facet_filetype_title=Tipo de archivo
labels.facet_filetype_html=HTML
labels.facet_filetype_word=MS Word
labels.facet_filetype_excel=MS Excel
labels.facet_filetype_powerpoint=MS PowerPoint
labels.facet_filetype_odt=ODF Word
labels.facet_filetype_ods=ODF Hoja de cálculo
labels.facet_filetype_odp=ODF Presentación
labels.facet_filetype_pdf=PDF
labels.facet_filetype_fb2=FictionBook

labels.facet_contentLength_5m=5MB -  
labels.facet_filetype_title=파일 종류
labels.facet_filetype_html=HTML
labels.facet_filetype_word=MS Word
labels.facet_filetype_excel=MS Excel
labels.facet_filetype_powerpoint=MS PowerPoint
labels.facet_filetype_odt=ODF Word
labels.facet_filetype_ods=ODF 스프레드시트
labels.facet_filetype_odp=ODF 프레젠테이션
labels.facet_filetype_pdf=PDF
labels.facet_filetype_fb2=FictionBook

   * in no particular order.
   *
   * <p>The returned array will be "safe" in that no references to it are maintained by this queue.
   * (In other words, this method must allocate a new array). The caller is thus free to modify the
   * returned array.
   *
   * <p>This method acts as bridge between array-based and collection-based APIs.
   *

    // Raising this number slows the worst-case contains behavior, speeds up hashFloodingDetected,
    // and reduces the false-positive probability.
    static final int MAX_RUN_MULTIPLIER = 13;

    /**
     * Checks the whole hash table for poor hash distribution. Takes O(n) in the worst case, O(n /
     * log n) on average.
     *

   *       simply switch over to use the JDK implementation wholesale if probable hash flooding is
   *       detected, sacrificing the compactness guarantee in very rare cases in exchange for much
   *       more reliable worst-case behavior.
   *   <li>null, if no entries have yet been added to the map
   * </ul>
   */
  private transient @Nullable Object table;

  /**

  /**
   * Returns an array containing all of the elements in this queue, in proper sequence.
   *
   * <p>The returned array will be "safe" in that no references to it are maintained by this queue.
   * (In other words, this method must allocate a new array). The caller is thus free to modify the
   * returned array.
   *
   * <p>This method acts as bridge between array-based and collection-based APIs.
   *

                    appendJson("user-session-id", entity.getUserSessionId(), buf).append(',');
                    appendJson("user", entity.getUser(), buf).append(',');
                    appendJson("search-word", entity.getSearchWord(), buf).append(',');
                    appendJson("hit-count", entity.getHitCount(), buf).append(',');
                    appendJson("query-page-size", entity.getQueryPageSize(), buf).append(',');

 * dataset contains no finite values).
 *
 * <h3>Performance</h3>
 *
 * <p>The average time complexity of the computation is O(N) in the size of the dataset. There is a
 * worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on
 * randomly ordered data (the probability decreases faster than exponentially in N), but if you are