OverviewSet Algorithms require that the ranges on which they operate are sorted according to their sorting criterion. These algorithms have the advantage of a better complexity.
Merges the elements of two ranges
Merges two consecutive sorted ranges
Returns whether each element of a range is also an element of another range
Processes the sorted union of two ranges
Processes the sorted intersection of two ranges
Processes a sorted range that contains all elements of a range that are not part of another
Processes a sorted range that contains all elements that are in exactly one of two ranges