- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 22 for Kantor (0.22 sec)
-
guava/src/com/google/common/collect/ImmutableSet.java
// Represents how tightly we can pack things, as a maximum. private static final double DESIRED_LOAD_FACTOR = 0.7; // If the set has this many elements, it will "max out" the table size private static final int CUTOFF = (int) (MAX_TABLE_SIZE * DESIRED_LOAD_FACTOR); /** * Returns an array size suitable for the backing array of a hash table that uses open addressing
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/ConcurrentHashMultiset.java
Serialization.getFieldSetter(ConcurrentHashMultiset.class, "countMap"); } /** * Creates a new, empty {@code ConcurrentHashMultiset} using the default initial capacity, load * factor, and concurrency settings. */ public static <E> ConcurrentHashMultiset<E> create() { // TODO(schmoe): provide a way to use this class with other (possibly arbitrary)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 20.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
private final transient ConcurrentMap<E, Integer> countMap; /** * Creates a new, empty {@code OldConcurrentHashMultiset} using the default initial capacity, * load factor, and concurrency settings. */ public static <E> OldConcurrentHashMultiset<E> create() { return new OldConcurrentHashMultiset<E>(new ConcurrentHashMap<E, Integer>()); } @VisibleForTesting
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 06 12:56:11 GMT 2023 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
*/ @VisibleForTesting transient long[] entries; /** The load factor. */ private transient float loadFactor; /** When we have this many elements, resize the hashtable. */ private transient int threshold; /** Constructs a new empty instance of {@code ObjectCountHashMap}. */ ObjectCountHashMap() { init(DEFAULT_SIZE, DEFAULT_LOAD_FACTOR); } ObjectCountHashMap(ObjectCountHashMap<? extends K> map) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSet.java
// Represents how tightly we can pack things, as a maximum. private static final double DESIRED_LOAD_FACTOR = 0.7; // If the set has this many elements, it will "max out" the table size private static final int CUTOFF = (int) (MAX_TABLE_SIZE * DESIRED_LOAD_FACTOR); /** * Returns an array size suitable for the backing array of a hash table that uses open addressing
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) -
maven-core/src/test/java/org/apache/maven/plugin/PluginManagerTest.java
void testMojoConfigurationIsMergedCorrectly() throws Exception {} /** * The case where the user wants to specify an alternate version of the underlying tool. Common case * is in the Antlr plugin which comes bundled with a version of Antlr but the user often times needs * to use a specific version. We need to make sure the version that they specify takes precedence. */ @Test
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Sat Apr 15 17:24:20 GMT 2023 - 13.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/LinkedHashMultimapTest.java
assertEquals(z, valueSet.size()); assertFalse( Hashing.needsResizing( valueSet.size(), valueSet.hashTable.length, LinkedHashMultimap.VALUE_SET_LOAD_FACTOR)); } } private Multimap<String, Integer> initializeMultimap5() { Multimap<String, Integer> multimap = LinkedHashMultimap.create(); multimap.put("foo", 5); multimap.put("bar", 4);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 10:16:44 GMT 2024 - 16.3K 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) -
src/main/java/org/codelibs/core/collection/ArrayMap.java
listTable = new Entry[initialCapacity]; threshold = (int) (initialCapacity * LOAD_FACTOR); } /** * 指定された{@link Map}と同じマッピングでインスタンスを構築します。 * * @param map * マッピングがこのマップに配置されるマップ */ public ArrayMap(final Map<? extends K, ? extends V> map) { this((int) (map.size() / LOAD_FACTOR) + 1); putAll(map); } @Override public int size() {
Java - Registered: Fri May 03 20:58:11 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 20.6K bytes - Viewed (1) -
android/guava/src/com/google/common/net/HttpHeaders.java
/** * The HTTP <a href="https://wicg.github.io/ua-client-hints/#sec-ch-ua-form-factor">{@code * Sec-CH-UA-Form-Factor}</a> header field name. * * @since 32.0.0 */ public static final String SEC_CH_UA_FORM_FACTOR = "Sec-CH-UA-Form-Factor"; /** * The HTTP <a * href="https://wicg.github.io/responsive-image-client-hints/#sec-ch-viewport-width">{@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:08:08 GMT 2024 - 34.3K bytes - Viewed (0)