- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 33 for cosa (0.17 sec)
-
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* granted immediately, but it is the <i>next</i> request that will experience extra throttling, * thus paying for the cost of the expensive task. * * @author Dimitris Andreou * @since 13.0 */ // TODO(user): switch to nano precision. A natural unit of cost is "bytes", and a micro precision // would mean a maximum rate of "1MB/s", which might be small in some cases. @Beta @J2ktIncompatible @GwtIncompatible
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
* {@link QuantilesBenchmark}. These algorithms each calculate either a single quantile or multiple * quantiles. All algorithms modify the dataset they are given (the cost of a copy to avoid this * will be constant across algorithms). * * @author Pete Gillin * @since 20.0 */ enum QuantilesAlgorithm { /**
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
* {@link QuantilesBenchmark}. These algorithms each calculate either a single quantile or multiple * quantiles. All algorithms modify the dataset they are given (the cost of a copy to avoid this * will be constant across algorithms). * * @author Pete Gillin * @since 20.0 */ enum QuantilesAlgorithm { /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* * <p>The extra bookkeeping done by cycle detecting locks comes at some cost to performance. * Benchmarks (as of December 2011) show that: * * <ul> * <li>for an unnested {@code lock()} and {@code unlock()}, a cycle detecting lock takes 38ns as * opposed to the 24ns taken by a plain lock. * <li>for nested locking, the cost increases with the depth of the nesting: * <ul>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableIntArray.java
* add overloads that accept start and end indexes. * <li>Access to all collection-based utilities via {@link #asList} (though at the cost of * allocating garbage). * </ul> * * <p>Disadvantages compared to {@code int[]}: * * <ul> * <li>Memory footprint has a fixed overhead (about 24 bytes per instance).
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableDoubleArray.java
* add overloads that accept start and end indexes. * <li>Access to all collection-based utilities via {@link #asList} (though at the cost of * allocating garbage). * </ul> * * <p>Disadvantages compared to {@code double[]}: * * <ul> * <li>Memory footprint has a fixed overhead (about 24 bytes per instance).
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 19.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
/** * This neat test shows that no matter what weights we use in our requests, if we push X amount of * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling * [acquire(5), acquire(1)] takes exactly the same time as [acquire(2), acquire(3), acquire(1)]. */ public void testTimeToWarmUpIsHonouredEvenWithWeights() {
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/Iterables.java
// * The element with (index == from) should be kept. // * Everything with (index > from) has not been checked yet. // Check from the end of the list backwards (minimize expected cost of // moving elements when remove() is called). Stop before 'from' because // we already know that should be kept. for (int n = list.size() - 1; n > from; n--) { if (predicate.apply(list.get(n))) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* creation. However, the methods of this class have a large number of overloads that prevent such * allocations in many common cases. * * <p>The message string is not formatted unless the exception will be thrown, so the cost of the * string formatting itself should not be a concern. * * <p>As with any performance concerns, you should consider profiling your code (in a production
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* * Note well that if, for this function, we chose a horizontal line, at height of exactly (1/QPS), * then the effect of the function is non-existent: we serve storedPermits at exactly the same * cost as fresh ones (1/QPS is the cost for each). We use this trick later. * * If we pick a function that goes /below/ that horizontal line, it means that we reduce the area
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)