Generic type for ordered sets
More...
Inherits pm::Generic< Top >.
|
template<typename Set2 > |
bool | operator== (const GenericSet< Set2, E, Comparator > &s) const |
| comparison
|
|
template<typename Set2 > |
bool | operator< (const GenericSet< Set2, E, Comparator > &s) const |
| lexicographical comparison
|
|
|
template<typename Left , typename Right > |
lazy_op< Left, Right, set_union_zipper >::type | operator+ (Left &&l, Right &&r) |
| union of two sets
|
|
template<typename Left , typename Right > |
lazy_op< Left, Right, set_difference_zipper >::type | operator- (Left &&l, Right &&r) |
| difference of two sets
|
|
template<typename Left , typename Right > |
lazy_op< Left, Right, set_intersection_zipper >::type | operator* (Left &&l, Right &&r) |
| intersection of two sets
|
|
template<typename Left , typename Right > |
lazy_op< Left, Right, set_symdifference_zipper >::type | operator^ (Left &&l, Right &&r) |
| symmetric difference of two sets
|
|
template<typename Top, typename E, typename Comparator>
class pm::GenericSet< Top, E, Comparator >
Generic type for ordered sets
The documentation for this class was generated from the following file: