#include <topology.hh>
Public Member Functions | |
Edge (Vertex &vtx0, Vertex &vtx1, const Attribute attrib=Attribute()) | |
Edge (Edge &edg0, Edge &edg1) | |
Construct a "parent" edge of the edges edg0 and edg1 . | |
virtual Edge * | child (uint i, bool mode=0) |
virtual const Edge * | child (uint i) const |
Vertex * | vertex (uint i) const |
Edge * | clone (Vertex &vtx0, Vertex &vtx1) const |
int | operator== (const Connector &cntr) const |
Comparison operator. | |
const Key & | key () const |
Returns the key of the connector. | |
const Attribute & | attrib () const |
Returns the attribute of the connector. | |
void | setAttrib (uint attrb) |
int | related (const Connector &conn) const |
Protected Member Functions | |
Edge (Vertex &vtx0, Vertex &vtx1, const Attribute attrib, const Key &key) | |
Constructor used by clone() | |
virtual std::ostream & | info (std::ostream &os) const |
Returns information in an output stream. | |
Protected Attributes | |
Edge * | lnk_ |
Pointer to a sibling. | |
Edge * | chld_ |
Vertex * | vtx_ [2] |
Array of the vertices. | |
bool | regular_ |
Key | key_ |
Unique key of the connector. | |
Attribute | attrib_ |
Attribute. | |
Static Protected Attributes | |
static uint | cnt_ |
An edge in the topology. Implements the abstract methods from the parent classes to query the children and the vertices of the edge.
Definition at line 73 of file topology.hh.
Constructor.
vtx0 | Starting vertex of this edge |
vtx1 | Ending vertex of this edge |
attrib | Attribute of the edge |
|
inlineinherited |
Returns the attribute of the connector.
Definition at line 108 of file connector.hh.
Implements concepts::Connector1.
Returns a child.
When creating new children, the starting vertex of the first edge is the child of the starting vertex of this edge, the ending Vertex is new. It is also the starting vertex for the second child. The ending vertex of the second child is the child of the ending Vertex of this edge.
i | Index of the child to be returned. |
mode | mode = 1: No children are created mode = 0: If no child exists, two new children are created (with the same attributes as this one). |
Implements concepts::Connector1.
Returns the pointer of a new Edge with the same attribute, the same key but NO children and sibling
Definition at line 132 of file topology.hh.
|
protectedvirtual |
Returns information in an output stream.
Reimplemented from concepts::Connector.
|
inlineinherited |
Returns the key of the connector.
Definition at line 105 of file connector.hh.
Comparison operator.
Definition at line 102 of file connector.hh.
Checks if this connector is related to conn
. It is being checked if one of the two is an ancestor of the other.
conn | Other connector |
conn
is an ancestor of this connectorconn
is a descendant of this connectorDefinition at line 111 of file connector.hh.
Returns a 0D component: vertex A 1D element consists of 0D elements, the vertices can be queried here.
i | Index of the vertex |
Implements concepts::Connector1.
Definition at line 103 of file topology.hh.
|
protectedinherited |
Definition at line 132 of file connector.hh.
|
protected |
Pointer to the first child. The children are stored in a linked list.
Definition at line 120 of file topology.hh.
|
staticprotectedinherited |
Counter for the connectors. This counter is used to create the unique key of the connector.
Definition at line 211 of file connector.hh.
|
protectedinherited |
Unique key of the connector.
Definition at line 129 of file connector.hh.
|
protected |
Pointer to a sibling.
Definition at line 115 of file topology.hh.
|
protected |
Boolean, if its a regular edge
a regular edge can have children, create children
Definition at line 129 of file topology.hh.
|
protected |
Array of the vertices.
Definition at line 123 of file topology.hh.