this.size += other.size;
      return this;
    }

    private ImmutableMap<K, V> build(boolean throwIfDuplicateKeys) {
      /*
       * If entries is full, or if hash flooding is detected, then this implementation may end up
       * using the entries array directly and writing over the entry objects with non-terminal

// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package tar

import (
	"bytes"
	"compress/bzip2"
	"errors"
	"fmt"
	"hash/crc32"
	"io"
	"maps"
	"math"
	"os"
	"path"
	"reflect"
	"slices"
	"strconv"
	"strings"
	"testing"
	"time"
)

func TestReader(t *testing.T) {
	vectors := []struct {

labels.boostExpr=ブースト値式
labels.confirmPassword=確認
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=サジェスト用検索ログ

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import com.google.common.base.CharMatcher;
import com.google.common.base.MoreObjects;
import com.google.common.hash.Hashing;
import com.google.common.io.ByteStreams;
import com.google.common.primitives.Ints;
import com.google.errorprone.annotations.CanIgnoreReturnValue;
import java.math.BigInteger;
import java.net.Inet4Address;

    /** The key of the message: Groups */
    public static final String LABELS_GROUPS = "{labels.groups}";

    /** The key of the message: Hash */
    public static final String LABELS_HASH = "{labels.hash}";

    /** The key of the message: Kuromoji File */
    public static final String LABELS_KUROMOJI_FILE = "{labels.kuromojiFile}";

    /** The key of the message: Max Size */

"bubbleType","ontype","lastElement","eventPath","parentWindow","triggerHandler","rbracket","rCRLF","rsubmitterTypes","rsubmittable","buildParams","traditional","param","s","valueOrFunction","encodeURIComponent","serialize","serializeArray","r20","rhash","rantiCache","rheaders","rnoContent","rprotocol","transports","allTypes","originAnchor","addToPrefiltersOrTransports","structure","dataTypeExpression","dataType","dataTypes","inspectPrefiltersOrTransports","jqXHR","inspected","seekingTransport","...

	func _Cfunc_puts(p0 *_Ctype_char) (r1 _Ctype_int) {
		_cgo_runtime_cgocall(_cgo_be59f0f25121_Cfunc_puts, uintptr(unsafe.Pointer(&p0)))
		return
	}

The hexadecimal number is a hash of cgo's input, chosen to be
deterministic yet unlikely to collide with other uses. The actual
function _cgo_be59f0f25121_Cfunc_puts is implemented in a C source
file compiled by gcc, the file x.cgo2.c:

	void

  repeated string shortNames = 5;

  // categories is a list of the grouped resources this resource belongs to (e.g. 'all')
  repeated string categories = 7;

  // The hash value of the storage version, the version this resource is
  // converted to when written to the data store. Value must be treated
  // as opaque by clients. Only equality comparison on the value is valid.

      maintains a hash table to track the most up-to-date vocabulary based on
      the inputs received by the layer and the eviction policy. When this layer
      is used with an `UpdateEmbeddingCallback`, which is a time-based callback,
      the vocabulary lookup tensor is updated at the time interval set in the
      `UpdateEmbeddingCallback` based on the most up-to-date vocabulary hash

		partPath := pathJoin(volumeDir, path, fi.DataDir, fmt.Sprintf("part.%d", part.Number))
		err := s.bitrotVerify(ctx, partPath,
			erasure.ShardFileSize(part.Size),
			checksumInfo.Algorithm,
			checksumInfo.Hash, erasure.ShardSize())

		resp.Results[i] = convPartErrToInt(err)

		// Only log unknown errors
		if resp.Results[i] == checkPartUnknown && err != errFileAccessDenied {