pm::GenericMutableSet< TSet, E, Comparator > Class Template Reference

Generic type for ordered mutable sets More...

Inheritance diagram for pm::GenericMutableSet< TSet, E, Comparator >:

Collaboration diagram for pm::GenericMutableSet< TSet, E, Comparator >:

Public Types
using	element_type = E
	element types
using	element_comparator = Comparator
	functor type for comparing elements
using	generic_type = GenericSet
	generic type
using	top_type = typename Generic< Top >::top_type
	top type

Public Member Functions
template<typename Right >
std::enable_if_t< is_compatible_set< Right >::value, top_type & >	operator+= (const Right &x)
	Set union
template<typename Right >
std::enable_if_t< is_compatible_element< Right >::value, bool >	collect (const Right &x)
	Add to the set, report true if existed formerly.
template<typename Right >
std::enable_if_t< is_compatible_set< Right >::value, top_type & >	operator-= (const Right &x)
	Set difference
template<typename Right >
std::enable_if_t< is_compatible_set< Right >::value, top_type & >	operator*= (const Right &x)
	Set intersection
template<typename Right >
std::enable_if_t< is_compatible_set< Right >::value, top_type & >	operator^= (const Right &x)
	Symmetrical difference.
template<typename Right >
std::enable_if_t< is_compatible_set< Right >::value, Set< E, Comparator > >	extract_symdif (const Right &x)
	Compute the symmetrical difference and make *this equal to s.
bool	operator== (const GenericSet< Set2, E, Comparator > &s) const
	comparison
bool	operator< (const GenericSet< Set2, E, Comparator > &s) const
	lexicographical comparison

Detailed Description

template<typename TSet, typename E = typename TSet::element_type, typename Comparator = typename TSet::element_comparator>
class pm::GenericMutableSet< TSet, E, Comparator >

Generic type for ordered mutable sets

---

The documentation for this class was generated from the following file:

• lib/core/include/Set.h