- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 28 for Bush (0.17 sec)
-
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) -
.github/workflows/scorecard.yml
branch_protection_rule: # To guarantee Maintained check is occasionally updated. See # https://github.com/ossf/scorecard/blob/main/docs/checks.md#maintained schedule: - cron: '45 9 * * 0' push: branches: [ "master" ] # Declare default permissions as read only. permissions: read-all jobs: analysis: name: Scorecard analysis runs-on: ubuntu-latest permissions:
Others - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 29 23:37:56 GMT 2024 - 2.9K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/TrieParser.java
for (; idx < encodedLen; idx++) { c = encoded.charAt(idx); if (c == '&' || c == '?' || c == '!' || c == ':' || c == ',') { break; } } stack.push(reverse(encoded.subSequence(start, idx))); if (c == '!' || c == '?' || c == ':' || c == ',') { // '!' represents an interior node that represents a REGISTRY entry in the map.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Oct 13 19:20:43 GMT 2022 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
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(); @Override
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 38.5K bytes - Viewed (0)