- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 320 for Dequeue (0.19 sec)
-
src/runtime/export_test.go
type SemTable struct { semTable } // Enqueue simulates enqueuing a waiter for a semaphore (or lock) at addr. func (t *SemTable) Enqueue(addr *uint32) { s := acquireSudog() s.releasetime = 0 s.acquiretime = 0 s.ticket = 0 t.semTable.rootFor(addr).queue(addr, s, false) } // Dequeue simulates dequeuing a waiter for a semaphore (or lock) at addr. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
src/internal/fuzz/fuzz.go
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 { c.inputQueue.enqueue(e) } } // queueForMinimization creates a fuzzMinimizeInput from result and adds it
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 34.1K bytes - Viewed (0) -
pkg/scheduler/eventhandlers.go
events = append(events, queue.NodeSpecUnschedulableChange) } if nodeAllocatableChanged(newNode, oldNode) { events = append(events, queue.NodeAllocatableChange) } if nodeLabelsChanged(newNode, oldNode) { events = append(events, queue.NodeLabelChange) } if nodeTaintsChanged(newNode, oldNode) { events = append(events, queue.NodeTaintChange) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 21:21:04 UTC 2024 - 24K bytes - Viewed (0) -
pilot/pkg/xds/discovery.go
// 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() { queue.MarkDone(client) <-semaphore } proxiesQueueTime.Record(time.Since(push.Start).Seconds())
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed May 15 20:21:09 UTC 2024 - 19K bytes - Viewed (0) -
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)