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

Measure variants of binary search and union in OrdVector #321

Open
kilohsakul opened this issue Sep 4, 2023 · 0 comments
Open

Measure variants of binary search and union in OrdVector #321

kilohsakul opened this issue Sep 4, 2023 · 0 comments

Comments

@kilohsakul
Copy link
Collaborator

kilohsakul commented Sep 4, 2023 •
edited
Loading

Measure which one is faster and remove the custom ones after it is clear that they are not faster.

  • Custom binary search and merge or std lower_bound and set_union?
  • Use swap or assignment in union? - This one is maybe not so clear, a single swap is probably faster, but it tmp must be allocated every time, while with assignment, tmp is allocated only once.
@kilohsakul kilohsakul changed the title Custom binary search and merge or std lowe_bound and set_union? Custom binary search and merge or std lower_bound and set_union? Sep 4, 2023
@kilohsakul kilohsakul changed the title Custom binary search and merge or std lower_bound and set_union? Measure variants of binary search and union in OrdVector Sep 12, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@kilohsakul