* ImmutableSortedSet#orderedBy}.
     */
    /*
     * TODO(cpovirk): use Object[] instead of E[] in the mainline? (The backport is different and
     * doesn't need this suppression, but we keep it to minimize diffs.) Generally be more clear
     * about when we have an Object[] vs. a Comparable[] or other array type in internalArray? If we
     * used Object[], we might be able to optimize toArray() to use clone() sometimes. (See

labels.errorCountMax=Maksymalna liczba błędów
labels.errorCountMin=Minimalna liczba błędów
labels.facet=Faseta
labels.geo=Geo
labels.groups=Grupy
labels.hash=Hash
labels.kuromojiFile=Plik kuromoji
labels.maxSize=Maksymalny rozmiar
labels.order=Kolejność
labels.purgeSuggestSearchLogDay=Usuń poprzednie informacje o sugestiach
labels.q=Zapytanie
labels.roles=Role
labels.suggestSearchLog=Dziennik wyszukiwania sugestii

labels.errorCountMax=Максимальное количество ошибок
labels.errorCountMin=Минимальное количество ошибок
labels.facet=Фасет
labels.geo=Гео
labels.groups=Группы
labels.hash=Хэш
labels.kuromojiFile=Файл Kuromoji
labels.maxSize=Максимальный размер
labels.order=Порядок
labels.purgeSuggestSearchLogDay=Удалить старую информацию о предложениях
labels.q=Запрос
labels.roles=Роли
labels.suggestSearchLog=Журнал поиска предложений

labels.errorCountMax=Numero massimo di errori
labels.errorCountMin=Numero minimo di errori
labels.facet=Faccetta
labels.geo=Geo
labels.groups=Gruppi
labels.hash=Hash
labels.kuromojiFile=File kuromoji
labels.maxSize=Dimensione massima
labels.order=Ordine
labels.purgeSuggestSearchLogDay=Elimina informazioni suggerite precedenti
labels.q=Query
labels.roles=Ruoli
labels.suggestSearchLog=Log di ricerca suggeriti

labels.crudMode=Mode
labels.errorCountMax=Max Error Count
labels.errorCountMin=Min Error Count
labels.facet=Facet
labels.geo=Geo
labels.groups=Groups
labels.hash=Hash
labels.kuromojiFile=Kuromoji File
labels.maxSize=Max Size
labels.order=Order
labels.purgeSuggestSearchLogDay=Delete old suggest info
labels.q=Query
labels.roles=Roles
labels.suggestSearchLog=Suggest Search Log
labels.suggestWord=Suggest Word

=== ":material-language-kotlin: Kotlin"
    ```kotlin
      private val client: OkHttpClient = OkHttpClient.Builder()
          .cache(Cache(
              directory = cacheDirectory,
              maxSize = 10L * 1024L * 1024L // 10 MiB
          ))
          .build()

      fun run() {
        val request = Request.Builder()
            .url("http://publicobject.com/helloworld.txt")
            .build()

labels.errorCountMax=Número máximo de errores
labels.errorCountMin=Número mínimo de errores
labels.facet=Faceta
labels.geo=Geo
labels.groups=Grupos
labels.hash=Hash
labels.kuromojiFile=Archivo Kuromoji
labels.maxSize=Tamaño máximo
labels.order=Orden
labels.purgeSuggestSearchLogDay=Eliminar información de sugerencias anterior
labels.q=Consulta
labels.roles=Roles
labels.suggestSearchLog=Registro de búsqueda para sugerencias

labels.crawler=크롤러
labels.crudMode=모드
labels.errorCountMax=최대 오류 수
labels.errorCountMin=최소 오류 수
labels.facet=패싯
labels.geo=지오
labels.groups=그룹
labels.hash=해시
labels.kuromojiFile=Kuromoji 파일
labels.maxSize=최대 크기
labels.order=순서
labels.purgeSuggestSearchLogDay=이전 추천 정보 삭제
labels.q=쿼리
labels.roles=역할
labels.suggestSearchLog=추천용 검색 로그
labels.suggestWord=추천 단어
labels.targetLabel=라벨
labels.term=검색어

labels.crawler=爬虫
labels.crudMode=模式
labels.errorCountMax=最大错误数
labels.errorCountMin=最小错误数
labels.facet=分面
labels.geo=地理
labels.groups=组
labels.hash=哈希
labels.kuromojiFile=Kuromoji文件
labels.maxSize=最大大小
labels.order=顺序
labels.purgeSuggestSearchLogDay=删除以前的建议信息
labels.q=查询
labels.roles=角色
labels.suggestSearchLog=建议搜索日志
labels.suggestWord=建议词
labels.targetLabel=标签
labels.term=搜索词
labels.fields=字段

  //      since, after all, this class is also a reentrant mutual exclusion lock!?

  /*
   * One of the key challenges of this class is to prevent lost signals, while trying hard to
   * minimize unnecessary signals. One simple and correct algorithm is to signal some other waiter
   * with a satisfied guard (if one exists) whenever any thread occupying the monitor exits the