HP Integrity NonStop H-Series - Manual (Page 193)

set_union (listOne.begin(), listOne.end(),
listTwo.begin(), listTwo.end(), intOut), cout << endl;
// merge - 1 2 3 3 4 4 5 5 6 7
merge (listOne.begin(), listOne.end(),
listTwo.begin(), listTwo.end(), intOut), cout << endl;
// intersection - 3 4 5
set_intersection (listOne.begin(), listOne.end(),
listTwo.begin(), listTwo.end(), intOut), cout << endl;
// difference - 1 2
set_difference (listOne.begin(), listOne.end(),
listTwo.begin(), listTwo.end(), intOut), cout << endl;
// symmetric difference - 1 2 6 7
set_symmetric_difference (listOne.begin(), listOne.end(),
listTwo.begin(), listTwo.end(), intOut), cout << endl;
if (includes (listOne.begin(), listOne.end(),
listTwo.begin(), listTwo.end()))
cout << "set is subset" << endl;
else
cout << "set is not subset" << endl;
}