π¬This is a nightly-only experimental API. (
slice_internals)Expand description
This module contains the entry points for slice::sort_unstable.
ModulesΒ§
- heapsort π
Experimental - This module contains a branchless heapsort as fallback for unstable quicksort.
- quicksort π
Experimental - This module contains an unstable quicksort and two partition implementations.
FunctionsΒ§
- ipnsort π
Experimental Neither optimize_for_size - See
sort - partial_
sort Experimental - Unstable partial sort the range
start..end, after which itβs guaranteed that: - sort
Experimental - Unstable sort called ipnsort by Lukas Bergdoll and Orson Peters. Design document: https://github.com/Voultapher/sort-research-rs/blob/main/writeup/ipnsort_introduction/text.md