- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 800 for queuesa (0.14 sec)
-
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/fifo_list_test.go
remainingRequests := walkAll(list) verifyOrder(t, orderExpected, remainingRequests) } func TestFIFOQueueWorkEstimate(t *testing.T) { qs := &queueSet{estimatedServiceDuration: time.Second} list := newRequestFIFO() update := func(we *queueSum, req *request, multiplier int) { we.InitialSeatsSum += multiplier * req.InitialSeats() we.MaxSeatsSum += multiplier * req.MaxSeats()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jul 28 08:48:40 UTC 2022 - 7.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/concurrent/TaskRunner.kt
delayNanos: Long, ) { lock.assertHeld() val queue = task.queue!! check(queue.activeTask === task) val cancelActiveTask = queue.cancelActiveTask queue.cancelActiveTask = false queue.activeTask = null busyQueues.remove(queue) if (delayNanos != -1L && !cancelActiveTask && !queue.shutdown) { queue.scheduleAndDecide(task, delayNanos, recurrence = true) }
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Apr 29 00:33:04 UTC 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/eventbus/Dispatcher.java
// This dispatcher matches the original dispatch behavior of EventBus. /** Per-thread queue of events to dispatch. */ private final ThreadLocal<Queue<Event>> queue = new ThreadLocal<Queue<Event>>() { @Override protected Queue<Event> initialValue() { return Queues.newArrayDeque(); } };
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 7.3K bytes - Viewed (0) -
guava/src/com/google/common/eventbus/Dispatcher.java
// This dispatcher matches the original dispatch behavior of EventBus. /** Per-thread queue of events to dispatch. */ private final ThreadLocal<Queue<Event>> queue = new ThreadLocal<Queue<Event>>() { @Override protected Queue<Event> initialValue() { return Queues.newArrayDeque(); } };
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Dec 15 19:31:54 UTC 2023 - 7.3K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/concurrent/Task.kt
/** Returns the delay in nanoseconds until the next execution, or -1L to not reschedule. */ abstract fun runOnce(): Long internal fun initQueue(queue: TaskQueue) { if (this.queue === queue) return check(this.queue === null) { "task is in multiple queues" } this.queue = queue } override fun toString(): String = name
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 2.4K bytes - Viewed (0) -
tensorflow/cc/training/queue_runner_test.cc
kQueueName1, {kEnqueueOp1}, kCloseOp1, kCancelOp1, {}); std::unique_ptr<QueueRunner> qr; TF_EXPECT_OK(QueueRunner::New(queue_runner_def, &qr)); // This will timeout since queue0 is not fed and queue1 is fetching data from // queue0. EXPECT_EQ(qr->Start(session.get(), 1).code(), Code::DEADLINE_EXCEEDED); TF_EXPECT_OK(session->Close()); } TEST(QueueRunnerTest, TestCoordinatorStop) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Sep 21 06:27:51 UTC 2019 - 14.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
/** * A bounded {@linkplain BlockingQueue blocking queue} backed by an array. This queue orders * elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* defined as the <i>least</i> element in the queue according to the queue's comparator. But unlike * a regular priority queue, the methods {@link #peekLast}, {@link #pollLast} and {@link * #removeLast} are also provided, to act on the <i>greatest</i> element in the queue instead. * * <p>A min-max priority queue can be configured with a maximum size. If so, each time the size of
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
pkg/scheduler/internal/heap/heap.go
func (h *data) Swap(i, j int) { h.queue[i], h.queue[j] = h.queue[j], h.queue[i] item := h.items[h.queue[i]] item.index = i item = h.items[h.queue[j]] item.index = j } // Push is supposed to be called by heap.Push only. func (h *data) Push(kv interface{}) { keyValue := kv.(*itemKeyValue) n := len(h.queue) h.items[keyValue.key] = &heapItem{keyValue.obj, n} h.queue = append(h.queue, keyValue.key) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Apr 29 18:37:35 UTC 2022 - 6.7K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/apf_controller.go
// qsCompleter holds the QueueSetCompleter derived from `config` // and `queues`. qsCompleter fq.QueueSetCompleter // The QueueSet for this priority level. // Never nil. queues fq.QueueSet // quiescing==true indicates that this priority level should be // removed when its queues have all drained. quiescing bool // number of goroutines between Controller::Match and calling the
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 48.8K bytes - Viewed (0)