#include <spaceSet.hh>

Inheritance diagram for concepts::Set< IndexRange >:
concepts::BaseSet< IndexRange >

Classes

class  index_iterator
 

Public Member Functions

uint dim () const
 Returns the number of incides in the set. More...
 
void erase (const IndexRange &i)
 Erases a index range with splitting, e.g. More...
 
bool exist (IndexRange val) const
 Returns true, if a value is in the set. More...
 
std::pair< bool, uint > exist (uint i) const
 Returns true and the position, if a index is in the set, otherwise false. More...
 
index_iterator index_begin (uint i=0) const
 Returns an iterator to the i th index. More...
 
const index_iterator index_end () const
 Returns an iterator behind the last index. More...
 
void insert (const IndexRange &i)
 Inserts a index range with possible merging, e.g. More...
 
bool isempty () const
 Returns true, if set is empty. More...
 
uint max () const
 Returns the largest index. More...
 
Set< IndexRangeoperator&& (const Set< IndexRange > &set) const
 
Set< IndexRangeoperator&& (Set< IndexRange > &set) const
 
Set< IndexRangeoperator() (const Set< uint > &set) const
 Returns subset with indices set. More...
 
Set< G * > operator() (G &(H::*fun)() const) const
 Returns element wise application of a member function, e.g. More...
 
Set< G > operator() (G(H::*fun)() const) const
 Returns element wise application of a member function, e.g. More...
 
Set< G > operator() (G(H::*fun)(I) const, J i) const
 Returns element wise application of a member function, e.g. More...
 
Set< IndexRangeoperator- (const Set< IndexRange > &set) const
 
Set< IndexRangeoperator- (Set< IndexRange > &set) const
 
Set< uint > operator== (const IndexRange val) const
 Returns the indices of elements with are equal to val. More...
 
uint operator[] (uint i) const
 Returns the i th index. More...
 
Set< IndexRange > & operator|= (const Set< IndexRange > &set)
 
Set< IndexRangeoperator|| (const Set< IndexRange > &set) const
 
Set< IndexRangeoperator|| (Set< IndexRange > &set) const
 
 Set ()
 
template<class F >
 Set (const F &set)
 
 Set (const IndexRange set)
 
virtual ~Set ()
 

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
 

Private Member Functions

virtual void difference_ (const_iterator_ first, const_iterator_ last, insert_iterator_ i) const
 Insert the set difference of this set with that between iterator first and second into i. More...
 
virtual void intersection_ (const_iterator_ first, const_iterator_ last, insert_iterator_ i) const
 Insert the set intersection of this set with that between iterator first and second into i. More...
 
virtual void union_ (const_iterator_ first, const_iterator_ last, insert_iterator_ i) const
 Insert the set union of this set with that between iterator first and second into i. More...
 

Detailed Description

Definition at line 17 of file spaceSet.hh.

Member Typedef Documentation

◆ const_iterator_

typedef std::set<IndexRange >::const_iterator concepts::BaseSet< IndexRange >::const_iterator_
protectedinherited

Definition at line 114 of file set.hh.

◆ insert_iterator_

typedef std::insert_iterator<std::set<IndexRange > > concepts::BaseSet< IndexRange >::insert_iterator_
protectedinherited

Definition at line 115 of file set.hh.

Constructor & Destructor Documentation

◆ Set() [1/3]

concepts::Set< IndexRange >::Set ( )
inline

Definition at line 19 of file spaceSet.hh.

◆ Set() [2/3]

template<class F >
concepts::Set< IndexRange >::Set ( const F &  set)
inline

Definition at line 21 of file spaceSet.hh.

◆ Set() [3/3]

concepts::Set< IndexRange >::Set ( const IndexRange  set)
inline

Definition at line 22 of file spaceSet.hh.

◆ ~Set()

virtual concepts::Set< IndexRange >::~Set ( )
inlinevirtual

Definition at line 23 of file spaceSet.hh.

Member Function Documentation

◆ difference_()

virtual void concepts::Set< IndexRange >::difference_ ( const_iterator_  first,
const_iterator_  last,
insert_iterator_  i 
) const
privatevirtual

Insert the set difference of this set with that between iterator first and second into i.

Reimplemented from concepts::BaseSet< IndexRange >.

◆ dim()

uint concepts::Set< IndexRange >::dim ( ) const

Returns the number of incides in the set.

◆ erase()

void concepts::Set< IndexRange >::erase ( const IndexRange i)

Erases a index range with splitting, e.g.

