- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 112 for dequeue0 (0.11 sec)
-
cni/pkg/nodeagent/informers.go
// // NOTE that we are requeueing namespaces here explicitly to work around // test flakes with the fake kube client in `pkg/kube/client.go` - // because we are using `List()` in the handler, without this requeue, // the fake client will sometimes drop pod events leading to test flakes. // // WaitForCacheSync *helps*, but does not entirely fix this problem s.namespaces = kclient.New[*corev1.Namespace](kubeClient)
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jun 06 21:31:35 UTC 2024 - 11.8K bytes - Viewed (0) -
src/internal/fuzz/fuzz.go
input.limit = remaining } } return input, true } // sentInput updates internal counters after an input is sent to c.inputC. func (c *coordinator) sentInput(input fuzzInput) { c.inputQueue.dequeue() c.countWaiting += input.limit } // refillInputQueue refills the input queue from the corpus after it becomes // empty. func (c *coordinator) refillInputQueue() { for _, e := range c.corpus.entries {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 34.1K bytes - Viewed (0) -
pilot/pkg/xds/discovery.go
// This limits the number of pushes that can happen concurrently semaphore <- struct{}{} // Get the next proxy to push. This will block if there are no updates required. client, push, shuttingdown := queue.Dequeue() if shuttingdown { return } recordPushTriggers(push.Reason) // Signals that a push is done by reading from the semaphore, allowing another send on it. doneFunc := func() {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed May 15 20:21:09 UTC 2024 - 19K bytes - Viewed (1) -
pkg/controller/volume/expand/expand_controller.go
expc.queue.AddRateLimited(key) return true } // syncHandler performs actual expansion of volume. If an error is returned // from this function - PVC will be requeued for resizing. func (expc *expandController) syncHandler(ctx context.Context, key string) error { namespace, name, err := cache.SplitMetaNamespaceKey(key) if err != nil { return err }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 16.2K bytes - Viewed (0) -
pkg/controller/resourcequota/resource_quota_controller.go
rq.missingUsageQueue.Add(key) return } } } } // no special priority, go in normal recalc queue rq.queue.Add(key) } // worker runs a worker thread that just dequeues items, processes them, and marks them done. func (rq *Controller) worker(queue workqueue.TypedRateLimitingInterface[string]) func(context.Context) { workFunc := func(ctx context.Context) bool { key, quit := queue.Get()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 21.3K bytes - Viewed (0) -
pkg/controller/endpointslicemirroring/endpointslicemirroring_controller.go
for i := 0; i < workers; i++ { go wait.Until(func() { c.worker(logger) }, c.workerLoopPeriod, ctx.Done()) } <-ctx.Done() } // worker runs a worker thread that just dequeues items, processes them, and // marks them done. You may run as many of these in parallel as you wish; the // workqueue guarantees that they will not end up processing the same service // at the same time
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 06 23:18:31 UTC 2024 - 20.1K bytes - Viewed (0) -
pkg/controller/nodelifecycle/node_lifecycle_controller.go
if shutdown { return } nodeName := obj if err := nc.doNoScheduleTaintingPass(ctx, nodeName); err != nil { logger.Error(err, "Failed to taint NoSchedule on node, requeue it", "node", klog.KRef("", nodeName)) // TODO(k82cn): Add nodeName back to the queue } // TODO: re-evaluate whether there are any labels that need to be
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 51.6K bytes - Viewed (0) -
pkg/controller/endpointslice/endpointslice_controller.go
go wait.Until(func() { c.topologyQueueWorker(logger) }, c.workerLoopPeriod, ctx.Done()) <-ctx.Done() } // serviceQueueWorker runs a worker thread that just dequeues items, processes // them, and marks them done. You may run as many of these in parallel as you // wish; the workqueue guarantees that they will not end up processing the same // service at the same time
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jun 04 08:33:32 UTC 2024 - 23.6K bytes - Viewed (0) -
pkg/controller/nodeipam/ipam/range_allocator.go
nodesSynced cache.InformerSynced broadcaster record.EventBroadcaster recorder record.EventRecorder // queues are where incoming work is placed to de-dup and to allow "easy" // rate limited requeues on errors queue workqueue.RateLimitingInterface } var _ CIDRAllocator = &rangeAllocator{} // NewCIDRRangeAllocator returns a CIDRAllocator to allocate CIDRs for node (one from each of clusterCIDRs)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 10:06:15 UTC 2024 - 16.2K bytes - Viewed (1) -
src/main/webapp/js/admin/jquery-3.6.3.min.js
e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?E.queue(this[0],t):void 0===n?this:this.each(function(){var e=E.queue(this,t,n);E._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&E.dequeue(this,t)})},dequeue:function(e){return this.each(function(){E.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=E.Deferred(),o=this,a=this.length,s=function(){--r||i.resolveWith(o,[o])};"string"!=typeof e&&(t=e,e=void 0),e=e||"fx";while(a--)(n=Y.get(...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Feb 17 12:13:41 UTC 2023 - 87.8K bytes - Viewed (0)