- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 288 for insertion (0.19 sec)
-
guava-testlib/src/com/google/common/collect/testing/ListTestSuiteBuilder.java
testers.add(ListToArrayTester.class); return testers; } /** * Specifies {@link CollectionFeature#KNOWN_ORDER} for all list tests, since lists have an * iteration ordering corresponding to the insertion order. */ @Override public TestSuite createTestSuite() { withFeatures(KNOWN_ORDER); return super.createTestSuite(); } @Override protected List<TestSuite> createDerivedSuites(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 6.3K 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/collect/ObjectCountLinkedHashMap.java
import com.google.common.annotations.VisibleForTesting; import java.util.Arrays; import org.checkerframework.checker.nullness.qual.Nullable; /** * {@code ObjectCountLinkedHashMap} is a subclass of {@code ObjectCountHashMap} with insertion * iteration order, and uses arrays to store key objects and count values. Comparing to using a * traditional {@code LinkedHashMap} implementation which stores keys and count values as map
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 5.9K 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) -
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/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) -
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-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)