- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 26 for Kantor (0.23 sec)
-
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) -
src/main/java/org/codelibs/core/collection/ArrayMap.java
listTable = new Entry[initialCapacity]; threshold = (int) (initialCapacity * LOAD_FACTOR); } /** * 指定された{@link Map}と同じマッピングでインスタンスを構築します。 * * @param map * マッピングがこのマップに配置されるマップ */ public ArrayMap(final Map<? extends K, ? extends V> map) { this((int) (map.size() / LOAD_FACTOR) + 1); putAll(map); } @Override public int size() {
Java - Registered: Fri Apr 26 20:58:09 GMT 2024 - Last Modified: Thu Mar 07 01:59:08 GMT 2024 - 20.6K bytes - Viewed (1) -
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 Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConcurrentHashMultiset.java
Serialization.getFieldSetter(ConcurrentHashMultiset.class, "countMap"); } /** * Creates a new, empty {@code ConcurrentHashMultiset} using the default initial capacity, load * factor, and concurrency settings. */ public static <E> ConcurrentHashMultiset<E> create() { // TODO(schmoe): provide a way to use this class with other (possibly arbitrary)
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 20.9K 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) -
src/test/java/org/codelibs/fess/helper/QueryHelperTest.java
Java - Registered: Mon Apr 29 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) -
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) -
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 Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0)