- Sort Score
- Num 10 results
- Language All
Results 1 - 8 of 8 for nextLong (0.08 seconds)
-
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 randomSource.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
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Dec 28 01:26:26 GMT 2024 - 4.4K bytes - Click Count (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); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (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;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 4.1K bytes - Click Count (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 randomSource.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
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Dec 28 01:26:26 GMT 2024 - 4.4K bytes - Click Count (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;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 4.1K bytes - Click Count (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); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/opensearch/config/exbhv/ScheduledJobBhv.java
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 15 06:53:53 GMT 2025 - 2.2K bytes - Click Count (0) -
benchmarks/src/main/java/org/elasticsearch/benchmark/search/aggregations/TermsReduceBenchmark.java
int cardinality = cardinalityFactor * topNSize; BytesRef[] dict = new BytesRef[cardinality]; for (int i = 0; i < dict.length; i++) { dict[i] = new BytesRef(Long.toString(rand.nextLong())); } for (int i = 0; i < numShards; i++) { aggsList.add(InternalAggregations.from(Collections.singletonList(newTerms(rand, dict, true)))); } }Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Fri Aug 20 15:45:38 GMT 2021 - 8.1K bytes - Click Count (0)