- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 42 for Kantor (0.19 sec)
-
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* * The absent indicator of -1 signed becomes 2^8 - 1 unsigned, which reduces the actual max * size to 2^8 - 1. However, due to a load factor < 1 the limit is never approached. */ byte[] hashTable = new byte[tableSize]; Arrays.fill(hashTable, ABSENT); int outI = 0; entries: for (int i = 0; i < n; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
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 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K 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/TreeMultiset.java
// requireNonNull is safe because right must exist in order to get a negative factor. requireNonNull(right); if (right.balanceFactor() > 0) { right = right.rotateRight(); } return rotateLeft(); case 2: // requireNonNull is safe because left must exist in order to get a positive factor. requireNonNull(left); if (left.balanceFactor() < 0) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K 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) -
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 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K 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 26 12:43:10 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 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 4.6K bytes - Viewed (0) -
android/guava/src/com/google/common/net/HttpHeaders.java
/** * The HTTP <a href="https://wicg.github.io/ua-client-hints/#sec-ch-ua-form-factor">{@code * Sec-CH-UA-Form-Factor}</a> header field name. * * @since 32.0.0 */ public static final String SEC_CH_UA_FORM_FACTOR = "Sec-CH-UA-Form-Factor"; /** * The HTTP <a * href="https://wicg.github.io/responsive-image-client-hints/#sec-ch-viewport-width">{@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:08:08 GMT 2024 - 34.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
// Represents how tightly we can pack things, as a maximum. private static final double DESIRED_LOAD_FACTOR = 0.7; // If the set has this many elements, it will "max out" the table size private static final int CUTOFF = (int) (MAX_TABLE_SIZE * DESIRED_LOAD_FACTOR); /** * Returns an array size suitable for the backing array of a hash table that uses open addressing
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0)