- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for McGuire (0.22 sec)
-
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
limiter.acquire(Integer.MAX_VALUE / 4); limiter.acquire(Integer.MAX_VALUE / 2); limiter.acquire(Integer.MAX_VALUE); assertEvents("R0.00", "R0.00", "R0.00"); // no wait, infinite rate! limiter.setRate(2.0); limiter.acquire(); limiter.acquire(); limiter.acquire(); limiter.acquire(); limiter.acquire(); assertEvents(
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/RateLimiter.java
* void submitPacket(byte[] packet) { * rateLimiter.acquire(packet.length); * networkService.send(packet); * } * }</pre> * * <p>It is important to note that the number of permits requested <i>never</i> affects the * throttling of the request itself (an invocation to {@code acquire(1)} and an invocation to {@code * acquire(1000)} will result in exactly the same throttling, if any), but it affects the throttling
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/CycleDetectingLockFactory.java
* * <pre> * Thread1: acquire(LockA) --X acquire(LockB) * Thread2: acquire(LockB) --X acquire(LockA) * </pre> * * <p>Neither thread will progress because each is waiting for the other. In more complex * applications, cycles can arise from interactions among more than 2 locks: * * <pre> * Thread1: acquire(LockA) --X acquire(LockB) * Thread2: acquire(LockB) --X acquire(LockC) * ...
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
} finally { if (!satisfied) { leave(); } } } /** * Enters this monitor when the guard is satisfied. Blocks at most the given time, including both * the time to acquire the lock and the time to wait for the guard to be satisfied, and may be * interrupted. * * @return whether the monitor was entered, which guarantees that the guard is now satisfied
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/util/concurrent/SmoothRateLimiter.java
* evaluate the integral of the function from 7.0 to 10.0. * * Using integrals guarantees that the effect of a single acquire(3) is equivalent to { * acquire(1); acquire(1); acquire(1); }, or { acquire(2); acquire(1); }, etc, since the integral * of the function in [7.0, 10.0] is equivalent to the sum of the integrals of [7.0, 8.0], [8.0,
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) -
guava/src/com/google/common/cache/Striped64.java
Striped64() {} /** CASes the base field. */ final boolean casBase(long cmp, long val) { return UNSAFE.compareAndSwapLong(this, baseOffset, cmp, val); } /** CASes the busy field from 0 to 1 to acquire lock. */ final boolean casBusy() { return UNSAFE.compareAndSwapInt(this, busyOffset, 0, 1); } /** * Computes the function of current and new value. Subclasses should open-code this update
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
limiter.acquire(Integer.MAX_VALUE / 4); limiter.acquire(Integer.MAX_VALUE / 2); limiter.acquire(Integer.MAX_VALUE); assertEvents("R0.00", "R0.00", "R0.00"); // no wait, infinite rate! limiter.setRate(2.0); limiter.acquire(); limiter.acquire(); limiter.acquire(); limiter.acquire(); limiter.acquire(); assertEvents(
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/cache/Striped64.java
Striped64() {} /** CASes the base field. */ final boolean casBase(long cmp, long val) { return UNSAFE.compareAndSwapLong(this, baseOffset, cmp, val); } /** CASes the busy field from 0 to 1 to acquire lock. */ final boolean casBusy() { return UNSAFE.compareAndSwapInt(this, busyOffset, 0, 1); } /** * Computes the function of current and new value. Subclasses should open-code this update
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureBenchmarks.java
* <p>To avoid races between threads doing release and acquire, we transition to the final state * in two steps. One thread will successfully CAS from RUNNING to COMPLETING, that thread will * then set the result of the computation, and only then transition to COMPLETED, CANCELLED, or * INTERRUPTED. * * <p>We don't use the integer argument passed between acquire methods so we pass around a -1 * everywhere. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 06 12:56:11 GMT 2023 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
Striped64() {} /** CASes the base field. */ final boolean casBase(long cmp, long val) { return UNSAFE.compareAndSwapLong(this, baseOffset, cmp, val); } /** CASes the busy field from 0 to 1 to acquire lock. */ final boolean casBusy() { return UNSAFE.compareAndSwapInt(this, busyOffset, 0, 1); } /** * Computes the function of current and new value. Subclasses should open-code this update
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0)