- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for heapDown (0.1 sec)
-
src/internal/trace/internal/oldtrace/order.go
n := len(*h) - 1 (*h)[0], (*h)[n] = (*h)[n], (*h)[0] heapDown(h, 0, n) x := (*h)[len(*h)-1] *h = (*h)[:len(*h)-1] return x } func heapUp(h *orderEventList, j int) { for { i := (j - 1) / 2 // parent if i == j || !h.Less(j, i) { break } (*h)[i], (*h)[j] = (*h)[j], (*h)[i] j = i } } func heapDown(h *orderEventList, i0, n int) bool { i := i0 for {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 4K bytes - Viewed (0)