Collection<E> collection = (Collection<E>) iterable;
      if (collection.size() <= 2L * k) {
        // In this case, just dumping the collection to an array and sorting is
        // faster than using the implementation for Iterator, which is
        // specialized for k much smaller than n.

        @SuppressWarnings("unchecked") // c only contains E's and doesn't escape

     */
    Integer getPageThumbnailPurgeMaxFetchSizeAsInteger();

    /**
     * Get the value for the key 'page.score.booster.max.fetch.size'. <br>
     * The value is, e.g. 1000 <br>
     * comment: Maximum number of score booster records to fetch per page.
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */

labels.facsimileTelephoneNumber=Facsimile Telephone Number
labels.user_postOfficeBox=Post Office Box
labels.postOfficeBox=Post Office Box
labels.user_initials=Initials
labels.initials=Initials
labels.user_carLicense=Car License
labels.carLicense=Car License
labels.user_mobile=Mobile
labels.mobile=Mobile
labels.user_postalAddress=Postal Address
labels.postalAddress=Postal Address
labels.user_city=City
labels.city=City

Still, in both situations, chances are that **FastAPI** will [still be faster](index.md#performance){.internal-link target=_blank} than (or at least comparable to) your previous framework.

### Dependencies { #dependencies }

labels.advance_search_must_queries=mit allen Wörtern
labels.advance_search_phrase_query=mit der exakten Wortgruppe
labels.advance_search_should_queries=mit mindestens einem der Wörter
labels.advance_search_not_queries=ohne die Wörter
labels.advance_search_filetype=Dateityp
labels.advance_search_filetype_default=Beliebiges Format
labels.advance_search_filetype_html=HTML
labels.advance_search_filetype_pdf=PDF

labels.menu_related_content=Konten Terkait
labels.menu_related_query=Kueri Terkait
labels.sidebar.placeholder_search=Cari...
labels.menu_plugin=Plugin
labels.menu_storage=Penyimpanan
labels.sidebar.menu=Menu
labels.footer.copyright=&copy;2024 <a href="https://github.com/codelibs">CodeLibs Project</a>.
labels.search=Cari
labels.similar_doc_result_status=Menampilkan hasil serupa.

labels.menu_related_query=Powiązane zapytanie
labels.sidebar.placeholder_search=Szukaj...
labels.menu_plugin=Wtyczka
labels.menu_storage=Przechowywanie
labels.sidebar.menu=Menu
labels.footer.copyright=&copy;2024 <a href="https://github.com/codelibs">Projekt CodeLibs</a>.
labels.search=Szukaj
labels.similar_doc_result_status=Wyświetlanie podobnych wyników.

    return Traverser.forTree(FILE_TREE);
  }

  private static final SuccessorsFunction<File> FILE_TREE =
      file -> {
        // check isDirectory() just because it may be faster than listFiles() on a non-directory
        if (file.isDirectory()) {
          File[] files = file.listFiles();
          if (files != null) {
            return unmodifiableList(Arrays.asList(files));
          }

 * 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
 * passing in unsanitized user data then a malicious user could force it. A light shuffle of the
 * data using an unpredictable seed should normally be enough to thwart this attack.
 *

labels.menu_related_content=Gerelateerde inhoud
labels.menu_related_query=Gerelateerde query
labels.sidebar.placeholder_search=Zoeken...
labels.menu_plugin=Plugin
labels.menu_storage=Opslag
labels.sidebar.menu=Menu
labels.footer.copyright=&copy;2024 <a href="https://github.com/codelibs">CodeLibs Project</a>.
labels.search=Zoeken
labels.similar_doc_result_status=Vergelijkbare resultaten worden weergegeven.