diff --git a/Arrangement_on_surface_2/TODO b/Arrangement_on_surface_2/TODO index 63b5d28a8c1..615c13266cf 100644 --- a/Arrangement_on_surface_2/TODO +++ b/Arrangement_on_surface_2/TODO @@ -164,7 +164,7 @@ or at least issues warnings about returning a reference to temporary variable. Can you prompt the INRIA people to fix this? (I personally think that we should remove this example from our test-suite, - but if the INRIA people believe that it's place is there, they should at + but if the INRIA people believe that its place is there, they should at least properly maintain it ...) - There is a problem with the examples that use CORE on Darwin (platform #10). Other Darwin platforms seem fine. Do we want to investigate? (perhaps it's diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h index 5e40c3544eb..a709bddd4b1 100644 --- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h +++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h @@ -407,7 +407,7 @@ is_crossover_outer_boundary(const typename Traits_2::Polygon_with_holes_2& pgn, Vertex_const_handle cver; Point_2 second_point; if (cmp_endpoints(*next) == SMALLER) { - // next curve's minimum is the joint vertex. Look if it's max exists in + // next curve's minimum is the joint vertex. Look if its max exists in // the arrangement and insert lexicographically second_point = max_functor(*next); obj = pl.locate(second_point); @@ -757,7 +757,7 @@ bool are_holes_and_boundary_pairwise_disjoint /* A valid polygon with holes is : * 1 - Has empty or closed boundary and all the holes are closed * 2 - The PWH is relatively simple polygon (holes are simple...) - * 3 - Has it's boundary oriented counterclockwise and the holes oriented + * 3 - Has its boundary oriented counterclockwise and the holes oriented * clockwise * 4 - All the segments (boundary and holes) do not cross or intersect in their * relative interior diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h index 3590abf82a7..e570031d2ee 100644 --- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h +++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h @@ -30,7 +30,7 @@ specialization of the algorithm for the case when the center coordinates and radii of the input spheres are floating-point numbers. This specialized algorithm uses floating-point arithmetic only, is very fast and especially tuned for stability and robustness. Still, -it's output may be incorrect in some (rare) cases; termination is +its output may be incorrect in some (rare) cases; termination is guaranteed. When default constructed, an instance of type diff --git a/CGAL_Core/include/CGAL/CORE/poly/Sturm.h b/CGAL_Core/include/CGAL/CORE/poly/Sturm.h index 2fe00e3706d..2ab25c00835 100644 --- a/CGAL_Core/include/CGAL/CORE/poly/Sturm.h +++ b/CGAL_Core/include/CGAL/CORE/poly/Sturm.h @@ -69,7 +69,7 @@ public: // the array seq is not used! // Hence, one must test these special cases Polynomial * seq; // array of polynomials of length "len+1" - Polynomial g;//GCD of input polynomial P and it's derivative P' + Polynomial g;//GCD of input polynomial P and its derivative P' NT cont;//Content of the square-free part of input polynomial P //Thus P = g * cont * seq[0] static const int N_STOP_ITER = 10000; // Stop IterE after this many iterations. diff --git a/Convex_hull_d/include/CGAL/Delaunay_d.h b/Convex_hull_d/include/CGAL/Delaunay_d.h index 6087d65e369..2531ec7f9e7 100644 --- a/Convex_hull_d/include/CGAL/Delaunay_d.h +++ b/Convex_hull_d/include/CGAL/Delaunay_d.h @@ -203,7 +203,7 @@ public: Simplex_iterator(Delaunay* x, Base_iterator y, Delaunay_voronoi_kind z = NEAREST) : Base_iterator(y), DT(x) /* if the facet is not nil we set the current marker to - the facet and insert all it's neighbors into the + the facet and insert all its neighbors into the candidates stack */ { CGAL_assertion(base() != Base_iterator()); tf = (z == NEAREST ? lower_hull : upper_hull); @@ -262,7 +262,7 @@ public: Simplex_const_iterator(const Delaunay* x, Base_iterator y, Delaunay_voronoi_kind z = NEAREST) : Base_iterator(y), DT(x) /* if the facet is not nil we set the current marker to - the facet and insert all it's neighbors into the + the facet and insert all its neighbors into the candidates stack */ { CGAL_assertion(base() != Base_iterator()); tf = (z == NEAREST ? lower_hull : upper_hull); diff --git a/Documentation/doc/resources/1.10.0/hacks.js b/Documentation/doc/resources/1.10.0/hacks.js index a290b02cee8..614428d1bdf 100644 --- a/Documentation/doc/resources/1.10.0/hacks.js +++ b/Documentation/doc/resources/1.10.0/hacks.js @@ -98,14 +98,14 @@ $(document).ready(function() { if(window.location.href.includes("doc.cgal.org")){ var url='https://doc.cgal.org/latest/Manual/menu_version.js'; var script = document.createElement("script"); // Make a script DOM node - script.src = url; // Set it's src to the provided URL + script.src = url; // Set its src to the provided URL document.head.appendChild(script); } else { var url='../Manual/menu_version.js'; var script = document.createElement("script"); // Make a script DOM node - script.src = url; // Set it's src to the provided URL + script.src = url; // Set its src to the provided URL document.head.appendChild(script); } })(); diff --git a/Documentation/doc/resources/1.8.13/hacks.js b/Documentation/doc/resources/1.8.13/hacks.js index 26d9ae47435..9c96bcec48b 100644 --- a/Documentation/doc/resources/1.8.13/hacks.js +++ b/Documentation/doc/resources/1.8.13/hacks.js @@ -98,14 +98,14 @@ $(document).ready(function() { if(window.location.href.includes("doc.cgal.org")){ var url='https://doc.cgal.org/latest/Manual/menu_version.js'; var script = document.createElement("script"); // Make a script DOM node - script.src = url; // Set it's src to the provided URL + script.src = url; // Set its src to the provided URL document.head.appendChild(script); } else { var url='../Manual/menu_version.js'; var script = document.createElement("script"); // Make a script DOM node - script.src = url; // Set it's src to the provided URL + script.src = url; // Set its src to the provided URL document.head.appendChild(script); } })(); diff --git a/Documentation/doc/resources/1.9.6/hacks.js b/Documentation/doc/resources/1.9.6/hacks.js index 26d9ae47435..9c96bcec48b 100644 --- a/Documentation/doc/resources/1.9.6/hacks.js +++ b/Documentation/doc/resources/1.9.6/hacks.js @@ -98,14 +98,14 @@ $(document).ready(function() { if(window.location.href.includes("doc.cgal.org")){ var url='https://doc.cgal.org/latest/Manual/menu_version.js'; var script = document.createElement("script"); // Make a script DOM node - script.src = url; // Set it's src to the provided URL + script.src = url; // Set its src to the provided URL document.head.appendChild(script); } else { var url='../Manual/menu_version.js'; var script = document.createElement("script"); // Make a script DOM node - script.src = url; // Set it's src to the provided URL + script.src = url; // Set its src to the provided URL document.head.appendChild(script); } })(); diff --git a/Interval_skip_list/include/CGAL/Interval_skip_list.h b/Interval_skip_list/include/CGAL/Interval_skip_list.h index a445981a3f2..d2721b844ff 100644 --- a/Interval_skip_list/include/CGAL/Interval_skip_list.h +++ b/Interval_skip_list/include/CGAL/Interval_skip_list.h @@ -1111,7 +1111,7 @@ template Interval_skip_list::removeMarkers(IntervalSLnode* left, const Interval& I) { - // Remove markers for interval I, which has left as it's left + // Remove markers for interval I, which has left as its left // endpoint, following a staircase pattern. // Interval_handle res=0, tmp=0; // af: assignment not possible with std::list diff --git a/Lab/demo/Lab/Scene.cpp b/Lab/demo/Lab/Scene.cpp index c48aa8b3c07..98c4d36e868 100644 --- a/Lab/demo/Lab/Scene.cpp +++ b/Lab/demo/Lab/Scene.cpp @@ -1164,7 +1164,7 @@ bool Scene::dropMimeData(const QMimeData * /*data*/, return true; } -//todo : if a group is selected, don't treat it's children. +//todo : if a group is selected, don't treat its children. bool Scene::sort_lists(QVector >&sorted_lists, bool up) { QVector group_found; diff --git a/Three/include/CGAL/Three/Viewer_interface.h b/Three/include/CGAL/Three/Viewer_interface.h index 63d6824d613..2ce00f951b7 100644 --- a/Three/include/CGAL/Three/Viewer_interface.h +++ b/Three/include/CGAL/Three/Viewer_interface.h @@ -286,7 +286,7 @@ public: virtual QVector4D* clipBox() const =0; virtual bool isClipping() const = 0; //! A vector indicating the scaling factors to apply to the scene when displaying it. - //! It can be useful when a scene is very large along one of it's coordinates, making it hard to visualize it. + //! It can be useful when a scene is very large along one of its coordinates, making it hard to visualize it. virtual const QVector3D& scaler() const = 0; virtual void showEntireScene() = 0;