From 613e6295249d148c2406b1f6f759aa74aaf9d9ca Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?= Date: Fri, 28 Mar 2025 21:01:24 +0100 Subject: [PATCH] ie > i.e. --- .../ArrangementPainterOstream.h | 2 +- Combinatorial_map/include/CGAL/Combinatorial_map.h | 2 +- .../internal/Combinatorial_map_internal_functors.h | 4 ++-- Generalized_map/include/CGAL/GMap_dart_iterators.h | 4 ++-- Generalized_map/include/CGAL/Generalized_map.h | 2 +- .../CGAL/Optimal_transportation_reconstruction_2.h | 2 +- .../include/CGAL/Triangulation_data_structure_3.h | 14 +++++++------- Triangulation_3/demo/Triangulation_3/Viewer.cpp | 2 +- .../include/CGAL/Delaunay_triangulation_3.h | 2 +- .../include/CGAL/Regular_triangulation_3.h | 2 +- Weights/include/CGAL/Weights/tangent_weights.h | 2 +- 11 files changed, 19 insertions(+), 19 deletions(-) diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h index 33942b6d83a..d983cea19d1 100644 --- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h +++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementPainterOstream.h @@ -232,7 +232,7 @@ protected: // methods // Assumes that clippingRect is valid. std::vector< X_monotone_curve_2 > visibleParts( X_monotone_curve_2 curve ); - // keep only the intersection points ie. throw out overlapping curve segments + // keep only the intersection points i.e. throw out overlapping curve segments void filterIntersectionPoints( std::vector< CGAL::Object >& res ); protected: // members diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h index 5135f5ec327..59f88e34970 100644 --- a/Combinatorial_map/include/CGAL/Combinatorial_map.h +++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h @@ -969,7 +969,7 @@ namespace CGAL { { return mnb_used_marks; } /** Test if a given mark is reserved. - * @return true iff the mark is reserved (ie in used). + * @return true iff the mark is reserved (i.e. in used). */ bool is_reserved(size_type amark) const { diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h index c76a210ae6f..6e82809a412 100644 --- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h +++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h @@ -64,7 +64,7 @@ * darts have the same info. * * internal::Test_is_same_attribute_functor to test if two - * i-attributes of two darts are isomorphic (ie they have the same info). + * i-attributes of two darts are isomorphic (i.e. they have the same info). * * internal::Test_is_same_attribute_point_functor to test if * the point of two i-attributes are equal. @@ -208,7 +208,7 @@ template struct Test_is_valid_attribute_functor { /** Test the validity of a i-cell-attribute. - * ie all the darts belonging to a i-cell are linked to the same attribute. + * In other words, all the darts belonging to a i-cell are linked to the same attribute. * @param adart a dart. * @param amark a mark used to mark darts of the i-cell. * @return true iff all the darts of the i-cell link to the same attribute. diff --git a/Generalized_map/include/CGAL/GMap_dart_iterators.h b/Generalized_map/include/CGAL/GMap_dart_iterators.h index 3e8b843eb6f..6a4c611bdaa 100644 --- a/Generalized_map/include/CGAL/GMap_dart_iterators.h +++ b/Generalized_map/include/CGAL/GMap_dart_iterators.h @@ -134,7 +134,7 @@ namespace CGAL { //**************************************************************************** /* Class CMap_dart_iterator_basic_of_two_alpha: to iterate * on the darts of the orbit : Ai1 (ie at most 4 darts). + * This general case if for delta>1 (i.e. at most 4 darts). * Basic classes do not guaranty correct marks (i.e. do not unmark darts in * the destructor, possible problem with the rewind). If you are not sure, * use CMap_dart_iterator_basic_of_two_alpha. @@ -445,7 +445,7 @@ namespace CGAL { /* Class CMap_dart_iterator_basic_of_three_alpha: to iterate * on the darts of the orbit : * Ai1 and delta2>1 (ie at most 8 darts). + * This general case if for delta1>1 and delta2>1 (i.e. at most 8 darts). * Basic classes do not guaranty correct marks (i.e. do not unmark darts in * the destructor, possible problem with the rewind). If you are not sure, * use CMap_dart_iterator_basic_of_two_alpha. diff --git a/Generalized_map/include/CGAL/Generalized_map.h b/Generalized_map/include/CGAL/Generalized_map.h index 4af0ee3a09a..acb4cc583da 100644 --- a/Generalized_map/include/CGAL/Generalized_map.h +++ b/Generalized_map/include/CGAL/Generalized_map.h @@ -876,7 +876,7 @@ namespace CGAL { { return mnb_used_marks; } /** Test if a given mark is reserved. - * @return true iff the mark is reserved (ie in used). + * @return true iff the mark is reserved (i.e. in used). */ bool is_reserved(size_type amark) const { diff --git a/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h b/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h index b8d09a2dbfd..910f799c365 100644 --- a/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h +++ b/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h @@ -234,7 +234,7 @@ public: /*! If `sample_size == 0`, the simplification is performed using an exhaustive priority queue. If `sample_size` is strictly positive the simplification is performed using a - multiple choice approach, ie, a best-choice selection in a random sample of + multiple choice approach, i.e., a best-choice selection in a random sample of edge collapse operators, of size `sample_size`. A typical value for the sample size is 15, but this value must be enlarged when targeting a very coarse simplification. \param sample_size If `sample_size != 0`, the size of the random sample replaces the priority queue. diff --git a/TDS_3/include/CGAL/Triangulation_data_structure_3.h b/TDS_3/include/CGAL/Triangulation_data_structure_3.h index ca34d9f92c5..3c2d36a1b59 100644 --- a/TDS_3/include/CGAL/Triangulation_data_structure_3.h +++ b/TDS_3/include/CGAL/Triangulation_data_structure_3.h @@ -1736,7 +1736,7 @@ create_star_3(Vertex_handle v, Cell_handle c, int li, int prev_ind2) Cell_handle nnn = n->neighbor(next_around_edge(jj2, jj1)); int zzz = nnn->index(vvv); if (nnn == cur) { - // Neighbor relation is reciprocal, ie + // Neighbor relation is reciprocal, i.e. // the cell we are looking for is not yet created. nnn = create_star_3(v, nnn, zz, zzz); } @@ -1794,7 +1794,7 @@ recursive_create_star_3(Vertex_handle v, Cell_handle c, int li, Cell_handle nnn = n->neighbor(next_around_edge(jj2, jj1)); int zzz = nnn->index(vvv); if (nnn == cur) { - // Neighbor relation is reciprocal, ie + // Neighbor relation is reciprocal, i.e. // the cell we are looking for is not yet created. nnn = recursive_create_star_3(v, nnn, zz, zzz,depth+1); } @@ -1855,7 +1855,7 @@ non_recursive_create_star_3(Vertex_handle v, Cell_handle c, int li, int prev_ind Cell_handle nnn = n->neighbor(next_around_edge(jj2, jj1)); int zzz = nnn->index(vvv); if (nnn == cur) { - // Neighbor relation is reciprocal, ie + // Neighbor relation is reciprocal, i.e. // the cell we are looking for is not yet created. //re-run the loop adjacency_info_stack.push( iAdjacency_info(zzz,cnew,ii,c,li,prev_ind2) ); @@ -2344,7 +2344,7 @@ flip( Cell_handle c, int i ) int in = n->index(c); // checks that the facet is flippable, - // ie the future edge does not already exist + // i.e. the future edge does not already exist if (is_edge(c->vertex(i), n->vertex(in))) return false; @@ -2367,7 +2367,7 @@ flip_flippable(Cell_handle c, int i ) int in = n->index(c); // checks that the facet is flippable, - // ie the future edge does not already exist + // i.e. the future edge does not already exist CGAL_expensive_precondition( !is_edge(c->vertex(i), n->vertex(in))); flip_really(c,i,n,in); @@ -2429,7 +2429,7 @@ flip( Cell_handle c, int i, int j ) && (number_of_vertices() >= 6) ); CGAL_expensive_precondition( is_cell(c) ); - // checks that the edge is flippable ie degree 3 + // checks that the edge is flippable, i.e. degree 3 int degree = 0; Cell_circulator ccir = incident_cells(c,i,j); Cell_circulator cdone = ccir; @@ -2479,7 +2479,7 @@ flip_flippable( Cell_handle c, int i, int j ) && (number_of_vertices() >= 6) ); CGAL_expensive_precondition( is_cell(c) ); - // checks that the edge is flippable ie degree 3 + // checks that the edge is flippable, i.e. degree 3 CGAL_precondition_code( int degree = 0; ); CGAL_precondition_code ( Cell_circulator ccir = incident_cells(c,i,j); ); diff --git a/Triangulation_3/demo/Triangulation_3/Viewer.cpp b/Triangulation_3/demo/Triangulation_3/Viewer.cpp index 12308b48517..d81f3ca7037 100644 --- a/Triangulation_3/demo/Triangulation_3/Viewer.cpp +++ b/Triangulation_3/demo/Triangulation_3/Viewer.cpp @@ -2040,7 +2040,7 @@ void Viewer::mouseReleaseEvent(QMouseEvent *event) } else { displayMessage( tr("No point is selected.") ); } - } else { /* select multiple points, ie. selection window > 1 */ + } else { /* select multiple points, i.e. selection window > 1 */ // define selection window if( m_rectSel.width() < 10 ) setSelectRegionWidth( 10 ); diff --git a/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h b/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h index 63ade11b5e8..35517beb83e 100644 --- a/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h +++ b/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h @@ -1542,7 +1542,7 @@ side_of_circle(Cell_handle c, int i, const Point& p, bool perturb) const if(dimension() == 2) { CGAL_precondition(i == 3); - // the triangulation is supposed to be valid, ie the facet + // the triangulation is supposed to be valid, i.e. the facet // with vertices 0 1 2 in this order is positively oriented if(! c->has_vertex(infinite_vertex(), i3)) return coplanar_side_of_bounded_circle(c->vertex(0)->point(), diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_3.h index 97459a258a1..6b5246c0d21 100644 --- a/Triangulation_3/include/CGAL/Regular_triangulation_3.h +++ b/Triangulation_3/include/CGAL/Regular_triangulation_3.h @@ -2148,7 +2148,7 @@ side_of_power_circle(Cell_handle c, int i, const Weighted_point& p, if(dimension() == 2) { CGAL_precondition(i == 3); - // the triangulation is supposed to be valid, ie the facet + // the triangulation is supposed to be valid, i.e. the facet // with vertices 0 1 2 in this order is positively oriented if(! c->has_vertex(infinite_vertex(), i3)) return Bounded_side(side_of_oriented_power_circle(c->vertex(0)->point(), diff --git a/Weights/include/CGAL/Weights/tangent_weights.h b/Weights/include/CGAL/Weights/tangent_weights.h index 7788a961218..84c9587cac4 100644 --- a/Weights/include/CGAL/Weights/tangent_weights.h +++ b/Weights/include/CGAL/Weights/tangent_weights.h @@ -401,7 +401,7 @@ public: return FT(0); FT weight = FT(0); - if (is_border_edge(he, m_pmesh)) // ie, opp(he, pmesh) is a border halfedge + if (is_border_edge(he, m_pmesh)) // i.e., opp(he, pmesh) is a border halfedge { const halfedge_descriptor h1 = next(he, m_pmesh);