Classes | |
class | index_iterator |
Public Member Functions | |
template<class F > | |
Set (const F &set) | |
Set (const IndexRange set) | |
std::pair< bool, uint > | exist (uint i) const |
void | insert (const IndexRange &i) |
void | erase (const IndexRange &i) |
uint | dim () const |
Returns the number of incides in the set. | |
uint | max () const |
Returns the largest index. | |
uint | operator[] (uint i) const |
Returns the i th index. | |
Set< IndexRange > & | operator|= (const Set< IndexRange > &set) |
index_iterator | index_begin (uint i=0) const |
Returns an iterator to the i th index. | |
const index_iterator | index_end () const |
Returns an iterator behind the last index. | |
Set< G > | operator() (G(H::*fun)() const) const |
Set< G * > | operator() (G &(H::*fun)() const) const |
Set< G > | operator() (G(H::*fun)(I) const, J i) const |
Set< IndexRange > | operator() (const Set< uint > &set) const |
Returns subset with indices set . | |
Set< IndexRange > | operator|| (const Set< IndexRange > &set) const |
Set< IndexRange > | operator|| (Set< IndexRange > &set) const |
Set< IndexRange > | operator&& (const Set< IndexRange > &set) const |
Set< IndexRange > | operator&& (Set< IndexRange > &set) const |
Set< IndexRange > | operator- (const Set< IndexRange > &set) const |
Set< IndexRange > | operator- (Set< IndexRange > &set) const |
Set< uint > | operator== (const IndexRange val) const |
Returns the indices of elements with are equal to val . | |
bool | exist (IndexRange val) const |
Returns true, if a value is in the set. | |
bool | isempty () const |
Returns true, if set is empty. | |
Protected Types | |
typedef std::set< IndexRange >::const_iterator | const_iterator_ |
typedef std::insert_iterator< std::set< IndexRange > > | insert_iterator_ |
Protected Member Functions | |
virtual std::ostream & | info (std::ostream &os) const |
Returns information in an output stream. | |
Definition at line 17 of file spaceSet.hh.
|
protectedinherited |
|
protectedinherited |
|
inline |
Definition at line 19 of file spaceSet.hh.
|
inline |
Definition at line 21 of file spaceSet.hh.
|
inline |
Definition at line 22 of file spaceSet.hh.
|
inlinevirtual |
Definition at line 23 of file spaceSet.hh.
void concepts::Set< IndexRange >::erase | ( | const IndexRange & | i | ) |
Erases a index range with splitting, e.g. {[1-10]}.erase([2-3]) -> {[1],[4-10]}
|
inlineinherited |
std::pair< bool, uint > concepts::Set< IndexRange >::exist | ( | uint | i | ) | const |
Returns true and the position, if a index is in the set, otherwise false.
|
protectedvirtual |
Returns information in an output stream.
Reimplemented from concepts::BaseSet< IndexRange >.
void concepts::Set< IndexRange >::insert | ( | const IndexRange & | i | ) |
Inserts a index range with possible merging, e.g. {[1-4],[6-10]}.insert([4-5]) -> {[1-10]}
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
Returns element wise application of a member function, e.g. Connector1::key()
|
inlineinherited |
Returns element wise application of a member function, e.g. Key::key()
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |