- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 69 for reducer (0.23 sec)
-
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
// Since the last element of the heap is from the bottom level, we // optimistically fill index position with elements from lower levels, // moving the hole down. In most cases this reduces the number of // comparisons with toTrickle, but in some cases we will need to bubble it // all the way up again. int vacated = heap.fillHoleAt(index); // Try to see if toTrickle can be bubbled up min levels.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* * <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashSet}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. * * @author Louis Wasserman */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Supplier.java
* * <p>This interface is now a legacy type. Use {@code java.util.function.Supplier} (or the * appropriate primitive specialization such as {@code IntSupplier}) instead whenever possible. * Otherwise, at least reduce <i>explicit</i> dependencies on this type by using lambda expressions * or method references instead of classes, leaving your code easier to migrate in the future. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 01:41:50 GMT 2024 - 2.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* * <p>This class supports an optional fairness policy for ordering waiting producer and consumer * threads. By default, this ordering is not guaranteed. However, a queue constructed with fairness * set to {@code true} grants threads access in FIFO order. Fairness generally decreases throughput * but reduces variability and avoids starvation. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LongAdder.java
/** * One or more variables that together maintain an initially zero {@code long} sum. When updates * (method {@link #add}) are contended across threads, the set of variables may grow dynamically to * reduce contention. Method {@link #sum} (or, equivalently, {@link #longValue}) returns the current * total combined across the variables maintaining the sum. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 15 18:00:07 GMT 2021 - 5.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
} /** * Returns a larger power of 2 hashtable size given the current mask. * * <p>For hashtable sizes less than or equal to 32, the returned power of 2 is 4x the current * hashtable size to reduce expensive rehashing. Otherwise the returned power of 2 is 2x the * current hashtable size. */ static int newCapacity(int mask) { return ((mask < 32) ? 4 : 2) * (mask + 1); }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
* process it; all should produce the same answer, the only difference should be the number of * process()/processRemaining() invocations, due to alignment. */ @AndroidIncompatible // slow. TODO(cpovirk): Maybe just reduce iterations under Android. public void testExhaustive() throws Exception { Random random = new Random(0); // will iteratively make more debuggable, each time it breaks
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashing.java
} /** * Returns a larger power of 2 hashtable size given the current mask. * * <p>For hashtable sizes less than or equal to 32, the returned power of 2 is 4x the current * hashtable size to reduce expensive rehashing. Otherwise the returned power of 2 is 2x the * current hashtable size. */ static int newCapacity(int mask) { return ((mask < 32) ? 4 : 2) * (mask + 1); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Aug 02 21:41:22 GMT 2021 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* * <p><b>Java 8+ users:</b> Use a chain of calls to {@link Comparator#thenComparing(Comparator)}, * or {@code comparatorCollection.stream().reduce(Comparator::thenComparing).get()} (if the * collection might be empty, also provide a default comparator as the {@code identity} parameter * to {@code reduce}). * * @param comparators the comparators to try in order */ @GwtCompatible(serializable = true)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableBiMapTest.java
/** * Tests for {@link ImmutableBiMap}. * * @author Jared Levy */ @GwtCompatible(emulated = true) @ElementTypesAreNonnullByDefault public class ImmutableBiMapTest extends TestCase { // TODO: Reduce duplication of ImmutableMapTest code @J2ktIncompatible @GwtIncompatible // suite public static Test suite() { TestSuite suite = new TestSuite(); suite.addTest(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 22.4K bytes - Viewed (0)