mirror of https://github.com/CGAL/cgal
http:/www.boost.org -> https://www.bost.org
This commit is contained in:
Andreas Fabri
parent
ab0544514c
commit
a472c24185
|
|
@ -10,7 +10,7 @@ of both types
|
|||
`CGAL::Line_arc_2<CircularKernel>` or
|
||||
`CGAL::Circular_arc_2<CircularKernel>`.
|
||||
|
||||
It uses the <A HREF="http://www.boost.org/doc/html/variant.html">boost::variant</A>.
|
||||
It uses the <A HREF="https://www.boost.org/doc/html/variant.html">boost::variant</A>.
|
||||
|
||||
\cgalModels `ArrangementTraits_2`
|
||||
|
||||
|
|
|
|||
|
|
@ -4,7 +4,7 @@
|
|||
\ingroup PkgBGLRef
|
||||
|
||||
The \sc{Bgl} defines the class template
|
||||
<A HREF="http://www.boost.org/libs/graph/doc/graph_traits.html">`boost::graph_traits`</A>
|
||||
<A HREF="https://www.boost.org/libs/graph/doc/graph_traits.html">`boost::graph_traits`</A>
|
||||
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 <A HREF="http://www.boost.org/libs/graph/doc/filtered_graph.html">`boost::filtered_graph`</A> or pass a property map to the
|
||||
define a <A HREF="https://www.boost.org/libs/graph/doc/filtered_graph.html">`boost::filtered_graph`</A> or pass a property map to the
|
||||
algorithm that returns "infinity" for infinite edges.
|
||||
|
||||
| Member | Value | Description |
|
||||
|
|
|
|||
|
|
@ -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$
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
//
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
//
|
||||
|
|
|
|||
|
|
@ -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
|
||||
<A HREF="http://www.boost.org/doc/libs/1_39_0/libs/iterator/doc/function_output_iterator.html">documentation</A>.
|
||||
<A HREF="https://www.boost.org/doc/libs/1_39_0/libs/iterator/doc/function_output_iterator.html">documentation</A>.
|
||||
|
||||
*/
|
||||
template<class OutputIterator>
|
||||
|
|
@ -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
|
||||
<A HREF="http://www.boost.org/doc/libs/1_39_0/libs/iterator/doc/function_output_iterator.html">documentation</A>.
|
||||
<A HREF="https://www.boost.org/doc/libs/1_39_0/libs/iterator/doc/function_output_iterator.html">documentation</A>.
|
||||
|
||||
*/
|
||||
template<class OutputIterator>
|
||||
|
|
|
|||
|
|
@ -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 <A HREF="http://www.boost.org/libs/range/doc/html/range/reference/utilities/iterator_range.html">`boost::iterator_range`</A>
|
||||
\cgalHasModel <A HREF="https://www.boost.org/libs/range/doc/html/range/reference/utilities/iterator_range.html">`boost::iterator_range`</A>
|
||||
|
||||
\sa `Range`
|
||||
|
||||
|
|
|
|||
|
|
@ -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`</I>.
|
||||
|
||||
Boost also offers the
|
||||
<A HREF="http://www.boost.org/libs/range/">Boost.Range library</A>
|
||||
<A HREF="https://www.boost.org/libs/range/">Boost.Range library</A>
|
||||
which provides good support for ranges.
|
||||
|
||||
Finally, let us note that ranges, in general (especially in template context)
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
||||
|
|
|
|||
|
|
@ -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}
|
||||
|
|
|
|||
|
|
@ -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 <A HREF="http://www.boost.org/libs/graph/doc/adjacency_list.html">`boost::adjacency_list`</A>
|
||||
It must be <A HREF="https://www.boost.org/libs/graph/doc/adjacency_list.html">`boost::adjacency_list`</A>
|
||||
with `Traits_::Point_2` as `VertexProperties`.
|
||||
*/
|
||||
template <typename Traits_, typename Graph_>
|
||||
|
|
|
|||
|
|
@ -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 <A HREF="http://www.boost.org/libs/graph/doc/adjacency_list.html">`boost::adjacency_list`</A>
|
||||
It must be <A HREF="https://www.boost.org/libs/graph/doc/adjacency_list.html">`boost::adjacency_list`</A>
|
||||
with `Traits_::Point_2` as `VertexProperties`
|
||||
*/
|
||||
template <typename Traits_, typename Graph_>
|
||||
|
|
|
|||
|
|
@ -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
|
||||
<A HREF="http://www.research.att.com/~bs/3rd_safe0.html"><TT>http://www.research.att.com/~bs/3rd_safe0.html</TT></A>),
|
||||
and \cgalCite{cgal:a-esgc-98} (also available at
|
||||
<A HREF="http://www.boost.org/more/generic_exception_safety.html"><TT>http://www.boost.org/more/generic_exception_safety.html</TT></A>).
|
||||
<A HREF="https://www.boost.org/more/generic_exception_safety.html"><TT>https://www.boost.org/more/generic_exception_safety.html</TT></A>).
|
||||
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
|
||||
|
|
|
|||
|
|
@ -259,7 +259,7 @@ The first list of items are meant as rules, <I>i.e.</I>, you should follow them.
|
|||
#endif // CGAL_THIS_IS_AN_EXAMPLE_H
|
||||
\endcode
|
||||
- Support the
|
||||
<A HREF="http://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of">result_of</A>
|
||||
<A HREF="https://www.boost.org/doc/libs/release/libs/utility/utility.htm#result_of">result_of</A>
|
||||
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:
|
||||
|
|
|
|||
|
|
@ -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
|
||||
<A HREF="http://www.boost.org/libs/graph/doc/index.html">Boost Graph Library</A>,
|
||||
<A HREF="https://www.boost.org/libs/graph/doc/index.html">Boost Graph Library</A>,
|
||||
and, by extension, of surface meshes (see Section \ref BGLPartitioning of the package \ref PkgBGL).
|
||||
|
||||
More information is available on the METIS library
|
||||
|
|
|
|||
|
|
@ -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 <boost/version.hpp>
|
||||
* DESCRIPTION: Automatic library inclusion for Borland/Microsoft compilers.
|
||||
|
|
|
|||
|
|
@ -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<boost::variant<..> >`, in order to unpack the point or segment.
|
||||
|
||||
<A HREF="http://www.boost.org/libs/optional/">`boost::optional`</A> comes in
|
||||
as there might be no intersection. <A HREF="http://www.boost.org/libs/variant/">`boost::variant`</A> comes in
|
||||
<A HREF="https://www.boost.org/libs/optional/">`boost::optional`</A> comes in
|
||||
as there might be no intersection. <A HREF="https://www.boost.org/libs/variant/">`boost::variant`</A> comes in
|
||||
as, if there is an intersection, it is either a point or a segment.
|
||||
|
||||
As explained in the boost manual pages for <A HREF="http://www.boost.org/libs/variant/">`boost::variant`</A>, there are two ways to access the variants. The first examples uses `boost::get`.
|
||||
As explained in the boost manual pages for <A HREF="https://www.boost.org/libs/variant/">`boost::variant`</A>, there are two ways to access the variants. The first examples uses `boost::get`.
|
||||
|
||||
\cgalExample{Kernel_23/intersection_get.cpp}
|
||||
|
||||
|
|
|
|||
|
|
@ -159,8 +159,8 @@ void foo(Segment_d<R> seg, Line_d<R> lin)
|
|||
\sa `do_intersect`
|
||||
\sa `Kernel_d::Intersect_d`
|
||||
\sa CGAL_INTERSECTION_VERSION
|
||||
\sa <a HREF="http://www.boost.org/doc/libs/release/libs/optional/index.html">`boost::optional`</a>
|
||||
\sa <a HREF="http://www.boost.org/doc/html/variant.html">`boost::variant`</a>
|
||||
\sa <a HREF="https://www.boost.org/doc/libs/release/libs/optional/index.html">`boost::optional`</a>
|
||||
\sa <a HREF="https://www.boost.org/doc/html/variant.html">`boost::variant`</a>
|
||||
\sa `cpp11::result_of`
|
||||
|
||||
*/
|
||||
|
|
|
|||
|
|
@ -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$
|
||||
|
|
|
|||
|
|
@ -297,7 +297,7 @@ update_new_point(
|
|||
The type of the objects put in it is
|
||||
`std::pair<geom_traits::Point_3, geom_traits::Vector_3>`.
|
||||
Note that the user may use a
|
||||
<A HREF="http://www.boost.org/libs/iterator/doc/function_output_iterator.html">function_output_iterator</A>
|
||||
<A HREF="https://www.boost.org/libs/iterator/doc/function_output_iterator.html">function_output_iterator</A>
|
||||
to match specific needs.
|
||||
|
||||
\param points input point range.
|
||||
|
|
|
|||
|
|
@ -1516,7 +1516,7 @@ private:
|
|||
\tparam OutputIterator Type of the output iterator. The type of the
|
||||
objects put in it is `std::pair<Kernel::Point_3, Kernel::Vector_3>`.
|
||||
Note that the user may use a
|
||||
<A HREF="http://www.boost.org/libs/iterator/doc/function_output_iterator.html">function_output_iterator</A>
|
||||
<A HREF="https://www.boost.org/libs/iterator/doc/function_output_iterator.html">function_output_iterator</A>
|
||||
to match specific needs.
|
||||
|
||||
\param points input point range.
|
||||
|
|
|
|||
|
|
@ -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.<BR>
|
||||
|
||||
Property maps in the Boost manuals: <A HREF="http://www.boost.org/libs/property_map/doc/property_map.html"><TT>http://www.boost.org/libs/property_map/doc/property_map.html</TT></A>
|
||||
Property maps in the Boost manuals: <A HREF="https://www.boost.org/libs/property_map/doc/property_map.html"><TT>https://www.boost.org/libs/property_map/doc/property_map.html</TT></A>
|
||||
|
||||
\section Property_mapCGAL CGAL and Boost Property Maps
|
||||
|
||||
|
|
|
|||
|
|
@ -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 <code>std::result_of</code>.
|
||||
|
||||
\sa <a href=http://www.boost.org/libs/utility/utility.htm#result_of><code>boost::result_of</code></a>
|
||||
\sa <a href=https://www.boost.org/libs/utility/utility.htm#result_of><code>boost::result_of</code></a>
|
||||
*/
|
||||
template <typename F>
|
||||
struct result_of{
|
||||
|
|
|
|||
|
|
@ -14,8 +14,8 @@ They can be disables by defining the macro `CGAL_DISABLE_HASH_OPENMESH`.
|
|||
\sa `CGAL::Unique_hash_map<Key,Mapped,Hash>`
|
||||
\sa <A HREF="http://www.cplusplus.com/reference/unordered_set/unordered_set/">`std::unordered_set`</a>
|
||||
\sa <A HREF="http://www.cplusplus.com/reference/unordered_set/unordered_map/">`std::unordered_map`</a>
|
||||
\sa <A HREF="http://www.boost.org/doc/libs/release/doc/html/boost/unordered_set.html">`boost::unordered_set`</a>
|
||||
\sa <A HREF="http://www.boost.org/doc/libs/release/doc/html/boost/unordered_map.html">`boost::unordered_map`</a>
|
||||
\sa <A HREF="https://www.boost.org/doc/libs/release/doc/html/boost/unordered_set.html">`boost::unordered_set`</a>
|
||||
\sa <A HREF="https://www.boost.org/doc/libs/release/doc/html/boost/unordered_map.html">`boost::unordered_map`</a>
|
||||
|
||||
*/
|
||||
|
||||
|
|
|
|||
|
|
@ -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$
|
||||
|
|
|
|||
|
|
@ -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$
|
||||
|
|
|
|||
|
|
@ -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$
|
||||
|
|
|
|||
|
|
@ -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$
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
|
|
|
|||
|
|
@ -53,7 +53,7 @@ namespace cpp11{
|
|||
template<typename F>
|
||||
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<F>::type type;
|
||||
|
|
|
|||
|
|
@ -35,7 +35,7 @@ namespace CGAL {
|
|||
struct Void {};
|
||||
|
||||
// Boolean_tag<bool> 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 <bool b>
|
||||
struct Boolean_tag {
|
||||
typedef boost::mpl::integral_c_tag tag;
|
||||
|
|
|
|||
|
|
@ -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<Key,PointPropertyMap,BaseTraits>` and
|
||||
`Distance_adapter<Key,PointPropertyMap,Base_distance>` to store in the kd-tree objects of an arbitrary key type. Points are
|
||||
accessed through a point <A HREF="http://www.boost.org/doc/libs/release/libs/property_map/index.html">property map</A>.
|
||||
accessed through a point <A HREF="https://www.boost.org/doc/libs/release/libs/property_map/index.html">property map</A>.
|
||||
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
|
||||
|
|
|
|||
|
|
@ -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
|
||||
<A HREF="http://www.boost.org/doc/libs/release/libs/property_map/index.html">property map</A>.
|
||||
<A HREF="https://www.boost.org/doc/libs/release/libs/property_map/index.html">property map</A>.
|
||||
which allows to obtain a point from whatever you want to sort.
|
||||
|
||||
The following examples illustrate the usage of these traits class adapters.
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
|
||||
|
|
|
|||
|
|
@ -214,7 +214,7 @@ returns `true` the algorithm terminates.
|
|||
|
||||
\subsection Surface_mesh_simplificationOptionalNamed Optional Named Parameters
|
||||
|
||||
The notion of <I>named parameters</I> was also introduced in the <span class="textsc">Bgl</span>. You can read about it in \cgalCite{cgal:sll-bgl-02} or the following site: <A HREF="http://www.boost.org/libs/graph/doc/bgl_named_params.html"><TT>http://www.boost.org/libs/graph/doc/bgl_named_params.html</TT></A>. Named parameters allow the user to specify only those parameters which are really needed, by name, making the parameter ordering unimportant.
|
||||
The notion of <I>named parameters</I> was also introduced in the <span class="textsc">Bgl</span>. You can read about it in \cgalCite{cgal:sll-bgl-02} or the following site: <A HREF="https://www.boost.org/libs/graph/doc/bgl_named_params.html"><TT>https://www.boost.org/libs/graph/doc/bgl_named_params.html</TT></A>. 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))`.
|
||||
|
||||
|
|
|
|||
|
|
@ -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
|
||||
<A HREF="http://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors">`boost::zip_iterator`</A> to provide an iterator gathering them.
|
||||
<A HREF="https://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors">`boost::zip_iterator`</A> 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
|
||||
<A HREF="http://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors">`boost::transform_iterator`</A> to set the order of each point
|
||||
<A HREF="https://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors">`boost::transform_iterator`</A> 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}
|
||||
|
|
|
|||
|
|
@ -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{};
|
||||
|
||||
|
|
|
|||
|
|
@ -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
|
||||
<A HREF="http://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors">`boost::zip_iterator`</A> to provide an iterator gathering them.
|
||||
<A HREF="https://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors">`boost::zip_iterator`</A> 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
|
||||
<A HREF="http://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors">`boost::transform_iterator`</A> to set the order of each point
|
||||
<A HREF="https://www.boost.org/libs/iterator/doc/index.html#specialized-adaptors">`boost::transform_iterator`</A> 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}
|
||||
|
|
|
|||
Loading…
Reference in New Issue