- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 91 for popf (0.1 sec)
-
src/runtime/tracebuf.go
func (q *traceBufQueue) push(buf *traceBuf) { buf.link = nil if q.head == nil { q.head = buf } else { q.tail.link = buf } q.tail = buf } // pop dequeues from the queue of buffers. func (q *traceBufQueue) pop() *traceBuf { buf := q.head if buf == nil { return nil } q.head = buf.link if q.head == nil { q.tail = nil } buf.link = nil return buf }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 6.8K bytes - Viewed (0) -
pkg/queue/delay.go
return q[i].runAt.Before(q[j].runAt) } func (q *pq) Swap(i, j int) { (*q)[i], (*q)[j] = (*q)[j], (*q)[i] } func (q *pq) Push(x any) { *q = append(*q, x.(*delayTask)) } func (q *pq) Pop() any { old := *q n := len(old) c := cap(old) // Shrink the capacity of task queue. if n < c/2 && c > 32 { npq := make(pq, n, c/2) copy(npq, old) old = npq } if n == 0 { return nil }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 06:27:31 UTC 2023 - 6.7K bytes - Viewed (0) -
platforms/core-configuration/kotlin-dsl/src/main/kotlin/org/gradle/kotlin/dsl/provider/ClassLoaderHierarchy.kt
val record = ClassLoaderNode(idOf(classLoader), classLoader.toString()) classLoaders.add(record) stack.push(record) super.visit(classLoader) stack.pop() } override fun visitParent(classLoader: ClassLoader) { current.parents.add(idOf(classLoader)) super.visitParent(classLoader) }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Aug 02 08:06:49 UTC 2023 - 4.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/testing/eventclock/fake.go
// events to run at that or an earlier time. // Events should not advance the clock. But just in case they do... now := fec.Now() for len(fec.waiters) > 0 && !now.Before(fec.waiters[0].targetTime) { ew := heap.Pop(&fec.waiters).(eventWaiter) fec.clientWG.Add(1) go func(f eventclock.EventFunc, now time.Time) { f(now) fec.clientWG.Add(-1) }(ew.f, now) foundSome = true } }()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Dec 18 04:27:38 UTC 2022 - 7.9K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/TrieParser.java
// An extra '?' or ',' after a child node indicates the end of all children of this node. idx++; break; } } } stack.pop(); return idx - start; } private static CharSequence reverse(CharSequence s) { return new StringBuilder(s).reverse(); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Oct 13 19:20:43 UTC 2022 - 4K bytes - Viewed (0) -
platforms/core-configuration/file-collections/src/main/java/org/gradle/api/internal/file/collections/PathVisitor.java
if (directoryDetailsHolder.size() > 1 && details != null) { visitor.visitDir(details); } } } directoryDetailsHolder.pop(); return checkStopFlag(); }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 5.1K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/api/internal/provider/EvaluationContext.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Mar 06 16:54:51 UTC 2024 - 12.2K bytes - Viewed (0) -
src/sync/poolqueue.go
package sync import ( "sync/atomic" "unsafe" ) // poolDequeue is a lock-free fixed-size single-producer, // multi-consumer queue. The single producer can both push and pop // from the head, and consumers can pop from the tail. // // It has the added feature that it nils out unused slots to avoid // unnecessary retention of objects. This is important for sync.Pool,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 18:12:29 UTC 2024 - 8.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
// removing all incoming dependencies), otherwise there are initialization // cycles. emitted := make(map[*declInfo]bool) for len(pq) > 0 { // get the next node n := heap.Pop(&pq).(*graphNode) if debug { fmt.Printf("\t%s (src pos %d) depends on %d nodes now\n", n.obj.Name(), n.obj.order(), n.ndeps) } // if n still depends on other nodes, we have a cycle if n.ndeps > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 22:06:51 UTC 2024 - 9.8K bytes - Viewed (0) -
src/go/types/initorder.go
// removing all incoming dependencies), otherwise there are initialization // cycles. emitted := make(map[*declInfo]bool) for len(pq) > 0 { // get the next node n := heap.Pop(&pq).(*graphNode) if debug { fmt.Printf("\t%s (src pos %d) depends on %d nodes now\n", n.obj.Name(), n.obj.order(), n.ndeps) } // if n still depends on other nodes, we have a cycle if n.ndeps > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0)