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

[Mark de Wever via libcxx-commits]

mordante wrote:

> SGTM! I'll amend my submission, thanks!

Great. 

As @philnik777 said we need to be careful about observable behaviour. I love to see performance improvements :-)


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