- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 246 for insertions (0.27 sec)
-
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/Platform.java
/** * Returns the platform preferred map implementation that preserves insertion order when used only * for insertions. */ static <K, V> Map<K, V> preservesInsertionOrderOnPutsMap() { return Maps.newLinkedHashMap(); } /** * Returns the platform preferred set implementation that preserves insertion order when used only * for insertions. */ static <E> Set<E> preservesInsertionOrderOnAddsSet() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Jun 29 18:16:45 GMT 2023 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
/** * Computes the optimal k (number of hashes per element inserted in Bloom filter), given the * expected insertions and total number of bits in the Bloom filter. * * <p>See http://en.wikipedia.org/wiki/File:Bloom_filter_fp_probability.svg for the formula. * * @param n expected insertions (must be positive) * @param m total number of bits in Bloom filter (must be positive) */ @VisibleForTesting
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-tests/test/com/google/common/hash/BloomFilterTest.java
double actualReportedFpp = bf.expectedFpp(); assertEquals(expectedReportedFpp, actualReportedFpp, 0.00033); } /** Sanity checking with many combinations of false positive rates and expected insertions */ public void testBasic() { for (double fpr = 0.0000001; fpr < 0.1; fpr *= 10) { for (int expectedInsertions = 1; expectedInsertions <= 10000; expectedInsertions *= 10) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Platform.java
* table. */ static <E extends @Nullable Object> Set<E> newLinkedHashSetWithExpectedSize(int expectedSize) { return CompactLinkedHashSet.createWithExpectedSize(expectedSize); } /** * Returns the platform preferred map implementation that preserves insertion order when used only * for insertions. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 4.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
double actualReportedFpp = bf.expectedFpp(); assertEquals(expectedReportedFpp, actualReportedFpp, 0.00033); } /** Sanity checking with many combinations of false positive rates and expected insertions */ public void testBasic() { for (double fpr = 0.0000001; fpr < 0.1; fpr *= 10) { for (int expectedInsertions = 1; expectedInsertions <= 10000; expectedInsertions *= 10) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K 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-tests/test/com/google/common/graph/ElementOrderTest.java
} @Test public void nodeOrder_insertion() { MutableGraph<Integer> graph = GraphBuilder.directed().nodeOrder(insertion()).build(); addNodes(graph); assertThat(graph.nodeOrder()).isEqualTo(insertion()); assertThat(graph.nodes()).containsExactly(3, 1, 4).inOrder(); } // The default ordering is INSERTION unless otherwise specified. @Test public void nodeOrder_default() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code edges()}: Stable order * <li>{@code adjacentNodes(node)}: Connecting edge insertion order * <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Edge insertion order * </ul> * <li>For {@link Network}: * <ul>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 6.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/StandardMutableUndirectedNetworkTest.java
return Arrays.asList( new Object[][] { {false, false, ElementOrder.insertion(), ElementOrder.insertion()}, {true, false, ElementOrder.insertion(), ElementOrder.insertion()}, {false, false, naturalElementOrder, naturalElementOrder}, {true, true, ElementOrder.insertion(), ElementOrder.insertion()}, }); } private final boolean allowsSelfLoops;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 09 17:01:22 GMT 2020 - 2.6K bytes - Viewed (0)