[libcxx-commits] [libcxx] [libc++] Introduce one-sided binary search for lower_bound on non-random iterators, and use that to improve the average complexity of set_intersection. (PR #75230)

[Iuri Chaer via libcxx-commits]

================

----------------
ichaer wrote:

I've preserved the test improvements I made here and to `lower_bound_comp.pass.cpp` because it seemed a shame to waste them. Please let me know if you disagree or would prefer for those changes to be split into a different pull request.

https://github.com/llvm/llvm-project/pull/75230