Set

Overview

Set 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.

Section Pages

merge

Merges the elements of two ranges

inplace merge

inplace_merge, inplace_merge, \\, \\, \\, \\, \\

Merges two consecutive sorted ranges

includes

includes, includes, \\, \\, \\, \\, \\, \\

Returns whether each element of a range is also an element of another range

set union

Processes the sorted union of two ranges

set intersection

Processes the sorted intersection of two ranges

set difference

Processes a sorted range that contains all elements of a range that are not part of another

set symmetric difference

set_symmetric_difference, set_symmetric_difference, \\, \\, \\, \\, \\, \\, \\

Processes a sorted range that contains all elements that are in exactly one of two ranges