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

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

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

    // TODO(cpovirk): Consider storing an Entry<?> instead of Entry<E>.
    Entry<E>[] entries = (Entry<E>[]) multiset.entrySet().toArray((Entry<E>[]) new Entry<?>[0]);
    Arrays.sort(entries, DecreasingCount.INSTANCE);
    return ImmutableMultiset.copyFromEntries(asList(entries));
  }

  private static final class DecreasingCount implements Comparator<Entry<?>> {

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

    // TODO(cpovirk): Consider storing an Entry<?> instead of Entry<E>.
    Entry<E>[] entries = (Entry<E>[]) multiset.entrySet().toArray((Entry<E>[]) new Entry<?>[0]);
    Arrays.sort(entries, DecreasingCount.INSTANCE);
    return ImmutableMultiset.copyFromEntries(asList(entries));
  }

  private static final class DecreasingCount implements Comparator<Entry<?>> {

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

labels.purgeByBots=Bots löschen
labels.logLevel=Protokollebene
labels.purgeSearchLogDay=Suchprotokoll löschen
labels.query=Abfrage
labels.queryId=Abfrage-ID
labels.rt=rt
labels.searchLog=Suchprotokoll
labels.sort=Sortieren
labels.start=Start
labels.loginRequired=Anmeldung erforderlich
labels.loginLink=Anmeldelink anzeigen
labels.threadName=Thread-Name
labels.url=URL
labels.userFavorite=Favoritenprotokoll

labels.protocolScheme=Skema
labels.purgeByBots=Hapus Bot
labels.logLevel=Level Log
labels.purgeSearchLogDay=Hapus Log Pencarian
labels.query=Kueri
labels.queryId=ID Kueri
labels.rt=rt
labels.searchLog=Log Pencarian
labels.sort=Sortir
labels.start=Mulai
labels.loginRequired=Login Diperlukan
labels.loginLink=Tampilkan Tautan Login
labels.threadName=Nama Thread
labels.url=URL
labels.userFavorite=Log Favorit
labels.userInfo=Info Pengguna

labels.purgeByBots=Usuń przez boty
labels.logLevel=Poziom logowania
labels.purgeSearchLogDay=Usuń dzienniki wyszukiwania
labels.query=Zapytanie
labels.queryId=ID zapytania
labels.rt=rt
labels.searchLog=Dziennik wyszukiwania
labels.sort=Sortuj
labels.start=Pozycja początkowa
labels.loginRequired=Wymagane logowanie
labels.loginLink=Pokaż link do logowania
labels.threadName=Nazwa wątku
labels.url=URL
labels.userFavorite=Dziennik ulubionych

labels.purgeByBots=Botları Temizle
labels.logLevel=Günlük Seviyesi
labels.purgeSearchLogDay=Arama Günlüğünü Temizle
labels.query=Sorgu
labels.queryId=Sorgu ID
labels.rt=rt
labels.searchLog=Arama Günlüğü
labels.sort=Sırala
labels.start=Başlat
labels.loginRequired=Oturum Açma Gerekli
labels.loginLink=Oturum Açma Bağlantısını Göster
labels.threadName=İş Parçacığı Adı
labels.url=URL
labels.userFavorite=Favori Günlüğü