Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Improve performance of unstable sort #104116

Closed
wants to merge 1 commit into from
Closed

Improve performance of unstable sort #104116

wants to merge 1 commit into from

Commits on Nov 7, 2022

  1. Improve performance of slice::sort_unstable 

    At it's core it leverages branchless compare and swap operations employed in
optimal sorting networks. A variety of strategies is used to optimize for hot
and cold runtime, binary size, and max comparisons done. Many patterns see a
reduction in average comparisons performed. So this improvement is applied to
all types that are deemed cheap to move. It copies parts of the stable sort.

Before this get's merged they ought to be unified.
    @Voultapher
    Voultapher committed Nov 7, 2022
    Configuration menu
    Copy the full SHA
    d08dc3c View commit details
    Browse the repository at this point in the history