- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 27 for Bush (0.16 sec)
-
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
// 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 * 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
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/util/concurrent/Monitor.java
@GuardedBy("lock") private void beginWaitingFor(Guard guard) { int waiters = guard.waiterCount++; if (waiters == 0) { // push guard onto activeGuards guard.next = activeGuards; activeGuards = guard; } } /** Records that the current thread is no longer waiting on the specified guard. */ @GuardedBy("lock")
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/collect/ImmutableSortedSet.java
result.descendingSet = this; } return result; } // Most classes should implement this as new DescendingImmutableSortedSet<E>(this), // but we push down that implementation because ProGuard can't eliminate it even when it's always // overridden. @GwtIncompatible // NavigableSet abstract ImmutableSortedSet<E> createDescendingSet(); /** @since 12.0 */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* push to on a call to {@code set()}). */ @Nullable Stack<E> stackWithLastReturnedElementAtTop = null; MultiExceptionListIterator(List<E> expectedElements) { Helpers.addAll(nextElements, Helpers.reverse(expectedElements)); for (int i = 0; i < startIndex; i++) { previousElements.push(nextElements.pop()); } } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 20.7K bytes - Viewed (0) -
build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/source/SourceMetaDataVisitor.java
} findAnnotations(typeDeclaration, currentClass); allClasses.add(currentClass); repository.put(className, currentClass); classStack.push(currentClass); action.run(); classStack.pop(); } private ClassMetaData getCurrentClass() { return classStack.peek(); }
Java - Registered: Wed Apr 17 11:36:08 GMT 2024 - Last Modified: Thu Sep 21 13:27:02 GMT 2023 - 11.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractMapBasedMultiset.java
} return true; } @Override public final void clear() { backingMap.clear(); size = 0; } /** * Skeleton of per-entry iterators. We could push this down and win a few bytes, but it's complex * enough it's not especially worth it. */ abstract class Itr<T extends @Nullable Object> implements Iterator<T> { int entryIndex = backingMap.firstIndex();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* * <h3>Providing input to a hash function</h3> * * <p>The primary way to provide the data that your hash function should act on is via a {@link * Hasher}. Obtain a new hasher from the hash function using {@link #newHasher}, "push" the relevant * data into it using methods like {@link Hasher#putBytes(byte[])}, and finally ask for the {@code * HashCode} when finished using {@link Hasher#hash}. (See an {@linkplain #newHasher example} of * this.) *
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) -
android/guava/src/com/google/common/collect/Synchronized.java
synchronized (mutex) { return delegate().removeLastOccurrence(o); } } @Override public void push(E e) { synchronized (mutex) { delegate().push(e); } } @Override public E pop() { synchronized (mutex) { return delegate().pop(); } } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 53.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
*/ double stableIntervalMicros; /** * The time when the next request (no matter its size) will be granted. After granting a request, * this is pushed further in the future. Large requests push this further than small requests. */ private long nextFreeTicketMicros = 0L; // could be either in the past or future private SmoothRateLimiter(SleepingStopwatch stopwatch) { super(stopwatch); }
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/util/concurrent/AbstractFuture.java
// afterDone() should be generally fast and only used for cleanup work... but in theory can // also be recursive and create StackOverflowErrors future.afterDone(); // push the current set of listeners onto next next = future.clearListeners(next); future = null; while (next != null) { Listener curr = next; next = next.next; /*
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0)