- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 2,964 for fair (0.04 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java
private static void addTests(TestSuite suite, Method method) { if (isGuarded(method)) { for (boolean fair1 : new boolean[] {true, false}) { for (boolean fair2 : new boolean[] {true, false}) { suite.addTest(generateGuardWithWrongMonitorTestCase(method, fair1, fair2)); } } } if (isAnyEnter(method)) { addTests( suite, method,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 29 16:29:37 UTC 2024 - 25.8K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/doc.go
limitations under the License. */ // Package queueset implements a technique called "fair queuing for // server requests". One QueueSet is a set of queues operating // according to this technique. // // Fair queuing for server requests is inspired by the fair queuing // technique from the world of networking. You can find a good paper // on that at https://dl.acm.org/citation.cfm?doid=75247.75248 or
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Feb 08 12:33:30 UTC 2024 - 6.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java
private static void addTests(TestSuite suite, Method method) { if (isGuarded(method)) { for (boolean fair1 : new boolean[] {true, false}) { for (boolean fair2 : new boolean[] {true, false}) { suite.addTest(generateGuardWithWrongMonitorTestCase(method, fair1, fair2)); } } } if (isAnyEnter(method)) { addTests( suite, method,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 29 16:29:37 UTC 2024 - 27.1K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
*/ public ReentrantLock newReentrantLock(String lockName, boolean fair) { return policy == Policies.DISABLED ? new ReentrantLock(fair) : new CycleDetectingReentrantLock(new LockGraphNode(lockName), fair); } /** Equivalent to {@code newReentrantReadWriteLock(lockName, false)}. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
/** * Creates a monitor with a non-fair (but fast) ordering policy. Equivalent to {@code * Monitor(false)}. */ public Monitor() { this(false); } /** * Creates a monitor with the given ordering policy. * * @param fair whether this monitor should use a fair ordering policy rather than a non-fair (but * fast) one */ public Monitor(boolean fair) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 18:22:01 UTC 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
*/ public ReentrantLock newReentrantLock(String lockName, boolean fair) { return policy == Policies.DISABLED ? new ReentrantLock(fair) : new CycleDetectingReentrantLock(new LockGraphNode(lockName), fair); } /** Equivalent to {@code newReentrantReadWriteLock(lockName, false)}. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 35.9K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/Monitor.java
/** * Creates a monitor with a non-fair (but fast) ordering policy. Equivalent to {@code * Monitor(false)}. */ public Monitor() { this(false); } /** * Creates a monitor with the given ordering policy. * * @param fair whether this monitor should use a fair ordering policy rather than a non-fair (but * fast) one */ public Monitor(boolean fair) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 18:22:01 UTC 2023 - 42.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/MonitorTestCase.java
protected MonitorTestCase(boolean interruptible) { this.interruptible = interruptible; } @Override protected final void setUp() throws Exception { boolean fair = new Random().nextBoolean(); monitor = new Monitor(fair); tearDownStack.addTearDown(thread1 = new TestThread<>(monitor, "TestThread #1")); tearDownStack.addTearDown(thread2 = new TestThread<>(monitor, "TestThread #2")); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 26 20:07:17 UTC 2023 - 8K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* * @param capacity the capacity of this queue * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal, * are processed in FIFO order; if {@code false} the access order is unspecified. * @throws IllegalArgumentException if {@code capacity} is less than 1 */ public MonitorBasedArrayBlockingQueue(int capacity, boolean fair) { if (capacity <= 0) throw new IllegalArgumentException();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 22.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* * @param capacity the capacity of this queue * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal, * are processed in FIFO order; if {@code false} the access order is unspecified. * @throws IllegalArgumentException if {@code capacity} is less than 1 */ public MonitorBasedArrayBlockingQueue(int capacity, boolean fair) { if (capacity <= 0) throw new IllegalArgumentException();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 22.5K bytes - Viewed (0)