#include <algorithm>
#include <iterator>
#include <set>
Go to the source code of this file.
|
#define | UNION(a, b, r) |
|
#define | INTERSECT(a, b, r) |
|
#define | DIFFERENCE(a, b, r) |
|
#define | SYMDIFF(a, b, r) |
|
#define | IN(e, s) ((s).find(e) != (s).end()) |
|
#define | IN_p(e, s) ((s)->find(e) != (s)->end()) |
|
Some short cut for set operations
#define DIFFERENCE |
( |
|
a, |
|
|
|
b, |
|
|
|
r |
|
) |
| |
Value:(std::set_difference((a).begin(), (a).end(), (b).begin(), (b).end(), \
std::inserter((r), (r).end())))
#define INTERSECT |
( |
|
a, |
|
|
|
b, |
|
|
|
r |
|
) |
| |
Value:(std::set_intersection((a).begin(), (a).end(), (b).begin(), (b).end(), \
std::inserter((r), (r).end())))
#define SYMDIFF |
( |
|
a, |
|
|
|
b, |
|
|
|
r |
|
) |
| |
Value:(std::set_symmetric_difference((a).begin(), (a).end(), (b).begin(), \
(b).end(), std::inserter((r), (r).end())))
#define UNION |
( |
|
a, |
|
|
|
b, |
|
|
|
r |
|
) |
| |
Value:(std::set_union((a).begin(), (a).end(), (b).begin(), (b).end(), \
std::inserter((r), (r).end())))