- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for siftDown_func (0.29 sec)
-
src/sort/zsortfunc.go
for i := a + 1; i < b; i++ { for j := i; j > a && data.Less(j, j-1); j-- { data.Swap(j, j-1) } } } // siftDown_func implements the heap property on data[lo:hi]. // first is an offset into the array where the root of the heap lies. func siftDown_func(data lessSwap, lo, hi, first int) { root := lo for { child := 2*root + 1 if child >= hi { break }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.5K bytes - Viewed (0)