- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 606 for factor (0.18 sec)
-
samples/guide/src/main/java/okhttp3/recipes/PostStreaming.java
sink.writeUtf8("-------\n"); for (int i = 2; i <= 997; i++) { sink.writeUtf8(String.format(" * %s = %s\n", i, factor(i))); } } private String factor(int n) { for (int i = 2; i < n; i++) { int x = n / i; if (x * i == n) return factor(x) + " × " + i; } return Integer.toString(n); } }; Request request = new Request.Builder()
Java - Registered: Fri Mar 22 11:42:09 GMT 2024 - Last Modified: Fri Jul 06 03:18:15 GMT 2018 - 2.1K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/helper/QueryHelperTest.java
Java - Registered: Mon Mar 25 08:04:08 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 37.3K bytes - Viewed (0) -
istioctl/pkg/writer/envoy/configdump/testdata/endpoint/configdump.json
"@type": "type.googleapis.com/envoy.config.endpoint.v3.ClusterLoadAssignment", "cluster_name": "zipkin", "policy": { "overprovisioning_factor": 140 } } }, { "endpoint_config": {
Json - Registered: Wed Mar 27 22:53:09 GMT 2024 - Last Modified: Tue Jul 12 02:25:59 GMT 2022 - 66K bytes - Viewed (0) -
.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 Mar 27 11:36:08 GMT 2024 - Last Modified: Thu Feb 15 17:04:41 GMT 2024 - 8.5K 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 Mar 22 12:43:11 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.7K bytes - Viewed (0) -
samples/guide/src/main/java/okhttp3/recipes/kt/PostStreaming.kt
Plain Text - Registered: Fri Mar 22 11:42:09 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 1.9K 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 Mar 22 12:43:11 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 Mar 22 12:43:11 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K bytes - Viewed (0) -
cmd/data-scanner.go
} } } // Sleep sleeps the specified time multiplied by the sleep factor. // If the factor is updated the sleep will be done again with the new factor. func (d *dynamicSleeper) Sleep(ctx context.Context, base time.Duration) { for { // Grab current values d.mu.RLock() minWait, maxWait := d.minSleep, d.maxSleep factor := d.factor cycle := d.cycle d.mu.RUnlock()
Go - Registered: Sun Mar 24 19:28:08 GMT 2024 - Last Modified: Thu Mar 21 17:21:35 GMT 2024 - 46.7K 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 Mar 22 12:43:11 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0)