- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 77 for MULTIPLY (0.14 sec)
-
staging/src/k8s.io/apiserver/pkg/cel/library/cost.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Apr 23 17:22:44 UTC 2024 - 20.6K bytes - Viewed (0) -
platforms/native/language-native/src/integTest/groovy/org/gradle/language/swift/SwiftIncrementalBuildIntegrationTest.groovy
expect: succeeds "assemble" result.assertTasksExecuted(assembleAppTasks) result.assertTasksNotSkipped(assembleAppTasks) outputs.deletedClasses("multiply", "sum") // See https://github.com/gradle/gradle-native/issues/1004 if (toolchainUnderTest.version.major == 5) { outputs.recompiledClasses('renamed-sum') } else {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 15.7K bytes - Viewed (0) -
src/math/big/natdiv.go
We can ensure that v has a large top digit by multiplying both u and v by the right amount. Continuing the example, if we multiply both 172 and 19 by 3, we now have ⌊516/57⌋, the leading digit of v is now ≥ 5, and sure enough ⌊51/5⌋ = 10 is much closer to the correct answer 9. It would be easier here to multiply by 4, because that can be done with a shift. Specifically, we can
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/BigIntegerMathTest.java
try { BigInteger quotient = BigIntegerMath.divide(p, q, UNNECESSARY); BigInteger undone = quotient.multiply(q); if (!p.equals(undone)) { failFormat("expected %s.multiply(%s) = %s; got %s", quotient, q, p, undone); } assertTrue(dividesEvenly); } catch (ArithmeticException e) { assertFalse(dividesEvenly);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 17:58:33 UTC 2024 - 27.8K bytes - Viewed (0) -
platforms/native/testing-native/src/integTest/groovy/org/gradle/nativeplatform/test/xctest/SwiftXCTestIntegrationTest.groovy
} @ToBeFixedForConfigurationCache def "can specify a test dependency on another library"() { def lib = new SwiftLib() def test = new SwiftLibTest(lib, lib.greeter, lib.sum, lib.multiply) given: createDirs("greeter") settingsFile << """ rootProject.name = 'app' include 'greeter' """ buildFile << """ project(':greeter') {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 20.8K bytes - Viewed (0) -
src/crypto/aes/aes_test.go
p := 1 for i := 0; i < len(powx); i++ { if powx[i] != byte(p) { t.Errorf("powx[%d] = %#x, want %#x", i, powx[i], p) } p <<= 1 if p&0x100 != 0 { p ^= poly } } } // Multiply b and c as GF(2) polynomials modulo poly func mul(b, c uint32) uint32 { i := b j := c s := uint32(0) for k := uint32(1); k < 0x100 && j != 0; k <<= 1 { // Invariant: k == 1<<n, i == b * xⁿ if j&k != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 14:58:19 UTC 2024 - 12.5K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
// It's definitely safe to multiply into numerator and denominator. numerator *= n; denominator *= i; numeratorBits += nBits; } else { // It might not be safe to multiply into numerator and denominator, // so multiply (numerator / denominator) into result.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
// It's definitely safe to multiply into numerator and denominator. numerator *= n; denominator *= i; numeratorBits += nBits; } else { // It might not be safe to multiply into numerator and denominator, // so multiply (numerator / denominator) into result.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/tests/legalize-tf-with-tf2xla-hlo-importer.mlir
// CHECK: %[[mul2:.*]] = mhlo.multiply %arg2, %[[scr1]] : tensor<8xf32> // CHECK: %[[bcast_mul2:.+]] = "mhlo.dynamic_broadcast_in_dim"(%[[mul2]], {{.*}}) <{broadcast_dimensions = dense<3> : tensor<1xi64>}> : (tensor<8xf32>, tensor<4xindex>) -> tensor<8x8x8x8xf32> // CHECK: %[[mul3:.*]] = mhlo.multiply %[[grad]], %[[bcast_mul2]] : tensor<8x8x8x8xf32>
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 06 15:32:52 UTC 2024 - 38.6K bytes - Viewed (0) -
src/net/rpc/server.go
"Arith.Divide". To invoke one, a client first dials the server: client, err := rpc.DialHTTP("tcp", serverAddress + ":1234") if err != nil { log.Fatal("dialing:", err) } Then it can make a remote call: // Synchronous call args := &server.Args{7,8} var reply int err = client.Call("Arith.Multiply", args, &reply) if err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 10 03:29:50 UTC 2024 - 21.6K bytes - Viewed (0)