- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 43 for jmod (0.14 sec)
-
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 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.2K 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 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K 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 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MultisetsTest.java
} @SuppressWarnings("deprecation") public void testUnmodifiableMultisetShortCircuit() { Multiset<String> mod = HashMultiset.create(); Multiset<String> unmod = Multisets.unmodifiableMultiset(mod); assertNotSame(mod, unmod); assertSame(unmod, Multisets.unmodifiableMultiset(unmod)); ImmutableMultiset<String> immutable = ImmutableMultiset.of("a", "a", "b", "a");
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 11.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedInteger.java
return fromIntBits(UnsignedInts.divide(value, checkNotNull(val).value)); } /** * Returns this mod {@code val}. * * @throws ArithmeticException if {@code val} is zero * @since 14.0 */ public UnsignedInteger mod(UnsignedInteger val) { return fromIntBits(UnsignedInts.remainder(value, checkNotNull(val).value)); } /**
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 23 18:45:50 GMT 2023 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.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(Bytes.asList(array), * distance)}, but is somewhat faster. * * <p>The provided "distance" may be negative, which will rotate left. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 14.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.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(Ints.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLong.java
return fromLongBits(UnsignedLongs.divide(value, checkNotNull(val).value)); } /** * Returns this modulo {@code val}. * * @since 14.0 */ public UnsignedLong mod(UnsignedLong val) { return fromLongBits(UnsignedLongs.remainder(value, checkNotNull(val).value)); } /** Returns the value of this {@code UnsignedLong} as an {@code int}. */ @Override
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Apr 22 13:09:25 GMT 2021 - 8.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.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(Chars.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.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(Floats.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 25.2K bytes - Viewed (0)