- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for pdqsort_func (0.1 sec)
-
src/sort/zsortfunc.go
leftLen, rightLen := mid-a, b-mid balanceThreshold := length / 8 if leftLen < rightLen { wasBalanced = leftLen >= balanceThreshold pdqsort_func(data, a, mid, limit) a = mid + 1 } else { wasBalanced = rightLen >= balanceThreshold pdqsort_func(data, mid+1, b, limit) b = mid } } } // partition_func does one quicksort partition. // Let p = data[pivot]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.5K bytes - Viewed (0) -
src/sort/slice.go
// ergonomic and runs faster. func Slice(x any, less func(i, j int) bool) { rv := reflectlite.ValueOf(x) swap := reflectlite.Swapper(x) length := rv.Len() limit := bits.Len(uint(length)) pdqsort_func(lessSwap{less, swap}, 0, length, limit) } // SliceStable sorts the slice x using the provided less // function, keeping equal elements in their original order. // It panics if x is not a slice. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 28 16:40:32 UTC 2023 - 1.8K bytes - Viewed (0)