Home | Doxygen Documentation | Tutorials | Developer Tools (restricted)

Public Types | Public Member Functions | Protected Attributes
concepts::ConnectorData Class Reference

Generalization of the class which store additional information for topological entities. More...

#include <continuityData.hh>

Inheritance diagram for concepts::ConnectorData:
Inheritance graph
[legend]

List of all members.

Public Types

typedef std::map< uint, const
CellData * >::const_iterator 
const_iterator
 The constant STL iterator over the list of cells.
typedef std::map< uint, const
CellData * >::iterator 
iterator
 The STL iterator over the list of cells.

Public Member Functions

void addCell (const CellData &c)
 Adds c to the list of cells.
iterator begin ()
 Returns the STL beginning of the list of cells.
const_iterator begin () const
 Returns the STL beginning of the list of cells.
const_iterator end () const
 Returns the STL end of the list of cells.
iterator end ()
 Returns the STL end of the list of cells.
bool hasCell (const Connector &c) const
 Returns true if c is in the list of cells.
void replaceCell (const CellData &remove, const CellData &add)
 Removes remove from the list of cells and tries to add add to this list using addCell.

Protected Attributes

std::map< uint, const CellData * > cells_
 List of cells.

Detailed Description

Generalization of the class which store additional information for topological entities.

This class holds the methods for the list of cells which are adjacent to a topological entity.

Author:
Philipp Frauenfelder, 2002

Definition at line 36 of file continuityData.hh.


Member Typedef Documentation

The constant STL iterator over the list of cells.

Definition at line 41 of file continuityData.hh.

typedef std::map<uint, const CellData*>::iterator concepts::ConnectorData::iterator

The STL iterator over the list of cells.

Definition at line 39 of file continuityData.hh.


Member Function Documentation

void concepts::ConnectorData::addCell ( const CellData c)

Adds c to the list of cells.

If there is a cell in the list of cells which is related to c, c is only inserted, if it is larger than the already present cell (which is removed). If c is smaller than an already present cell, the insertion is canceled.

Parameters:
cCell to be added to cells_
iterator concepts::ConnectorData::begin ( ) [inline]

Returns the STL beginning of the list of cells.

Definition at line 60 of file continuityData.hh.

const_iterator concepts::ConnectorData::begin ( ) const [inline]

Returns the STL beginning of the list of cells.

Definition at line 62 of file continuityData.hh.

const_iterator concepts::ConnectorData::end ( ) const [inline]

Returns the STL end of the list of cells.

Definition at line 66 of file continuityData.hh.

iterator concepts::ConnectorData::end ( ) [inline]

Returns the STL end of the list of cells.

Definition at line 64 of file continuityData.hh.

bool concepts::ConnectorData::hasCell ( const Connector c) const

Returns true if c is in the list of cells.

void concepts::ConnectorData::replaceCell ( const CellData remove,
const CellData add 
)

Removes remove from the list of cells and tries to add add to this list using addCell.

Parameters:
removeCell which has to be removed from cells_
addCell which should be added to cells_

Member Data Documentation

std::map<uint, const CellData*> concepts::ConnectorData::cells_ [protected]

List of cells.

Definition at line 69 of file continuityData.hh.


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

Home | Doxygen Documentation | Tutorials | Developer Tools (restricted)