- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 24 for nextLong (0.21 sec)
-
maven-core/src/test/java/org/apache/maven/settings/SettingsUtilsTest.java
.exists("exists" + Long.toHexString(entropy.nextLong())) .missing("missing" + Long.toHexString(entropy.nextLong())) .build(); ActivationProperty ap = ActivationProperty.newBuilder() .name("name" + Long.toHexString(entropy.nextLong())) .value("value" + Long.toHexString(entropy.nextLong())) .build();
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Mon Mar 25 10:50:01 GMT 2024 - 6.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java
tmp += UnsignedLongs.toString(x, 16).length(); tmp += UnsignedLongs.toString(x, 2).length(); } return tmp; } private static long random() { return RANDOM_SOURCE.nextLong(); } // A random value that cannot be 0 and that is unsigned-less-than or equal // to the given dividend, so that we don't have half of our divisions being
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/LessThanBenchmark.java
for (int i = 0; i < SAMPLE_SIZE; i++) { xInts[i] = random.nextInt(Integer.MAX_VALUE); yInts[i] = random.nextInt(Integer.MAX_VALUE); xLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK; yLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK; constant[i] = random.nextInt(); } } @Benchmark int branchFreeLtIntInlined(int reps) { int tmp = 0;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashingTest.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java
for (int i = 0; i < ARRAY_SIZE; i++) { positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue(); nonzero[i] = randomNonZeroBigInteger(Long.SIZE - 2).longValue(); longs[i] = RANDOM_SOURCE.nextLong(); } } @Benchmark int log2(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.log2(positive[j], mode); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java
tmp += UnsignedLongs.toString(x, 16).length(); tmp += UnsignedLongs.toString(x, 2).length(); } return tmp; } private static long random() { return RANDOM_SOURCE.nextLong(); } // A random value that cannot be 0 and that is unsigned-less-than or equal // to the given dividend, so that we don't have half of our divisions being
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashingTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/LessThanBenchmark.java
for (int i = 0; i < SAMPLE_SIZE; i++) { xInts[i] = random.nextInt(Integer.MAX_VALUE); yInts[i] = random.nextInt(Integer.MAX_VALUE); xLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK; yLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK; constant[i] = random.nextInt(); } } @Benchmark int branchFreeLtIntInlined(int reps) { int tmp = 0;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/es/config/exbhv/ScheduledJobBhv.java
Java - Registered: Mon Apr 22 08:04:10 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 2.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java
for (int i = 0; i < ARRAY_SIZE; i++) { positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue(); nonzero[i] = randomNonZeroBigInteger(Long.SIZE - 2).longValue(); longs[i] = RANDOM_SOURCE.nextLong(); } } @Benchmark int log2(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.log2(positive[j], mode); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0)