- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for orderEventList (0.12 sec)
-
src/internal/trace/internal/oldtrace/order.go
next.seq = curr.seq + 1 } gs[g] = next return nil } type orderEventList []orderEvent func (l *orderEventList) Less(i, j int) bool { return (*l)[i].ev.Ts < (*l)[j].ev.Ts } func (h *orderEventList) Push(x orderEvent) { *h = append(*h, x) heapUp(h, len(*h)-1) } func (h *orderEventList) Pop() orderEvent { n := len(*h) - 1 (*h)[0], (*h)[n] = (*h)[n], (*h)[0]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 4K bytes - Viewed (0) -
src/internal/trace/internal/oldtrace/parser.go
// already be in the queue. Furthermore, on average, we only have one P to // look at in each iteration, because all other Ps are already in the queue. var frontier orderEventList availableProcs := make([]*proc, len(allProcs)) for i := range allProcs { availableProcs[i] = &allProcs[i] } for { pidLoop: for i := 0; i < len(availableProcs); i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 21:15:28 UTC 2024 - 46.8K bytes - Viewed (0)