- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 356 for QUEUE (0.05 sec)
-
src/cmd/go/internal/par/queue.go
idle chan struct{} // if non-nil, closed when active becomes 0 } // NewQueue returns a Queue that executes up to maxActive items in parallel. // // maxActive must be positive. func NewQueue(maxActive int) *Queue { if maxActive < 1 { panic(fmt.Sprintf("par.NewQueue called with nonpositive limit (%d)", maxActive)) } q := &Queue{ maxActive: maxActive, st: make(chan queueState, 1), } q.st <- queueState{}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 24 21:08:46 UTC 2020 - 1.9K bytes - Viewed (0) -
pkg/kube/controllers/queue.go
log *istiolog.Scope } // WithName sets a name for the queue. This is used for logging func WithName(name string) func(q *Queue) { return func(q *Queue) { q.name = name } } // WithRateLimiter allows defining a custom rate limiter for the queue func WithRateLimiter(r workqueue.RateLimiter) func(q *Queue) { return func(q *Queue) { q.queue = workqueue.NewRateLimitingQueue(r) } }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Aug 08 16:43:05 UTC 2023 - 6.3K bytes - Viewed (0) -
src/internal/fuzz/queue.go
// The queue is full (until grow is called) when end = begin + N - 1 (mod N) // where N = cap(elems). elems []any head, len int } func (q *queue) cap() int { return len(q.elems) } func (q *queue) grow() { oldCap := q.cap() newCap := oldCap * 2 if newCap == 0 { newCap = 8 } newElems := make([]any, newCap) oldLen := q.len for i := 0; i < oldLen; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Nov 05 21:02:45 UTC 2022 - 1.5K bytes - Viewed (0) -
pkg/test/loadbalancersim/timer/queue.go
package timer import ( "container/heap" "sync" "time" ) type Queue struct { heap timerHeap mutex sync.Mutex stopCh chan struct{} resetTimerCh chan struct{} stopping bool timer *time.Timer currentDeadline time.Time } func NewQueue() *Queue { q := &Queue{ heap: make(timerHeap, 0), timer: time.NewTimer(1 * time.Minute),
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 19:13:32 UTC 2023 - 3.6K bytes - Viewed (0) -
fess-crawler-es/src/main/resources/mapping/queue.json
Shinsuke Sugaya <******@****.***> 1550973969 +0900
Registered: Wed Jun 12 15:17:51 UTC 2024 - Last Modified: Sun Feb 24 02:06:09 UTC 2019 - 406 bytes - Viewed (0) -
platforms/core-runtime/messaging/src/test/groovy/org/gradle/internal/remote/internal/hub/queue/MultiEndPointQueueTest.groovy
def endpoint1 = queue.newEndpoint() def endpoint2 = queue.newEndpoint() and: queue.dispatch(message1) queue.dispatch(message2) queue.dispatch(message3) when: queue.empty(endpoint1) def messages1 = [] endpoint1.take(messages1) def messages2 = [] endpoint2.take(messages2) then:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:59:22 UTC 2023 - 4.3K bytes - Viewed (0) -
pkg/controller/nodelifecycle/scheduler/rate_limited_queue.go
} // Replace replaces an existing value in the queue if it already // exists, otherwise it does nothing. Returns true if the item was // found. func (q *UniqueQueue) Replace(value TimedValue) bool { q.lock.Lock() defer q.lock.Unlock() for i := range q.queue { if q.queue[i].Value != value.Value { continue } heap.Remove(&q.queue, i) heap.Push(&q.queue, &value) return true } return false
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Mar 07 07:50:01 UTC 2023 - 8.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConsumingQueueIterator.java
private final Queue<T> queue; ConsumingQueueIterator(Queue<T> queue) { this.queue = checkNotNull(queue); } @Override @CheckForNull protected T computeNext() { // TODO(b/192579700): Use a ternary once it no longer confuses our nullness checker. if (queue.isEmpty()) { return endOfData(); } return queue.remove(); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Jan 21 14:48:03 UTC 2023 - 1.5K bytes - Viewed (0) -
pkg/controller/tainteviction/timed_workers_test.go
queue.AddWork(context.TODO(), NewWorkArgs("3", "3"), now, then) queue.AddWork(context.TODO(), NewWorkArgs("4", "4"), now, then) queue.AddWork(context.TODO(), NewWorkArgs("5", "5"), now, then) queue.AddWork(context.TODO(), NewWorkArgs("1", "1"), now, then) queue.AddWork(context.TODO(), NewWorkArgs("2", "2"), now, then) queue.AddWork(context.TODO(), NewWorkArgs("3", "3"), now, then) queue.AddWork(context.TODO(), NewWorkArgs("4", "4"), now, then)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Oct 30 12:23:56 UTC 2023 - 5.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/EvictingQueue.java
import java.util.Collection; import java.util.Queue; /** * A non-blocking queue which automatically evicts elements from the head of the queue when * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:52:55 UTC 2023 - 4.6K bytes - Viewed (0)