856
C + + : T h e C o m p l e t e R e f e r e n c e
The set_symmetric_difference( ) algorithm produces a sequence that contains the symmetric difference between the two ordered sets defined by start1, end1 and start2,
end2. That is, the resultant set contains only those elements that are not common to both sets. The result is ordered and put into result. It returns an iterator to the end of the result.
The second form allows you to specify a comparison function that determines when one element is less than another.
set_union
template <class InIter1, class InIter2, class OutIter>
OutIter set_union(InIter1 start1, InIter1 end1,
InIter2 start2, InIter2 end2, OutIter result); template <class InIter1, class InIter2, class OutIter, class Comp>
OutIter set_union(InIter1 start1, InIter1 end1,
InIter2 start2, InIter2 end2, OutIter result,
Comp cmpfn);
sort
The set_union( ) algorithm produces a sequence that contains the union of the two ordered sets defined by start1, end1 and start2, end2. Thus, the resultant set contains those elements that are in both sets. The result is ordered and put into result. It returns an iterator to the end of the result.
The second form allows you to specify a comparison function that determines when one element is less than another.
template <class RandIter> void sort(RandIter start, RandIter end); template <class RandIter, classComp> void sort(RandIter start, RandIter end, Comp cmpfn);
The sort( ) algorithm sorts the range specified by start and end.
The second form allows you to specify a comparison function that determines when one element is less than another.
sort_heap
template <class RandIter> void sort_heap(RandIter start, RandIter end);
