- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 31 for store (0.13 sec)
-
android/guava/src/com/google/common/base/Suppliers.java
return uncheckedCastNullableTToT(value); } @Override public String toString() { // This is a little strange if the unit the user provided was not NANOS, // but we don't want to store the unit just for toString return "Suppliers.memoizeWithExpiration(" + delegate + ", " + durationNanos + ", NANOS)"; } private static final long serialVersionUID = 0; }
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/collect/RegularImmutableMap.java
* equivalent to RegularImmutableSet, save that instead of having a hash table containing the * elements directly and null for empty positions, we store indices of the keys in the hash table, * and ABSENT for empty positions. We then look up the keys in alternatingKeysAndValues. * * (The index actually stored is the index of the key in alternatingKeysAndValues, which is * double the index of the entry in entrySet.asList.) *
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/collect/TreeMultimap.java
* keys according to the above key ordering, and for each key they iterate across the values * according to the value ordering. * * <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>Null keys and values are permitted (provided, of course, that the respective comparators
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Mar 09 00:21:17 GMT 2024 - 8.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ArrayListMultimap.java
import java.util.HashMap; import java.util.List; import java.util.Map; import org.checkerframework.checker.nullness.qual.Nullable; /** * Implementation of {@code Multimap} that uses an {@code ArrayList} to store the values for a given * key. A {@link HashMap} associates each key with an {@link ArrayList} of values. * * <p>When iterating through the collections supplied by this class, the ordering of values for a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 6.9K bytes - Viewed (0) -
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) -
android/guava/src/com/google/common/io/BaseEncoding.java
* <pre>{@code * BaseEncoding.base16().lowerCase().decode("deadbeef"); * }</pre> * * <p>Warning: BaseEncoding instances are immutable. Invoking a configuration method has no effect * on the receiving instance; you must store and use the new encoding instance it returns, instead. * * <pre>{@code * // Do NOT do this * BaseEncoding hex = BaseEncoding.base16(); * hex.lowerCase(); // does nothing!
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Mar 15 16:33:32 GMT 2024 - 41.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
this.dedupedElements = Arrays.copyOf(toCopy.dedupedElements, toCopy.dedupedElements.length); this.distinct = toCopy.distinct; } /** * Resizes internal data structures if necessary to store the specified number of distinct * elements. */ private void ensureCapacity(int minCapacity) { if (minCapacity > dedupedElements.length) { int newCapacity =
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableCollection.java
static final int DEFAULT_INITIAL_CAPACITY = 4; 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 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 18.7K bytes - Viewed (1) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// completion preferably and AQS is non-deterministic (depends on where in the queue the waiter // is). If we wanted to be strict about it, we could store the unpark() time in the Waiter node // and we could use that to make a decision about whether or not we timed out prior to being // unparked. /** * {@inheritDoc} *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0)