- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 41 for factor (0.27 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/RegularImmutableMap.java
* * The absent indicator of -1 signed becomes 2^8 - 1 unsigned, which reduces the actual max * size to 2^8 - 1. However, due to a load factor < 1 the limit is never approached. */ byte[] hashTable = new byte[tableSize]; Arrays.fill(hashTable, ABSENT); int outI = 0; entries: for (int i = 0; i < n; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K 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) -
android/guava/src/com/google/common/collect/TreeMultiset.java
// requireNonNull is safe because right must exist in order to get a negative factor. requireNonNull(right); if (right.balanceFactor() > 0) { right = right.rotateRight(); } return rotateLeft(); case 2: // requireNonNull is safe because left must exist in order to get a positive factor. requireNonNull(left); if (left.balanceFactor() < 0) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
* * <ul> * <li>For an empty list, it is 1 (base case). * <li>When r numbers are added to a list of n-r elements, the number of permutations is * increased by a factor of (n choose r). * </ul> */ private static <E> int calculateSize( List<E> sortedInputList, Comparator<? super E> comparator) { int permutations = 1; int n = 1; int r = 1;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K 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/src/com/google/common/collect/Collections2.java
* * <ul> * <li>For an empty list, it is 1 (base case). * <li>When r numbers are added to a list of n-r elements, the number of permutations is * increased by a factor of (n choose r). * </ul> */ private static <E> int calculateSize( List<E> sortedInputList, Comparator<? super E> comparator) { int permutations = 1; int n = 1; int r = 1;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K 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/CompactLinkedHashMap.java
* <p>This class should not be assumed to be universally superior to {@code * java.util.LinkedHashMap}. Generally speaking, this class reduces object allocation and memory * consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. * * @author Louis Wasserman */ @J2ktIncompatible // no support for access-order mode in LinkedHashMap delegate
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) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
contents[5] = e6; System.arraycopy(remaining, 0, contents, 6, remaining.length); return construct(Ordering.natural(), contents.length, (E[]) contents); } // TODO(kevinb): Consider factory methods that reject duplicates /** * Returns an immutable sorted set containing the given elements sorted by their natural ordering.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0)