- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 31 for Fricke (0.19 sec)
-
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
// "safe" edges which together form a cycle. Preventing this race // condition efficiently without _introducing_ deadlock is probably // tricky. For now, just accept the race condition---missing a warning // now and then is still better than having no deadlock detection. allowedPriorLocks.put(acquiredLock, new ExampleStackTrace(acquiredLock, this));
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
Multiset<E> multisetToModify, Multiset<?> occurrencesToRetain) { checkNotNull(multisetToModify); checkNotNull(occurrencesToRetain); // Avoiding ConcurrentModificationExceptions is tricky. Iterator<Entry<E>> entryIterator = multisetToModify.entrySet().iterator(); boolean changed = false; while (entryIterator.hasNext()) { Entry<E> entry = entryIterator.next();
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/src/com/google/common/base/Preconditions.java
* * But the methods in this class want to throw different exceptions, depending on the args, so it * appears that this pattern is not directly applicable. But we can use the ridiculous, devious * trick of throwing an exception in the middle of the construction of another exception. Hotspot * is fine with that. */ /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
android/guava/src/com/google/common/io/AppendableWriter.java
checkNotNull(str); checkNotClosed(); target.append(str); } @Override public void write(String str, int off, int len) throws IOException { checkNotNull(str); checkNotClosed(); // tricky: append takes start, end pair... target.append(str, off, off + len); } @Override public void flush() throws IOException { checkNotClosed(); if (target instanceof Flushable) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 28 20:13:02 GMT 2023 - 3.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/EndpointPair.java
// boolean condition2 = nodeU().equals(other.nodeV()) && nodeV().equals(other.nodeU()); // return condition1 || condition2; if (nodeU().equals(other.nodeU())) { // check condition1 // Here's the tricky bit. We don't have to explicitly check for condition2 in this case. // Why? The second half of condition2 requires that nodeV equals other.nodeU.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* then the effect of the function is non-existent: we serve storedPermits at exactly the same * cost as fresh ones (1/QPS is the cost for each). We use this trick later. * * If we pick a function that goes /below/ that horizontal line, it means that we reduce the area * of the function, thus time. Thus, the RateLimiter becomes /faster/ after a period of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
Integer lastItem = 0; for (Integer tmp : mmHeap) { lastItem = tmp; } assertEquals((Integer) 30, lastItem); } /** * This tests a special case where removeAt has to trickle an element first down one level from a * min to a max level, then up one level above the index of the removed element. It also tests * that skipMe in the iterator plays nicely with forgetMeNot. */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
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)