- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 304 for Dequeue (0.28 sec)
-
staging/src/k8s.io/apiserver/pkg/cel/common/maplist.go
if !ok { return nil } if match, ok := a.keyedItems[key]; ok { return match } // keep keying items until we either find a match or run out of unkeyed items for len(a.unkeyedItems) > 0 { // dequeue an unkeyed item item := a.unkeyedItems[0] a.unkeyedItems = a.unkeyedItems[1:] // key the item mitem, ok := item.(map[string]interface{}) if !ok { continue }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Feb 07 02:56:51 UTC 2023 - 4.5K bytes - Viewed (0) -
src/runtime/lock_sema.go
if v == locked { if atomic.Casuintptr(&l.key, locked, 0) { break } } else { // Other M's are waiting for the lock. // Dequeue an M. mp = muintptr(v &^ locked).ptr() if atomic.Casuintptr(&l.key, v, uintptr(mp.nextwaitm)) { // Dequeued an M. Wake it. semawakeup(mp) break } } } gp.m.mLockProfile.recordUnlock(l) gp.m.locks-- if gp.m.locks < 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 6.8K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.cc
if (dequeue_op == nullptr) { status->status = tensorflow::errors::Internal( "Unable to find the dequeue node in the TF graph."); return nullptr; } VLOG(1) << "Running the dequeue op"; TF_Output output{dequeue_op, 0}; TF_Tensor* ret; TF_SessionRun(session, /*run_options*/ nullptr, // input related parameters
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Apr 15 03:35:10 UTC 2024 - 29.4K bytes - Viewed (0) -
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)