- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 339 for Dequeue (0.22 sec)
-
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/ResolveState.java
return selectorState; } @Nullable public NodeState peek() { return queue.isEmpty() ? null : queue.getFirst(); } public NodeState pop() { NodeState next = queue.removeFirst(); return next.dequeue(); } /**
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 16.7K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.h
// // `tensor` is still owned by the caller. This call will be blocked if the queue // has reached its capacity, and will be unblocked when the queued tensors again // drop below the capacity due to dequeuing. // // Tensors are dequeued via the corresponding TF dequeue op. // TODO(hongm): Add support for `timeout_ms`. TF_CAPI_EXPORT extern void TF_EnqueueNamedTensor(TF_Session* session,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 27 21:07:00 UTC 2023 - 15.1K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
} // the enqueue and dequeue methods are used for performance reasons // in order to avoid tracking the set of enqueued nodes boolean enqueue() { if (queued) { return false; } queued = true; return true; } NodeState dequeue() { queued = false; return this; }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 58.9K bytes - Viewed (0) -
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) -
fess-crawler/src/test/resources/ajax/js/jquery-2.1.1.min.js
:n.Callbacks("once memory").add(function(){L.remove(a,[b+"queue",c])})})}}),n.fn.extend({queue:function(a,b){var c=2;return"string"!=typeof a&&(b=a,a="fx",c--),arguments.length<c?n.queue(this[0],a):void 0===b?this:this.each(function(){var c=n.queue(this,a,b);n._queueHooks(this,a),"fx"===a&&"inprogress"!==c[0]&&n.dequeue(this,a)})},dequeue:function(a){return this.each(function(){n.dequeue(this,a)})},clearQueue:function(a){return this.queue(a||"fx",[])},promise:function(a,b){var c,d=1,e=n.Deferred...
Registered: Wed Jun 12 15:17:51 UTC 2024 - Last Modified: Sun Oct 11 02:16:55 UTC 2015 - 82.3K bytes - Viewed (0)