- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 137 for mod (0.15 sec)
-
utils/utils_windows_test.go
package utils import ( "testing" ) func TestSourceDir(t *testing.T) { cases := []struct { file string want string }{ { file: `C:/Users/name/go/pkg/mod/gorm.io/gorm@v1.2.3/utils/utils.go`, want: `C:/Users/name/go/pkg/mod/gorm.io/`, }, { file: `C:/go/work/proj/gorm/utils/utils.go`, want: `C:/go/work/proj/gorm/`, }, { file: `C:/go/work/proj/gorm_alias/utils/utils.go`,
Go - Registered: Sun Apr 28 09:35:09 GMT 2024 - Last Modified: Mon Nov 21 02:48:13 GMT 2022 - 715 bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java
return tmp; } @Benchmark int mod(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.mod(longs[j], positive[j]); } return tmp; } @Benchmark int gCD(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.mod(nonnegative[j], positive[j]); } return tmp;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java
int j = i & ARRAY_MASK; tmp += IntMath.pow(positive[j], exponent[j]); } return tmp; } @Benchmark int mod(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += IntMath.mod(ints[j], positive[j]); } return tmp; } @Benchmark int gCD(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.2K bytes - Viewed (0) -
doc/next/6-stdlib/1-time.md
is in a module with a `go.mod` `go` line using Go 1.23.0 or later. When Go 1.23 builds older programs, the old behaviors remain in effect. The new [GODEBUG setting](/doc/godebug) [`asynctimerchan=1`](/pkg/time/#NewTimer) can be used to revert back to asynchronous channel behaviors
Plain Text - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Fri Apr 12 20:57:18 GMT 2024 - 1.5K bytes - Viewed (0) -
src/main/java/org/codelibs/core/misc/Base64Util.java
Java - Registered: Fri Apr 26 20:58:09 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 6.3K bytes - Viewed (0) -
maven-core/src/test/remote-repo/org/apache/maven/maven-plugin-api/2.0/maven-plugin-api-2.0.jar
******@****.*** ******@****.*** http://mail-archives.apache.org/mod_mbox/maven-users Maven Developer List ******@****.*** ******@****.*** ******@****.*** http://mail-archives.apache.org/mod_mbox/maven-dev Maven Commits List ******@****.*** ******@****.*** ******@****.*** http://mail-archives.apache.org/mod_mbox/maven-dev Apache Announce List ******@****.*** ******@****.***...
Archive - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Oct 23 23:48:02 GMT 2009 - 9.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java
int j = i & ARRAY_MASK; tmp += IntMath.pow(positive[j], exponent[j]); } return tmp; } @Benchmark int mod(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += IntMath.mod(ints[j], positive[j]); } return tmp; } @Benchmark int gCD(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
for (int m : POSITIVE_INTEGER_CANDIDATES) { assertEquals(valueOf(x).mod(valueOf(m)).intValue(), LongMath.mod(x, m)); } } } @GwtIncompatible // TODO public void testIntModNegativeModulusFails() { for (long x : ALL_LONG_CANDIDATES) { for (int m : NEGATIVE_INTEGER_CANDIDATES) { try { LongMath.mod(x, m); fail("Expected ArithmeticException");
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/UnsignedIntegerTest.java
int expected = aUnsigned.bigIntegerValue().mod(bUnsigned.bigIntegerValue()).intValue(); UnsignedInteger unsignedRem = aUnsigned.mod(bUnsigned); assertThat(unsignedRem.intValue()).isEqualTo(expected); } } } } public void testModByZero() { for (int a : TEST_INTS) { try { UnsignedInteger.fromIntBits(a).mod(UnsignedInteger.ZERO);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
return increment ? div + signum : div; } /** * Returns {@code x mod m}, a non-negative value less than {@code m}. This differs from {@code x % * m}, which might be negative. * * <p>For example: * * <pre>{@code * mod(7, 4) == 3 * mod(-7, 4) == 1 * mod(-1, 4) == 3 * mod(-8, 4) == 0 * mod(8, 4) == 0 * }</pre> * * @throws ArithmeticException if {@code m <= 0}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0)