From 3fbdc2deed2b1c03e7f140c7abaf25d3c353f41c Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Tue, 15 Jul 2025 11:03:47 +0100 Subject: [PATCH] polish --- .../CGAL/Periodic_3_triangulation_3.h | 2 +- TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h | 2 +- Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h index 8a4de97b43a..daec23b7c5d 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_3.h @@ -1312,7 +1312,7 @@ OutputIterator adjacent_vertices(Vertex_handle v, OutputIterator vertices) const; /*! -Returns the degree of a vertex, that is, the number of adjacent vertices. +Returns the degree of `v`, that is, the number of adjacent vertices. \pre `v` \f$ \neq\f$ `Vertex_handle()`, `t`.`is_vertex(v)`. */ size_type degree(Vertex_handle v) const; diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h index 03e4ad24928..752093512af 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h @@ -960,7 +960,7 @@ OutputIterator adjacent_vertices(Vertex_handle v, OutputIterator vertices) const; /*! -Returns the degree of a vertex, that is, the number of incident vertices. +Returns the degree of `v`, that is, the number of incident vertices. \pre `v` \f$ \neq\f$ `Vertex_handle()`, `tds.is_vertex(v)`. */ size_type degree(Vertex_handle v) const; diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h index b4a4c8e672c..32a38695566 100644 --- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h +++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h @@ -1669,7 +1669,7 @@ OutputIterator finite_adjacent_vertices(Vertex_handle v, OutputIterator vertices) const; /*! -Returns the degree of a `v`, that is, the number of incident vertices. +Returns the degree of `v`, that is, the number of incident vertices. The infinite vertex is counted. \pre `v != Vertex_handle()`, `t.is_vertex(v)`. */