mirror of
https://github.com/rust-lang/rust.git
synced 2026-05-01 07:13:24 +03:00
b7089e0dd3
Speedup heapsort by 1.5x by making it branchless `slice::sort_unstable` will fall back to heapsort if it repeatedly fails to find a good pivot. By making the core child update code branchless it is much faster. On Zen3 sorting 10k `u64` and forcing the sort to pick heapsort, results in: 455us -> 278us