- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 129 for store (0.12 sec)
-
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
// Unfortunately this is pasted from ImmutableCollection.Builder. private static int expandedCapacity(int oldCapacity, int minCapacity) { if (minCapacity < 0) { throw new AssertionError("cannot store more than MAX_VALUE elements"); } // careful of overflow! int newCapacity = oldCapacity + (oldCapacity >> 1) + 1; if (newCapacity < minCapacity) {
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/util/concurrent/AbstractTransformFuture.java
* setException(stackOverflowError) would fail: * * - If the stack overflowed before set()/setValue() could even store the result in the output * Future, then a call setException() would likely also overflow. * * - If the stack overflowed after set()/setValue() stored its result, then a call to * setException() will be a no-op because the Future is already done. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* associated with a key and then add the key back to the multimap, that key will come last in the * key iteration order. * * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an * existing key-value pair has no effect. * * <p>Keys and values may be null. All optional multimap methods are supported, and all returned
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) -
android/guava/src/com/google/common/collect/ObjectCountLinkedHashMap.java
/** * {@code ObjectCountLinkedHashMap} is a subclass of {@code ObjectCountHashMap} with insertion * iteration order, and uses arrays to store key objects and count values. Comparing to using a * traditional {@code LinkedHashMap} implementation which stores keys and count values as map * entries, {@code ObjectCountLinkedHashMap} minimizes object allocation and reduces memory * footprint. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 5.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/IoTestCase.java
// fall back to copying URLs to files in the testDir == null block below } } if (testDir == null) { // testdata resources aren't file:// urls, so create a directory to store them in and then // copy the resources to the filesystem as needed testDir = createTempDir(); } return testDir; } /** Returns the file with the given name under the testdata directory. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 5.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashing.java
@GwtIncompatible @ElementTypesAreNonnullByDefault final class CompactHashing { private CompactHashing() {} /** Indicates blank table entries. */ static final byte UNSET = 0; /** Number of bits used to store the numbers of hash table bits (max 30). */ private static final int HASH_TABLE_BITS_MAX_BITS = 5; /** Use high bits of metadata for modification count. */
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) -
android/guava/src/com/google/common/collect/CompactHashing.java
@GwtIncompatible @ElementTypesAreNonnullByDefault final class CompactHashing { private CompactHashing() {} /** Indicates blank table entries. */ static final byte UNSET = 0; /** Number of bits used to store the numbers of hash table bits (max 30). */ private static final int HASH_TABLE_BITS_MAX_BITS = 5; /** Use high bits of metadata for modification count. */
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/util/concurrent/AggregateFuture.java
* Future.get() when we don't need to (specifically, for whenAllComplete().call*()), and it * lets all futures share the same listener. * * We store `localFutures` inside the listener because `this.futures` might be nulled out by * the time the listener runs for the final future -- at which point we need to check all
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
* {@link #get(Object)}; may contain duplicates), in an increasing index order. */ public Iterable<L> bulkGet(Iterable<? extends Object> keys) { // Initially using the list to store the keys, then reusing it to store the respective L's List<Object> result = newArrayList(keys); if (result.isEmpty()) { return ImmutableList.of(); } int[] stripes = new int[result.size()];
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/Multimaps.java
* specified function to each item in an {@code Iterable} of values. Each value will be stored as * a value in the resulting multimap, yielding a multimap with the same size as the input * iterable. The key used to store that value in the multimap will be the result of calling the * function on that value. The resulting multimap is created as an immutable snapshot. In the
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 86.4K bytes - Viewed (0)