Stores additional information on a vertex, namely its cells and edges.
More...
#include <continuityData.hh>
Stores additional information on a vertex, namely its cells and edges.
- Author
- Philipp Frauenfelder, 2002
Definition at line 249 of file continuityData.hh.
◆ const_iterator
The constant STL iterator over the list of cells.
Definition at line 44 of file continuityData.hh.
◆ iterator
◆ VertexData()
| concepts::VertexData::VertexData |
( |
const Connector0 & |
vertex | ) |
|
|
inline |
◆ addCell()
| void concepts::ConnectorData::addCell |
( |
const CellData & |
c | ) |
|
|
inherited |
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
-
| c | Cell to be added to cells_ |
◆ addEdge()
| void concepts::VertexData::addEdge |
( |
const EdgeData & |
e | ) |
|
Adds e to edges_ whithout check.
◆ begin() [1/2]
| iterator concepts::ConnectorData::begin |
( |
| ) |
|
|
inlineinherited |
Returns the STL beginning of the list of cells.
Definition at line 63 of file continuityData.hh.
◆ begin() [2/2]
Returns the STL beginning of the list of cells.
Definition at line 65 of file continuityData.hh.
◆ checkRelations()
| bool concepts::VertexData::checkRelations |
( |
| ) |
|
Checks the relations in edges_.
This member function is used to determine the support of the basis function associated to this vertex. The support of the basis function on this vertex consists of the cells in cells_. The support is enlarged step by step until it is possible to define a continuous global basis function on this support. The edges in edges_ are those edges of the cells in cells_ which have this vertex as one of their vertices.
To determine if the basis function has a continous support, the relationship of the edges in edges_ are checked. If two edges are related, it is not possible to define a continuous basis function.
Related edges are treated as follows: the cell in \c cells_
which is common to this vertex and the smaller edge is removed from cells_ and replaced by the ancestor of the removed cell such that the larger edge and the edge of the new cell are identical.
- Invariant
- The edges in
edges_ belong to the cells in cells_. To assert this invariant, recreateEdgeList_ is called if something has changed.
◆ doCheckRelations()
| static bool concepts::VertexData::doCheckRelations |
( |
std::map< uint, VertexData > & |
vertexList | ) |
|
|
static |
Calls checkRelations for each vertex in the vertexList.
If the relations cannot be cleared, the vertex is removed from the list.
◆ end() [1/2]
| iterator concepts::ConnectorData::end |
( |
| ) |
|
|
inlineinherited |
◆ end() [2/2]
◆ findCommonCell_()
| const CellData* concepts::VertexData::findCommonCell_ |
( |
const EdgeData & |
edge | ) |
const |
|
private |
Finds a cell which is common to this vertex and the edge.
◆ hasCell()
| bool concepts::ConnectorData::hasCell |
( |
const Connector & |
c | ) |
const |
|
inherited |
Returns true if c is in the list of cells.
◆ key()
| Key concepts::VertexData::key |
( |
| ) |
const |
|
inline |
◆ recreateEdgeList_()
| void concepts::VertexData::recreateEdgeList_ |
( |
| ) |
|
|
private |
Removes the edges in edges_ and rebuilds this list from the cells in cells_.
◆ replaceCell()
| void concepts::ConnectorData::replaceCell |
( |
const CellData & |
remove, |
|
|
const CellData & |
add |
|
) |
| |
|
inherited |
Removes remove from the list of cells and tries to add add to this list using addCell.
- Parameters
-
| remove | Cell which has to be removed from cells_ |
| add | Cell which should be added to cells_ |
◆ vertex()
| const Connector0& concepts::VertexData::vertex |
( |
| ) |
const |
|
inline |
◆ operator<<
| std::ostream& operator<< |
( |
std::ostream & |
os, |
|
|
const VertexData & |
e |
|
) |
| |
|
friend |
◆ cells_
| std::map<uint, const CellData*> concepts::ConnectorData::cells_ |
|
protectedinherited |
◆ edges_
| std::map<uint, EdgeData> concepts::VertexData::edges_ |
|
private |
◆ io_
| bool concepts::VertexData::io_ |
|
private |
Is set to true if the vertex is okay.
Ie. checkRelations did not have to change anything. The constructor sets it to false.
Definition at line 299 of file continuityData.hh.
◆ vertex_
The documentation for this class was generated from the following file:
