- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 366 for rand (0.14 sec)
-
android/guava-tests/test/com/google/common/math/LongMathTest.java
Random rand = new Random(1); for (int bits = 10; bits < 63; bits++) { for (int i = 0; i < 100; i++) { long p = BigInteger.probablePrime(bits, rand).longValue(); assertTrue(LongMath.isPrime(p)); } } } @GwtIncompatible // isPrime is GWT-incompatible public void testIsPrimeOnRandomComposites() { Random rand = new Random(1);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/base/CharMatcherTest.java
assertTrue(len4.matches('d')); for (char c = 'e'; c < 'z'; c++) { assertFalse(len4.matches(c)); } Random rand = new Random(1234); for (int testCase = 0; testCase < 100; testCase++) { char[] chars = randomChars(rand, rand.nextInt(63) + 1); CharMatcher m = SmallCharMatcher.from(bitSet(chars), new String(chars)); checkExactMatches(m, chars); } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 21 18:32:41 GMT 2024 - 30.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/CharMatcherTest.java
assertTrue(len4.matches('d')); for (char c = 'e'; c < 'z'; c++) { assertFalse(len4.matches(c)); } Random rand = new Random(1234); for (int testCase = 0; testCase < 100; testCase++) { char[] chars = randomChars(rand, rand.nextInt(63) + 1); CharMatcher m = SmallCharMatcher.from(bitSet(chars), new String(chars)); checkExactMatches(m, chars); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 18:32:41 GMT 2024 - 30.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/IntMathTest.java
for (int i = 0; i < 100000; i++) { assertEquals(LongMath.isPrime(i), IntMath.isPrime(i)); } // Then check 1000 deterministic pseudo-random int values. Random rand = new Random(1); for (int i = 0; i < 1000; i++) { int n = rand.nextInt(Integer.MAX_VALUE); assertEquals(LongMath.isPrime(n), IntMath.isPrime(n)); } } private static int force32(int value) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
Random rand = new Random(1); for (int bits = 10; bits < 63; bits++) { for (int i = 0; i < 100; i++) { long p = BigInteger.probablePrime(bits, rand).longValue(); assertTrue(LongMath.isPrime(p)); } } } @GwtIncompatible // isPrime is GWT-incompatible public void testIsPrimeOnRandomComposites() { Random rand = new Random(1);
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-tests/test/com/google/common/math/IntMathTest.java
for (int i = 0; i < 100000; i++) { assertEquals(LongMath.isPrime(i), IntMath.isPrime(i)); } // Then check 1000 deterministic pseudo-random int values. Random rand = new Random(1); for (int i = 0; i < 1000; i++) { int n = rand.nextInt(Integer.MAX_VALUE); assertEquals(LongMath.isPrime(n), IntMath.isPrime(n)); } } private static int force32(int value) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* <p>This version adds some verbosity around the {@code Guard} objects, but removes that same * verbosity, and more, from the {@code get} and {@code set} methods. {@code Monitor} implements the * same efficient signaling as we had to hand-code in the {@code ReentrantLock} version above. * Finally, the programmer no longer has to hand-code the wait loop, and therefore doesn't have to * remember to use {@code while} instead of {@code if}. * * <pre>{@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/FloatsTest.java
"", "+-", "+-0", " 5", "32 ", " 55 ", "infinity", "POSITIVE_INFINITY", "0x9A", "0x9A.bE-5", ".", ".e5", "NaNd", "InfinityF" }; @GwtIncompatible // Floats.tryParse public void testTryParseFailures() { for (String badInput : BAD_TRY_PARSE_INPUTS) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 29.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
* named analogously to their {@code BigInteger} counterparts. * * <p>The implementations of many methods in this class are based on material from Henry S. Warren, * Jr.'s <i>Hacker's Delight</i>, (Addison Wesley, 2002). * * <p>Similar functionality for {@code int} and for {@link BigInteger} can be found in {@link
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) -
guava-tests/test/com/google/common/primitives/DoublesTest.java
"", "+-", "+-0", " 5", "32 ", " 55 ", "infinity", "POSITIVE_INFINITY", "0x9A", "0x9A.bE-5", ".", ".e5", "NaNd", "InfinityF" }; @GwtIncompatible // Doubles.tryParse public void testTryParseFailures() { for (String badInput : BAD_TRY_PARSE_INPUTS) { assertThat(badInput) .doesNotMatch(
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 31.5K bytes - Viewed (0)