- Sort Score
- Result 10 results
- Languages All
Results 151 - 160 of 610 for Implementation (0.13 sec)
-
guava/src/com/google/common/collect/LinkedHashMultiset.java
import java.io.IOException; import java.io.ObjectInputStream; import java.io.ObjectOutputStream; import java.util.LinkedHashMap; import org.checkerframework.checker.nullness.qual.Nullable; /** * A {@code Multiset} implementation with predictable iteration order. Its iterator orders elements * according to when the first occurrence of the element was added. When the multiset contains
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 4K bytes - Viewed (0) -
guava/src/com/google/common/reflect/Types.java
* to custom TypeVariable implementations. As a result, we need to make sure our TypeVariable * implementation respects symmetry. Moreover, we don't want to reconstruct a native type variable * {@code <A>} using our implementation unless some of its bounds have changed in resolution. This * avoids creating unequal TypeVariable implementation unnecessarily. When the bounds do change,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 17 16:33:44 UTC 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
import java.util.Arrays; import java.util.LinkedHashMap; import java.util.Map; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order, * maintained with a doubly linked list through the entries. All optional operations (put and * remove) are supported. Null keys and values are supported. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DenseImmutableTable.java
} this.cellRowIndices = cellRowIndices; this.cellColumnIndices = cellColumnIndices; this.rowMap = new RowMap(); this.columnMap = new ColumnMap(); } /** An immutable map implementation backed by an indexed nullable array. */ private abstract static class ImmutableArrayMap<K, V> extends IteratorBasedImmutableMap<K, V> { private final int size; ImmutableArrayMap(int size) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Nov 30 21:54:06 UTC 2023 - 10K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractContainerTester.java
* plus the given elements, according to {@link #expectContents(java.util.Collection)}. In other * words, for the default {@code expectContents()} implementation, the number of occurrences of * each given element has increased by one since the test collection was created, and the number * of occurrences of all other elements has not changed. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 8.7K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LoadingCache.java
* currently contains a value for {@code key}, and {@link CacheLoader#load} otherwise. Loading is * asynchronous only if {@link CacheLoader#reload} was overridden with an asynchronous * implementation. * * <p>Returns without doing anything if another thread is currently loading the value for {@code * key}. If the cache loader associated with this cache performs refresh asynchronously then this
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Aug 06 17:12:03 UTC 2022 - 8.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableMap.java
try { return fromEntryArrayCheckingBucketOverflow(n, entryArray, throwIfDuplicateKeys); } catch (BucketOverflowException e) { // probable hash flooding attack, fall back to j.u.HM based implementation and use its // implementation of hash flooding protection return JdkBackedImmutableMap.create(n, entryArray, throwIfDuplicateKeys); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 16.2K bytes - Viewed (0) -
guava/src/com/google/common/io/LittleEndianDataInputStream.java
import java.io.DataInput; import java.io.DataInputStream; import java.io.EOFException; import java.io.FilterInputStream; import java.io.IOException; import java.io.InputStream; /** * An implementation of {@link DataInput} that uses little-endian byte ordering for reading {@code * short}, {@code int}, {@code float}, {@code double}, and {@code long} values. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 17 14:35:11 UTC 2023 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/StandardTable.java
import java.util.Iterator; import java.util.LinkedHashMap; import java.util.Map; import java.util.Map.Entry; import java.util.Set; import javax.annotation.CheckForNull; /** * {@link Table} implementation backed by a map that associates row keys with column key / value * secondary maps. This class provides rapid access to records by the row key alone or by both keys, * but not by just the column key. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 29.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
if (endpoints.isOrdered()) { return EndpointPair.ordered(endpoints.target(), endpoints.source()); } return endpoints; } // NOTE: this should work as long as the delegate graph's implementation of edges() (like that of // AbstractGraph) derives its behavior from calling successors(). private static class TransposedGraph<N> extends ForwardingGraph<N> { private final Graph<N> graph;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0)