- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 156 for minimum (0.15 sec)
-
android/guava/src/com/google/common/hash/HashFunction.java
* token attempt, one measure of the quality of a hash function is <i>how well</i> it succeeds * at this goal. Important note: it may be easy to achieve the theoretical minimum collision * rate when using completely <i>random</i> sample input. The true test of a hash function is * how it performs on representative real-world data, which tends to contain many hidden
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TreeRangeMapTest.java
rangeMap.put(Range.closedOpen(18, 19), 3); rangeMap.putCoalescing(Range.closedOpen(-5, -4), 0); // disconnected rangeMap.putCoalescing(Range.closedOpen(-6, -5), 0); // lower than minimum rangeMap.putCoalescing(Range.closedOpen(2, 4), 1); // between rangeMap.putCoalescing(Range.closedOpen(9, 14), 0); // different value rangeMap.putCoalescing(Range.closedOpen(17, 20), 3); // enclosing
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 33.2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Ascii.java
* characters in perforated tape. * * @since 8.0 */ public static final byte DEL = 127; /** * The minimum value of an ASCII character. * * @since 9.0 (was type {@code int} before 12.0) */ public static final char MIN = 0; /** * The maximum value of an ASCII character. * * @since 9.0 (was type {@code int} before 12.0) */ public static final char MAX = 127;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* "permits / time", thus "1 / rate = time / permits". Thus, "1/rate" (time / permits) times * "permits" gives time, i.e., integrals on this function (which is what storedPermitsToWaitTime() * computes) correspond to minimum intervals between subsequent requests, for the specified number * of requested permits. * * Here is an example of storedPermitsToWaitTime: If storedPermits == 10.0, and we want 3 permits,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMaker.java
return this; } Equivalence<Object> getKeyEquivalence() { return MoreObjects.firstNonNull(keyEquivalence, getKeyStrength().defaultEquivalence()); } /** * Sets the minimum total size for the internal hash tables. For example, if the initial capacity * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 13 14:30:51 GMT 2023 - 12.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
newTop.left = left; newTop.distinctElements = distinctElements - 1; newTop.totalCount = totalCount - oldElemCount; return newTop.rebalance(); } } // Removes the minimum node from this subtree to be reused elsewhere @CheckForNull private AvlNode<E> removeMin(AvlNode<E> node) { if (left == null) { return right; } else { left = left.removeMin(node);
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/Lists.java
* * <p>This is useful when a varargs method needs to use a signature such as {@code (Foo firstFoo, * Foo... moreFoos)}, in order to avoid overload ambiguity or to enforce a minimum argument count. * * <p>The returned list is serializable and implements {@link RandomAccess}. * * @param first the first element * @param rest an array of additional elements, possibly empty
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
} }; } }; } /** * Returns an unmodifiable view of the intersection of two multisets. In the returned multiset, * the count of each element is the <i>minimum</i> of its counts in the two backing multisets, * with elements that would have a count of 0 not included. The iteration order of the returned
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
guava/src/com/google/common/base/Ascii.java
* characters in perforated tape. * * @since 8.0 */ public static final byte DEL = 127; /** * The minimum value of an ASCII character. * * @since 9.0 (was type {@code int} before 12.0) */ public static final char MIN = 0; /** * The maximum value of an ASCII character. * * @since 9.0 (was type {@code int} before 12.0) */ public static final char MAX = 127;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* Long.MIN_VALUE or Long.MAX_VALUE. * - Favor responding to interrupts over timeouts. * - System.nanoTime() is expensive enough that we want to call it the minimum required number of * times, typically once before invoking a blocking method. This often requires keeping track of * the first time in a method that nanoTime() has been invoked, for which the special value 0L
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0)