concepts::Set< F > Class Template Reference

Set with operations, output operator, and method of the particular element types. More...

#include <set.hh>

Inheritance diagram for concepts::Set< F >:

Collaboration diagram for concepts::Set< F >:

List of all members.

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

Definition at line 35 of file set.hh.

---

Member Typedef Documentation

template<class F>

typedef std::set<F>::const_iterator concepts::BaseSet< F >::const_iterator_ [protected, inherited]

Definition at line 109 of file set.hh.

template<class F>

typedef std::insert_iterator<std::set<F> > concepts::BaseSet< F >::insert_iterator_ [protected, inherited]

Definition at line 110 of file set.hh.

---

Constructor & Destructor Documentation

template<class F>

concepts::Set< F >::Set

(

)

[inline]

Definition at line 37 of file set.hh.

template<class F>

concepts::Set< F >::Set

(

const F &

val

)

[inline]

Definition at line 38 of file set.hh.

template<class F>

template<class G >

concepts::Set< F >::Set

(

const G &

set

)

[inline]

Definition at line 40 of file set.hh.

template<class F>

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

(

)

[inline, virtual]

Definition at line 41 of file set.hh.

---

Member Function Documentation

template<class F >

void concepts::BaseSet< F >::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.

Reimplemented in concepts::Set< IndexRange >.

Definition at line 230 of file set.hh.

template<class F>

bool concepts::BaseSet< F >::exist

(

F

val

)

const [inline, inherited]

Returns true, if a value is in the set.

Definition at line 283 of file set.hh.

template<class F >

std::ostream & concepts::BaseSet< F >::info

(

std::ostream &

os

)

const [protected, virtual, inherited]

Returns information in an output stream.

Reimplemented from concepts::OutputOperator.

Reimplemented in concepts::Set< IndexRange >.

Definition at line 288 of file set.hh.

Here is the call graph for this function:

template<class F >

void concepts::BaseSet< F >::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.

Reimplemented in concepts::Set< IndexRange >.

Definition at line 218 of file set.hh.

template<class F>

bool concepts::BaseSet< F >::isempty

(

)

const [inline, inherited]

Returns true, if set is empty.

Definition at line 105 of file set.hh.

template<class F>

Set< F > concepts::BaseSet< F >::operator&&

(

Set< F > &

set

)

const [inline, inherited]

Definition at line 210 of file set.hh.

template<class F>

Set< F > concepts::BaseSet< F >::operator&&

(

const Set< F > &

set

)

const [inline, inherited]

Definition at line 203 of file set.hh.

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 [inline, inherited]

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

Connector1::vertex(uint i)

Definition at line 179 of file set.hh.

template<class F >

template<class G , class H >

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

(

G &(H::*)() const

fun

)

const [inline, inherited]

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

Connector1::key()

Definition at line 168 of file set.hh.

template<class F >

template<class G , class H >

Set< G > concepts::BaseSet< F >::operator()

(

G(H::*)() const

fun

)

const [inline, inherited]

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

Key::key()

Definition at line 157 of file set.hh.

template<class F >

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

(

const Set< uint > &

set

)

const [inline, inherited]

Returns subset with indices set.

Definition at line 258 of file set.hh.

template<class F>

Set< F > concepts::BaseSet< F >::operator-

(

const Set< F > &

set

)

const [inline, inherited]

Definition at line 235 of file set.hh.

template<class F>

Set< F > concepts::BaseSet< F >::operator-

(

Set< F > &

set

)

const [inline, inherited]

Definition at line 242 of file set.hh.

template<class F>

Set< uint > concepts::BaseSet< F >::operator==

(

const F

val

)

const [inline, inherited]

Returns the indices of elements with are equal to val.

Definition at line 249 of file set.hh.

template<class F>

BaseSet< F > & concepts::BaseSet< F >::operator|=

(

const Set< F > &

set

)

[inline, inherited]

Reimplemented in concepts::Set< IndexRange >.

Definition at line 275 of file set.hh.

template<class F>

Set< F > concepts::BaseSet< F >::operator||

(

const Set< F > &

set

)

const [inline, inherited]

Definition at line 189 of file set.hh.

template<class F>

Set< F > concepts::BaseSet< F >::operator||

(

Set< F > &

set

)

const [inline, inherited]

Definition at line 196 of file set.hh.

template<class F >

void concepts::BaseSet< F >::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.

Reimplemented in concepts::Set< IndexRange >.

Definition at line 224 of file set.hh.

---

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

• toolbox/set.hh