From d309bc89ce33cdb971d5fb17d628f5ba151c6c08 Mon Sep 17 00:00:00 2001 From: Laurent Rineau Date: Tue, 30 Sep 2025 17:11:15 +0200 Subject: [PATCH] fix typo "and and" --- .../ConformingConstrainedDelaunayTriangulationCellBase_3.h | 2 +- Documentation/doc/biblio/geom.bib | 2 +- Interval_skip_list/include/CGAL/Interval_skip_list.h | 2 +- .../include/CGAL/Polygon_mesh_processing/distance.h | 2 +- 4 files changed, 4 insertions(+), 4 deletions(-) diff --git a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConformingConstrainedDelaunayTriangulationCellBase_3.h b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConformingConstrainedDelaunayTriangulationCellBase_3.h index e31bc212cd2..34ed4a4bcb4 100644 --- a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConformingConstrainedDelaunayTriangulationCellBase_3.h +++ b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Concepts/ConformingConstrainedDelaunayTriangulationCellBase_3.h @@ -3,7 +3,7 @@ \cgalConcept The concept `ConformingConstrainedDelaunayTriangulationCellBase_3` refines the concept -`TriangulationCellBase_3` and and describes the requirements for a base cell class of +`TriangulationCellBase_3` and describes the requirements for a base cell class of the `CGAL::Conforming_constrained_Delaunay_triangulation_3` class. \cgalRefines{TriangulationCellBase_3, BaseWithTimeStamp} diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib index 8b08afe0107..07295e7aab1 100644 --- a/Documentation/doc/biblio/geom.bib +++ b/Documentation/doc/biblio/geom.bib @@ -118600,7 +118600,7 @@ both for rendering and for modeling. Contains C code." @article{ph-ddocs-92 , author = "J. P. Pratt and V. P. Heuring" -, title = "Designing digital optical computing systems: power and and crosstalk" +, title = "Designing digital optical computing systems: power and crosstalk" , journal = "Appl. Optics" , volume = 31 , number = 23 diff --git a/Interval_skip_list/include/CGAL/Interval_skip_list.h b/Interval_skip_list/include/CGAL/Interval_skip_list.h index d2721b844ff..576ebe76477 100644 --- a/Interval_skip_list/include/CGAL/Interval_skip_list.h +++ b/Interval_skip_list/include/CGAL/Interval_skip_list.h @@ -177,7 +177,7 @@ class Interval_for_container : public Interval_ // remove markers for Interval I starting at left, the left endpoint - // of I, and and stopping at the right endpoint of I. + // of I, and stopping at the right endpoint of I. Interval_handle removeMarkers(IntervalSLnode* left, const Interval& I); diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h index 29d4d5810bb..d52812fb783 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h @@ -1363,7 +1363,7 @@ preprocess_bounded_error_squared_Hausdorff_distance_impl(const TriangleMesh1& tm if(is_one_sided_distance) // one-sided distance { - if(tm1_only.size() > 0) // create TM1 and and full TM2 + if(tm1_only.size() > 0) // create TM1 and full TM2 { tm1_tree.insert(tm1_only.begin(), tm1_only.end(), tm1, vpm1); tm2_tree.insert(faces2.begin(), faces2.end(), tm2, vpm2);