[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:

SGTM, removed from this PR, will propose a new one with those test changes once we either merge or reject this one, because they depended on `stride_counting_iterator` changes.

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