*
   * <p>The corresponding root-mean-square error in {@code x} as a function of {@code y} is a
   * fraction {@code sqrt(1/(R*R) - 1)} of the population standard deviation of {@code x}. This fit
   * does not normally minimize that error: to do that, you should swap the roles of {@code x} and
   * {@code y}.
   *
   * <h3>Non-finite values</h3>
   *

    val urls: MutableIterator<String> = cache.urls()
    val writeAbortCount: Int = cache.writeAbortCount()
    val writeSuccessCount: Int = cache.writeSuccessCount()
    val size: Long = cache.size()
    val maxSize: Long = cache.maxSize()
    cache.flush()
    cache.close()
    val directory: File = cache.directory
    val networkCount: Int = cache.networkCount()
    val hitCount: Int = cache.hitCount()

labels.errorCountMax=Nombre d'erreurs maximum
labels.errorCountMin=Nombre d'erreurs minimum
labels.facet=Facette
labels.geo=Géo
labels.groups=Groupes
labels.hash=Hachage
labels.kuromojiFile=Fichier Kuromoji
labels.maxSize=Taille maximale
labels.order=Ordre
labels.purgeSuggestSearchLogDay=Supprimer les anciennes informations de suggestion
labels.q=Requête
labels.roles=Rôles
labels.suggestSearchLog=Journal de recherche de suggestions

labels.errorCountMax=Maximaal aantal fouten
labels.errorCountMin=Minimaal aantal fouten
labels.facet=Facet
labels.geo=Geo
labels.groups=Groepen
labels.hash=Hash
labels.kuromojiFile=Kuromoji-bestand
labels.maxSize=Maximale grootte
labels.order=Volgorde
labels.purgeSuggestSearchLogDay=Vorige suggestie-informatie verwijderen
labels.q=Query
labels.roles=Rollen
labels.suggestSearchLog=Suggestie zoeklogboek

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

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=欄位

    // * The element with (index == from) should be kept.
    // * Everything with (index > from) has not been checked yet.

    // Check from the end of the list backwards (minimize expected cost of
    // moving elements when remove() is called). Stop before 'from' because
    // we already know that should be kept.
    for (int n = list.size() - 1; n > from; n--) {

    int initialBufferSize = min(BUFFER_SIZE, max(128, Integer.highestOneBit(totalLen) * 2));
    // Starting with an 8k buffer, double the size of each successive buffer. Smaller buffers
    // quadruple in size until they reach 8k, to minimize the number of small reads for longer
    // streams. Buffers are retained in a deque so that there's no copying between buffers while
    // reading and so all of the bytes in each new allocated buffer are available for reading from

  // The suppression also covers the cast to E[], discussed below.
  // In the backport, we don't have those cases and thus don't need this suppression.
  // We keep it to minimize diffs.
  @SuppressWarnings("unchecked")
  public static <E> ImmutableSet<E> copyOf(Collection<? extends E> elements) {
    /*
     * TODO(lowasser): consider checking for ImmutableAsList here

   * #aboutToAcquire(CycleDetectingLock)} and {@link #lockStateChanged(CycleDetectingLock)}.
   */
  // This is logically a Set, but an ArrayList is used to minimize the amount
  // of allocation done on lock()/unlock().
  private static final ThreadLocal<ArrayList<LockGraphNode>> acquiredLocks =
      new ThreadLocal<ArrayList<LockGraphNode>>() {
        @Override