- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 16 for insertion (1.3 sec)
-
android/guava/src/com/google/common/collect/TableCollectors.java
checkNotNull(columnFunction, "columnFunction"); checkNotNull(valueFunction, "valueFunction"); checkNotNull(mergeFunction, "mergeFunction"); /* * No mutable Table exactly matches the insertion order behavior of ImmutableTable.Builder, but * the Builder can't efficiently support merging of duplicate values. Getting around this * requires some work. */ return Collector.of(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Mar 09 00:21:17 GMT 2024 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
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. *
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) -
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/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) -
guava/src/com/google/common/collect/ImmutableSet.java
ImmutableCollection.Builder.expandedCapacity(dedupedElements.length, minCapacity); dedupedElements = Arrays.copyOf(dedupedElements, newCapacity); } } /** Adds e to the insertion-order array of deduplicated elements. Calls ensureCapacity. */ final void addDedupedElement(E e) { ensureCapacity(distinct + 1); dedupedElements[distinct++] = e; } /**
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/collect/ImmutableMap.java
/** * Returns an immutable set of the mappings in this map. The iteration order is specified by the * method used to create this map. Typically, this is insertion order. */ @Override public ImmutableSet<Entry<K, V>> entrySet() { ImmutableSet<Entry<K, V>> result = entrySet; return (result == null) ? entrySet = createEntrySet() : result; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K 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-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* iterator's next element and pass it to the reference iterator through this method so it can * return the same element. This enables the assertion to pass and the reference iterator to * properly update its state. */ void promoteToNext(E e) { if (nextElements.remove(e)) { nextElements.push(e); } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0)