#include <set.hh>

Inheritance diagram for concepts::Set< F >:

Public Member Functions
	Set (const F &val)

template<class G >
	Set (const G &set)

template<class G , class H >
Set< G >	operator() (G(H::*fun)() const) const

template<class G , class H >
Set< G * >	operator() (G &(H::*fun)() const) const

template<class G , class H , class I , class J >
Set< G >	operator() (G(H::*fun)(I) const, J i) const

Set< F >	operator() (const Set< uint > &set) const
	Returns subset with indices `set`.

Set< F >	operator\|\| (const Set< F > &set) const

Set< F >	operator\|\| (Set< F > &set) const

Set< F >	operator&& (const Set< F > &set) const

Set< F >	operator&& (Set< F > &set) const

Set< F >	operator- (const Set< F > &set) const

Set< F >	operator- (Set< F > &set) const

Set< uint >	operator== (const F val) const
	Returns the indices of elements with are equal to `val`.

BaseSet< F > &	operator\|= (const Set< F > &set)

bool	exist (F 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< F >::const_iterator	const_iterator_

typedef std::insert_iterator< std::set< F > >	insert_iterator_

Protected Member Functions
virtual std::ostream &	info (std::ostream &os) const
	Returns information in an output stream.

virtual void	union_ (const_iterator_ first, const_iterator_ last, insert_iterator_ i) const

virtual void	intersection_ (const_iterator_ first, const_iterator_ last, insert_iterator_ i) const

virtual void	difference_ (const_iterator_ first, const_iterator_ last, insert_iterator_ i) const

Detailed Description

template<class F>
class concepts::Set< F >

Set with operations, output operator, and method of the particular element types. Need of specialisation for different types.

Author: Kersten Schmidt, 2005

Examples: RobinBCs.cc, inhomDirichletBCsLagrange.cc, and inhomNeumannBCs.cc.

Definition at line 39 of file set.hh.

Member Typedef Documentation

◆ const_iterator_

template<class F >

typedef std::set<F>::const_iterator concepts::BaseSet< F >::const_iterator_

protectedinherited

Definition at line 114 of file set.hh.

◆ insert_iterator_

template<class F >

typedef std::insert_iterator<std::set<F> > concepts::BaseSet< F >::insert_iterator_

protectedinherited

Definition at line 115 of file set.hh.

Constructor & Destructor Documentation

◆ Set() [1/3]

template<class F >

concepts::Set< F >::Set ( )

inline

Definition at line 41 of file set.hh.

◆ Set() [2/3]

template<class F >

concepts::Set< F >::Set ( const F & val )

inline

Definition at line 42 of file set.hh.

◆ Set() [3/3]

template<class F >

template<class G >

concepts::Set< F >::Set ( const G & set )

inline

Definition at line 44 of file set.hh.

◆ ~Set()

template<class F >

virtual concepts::Set< F >::~Set ( )

inlinevirtual

Definition at line 45 of file set.hh.

Member Function Documentation

◆ difference_()

template<class F >

void concepts::BaseSet< F >::difference_	(	const_iterator_	first,
		const_iterator_	last,
		insert_iterator_	i
	)		const

protectedvirtualinherited

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

Definition at line 242 of file set.hh.

◆ exist()

template<class F >

bool concepts::BaseSet< F >::exist ( F val ) const

inlineinherited

Returns true, if a value is in the set.

Definition at line 296 of file set.hh.

◆ info()

template<class F >

std::ostream & concepts::BaseSet< F >::info ( std::ostream & os ) const

protectedvirtualinherited

Returns information in an output stream.

Reimplemented from concepts::OutputOperator.

Reimplemented in concepts::Set< IndexRange >.

Definition at line 301 of file set.hh.

◆ intersection_()

template<class F >

void concepts::BaseSet< F >::intersection_	(	const_iterator_	first,
		const_iterator_	last,
		insert_iterator_	i
	)		const

protectedvirtualinherited

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

Definition at line 230 of file set.hh.

◆ isempty()

template<class F >

bool concepts::BaseSet< F >::isempty ( ) const

inlineinherited

Returns true, if set is empty.

Definition at line 110 of file set.hh.

◆ operator&&() [1/2]

template<class F >

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

inlineinherited

Definition at line 216 of file set.hh.

◆ operator&&() [2/2]

template<class F >

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

inlineinherited

Definition at line 223 of file set.hh.

◆ operator()() [1/4]

template<class F >

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

inlineinherited

Returns subset with indices set.

Definition at line 271 of file set.hh.

◆ operator()() [2/4]

template<class F >

template<class G , class H >

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

inlineinherited

Returns element wise application of a member function, e.g. Connector1::key()

Definition at line 181 of file set.hh.

◆ operator()() [3/4]

template<class F >

template<class G , class H >

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

inlineinherited

Returns element wise application of a member function, e.g. Key::key()

Definition at line 170 of file set.hh.

◆ operator()() [4/4]

template<class F >

template<class G , class H , class I , class J >

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

inlineinherited

Returns element wise application of a member function, e.g. Connector1::vertex(uint i)

Definition at line 192 of file set.hh.

◆ operator-() [1/2]

template<class F >

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

inlineinherited

Definition at line 248 of file set.hh.

◆ operator-() [2/2]

template<class F >

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

inlineinherited

Definition at line 255 of file set.hh.

◆ operator==()

template<class F >

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

inlineinherited

Returns the indices of elements with are equal to val.

Definition at line 262 of file set.hh.

◆ operator|=()

template<class F >

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

inlineinherited

Definition at line 288 of file set.hh.

◆ operator||() [1/2]

template<class F >

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

inlineinherited

Definition at line 202 of file set.hh.

◆ operator||() [2/2]

template<class F >

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

inlineinherited

Definition at line 209 of file set.hh.

◆ union_()

template<class F >

void concepts::BaseSet< F >::union_	(	const_iterator_	first,
		const_iterator_	last,
		insert_iterator_	i
	)		const

protectedvirtualinherited

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

Definition at line 236 of file set.hh.

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

hp3D/traces.hh
toolbox/set.hh

Class documentation of Concepts

Public Member Functions

Protected Types

Protected Member Functions

Detailed Description

Member Typedef Documentation

◆ const_iterator_

◆ insert_iterator_

Constructor & Destructor Documentation

◆ Set() [1/3]

◆ Set() [2/3]

◆ Set() [3/3]

◆ ~Set()

Member Function Documentation

◆ difference_()

◆ exist()

◆ info()

◆ intersection_()

◆ isempty()

◆ operator&&() [1/2]

◆ operator&&() [2/2]

◆ operator()() [1/4]

◆ operator()() [2/4]

◆ operator()() [3/4]

◆ operator()() [4/4]

◆ operator-() [1/2]

◆ operator-() [2/2]

◆ operator==()

◆ operator|=()

◆ operator||() [1/2]

◆ operator||() [2/2]

◆ union_()