}
	if !reflect.DeepEqual(in, out) {
		t.Errorf("mismatch: %v %v", in, out)
	}
}

func TestGobMapInterfaceEncode(t *testing.T) {
	m := map[string]any{
		"up": uintptr(0),
		"i0": []int{-1},
		"i1": []int8{-1},
		"i2": []int16{-1},
		"i3": []int32{-1},
		"i4": []int64{-1},
		"u0": []uint{1},
		"u1": []uint8{1},
		"u2": []uint16{1},
		"u3": []uint32{1},
		"u4": []uint64{1},

github.com/facebookgo/structtag,v0.0.0-20150214074306-217e25fb9691,h1:KnnwHN59Jxec0htA2pe/i0/WI9vxXLQifdhBrP3lqcQ=,3a9c84e9dc2b9960f1de3cc7a61d91fe2978e64e4e4859a9383259092ec91c5e

				{`C`, []string{`T`}, `interface{chan<- T}`},
				{`C`, []string{`[]*P`}, `interface{chan<- []*P}`},
				{`f`, []string{`int`, `chan<- int`, `chan<- []*chan<- int`}, `func() []int`},
			},
		},
		{`package i0; import "lib"; func _() { lib.F(42) }`,
			[]testInst{{`F`, []string{`int`}, `func(int)`}},
		},

		{`package duplfunc0; func f[T any](T) {}; func _() { f(42); f("foo"); f[int](3) }`,
			[]testInst{

				{`C`, []string{`T`}, `interface{chan<- T}`},
				{`C`, []string{`[]*P`}, `interface{chan<- []*P}`},
				{`f`, []string{`int`, `chan<- int`, `chan<- []*chan<- int`}, `func() []int`},
			},
		},
		{`package i0; import "lib"; func _() { lib.F(42) }`,
			[]testInst{{`F`, []string{`int`}, `func(int)`}},
		},

		{`package duplfunc0; func f[T any](T) {}; func _() { f(42); f("foo"); f[int](3) }`,
			[]testInst{

nction ef(i){return typeof i=="string"||i instanceof String}function ms(i){return xi(i)&&i.config===void 0&&!r0(i)?null:xi(i)&&i.config!==void 0&&ef(i.config)?Z.resolve(i.config):xi(i)&&i.config!==void 0&&xi(i.config)?null:ef(i)?Z.resolve(i):i0()}function i0(){for(let i of t0)try{let e=Z.resolve(i);return te.accessSync(e),e}catch(e){}return null}var t0,tf=C(()=>{l();je();gt();t0=["./tailwind.config.js","./tailwind.config.cjs","./tailwind.config.mjs","./tailwind.config.ts"]});var rf={};Ae(rf,{default:()=>gs});var...

2&D#dg�j�վ��0����6��4mj���Z�|AX�� �����h���&��[mE\�,���Mf$n�����}X�f U�m�%T4'�^���1a�^gi4�p�I&�8a��4� � 3L� 2X�K!���B&q0�ES�K ��a�/#�$
�� -
�X�6�EED�f4"�d�"��J�B2�0�6ҖF��fDn4¨U6��Ymij��� ƴ�jH�[H4؈�mL`*��*�Uڙ�5k(���fYH�Y�1�qfǛ�I0�&D2�6Da��m��V4�+�V6#ͬ�c�����3%0KV�mҫ%RZ�����A�ք��J�֑%�#+m]clI���UQ�R��5UUA�Y�VَX�*� Y�e ʡ ���4�#l���,(�aK�S�j*춤�b�e���e�S��dL���&0c � ׵o��Pk
h X��2IU��FI5�`�MAA��6 &�*���Ie@���V���� �,�n�2�g"�R�g���$-��4H[` J�����Zʴ�i����Q-�QE...

  );

  let results = (outs
    Res<TensorOf<[TF_Float16, TF_Float32, TF_Float64]>, [{A tensor with shape `shape + shape(alpha)`. Each slice
`[:, ..., :, i0, i1, ...iN]` contains the samples drawn for
`alpha[i0, i1, ...iN]`. The dtype of the output matches the dtype of alpha.}]>:$output
  );

  TF_DerivedOperandTypeAttr S = TF_DerivedOperandTypeAttr<0>;

30\277?`\"3H\372\260\270?\312\211\363|\312\t\336?\213\344aZJH\357?\204c\351\362@\021\342?j\211~\266\000\002\322?x\323\026\326\253\336\322?\3419\342{W\277\341?A>\337\263\365\250\353?\t\255\261D\335\307\347?\255\337S\272TN\353?`\346\010A\236,\332?nV\'I0\016\353?\377S\322\300\034\322\346?\264\304\371\304\344\316\353?M=\330@\t\"\355?\326p\254\215\312t\350?\203d\346\230:\330\352?\202\212\254*\252\222\353?\265\227\373\374\017\260\350?&cX\014;3\334?\300\356\371\010\"V\330?\210\211%\275\357p\330?\303\35...

function findFirstTrueIndexInSortedArray(array,test){let i0=0;let i1=array.length;while(i0<i1){const i=Math.trunc((i0+i1)/2);if(test(array[i])){i1=i;}else{i0=i+1;}}
return i1;}