[libcxx-commits] [libcxx] [libc++] Speed up set_intersection() by fast-forwarding over ranges of non-matching elements with one-sided binary search. (PR #75230)

[Iuri Chaer via libcxx-commits]

================
@@ -733,8 +733,24 @@ struct common_input_iterator {
 // * `equals_count`, which records the total number of calls to an op== or op!=. If compared
 //   against a sentinel object, that sentinel object must call the `record_equality_comparison`
 //   function so that the comparison is counted correctly.
-template <class It>
+template <class It,
+          class StrideCountType        = std::iter_difference_t<It>,
+          class StrideDisplacementType = std::iter_difference_t<It>>
 class stride_counting_iterator {
----------------
ichaer wrote:

I did it in this change, I think the size is OK, but let me know what you think.

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