- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 45 for 000000 (0.17 sec)
-
android/guava-tests/test/com/google/common/primitives/UnsignedLongsTest.java
@GwtIncompatible // Too slow in GWT (~3min fully optimized) public void testDivideRemainderEuclideanProperty() { // Use a seed so that the test is deterministic: Random r = new Random(0L); for (int i = 0; i < 1000000; i++) { long dividend = r.nextLong(); long divisor = r.nextLong(); // Test that the Euclidean property is preserved: assertThat( dividend
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:36:17 GMT 2024 - 13.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/UnsignedIntsTest.java
@GwtIncompatible // Too slow in GWT (~3min fully optimized) public void testDivideRemainderEuclideanProperty() { // Use a seed so that the test is deterministic: Random r = new Random(0L); for (int i = 0; i < 1000000; i++) { int dividend = r.nextInt(); int divisor = r.nextInt(); // Test that the Euclidean property is preserved: assertThat( dividend
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 12.7K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/math/MathTesting.java
for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) { int x = 1 << exponent; intValues.add(x, x + 1, x - 1); } intValues.add(9999).add(10000).add(10001).add(1000000); // near powers of 10 intValues.add(5792).add(5793); // sqrt(2^25) rounded up and down POSITIVE_INTEGER_CANDIDATES = intValues.build(); NEGATIVE_INTEGER_CANDIDATES = ImmutableList.copyOf(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/MessageDigestAlgorithmBenchmark.java
* <li>hashMethod: how to hash the data (using the Hashing API or the MessageDigest API). * </ul> * * @author Kurt Alfred Kluever */ public class MessageDigestAlgorithmBenchmark { @Param({"10", "1000", "100000", "1000000"}) int size; @Param Algorithm algorithm; @Param HashMethod hashMethod; private enum HashMethod { MESSAGE_DIGEST_API() { @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashingTest.java
assertEquals(5, Hashing.consistentHash(1673758223894951030L, 11)); assertEquals(80343, Hashing.consistentHash(2, 100001)); assertEquals(22152, Hashing.consistentHash(2201, 100001)); assertEquals(15018, Hashing.consistentHash(2202, 100001)); } private static final double MAX_PERCENT_SPREAD = 0.5; private static final long RANDOM_SEED = 177L;
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/test/com/google/common/hash/FarmHashFingerprint64Test.java
assertEquals(hashCode, hasher.hash().asLong()); hasher = HASH_FN.newHasher(); hasher .putChar((char) 0x0101) .putChar((char) 0x0100) .putChar((char) 0x0000) .putChar((char) 0x0000); assertEquals(hashCode, hasher.hash().asLong()); hasher = HASH_FN.newHasher(); hasher.putBytes(new byte[] {0x01, 0x01, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00});
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Jul 19 14:00:24 GMT 2016 - 6.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Fingerprint2011Test.java
assertEquals(hashCode, hasher.hash().asLong()); hasher = HASH_FN.newHasher(); hasher .putChar((char) 0x0101) .putChar((char) 0x0100) .putChar((char) 0x0000) .putChar((char) 0x0000); assertEquals(hashCode, hasher.hash().asLong()); hasher = HASH_FN.newHasher(); hasher.putBytes(new byte[] {0x01, 0x01, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00});
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Dec 29 14:55:25 GMT 2021 - 7.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/StreamsTest.java
assertThat(list).containsExactly("a:1", "b:2", "c:3"); } public void testForEachPair_parallel() { Stream<String> streamA = IntStream.range(0, 100000).mapToObj(String::valueOf).parallel(); Stream<Integer> streamB = IntStream.range(0, 100000).mapToObj(i -> i).parallel(); AtomicInteger count = new AtomicInteger(0); Streams.forEachPair( streamA, streamB, (a, b) -> {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 0, 0, 0, 0 }; @VisibleForTesting static final int[] powersOf10 = { 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000 }; // halfPowersOf10[i] = largest int less than 10^(i + 0.5) @VisibleForTesting static final int[] halfPowersOf10 = {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
public class QuantilesBenchmark { private static final ContiguousSet<Integer> ALL_DECILE_INDEXES = ContiguousSet.create(Range.closed(0, 10), DiscreteDomain.integers()); @Param({"10", "100", "1000", "10000", "100000"}) int datasetSize; @Param QuantilesAlgorithm algorithm; private double[][] datasets = new double[0x100][]; @BeforeExperiment void setUp() { Random rng = new Random();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 3.1K bytes - Viewed (0)