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

remove vertices(vertex) that is useless

This commit is contained in:
Jane Tournois 2023-10-19 11:53:56 +02:00
parent fbfcbe43d8
commit 47e17d0a2c
3 changed files with 0 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
View File

@ -1303,11 +1303,6 @@ Finite_vertex_handles finite_vertex_handles() const;
*/
Points points() const;
/*!
* returns an array of `Vertex_handle`s containing `v`
*/
std::array<Vertex_handle, 1> vertices(const Vertex_handle v) const;
/*!
* returns an array of `Vertex_handle`s containing the end-vertices of `e`
*/

4
Triangulation_3/include/CGAL/Triangulation_3.h
View File

@ -1921,10 +1921,6 @@ public:
}
/// Vertex ranges defining a simplex
std::array<Vertex_handle, 1> vertices(const Vertex_handle v) const
{
return std::array<Vertex_handle, 1>{v};
}
std::array<Vertex_handle, 2> vertices(const Edge& e) const
{
return std::array<Vertex_handle, 2>{

5
Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h
View File

@ -277,11 +277,6 @@ _test_vertices_array(const Triangulation& tr)
typedef typename Triangulation::Vertex_handle Vertex_handle;
typedef typename Triangulation::Cell_handle Cell_handle;
for (const Vertex_handle vh : tr.all_vertex_handles())
{
std::array<Vertex_handle, 1> vv = tr.vertices(vh);
assert(vv[0] == vh);
}
for (const Edge& e : tr.all_edges())
{
std::array<Vertex_handle, 2> vv = tr.vertices(e);