- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 90 for factor (0.27 sec)
-
src/main/java/org/codelibs/core/collection/LruHashMap.java
*/ protected static final float DEFAULT_LOAD_FACTOR = 0.75f; /** * 上限サイズです。 */ protected final int limitSize; /** * {@link LruHashMap}を作成します。 * * @param limitSize * エントリ数の上限 */ public LruHashMap(final int limitSize) { this(limitSize, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR); } /** * {@link LruHashMap}を作成します。
Java - Registered: Fri May 03 20:58:11 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 2.4K 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) -
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/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/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/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/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/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) -
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) -
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)