concepts::ConnectorData Class Reference

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

#include <continuityData.hh>

Inheritance diagram for concepts::ConnectorData:
concepts::EdgeData concepts::FaceData concepts::VertexData

Public Types

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

Public Member Functions

void addCell (const CellData &c)
 Adds c to the list of cells. More...
 
iterator begin ()
 Returns the STL beginning of the list of cells. More...
 
const_iterator begin () const
 Returns the STL beginning of the list of cells. More...
 
iterator end ()
 Returns the STL end of the list of cells. More...
 
const_iterator end () const
 Returns the STL end of the list of cells. More...
 
bool hasCell (const Connector &c) const
 Returns true if c is in the list of cells. More...
 
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. More...
 

Protected Attributes

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

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 39 of file continuityData.hh.

Member Typedef Documentation

◆ const_iterator

The constant STL iterator over the list of cells.

Definition at line 44 of file continuityData.hh.

◆ iterator

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

The STL iterator over the list of cells.

Definition at line 42 of file continuityData.hh.

Member Function Documentation

◆ addCell()

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_

◆ begin() [1/2]

iterator concepts::ConnectorData::begin ( )
inline

Returns the STL beginning of the list of cells.

Definition at line 63 of file continuityData.hh.

◆ begin() [2/2]

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

Returns the STL beginning of the list of cells.

Definition at line 65 of file continuityData.hh.

◆ end() [1/2]

iterator concepts::ConnectorData::end ( )
inline

Returns the STL end of the list of cells.

Definition at line 67 of file continuityData.hh.

◆ end() [2/2]

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

Returns the STL end of the list of cells.

Definition at line 69 of file continuityData.hh.

◆ hasCell()

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

Returns true if c is in the list of cells.

◆ replaceCell()

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

◆ cells_

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

List of cells.

Definition at line 72 of file continuityData.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