- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 304 for Dequeue (0.17 sec)
-
src/main/webapp/js/jquery-3.6.3.min.js
:E.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),E.fn.extend({queue:function(t,n){var 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...
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/admin/jquery-3.6.3.min.js
:E.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),E.fn.extend({queue:function(t,n){var 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...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Fri Feb 17 12:13:41 UTC 2023 - 87.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/passes/tpu_cluster_formation.cc
// device. Device attribute is used to infer the appropriate sharding // within TPUs for this op. // TODO(b/183598857): Use explicit sharding ops from the front-end. // For example, dequeue ops generated by // tensorflow/python/tpu/tpu_feed.py if (!tensorflow::IsTPUReplicatedCore(attr.getValue())) { inner_op->removeAttr(kDeviceAttr); } } }); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 22:03:30 UTC 2024 - 39.3K bytes - Viewed (0) -
pkg/ctrlz/assets/static/js/jquery-3.2.1.slim.min.js
:r.Callbacks("once memory").add(function(){W.remove(a,[b+"queue",c])})})}}),r.fn.extend({queue:function(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...
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 23 17:08:31 UTC 2023 - 68K bytes - Viewed (0) -
src/runtime/time.go
func blockTimerChan(c *hchan) { t := c.timer t.lock() t.trace("blockTimerChan") if !t.isChan { badTimer() } t.blocked++ // If this is the first enqueue after a recent dequeue, // the timer may still be in the heap but marked as a zombie. // Unmark it in this case, if the timer is still pending. if t.state&timerHeaped != 0 && t.state&timerZombie != 0 && t.when > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 14:36:24 UTC 2024 - 37.5K bytes - Viewed (0) -
pkg/controller/garbagecollector/garbagecollector_test.go
} func (t *trackingWorkqueue[T]) Add(item T) { t.queue(item) t.limiter.Add(item) } func (t *trackingWorkqueue[T]) AddAfter(item T, duration time.Duration) { t.Add(item) } func (t *trackingWorkqueue[T]) AddRateLimited(item T) { t.Add(item) } func (t *trackingWorkqueue[T]) Get() (T, bool) { item, shutdown := t.limiter.Get() t.dequeue(item) return item, shutdown }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 111.6K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
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; ready.push_back(src_node);
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/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) -
okhttp/src/test/java/okhttp3/internal/concurrent/TaskRunnerTest.kt
private val log = mutableListOf<String>() private val redQueue = taskRunner.newQueue() private val blueQueue = taskRunner.newQueue() private val greenQueue = taskRunner.newQueue() @AfterEach internal fun tearDown() { taskFaker.close() } @Test fun executeDelayed() { redQueue.execute("task", 100.µs) { log += "run@${taskFaker.nanoTime}" }
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Apr 29 00:33:04 UTC 2024 - 23K bytes - Viewed (0) -
pkg/controller/deployment/progress.go
// requeueStuckDeployment checks whether the provided deployment needs to be synced for a progress // check. It returns the time after the deployment will be requeued for the progress check, 0 if it // will be requeued now, or -1 if it does not need to be requeued. func (dc *DeploymentController) requeueStuckDeployment(ctx context.Context, d *apps.Deployment, newStatus apps.DeploymentStatus) time.Duration { logger := klog.FromContext(ctx)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Mar 13 11:00:44 UTC 2023 - 8.9K bytes - Viewed (0)