Lukas Bergdoll 7e072199a6 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		2023-02-10 18:05:12 +01:00
..
benches	fix #107590, Fix benchmarks in library/core with black_box	2023-02-03 00:33:36 +08:00
primitive_docs	Add primitive documentation to libcore	2021-09-12 02:23:08 +00:00
src	Speedup heapsort by 1.5x by making it branchless	2023-02-10 18:05:12 +01:00
tests	Remove unnecessary &format!	2023-01-21 22:06:42 -05:00
Cargo.toml	Update rand in the stdlib tests, and remove the getrandom feature from it	2023-01-04 14:52:41 -08:00