concepts::Set< const Key * > Class Template Reference

#include <connectorSet.hh>

Inheritance diagram for concepts::Set< const Key * >:

Collaboration diagram for concepts::Set< const Key * >:

List of all members.

Public Member Functions
bool	exist (const Key *val) const
	Returns true, if a value is in the set.
bool	isempty () const
	Returns true, if set is empty.
Set< uint >	key () const
Set< const Key * >	operator&& (const Set< const Key * > &set) const
Set< const Key * >	operator&& (Set< const Key * > &set) const
Set< const Key * >	operator() (const Set< uint > &set) const
	Returns subset with indices set.
Set< G >	operator() (G(H::*fun)() const) const
	Returns element wise application of a member function, e.g.
Set< G * >	operator() (G &(H::*fun)() const) const
	Returns element wise application of a member function, e.g.
Set< G >	operator() (G(H::*fun)(I) const, J i) const
	Returns element wise application of a member function, e.g.
Set< const Key * >	operator- (Set< const Key * > &set) const
Set< const Key * >	operator- (const Set< const Key * > &set) const
Set< uint >	operator== (const const Key *val) const
	Returns the indices of elements with are equal to val.
BaseSet< const Key * > &	operator|= (const Set< const Key * > &set)
Set< const Key * >	operator|| (Set< const Key * > &set) const
Set< const Key * >	operator|| (const Set< const Key * > &set) const
template<class F >
	Set (const F &set)
	Set ()
virtual	~Set ()
Protected Types
typedef std::set< const Key * > ::const_iterator	const_iterator_
typedef std::insert_iterator < std::set< const Key * > >	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.
virtual std::ostream &	info (std::ostream &os) const
	Returns information in an output stream.
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.
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.

---

Detailed Description

template<>
class concepts::Set< const Key * >

Definition at line 43 of file connectorSet.hh.

---

Member Typedef Documentation

typedef std::set<const Key * >::const_iterator concepts::BaseSet< const Key * >::const_iterator_ [protected, inherited]

Definition at line 109 of file set.hh.

typedef std::insert_iterator<std::set<const Key * > > concepts::BaseSet< const Key * >::insert_iterator_ [protected, inherited]

Definition at line 110 of file set.hh.

---

Constructor & Destructor Documentation

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

(

)

[inline]

Definition at line 45 of file connectorSet.hh.

template<class F >

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

(

const F &

set

)

[inline]

Definition at line 47 of file connectorSet.hh.

virtual concepts::Set< const Key * >::~Set

(

)

[inline, virtual]

Definition at line 48 of file connectorSet.hh.

---

Member Function Documentation

virtual void concepts::BaseSet< const Key * >::difference_	(	const_iterator_	first,
		const_iterator_	last,
		insert_iterator_	i
	)		const [protected, virtual, inherited]

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

bool concepts::BaseSet< const Key * >::exist

(

const Key *

val

)

const [inline, inherited]

Returns true, if a value is in the set.

virtual std::ostream& concepts::BaseSet< const Key * >::info

(

std::ostream &

os

)

const [protected, virtual, inherited]

Returns information in an output stream.

Reimplemented from concepts::OutputOperator.

virtual void concepts::BaseSet< const Key * >::intersection_	(	const_iterator_	first,
		const_iterator_	last,
		insert_iterator_	i
	)		const [protected, virtual, inherited]

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

bool concepts::BaseSet< const Key * >::isempty

(

)

const [inline, inherited]

Returns true, if set is empty.

Definition at line 105 of file set.hh.

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

(

)

const

Set<const Key * > concepts::BaseSet< const Key * >::operator&&

(

Set< const Key * > &

set

)

const [inline, inherited]

Set<const Key * > concepts::BaseSet< const Key * >::operator&&

(

const Set< const Key * > &

set

)

const [inline, inherited]

Set<G> concepts::BaseSet< const Key * >::operator()

(

G(H::*)() const

fun

)

const [inline, inherited]

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

Key::key()

Set<const Key * > concepts::BaseSet< const Key * >::operator()

(

const Set< uint > &

set

)

const [inline, inherited]

Returns subset with indices set.

Set<G*> concepts::BaseSet< const Key * >::operator()

(

G &(H::*)() const

fun

)

const [inline, inherited]

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

Connector1::key()

Set<G> concepts::BaseSet< const Key * >::operator()	(	G(H::*)(I) const	fun,
		J	i
	)		const [inline, inherited]

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

Connector1::vertex(uint i)

Set<const Key * > concepts::BaseSet< const Key * >::operator-

(

Set< const Key * > &

set

)

const [inline, inherited]

Set<const Key * > concepts::BaseSet< const Key * >::operator-

(

const Set< const Key * > &

set

)

const [inline, inherited]

Set<uint> concepts::BaseSet< const Key * >::operator==

(

const const Key *

val

)

const [inline, inherited]

Returns the indices of elements with are equal to val.

BaseSet<const Key * >& concepts::BaseSet< const Key * >::operator|=

(

const Set< const Key * > &

set

)

[inline, inherited]

Set<const Key * > concepts::BaseSet< const Key * >::operator||

(

const Set< const Key * > &

set

)

const [inline, inherited]

Set<const Key * > concepts::BaseSet< const Key * >::operator||

(

Set< const Key * > &

set

)

const [inline, inherited]

virtual void concepts::BaseSet< const Key * >::union_	(	const_iterator_	first,
		const_iterator_	last,
		insert_iterator_	i
	)		const [protected, virtual, inherited]

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

---

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

• geometry/connectorSet.hh