- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for Reymond (0.18 sec)
-
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
// we allow one second worth of work to go in a burst (i.e. take less than a second) assertTrue(burst <= 1000); long afterBurst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random()); // but work beyond that must take at least one second assertTrue(afterBurst >= 1000); } } /** * This neat test shows that no matter what weights we use in our requests, if we push X amount of
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
} /** * Creates and returns a new builder, configured to build {@code MinMaxPriorityQueue} instances * that are limited to {@code maximumSize} elements. Each time a queue grows beyond this bound, it * immediately removes its greatest element (according to its comparator), which might be the * element that was just added. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
// we allow one second worth of work to go in a burst (i.e. take less than a second) assertTrue(burst <= 1000); long afterBurst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random()); // but work beyond that must take at least one second assertTrue(afterBurst >= 1000); } } /** * This neat test shows that no matter what weights we use in our requests, if we push X amount of
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Splitter.java
* This occurs when some pattern has an empty match, even if it doesn't match the empty * string -- for example, if it requires lookahead or the like. The offset must be * increased to look for separators beyond this point, without changing the start position * of the next returned substring -- so nextStart stays the same. */ offset++; if (offset > toSplit.length()) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 23.7K bytes - Viewed (0) -
guava/src/com/google/common/base/Splitter.java
* This occurs when some pattern has an empty match, even if it doesn't match the empty * string -- for example, if it requires lookahead or the like. The offset must be * increased to look for separators beyond this point, without changing the start position * of the next returned substring -- so nextStart stays the same. */ offset++; if (offset > toSplit.length()) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 24.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
} if (expectedSize < Ints.MAX_POWER_OF_TWO) { // This seems to be consistent across JDKs. The capacity argument to HashMap and LinkedHashMap // ends up being used to compute a "threshold" size, beyond which the internal table // will be resized. That threshold is ceilingPowerOfTwo(capacity*loadFactor), where // loadFactor is 0.75 by default. So with the calculation here we ensure that the
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0)