- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 211 for MULTIPLY (0.12 sec)
-
src/math/trig_reduce.go
z0 := (mPi4[digit] << bitshift) | (mPi4[digit+1] >> (64 - bitshift)) z1 := (mPi4[digit+1] << bitshift) | (mPi4[digit+2] >> (64 - bitshift)) z2 := (mPi4[digit+2] << bitshift) | (mPi4[digit+3] >> (64 - bitshift)) // Multiply mantissa by the digits and extract the upper two digits (hi, lo). z2hi, _ := bits.Mul64(z2, ix) z1hi, z1lo := bits.Mul64(z1, ix) z0lo := z0 * ix lo, c := bits.Add64(z1lo, z2hi, 0) hi, _ := bits.Add64(z0lo, z1hi, c)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 3.3K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.s
// add 2¹²⁸ to each message block value VLEIB $4, $1, M_4 VLEIB $12, $1, M_4 multiply: // accumulate the incoming message VAG H_0, M_0, M_0 VAG H_3, M_3, M_3 VAG H_1, M_1, M_1 VAG H_4, M_4, M_4 VAG H_2, M_2, M_2 // multiply the accumulator by the key coefficient MULTIPLY(M_0, M_1, M_2, M_3, M_4, R_0, R_1, R_2, R_3, R_4, R5_1, R5_2, R5_3, R5_4, H_0, H_1, H_2, H_3, H_4)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 17.5K bytes - Viewed (0) -
src/crypto/internal/edwards25519/scalar_alias_test.go
} for name, f := range map[string]interface{}{ "Negate": func(v, x Scalar) bool { return checkAliasingOneArg((*Scalar).Negate, v, x) }, "Multiply": func(v, x, y Scalar) bool { return checkAliasingTwoArgs((*Scalar).Multiply, v, x, y) }, "Add": func(v, x, y Scalar) bool { return checkAliasingTwoArgs((*Scalar).Add, v, x, y) }, "Subtract": func(v, x, y Scalar) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 28 17:26:17 UTC 2023 - 3K bytes - Viewed (0) -
platforms/native/platform-native/src/testFixtures/groovy/org/gradle/nativeplatform/fixtures/app/SwiftAppWithXCTest.groovy
class SwiftAppWithXCTest extends MainWithXCTestSourceElement implements AppElement { final SwiftApp main = new SwiftApp() final XCTestSourceElement test = new SwiftAppTest(main, main.greeter, main.sum, main.multiply) String expectedOutput = main.expectedOutput SwiftAppWithXCTest() { super('app') }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 996 bytes - Viewed (0) -
platforms/native/platform-native/src/testFixtures/groovy/org/gradle/nativeplatform/fixtures/app/SwiftAppWithSingleXCTestSuite.groovy
@Override List<XCTestSourceFileElement> getTestSuites() { return [new XCTestSourceFileElement("CombinedTests") { final delegate = new SwiftAppTest(main, main.greeter, main.sum, main.multiply) @Override List<XCTestCaseElement> getTestCases() { return delegate.sumTest.testCases + delegate.greeterTest.testCases + delegate.multiplyTest.testCases }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 1.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/compile_mlir_util/convert_mhlo_quant_to_int.mlir
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Sep 07 16:28:50 UTC 2023 - 1.2K bytes - Viewed (0) -
internal/grid/benchmark_test.go
} atomic.AddInt64(&ops, int64(n)) atomic.AddInt64(&lat, latency) }) spent := time.Since(t) if spent > 0 && n > 0 { // Since we are benchmarking n parallel servers we need to multiply by n. // This will give an estimate of the total ops/s. latency := float64(atomic.LoadInt64(&lat)) / float64(time.Millisecond) b.ReportMetric(float64(n)*float64(ops)/spent.Seconds(), "vops/s")
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 15:51:52 UTC 2024 - 15.7K bytes - Viewed (0) -
platforms/native/platform-native/src/testFixtures/groovy/org/gradle/nativeplatform/fixtures/app/SwiftLibWithCppDepXCTest.groovy
super(projectName) main = new SwiftLibWithCppDep(projectName, cppGreeter) test = new SwiftLibTest(main, main.greeter, main.sum, main.multiply) }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 1.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
// ⎡x / c⎤ = ⎣x * m / 2^(n+s)⎦ + 1 // (TODO: derivation?) // // The multiply is a bit odd, as it is a signed n-bit value // times an unsigned n-bit value. For n smaller than the // word size, we can extend x and m appropriately and use the // signed multiply instruction. For n == word size, // we must use the signed multiply high and correct // the result by adding x*2^n. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:25 UTC 2024 - 15.8K bytes - Viewed (0) -
src/math/rand/v2/pcg.go
// This does not seem worthwhile, at least for Go: not having any high // bits in the multiplier reduces the effect of low bits on the highest bits, // and it only saves 1 multiply out of 3. // (On 32-bit systems, it saves 1 out of 6, since Mul64 is doing 4.) const ( mulHi = 2549297995355413924 mulLo = 4865540595714422341 incHi = 6364136223846793005 incLo = 1442695040888963407 )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 2.9K bytes - Viewed (0)