cheshirekow
v0.1.0
|
#include <algorithm>
Go to the source code of this file.
Namespaces | |
set | |
Functions | |
template<typename InputIt1 , typename InputIt2 > | |
bool | set::Contains (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2) |
Returns true if the seconds set is a subset of the first set. More... | |
template<typename InputIt1 , typename InputIt2 , typename OutputIt1 , typename OutputIt2 , typename OutputIt3 > | |
void | set::IntersectionAndDifference (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt1 out1, OutputIt2 out2, OutputIt3 intersect) |
Collect in out1 elements from the first set not found in the second, and collect in out2 elements from the second set not found in the first, and collect in intersect the elements from first and second that are common to both. More... | |
template<typename InputIt1 , typename InputIt2 , typename OutputIt1 , typename OutputIt2 > | |
void | set::SymmetricDifference (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt1 out1, OutputIt2 out2) |
Collect in out1 elements from the first set not found in the second, and collect in out2 elements from the second set not found in the first. More... | |
Definition in file set_operations.hpp.