Use one-sided binary search for lower_bound on non-random iterators.#1

Open

ichaer wants to merge 5 commits intoonesided_lower_boundfrom

onesided_lower_bound_private

Commits on Apr 28, 2024

Always use `__lower_bound_onesided()`: let's benchmark for all types of iterator.
ichaer
committed
Beefed-up benchmark.
ichaer
committed
DO NOT MERGE: hardcode seed for random benchmark data generation so we have reproducible, consistent, and comparable results.
ichaer
committed

Commits on Apr 29, 2024

DO NOT MERGE: Limit number of copies to 2^14 rather than 2^18, that large number plus gbench's auto-tuned iteration count mean lower_bound() takes multiple days to finish on my hardware. I've incre…
ichaer
committed
Introduce a more flexible variant of `runOpOnCopies()`: `runOpOnCopiesWithDataFilter()` allows filtering generated value vectors to do more complex data preparation. This allows me to perform all p…
ichaer
committed