- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 45 for Schick (1.05 sec)
-
guava/src/com/google/common/util/concurrent/AbstractFuture.java
OverflowAvoidingLockSupport.parkNanos(this, remainingNanos); // Check interruption first, if we woke up due to interruption we need to honor that. if (Thread.interrupted()) { removeWaiter(node); throw new InterruptedException(); } // Otherwise re-read and check doneness. If we loop then it must have been a spurious // wakeup
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 62.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
* non-final fields need to be reloaded inside the loop. * * And, no, defining (final or not) local variables out of the loop still isn't as good * because the null check on the theUnsafe object remains inside the loop and * BYTE_ARRAY_BASE_OFFSET doesn't get constant-folded. * * The compiler can treat static final fields as compile-time constants and can constant-fold
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 18.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/net/InetAddressesTest.java
InetAddress mapped = InetAddresses.forString(mappedStr); assertThat(mapped).isNotInstanceOf(Inet6Address.class); assertEquals(InetAddress.getByName("192.168.0.1"), mapped); // check upper case mappedStr = "::FFFF:192.168.0.1"; assertTrue(InetAddresses.isMappedIPv4Address(mappedStr)); mapped = InetAddresses.forString(mappedStr); assertThat(mapped).isNotInstanceOf(Inet6Address.class);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 24 16:44:05 UTC 2024 - 35.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
// Attach a listener SingleCallListener listener = new SingleCallListener(); compound.addListener(listener, directExecutor()); // Satisfy each input and check the output assertFalse(compound.isDone()); future1.set(DATA1); assertFalse(compound.isDone()); future2.set(DATA2); assertFalse(compound.isDone()); listener.expectCall();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 29 16:29:37 UTC 2024 - 144.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
// Attach a listener SingleCallListener listener = new SingleCallListener(); compound.addListener(listener, directExecutor()); // Satisfy each input and check the output assertFalse(compound.isDone()); future1.set(DATA1); assertFalse(compound.isDone()); future2.set(DATA2); assertFalse(compound.isDone()); listener.expectCall();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 29 16:29:37 UTC 2024 - 144.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
* If the specified collection is backed by an ObjectCountHashMap, it will be much more * efficient to iterate over it by index rather than an entry iterator, which will need to * allocate an object for each entry, so we check for that. */ @CheckForNull static <T> ObjectCountHashMap<T> tryGetMap(Iterable<T> multiset) { if (multiset instanceof RegularImmutableMultiset) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
add(e); } } else { super.add(elements); } return this; } private void addDeduping(E element) { requireNonNull(hashTable); // safe because we check for null before calling this method int mask = hashTable.length - 1; int hash = element.hashCode(); for (int i = Hashing.smear(hash); ; i++) { i &= mask; Object previous = hashTable[i];
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
BlockingQueue<Future<T>> futureQueue = Queues.newLinkedBlockingQueue(); long timeoutNanos = unit.toNanos(timeout); // For efficiency, especially in executors with limited // parallelism, check to see if previously submitted tasks are // done before submitting more of them. This interleaving // plus the exception mechanics account for messiness of main // loop. try {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 15 10:40:05 UTC 2024 - 39K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LocalCache.java
* be read without locking. Next fields of nodes are immutable (final). All list additions are * performed at the front of each bin. This makes it easy to check changes, and also fast to * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This * works well for hash tables since the bin lists tend to be short. (The average length is less
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 143.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/base/FinalizableReferenceQueueClassLoaderUnloadingTest.java
* no such references and the tests here check that that trouble has not been in vain. * * When we reference FinalizableReferenceQueue in this test, we are referencing a class that is * loaded by this test and that will obviously remain loaded for as long as the test is running. * So in order to check ClassLoader garbage collection we need to create a new ClassLoader and
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 29 16:29:37 UTC 2024 - 13.3K bytes - Viewed (0)