- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 121 for insertion (0.28 sec)
-
android/guava/src/com/google/common/collect/HashBiMap.java
/** The "entry" of the first element in insertion order. */ private transient int firstInInsertionOrder; /** The "entry" of the last element in insertion order. */ private transient int lastInInsertionOrder; /** Maps an "entry" to the "entry" that precedes it in insertion order. */ private transient int[] prevInInsertionOrder; /** Maps an "entry" to the "entry" that follows it in insertion order. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultimap.java
* order described in the <a href="#iteration">class documentation</a>. */ public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2, K k3, V v3) { return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3); } /** * Returns an immutable multimap containing the given entries, in the "key-grouped" insertion
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 24.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMultimap.java
* order described in the <a href="#iteration">class documentation</a>. */ public static <K, V> ImmutableMultimap<K, V> of(K k1, V v1, K k2, V v2, K k3, V v3) { return ImmutableListMultimap.of(k1, v1, k2, v2, k3, v3); } /** * Returns an immutable multimap containing the given entries, in the "key-grouped" insertion
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 25.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableCollection.java
copyIntoArray(other, 0); return other; } /** If this collection is backed by an array of its elements in insertion order, returns it. */ @CheckForNull Object[] internalArray() { return null; } /** * If this collection is backed by an array of its elements in insertion order, returns the offset * where this collection's elements start. */ int internalArrayStart() {
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/collect/ImmutableCollection.java
return other; } /** If this collection is backed by an array of its elements in insertion order, returns it. */ @CheckForNull @Nullable Object[] internalArray() { return null; } /** * If this collection is backed by an array of its elements in insertion order, returns the offset * where this collection's elements start. */ int internalArrayStart() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
// we need ObjectCountHashMap-backed contents, with its keys and values array in direct // insertion order contents = new ObjectCountHashMap<E>(contents); isLinkedHash = false; } buildInvoked = true; // contents is now ObjectCountHashMap, but still guaranteed to be in insertion order! return new RegularImmutableMultiset<E>(contents); } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MultimapBuilder.java
} }; } /** Uses an insertion-ordered hash-based {@code Set} to store value collections. */ public SetMultimapBuilder<K0, @Nullable Object> linkedHashSetValues() { return linkedHashSetValues(DEFAULT_EXPECTED_VALUES_PER_KEY); } /** * Uses an insertion-ordered hash-based {@code Set} to store value collections, initialized to
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 17.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* specified access policy. * * @param capacity the capacity of this queue * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal, * are processed in FIFO order; if {@code false} the access order is unspecified. * @throws IllegalArgumentException if {@code capacity} is less than 1 */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
import java.util.Spliterator; import java.util.Spliterators; 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. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
} /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateStarShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(5, 1); putEdge(1, 2); putEdge(3, 1); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0)