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

librustc_data_structures: Speedup union of sparse and dense hybrid set #61020

Merged
merged 3 commits into from Jun 22, 2019
Merged

librustc_data_structures: Speedup union of sparse and dense hybrid set #61020

merged 3 commits into from Jun 22, 2019

Commits on May 22, 2019

  1. Provide some benchmarks for bitset hybrid union

    @HeroicKatora
    HeroicKatora committed May 22, 2019
    Copy the full SHA
    7fa6e87 View commit details
    Browse the repository at this point in the history

  2. Improve union of sparse and dense hybrid set 

    This optimization speeds up the union of a hybrid bitset when that
switches it from a sparse representation to a dense bitset. It now
clones the dense bitset and integrate only the spare elements instead of
densifying the sparse bitset, initializing all elements, and then a
union on two dense bitset, touching all words a second time.
    @HeroicKatora
    HeroicKatora committed May 22, 2019
    Copy the full SHA
    8877f4c View commit details
    Browse the repository at this point in the history

  3. Add documentation on the reasoning 

    Explains the thought process behind adding the union algorithm and
discusses the alternative and heuristic behind.
    @HeroicKatora
    HeroicKatora committed May 22, 2019
    Copy the full SHA
    3f28811 View commit details
    Browse the repository at this point in the history