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 complete result is equal to
// `bytes.Join(append(fullBuffers, finalFragment), nil)`, which has a
// length of `totalLen`. The result is structured in this way to allow callers
// to minimize allocations and copies.
func (b *Reader) collectFragments(delim byte) (fullBuffers [][]byte, finalFragment []byte, totalLen int, err error) {
	var frag []byte
	// Use ReadSlice to look for delim, accumulating full buffers.

    // * 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--) {

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

labels.errorCountMax=Número máximo de erros
labels.errorCountMin=Número mínimo de erros
labels.facet=Faceta
labels.geo=Geo
labels.groups=Grupos
labels.hash=Hash
labels.kuromojiFile=Arquivo Kuromoji
labels.maxSize=Tamanho máximo
labels.order=Ordem
labels.purgeSuggestSearchLogDay=Excluir informações de sugestão anteriores
labels.q=Consulta
labels.roles=Funções
labels.suggestSearchLog=Log de pesquisa para sugestões

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

				// We have already reported the error, return nil.
				return nil
			}
			continue
		}
		diskHealthCheckOK(ctx, nil)
		if req.MaxSize > 0 && int64(len(data)) > req.MaxSize {
			r.Exists = true
			r.Error = fmt.Sprintf("max size (%d) exceeded: %d", req.MaxSize, len(data))
			select {
			case <-ctx.Done():
				return ctx.Err()
			case resp <- r:
				continue
			}
		}
		found++

     * 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

  // 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