- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 72 for insertion (0.19 sec)
-
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/src/com/google/common/hash/BloomFilter.java
*/ public long approximateElementCount() { long bitSize = bits.bitSize(); long bitCount = bits.bitCount(); /** * Each insertion is expected to reduce the # of clear bits by a factor of * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 - * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
} /** * LinkedHashMultimap entries are in no less than three coexisting linked lists: a bucket in the * hash table for a {@code Set<V>} associated with a key, the linked list of insertion-ordered * entries in that {@code Set<V>}, and the linked list of entries in the LinkedHashMultimap as a * whole. */ @VisibleForTesting
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) -
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) -
android/guava/src/com/google/common/collect/SortedLists.java
* Object)} when the key isn't present, since {@code ~insertionIndex} is equal to {@code -1 - * insertionIndex}. */ INVERTED_INSERTION_INDEX { @Override public int resultIndex(int higherIndex) { return ~higherIndex; } }; abstract int resultIndex(int higherIndex); } /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.9K bytes - Viewed (0)