- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 27 for jumped (0.18 sec)
-
android/guava/src/com/google/common/collect/TreeMultiset.java
this.range = GeneralRange.all(comparator); this.header = new AvlNode<>(); successor(header, header); this.rootReference = new Reference<>(); } /** A function which can be summed across a subtree. */ private enum Aggregate { SIZE { @Override int nodeAggregate(AvlNode<?> node) { return node.elemCount; } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
* Elements are added in encounter order. * * <p>If the mapped elements contain duplicates (according to {@link Object#equals}), the element * will be added more than once, with the count summed over all appearances of the element. * * <p>Note that {@code stream.collect(toMultiset(function, e -> 1, supplier))} is equivalent to * {@code stream.map(function).collect(Collectors.toCollection(supplier))}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/ChecksumHashFunctionTest.java
assertHash32(0x7A2D6005, CRC_32, "hello wo"); assertHash32(0x1C192672, CRC_32, "hello wor"); assertHash32(0x414FA339, CRC_32, "The quick brown fox jumps over the lazy dog"); assertHash32(0x4400B5BC, CRC_32, "The quick brown fox jumps over the lazy cog"); } public void testAdler32_knownValues() throws Exception { assertHash32(0x041701A6, ADLER_32, "hell"); assertHash32(0x062C0215, ADLER_32, "hello");
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jan 30 14:33:12 GMT 2018 - 3.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Murmur3Hash128Test.java
assertHash( 0, 0xe34bbc7bbc071b6cL, 0x7a433ca9c49a9347L, "The quick brown fox jumps over the lazy dog"); assertHash( 0, 0x658ca970ff85269aL, 0x43fee3eaa68e5c3eL, "The quick brown fox jumps over the lazy cog"); // Known output from Python smhasher HashCode foxHash = murmur3_128(0).hashString("The quick brown fox jumps over the lazy dog", Charsets.UTF_8);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
checkArgument(buckets > 0, "buckets must be positive: %s", buckets); LinearCongruentialGenerator generator = new LinearCongruentialGenerator(input); int candidate = 0; int next; // Jump from bucket to bucket until we go out of range while (true) { next = (int) ((candidate + 1) / generator.nextDouble()); if (next >= 0 && next < buckets) { candidate = next; } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/StatsTesting.java
+ (-2.2 - MANY_VALUES_MEAN) * (-2.2 - MANY_VALUES_MEAN); static final double MANY_VALUES_MAX = 555.555; static final double MANY_VALUES_MIN = -44.44; // Doubles which will overflow if summed: static final double[] LARGE_VALUES = {Double.MAX_VALUE, Double.MAX_VALUE / 2.0}; static final double LARGE_VALUES_MEAN = 0.75 * Double.MAX_VALUE; static final ImmutableList<Double> OTHER_MANY_VALUES =
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 23.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashingTest.java
assertEquals(expected, actual); } private static final String EMPTY_STRING = ""; private static final String TQBFJOTLD = "The quick brown fox jumps over the lazy dog"; private static final String TQBFJOTLDP = "The quick brown fox jumps over the lazy dog."; private static final ImmutableTable<HashFunction, String, String> KNOWN_HASHES = ImmutableTable.<HashFunction, String, String>builder()
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) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
if (remainingNanos < SPIN_THRESHOLD_NANOS) { // Remove the waiter, one way or another we are done parking this thread. removeWaiter(node); break long_wait_loop; // jump down to the busy wait loop } } } oldHead = waiters; // re-read and loop. } while (oldHead != Waiter.TOMBSTONE); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/Murmur3Hash128Test.java
assertHash( 0, 0xe34bbc7bbc071b6cL, 0x7a433ca9c49a9347L, "The quick brown fox jumps over the lazy dog"); assertHash( 0, 0x658ca970ff85269aL, 0x43fee3eaa68e5c3eL, "The quick brown fox jumps over the lazy cog"); // Known output from Python smhasher HashCode foxHash = murmur3_128(0).hashString("The quick brown fox jumps over the lazy dog", Charsets.UTF_8);
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) -
guava/src/com/google/common/cache/LocalCache.java
return false; } // This implementation is patterned after ConcurrentHashMap, but without the locking. The only // way for it to return a false negative would be for the target value to jump around in the map // such that none of the subsequent iterations observed it, despite the fact that at every point // in time it was present somewhere int the map. This becomes increasingly unlikely as
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0)