- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for dequeue1 (0.19 sec)
-
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 58.9K bytes - Viewed (0) -
pkg/scheduler/internal/queue/scheduling_queue.go
queueSkip queueingStrategy = iota // queueAfterBackoff indicates that the scheduling queue should requeue the Pod after backoff is completed. queueAfterBackoff // queueImmediately indicates that the scheduling queue should skip backoff and requeue the Pod immediately to activeQ. queueImmediately ) // isEventOfInterest returns true if the event is of interest by some plugins.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 61.4K bytes - Viewed (0) -
pkg/controller/replicaset/replica_set_test.go
manager.queue = workqueue.NewTypedRateLimitingQueue(workqueue.NewTypedMaxOfRateLimiter[string]()) manager.enqueueRS(rs) manager.processNextWorkItem(ctx) // It should have been requeued. if got, want := manager.queue.Len(), 1; got != want { t.Errorf("queue.Len() = %v, want %v", got, want) } } func TestControllerUpdateStatusWithFailure(t *testing.T) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 69.2K bytes - Viewed (0) -
pkg/kubelet/pod_workers.go
delete(p.startedStaticPodsByFullname, status.fullname) } } // completeWork requeues on error or the next sync interval and then immediately executes any pending // work. func (p *podWorkers) completeWork(podUID types.UID, phaseTransition bool, syncErr error) { // Requeue the last update if the last sync returned error. switch { case phaseTransition: p.workQueue.Enqueue(podUID, 0)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Apr 02 13:22:37 UTC 2024 - 74.8K 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) -
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) -
src/main/webapp/js/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) -
pkg/ctrlz/assets/static/js/jquery-3.2.1.slim.min.js
n(a,b){var c=2;return"string"!=typeof a&&(b=a,a="fx",c--),arguments.length<c?r.queue(this[0],a):void 0===b?this:this.each(function(){var c=r.queue(this,a,b);r._queueHooks(this,a),"fx"===a&&"inprogress"!==c[0]&&r.dequeue(this,a)})},dequeue:function(a){return this.each(function(){r.dequeue(this,a)})},clearQueue:function(a){return this.queue(a||"fx",[])},promise:function(a,b){var c,d=1,e=r.Deferred(),f=this,g=this.length,h=function(){--d||e.resolveWith(f,[f])};"string"!=typeof a&&(b=a,a=void 0),a=a...
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 23 17:08:31 UTC 2023 - 68K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
if (IsMerge(node)) { for (const Edge* e : node->in_edges()) { if (IsNextIteration(e->src())) { ++num_ready_inputs[node->id()]; } } } } // dequeue is used to ensure that the nodes are first-in-first-out. This // order guarantees that the exits in the ready queue are visited before // nodes that will become ready in the future. std::deque<Node*> ready;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
pkg/controller/daemon/daemon_controller.go
if _, updateErr = dsClient.UpdateStatus(ctx, toUpdate, metav1.UpdateOptions{}); updateErr == nil { return nil } // Stop retrying if we exceed statusUpdateRetries - the DaemonSet will be requeued with a rate limit. if i >= StatusUpdateRetries { break } // Update the set with the latest resource version for the next poll
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 51.3K bytes - Viewed (0)