- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for secondary (0.17 sec)
-
guava/src/com/google/common/collect/CompoundOrdering.java
final Comparator<? super T>[] comparators; @SuppressWarnings("unchecked") // Generic array creation CompoundOrdering(Comparator<? super T> primary, Comparator<? super T> secondary) { this.comparators = (Comparator<? super T>[]) new Comparator<?>[] {primary, secondary}; } @SuppressWarnings("unchecked") // Generic array creation CompoundOrdering(Iterable<? extends Comparator<? super T>> comparators) { this.comparators =
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompoundOrdering.java
final Comparator<? super T>[] comparators; @SuppressWarnings("unchecked") // Generic array creation CompoundOrdering(Comparator<? super T> primary, Comparator<? super T> secondary) { this.comparators = (Comparator<? super T>[]) new Comparator<?>[] {primary, secondary}; } @SuppressWarnings("unchecked") // Generic array creation CompoundOrdering(Iterable<? extends Comparator<? super T>> comparators) { this.comparators =
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 2.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/hash/HashCodeBenchmark.java
* whereToDiffer} produces no observable change in performance. We want to make sure that the array * equals implementation is *not* short-circuiting to prevent timing-based attacks. Being fast is * only a secondary goal. * * @author Kurt Alfred Kluever */ public class HashCodeBenchmark { // Use a statically configured random instance for all of the benchmarks private static final Random random = new Random(42);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/HashCodeBenchmark.java
* whereToDiffer} produces no observable change in performance. We want to make sure that the array * equals implementation is *not* short-circuiting to prevent timing-based attacks. Being fast is * only a secondary goal. * * @author Kurt Alfred Kluever */ public class HashCodeBenchmark { // Use a statically configured random instance for all of the benchmarks private static final Random random = new Random(42);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
return secondary; } }; assertTrue(transformAsync(immediate, function, directExecutor()).cancel(true)); assertTrue(secondary.isCancelled()); assertTrue(secondary.wasInterrupted()); } public void testTransformAsync_inputCancelButNotInterruptPropagatesToOutput() throws Exception { SettableFuture<Foo> f1 = SettableFuture.create();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 144.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
return secondary; } }; assertTrue(transformAsync(immediate, function, directExecutor()).cancel(true)); assertTrue(secondary.isCancelled()); assertTrue(secondary.wasInterrupted()); } public void testTransformAsync_inputCancelButNotInterruptPropagatesToOutput() throws Exception { SettableFuture<Foo> f1 = SettableFuture.create();
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 144.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/TimeLimiter.java
* UncheckedTimeoutException} to the caller. * * <p>It is important to note that the primary purpose of the proxy object is to return control to * the caller when the timeout elapses; aborting the target method call is of secondary concern. * The particular nature and strength of the guarantees made by the proxy is * implementation-dependent. However, it is important that each of the methods on the target
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 18:32:03 GMT 2023 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
} public void testImmediateTryAcquire() { RateLimiter r = RateLimiter.create(1); assertTrue("Unable to acquire initial permit", r.tryAcquire()); assertFalse("Capable of acquiring secondary permit", r.tryAcquire()); } public void testDoubleMinValueCanAcquireExactlyOnce() { RateLimiter r = RateLimiter.create(Double.MIN_VALUE, stopwatch);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* holds the lock. If a hashed slot is empty, and lock is * available, a new Cell is created. Otherwise, if the slot * exists, a CAS is tried. Retries proceed by "double hashing", * using a secondary hash (Marsaglia XorShift) to try to find a * free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU,
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0)