- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 18 for Kantor (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 Apr 26 11:42:10 GMT 2024 - Last Modified: Fri Jul 06 03:18:15 GMT 2018 - 2.1K 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/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 Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K 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 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.3K 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 Apr 26 20:58:09 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 2.4K 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 Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
samples/guide/src/main/java/okhttp3/recipes/PostStreamingWithPipe.java
sink.writeUtf8(String.format(" * %s = %s\n", i, factor(i))); } sink.close(); } catch (IOException | InterruptedException e) { e.printStackTrace(); } } 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);
Java - Registered: Fri Apr 26 11:42:10 GMT 2024 - Last Modified: Fri Jul 06 03:18:15 GMT 2018 - 3.1K bytes - Viewed (0) -
maven-core/src/test/java/org/apache/maven/project/canonical/CanonicalProjectBuilderTest.java
configuration = execution.getDelegate().getConfiguration(); assertEquals( "ContinuumPro", configuration.getChild("plexusApplicationName").getValue()); // Plugin1 [antlr] }
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 3.5K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/SmbException.java
* negative so it with NT_STATUS_SUCCESS (0) the binary search will not be * performed properly. The effect is that the code at index 1 is never found * (NT_STATUS_UNSUCCESSFUL). So here we factor out NT_STATUS_SUCCESS * as a special case (which it is). */ if (errcode == 0) { return "NT_STATUS_SUCCESS"; } if(( errcode & 0xC0000000 ) == 0xC0000000 ) {
Java - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 5.5K bytes - Viewed (0)