- Sort Score
- Result 10 results
- Languages All
Results 11 - 16 of 16 for Patrick (0.2 sec)
-
guava-tests/benchmark/com/google/common/hash/ChecksumBenchmark.java
result = (byte) (result ^ checksum.getValue()); } return result; } // Helpers + main private byte runHashFunction(int reps, HashFunction hashFunction) { byte result = 0x01; // Trick the JVM to prevent it from using the hash function non-polymorphically result ^= Hashing.crc32().hashInt(reps).asBytes()[0]; result ^= Hashing.adler32().hashInt(reps).asBytes()[0]; for (int i = 0; i < reps; i++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Jun 13 16:19:15 GMT 2023 - 2.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/ChecksumBenchmark.java
result = (byte) (result ^ checksum.getValue()); } return result; } // Helpers + main private byte runHashFunction(int reps, HashFunction hashFunction) { byte result = 0x01; // Trick the JVM to prevent it from using the hash function non-polymorphically result ^= Hashing.crc32().hashInt(reps).asBytes()[0]; result ^= Hashing.adler32().hashInt(reps).asBytes()[0]; for (int i = 0; i < reps; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 13 16:19:15 GMT 2023 - 2.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
enum BloomFilterStrategies implements BloomFilter.Strategy { /** * See "Less Hashing, Same Performance: Building a Better Bloom Filter" by Adam Kirsch and Michael * Mitzenmacher. The paper argues that this trick doesn't significantly deteriorate the * performance of a Bloom filter (yet only needs two 32bit hash functions). */ MURMUR128_MITZ_32() { @Override public <T extends @Nullable Object> boolean put(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 10.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
sort( insertionOrder, new Comparator<V>() { @Override public int compare(V left, V right) { // The indexes are small enough for the subtraction trick to be safe. return indexOfEntryWithValue(left) - indexOfEntryWithValue(right); } int indexOfEntryWithValue(V value) { for (int i = 0; i < orderedEntries.size(); i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
import java.util.concurrent.locks.ReentrantLock; import java.util.concurrent.locks.ReentrantReadWriteLock; import junit.framework.TestCase; /** * Unittests for {@link CycleDetectingLockFactory}. * * @author Darick Tong */ public class CycleDetectingLockFactoryTest extends TestCase { private ReentrantLock lockA; private ReentrantLock lockB; private ReentrantLock lockC; private ReentrantReadWriteLock.ReadLock readLockA;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 16.1K bytes - Viewed (1) -
android/guava/src/com/google/common/hash/Crc32cHashFunction.java
* by Kadatch and Jenkins, 2010. */ Crc32cHasher() { super(16); } private boolean finished = false; /* * This trick allows us to avoid having separate states for "first four ints" and "all other * four int chunks." The state we want after the first four bytes is * * crc0 = ~int0 * crc1 = int1 * crc2 = int2
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 21.3K bytes - Viewed (0)