#include <graphVertex.h>

Public Types |
|
|
Type definitions
|
|
| typedef HashSet< Edge * >::Iterator | EdgeIterator |
|
typedef HashSet< Edge *
> ::ConstIterator |
ConstEdgeIterator |
| typedef HashSet< Face * >::Iterator | FaceIterator |
|
typedef HashSet< Face *
> ::ConstIterator |
ConstFaceIterator |
Public Member Functions |
|
|
Constructors and Destructors
|
|
| GraphVertex () | |
| Default constructor. |
|
| GraphVertex (const GraphVertex< Vertex, Edge, Face > &vertex, bool deep=false) | |
| Copy constructor. |
|
| virtual | ~GraphVertex () |
| Destructor. |
|
|
Assignment
|
|
| void | set (const GraphVertex< Vertex, Edge, Face > &vertex, bool deep=false) |
| Assign from another GraphVertex. |
|
| GraphVertex< Vertex, Edge, Face > & | operator= (const GraphVertex< Vertex, Edge, Face > &vertex) |
| Assign from another GraphVertex. |
|
|
Accessors
|
|
| void | insert (Edge *edge) |
| Insert a new edge into the HashSet of edges the
GraphVertex belongs to.
|
|
| void | insert (Face *face) |
| Insert a new face into the HashSet of faces the
GraphVertex belongs to.
|
|
| void | remove (Edge *edge) |
| Remove an edge from the HashSet of edges the
GraphVertex belongs to.
|
|
| void | remove (Face *face) |
| Remove a face from the HashSet of faces the
GraphVertex belongs to.
|
|
| Position | numberOfEdges () const |
| Return the number of edges the
GraphVertex belongs to.
|
|
| Position | numberOfFaces () const |
| Return the number of faces the
GraphVertex belongs to.
|
|
| void | setIndex (Index index) |
| Set the index of the vertex.
|
|
| Index | getIndex () const |
| Return the index of the vertex.
|
|
| bool | join (const Vertex &vertex) |
| Join two GraphVertices if they are
similar. |
|
| bool | substitute (Vertex *vertex) |
| Subsitute the GraphVertex by a similar
one. |
|
|
Predicates
|
|
| virtual bool | operator== (const Vertex &) const |
| Equality operator. |
|
| virtual bool | operator!= (const Vertex &) const |
| Inequality operator. |
|
| virtual bool | operator*= (const Vertex &) const |
| Similarity operator. |
|
| Face * | has (Face *face) const |
| Test whether the vertex is meber of
a given face. |
|
| Edge * | has (Edge *edge) const |
| Test whether the vertex is meber of
a given edge. |
|
| bool | hasEdges () const |
| Test whether the vertex has
edges. |
|
| bool | hasFaces () const |
| Test whether the vertex has
faces. |
|
|
External Iterators
|
|
| EdgeIterator | beginEdge () |
| ConstEdgeIterator | beginEdge () const |
| EdgeIterator | endEdge () |
| ConstEdgeIterator | endEdge () const |
| FaceIterator | beginFace () |
| ConstFaceIterator | beginFace () const |
| FaceIterator | endFace () |
| ConstFaceIterator | endFace () const |
Protected Attributes |
|
|
External Iterators
|
|
| HashSet< Edge * > | edges_ |
| HashSet< Face * > | faces_ |
| Index | index_ |
Friends |
|
|
Class friends
|
|
|
|
| class | GraphEdge< Vertex, Edge, Face > |
| class | GraphFace< Vertex, Edge, Face > |
| class | GraphTriangle< Vertex, Edge, Face > |
| BALL::GraphVertex< Vertex, Edge, Face >::GraphVertex | ( | ) |
Default constructor.
This method creates a new GraphVertex object.
| BALL::GraphVertex< Vertex, Edge, Face >::GraphVertex | ( | const GraphVertex< Vertex, Edge, Face > & | vertex, | |
| bool | deep =
false |
|||
| ) |
Copy constructor.
Create a new GraphVertex object from another.
| vertex | the GraphVertex object to be copied | |
| deep | if deep = false, all pointers are set to NULL (default). Otherwise the new GraphVertex object is linked to the neighbours of the old GraphVertex object. |
References BALL::GraphVertex< Vertex, Edge, Face >::edges_, and BALL::GraphVertex< Vertex, Edge, Face >::faces_.
| BALL::GraphVertex< Vertex, Edge, Face >::~GraphVertex | ( | ) | [virtual] |
Destructor.
Destructs the GraphVertex object.
| Index BALL::GraphVertex< Vertex, Edge, Face >::getIndex | ( | ) | const |
Return the index of the vertex.
| Edge * BALL::GraphVertex< Vertex, Edge, Face >::has | ( | Edge * | edge | ) | const |
Test whether the vertex is meber of a given edge.
| edge | a pointer to the edge to be tested |
References BALL::HashSet< Key >::begin(), and BALL::HashSet< Key >::end().
| Face * BALL::GraphVertex< Vertex, Edge, Face >::has | ( | Face * | face | ) | const |
Test whether the vertex is meber of a given face.
| face | a pointer to the the face to be tested |
References BALL::HashSet< Key >::begin(), and BALL::HashSet< Key >::end().
| void BALL::GraphVertex< Vertex, Edge, Face >::insert | ( | Face * | face | ) |
Insert a new face into the HashSet of faces the GraphVertex belongs to.
| face | a pointer to the new face |
References BALL::HashSet< Key >::insert().
| void BALL::GraphVertex< Vertex, Edge, Face >::insert | ( | Edge * | edge | ) |
Insert a new edge into the HashSet of edges the GraphVertex belongs to.
| edge | a pointer to the new edge |
References BALL::HashSet< Key >::insert().
| bool BALL::GraphVertex< Vertex, Edge, Face >::join | ( | const Vertex & | vertex | ) |
Join two GraphVertices if they are similar.
All edges and faces of the given Vertex are inserted.
| vertex | the Vertex to join with |
References BALL::HashSet< Key >::insert().
| Position BALL::GraphVertex< Vertex, Edge, Face >::numberOfEdges | ( | ) | const |
Return the number of edges the GraphVertex belongs to.
References BALL::HashSet< Key >::size().
| Position BALL::GraphVertex< Vertex, Edge, Face >::numberOfFaces | ( | ) | const |
Return the number of faces the GraphVertex belongs to.
References BALL::HashSet< Key >::size().
| bool BALL::GraphVertex< Vertex, Edge, Face >::operator!= | ( | const Vertex & | ) | const [virtual] |
Inequality operator.
Reimplemented in BALL::RSVertex, BALL::SASVertex, BALL::SESVertex, and BALL::TrianglePoint.
| bool BALL::GraphVertex< Vertex, Edge, Face >::operator*= | ( | const Vertex & | ) | const [virtual] |
Similarity operator.
Reimplemented in BALL::RSVertex, BALL::SASVertex, BALL::SESVertex, and BALL::TrianglePoint.
| GraphVertex< Vertex, Edge, Face > & BALL::GraphVertex< Vertex, Edge, Face >::operator= | ( | const GraphVertex< Vertex, Edge, Face > & | vertex | ) |
Assign from another GraphVertex.
The GraphVertex object is linked to the neighbours of the GraphVertex object to assign from.
| vertex | the GraphVertex object to assign from |
References BALL::GraphVertex< Vertex, Edge, Face >::edges_, BALL::GraphVertex< Vertex, Edge, Face >::faces_, and BALL::GraphVertex< Vertex, Edge, Face >::index_.
| bool BALL::GraphVertex< Vertex, Edge, Face >::operator== | ( | const Vertex & | ) | const [virtual] |
Equality operator.
Reimplemented in BALL::RSVertex, BALL::SASVertex, BALL::SESVertex, and BALL::TrianglePoint.
| void BALL::GraphVertex< Vertex, Edge, Face >::remove | ( | Face * | face | ) |
Remove a face from the HashSet of faces the GraphVertex belongs to.
| face | a pointer to the face to remove |
References BALL::HashSet< Key >::erase().
| void BALL::GraphVertex< Vertex, Edge, Face >::remove | ( | Edge * | edge | ) |
Remove an edge from the HashSet of edges the GraphVertex belongs to.
| edge | a pointer to the edge to remove |
References BALL::HashSet< Key >::erase().
| void BALL::GraphVertex< Vertex, Edge, Face >::set | ( | const GraphVertex< Vertex, Edge, Face > & | vertex, | |
| bool | deep =
false |
|||
| ) |
Assign from another GraphVertex.
| vertex | the GraphVertex object to assign from | |
| deep | if deep = false, all pointers are set to NULL (default). Otherwise the GraphVertex object is linked to the neighbours of the GraphVertex object to assign from. |
References BALL::GraphVertex< Vertex, Edge, Face >::edges_, BALL::GraphVertex< Vertex, Edge, Face >::faces_, and BALL::GraphVertex< Vertex, Edge, Face >::index_.
| void BALL::GraphVertex< Vertex, Edge, Face >::setIndex | ( | Index | index | ) |
Set the index of the vertex.
| index | the new index |
| bool BALL::GraphVertex< Vertex, Edge, Face >::substitute | ( | Vertex * | vertex | ) |
Subsitute the GraphVertex by a similar one.
The GraphVertex is substituted in all his Edges and Faces.
| vertex | a pointer to the vertex to substitute |
References BALL::HashSet< Key >::begin(), and BALL::HashSet< Key >::end().
1.5.8