{[1-10]}.erase([2-3]) -> {[1],[4-10]}

◆ exist() [1/2]

bool concepts::BaseSet< IndexRange >::exist ( IndexRange  val) const
inlineinherited

Returns true, if a value is in the set.

Definition at line 108 of file set.hh.

◆ exist() [2/2]

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.

◆ index_begin()

index_iterator concepts::Set< IndexRange >::index_begin ( uint  i = 0) const

Returns an iterator to the i th index.

◆ index_end()

const index_iterator concepts::Set< IndexRange >::index_end ( ) const

Returns an iterator behind the last index.

◆ info()

virtual std::ostream& concepts::Set< IndexRange >::info ( std::ostream &  os) const
protectedvirtual

Reimplemented from concepts::BaseSet< IndexRange >.

◆ insert()

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]}

◆ intersection_()

virtual void concepts::Set< IndexRange >::intersection_ ( const_iterator_  first,
const_iterator_  last,
insert_iterator_  i 
) const
privatevirtual

Insert the set intersection of this set with that between iterator first and second into i.

Reimplemented from concepts::BaseSet< IndexRange >.

◆ isempty()

bool concepts::BaseSet< IndexRange >::isempty
inlineinherited

Returns true, if set is empty.

Definition at line 110 of file set.hh.

◆ max()

uint concepts::Set< IndexRange >::max ( ) const

Returns the largest index.

◆ operator&&() [1/2]

Set< IndexRange > concepts::BaseSet< IndexRange >::operator&& ( const Set< IndexRange > &  set) const
inlineinherited

Definition at line 94 of file set.hh.

◆ operator&&() [2/2]

Set< IndexRange > concepts::BaseSet< IndexRange >::operator&& ( Set< IndexRange > &  set) const
inlineinherited

Definition at line 95 of file set.hh.

◆ operator()() [1/4]

Set< IndexRange > concepts::BaseSet< IndexRange >::operator() ( const Set< uint > &  set) const
inlineinherited

Returns subset with indices set.

Definition at line 102 of file set.hh.

◆ operator()() [2/4]

Set< G * > concepts::BaseSet< IndexRange >::operator() ( G &(H::*)() const  fun) const
inlineinherited

Returns element wise application of a member function, e.g.

Connector1::key()

Definition at line 83 of file set.hh.

◆ operator()() [3/4]

Set< G > concepts::BaseSet< IndexRange >::operator() ( G(H::*)() const  fun) const
inlineinherited

Returns element wise application of a member function, e.g.

Key::key()

Definition at line 78 of file set.hh.

◆ operator()() [4/4]

Set< G > concepts::BaseSet< IndexRange >::operator() ( G(H::*)(I) const  fun,
i 
) const
inlineinherited

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]

Set< IndexRange > concepts::BaseSet< IndexRange >::operator- ( const Set< IndexRange > &  set) const
inlineinherited

Definition at line 97 of file set.hh.

◆ operator-() [2/2]

Set< IndexRange > concepts::BaseSet< IndexRange >::operator- ( Set< IndexRange > &  set) const
inlineinherited

Definition at line 98 of file set.hh.

◆ operator==()

Set< uint > concepts::BaseSet< IndexRange >::operator== ( const IndexRange  val) const
inlineinherited

Returns the indices of elements with are equal to val.

Definition at line 100 of file set.hh.

◆ operator[]()

uint concepts::Set< IndexRange >::operator[] ( uint  i) const

Returns the i th index.

◆ operator|=()

Set<IndexRange>& concepts::Set< IndexRange >::operator|= ( const Set< IndexRange > &  set)

◆ operator||() [1/2]

Set< IndexRange > concepts::BaseSet< IndexRange >::operator|| ( const Set< IndexRange > &  set) const
inlineinherited

Definition at line 91 of file set.hh.

◆ operator||() [2/2]

Set< IndexRange > concepts::BaseSet< IndexRange >::operator|| ( Set< IndexRange > &  set) const
inlineinherited

Definition at line 92 of file set.hh.

◆ union_()

virtual void concepts::Set< IndexRange >::union_ ( const_iterator_  first,
const_iterator_  last,
insert_iterator_  i 
) const
privatevirtual

Insert the set union of this set with that between iterator first and second into i.

Reimplemented from concepts::BaseSet< IndexRange >.


The documentation for this class was generated from the following file:
Page URL: http://wiki.math.ethz.ch/bin/view/Concepts/WebHome
21 August 2020
© 2020 Eidgenössische Technische Hochschule Zürich