- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 42 for multiplication (0.18 sec)
-
src/math/big/floatconv.go
// may be a nonzero exponent exp. The radix point amounts to a // division by b**(-fcount). An exponent means multiplication by // ebase**exp. Finally, mantissa normalization (shift left) requires // a correcting multiplication by 2**(-shiftcount). Multiplications // are commutative, so we can apply them in any order as long as there // is no loss of precision. We only have powers of 2 and 10, and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 8.3K bytes - Viewed (0) -
src/runtime/internal/math/math.go
// license that can be found in the LICENSE file. package math import "internal/goarch" const MaxUintptr = ^uintptr(0) // MulUintptr returns a * b and whether the multiplication overflowed. // On supported platforms this is an intrinsic lowered by the compiler. func MulUintptr(a, b uintptr) (uintptr, bool) { if a|b < 1<<(4*goarch.PtrSize) || a == 0 { return a * b, false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 16 16:03:04 UTC 2023 - 1.7K bytes - Viewed (0) -
test/ken/cplx2.go
// run // Copyright 2010 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Test arithmetic on complex numbers, including multiplication and division. package main const ( R = 5 I = 6i C1 = R + I // ADD(5,6) C2 = R - I // SUB(5,-6) C3 = -(R + I) // ADD(5,6) NEG(-5,-6) C4 = -(R - I) // SUB(5,-6) NEG(-5,6)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 05:24:24 UTC 2012 - 1.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java
if (x.length() != (originalString.length() * count)) { throw new RuntimeException("Wrong length: " + x); } } } private static String oldRepeat(String string, int count) { // If this multiplication overflows, a NegativeArraySizeException or // OutOfMemoryError is not far behind final int len = string.length(); final int size = len * count; char[] array = new char[size];
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Sep 17 20:24:24 UTC 2021 - 3.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 3.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java
if (x.length() != (originalString.length() * count)) { throw new RuntimeException("Wrong length: " + x); } } } private static String oldRepeat(String string, int count) { // If this multiplication overflows, a NegativeArraySizeException or // OutOfMemoryError is not far behind final int len = string.length(); final int size = len * count; char[] array = new char[size];
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Sep 17 20:24:24 UTC 2021 - 3.3K bytes - Viewed (0) -
src/crypto/internal/edwards25519/scalarmult.go
} var basepointTablePrecomp struct { table [32]affineLookupTable initOnce sync.Once } // ScalarBaseMult sets v = x * B, where B is the canonical generator, and // returns v. // // The scalar multiplication is done in constant time. func (v *Point) ScalarBaseMult(x *Scalar) *Point { basepointTable := basepointTable() // Write x = sum(x_i * 16^i) so x*B = sum( B*x_i*16^i ) // as described in the Ed25519 paper //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:10 UTC 2022 - 6.3K bytes - Viewed (0) -
src/hash/fnv/fnv.go
hash ^= sum64a(c) hash *= prime64 } *s = hash return len(data), nil } func (s *sum128) Write(data []byte) (int, error) { for _, c := range data { // Compute the multiplication s0, s1 := bits.Mul64(prime128Lower, s[1]) s0 += s[1]<<prime128Shift + prime128Lower*s[0] // Update the values s[1] = s1 s[0] = s0 s[1] ^= uint64(c) } return len(data), nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 22:36:41 UTC 2024 - 8.5K bytes - Viewed (0) -
src/crypto/elliptic/nistec.go
// // To interact with the nistec package, points are encoded into and decoded from // properly formatted byte slices. All big.Int use is limited to this package. // Encoding and decoding is 1/1000th of the runtime of a scalar multiplication, // so the overhead is acceptable. type nistCurve[Point nistPoint[Point]] struct { newPoint func() Point params *CurveParams } // nistPoint is a generic constraint for the nistec Point types.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 21 16:19:34 UTC 2022 - 9.6K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/api/resource/math_test.go
} { c, ok := int64Multiply(test.a, test.b) if c != test.c { t.Errorf("%v: unexpected result: %d", test, c) } if ok != test.ok { t.Errorf("%v: unexpected overflow: %t", test, ok) } // multiplication is commutative d, ok2 := int64Multiply(test.b, test.a) if c != d || ok != ok2 { t.Errorf("%v: not commutative: %d %t", test, d, ok2) } } } func TestDetectOverflowScale(t *testing.T) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Jan 29 20:41:44 UTC 2017 - 5.1K bytes - Viewed (0)