- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 201 for factor (0.17 sec)
-
.teamcity/src/main/kotlin/model/FunctionalTestBucketGenerator.kt
LinkedList(subProjectTestClassTimes), SubprojectTestClassTime::totalTime, { largeElement, factor -> List(factor) { SmallSubprojectBucket(largeElement.subProject, parallelization(factor)) } }, { list -> SmallSubprojectBucket(list.map { it.subProject }, parallelization(1)) },
Plain Text - Registered: Wed May 08 11:36:15 GMT 2024 - Last Modified: Thu Feb 15 17:04:41 GMT 2024 - 8.5K 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) -
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) -
samples/guide/src/main/java/okhttp3/recipes/kt/PostStreaming.kt
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 1.9K 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/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) -
manifests/addons/values-loki.yaml
# use single binary and filesystem storage for test # do not use in production loki: useTestSchema: true auth_enabled: false commonConfig: replication_factor: 1 storage: type: 'filesystem' test: enabled: false lokiCanary: enabled: false monitoring: dashboards: enabled: false rules: enabled: false alerting: false serviceMonitor: enabled: false metricsInstance:
Others - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Tue Apr 09 21:40:53 GMT 2024 - 786 bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
// Might also explore collocating all of [hash, next, predecessor, successor] fields of an // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.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) -
docs/compression/README.md
- Already compressed objects are not fit for compression since they do not have compressible patterns. Such objects do not produce efficient [`LZ compression`](https://en.wikipedia.org/wiki/LZ77_and_LZ78) which is a fitness factor for a lossless data compression. Pre-compressed input typically compresses in excess of 2GiB/s per core, so performance impact should be minimal even if precompressed data is re-compressed.
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Mar 11 11:55:34 GMT 2024 - 5.1K bytes - Viewed (0)