- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 69 for storage (0.21 sec)
-
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/util/concurrent/AbstractTransformFuture.java
* StackOverflowError (from deep transform(..., directExecutor()) nesting), and calling * 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
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) -
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) -
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) -
android/guava/src/com/google/common/collect/AbstractMapBasedMultimap.java
*/ private transient Map<K, Collection<V>> map; private transient int totalSize; /** * Creates a new multimap that uses the provided map. * * @param map place to store the mapping from each key to its corresponding values * @throws IllegalArgumentException if {@code map} is not empty */ protected AbstractMapBasedMultimap(Map<K, Collection<V>> map) { checkArgument(map.isEmpty());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 46.6K bytes - Viewed (0) -
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) -
guava/src/com/google/common/cache/LocalCache.java
* To maintain this code, make a change for the strong reference type. Then, cut and paste, and * replace "Strong" with "Soft" or "Weak" within the pasted text. The primary difference is that * strong entries store the key reference directly while soft and weak entries delegate to their * respective superclasses. */ /** Used for strongly-referenced keys. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterables.java
* method. The returned lists implement {@link RandomAccess}, whether or not the input list does. * * <p><b>Note:</b> The current implementation eagerly allocates storage for {@code size} elements. * As a consequence, passing values like {@code Integer.MAX_VALUE} can lead to {@link * OutOfMemoryError}. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 42.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
* inner lists of three and two elements, all in the original order. * * <p>The returned lists implement {@link java.util.RandomAccess}. * * <p><b>Note:</b> The current implementation eagerly allocates storage for {@code size} elements. * As a consequence, passing values like {@code Integer.MAX_VALUE} can lead to {@link * OutOfMemoryError}. * * @param iterator the iterator to return a partitioned view of
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 50.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
predecessorCount <= adjacentNodeValues.size() && successorCount <= adjacentNodeValues.size()); } static <N, V> DirectedGraphConnections<N, V> of(ElementOrder<N> incidentEdgeOrder) { // We store predecessors and successors in the same map, so double the initial capacity. int initialCapacity = INNER_CAPACITY * 2; List<NodeConnection<N>> orderedNodeConnections; switch (incidentEdgeOrder.type()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0)