- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 105 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) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.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 populateTShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(1, 2); // Duplicate putEdge(4, 5); } // Element Mutation
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K 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) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0)