*
   * @since 23.1
   */
  public static void sortDescending(char[] 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

   *
   * @since 23.1
   */
  public static void sortDescending(float[] 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

pkg slices, func Replace[$0 interface{ ~[]$1 }, $1 interface{}]($0, int, int, ...$1) $0 #57433
pkg slices, func Reverse[$0 interface{ ~[]$1 }, $1 interface{}]($0) #58565
pkg slices, func Sort[$0 interface{ ~[]$1 }, $1 cmp.Ordered]($0) #60091
pkg slices, func SortFunc[$0 interface{ ~[]$1 }, $1 interface{}]($0, func($1, $1) int) #60091

labels.maxAccessCount=Maximaal aantal toegangspogingen
labels.name=Naam
labels.numOfThread=Aantal threads
labels.duplicateHostName=Dubbele naam
labels.pageNumber=Paginanummer
labels.password=Wachtwoord
labels.paths=Paden
labels.port=Poort
labels.regex=Reguliere expressie
labels.regularName=Reguliere naam
labels.replacement=Vervanging
labels.sessionId=Sessie-ID
labels.sortOrder=Sorteervolgorde
labels.updatedBy=Bijgewerkt door

   *
   * @since 23.1
   */
  public static void sortDescending(int[] 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

    extends AbstractMap<K, V> implements Serializable {
  /*
   * TODO: Make this a drop-in replacement for j.u. versions, actually drop them in, and test the
   * world. Figure out what sort of space-time tradeoff we're actually going to get here with the
   * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in

        public FacetInfo getFacetInfo() {
            return createFacetInfo(request);
        }

        @Override
        public String getSort() {
            return request.getParameter("sort");
        }

        @Override
        public int getStartPosition() {
            if (startPosition != -1) {
                return startPosition;
            }

labels.includedDocUrls=要包含在搜尋中的URL
labels.maxAccessCount=最大訪問數
labels.name=名稱
labels.numOfThread=執行緒數
labels.duplicateHostName=重複名稱
labels.pageNumber=頁碼
labels.password=密碼
labels.paths=路徑
labels.port=埠
labels.regex=正則表達式
labels.regularName=常規名稱
labels.replacement=替換
labels.sessionId=會話ID
labels.sortOrder=排序順序
labels.updatedBy=更新者
labels.updatedTime=更新時間
labels.urls=URL
labels.userAgent=使用者代理

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.
   *