labels.maxAccessCount=Maksymalna liczba dostępów
labels.name=Nazwa
labels.numOfThread=Liczba wątków
labels.duplicateHostName=Zduplikowana nazwa
labels.pageNumber=Numer strony
labels.password=Hasło
labels.paths=Ścieżki
labels.port=Port
labels.regex=Wyrażenie regularne
labels.regularName=Nazwa regularna
labels.replacement=Zastąpienie
labels.sessionId=ID sesji
labels.sortOrder=Kolejność sortowania
labels.updatedBy=Zaktualizowane przez

      int expectedSize) {
    return new LinkedHashSet<>(Maps.capacity(expectedSize));
  }

  // TreeSet

  /**
   * Creates a <i>mutable</i>, empty {@code TreeSet} instance sorted by the natural sort ordering of
   * its elements.
   *
   * <p><b>Note:</b> if mutability is not required, use {@link ImmutableSortedSet#of()} instead.
   *

   *
   * @since 23.1
   */
  public static void sortDescending(double[] array, int fromIndex, int toIndex) {
    checkNotNull(array);
    checkPositionIndexes(fromIndex, toIndex, array.length);
    Arrays.sort(array, fromIndex, toIndex);
    reverse(array, fromIndex, toIndex);
  }

  /**
   * Reverses the elements of {@code array}. This is equivalent to {@code

}

func lcp(strs []string, pre bool) string {
	// short-circuit empty list
	if len(strs) == 0 {
		return ""
	}
	xfix := strs[0]
	// short-circuit single-element list
	if len(strs) == 1 {
		return xfix
	}
	// compare first to rest
	for _, str := range strs[1:] {
		xfixl := len(xfix)
		strl := len(str)
		// short-circuit empty strings
		if xfixl == 0 || strl == 0 {
			return ""
		}

labels.name=Nom
labels.numOfThread=Nombre de threads
labels.duplicateHostName=Nom d'hôte en double
labels.pageNumber=Numéro de page
labels.password=Mot de passe
labels.paths=Chemins
labels.port=Port
labels.regex=Expression régulière
labels.regularName=Nom régulier
labels.replacement=Remplacement
labels.sessionId=ID de session
labels.sortOrder=Ordre de tri
labels.updatedBy=Mis à jour par

   * multiset that violates this constraint, the {@code add(Object)} call will throw a {@code
   * ClassCastException}.
   *
   * @param comparator the comparator that will be used to sort this multiset. A null value
   *     indicates that the elements' <i>natural ordering</i> should be used.
   */
  @SuppressWarnings("unchecked")
  public static <E extends @Nullable Object> TreeMultiset<E> create(

* Back porting critical vSphere bug fixes to release 1.3 ([#31993](https://github.com/kubernetes/kubernetes/pull/31993), [@dagnello](https://github.com/dagnello))
* Back port - Openstack provider allowing more than one service port for lbaas v2 ([#32001](https://github.com/kubernetes/kubernetes/pull/32001), [@dagnello](https://github.com/dagnello))

	*/
	_ = realSize

	// Write PAX records to the output.
	isGlobal := hdr.Typeflag == TypeXGlobalHeader
	if len(paxHdrs) > 0 || isGlobal {
		// Write each record to a buffer.
		var buf strings.Builder
		// Sort keys for deterministic ordering.
		for _, k := range slices.Sorted(maps.Keys(paxHdrs)) {
			rec, err := formatPAXRecord(k, paxHdrs[k])
			if err != nil {
				return err
			}
			buf.WriteString(rec)
		}

labels.purgeByBots=Очистить ботов
labels.logLevel=Уровень журнала
labels.purgeSearchLogDay=Очистить журнал поиска
labels.query=Запрос
labels.queryId=ID запроса
labels.rt=rt
labels.searchLog=Журнал поиска
labels.sort=Сортировка
labels.start=Старт
labels.loginRequired=Требуется вход
labels.loginLink=Показать ссылку для входа
labels.threadName=Имя потока
labels.url=URL
labels.userFavorite=Журнал избранного

labels.purgeByBots=Elimina per Bot
labels.logLevel=Livello di log
labels.purgeSearchLogDay=Elimina log di ricerca
labels.query=Query
labels.queryId=ID query
labels.rt=rt
labels.searchLog=Log di ricerca
labels.sort=Ordina
labels.start=Posizione iniziale
labels.loginRequired=Login richiesto
labels.loginLink=Mostra link di login
labels.threadName=Nome thread
labels.url=URL
labels.userFavorite=Log preferiti