mirror of
https://github.com/SerenityOS/serenity.git
synced 2026-11-07 04:29:30 -10:00
This is done by using the `[lower,upper]_bound()` functions, that have a O(logn) complexity, instead of a manual loop with its O(n) complexity. This increases performance a lot in the `forward` and `backward` cases in `BenchmarkSegmenter`. Before: Completed benchmark 'forward' in 67ms Completed benchmark 'backward' in 219ms After: Completed benchmark 'forward' in 2ms Completed benchmark 'backward' in 2ms