diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h index 6230d15e4c7..08c5e3efae8 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h @@ -10,7 +10,7 @@ of both types `CGAL::Line_arc_2` or `CGAL::Circular_arc_2`. -It uses the boost::variant. +It uses the boost::variant. \cgalModels `ArrangementTraits_2` diff --git a/BGL/doc/BGL/graph_traits.txt b/BGL/doc/BGL/graph_traits.txt index bbc9deabdd9..b16313ed534 100644 --- a/BGL/doc/BGL/graph_traits.txt +++ b/BGL/doc/BGL/graph_traits.txt @@ -4,7 +4,7 @@ \ingroup PkgBGLRef The \sc{Bgl} defines the class template -`boost::graph_traits` +`boost::graph_traits` as a uniform interface to the properties and types of %graph types. We provide specializations of this class template for several \cgal data structures. @@ -162,7 +162,7 @@ with the default property map of \sc{Bgl} algorithms (obtained with `get(t, boost::edge_weight)`) is the length of the edge, the edge weight is not well defined for infinite edges. For algorithms that make use of the edge weight, the user must therefore -define a `boost::filtered_graph` or pass a property map to the +define a `boost::filtered_graph` or pass a property map to the algorithm that returns "infinity" for infinite edges. | Member | Value | Description | diff --git a/BGL/include/CGAL/boost/graph/dijkstra_shortest_paths.hpp b/BGL/include/CGAL/boost/graph/dijkstra_shortest_paths.hpp index 0ae2eef517d..90a72cd0c00 100644 --- a/BGL/include/CGAL/boost/graph/dijkstra_shortest_paths.hpp +++ b/BGL/include/CGAL/boost/graph/dijkstra_shortest_paths.hpp @@ -10,7 +10,7 @@ // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at -// http://www.boost.org/LICENSE_1_0.txt) +// https://www.boost.org/LICENSE_1_0.txt) //======================================================================= // // $URL$ diff --git a/BGL/include/CGAL/boost/graph/named_function_params.h b/BGL/include/CGAL/boost/graph/named_function_params.h index 205269a856d..9ec2365d134 100644 --- a/BGL/include/CGAL/boost/graph/named_function_params.h +++ b/BGL/include/CGAL/boost/graph/named_function_params.h @@ -6,7 +6,7 @@ // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at -// http://www.boost.org/LICENSE_1_0.txt) +// https://www.boost.org/LICENSE_1_0.txt) //======================================================================= // Copyright (c) 2007 GeometryFactory (France). All rights reserved. // diff --git a/BGL/include/CGAL/boost/graph/named_params_helper.h b/BGL/include/CGAL/boost/graph/named_params_helper.h index e585269eba0..90e8bdc08cd 100644 --- a/BGL/include/CGAL/boost/graph/named_params_helper.h +++ b/BGL/include/CGAL/boost/graph/named_params_helper.h @@ -6,7 +6,7 @@ // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at -// http://www.boost.org/LICENSE_1_0.txt) +// https://www.boost.org/LICENSE_1_0.txt) //======================================================================= // Copyright (c) 2007-2015 GeometryFactory (France). All rights reserved. // diff --git a/CGAL_ipelets/doc/CGAL_ipelets/CGAL/CGAL_Ipelet_base.h b/CGAL_ipelets/doc/CGAL_ipelets/CGAL/CGAL_Ipelet_base.h index 5152f1a50a2..bc587a1bf3a 100644 --- a/CGAL_ipelets/doc/CGAL_ipelets/CGAL/CGAL_Ipelet_base.h +++ b/CGAL_ipelets/doc/CGAL_ipelets/CGAL/CGAL_Ipelet_base.h @@ -198,7 +198,7 @@ The returned output iterator will accept assignments from objects of types `Polygon_2` or `Segment_2` or `Point_2`, it decomposes them in objects of type `Point_2` and assigns them to `it`. For more details on the returned output iterator refer to the Boost library -documentation. +documentation. */ template @@ -211,7 +211,7 @@ The returned output iterator will accept assignments from objects of types `Polygon_2` or `Segment_2`, it decomposes them in objects of type `Segment_2` and assigns them to `it`. For more details on the returned output iterator refer to the Boost library -documentation. +documentation. */ template diff --git a/Circulator/doc/Circulator/Concepts/ConstRange.h b/Circulator/doc/Circulator/Concepts/ConstRange.h index 661c257aa3d..e25c0ad2912 100644 --- a/Circulator/doc/Circulator/Concepts/ConstRange.h +++ b/Circulator/doc/Circulator/Concepts/ConstRange.h @@ -8,7 +8,7 @@ A constant iterator range. Refer to the `Range` concept for more details. \cgalRefines Boost's Range concept \cgalHasModel STL containers -\cgalHasModel `boost::iterator_range` +\cgalHasModel `boost::iterator_range` \sa `Range` diff --git a/Circulator/doc/Circulator/Concepts/Range.h b/Circulator/doc/Circulator/Concepts/Range.h index 7b60925b9cb..7e4ac32aa9f 100644 --- a/Circulator/doc/Circulator/Concepts/Range.h +++ b/Circulator/doc/Circulator/Concepts/Range.h @@ -22,7 +22,7 @@ documentation of any model of these concepts. For example, in the case of a vect and its value type is `Point`. Boost also offers the -Boost.Range library +Boost.Range library which provides good support for ranges. Finally, let us note that ranges, in general (especially in template context) diff --git a/Classification/doc/Classification/Classification.txt b/Classification/doc/Classification/Classification.txt index 6e7ed342f7d..fdb296567dc 100644 --- a/Classification/doc/Classification/Classification.txt +++ b/Classification/doc/Classification/Classification.txt @@ -9,8 +9,8 @@ namespace CGAL { This component implements the algorithm described in \cgalCite{cgal:lm-clscm-12} (section 2), generalized to handle different types of data, multiple features and multiple labels. It classifies a data set into a user-defined set of labels, such as _ground_, _vegetation_ and _buildings_. A flexible API is provided so that users can classify any type of data which they can index and for which they can compute relevant features, compute their own local features on the input data set and define their own labels. \note This component requires C++11 and depends on the Boost libraries -[Serialization](http://www.boost.org/libs/serialization) and -[IO Streams](http://www.boost.org/libs/iostreams) (compiled with the GZIP dependency). +[Serialization](https://www.boost.org/libs/serialization) and +[IO Streams](https://www.boost.org/libs/iostreams) (compiled with the GZIP dependency). \section Classification_Organization Package Organization diff --git a/Classification/doc/Classification/PackageDescription.txt b/Classification/doc/Classification/PackageDescription.txt index d82ffd8b503..3d78a28993a 100644 --- a/Classification/doc/Classification/PackageDescription.txt +++ b/Classification/doc/Classification/PackageDescription.txt @@ -77,8 +77,8 @@ Data structures specialized to classify clusters. \cgalPkgShortInfoBegin \cgalPkgSince{4.12} -\cgalPkgDependsOn{\ref PkgSolverInterface, \ref PkgSpatialSearchingD, [Boost Serialization](http://www.boost.org/libs/serialization) and -[Boost IO Streams](http://www.boost.org/libs/iostreams)} +\cgalPkgDependsOn{\ref PkgSolverInterface, \ref PkgSpatialSearchingD, [Boost Serialization](https://www.boost.org/libs/serialization) and +[Boost IO Streams](https://www.boost.org/libs/iostreams)} \cgalPkgBib{cgal:lm-clscm-12} \cgalPkgLicense{\ref licensesGPL "GPL"} \cgalPkgDemo{Operations on Polyhedra,polyhedron_3.zip} diff --git a/Cone_spanners_2/include/CGAL/Construct_theta_graph_2.h b/Cone_spanners_2/include/CGAL/Construct_theta_graph_2.h index 8bca1174f6a..fa220690234 100644 --- a/Cone_spanners_2/include/CGAL/Construct_theta_graph_2.h +++ b/Cone_spanners_2/include/CGAL/Construct_theta_graph_2.h @@ -54,7 +54,7 @@ namespace CGAL { or `CGAL::Exact_predicates_inexact_constructions_kernel`. \tparam Graph_ The graph type to store the constructed cone based spanner. - It must be `boost::adjacency_list` + It must be `boost::adjacency_list` with `Traits_::Point_2` as `VertexProperties`. */ template diff --git a/Cone_spanners_2/include/CGAL/Construct_yao_graph_2.h b/Cone_spanners_2/include/CGAL/Construct_yao_graph_2.h index 8efbc4d921a..60e3e93d66f 100644 --- a/Cone_spanners_2/include/CGAL/Construct_yao_graph_2.h +++ b/Cone_spanners_2/include/CGAL/Construct_yao_graph_2.h @@ -51,7 +51,7 @@ namespace CGAL { or `CGAL::Exact_predicates_inexact_constructions_kernel`. \tparam Graph_ The graph type to store the constructed cone based spanner. - It must be `boost::adjacency_list` + It must be `boost::adjacency_list` with `Traits_::Point_2` as `VertexProperties` */ template diff --git a/Documentation/doc/Documentation/Developer_manual/Chapter_checks.txt b/Documentation/doc/Documentation/Developer_manual/Chapter_checks.txt index 882f2208078..8186f1bbce9 100644 --- a/Documentation/doc/Documentation/Developer_manual/Chapter_checks.txt +++ b/Documentation/doc/Documentation/Developer_manual/Chapter_checks.txt @@ -240,7 +240,7 @@ target exception safety, as much as possible. Good references on exception safety are: Appendix E of \cgalCite{cgal:s-cpl-97} (also available at http://www.research.att.com/~bs/3rd_safe0.html), and \cgalCite{cgal:a-esgc-98} (also available at -http://www.boost.org/more/generic_exception_safety.html). +https://www.boost.org/more/generic_exception_safety.html). Any destructor which might throw an exception, including a destructor which uses the `CGAL_destructor_assertion` macro, should be marked with the `CGAL_NOEXCEPT(false)` macro. This macro provides future compatibility with diff --git a/Documentation/doc/Documentation/Developer_manual/Chapter_code_format.txt b/Documentation/doc/Documentation/Developer_manual/Chapter_code_format.txt index fab0b433239..8a8cc26b9ef 100644 --- a/Documentation/doc/Documentation/Developer_manual/Chapter_code_format.txt +++ b/Documentation/doc/Documentation/Developer_manual/Chapter_code_format.txt @@ -259,7 +259,7 @@ The first list of items are meant as rules, i.e., you should follow them. #endif // CGAL_THIS_IS_AN_EXAMPLE_H \endcode - Support the - result_of + result_of protocol whenever your functors have more than one return type otherwise provide a `result_type` member typedef. An example for this is a C++03 style `identity` functor: diff --git a/Documentation/doc/Documentation/Installation.txt b/Documentation/doc/Documentation/Installation.txt index ee55aa8dfd5..e14a78cb091 100644 --- a/Documentation/doc/Documentation/Installation.txt +++ b/Documentation/doc/Documentation/Installation.txt @@ -616,7 +616,7 @@ and designed to partition graphs and produce fill-reducing matrix orderings. \cgal offers wrappers around some of the methods of the \sc{METIS} library to allow the partitioning of graphs that are models of the concepts of the -Boost Graph Library, +Boost Graph Library, and, by extension, of surface meshes (see Section \ref BGLPartitioning of the package \ref PkgBGL). More information is available on the METIS library diff --git a/Installation/include/CGAL/auto_link/auto_link.h b/Installation/include/CGAL/auto_link/auto_link.h index 720c6692ed7..fdb428ec014 100644 --- a/Installation/include/CGAL/auto_link/auto_link.h +++ b/Installation/include/CGAL/auto_link/auto_link.h @@ -9,14 +9,14 @@ // (C) Copyright John Maddock 2003. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file -// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt) // // $URL$ // $Id$ // SPDX-License-Identifier: BSL-1.0 // /* - * LOCATION: see http://www.boost.org for most recent version. + * LOCATION: see https://www.boost.org for most recent version. * FILE auto_link.hpp * VERSION see * DESCRIPTION: Automatic library inclusion for Borland/Microsoft compilers. diff --git a/Kernel_23/doc/Kernel_23/CGAL/intersections.h b/Kernel_23/doc/Kernel_23/CGAL/intersections.h index 0678d09d11c..971d6bf1ce4 100644 --- a/Kernel_23/doc/Kernel_23/CGAL/intersections.h +++ b/Kernel_23/doc/Kernel_23/CGAL/intersections.h @@ -337,11 +337,11 @@ The result type can be obtained with `CGAL::cpp11::result_of`. It looks simpler if you use a C++ compiler which supports `auto`, but you must anyways know that the result type is a `boost::optional >`, in order to unpack the point or segment. -`boost::optional` comes in -as there might be no intersection. `boost::variant` comes in +`boost::optional` comes in +as there might be no intersection. `boost::variant` comes in as, if there is an intersection, it is either a point or a segment. -As explained in the boost manual pages for `boost::variant`, there are two ways to access the variants. The first examples uses `boost::get`. +As explained in the boost manual pages for `boost::variant`, there are two ways to access the variants. The first examples uses `boost::get`. \cgalExample{Kernel_23/intersection_get.cpp} diff --git a/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h b/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h index ff81e25cf21..62a74161040 100644 --- a/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h +++ b/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h @@ -159,8 +159,8 @@ void foo(Segment_d seg, Line_d lin) \sa `do_intersect` \sa `Kernel_d::Intersect_d` \sa CGAL_INTERSECTION_VERSION -\sa `boost::optional` -\sa `boost::variant` +\sa `boost::optional` +\sa `boost::variant` \sa `cpp11::result_of` */ diff --git a/Mesh_2/include/CGAL/internal/container_fwd_fixed.hpp b/Mesh_2/include/CGAL/internal/container_fwd_fixed.hpp index 7deb8f218bf..f35182f245d 100644 --- a/Mesh_2/include/CGAL/internal/container_fwd_fixed.hpp +++ b/Mesh_2/include/CGAL/internal/container_fwd_fixed.hpp @@ -5,7 +5,7 @@ // Copyright 2005-2008 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying -// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// file LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt) // // $URL$ // $Id$ diff --git a/Point_set_processing_3/include/CGAL/edge_aware_upsample_point_set.h b/Point_set_processing_3/include/CGAL/edge_aware_upsample_point_set.h index 13874b85ef2..b66026ac2ea 100644 --- a/Point_set_processing_3/include/CGAL/edge_aware_upsample_point_set.h +++ b/Point_set_processing_3/include/CGAL/edge_aware_upsample_point_set.h @@ -297,7 +297,7 @@ update_new_point( The type of the objects put in it is `std::pair`. Note that the user may use a - function_output_iterator + function_output_iterator to match specific needs. \param points input point range. diff --git a/Point_set_processing_3/include/CGAL/structure_point_set.h b/Point_set_processing_3/include/CGAL/structure_point_set.h index 9f23fb9ba7c..cc83bdc5409 100644 --- a/Point_set_processing_3/include/CGAL/structure_point_set.h +++ b/Point_set_processing_3/include/CGAL/structure_point_set.h @@ -1516,7 +1516,7 @@ private: \tparam OutputIterator Type of the output iterator. The type of the objects put in it is `std::pair`. Note that the user may use a - function_output_iterator + function_output_iterator to match specific needs. \param points input point range. diff --git a/Property_map/doc/Property_map/Property_map.txt b/Property_map/doc/Property_map/Property_map.txt index 57803fd1965..e29a999cf10 100644 --- a/Property_map/doc/Property_map/Property_map.txt +++ b/Property_map/doc/Property_map/Property_map.txt @@ -19,7 +19,7 @@ The data themselves may be stored in the element, or they may be stored in an external data structure, or they may be computed on the fly. This is an "implementation detail" of the particular property map.
-Property maps in the Boost manuals: http://www.boost.org/libs/property_map/doc/property_map.html +Property maps in the Boost manuals: https://www.boost.org/libs/property_map/doc/property_map.html \section Property_mapCGAL CGAL and Boost Property Maps diff --git a/STL_Extension/doc/STL_Extension/CGAL/result_of.h b/STL_Extension/doc/STL_Extension/CGAL/result_of.h index 1276da97597..d1c77c000d0 100644 --- a/STL_Extension/doc/STL_Extension/CGAL/result_of.h +++ b/STL_Extension/doc/STL_Extension/CGAL/result_of.h @@ -7,7 +7,7 @@ namespace cpp11 { When all compilers supported by %CGAL will have a Standard compliant implemention of the the \cpp11 `decltype` feature, it will become an alias to std::result_of. - \sa boost::result_of + \sa boost::result_of */ template struct result_of{ diff --git a/STL_Extension/doc/STL_Extension/Concepts/Hashable.h b/STL_Extension/doc/STL_Extension/Concepts/Hashable.h index eb8c8e47c40..2cc0858d048 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/Hashable.h +++ b/STL_Extension/doc/STL_Extension/Concepts/Hashable.h @@ -14,8 +14,8 @@ They can be disables by defining the macro `CGAL_DISABLE_HASH_OPENMESH`. \sa `CGAL::Unique_hash_map` \sa `std::unordered_set` \sa `std::unordered_map` -\sa `boost::unordered_set` -\sa `boost::unordered_map` +\sa `boost::unordered_set` +\sa `boost::unordered_map` */ diff --git a/STL_Extension/include/CGAL/internal/boost/array_binary_tree.hpp b/STL_Extension/include/CGAL/internal/boost/array_binary_tree.hpp index d016db28b46..3317ec72d74 100644 --- a/STL_Extension/include/CGAL/internal/boost/array_binary_tree.hpp +++ b/STL_Extension/include/CGAL/internal/boost/array_binary_tree.hpp @@ -5,7 +5,7 @@ // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at -// http://www.boost.org/LICENSE_1_0.txt) +// https://www.boost.org/LICENSE_1_0.txt) //======================================================================= // // $URL$ diff --git a/STL_Extension/include/CGAL/internal/boost/function_property_map.hpp b/STL_Extension/include/CGAL/internal/boost/function_property_map.hpp index f4b08dd8584..765c0bfd7ae 100644 --- a/STL_Extension/include/CGAL/internal/boost/function_property_map.hpp +++ b/STL_Extension/include/CGAL/internal/boost/function_property_map.hpp @@ -6,7 +6,7 @@ // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at -// http://www.boost.org/LICENSE_1_0.txt) +// https://www.boost.org/LICENSE_1_0.txt) //======================================================================= // // $URL$ diff --git a/STL_Extension/include/CGAL/internal/boost/mutable_heap.hpp b/STL_Extension/include/CGAL/internal/boost/mutable_heap.hpp index 81a7a3ccf6b..ffa640207e1 100644 --- a/STL_Extension/include/CGAL/internal/boost/mutable_heap.hpp +++ b/STL_Extension/include/CGAL/internal/boost/mutable_heap.hpp @@ -5,7 +5,7 @@ // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at -// http://www.boost.org/LICENSE_1_0.txt) +// https://www.boost.org/LICENSE_1_0.txt) //======================================================================= // // $URL$ diff --git a/STL_Extension/include/CGAL/internal/boost/mutable_queue.hpp b/STL_Extension/include/CGAL/internal/boost/mutable_queue.hpp index c4629659852..fed5efe2c31 100644 --- a/STL_Extension/include/CGAL/internal/boost/mutable_queue.hpp +++ b/STL_Extension/include/CGAL/internal/boost/mutable_queue.hpp @@ -5,7 +5,7 @@ // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at -// http://www.boost.org/LICENSE_1_0.txt) +// https://www.boost.org/LICENSE_1_0.txt) //======================================================================= // // $URL$ diff --git a/STL_Extension/include/CGAL/is_streamable.h b/STL_Extension/include/CGAL/is_streamable.h index 7f19e80e7f7..b19ff487c4e 100644 --- a/STL_Extension/include/CGAL/is_streamable.h +++ b/STL_Extension/include/CGAL/is_streamable.h @@ -2,7 +2,7 @@ // All rights reserved. // // Distributed under the Boost Software License, Version 1.0. (See accompanying -// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +// file LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt) // // Licensees holding a valid commercial license may use this file in // accordance with the commercial license agreement provided with the software. diff --git a/STL_Extension/include/CGAL/result_of.h b/STL_Extension/include/CGAL/result_of.h index 5d9382d5c4d..52f25c0f9e7 100644 --- a/STL_Extension/include/CGAL/result_of.h +++ b/STL_Extension/include/CGAL/result_of.h @@ -53,7 +53,7 @@ namespace cpp11{ template struct result_of { - // from boost 1.44 release note http://www.boost.org/users/history/version_1_44_0.html : + // from boost 1.44 release note https://www.boost.org/users/history/version_1_44_0.html : // New template boost::tr1_result_of that implements the TR1 ResultOf protocol even if boost::result_of uses the C++0x decltype-based implementation. #if BOOST_VERSION < 104400 typedef typename boost::result_of::type type; diff --git a/STL_Extension/include/CGAL/tags.h b/STL_Extension/include/CGAL/tags.h index 0000514404e..28dde6626ad 100644 --- a/STL_Extension/include/CGAL/tags.h +++ b/STL_Extension/include/CGAL/tags.h @@ -35,7 +35,7 @@ namespace CGAL { struct Void {}; // Boolean_tag is a model of the Boost Integral Constant concept. -// http://www.boost.org/libs/mpl/doc/refmanual/integral-constant.html +// https://www.boost.org/libs/mpl/doc/refmanual/integral-constant.html template struct Boolean_tag { typedef boost::mpl::integral_c_tag tag; diff --git a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt index 24a45166d30..41854e29a79 100644 --- a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt +++ b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt @@ -352,7 +352,7 @@ wrapper for all our defined types. The searching itself works exactly as for \cg The following four example programs illustrate how to use the classes `Search_traits_adapter` and `Distance_adapter` to store in the kd-tree objects of an arbitrary key type. Points are -accessed through a point property map. +accessed through a point property map. This enables to associate information to a point or to reduce the size of the search structure. \subsubsection Spatial_searchingUsingaPointandanInteger Using a Point and an Integer as Key Type diff --git a/Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt b/Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt index 048b7559de5..e726f56299d 100644 --- a/Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt +++ b/Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt @@ -184,7 +184,7 @@ a sequence of tuples containing a point, or a sequence of indices in a vector of points, you need another level of indirection. We provide the spatial sorting traits class adapters which are templated by another spatial sorting traits class, and a -property map. +property map. which allows to obtain a point from whatever you want to sort. The following examples illustrate the usage of these traits class adapters. diff --git a/Surface_mesh_approximation/doc/Surface_mesh_approximation/NamedParameters.txt b/Surface_mesh_approximation/doc/Surface_mesh_approximation/NamedParameters.txt index bb5dbbe22ca..f2205181f2b 100644 --- a/Surface_mesh_approximation/doc/Surface_mesh_approximation/NamedParameters.txt +++ b/Surface_mesh_approximation/doc/Surface_mesh_approximation/NamedParameters.txt @@ -5,7 +5,7 @@ \cgalHeading{How to use BGL Optional Named Parameters} The notion of named parameters was introduced in the BGL. -Details can be found from: http://www.boost.org/libs/graph/doc/bgl_named_params.html. +Details can be found from: https://www.boost.org/libs/graph/doc/bgl_named_params.html. Named parameters enable the user to specify only those parameters which are really needed, by name, making the parameter ordering not required. See also \ref bgl_namedparameters. diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Surface_mesh_simplification.txt b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Surface_mesh_simplification.txt index 4402035f5fd..9d34af2ad49 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Surface_mesh_simplification.txt +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Surface_mesh_simplification.txt @@ -214,7 +214,7 @@ returns `true` the algorithm terminates. \subsection Surface_mesh_simplificationOptionalNamed Optional Named Parameters -The notion of named parameters was also introduced in the Bgl. You can read about it in \cgalCite{cgal:sll-bgl-02} or the following site: http://www.boost.org/libs/graph/doc/bgl_named_params.html. Named parameters allow the user to specify only those parameters which are really needed, by name, making the parameter ordering unimportant. +The notion of named parameters was also introduced in the Bgl. You can read about it in \cgalCite{cgal:sll-bgl-02} or the following site: https://www.boost.org/libs/graph/doc/bgl_named_params.html. Named parameters allow the user to specify only those parameters which are really needed, by name, making the parameter ordering unimportant. Say there is a function `f()` that takes 3 parameters called `name`, `age` and `gender`, and you have variables `n,a and g` to pass as parameters to that function. Without named parameters, you would call it like this: `f(n,a,g)`, but with named parameters, you call it like this: `f(name(n).age(a).gender(g))`. diff --git a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt index e9bcdeccf88..b6c1dfa5eea 100644 --- a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt +++ b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt @@ -1294,14 +1294,14 @@ the `insert` function of the triangulation with a range of such pairs. \subsection Triangulation_2UsingtheBoostZipIterator Using the Boost Zip Iterator Information and points are in separate containers. We use -`boost::zip_iterator` to provide an iterator gathering them. +`boost::zip_iterator` to provide an iterator gathering them. \cgalExample{Triangulation_2/info_insert_with_zip_iterator_2.cpp} \subsection Triangulation_2UsingtheBoostTransformIterator Using the Boost Transform Iterator We define a functor `Auto_count` used together with -`boost::transform_iterator` to set the order of each point +`boost::transform_iterator` to set the order of each point in the range. Note that this is correct because the iterator is dereferenced only once per point during the insertion. \cgalExample{Triangulation_2/info_insert_with_transform_iterator_2.cpp} diff --git a/Triangulation_2/include/CGAL/Trivial_iterator.h b/Triangulation_2/include/CGAL/Trivial_iterator.h index 923f1e6ab9a..a079e8a55ef 100644 --- a/Triangulation_2/include/CGAL/Trivial_iterator.h +++ b/Triangulation_2/include/CGAL/Trivial_iterator.h @@ -33,7 +33,7 @@ namespace CGAL { // TODO : // - comparison operators should be global, but it causes problems... // - Have a look at Boost's concept_checking and archetypes : -// http://www.boost.org/libs/concept_check/concept_check.htm +// https://www.boost.org/libs/concept_check/concept_check.htm class Trivial_iterator_tag{}; diff --git a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt index d3c7825fbcb..51a12ffb135 100644 --- a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt +++ b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt @@ -474,14 +474,14 @@ with a range of such pairs. \subsubsection Triangulation_3UsingtheBoostZipIterator Using the Boost Zip Iterator Information and points are in separate containers. We use -`boost::zip_iterator` to provide an iterator gathering them. +`boost::zip_iterator` to provide an iterator gathering them. \cgalExample{Triangulation_3/info_insert_with_zip_iterator.cpp} \subsubsection Triangulation_3UsingtheBoostTransformIterator Using the Boost Transform Iterator We define a functor `Auto_count` used together with -`boost::transform_iterator` to set the order of each point +`boost::transform_iterator` to set the order of each point in the range. Note that this is correct because the iterator is dereferenced only once per point during the insertion. \cgalExample{Triangulation_3/info_insert_with_transform_iterator.cpp}