- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 32 for Kantor (0.17 sec)
-
android/guava/src/com/google/common/collect/ObjectCountLinkedHashMap.java
} ObjectCountLinkedHashMap(int expectedSize) { this(expectedSize, DEFAULT_LOAD_FACTOR); } ObjectCountLinkedHashMap(int expectedSize, float loadFactor) { super(expectedSize, loadFactor); } ObjectCountLinkedHashMap(ObjectCountHashMap<K> map) { init(map.size(), DEFAULT_LOAD_FACTOR); for (int i = map.firstIndex(); i != -1; i = map.nextIndex(i)) { put(map.getKey(i), map.getValue(i));
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/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) -
guava/src/com/google/common/collect/Hashing.java
// Round down to the nearest power of 2. expectedEntries = Math.max(expectedEntries, 2); int tableSize = Integer.highestOneBit(expectedEntries); // Check to make sure that we will not exceed the maximum load factor. if (expectedEntries > (int) (loadFactor * tableSize)) { tableSize <<= 1; return (tableSize > 0) ? tableSize : MAX_TABLE_SIZE; } return tableSize; }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Aug 05 00:40:25 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Hashing.java
// Round down to the nearest power of 2. expectedEntries = Math.max(expectedEntries, 2); int tableSize = Integer.highestOneBit(expectedEntries); // Check to make sure that we will not exceed the maximum load factor. if (expectedEntries > (int) (loadFactor * tableSize)) { tableSize <<= 1; return (tableSize > 0) ? tableSize : MAX_TABLE_SIZE; } return tableSize; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Aug 05 00:40:25 GMT 2021 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MutableClassToInstanceMap.java
implements ClassToInstanceMap<B>, Serializable { /** * Returns a new {@code MutableClassToInstanceMap} instance backed by a {@link HashMap} using the * default initial capacity and load factor. */ public static <B extends @Nullable Object> MutableClassToInstanceMap<B> create() { return new MutableClassToInstanceMap<>(new HashMap<Class<? extends @NonNull B>, B>()); } /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 6.9K 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) -
android/guava/src/com/google/common/collect/Maps.java
return new HashMap<>(capacity(expectedSize)); } /** * Returns a capacity that is sufficient to keep the map from being resized as long as it grows no * larger than expectedSize and the load factor is ≥ its default (0.75). */ static int capacity(int expectedSize) { if (expectedSize < 3) { checkNonnegative(expectedSize, "expectedSize"); return expectedSize + 1; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
static final int DEFAULT_EDGE_COUNT = DEFAULT_NODE_COUNT * EXPECTED_DEGREE; // Load factor and capacity for "inner" (i.e. per node/edge element) hash sets or maps static final float INNER_LOAD_FACTOR = 1.0f; static final int INNER_CAPACITY = 2; // ceiling(EXPECTED_DEGREE / INNER_LOAD_FACTOR) // Error messages static final String NODE_NOT_IN_GRAPH = "Node %s is not an element of this graph.";
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedMultiNetworkConnections.java
} static <N, E> DirectedMultiNetworkConnections<N, E> of() { return new DirectedMultiNetworkConnections<>( new HashMap<E, N>(INNER_CAPACITY, INNER_LOAD_FACTOR), new HashMap<E, N>(INNER_CAPACITY, INNER_LOAD_FACTOR), 0); } static <N, E> DirectedMultiNetworkConnections<N, E> ofImmutable( Map<E, N> inEdges, Map<E, N> outEdges, int selfLoopCount) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K bytes - Viewed (0)