|
| PowerSet () |
| Create as empty.
|
|
template<typename Top > |
| PowerSet (const GenericSet< Top, Set< E, Comparator >> &S) |
| Create from a Set of Sets.
|
|
template<typename Iterator > |
| PowerSet (Iterator first, Iterator last) |
| Reads subsets from an input sequence. They must be sorted lexicographically.
|
|
template<typename Iterator > |
| PowerSet (Iterator &&src, typename std::enable_if< assess_iterator< Iterator, check_iterator_feature, end_sensitive >::value &&assess_iterator_value< Iterator, isomorphic_types, Set< E >>::value, void ** >::type=nullptr) |
| Create from an iterator.
|
|
template<typename TSet2 > |
PowerSet & | operator= (const GenericSet< TSet2, Set< E, Comparator >> &S) |
| Compare two PowerSets.
|
|
template<typename TSet2 > |
int | insertMax (const GenericSet< TSet2, E, Comparator > &s) |
| Adds an independent subset. More...
|
|
template<typename TSet2 > |
int | insertMin (const GenericSet< TSet2, E, Comparator > &s) |
| Adds an independent subset. More...
|
|
void | clear () |
| Make the set empty.
|
|
void | resize (int) |
| For compatibility with common::boost_dynamic_bitset, add a trivial method.
|
|
void | reset (void) |
| For compatibility with common::boost_dynamic_bitset, add a trivial method.
|
|
void | swap (Set &s) |
| Swap the content with another Set. More...
|
|
Set | copy_permuted (const Permutation &perm) const |
| Return the (pointwise) image of this under a permutation.
|
|
Set | copy_permuted_inv (const Permutation &perm) const |
| Return the (pointwise) image of this under the inverse of a given permutation.
|
|
std::enable_if_t< is_compatible_set< Right >::value, top_type & > | operator+= (const Right &x) |
| Set union
|
|
std::enable_if_t< is_compatible_element< Right >::value, bool > | collect (const Right &x) |
| Add to the set, report true if existed formerly.
|
|
std::enable_if_t< is_compatible_set< Right >::value, top_type & > | operator-= (const Right &x) |
| Set difference
|
|
std::enable_if_t< is_compatible_set< Right >::value, top_type & > | operator*= (const Right &x) |
| Set intersection
|
|
std::enable_if_t< is_compatible_set< Right >::value, top_type & > | operator^= (const Right &x) |
| Symmetrical difference.
|
|
std::enable_if_t< is_compatible_set< Right >::value, Set< Set< E, Comparator >, Comparator > > | extract_symdif (const Right &x) |
| Compute the symmetrical difference and make *this equal to s.
|
|
bool | operator== (const GenericSet< Set2, Set< E, Comparator >, Comparator > &s) const |
| comparison
|
|
bool | operator< (const GenericSet< Set2, Set< E, Comparator >, Comparator > &s) const |
| lexicographical comparison
|
|
template<typename E, typename Comparator>
class pm::PowerSet< E, Comparator >
A Set with elements of type Set<E>, providing methods for adding elements while preserving subset or superset independence. Comparator
is a functor defining a total ordering on Set<E>.