We have a few algorithms which are optimized for segmented iterators, but a lot aren't yet. These algorithms would most likely benefit from adding such an optimization:

• count_if
• count (should probably forward to count_if)
• equal
• fill
• fill_n (should probably forward to fill or the other way around)
• fold_left_with_iter
• for_each_n (Should probably forward to for_each)
• generate
• generate_n (should probably forward to generate)
• lexicographical_compare
• ranges::min (range overload)
• ranges::max (range overload)
• ranges::minmax (range overload)
• mismatch
• replace (should probably forward to replace_if)
• replace_if
• replace_copy (should probably forward to replace_copy_if)
• replace_copy_if
• reverse_copy
• swap_ranges
• transform
• distance