- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 277 for factor (0.29 sec)
-
src/test/java/org/codelibs/fess/helper/QueryHelperTest.java
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 37.3K bytes - Viewed (0) -
guava/src/com/google/common/base/SmallCharMatcher.java
private static final double DESIRED_LOAD_FACTOR = 0.5; /** * Returns an array size suitable for the backing array of a hash table that uses open addressing * with linear probing in its implementation. The returned size is the smallest power of two that * can hold setSize elements with the desired load factor. */ @VisibleForTesting static int chooseTableSize(int setSize) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
src/test/java/jcifs/tests/FileAttributesTest.java
if ( ( getContext().getConfig().getCapabilities() & SmbConstants.CAP_NT_SMBS ) == 0 ) { // only have second precision // there seems to be some random factor (adding one second) int diff = Math.abs((int) ( ( time / 1000 ) - ( f.lastModified() / 1000 ) )); Assert.assertTrue("Have set time correctly", diff < 2); }
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Thu Jan 05 13:09:03 GMT 2023 - 12.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedGraphConnections.java
case UNORDERED: return new UndirectedGraphConnections<>( new HashMap<N, V>(INNER_CAPACITY, INNER_LOAD_FACTOR)); case STABLE: return new UndirectedGraphConnections<>( new LinkedHashMap<N, V>(INNER_CAPACITY, INNER_LOAD_FACTOR)); default: throw new AssertionError(incidentEdgeOrder.type()); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
private static final double DESIRED_LOAD_FACTOR = 0.5; /** * Returns an array size suitable for the backing array of a hash table that uses open addressing * with linear probing in its implementation. The returned size is the smallest power of two that * can hold setSize elements with the desired load factor. */ @VisibleForTesting static int chooseTableSize(int setSize) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
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) -
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/graph/DirectedGraphConnections.java
import static com.google.common.base.Preconditions.checkState; import static com.google.common.graph.GraphConstants.INNER_CAPACITY; import static com.google.common.graph.GraphConstants.INNER_LOAD_FACTOR; import static com.google.common.graph.Graphs.checkNonNegative; import static com.google.common.graph.Graphs.checkPositive; import com.google.common.base.Function; import com.google.common.collect.AbstractIterator;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedMultiNetworkConnections.java
package com.google.common.graph; import static com.google.common.base.Preconditions.checkState; import static com.google.common.graph.GraphConstants.INNER_CAPACITY; import static com.google.common.graph.GraphConstants.INNER_LOAD_FACTOR; import com.google.common.collect.HashMultiset; import com.google.common.collect.ImmutableMap; import com.google.common.collect.Multiset; import com.google.errorprone.annotations.concurrent.LazyInit;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.7K 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)