- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 39 for reducer (0.18 sec)
-
android/guava/src/com/google/common/collect/RegularImmutableMap.java
if (tableSize <= BYTE_MAX_SIZE) { /* * Use 8 bits per entry. The value is unsigned to allow use up to a size of 2^8. * * The absent indicator of -1 signed becomes 2^8 - 1 unsigned, which reduces the actual max * size to 2^8 - 1. However, due to a load factor < 1 the limit is never approached. */ byte[] hashTable = new byte[tableSize]; Arrays.fill(hashTable, ABSENT);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Suppliers.java
} @Override @ParametricNullness public T get() { // Another variant of Double Checked Locking. // // We use two volatile reads. We could reduce this to one by // putting our fields into a holder class, but (at least on x86) // the extra memory consumption and indirection are more // expensive than the extra volatile reads.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 15.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
* Returns a new immutable array containing the values in the specified range. * * <p><b>Performance note:</b> The returned array has the same full memory footprint as this one * does (no actual copying is performed). To reduce memory usage, use {@code subArray(start, * end).trimmed()}. */ public ImmutableIntArray subArray(int startIndex, int endIndex) { Preconditions.checkPositionIndexes(startIndex, endIndex, length());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
* Returns a new immutable array containing the values in the specified range. * * <p><b>Performance note:</b> The returned array has the same full memory footprint as this one * does (no actual copying is performed). To reduce memory usage, use {@code subArray(start, * end).trimmed()}. */ public ImmutableDoubleArray subArray(int startIndex, int endIndex) { Preconditions.checkPositionIndexes(startIndex, endIndex, length());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 19.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
} @VisibleForTesting @WeakOuter final class ValueSet extends Sets.ImprovedAbstractSet<V> implements ValueSetLink<K, V> { /* * We currently use a fixed load factor of 1.0, a bit higher than normal to reduce memory * consumption. */ @ParametricNullness private final K key; @VisibleForTesting @Nullable ValueEntry<K, V>[] hashTable; private int size = 0; private int modCount = 0;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* There is no need for a blocking lock; when the lock is not * available, threads try other slots (or the base). During these * retries, there is increased contention and reduced locality, * which is still better than alternatives. * * Per-thread hash codes are initialized to random values. * Contention and/or table collisions are indicated by failed
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) -
guava-tests/test/com/google/common/io/CharStreamsTest.java
* * <p>CharStreams.copy was failing to clear its CharBuffer after each read call, which effectively * reduced the available size of the buffer each time a call to read didn't fill up the available * space in the buffer completely. In general this is a performance problem since the buffer size * is permanently reduced, but with certain Reader implementations it could also cause the buffer * size to reach 0, causing an infinite loop.
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/CharStreamsTest.java
* * <p>CharStreams.copy was failing to clear its CharBuffer after each read call, which effectively * reduced the available size of the buffer each time a call to read didn't fill up the available * space in the buffer completely. In general this is a performance problem since the buffer size * is permanently reduced, but with certain Reader implementations it could also cause the buffer * size to reach 0, causing an infinite loop.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* storedPermits becomes 10.0 (assuming maxStoredPermits >= 10.0). At that point, a request of * acquire(3) arrives. We serve this request out of storedPermits, and reduce that to 7.0 (how * this is translated to throttling time is discussed later). Immediately after, assume that an * acquire(10) request arriving. We serve the request partly from storedPermits, using all the
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)