- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 130 for multiplication (0.27 sec)
-
staging/src/k8s.io/apimachinery/pkg/api/resource/math.go
c := a * b return c, c/b == a } // int64MultiplyScale10 multiplies a by 10, or returns false if that would overflow. This method is faster than // int64Multiply(a, 10) because the compiler can optimize constant factor multiplication. func int64MultiplyScale10(a int64) (int64, bool) { if a == 0 || a == 1 { return a * 10, true } if a == mostNegative { return 0, false } c := a * 10 return c, c/10 == a }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 23 13:07:14 UTC 2020 - 7.3K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.s
// register is 128-bits wide and so holds 2 of these elements. // Using 26-bit limbs allows us plenty of headroom to accommodate // accumulations before and after multiplication without // overflowing either 32-bits (before multiplication) or 64-bits // (after multiplication). // // In order to parallelise the operations required to calculate // the sum we use two separate accumulators and then sum those
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 17.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/functionalize-if.mlir
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 28 12:06:33 UTC 2022 - 2K bytes - Viewed (0) -
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) -
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) -
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)