|
| ||||||||||||||||
All sets hold a string representation of the elements. All type information will be lost, as elements will all be promoted to strings.
| typedef set<T> Set | Set |
| typedef Set::iterator iterator | iterator |
| typedef Set::const_iterator const_iterator | const_iterator |
| static const char* id | id |
| static Hash _hash | _hash |
| ElemSetAny (const Set& val)
| ElemSetAny |
| ElemSetAny (const char* c_str)
| ElemSetAny |
Parameters:
| c_str | initialize from string in the form element1,element2,... |
| ElemSetAny ()
| ElemSetAny |
| string str ()
| str |
[const]
Returns: string representation of set.
Reimplemented from Element.
| void insert (const T& s)
| insert |
Parameters:
| s | element to insert. |
| void insert (const ElemSetAny<T>& s)
| insert |
Insert all elements of other set.
Parameters:
| s | set to insert. |
| bool operator== (const ElemSetAny<T>& rhs)
| operator== |
[const]
Left and right sets are identical [same elements and size].
Parameters:
| rhs | set to compare with |
| bool operator!= (const ElemSetAny<T>& rhs)
| operator!= |
[const]
Left and right are not identical
Parameters:
| rhs | set to compare with |
| bool operator< (const ElemSetAny<T>& rhs)
| operator< |
[const]
All elements on left match, but right has more elments.
Parameters:
| rhs | set to compare with |
| bool operator> (const ElemSetAny<T>& rhs)
| operator> |
[const]
All elements on right match, but left has more elements.
Parameters:
| rhs | set to compare with |
| bool operator<= (const ElemSetAny<T>& rhs)
| operator<= |
[const]
Left is a subset of right.
Parameters:
| rhs | set to compare with |
| bool operator>= (const ElemSetAny<T>& rhs)
| operator>= |
[const]
Right is a subset of left.
Parameters:
| rhs | set to compare with |
| bool operator< (const T& rhs)
| operator< |
[const]
All elements on left match, but right has more.
May only be true if left is an empty set.
Parameters:
| rhs | element to compare with. |
| bool operator> (const T& rhs)
| operator> |
[const]
All elements on on right match, but left has more.
Will be true if the element is present in the set, and the set contains at least one more element.
Parameters:
| rhs | element to compare with. |
| bool operator== (const T& rhs)
| operator== |
[const]
Left and right are identical.
Will be true in a single element set which contains the rhs element.
Parameters:
| rhs | element to compare with. |
| bool operator!= (const T& rhs)
| operator!= |
[const]
Disjoint sets.
Will be true if element is not contained in set.
Parameters:
| rhs | element to compare with. |
| bool operator<= (const T& rhs)
| operator<= |
[const]
Left is a subset of right.
Will be true if set is empty or contains rhs.
Parameters:
| rhs | element to compare with. |
| bool operator>= (const T& rhs)
| operator>= |
[const]
Right is a subset of left.
Will be true if element is contained in set.
Parameters:
| rhs | element to compare with. |
| bool nonempty_intersection (const ElemSetAny<T>& rhs)
| nonempty_intersection |
[const]
Returns: true if intersection is not empty
| void erase (const ElemSetAny<T>& rhs)
| erase |
Removes elements in set.
Parameters:
| s | elements to remove. |
Reimplemented from ElemSet.
| void erase (const ElemSet& rhs)
| erase |
Reimplemented from ElemSet.
| iterator begin ()
| begin |
Obtain iterator for set.
Returns: iterator for the set.
| iterator end ()
| end |
Obtain an iterator for the end.
Returns: iterator for the end of the set.
| const_iterator begin ()
| begin |
[const]
Obtain const iterator for set.
Returns: const iterator for the set.
| const_iterator end ()
| end |
[const]
Obtain an const iterator for the end.
Returns: const iterator for the end of the set.
| const char* type ()
| type |
[const]
Reimplemented from Element.
