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 slice.binary_search_by()'s best-case performance to O(1) #74024

Merged
merged 4 commits into from
Mar 5, 2021
Merged

Improve slice.binary_search_by()'s best-case performance to O(1) #74024

merged 4 commits into from
Mar 5, 2021

Commits on Jan 30, 2021

  1. Improve slice.binary_search_by()'s best-case performance to O(1)

    @Folyd
    Folyd committed Jan 30, 2021
    Configuration menu
    Copy the full SHA
    18e44a1 View commit details
    Browse the repository at this point in the history

  2. Simplify binary search logic to full branch code to let CPU guessing … 

    …branch more precisely
    @Folyd
    Folyd committed Jan 30, 2021
    Configuration menu
    Copy the full SHA
    7d078cf View commit details
    Browse the repository at this point in the history

Commits on Feb 3, 2021

  1. Explain why we use if/else control flow rather than match

    @Folyd
    Folyd committed Feb 3, 2021
    Configuration menu
    Copy the full SHA
    385ad48 View commit details
    Browse the repository at this point in the history

Commits on Feb 27, 2021

  1. Fix binary_search_by() overflow issue in ZST case

    @Folyd
    Folyd committed Feb 27, 2021
    Configuration menu
    Copy the full SHA
    3eb5bee View commit details
    Browse the repository at this point in the history