Definition at line 70 of file connectorSet.hh.
◆ const_iterator_
◆ insert_iterator_
◆ Set() [1/2]
◆ Set() [2/2]
◆ ~Set()
◆ difference_()
|
|
protectedvirtualinherited |
Insert the set difference of this set with that between iterator first and second into i.
Definition at line 129 of file set.hh.
◆ exist()
Returns true, if a value is in the set.
Definition at line 108 of file set.hh.
◆ info()
|
|
protectedvirtualinherited |
◆ intersection_()
|
|
protectedvirtualinherited |
Insert the set intersection of this set with that between iterator first and second into i.
Definition at line 124 of file set.hh.
◆ isempty()
Returns true, if set is empty.
Definition at line 110 of file set.hh.
◆ operator&&() [1/2]
◆ operator&&() [2/2]
◆ operator()() [1/4]
Returns subset with indices set.
Definition at line 102 of file set.hh.
◆ operator()() [2/4]
◆ operator()() [3/4]
Returns element wise application of a member function, e.g. Key::key()
Definition at line 78 of file set.hh.
◆ operator()() [4/4]
Returns element wise application of a member function, e.g. Connector1::vertex(uint i)
Definition at line 88 of file set.hh.
◆ operator-() [1/2]
◆ operator-() [2/2]
◆ operator==()
Returns the indices of elements with are equal to val.
Definition at line 100 of file set.hh.
◆ operator|=()
◆ operator||() [1/2]
◆ operator||() [2/2]
◆ union_()
|
|
protectedvirtualinherited |
Insert the set union of this set with that between iterator first and second into i.
Definition at line 119 of file set.hh.
The documentation for this class was generated from the following file: