concepts::Set< const Connector * > Class Reference

#include <connectorSet.hh>

Inheritance diagram for concepts::Set< const Connector * >:
concepts::BaseSet< const Connector * >

Public Member Functions

bool exist (const Connector * 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< const Connector * > operator&& (const Set< const Connector * > &set) const
 
Set< const Connector * > operator&& (Set< const Connector * > &set) const
 
Set< const Connector * > 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< const Connector * > operator- (const Set< const Connector * > &set) const
 
Set< const Connector * > operator- (Set< const Connector * > &set) const
 
Set< uint > operator== (const const Connector * val) const
 Returns the indices of elements with are equal to val. More...
 
BaseSet< const Connector * > & operator|= (const Set< const Connector * > &set)
 
Set< const Connector * > operator|| (const Set< const Connector * > &set) const
 
Set< const Connector * > operator|| (Set< const Connector * > &set) const
 
 Set ()
 
template<class F >
 Set (const F &set)
 
virtual ~Set ()
 

Protected Types

typedef std::set< const Connector * >::const_iterator const_iterator_
 
typedef std::insert_iterator< std::set< const Connector * > > 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 57 of file connectorSet.hh.

Member Typedef Documentation

◆ const_iterator_

typedef std::set<const Connector * >::const_iterator concepts::BaseSet< const Connector * >::const_iterator_
protectedinherited

Definition at line 114 of file set.hh.

◆ insert_iterator_

typedef std::insert_iterator<std::set<const Connector * > > concepts::BaseSet< const Connector * >::insert_iterator_
protectedinherited

Definition at line 115 of file set.hh.

Constructor & Destructor Documentation

◆ Set() [1/2]

concepts::Set< const Connector * >::Set ( )
inline

Definition at line 59 of file connectorSet.hh.

◆ Set() [2/2]

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

Definition at line 61 of file connectorSet.hh.

◆ ~Set()

virtual concepts::Set< const Connector * >::~Set ( )
inlinevirtual

Definition at line 62 of file connectorSet.hh.

Member Function Documentation

◆ difference_()

void concepts::BaseSet< const Connector * >::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.

◆ exist()

bool concepts::BaseSet< const Connector * >::exist ( const Connector 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< const Connector * >::info ( std::ostream &  os) const
protectedvirtualinherited

Definition at line 112 of file set.hh.

◆ intersection_()

void concepts::BaseSet< const Connector * >::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< const Connector * >::isempty
inlineinherited

Returns true, if set is empty.

Definition at line 110 of file set.hh.

◆ key()

Set<const Key*> concepts::Set< const Connector * >::key ( ) const

◆ operator&&() [1/2]

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

Definition at line 94 of file set.hh.

◆ operator&&() [2/2]

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

Definition at line 95 of file set.hh.

◆ operator()() [1/4]

Set< const Connector * > concepts::BaseSet< const Connector * >::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< const Connector * >::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< const Connector * >::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< const Connector * >::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< const Connector * > concepts::BaseSet< const Connector * >::operator- ( const Set< const Connector * > &  set) const
inlineinherited

Definition at line 97 of file set.hh.

◆ operator-() [2/2]

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

Definition at line 98 of file set.hh.

◆ operator==()

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

Returns the indices of elements with are equal to val.

Definition at line 100 of file set.hh.

◆ operator|=()

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

Definition at line 105 of file set.hh.

◆ operator||() [1/2]

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

Definition at line 91 of file set.hh.

◆ operator||() [2/2]

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

Definition at line 92 of file set.hh.

◆ union_()

void concepts::BaseSet< const Connector * >::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.


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