concepts::Set< Connector2 * > Class Reference

#include <connectorSet.hh>

Inheritance diagram for concepts::Set< Connector2 * >:

Public Member Functions
Set< const Connector2 * >	child (uint i) const
Set< Connector1 * >	edge (uint i) const
bool	exist (Connector2 * val) const
	Returns true, if a value is in the set. More...
bool	isempty () const
	Returns true, if set is empty. More...
Set< const Key * >	key () const
Set< Connector2 * >	operator&& (const Set< Connector2 * > &set) const
Set< Connector2 * >	operator&& (Set< Connector2 * > &set) const
Set< Connector2 * >	operator() (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< Connector2 * >	operator- (const Set< Connector2 * > &set) const
Set< Connector2 * >	operator- (Set< Connector2 * > &set) const
Set< uint >	operator== (const Connector2 * val) const
	Returns the indices of elements with are equal to val. More...
BaseSet< Connector2 * > &	operator|= (const Set< Connector2 * > &set)
Set< Connector2 * >	operator|| (const Set< Connector2 * > &set) const
Set< Connector2 * >	operator|| (Set< Connector2 * > &set) const
	Set ()
template<class F >
	Set (const F &set)
Set< Connector0 * >	vertex (uint i) const
virtual	~Set ()

Protected Types
typedef std::set< Connector2 * >::const_iterator	const_iterator_
typedef std::insert_iterator< std::set< Connector2 * > >	insert_iterator_

Protected 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 std::ostream &	info (std::ostream &os) const
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 155 of file connectorSet.hh.

Member Typedef Documentation

const_iterator_

typedef std::set<Connector2 * >::const_iterator concepts::BaseSet< Connector2 * >::const_iterator_

protectedinherited

Definition at line 114 of file set.hh.

insert_iterator_

typedef std::insert_iterator<std::set<Connector2 * > > concepts::BaseSet< Connector2 * >::insert_iterator_

protectedinherited

Definition at line 115 of file set.hh.

Constructor & Destructor Documentation

Set() [1/2]

concepts::Set< Connector2 * >::Set ( )

inline

Definition at line 157 of file connectorSet.hh.

Set() [2/2]

template<class F >

concepts::Set< Connector2 * >::Set ( const F &  set )

inline

Definition at line 159 of file connectorSet.hh.

~Set()

virtual concepts::Set< Connector2 * >::~Set ( )

inlinevirtual

Definition at line 160 of file connectorSet.hh.

Member Function Documentation

child()

Set<const Connector2*> concepts::Set< Connector2 * >::child

(

uint

i

)

const

difference_()

void concepts::BaseSet< Connector2 * >::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 129 of file set.hh.

edge()

Set<Connector1*> concepts::Set< Connector2 * >::edge

(

uint

i

)

const

exist()

bool concepts::BaseSet< Connector2 * >::exist ( Connector2 *  val ) const

inlineinherited

Returns true, if a value is in the set.

Definition at line 108 of file set.hh.

info()

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

protectedvirtualinherited

Definition at line 112 of file set.hh.

intersection_()

void concepts::BaseSet< Connector2 * >::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 124 of file set.hh.

isempty()

bool concepts::BaseSet< Connector2 * >::isempty

inlineinherited

Returns true, if set is empty.

Definition at line 110 of file set.hh.

key()

Set<const Key*> concepts::Set< Connector2 * >::key

(

)

const

operator&&() [1/2]

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

inlineinherited

Definition at line 94 of file set.hh.

operator&&() [2/2]

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

inlineinherited

Definition at line 95 of file set.hh.

operator()() [1/4]

Set< Connector2 * > concepts::BaseSet< Connector2 * >::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< Connector2 * >::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< Connector2 * >::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< Connector2 * >::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 88 of file set.hh.

operator-() [1/2]

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

inlineinherited

Definition at line 97 of file set.hh.

operator-() [2/2]

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

inlineinherited

Definition at line 98 of file set.hh.

operator==()

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

inlineinherited

Returns the indices of elements with are equal to val.

Definition at line 100 of file set.hh.

operator|=()

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

inlineinherited

Definition at line 105 of file set.hh.

operator||() [1/2]

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

inlineinherited

Definition at line 91 of file set.hh.

operator||() [2/2]

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

inlineinherited

Definition at line 92 of file set.hh.

union_()

void concepts::BaseSet< Connector2 * >::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 119 of file set.hh.

vertex()

Set<Connector0*> concepts::Set< Connector2 * >::vertex

(

uint

i

)

const

---

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

• geometry/connectorSet.hh