- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 42 for Kantor (0.14 sec)
-
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/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) -
guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java
private final transient ConcurrentMap<E, Integer> countMap; /** * Creates a new, empty {@code OldConcurrentHashMultiset} using the default initial capacity, * load factor, and concurrency settings. */ public static <E> OldConcurrentHashMultiset<E> create() { return new OldConcurrentHashMultiset<E>(new ConcurrentHashMap<E, Integer>()); } @VisibleForTesting
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed May 09 15:17:25 GMT 2018 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* * <ul> * <li>For an empty list, it is 1 (base case). * <li>When r numbers are added to a list of n-r elements, the number of permutations is * increased by a factor of (n choose r). * </ul> */ private static <E> int calculateSize( List<E> sortedInputList, Comparator<? super E> comparator) { int permutations = 1; int n = 1; int r = 1;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
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) -
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 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/LinkedHashMultimap.java
} } private static final int DEFAULT_KEY_CAPACITY = 16; private static final int DEFAULT_VALUE_SET_CAPACITY = 2; @VisibleForTesting static final double VALUE_SET_LOAD_FACTOR = 1.0; @VisibleForTesting transient int valueSetCapacity = DEFAULT_VALUE_SET_CAPACITY; private transient ValueEntry<K, V> multimapHeaderEntry; private LinkedHashMultimap(int keyCapacity, int valueSetCapacity) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
super(key, value); this.keyHash = keyHash; this.valueHash = valueHash; } } private static final double LOAD_FACTOR = 1.0; /* * The following two arrays may *contain* nulls, but they are never *themselves* null: Even though * they are not initialized inline in the constructor, they are initialized from init(), which the
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0)