- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 130 for multiplication (0.2 sec)
-
test/const2.go
const LargeB = LargeA * LargeA * LargeA const LargeC = LargeB * LargeB * LargeB // GC_ERROR "constant multiplication overflow" const AlsoLargeA = LargeA << 400 << 400 >> 400 >> 400 // GC_ERROR "constant shift overflow" // Issue #42732. const a = 1e+500000000 const b = a * a // ERROR "constant multiplication overflow|not representable" const c = b * b const MaxInt512 = (1<<256 - 1) * (1<<256 + 1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 01 21:49:31 UTC 2020 - 1008 bytes - Viewed (0) -
src/math/big/calibrate_test.go
return time.Duration(res.NsPerOp()) } func computeKaratsubaThresholds() { fmt.Printf("Multiplication times for varying Karatsuba thresholds\n") fmt.Printf("(run repeatedly for good results)\n") // determine Tk, the work load execution time using basic multiplication Tb := measureKaratsuba(1e9) // th == 1e9 => Karatsuba multiplication disabled fmt.Printf("Tb = %10s\n", Tb) // thresholds th := 4 th1 := -1 th2 := -1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 05 23:35:29 UTC 2023 - 4.6K bytes - Viewed (0) -
test/mergemul.go
// the compiler into (c+d)*n + d*k (with c+d and d*k computed at // compile time). // // The merging is performed by a combination of the multiplication // merge rules // (c*n + d*n) -> (c+d)*n // and the distributive multiplication rules // c * (d+x) -> c*d + c*x // Generate a MergeTest that looks like this: // // a8, b8 = m1*n8 + m2*(n8+k), (m1+m2)*n8 + m2*k // if a8 != b8 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Sep 03 14:29:38 UTC 2017 - 3.2K bytes - Viewed (0) -
src/crypto/internal/nistec/p256_ordinv.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. //go:build (amd64 || arm64) && !purego package nistec import "errors" // Montgomery multiplication modulo org(G). Sets res = in1 * in2 * R⁻¹. // //go:noescape func p256OrdMul(res, in1, in2 *p256OrdElement) // Montgomery square modulo org(G), repeated n times (n >= 1). // //go:noescape
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 3K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe_generic.go
func feMulGeneric(v, a, b *Element) { a0 := a.l0 a1 := a.l1 a2 := a.l2 a3 := a.l3 a4 := a.l4 b0 := b.l0 b1 := b.l1 b2 := b.l2 b3 := b.l3 b4 := b.l4 // Limb multiplication works like pen-and-paper columnar multiplication, but // with 51-bit limbs instead of digits. // // a4 a3 a2 a1 a0 x // b4 b3 b2 b1 b0 =
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 27 01:16:19 UTC 2023 - 8.5K bytes - Viewed (0) -
test/strength.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Sep 08 17:28:20 UTC 2019 - 1K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_generic.go
h1, c = bits.Add64(h1, binary.LittleEndian.Uint64(buf[8:16]), c) h2 += c msg = nil } // Multiplication of big number limbs is similar to elementary school // columnar multiplication. Instead of digits, there are 64-bit limbs. // // We are multiplying a 3 limbs number, h, by a 2 limbs number, r. // // h2 h1 h0 x
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9.6K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
// n = len(m.nat.limbs). // // Faster Montgomery multiplication replaces standard modular multiplication for // numbers in this representation. // // This assumes that x is already reduced mod m. func (x *Nat) montgomeryRepresentation(m *Modulus) *Nat { // A Montgomery multiplication (which computes a * b / R) by R * R works out // to a multiplication by R, which takes the value out of the Montgomery domain.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0) -
src/cmd/compile/internal/test/mulconst_test.go
// license that can be found in the LICENSE file. package test import "testing" // Benchmark multiplication of an integer by various constants. // // The comment above each sub-benchmark provides an example of how the // target multiplication operation might be implemented using shift // (multiplication by a power of 2), addition and subtraction // operations. It is platform-dependent whether these transformations
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 18 15:39:44 UTC 2020 - 4.3K bytes - Viewed (0) -
src/vendor/golang.org/x/sys/cpu/cpu.go
HasASIMD bool // Advanced SIMD (always available) HasEVTSTRM bool // Event stream support HasAES bool // AES hardware implementation HasPMULL bool // Polynomial multiplication instruction set HasSHA1 bool // SHA1 hardware implementation HasSHA2 bool // SHA2 hardware implementation HasCRC32 bool // CRC32 hardware implementation
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 16:12:58 UTC 2024 - 12.1K bytes - Viewed (0)