- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 144 for newInt (0.33 sec)
-
src/crypto/internal/mlkem768/mlkem768_test.go
} 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)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 15:27:18 UTC 2024 - 10.3K bytes - Viewed (0) -
src/cmd/compile/internal/walk/compare.go
step = 1 } if step == 1 { comp( ir.NewIndexExpr(base.Pos, cmpl, ir.NewInt(base.Pos, i)), ir.NewIndexExpr(base.Pos, cmpr, ir.NewInt(base.Pos, i)), ) i++ remains -= t.Elem().Size() } else { elemType := t.Elem().ToUnsigned() cmplw := ir.Node(ir.NewIndexExpr(base.Pos, cmpl, ir.NewInt(base.Pos, i))) cmplw = typecheck.Conv(cmplw, elemType) // convert to unsigned
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 21:55:14 UTC 2023 - 16.2K bytes - Viewed (0) -
src/go/constant/value.go
if !is63bit(a) || !is63bit(b) { return makeInt(newInt().Add(big.NewInt(a), big.NewInt(b))) } c = a + b case token.SUB: if !is63bit(a) || !is63bit(b) { return makeInt(newInt().Sub(big.NewInt(a), big.NewInt(b))) } c = a - b case token.MUL: if !is32bit(a) || !is32bit(b) { return makeInt(newInt().Mul(big.NewInt(a), big.NewInt(b))) } c = a * b case token.QUO:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 34K bytes - Viewed (0) -
src/crypto/elliptic/elliptic_test.go
checkIsOnCurveFalse("x+P, y", xx, y) yy.Add(y, p) checkIsOnCurveFalse("x, y+P", x, yy) // Check if the overflow is dropped. xx.Add(x, new(big.Int).Lsh(big.NewInt(1), 535)) checkIsOnCurveFalse("x+2⁵³⁵, y", xx, y) yy.Add(y, new(big.Int).Lsh(big.NewInt(1), 535)) checkIsOnCurveFalse("x, y+2⁵³⁵", x, yy) // Check if P is treated like zero (if possible). // y^2 = x^3 - 3x + B // y = mod_sqrt(x^3 - 3x + B)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 27 02:00:03 UTC 2023 - 11.6K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat_test.go
N, _ := NewModulusFromBig(n) A := NewNat().setBig(a).ExpandFor(N) B := NewNat().setBig(b).ExpandFor(N) if A.Mul(B, N).IsZero() != 1 { t.Error("a * b mod (a * b) != 0") } i := new(big.Int).ModInverse(a, b) N, _ = NewModulusFromBig(b) A = NewNat().setBig(a).ExpandFor(N) I := NewNat().setBig(i).ExpandFor(N) one := NewNat().setBig(big.NewInt(1)).ExpandFor(N) if A.Mul(I, N).Equal(one) != 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 12 00:56:20 UTC 2024 - 11.6K bytes - Viewed (0) -
src/math/big/rat_test.go
func TestIssue820(t *testing.T) { x := NewRat(3, 1) y := NewRat(2, 1) z := y.Quo(x, y) q := NewRat(3, 2) if z.Cmp(q) != 0 { t.Errorf("got %s want %s", z, q) } y = NewRat(3, 1) x = NewRat(2, 1) z = y.Quo(x, y) q = NewRat(2, 3) if z.Cmp(q) != 0 { t.Errorf("got %s want %s", z, q) } x = NewRat(3, 1) z = x.Quo(x, x) q = NewRat(3, 3) if z.Cmp(q) != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 07 00:15:59 UTC 2022 - 18.9K bytes - Viewed (0) -
src/math/big/ratconv_test.go
} } func BenchmarkFloatPrecInexact(b *testing.B) { for _, n := range []int{1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6} { // d := 5^n + 1 d := NewInt(5) p := NewInt(int64(n)) d.Exp(d, p, nil) d.Add(d, NewInt(1)) // r := 1/d var r Rat r.SetFrac(NewInt(1), d) b.Run(fmt.Sprint(n), func(b *testing.B) { for i := 0; i < b.N; i++ { _, ok := r.FloatPrec() if ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 15 22:16:34 UTC 2023 - 19.3K bytes - Viewed (0) -
src/cmd/compile/internal/walk/range.go
// if hv2 < utf8.RuneSelf nif := ir.NewIfStmt(base.Pos, nil, nil, nil) nif.Cond = ir.NewBinaryExpr(base.Pos, ir.OLT, hv2, ir.NewInt(base.Pos, utf8.RuneSelf)) // hv1++ nif.Body = []ir.Node{ir.NewAssignStmt(base.Pos, hv1, ir.NewBinaryExpr(base.Pos, ir.OADD, hv1, ir.NewInt(base.Pos, 1)))} // } else { // hv2, hv1 = decoderune(ha, hv1) fn := typecheck.LookupRuntime("decoderune")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 20 14:52:33 UTC 2023 - 17.6K bytes - Viewed (0) -
pkg/registry/core/service/portallocator/allocator_test.go
} } func TestForEach(t *testing.T) { pr, err := net.ParsePortRange("10000-10200") if err != nil { t.Fatal(err) } testCases := []sets.Int{ sets.NewInt(), sets.NewInt(10000), sets.NewInt(10000, 10200), sets.NewInt(10000, 10099, 10200), } for i, tc := range testCases { r, err := NewInMemory(*pr) if err != nil { t.Fatal(err) } for port := range tc {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 08 07:15:02 UTC 2024 - 14K bytes - Viewed (0) -
pkg/registry/core/service/allocator/bitmap_test.go
max: 65535, reserved: 256, }, } for _, tc := range testCases { t.Run(tc.name, func(t *testing.T) { subTests := []sets.Int{ sets.NewInt(), sets.NewInt(0), sets.NewInt(0, 2, 5), sets.NewInt(0, 1, 2, 3, 4, 5, 6, 7), } for i, ts := range subTests { m := tc.allocator(tc.max, "test", tc.reserved) for offset := range ts {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 10 08:56:31 UTC 2022 - 13.3K bytes - Viewed (0)