- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 107 for separator (5.14 sec)
-
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
rateLimiter.setRate(permitsPerSecond); return rateLimiter; } /** * The underlying timer; used both to measure elapsed time and sleep as necessary. A separate * object to facilitate testing. */ private final SleepingStopwatch stopwatch; // Can't be initialized in the constructor because mocks don't call the constructor.
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) -
android/guava/src/com/google/common/util/concurrent/FluentFuture.java
Function<? super V, T> function, Executor executor) { return (FluentFuture<T>) Futures.transform(this, function, executor); } /** * Registers separate success and failure callbacks to be run when this {@code Future}'s * computation is {@linkplain java.util.concurrent.Future#isDone() complete} or, if the * computation is already complete, immediately. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 11 19:08:44 GMT 2023 - 18.7K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/cache/super/com/google/common/cache/LocalCache.java
throw new UnsupportedOperationException(); } @Override public String toString() { return getKey() + "=" + getValue(); } } // TODO(fry): Separate logic for consistency between emul and nonemul implementation. // TODO(fry): Look into Maps.KeySet and Maps.Values, which can ideally be reused here but are // currently only package visible.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* * if (guardExpression) { * throw new BadException(messageExpression); * } * * refactored so that messageExpression is moved to a separate String-returning method. * * if (guardExpression) { * throw new BadException(badMsg(...)); * } *
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) -
guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
* anything about how the property is tested. To find out, read the code. * <li>These tests are "conformance tests", and do not attempt to test throughput, latency, * scalability or other performance factors (see the separate "jtreg" tests for a set intended * to check these for the most central aspects of functionality.) So, most tests use the * smallest sensible numbers of threads, collection sizes, etc needed to check basic
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 37.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* the factory that created it. * * <p>Note, however, that although multiple locks can be created for a given Enum value, whether * it be through separate factory instances or through multiple calls to the same factory, * attempting to acquire multiple locks with the same Enum value (within the same thread) will
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/util/concurrent/Monitor.java
* from the need for the programmer to remember to use {@code while} instead of {@code if}. However, * one advantage is that we can introduce two separate {@code Condition} objects, which allows us to * use {@code signal()} instead of {@code signalAll()}, which may be a performance benefit. * * <pre>{@code * public class SafeBox<V> { * private V value;
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) -
android/guava/src/com/google/common/math/LongMath.java
/* * We want to do this in long math for speed, but want to avoid overflow. We adapt the * technique previously used by BigIntegerMath: maintain separate numerator and * denominator accumulators, multiplying the fraction into result when near overflow. */ for (int i = 2; i <= k; i++, n--) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
Object[] sortedValues = new Object[size]; // We might, somehow, be able to reorder values in-place. But it doesn't seem like // there's a way around creating the separate sortedKeys array, and if we're allocating // one array of size n, we might as well allocate two -- to say nothing of the allocation // done in Arrays.sort. for (int i = 0; i < size; i++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CaseFormat.java
// deal with camel conversion StringBuilder out = null; int i = 0; int j = -1; while ((j = wordBoundary.indexIn(s, ++j)) != -1) { if (i == 0) { // include some extra space for separators out = new StringBuilder(s.length() + 4 * format.wordSeparator.length()); out.append(format.normalizeFirstWord(s.substring(i, j))); } else {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 19 20:20:14 GMT 2022 - 6.3K bytes - Viewed (0)