fieldAdd(f[start+3], t) } for start := 0; start < 256; start += 4 { m++ zeta := zetas[m] t := fieldMontgomeryMul(zeta, f[start+2]) f[start+2] = fieldSub(f[start], t) f[start] = fieldAdd(f[start], t) t = fieldMontgomeryMul(zeta, f[start+3]) f[start+3] = fieldSub(f[start+1], t) f[start+1] = fieldAdd(f[start+1], t) } for start := 0; start < 256; start += 2 { m++ zeta := zetas[m] t := fieldMontgomeryMul(zeta, f[start+1]) f[start+1] = fieldSub(f[start], t) f[start] = fieldAdd(f[start], t) } return nttElement(f)...

0b0001_0000 r |= n << 4 & 0b0010_0000 r |= n << 6 & 0b0100_0000 return r } func TestZetas(t *testing.T) { ζ := big.NewInt(17) q := big.NewInt(q) for k, zeta := range zetas { // ζ^BitRev7(k) mod q exp := new(big.Int).Exp(ζ, big.NewInt(int64(BitRev7(uint8(k)))), q) if big.NewInt(int64(zeta)).Cmp(exp) != 0 { t.Errorf("zetas[%d] = %v, expected %v", k, zeta, exp) } } } func TestGammas(t *testing.T) { ζ := big.NewInt(17) q := big.NewInt(q) for k, gamma := range gammas { // ζ^2BitRev7(i)+1 exp := new(big.Int).Exp(ζ,...

	if len(versions) > 0 {
		versions[0].IsLatest = true
	}
	return versions, nil
}

// mergeXLV2Versions will merge all versions, typically from different disks
// that have at least quorum entries in all metas.
// Each version slice should be sorted.
// Quorum must be the minimum number of matching metadata files.
// Quorum should be > 1 and <= len(versions).
// If strict is set to false, entries that match type

        `tf.math.squared_difference`, `tf.math.tan`,
        `tf.math.unsorted_segment_max`, `tf.math.unsorted_segment_min`,
        `tf.math.unsorted_segment_prod`, `tf.math.unsorted_segment_sum`,
        `tf.math.zeta`.
    *   New endpoints in `tf.quantization` namespace:
        `tf.quantization.dequantize`,
        `tf.quantization.fake_quant_with_min_max_args`,
        `tf.quantization.fake_quant_with_min_max_args_gradient`,