- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 210 for Kantor (0.18 sec)
-
samples/guide/src/main/java/okhttp3/recipes/kt/PostStreaming.kt
Plain Text - Registered: Fri Apr 19 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 Apr 19 12:43:09 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 Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K 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 Apr 17 11:36:08 GMT 2024 - Last Modified: Thu Feb 15 17:04:41 GMT 2024 - 8.5K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
return 0 } // term = factor | factor ('*' | '/' | '%' | '>>' | '<<' | '&') factor func (p *Parser) term() uint64 { value := p.factor() for { switch p.peek() { case '*': p.next() value *= p.factor() case '/': p.next() if int64(value) < 0 { p.errorf("divide of value with high bit set") } divisor := p.factor() if divisor == 0 {
Go - Registered: Tue Apr 16 11:13:10 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K 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 Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 15K 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) -
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 19 12:43:09 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.3K 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 19 12:43:09 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.7K 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 Apr 21 00:10:10 GMT 2024 - Last Modified: Thu Jan 05 13:09:03 GMT 2023 - 12.3K bytes - Viewed (0)