, including all inherited members.
| beginEdge() (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| beginEdge() const (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| beginVertex() (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| beginVertex() const (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| ConstEdgeIterator typedef (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| ConstVertexIterator typedef (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| edge_ (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | [protected] |
| EdgeIterator typedef (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| endEdge() (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| endEdge() const (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| endVertex() (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| endVertex() const (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| getEdge(const SESVertex *vertex1, const SESVertex *vertex2, SESEdge *&edge) const | GraphFace< SESVertex, SESEdge, SESFace > | |
| getEdges(const SESVertex *vertex, SESEdge *&edge1, SESEdge *&edge2) const | GraphFace< SESVertex, SESEdge, SESFace > | |
| getIndex() const | GraphFace< SESVertex, SESEdge, SESFace > | |
| getRSEdge() const | SESFace | |
| getRSFace() const | SESFace | |
| getRSVertex() const | SESFace | |
| getSimilarEdge(const SESEdge *edge) const | GraphFace< SESVertex, SESEdge, SESFace > | |
| getType() const | SESFace | |
| GraphEdge<Vertex,Edge,Face> (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | [friend] |
| GraphFace() | GraphFace< SESVertex, SESEdge, SESFace > | |
| GraphFace(const GraphFace< SESVertex, SESEdge, SESFace > &face, bool deep=false) | GraphFace< SESVertex, SESEdge, SESFace > | |
| GraphVertex<Vertex,Edge,Face> (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | [friend] |
| has(SESVertex *vertex) const | GraphFace< SESVertex, SESEdge, SESFace > | |
| has(SESEdge *edge) const | GraphFace< SESVertex, SESEdge, SESFace > | |
| hasSingularEdges() const | SESFace | |
| index_ (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | [protected] |
| insert(SESVertex *vertex) | GraphFace< SESVertex, SESEdge, SESFace > | |
| insert(SESEdge *edge) | GraphFace< SESVertex, SESEdge, SESFace > | |
| isFree() const | SESFace | |
| isNeighbouredTo(SESFace *face) const | SESFace | |
| normalize(bool singular) | SESFace | |
| numberOfEdges() const | GraphFace< SESVertex, SESEdge, SESFace > | |
| numberOfVertices() const | GraphFace< SESVertex, SESEdge, SESFace > | |
| operator *=(const SESFace &) const | SESFace | [virtual] |
| operator!=(const SESFace &) const | SESFace | [virtual] |
| operator=(const SESFace &sesface) | SESFace | |
| GraphFace< SESVertex, SESEdge, SESFace >::operator=(const GraphFace< SESVertex, SESEdge, SESFace > &face) | GraphFace< SESVertex, SESEdge, SESFace > | |
| operator==(const SESFace &) const | SESFace | [virtual] |
| remove(SESVertex *vertex) | GraphFace< SESVertex, SESEdge, SESFace > | |
| remove(SESEdge *edge) | GraphFace< SESVertex, SESEdge, SESFace > | |
| rsedge_ (defined in SESFace) | SESFace | [protected] |
| rsface_ (defined in SESFace) | SESFace | [protected] |
| rsvertex_ (defined in SESFace) | SESFace | [protected] |
| SESComputer (defined in SESFace) | SESFace | [friend] |
| SESEdge (defined in SESFace) | SESFace | [friend] |
| SESFace() | SESFace | |
| SESFace(const SESFace &sesface, bool deep=false) | SESFace | |
| SESFace(Type type, RSVertex *rsvertex, RSEdge *rsedge, RSFace *rsface) | SESFace | |
| SESSingularityCleaner (defined in SESFace) | SESFace | [friend] |
| SESTriangulator (defined in SESFace) | SESFace | [friend] |
| SESVertex (defined in SESFace) | SESFace | [friend] |
| set(const SESFace &sesface, bool deep=false) | SESFace | |
| GraphFace< SESVertex, SESEdge, SESFace >::set(const GraphFace< SESVertex, SESEdge, SESFace > &face, bool deep=false) | GraphFace< SESVertex, SESEdge, SESFace > | |
| setIndex(Index index) | GraphFace< SESVertex, SESEdge, SESFace > | |
| setRSEdge(RSEdge *rsedge) | SESFace | |
| setRSFace(RSFace *rsface) | SESFace | |
| setRSVertex(RSVertex *rsvertex) | SESFace | |
| setType(Type type) | SESFace | |
| SolventExcludedSurface (defined in SESFace) | SESFace | [friend] |
| substitute(const SESVertex *old_vertex, SESVertex *new_vertex) | GraphFace< SESVertex, SESEdge, SESFace > | |
| substitute(const SESEdge *old_edge, SESEdge *new_edge) | GraphFace< SESVertex, SESEdge, SESFace > | |
| TriangulatedSES (defined in SESFace) | SESFace | [friend] |
| Type enum name | SESFace | |
| type_ (defined in SESFace) | SESFace | [protected] |
| TYPE_CONTACT enum value (defined in SESFace) | SESFace | |
| TYPE_SPHERIC enum value (defined in SESFace) | SESFace | |
| TYPE_TORIC enum value (defined in SESFace) | SESFace | |
| TYPE_TORIC_SINGULAR enum value (defined in SESFace) | SESFace | |
| vertex_ (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | [protected] |
| VertexIterator typedef (defined in GraphFace< SESVertex, SESEdge, SESFace >) | GraphFace< SESVertex, SESEdge, SESFace > | |
| ~GraphFace() | GraphFace< SESVertex, SESEdge, SESFace > | [virtual] |
| ~SESFace() | SESFace | [virtual] |