- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 200 for remainders (0.46 sec)
-
src/crypto/internal/mlkem768/mlkem768.go
// // We can convert that to the following logic: add 1 if remainder > q/2, // then add 1 again if remainder > q + q/2. // // Note that if remainder > x, then ⌊x⌋ - remainder underflows, and the top // bit of the difference will be set. quotient += (q/2 - remainder) >> 31 & 1 quotient += (q + q/2 - remainder) >> 31 & 1 // quotient might have overflowed at this point, so reduce it by masking.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 28.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
} // returns the minimum x such as x >= a && (x % b) == 0 private static int ceilToMultiple(int a, int b) { int remainder = a % b; return remainder == 0 ? a : a + b - remainder; } void assertBytes(byte[] expected) { byte[] got = out.toByteArray(); for (int i = 0; i < expected.length; i++) { assertEquals(expected[i], got[i]);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 8.5K bytes - Viewed (0) -
src/math/sqrt.go
// it is not necessary to do a full (53-bit) comparison // in (3). // 3. Final rounding // After generating the 53 bits result, we compute one more bit. // Together with the remainder, we can decide whether the // result is exact, bigger than 1/2ulp, or less than 1/2ulp // (it will never equal to 1/2ulp). // The rounding mode can be detected by checking whether
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 15 17:07:57 UTC 2022 - 4.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
} // returns the minimum x such as x >= a && (x % b) == 0 private static int ceilToMultiple(int a, int b) { int remainder = a % b; return remainder == 0 ? a : a + b - remainder; } void assertBytes(byte[] expected) { byte[] got = out.toByteArray(); for (int i = 0; i < expected.length; i++) { assertEquals(expected[i], got[i]);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 8.5K bytes - Viewed (0) -
src/math/mod.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package math /* Floating-point mod function. */ // Mod returns the floating-point remainder of x/y. // The magnitude of the result is less than y and its // sign agrees with that of x. // // Special cases are: // // Mod(±Inf, y) = NaN // Mod(NaN, y) = NaN // Mod(x, 0) = NaN // Mod(x, ±Inf) = x
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 903 bytes - Viewed (0) -
src/runtime/funcdata.h
// GO_RESULTS_INITIALIZED indicates that the assembly function // has initialized the stack space for its results and that those results // should be considered live for the remainder of the function. #define GO_RESULTS_INITIALIZED PCDATA $PCDATA_StackMapIndex, $1 // NO_LOCAL_POINTERS indicates that the assembly function stores // no pointers to heap objects in its local stack variables.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 29 18:28:09 UTC 2023 - 2.5K bytes - Viewed (0) -
src/cmd/internal/bootstrap_test/reboot_test.go
cmd.Stderr = os.Stderr cmd.Stdout = io.MultiWriter(os.Stdout, &stdout) if err := cmd.Run(); err != nil { t.Fatal(err) } // Test that go.dev/issue/42563 hasn't regressed. t.Run("PATH reminder", func(t *testing.T) { var want string switch gorootBin := filepath.Join(goroot, "bin"); runtime.GOOS { default: want = fmt.Sprintf("*** You need to add %s to your PATH.", gorootBin) case "plan9":
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 22:16:54 UTC 2024 - 2.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/transforms/legalize_hlo_patterns.td
(FloatOrDefaultCompare $compare_type2)]>; // Converts a dag of HLOs representing floor_mod to tf.FloorMod. // The pattern matched executes the following computation: // // rem = remainder(arg0, arg1) // for i in 0 to len(arg1): // if ((rem[i] < 0) != (arg0[i] < 0) && arg0[i] != 0) // rem[i] += arg1[i] // return rem def : Pat<(MHLO_SelectOp (MHLO_AndOp
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Feb 03 08:58:22 UTC 2024 - 34K bytes - Viewed (0) -
src/math/bits/bits.go
} // Rem returns the remainder of (hi, lo) divided by y. Rem panics for // y == 0 (division by zero) but, unlike Div, it doesn't panic on a // quotient overflow. func Rem(hi, lo, y uint) uint { if UintSize == 32 { return uint(Rem32(uint32(hi), uint32(lo), uint32(y))) } return uint(Rem64(uint64(hi), uint64(lo), uint64(y))) } // Rem32 returns the remainder of (hi, lo) divided by y. Rem32 panics
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 17.9K bytes - Viewed (0) -
src/path/match.go
continue } name = t continue Pattern } if err != nil { return false, err } } } // Before returning false with no error, // check that the remainder of the pattern is syntactically valid. for len(pattern) > 0 { _, chunk, pattern = scanChunk(pattern) if _, _, err := matchChunk(chunk, ""); err != nil { return false, err } } return false, nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 23 17:33:57 UTC 2023 - 5.3K bytes - Viewed (0)