songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Don't duplicate code between TDSVertex/Cell and TDS3::Vertex/Cell

This commit is contained in:
Mael Rouxel-Labbé 2019-12-30 18:31:02 +01:00
parent 801187c642
commit 6e69d886e3
2 changed files with 9 additions and 119 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

104
TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
View File

@ -83,113 +83,23 @@ typedef TriangulationDataStructure_3::Cell_handle Cell_handle;
/*! /*!
Default constructor Default constructor
*/ */
Cell_base(); TriangulationDSCellBase_3();
/*! /*!
Initializes the vertices with `v0, v1, v2, v3`. Neighbors are Initializes the vertices with `v0, v1, v2, v3`. Neighbors are
initialized to the default constructed handle. initialized to the default constructed handle.
*/ */
Cell_base( Vertex_handle v0, Vertex_handle v1, TriangulationDSCellBase_3( Vertex_handle v0, Vertex_handle v1,
Vertex_handle v2, Vertex_handle v3); Vertex_handle v2, Vertex_handle v3);
/*! /*!
Initializes the vertices with `v0, v1, v2, v3` and the neighbors with Initializes the vertices with `v0, v1, v2, v3` and the neighbors with
`n0, n1, n2, n3`. `n0, n1, n2, n3`.
*/ */
Cell_base( Vertex_handle v0, Vertex_handle v1, TriangulationDSCellBase_3( Vertex_handle v0, Vertex_handle v1,
Vertex_handle v2, Vertex_handle v3, Vertex_handle v2, Vertex_handle v3,
Cell_handle n0, Cell_handle n1, Cell_handle n0, Cell_handle n1,
Cell_handle n2, Cell_handle n3); Cell_handle n2, Cell_handle n3);
/// @}
/// \name Access Functions
/// @{
/*!
Returns the vertex `i` of `c`.
\pre \f$ i \in\{0, 1, 2, 3\}\f$.
*/
Vertex_handle vertex(int i) const;
/*!
Returns the index of `v`.
\pre `v` is a vertex of `c`
*/
int index(Vertex_handle v) const;
/*!
True iff `v` is a vertex of `c`.
*/
bool has_vertex(Vertex_handle v);
/*!
Returns `true` if `v` is a vertex of `c`, and
computes its index `i` in `c`.
*/
bool has_vertex(Vertex_handle v, int & i) const;
/*!
Returns the neighbor `i` of `c`.
\pre \f$ i \in\{0, 1, 2, 3\}\f$.
*/
Cell_handle neighbor(int i) const;
/*!
Returns the index of cell `n` in `c`.
\pre `n` is a neighbor of `c`.
*/
int index(Cell_handle n) const;
/*!
Returns `true` if `n` is a neighbor of `c`.
*/
bool has_neighbor(Cell_handle n);
/*!
Returns `true` if `n` is a neighbor of `c`, and
computes its index `i` in `c`.
*/
bool has_neighbor(Cell_handle n, int & i) const;
/// @}
/// \name Setting
/// @{
/*!
Sets vertex `i` to `v`.
\pre \f$ i \in\{0, 1, 2, 3\}\f$.
*/
void set_vertex(int i, Vertex_handle v);
/*!
Sets the vertices to the default constructed handle.
*/
void set_vertices();
/*!
Sets the vertices.
*/
void set_vertices( Vertex_handle v0, Vertex_handle v1,
Vertex_handle v2, Vertex_handle v3);
/*!
Sets neighbor `i` to `n`.
\pre \f$ i \in\{0, 1, 2, 3\}\f$.
*/
void set_neighbor(int i, Cell_handle n);
/*!
Sets the neighbors to the default constructed handle.
*/
void set_neighbors();
/*!
Sets the neighbors.
*/
void set_neighbors(Cell_handle n0, Cell_handle n1,
Cell_handle n2, Cell_handle n3);
/// @} /// @}

24
TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
View File

@ -77,32 +77,12 @@ typedef TriangulationDataStructure_3::Cell_handle Cell_handle;
/*! /*!
Default constructor. Default constructor.
*/ */
TriangulationVertexBase_3(); TriangulationDSVertexBase_3();
/*! /*!
Constructs a vertex pointing to cell `c`. Constructs a vertex pointing to cell `c`.
*/ */
TriangulationVertexBase_3(Cell_handle c); TriangulationDSVertexBase_3(Cell_handle c);
/// @}
/// \name Access Functions
/// @{
/*!
Returns the pointer to an incident cell
*/
Cell_handle cell() const;
/// @}
/// \name Setting
/// @{
/*!
Sets the incident cell.
*/
void set_cell(Cell_handle c);
/// @} /// @}