- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 42 for multiplication (0.16 sec)
-
src/math/gamma.go
3.47222221605458667310e-03, 8.33333333333482257126e-02, } // Gamma function computed by Stirling's formula. // The pair of results must be multiplied together to get the actual answer. // The multiplication is left to the caller so that, if careful, the caller can avoid // infinity for 172 <= x <= 180. // The polynomial is valid for 33 <= x <= 172; larger values are only used
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 5.5K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/api/resource/amount_test.go
t.Errorf("unexpeted failure: %v", c) } else if ok { if c != test.c { t.Errorf("%v: unexpected result: %d", test, c) } } else { if c != test.a { t.Errorf("%v: overflow multiplication mutated source: %d", test, c) } } } } func TestInt64AsCanonicalString(t *testing.T) { for _, test := range []struct { value int64 scale Scale result string
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Oct 13 20:54:15 UTC 2023 - 7K bytes - Viewed (0) -
src/hash/crc32/crc32_s390x.s
VLM 0(R3), V5, V8 VPERM V5, V5, CONST_PERM_LE2BE, V5 VPERM V6, V6, CONST_PERM_LE2BE, V6 VPERM V7, V7, CONST_PERM_LE2BE, V7 VPERM V8, V8, CONST_PERM_LE2BE, V8 // Perform a GF(2) multiplication of the doublewords in V1 with // the reduction constants in V0. The intermediate result is // then folded (accumulated) with the next data chunk in V5 and // stored in V1. Repeat this step for the register contents
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 20 00:49:17 UTC 2021 - 7.6K bytes - Viewed (0) -
src/crypto/ecdh/ecdh.go
curve Curve privateKey []byte boring *boring.PrivateKeyECDH // publicKey is set under publicKeyOnce, to allow loading private keys with // NewPrivateKey without having to perform a scalar multiplication. publicKey *PublicKey publicKeyOnce sync.Once } // ECDH performs an ECDH exchange and returns the shared secret. The [PrivateKey] // and [PublicKey] must use the same curve. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 17:09:47 UTC 2023 - 6.4K bytes - Viewed (0) -
src/crypto/ecdh/nist.go
// invalid scalars and the zero value. BytesX returns an error for the point // at infinity, but in a prime order group such as the NIST curves that can // only be the result of a scalar multiplication if one of the inputs is the // zero scalar or the point at infinity. if boring.Enabled { return boring.ECDH(local.boring, remote.boring) } boring.Unreachable()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 8.1K bytes - Viewed (0) -
src/internal/fuzz/encoding_test.go
desc: "negative uint", in: `go test fuzz v1 uint(-32)`, reject: true, }, { desc: "int8 too large", in: `go test fuzz v1 int8(1234456)`, reject: true, }, { desc: "multiplication in int value", in: `go test fuzz v1 int(20*5)`, reject: true, }, { desc: "double negation", in: `go test fuzz v1 int(--5)`, reject: true, }, { desc: "malformed bool",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 00:20:34 UTC 2024 - 8.2K bytes - Viewed (0) -
src/internal/types/testdata/check/const0.go
const _ = maxInt + /* ERROR "constant addition overflow" */ 1 const _ = -maxInt - /* ERROR "constant subtraction overflow" */ 1 const _ = maxInt ^ /* ERROR "constant bitwise XOR overflow" */ -1 const _ = maxInt * /* ERROR "constant multiplication overflow" */ 2 const _ = maxInt << /* ERROR "constant shift overflow" */ 2 const _ = 1 << /* ERROR "constant shift overflow" */ prec
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:54:25 UTC 2023 - 9.2K bytes - Viewed (0) -
src/math/expm1.go
// From step 1, we have // expm1(x) = either 2**k*[expm1(r)+1] - 1 // = or 2**k*[expm1(r) + (1-2**-k)] // 4. Implementation notes: // (A). To save one multiplication, we scale the coefficient Qi // to Qi*2**i, and replace z by (x**2)/2. // (B). To achieve maximum accuracy, we compute expm1(x) by // (i) if x < -56*ln2, return -1.0, (raise inexact if x!=inf)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 7.9K bytes - Viewed (0) -
src/runtime/mcentral.go
size := uintptr(class_to_size[c.spanclass.sizeclass()]) s := mheap_.alloc(npages, c.spanclass) if s == nil { return nil } // Use division by multiplication and shifts to quickly compute: // n := (npages << _PageShift) / size n := s.divideByElemSize(npages << _PageShift) s.limit = s.base() + size*n s.initHeapBits(false) return s
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.1K bytes - Viewed (0) -
src/runtime/mksizeclasses.go
computeDivMagic(&classes[i]) } return classes } // computeDivMagic checks that the division required to compute object // index from span offset can be computed using 32-bit multiplication. // n / c.size is implemented as (n * (^uint32(0)/uint32(c.size) + 1)) >> 32 // for all 0 <= n <= c.npages * pageSize func computeDivMagic(c *class) { // divisor d := c.size if d == 0 { return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:31:27 UTC 2024 - 9.6K bytes - Viewed (0)