- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 40 for jmod (0.21 sec)
-
guava-tests/test/com/google/common/collect/MultimapsTest.java
} public void testUnmodifiableMultimapIsView() { Multimap<String, Integer> mod = HashMultimap.create(); Multimap<String, Integer> unmod = Multimaps.unmodifiableMultimap(mod); assertEquals(mod, unmod); mod.put("foo", 1); assertTrue(unmod.containsEntry("foo", 1)); assertEquals(mod, unmod); } @SuppressWarnings("unchecked") public void testUnmodifiableMultimapEntries() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.2K 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/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 May 03 12:43:13 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 9.6K bytes - Viewed (0) -
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 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/SipHashFunction.java
// The number of bytes in the input. private long b = 0; // The final 64-bit chunk includes the last 0 through 7 bytes of m followed by null bytes // and ending with a byte encoding the positive integer b mod 256. private long finalM = 0; SipHasher(int c, int d, long k0, long k1) { super(CHUNK_SIZE); this.c = c; this.d = d; this.v0 ^= k0; this.v1 ^= k1;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 5.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/UnsignedLongTest.java
UnsignedLong unsignedRem = aUnsigned.mod(bUnsigned); assertThat(unsignedRem.longValue()).isEqualTo(expected); } } } } public void testModByZero() { for (long a : TEST_LONGS) { try { UnsignedLong.fromLongBits(a).mod(UnsignedLong.ZERO); fail("Expected ArithmeticException");
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 10.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.java
} /** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Booleans.asList(array), * distance)}, but is somewhat faster. * * <p>The provided "distance" may be negative, which will rotate left. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 19.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
} /** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Shorts.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 25.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
} /** * Performs a right rotation of {@code array} of "distance" places, so that the first element is * moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Longs.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 28.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.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 - 44.6K bytes - Viewed (0)