diff --git a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h index 0ac0476616e..7fb8d9cfd96 100644 --- a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h +++ b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h @@ -41,8 +41,8 @@ namespace CGAL { * of `VertexPointPMap` (using the `Kernel_traits` mechanism). * The segment type of the primitive (`Datum`) is `CGAL::Kernel_traits< boost::property_traits< VertexPointPMap >::%value_type >::%Kernel::Segment_3`. * - * \cgalModelsBare{AABBPrimitive if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`, - * AABBPrimitiveWithSharedData if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`} + * \cgalModelsBare{`AABBPrimitive` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`, + * `AABBPrimitiveWithSharedData` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`} * * \tparam HalfedgeGraph is a model of the halfedge graph concept. * as key type and a \cgal Kernel `Point_3` as value type. diff --git a/AABB_tree/include/CGAL/AABB_primitive.h b/AABB_tree/include/CGAL/AABB_primitive.h index d602a349ee0..b31cf5a74de 100644 --- a/AABB_tree/include/CGAL/AABB_primitive.h +++ b/AABB_tree/include/CGAL/AABB_primitive.h @@ -53,8 +53,8 @@ public: * The two property maps which are template parameters of the class enable to get the datum and the reference point of * the primitive from the identifier. The last template parameter controls whether the primitive class holds a copy of the datum. * - * \cgalModelsBare{AABBPrimitive if `ExternalPropertyMaps` is `CGAL::Tag_false`, - * AABBPrimitiveWithSharedData if `ExternalPropertyMaps` is `CGAL::Tag_true`} + * \cgalModelsBare{`AABBPrimitive` if `ExternalPropertyMaps` is `CGAL::Tag_false`, + * `AABBPrimitiveWithSharedData` if `ExternalPropertyMaps` is `CGAL::Tag_true`} * * \tparam ObjectPropertyMap is a model of `ReadablePropertyMap` with `Id` as * `key_type`. It must be a model of `CopyConstructible`, `DefaultConstructible`, and `CopyAssignable`. diff --git a/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h b/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h index c68ff917daa..a56096bcb19 100644 --- a/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h +++ b/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h @@ -11,7 +11,7 @@ together with a few geometric predicates and constructions on these objects. \cgalRefines{DelaunayTriangulationTraits_3} -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of the concept `Kernel`} */ class AdvancingFrontSurfaceReconstructionTraits_3 { diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h index 48c92909b80..0fbc4ea6f17 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h @@ -28,7 +28,8 @@ algebraic operations within that structure. \sa `CGAL::Field_with_kth_root_tag` \sa `CGAL::Field_with_root_of_tag` -\cgalHasModel `CGAL::Algebraic_structure_traits` +\cgalHasModelsBegin CGAL::Algebraic_structure_traits +\cgalHasModelsEnd */ diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h index 8609a9a9cbe..a53ac500cbf 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h @@ -9,16 +9,17 @@ for Cartesian kernels. \cgalRefines{Field,RealEmbeddable} -\cgalHasModel float -\cgalHasModel double -\cgalHasModel `CGAL::Gmpq` -\cgalHasModel `CGAL::Interval_nt` -\cgalHasModel `CGAL::Interval_nt_advanced` -\cgalHasModel `CGAL::Lazy_exact_nt` -\cgalHasModel `CGAL::Quotient` -\cgalHasModel `leda_rational` -\cgalHasModel `leda_bigfloat` -\cgalHasModel `leda_real` +\cgalHasModelsBegin float +\cgalHasModels double +\cgalHasModels CGAL::Gmpq +\cgalHasModels CGAL::Interval_nt +\cgalHasModels CGAL::Interval_nt_advanced +\cgalHasModels CGAL::Lazy_exact_nt +\cgalHasModels CGAL::Quotient +\cgalHasModels leda_rational +\cgalHasModels leda_bigfloat +\cgalHasModels leda_real +\cgalHasModelsEnd \sa `RingNumberType` \sa `Kernel` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h index eaa438e6c90..35d4b408a67 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h @@ -8,7 +8,8 @@ A model of `FractionTraits` is associated with a type `Type`. In case the associated type is a `Fraction`, a model of `FractionTraits` provides the relevant functionality for decomposing and re-composing as well as the numerator and denominator type. -\cgalHasModel `CGAL::Fraction_traits` +\cgalHasModelsBegin CGAL::Fraction_traits +\cgalHasModelsEnd \sa `FractionTraits_::Decompose` \sa `FractionTraits_::Compose` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h index 58d2190329a..f8f2f3f8749 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h @@ -6,9 +6,10 @@ A model of the concept `FromIntConstructible` is required to be constructible from int. -\cgalHasModel int -\cgalHasModel long -\cgalHasModel double +\cgalHasModelsBegin int +\cgalHasModels long +\cgalHasModels double +\cgalHasModelsEnd */ diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h index 379390e11e7..1cd155d7ccf 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h @@ -7,7 +7,8 @@ A model of `RealEmbeddableTraits` is associated to a number type `Type` and reflects the properties of this type with respect to the concept `RealEmbeddable`. -\cgalHasModel `CGAL::Real_embeddable_traits` +\cgalHasModelsBegin CGAL::Real_embeddable_traits +\cgalHasModelsEnd */ class RealEmbeddableTraits { diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h index a2b6c5036f0..46203068258 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h @@ -10,19 +10,19 @@ for Homogeneous kernels. \cgalRefines{IntegralDomainWithoutDivision,RealEmbeddable} -\cgalHasModel \cpp built-in number types -\cgalHasModel `CGAL::Gmpq` -\cgalHasModel `CGAL::Gmpz` -\cgalHasModel `CGAL::Interval_nt` -\cgalHasModel `CGAL::Interval_nt_advanced` -\cgalHasModel `CGAL::Lazy_exact_nt` -\cgalHasModel `CGAL::MP_Float` -\cgalHasModel `CGAL::Gmpzf` -\cgalHasModel `CGAL::Quotient` -\cgalHasModel `leda_integer` -\cgalHasModel `leda_rational` -\cgalHasModel `leda_bigfloat` -\cgalHasModel `leda_real` +\cgalHasModelsBareBegin{\cpp built-in number types} CGAL::Gmpq +\cgalHasModels CGAL::Gmpz +\cgalHasModels CGAL::Interval_nt +\cgalHasModels CGAL::Interval_nt_advanced +\cgalHasModels CGAL::Lazy_exact_nt +\cgalHasModels CGAL::MP_Float +\cgalHasModels CGAL::Gmpzf +\cgalHasModels CGAL::Quotient +\cgalHasModels leda_integer +\cgalHasModels leda_rational +\cgalHasModels leda_bigfloat +\cgalHasModels leda_real +\cgalHasModelsEnd \sa `FieldNumberType` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h index c9c2f475f8e..f9b702d436b 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h @@ -8,8 +8,9 @@ algebraic functionalities on univariate polynomials of general degree \f$ d\f$. \cgalRefines{CopyConstructible,Assignable} -\cgalHasModel `CGAL::Algebraic_kernel_rs_gmpz_d_1` -\cgalHasModel `CGAL::Algebraic_kernel_rs_gmpq_d_1` +\cgalHasModelsBegin CGAL::Algebraic_kernel_rs_gmpz_d_1 +\cgalHasModels CGAL::Algebraic_kernel_rs_gmpq_d_1 +\cgalHasModelsEnd \sa `AlgebraicKernel_d_2` diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h index 57b30f90d2f..562a6aaaa19 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h @@ -9,7 +9,8 @@ The concept `AlphaShapeFace_2` describes the requirements for the base face of a RegularTriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a regular triangulation, Periodic_2TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation} -\cgalHasModel `CGAL::Alpha_shape_face_base_2` (templated with the appropriate triangulation face base class). +\cgalHasModelsBegin CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class) +\cgalHasModelsEnd */ class AlphaShapeFace_2 { diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h index a6f1c1fca18..28ad270b744 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h @@ -9,8 +9,7 @@ class of the underlying Delaunay triangulation of a basic alpha shape. \cgalRefines{DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a Delaunay triangulation, Periodic_2DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation} -\cgalHasModel All models of `Kernel`. -\cgalHasModel Projection traits such as `CGAL::Projection_traits_xy_3`. +\cgalHasModelsBare{All models of `Kernel`,Projection traits such as `CGAL::Projection_traits_xy_3`} \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel) */ diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h index 5015af963f6..5116683d78b 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h @@ -9,7 +9,7 @@ The concept `AlphaShapeVertex_2` describes the requirements for the base vertex RegularTriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a regular triangulation, Periodic_2TriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation} -\cgalHasModel `CGAL::Alpha_shape_vertex_base_2` (templated with the appropriate triangulation vertex base class). +\cgalHasModelsBare{`CGAL::Alpha_shape_vertex_base_2` (templated with the appropriate triangulation vertex base class)} */ class AlphaShapeVertex_2 { public: diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h index 62d404c3c38..05be16ee559 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h @@ -9,8 +9,7 @@ of the underlying regular triangulation of a weighted alpha shape. \cgalRefines{RegularTriangulationTraits_2 if the underlying triangulation of the alpha shape is a regular triangulation.} -\cgalHasModel All models of `Kernel`. -\cgalHasModel Projection traits such as `CGAL::Projection_traits_xy_3`. +\cgalHasModelsBare{All models of `Kernel`,Projection traits such as `CGAL::Projection_traits_xy_3`} \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel) */ diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h index 570b419998e..de5c0aacd62 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h @@ -9,7 +9,7 @@ The concept `AlphaShapeCell_3` describes the requirements for the base cell of a RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation, Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation} -\cgalHasModel `CGAL::Alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class). +\cgalHasModelsBare{`CGAL::Alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class)} \sa `CGAL::Alpha_status` diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h index 6d9fbcbe430..4a5fe7a8bfd 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h @@ -10,7 +10,7 @@ of the underlying Delaunay triangulation of a basic alpha shape. \cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation, Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation} -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of `Kernel`} \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel) */ diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h index 6e23176c2d9..65f49014180 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h @@ -9,7 +9,7 @@ The concept `AlphaShapeVertex_3` describes the requirements for the base vertex RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation. Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation} -\cgalHasModel `CGAL::Alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class). +\cgalHasModelsBare{`CGAL::Alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class)} \sa `CGAL::Alpha_status` diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h index 1fd4060952f..7707ed14ce1 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h @@ -9,7 +9,7 @@ The concept `FixedAlphaShapeCell_3` describes the requirements for the base cell RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation, Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation} -\cgalHasModel `CGAL::Fixed_alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class). +\cgalHasModelsBare{`CGAL::Fixed_alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class)} */ class FixedAlphaShapeCell_3 { public: diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h index d6b3aa7f35f..4c63e9618fa 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h @@ -10,7 +10,7 @@ of the underlying Delaunay triangulation of a basic alpha shape with a fixed val \cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation, Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation} -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of `Kernel`} \sa CGAL::Exact_predicates_inexact_constructions_kernel (recommended kernel) */ diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h index 59d9593e5fc..7b152f16e2e 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h @@ -9,7 +9,7 @@ The concept `FixedAlphaShapeVertex_3` describes the requirements for the base ve RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation, Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation} -\cgalHasModel `CGAL::Fixed_alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class). +\cgalHasModelsBare{`CGAL::Fixed_alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class)} */ class FixedAlphaShapeVertex_3 { diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h index e84810fdc78..8b7694d5643 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h @@ -9,7 +9,7 @@ for the geometric traits class of the underlying regular triangulation of a weig \cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation, Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation} -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of `Kernel`} \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel) */ diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h index f0c11a972c7..10c8009e6c2 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h @@ -10,7 +10,7 @@ of the underlying regular triangulation of a weighted alpha shape. \cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation, Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation} -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of `Kernel`} \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel) */ diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h index 85c697f40a8..145349567d2 100644 --- a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h +++ b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h @@ -9,10 +9,11 @@ The concept `AlphaWrapOracle` defines the requirements for an Alpha Wrap Ora that answers a number of queries over the input of the algorithm. The oracle is the template parameter of the class `CGAL::Alpha_wraps_3_::Alpha_wrap_3`. -\cgalHasModel `CGAL::Alpha_wraps_3_::Point_set_oracle` -\cgalHasModel `CGAL::Alpha_wraps_3_::Segment_soup_oracle` -\cgalHasModel `CGAL::Alpha_wraps_3_::Triangle_mesh_oracle` -\cgalHasModel `CGAL::Alpha_wraps_3_::Triangle_soup_oracle` +\cgalHasModelsBegin CGAL::Alpha_wraps_3_::Point_set_oracle +\cgalHasModels CGAL::Alpha_wraps_3_::Segment_soup_oracle +\cgalHasModels CGAL::Alpha_wraps_3_::Triangle_mesh_oracle +\cgalHasModels CGAL::Alpha_wraps_3_::Triangle_soup_oracle +\cgalHasModelsEnd */ template diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h index 63428d4b889..916aa5aa3da 100644 --- a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h +++ b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h @@ -11,7 +11,7 @@ you require Kernel. Stitch_borders doesn't even have clear geometric traits requ The concept `AlphaWrapTraits_3` defines the requirements for the geometric traits class of an alpha wrap oracle. -\cgalHasModel Any 3D %kernel is a model of this traits concept. +\cgalHasModelsBare{Any 3D %kernel is a model of this traits concept} */ class AlphaWrapTraits_3 diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h index cca93a7c829..e494faa898c 100644 --- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h +++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h @@ -27,7 +27,8 @@ We only describe the additional requirements with respect to the \cgalRefines{TriangulationDataStructure_2} -\cgalHasModel `CGAL::Triangulation_data_structure_2` +\cgalHasModelsBegin CGAL::Triangulation_data_structure_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `ApolloniusGraphVertexBase_2` diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h index a2ed0353ddd..4cfc7a99223 100644 --- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h +++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h @@ -19,7 +19,8 @@ next and previous level graphs. `ApolloniusGraphHierarchyVertexBase_2` does not introduce any types in addition to those of `ApolloniusGraphVertexBase_2`. -\cgalHasModel `CGAL::Apollonius_graph_hierarchy_vertex_base_2 >` +\cgalHasModelsBegin CGAL::Apollonius_graph_hierarchy_vertex_base_2 > +\cgalHasModelsEnd \sa `ApolloniusGraphDataStructure_2` \sa `CGAL::Apollonius_graph_hierarchy_2` diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h index 5fa6db8c6e6..1517dd4fe17 100644 --- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h +++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h @@ -12,8 +12,9 @@ it provides a type `Site_2`, which must be a model of the concept constructions for sites and several function object types for the predicates. -\cgalHasModel `CGAL::Apollonius_graph_traits_2` -\cgalHasModel `CGAL::Apollonius_graph_filtered_traits_2` +\cgalHasModelsBegin CGAL::Apollonius_graph_traits_2 +\cgalHasModels CGAL::Apollonius_graph_filtered_traits_2 +\cgalHasModelsEnd \sa `CGAL::Apollonius_graph_2` \sa `CGAL::Apollonius_graph_traits_2` diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h index 201d7e9e91a..cac31092baf 100644 --- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h +++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h @@ -12,7 +12,8 @@ sites. The container stores the hidden sites related to the vertex. \cgalRefines{TriangulationVertexBase_2} -\cgalHasModel `CGAL::Apollonius_graph_vertex_base_2` +\cgalHasModelsBegin CGAL::Apollonius_graph_vertex_base_2 +\cgalHasModelsEnd \sa `ApolloniusGraphDataStructure_2` \sa `CGAL::Apollonius_graph_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h index 956aad8144f..671d83a6967 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{Functor} * - * \cgalHasModel ArrangementApproximateTraits_2::Approximate_2 + * \cgalHasModelsBegin ArrangementApproximateTraits_2::Approximate_2 + * \cgalHasModelsEnd */ class Approximate_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h index 66e4e53e898..56ec39093c7 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{Functor} * - * \cgalHasModel ArrangementXMonotoneTraits_2::Are_mergeable_2 + * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Are_mergeable_2 + * \cgalHasModelsEnd */ class AreMergeable_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h index 01f854b6426..9031f72a9bd 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableTernaryFunction} * - * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_2 + * \cgalHasModelsBegin ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_ + * \cgalHasModelsEnd */ class CompareXNearBoundary_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h index 3a31719bb75..45fd98fa2d6 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h @@ -5,9 +5,10 @@ namespace ArrTraits { * * \cgalRefines{AdaptableFunctor} * - * \cgalHasModel ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2 - * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2 - * \cgalHasModel ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2 + * \cgalHasModelsBegin ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2 + * \cgalHasModels ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2 + * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2 + * \cgalHasModelsEnd */ class CompareXOnBoundaryOfCurveEnd_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h index 4339c3f369d..b02a736b31d 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h @@ -5,9 +5,10 @@ namespace ArrTraits { * * \cgalRefines{AdaptableFunctor} * - * \cgalHasModel ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2 - * \cgalHasModel ArrangementClosedTopTraits_2::Compare_x_on_boundary_2 - * \cgalHasModel ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2 + * \cgalHasModelsBegin ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2 + * \cgalHasModels ArrangementClosedTopTraits_2::Compare_x_on_boundary_2 + * \cgalHasModels ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2 + * \cgalHasModelsEnd */ class CompareXOnBoundary_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h index 413311319d6..fe5d8a4d505 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h @@ -4,7 +4,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableBinaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Compare_x_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_x_2 + * \cgalHasModelsEnd */ class CompareX_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h index a485ec1a623..f571e844bdb 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableBinaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Compare_xy_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_xy_2 + * \cgalHasModelsEnd */ class CompareXy_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h index 5f50c695cea..eeb40906146 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableTernaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_left_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_left_2 + * \cgalHasModelsEnd */ class CompareYAtXLeft_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h index 670752239a7..1308a75c5bd 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableTernaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_right_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_right_2 + * \cgalHasModelsEnd */ class CompareYAtXRight_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h index 53bfaa49591..e1e0d671441 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableBinaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_2 + * \cgalHasModelsEnd */ class CompareYAtX_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h index f4bc83bd1a9..df0c66fae01 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableTernaryFunction} * - * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2 + * \cgalHasModelsBegin ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2 + * \cgalHasModelsEnd */ class CompareYNearBoundary_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h index 117023bc832..8f5c89d89fe 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h @@ -5,10 +5,11 @@ namespace ArrTraits { * * \cgalRefines{AdaptableBinaryFunction} * - * \cgalHasModel ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2 - * \cgalHasModel ArrangementClosedRightTraits_2::Compare_y_on_boundary_2 - * \cgalHasModel ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2 - * \cgalHasModel ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2 + * \cgalHasModelsBegin ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2 + * \cgalHasModels ArrangementClosedRightTraits_2::Compare_y_on_boundary_2 + * \cgalHasModels ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2 + * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2 + * \cgalHasModelsEnd */ class CompareYOnBoundary_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h index 72620babd22..d6a0c5b1208 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{Functor} * - * \cgalHasModel ArrangementConstructCurveTraits_2::Construct_curve_2 + * \cgalHasModelsBegin ArrangementConstructCurveTraits_2::Construct_curve_2 + * \cgalHasModelsEnd */ class ConstructCurve_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h index e5c4146c9fa..e94c601aa7a 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableUnaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Construct_max_vertex_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Construct_max_vertex_2 + * \cgalHasModelsEnd */ class ConstructMaxVertex_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h index 472c793d9f4..00a000f41ce 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableUnaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Construct_min_vertex_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Construct_min_vertex_2 + * \cgalHasModelsEnd */ class ConstructMinVertex_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h index 6fc6381803a..d25d94e4371 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{Functor} * - * \cgalHasModel ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2 + * \cgalHasModelsBegin ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2 + * \cgalHasModelsEnd */ class ConstructXMonotoneCurve_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h index d923f9b27db..3994e674cfb 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h @@ -6,7 +6,8 @@ namespace ArrTraits { * represents a general planar curve. * * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - * \cgalHasModel ArrangementTraits_2::Curve_2 + * \cgalHasModelsBegin ArrangementTraits_2::Curve_2 + * \cgalHasModelsEnd */ class Curve_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h index 41cf7e2f6c6..71c6da87afc 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableBinaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Equal_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Equal_2 + * \cgalHasModelsEnd */ class Equal_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h index 5e11e857548..7a6d7e30739 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{Functor} * - * \cgalHasModel ArrangementXMonotoneTraits_2::Intersect_2 + * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Intersect_2 + * \cgalHasModelsEnd */ class Intersect_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h index 47bba6ea744..f2850203499 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableUnaryFunction} * - * \cgalHasModel ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2 + * \cgalHasModelsBegin ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2 + * \cgalHasModelsEnd */ class IsOnXIdentification_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h index d9a69236ee8..e07b550923f 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableUnaryFunction} * - * \cgalHasModel ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2 + * \cgalHasModelsBegin ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2 + * \cgalHasModelsEnd */ class IsOnYIdentification_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h index 1831b790c56..e9bbf29d0c8 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{AdaptableUnaryFunction} * - * \cgalHasModel ArrangementBasicTraits_2::Is_vertical_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Is_vertical_2 + * \cgalHasModelsEnd */ class IsVertical_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h index db0df3c8cc8..46d0e1b5bae 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{Functor} * - * \cgalHasModel ArrangementTraits_2::Make_x_monotone_2 + * \cgalHasModelsBegin ArrangementTraits_2::Make_x_monotone_2 + * \cgalHasModelsEnd */ class MakeXMonotone_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h index 8e61d8c7500..17e8573bea2 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h @@ -5,7 +5,8 @@ namespace ArrTraits { * * \cgalRefines{Functor} * - * \cgalHasModel ArrangementXMonotoneTraits_2::Merge_2 + * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Merge_2 + * \cgalHasModelsEnd */ class Merge_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h index a37db7c40f6..4e6a66ede1b 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h @@ -5,9 +5,10 @@ namespace ArrTraits { * * \cgalRefines{AdaptableBinaryFunction} * - * \cgalHasModel ArrangementVerticalSideTraits_2::Parameter_space_in_x_2 - * \cgalHasModel ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2 - * \cgalHasModel ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2 + * \cgalHasModelsBegin ArrangementVerticalSideTraits_2::Parameter_space_in_x_2 + * \cgalHasModels ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2 + * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2 + * \cgalHasModelsEnd */ class ParameterSpaceInX_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h index 0844ee649a4..e443f0498da 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h @@ -5,9 +5,10 @@ namespace ArrTraits { * * \cgalRefines{AdaptableBinaryFunction} * - * \cgalHasModel ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2 - * \cgalHasModel ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2 - * \cgalHasModel ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2 + * \cgalHasModelsBegin ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2 + * \cgalHasModels ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2 + * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2 + * \cgalHasModelsEnd */ class ParameterSpaceInY_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h index 78273b88947..182f0a059ba 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h @@ -7,7 +7,8 @@ namespace ArrTraits { * * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * - * \cgalHasModel ArrangementBasicTraits_2::Point_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::Point_2 + * \cgalHasModelsEnd */ class Point_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h index 45210b92d0c..ff6bcb382cb 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h @@ -4,7 +4,8 @@ namespace ArrTraits { * * \cgalRefines{Functor} * - * \cgalHasModel ArrangementXMonotoneTraits_2::Split_2 + * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Split_2 + * \cgalHasModelsEnd */ class Split_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h index 6b23acac29d..f74e74bf150 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h @@ -6,7 +6,8 @@ namespace ArrTraits { * * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * - * \cgalHasModel ArrangementBasicTraits_2::X_monotone_curve_2 + * \cgalHasModelsBegin ArrangementBasicTraits_2::X_monotone_curve_2 + * \cgalHasModelsEnd */ class XMonotoneCurve_2 { public: diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h index b92f249431b..b4720036574 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h @@ -8,14 +8,15 @@ point. \cgalRefines{ArrangementBasicTraits_2} -\cgalHasModel `CGAL::Arr_conic_traits_2` -\cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` -\cgalHasModel `CGAL::Arr_linear_traits_2` -\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` -\cgalHasModel `CGAL::Arr_segment_traits_2` -\cgalHasModel `CGAL::Arr_polycurve_traits_2` -\cgalHasModel `CGAL::Arr_polyline_traits_2` -\cgalHasModel `CGAL::Arr_rational_function_traits_2` +\cgalHasModelsBegin CGAL::Arr_conic_traits_2 +\cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2 +\cgalHasModels CGAL::Arr_linear_traits_2 +\cgalHasModels CGAL::Arr_non_caching_segment_traits_2 +\cgalHasModels CGAL::Arr_segment_traits_2 +\cgalHasModels CGAL::Arr_polycurve_traits_2 +\cgalHasModels CGAL::Arr_polyline_traits_2 +\cgalHasModels CGAL::Arr_rational_function_traits_2 +\cgalHasModelsEnd \sa `ArrangementConstructXMonotoneCurveTraits_2`, `ArrangementXMonotoneTraits_2`, and diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h index 750182554c3..3e8c6073572 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h @@ -9,7 +9,8 @@ * represent the arrangement cells (i.e., vertices, edges, and facets) and the * incident relations between them. * - * \cgalHasModel `CGAL::Arr_spherical_topology_traits_2` + * \cgalHasModelsBegin CGAL::Arr_spherical_topology_traits_2 + * \cgalHasModelsEnd */ class ArrangementBasicTopologyTraits { diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h index 4b8cbbbf7c2..e521ef28b06 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h @@ -27,21 +27,22 @@ * * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * - * \cgalHasModel `CGAL::Arr_segment_traits_2` - * \cgalHasModel `CGAL::Arr_non_caching_segment_basic_traits_2` - * \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` - * \cgalHasModel `CGAL::Arr_linear_traits_2` - * \cgalHasModel `CGAL::Arr_polyline_traits_2` - * \cgalHasModel `CGAL::Arr_circle_segment_traits_2` - * \cgalHasModel `CGAL::Arr_line_arc_traits_2` - * \cgalHasModel `CGAL::Arr_circular_arc_traits_2` - * \cgalHasModel `CGAL::Arr_circular_line_arc_traits_2` - * \cgalHasModel `CGAL::Arr_conic_traits_2` - * \cgalHasModel `CGAL::Arr_rational_function_traits_2` - * \cgalHasModel `CGAL::Arr_Bezier_curve_traits_2` - * \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2` - * \cgalHasModel `CGAL::Arr_curve_data_traits_2` - * \cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2` + * \cgalHasModelsBegin CGAL::Arr_segment_traits_2 + * \cgalHasModels CGAL::Arr_non_caching_segment_basic_traits_2 + * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2 + * \cgalHasModels CGAL::Arr_linear_traits_2 + * \cgalHasModels CGAL::Arr_polyline_traits_2 + * \cgalHasModels CGAL::Arr_circle_segment_traits_2 + * \cgalHasModels CGAL::Arr_line_arc_traits_2 + * \cgalHasModels CGAL::Arr_circular_arc_traits_2 + * \cgalHasModels CGAL::Arr_circular_line_arc_traits_2 + * \cgalHasModels CGAL::Arr_conic_traits_2 + * \cgalHasModels CGAL::Arr_rational_function_traits_2 + * \cgalHasModels CGAL::Arr_Bezier_curve_traits_2 + * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2 + * \cgalHasModels CGAL::Arr_curve_data_traits_2 + * \cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2 + * \cgalHasModelsEnd */ class ArrangementBasicTraits_2 { diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h index afc3942cba8..176810a0793 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h @@ -7,13 +7,14 @@ * * \cgalRefines{ArrangementTraits_2} * - * \cgalHasModel `CGAL::Arr_conic_traits_2` - * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` - * \cgalHasModel `CGAL::Arr_linear_traits_2` - * \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` - * \cgalHasModel `CGAL::Arr_segment_traits_2` - * \cgalHasModel `CGAL::Arr_polyline_traits_2` - * \cgalHasModel `CGAL::Arr_rational_function_traits_2` + * \cgalHasModelsBegin CGAL::Arr_conic_traits_2 + * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2 + * \cgalHasModels CGAL::Arr_linear_traits_2 + * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2 + * \cgalHasModels CGAL::Arr_segment_traits_2 + * \cgalHasModels CGAL::Arr_polyline_traits_2 + * \cgalHasModels CGAL::Arr_rational_function_traits_2 + * \cgalHasModelsEnd * * \sa `ArrangementConstructXMonotoneCurveTraits_2`, and * `ArrangementTraits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h index 394f98f5a3b..99ca431cd46 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h @@ -7,13 +7,14 @@ * * \cgalRefines{ArrangementBasicTraits_2} * - * \cgalHasModel `CGAL::Arr_conic_traits_2` - * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` - * \cgalHasModel `CGAL::Arr_linear_traits_2` - * \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` - * \cgalHasModel `CGAL::Arr_segment_traits_2` - * \cgalHasModel `CGAL::Arr_polyline_traits_2` - * \cgalHasModel `CGAL::Arr_rational_function_traits_2` + * \cgalHasModelsBegin CGAL::Arr_conic_traits_2 + * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2 + * \cgalHasModels CGAL::Arr_linear_traits_2 + * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2 + * \cgalHasModels CGAL::Arr_segment_traits_2 + * \cgalHasModels CGAL::Arr_polyline_traits_2 + * \cgalHasModels CGAL::Arr_rational_function_traits_2 + * \cgalHasModelsEnd * * \sa `ArrangementApproximateTraits_2`, * `ArrangementXMonotoneTraits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h index f685263e31e..81984c4699e 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h @@ -14,10 +14,11 @@ * `ArrangementDcelHalfedge`, `ArrangementDcelFace`, `ArrangementDcelOuterCcb`, * `ArrangementDcelInnerCcb`, and `ArrangementDcelIsolatedVertex` respectively.) * - * \cgalHasModel `CGAL::Arr_dcel_base` - * \cgalHasModel `CGAL::Arr_default_dcel` - * \cgalHasModel `CGAL::Arr_face_extended_dcel` - * \cgalHasModel `CGAL::Arr_extended_dcel` + * \cgalHasModelsBegin CGAL::Arr_dcel_base + * \cgalHasModels CGAL::Arr_default_dcel + * \cgalHasModels CGAL::Arr_face_extended_dcel + * \cgalHasModels CGAL::Arr_extended_dcel + * \cgalHasModelsEnd * * \sa `ArrangementDcelVertex` * \sa `ArrangementDcelHalfedge` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h index 88e4fff19f0..d4f263cf01f 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h @@ -10,9 +10,10 @@ Instantiate a dcel class with many different possible types without ad-hoc limit \cgalRefines{ArrangementDcel} -\cgalHasModel `CGAL::Arr_default_dcel` -\cgalHasModel `CGAL::Arr_face_extended_dcel` -\cgalHasModel `CGAL::Arr_extended_dcel` +\cgalHasModelsBegin CGAL::Arr_default_dcel +\cgalHasModels CGAL::Arr_face_extended_dcel +\cgalHasModels CGAL::Arr_extended_dcel +\cgalHasModelsEnd */ diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h index e659a3be297..60e28710d01 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h @@ -11,10 +11,11 @@ * * \cgalRefines{ArrangementBasicTraits_2} * - * \cgalHasModel `CGAL::Arr_linear_traits_2` - * \cgalHasModel `CGAL::Arr_rational_function_traits_2` - * \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2` - * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` + * \cgalHasModelsBegin CGAL::Arr_linear_traits_2 + * \cgalHasModels CGAL::Arr_rational_function_traits_2 + * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2 + * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2 + * \cgalHasModelsEnd * * \sa `ArrangementVerticalSideTraits_2` */ diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h index 09e87373c1e..53469ded7bd 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h @@ -5,9 +5,10 @@ * functions that enable reading an arrangement from an input stream using a * specific format. * - * \cgalHasModel `CGAL::Arr_text_formatter` - * \cgalHasModel `CGAL::Arr_face_extended_text_formatter` - * \cgalHasModel `CGAL::Arr_extended_dcel_text_formatter` + * \cgalHasModelsBegin CGAL::Arr_text_formatter + * \cgalHasModels CGAL::Arr_face_extended_text_formatter + * \cgalHasModels CGAL::Arr_extended_dcel_text_formatter + * \cgalHasModelsEnd * */ diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h index cc66b479fbe..b014807650a 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h @@ -11,14 +11,15 @@ * * \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2} * - * \cgalHasModel `CGAL::Arr_conic_traits_2` - * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` - * \cgalHasModel `CGAL::Arr_linear_traits_2` - * \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` - * \cgalHasModel `CGAL::Arr_segment_traits_2` - * \cgalHasModel `CGAL::Arr_polycurve_traits_2` - * \cgalHasModel `CGAL::Arr_polyline_traits_2` - * \cgalHasModel `CGAL::Arr_rational_function_traits_2` + * \cgalHasModelsBegin CGAL::Arr_conic_traits_2 + * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2 + * \cgalHasModels CGAL::Arr_linear_traits_2 + * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2 + * \cgalHasModels CGAL::Arr_segment_traits_2 + * \cgalHasModels CGAL::Arr_polycurve_traits_2 + * \cgalHasModels CGAL::Arr_polyline_traits_2 + * \cgalHasModels CGAL::Arr_rational_function_traits_2 + * \cgalHasModelsEnd * * \sa `ArrangementXMonotoneTraits_2` and * `ArrangementTraits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h index 8190767e71c..16f3ffa5195 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h @@ -39,11 +39,12 @@ * * \cgalRefines{ArrangementBasicTraits_2} * - * \cgalHasModel `CGAL::Arr_linear_traits_2` - * \cgalHasModel `CGAL::Arr_rational_function_traits_2` - * \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2` - * \cgalHasModel `CGAL::Arr_curve_data_traits_2` - * \cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2` + * \cgalHasModelsBegin CGAL::Arr_linear_traits_2 + * \cgalHasModels CGAL::Arr_rational_function_traits_2 + * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2 + * \cgalHasModels CGAL::Arr_curve_data_traits_2 + * \cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2 + * \cgalHasModelsEnd * * \sa `ArrangementBasicTraits_2` * \sa `ArrangementXMonotoneTraits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h index 0418ee873b5..bee9cba7720 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h @@ -6,9 +6,10 @@ A model for the `ArrangementOutputFormatter` concept supports a set of functions that enable writing an arrangement to an output stream using a specific format. -\cgalHasModel `CGAL::Arr_text_formatter` -\cgalHasModel `CGAL::Arr_face_extended_text_formatter` -\cgalHasModel `CGAL::Arr_extended_dcel_text_formatter` +\cgalHasModelsBegin CGAL::Arr_text_formatter +\cgalHasModels CGAL::Arr_face_extended_text_formatter +\cgalHasModels CGAL::Arr_extended_dcel_text_formatter +\cgalHasModelsEnd */ diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h index c2f6a0437f2..31e4bf30232 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h @@ -20,10 +20,11 @@ the old style without any overhead, the macro `CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any \cgal header is included. -\cgalHasModel `CGAL::Arr_naive_point_location` -\cgalHasModel `CGAL::Arr_walk_along_line_point_location` -\cgalHasModel `CGAL::Arr_trapezoid_ric_point_location` -\cgalHasModel `CGAL::Arr_landmarks_point_location` +\cgalHasModelsBegin CGAL::Arr_naive_point_location +\cgalHasModels CGAL::Arr_walk_along_line_point_location +\cgalHasModels CGAL::Arr_trapezoid_ric_point_location +\cgalHasModels CGAL::Arr_landmarks_point_location +\cgalHasModelsEnd \sa `CGAL::Arr_naive_point_location` \sa `CGAL::Arr_walk_along_line_point_location` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h index 87ff1eb159c..fe9137b5696 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h @@ -11,7 +11,8 @@ * \cgalRefines{ArrangementBasicTraits_2,ArrangementIdentifiedVerticalTraits_2, * ArrangementContractedBottomTraits_2,ArrangementContractedTopTraits_2} * - * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` + * \cgalHasModelsBegin CGAL::Arr_geodesic_arc_on_sphere_traits_2 + * \cgalHasModelsEnd * * \sa `ArrangementOpenBoundaryTraits_2` * \sa `ArrangementBasicTraits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h index 2ea883dee11..80660fcda14 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h @@ -20,9 +20,10 @@ * * At this point we do not expose all the requirements of this concept. * - * \cgalHasModel `CGAL::Arr_bounded_planar_topology_traits_2` - * \cgalHasModel `CGAL::Arr_unb_planar_topology_traits_2` - * \cgalHasModel `CGAL::Arr_spherical_topology_traits_2` + * \cgalHasModelsBegin CGAL::Arr_bounded_planar_topology_traits_2 + * \cgalHasModels CGAL::Arr_unb_planar_topology_traits_2 + * \cgalHasModels CGAL::Arr_spherical_topology_traits_2 + * \cgalHasModelsEnd * * \sa `Arrangement_on_surface_2` */ diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h index 05bac54d5a2..e9bca5d3dc9 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h @@ -30,20 +30,21 @@ that accept such curves, such as `intsert()`. \cgalRefines{ArrangementXMonotoneTraits_2} -\cgalHasModel `CGAL::Arr_segment_traits_2` -\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` -\cgalHasModel `CGAL::Arr_linear_traits_2` -\cgalHasModel `CGAL::Arr_polyline_traits_2` -\cgalHasModel `CGAL::Arr_circle_segment_traits_2` -\cgalHasModel `CGAL::Arr_line_arc_traits_2` -\cgalHasModel `CGAL::Arr_circular_arc_traits_2` -\cgalHasModel `CGAL::Arr_circular_line_arc_traits_2` -\cgalHasModel `CGAL::Arr_conic_traits_2` -\cgalHasModel `CGAL::Arr_rational_function_traits_2` -\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2` -\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2` -\cgalHasModel `CGAL::Arr_curve_data_traits_2` -\cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2` +\cgalHasModelsBegin CGAL::Arr_segment_traits_2 +\cgalHasModels CGAL::Arr_non_caching_segment_traits_2 +\cgalHasModels CGAL::Arr_linear_traits_2 +\cgalHasModels CGAL::Arr_polyline_traits_2 +\cgalHasModels CGAL::Arr_circle_segment_traits_2 +\cgalHasModels CGAL::Arr_line_arc_traits_2 +\cgalHasModels CGAL::Arr_circular_arc_traits_2 +\cgalHasModels CGAL::Arr_circular_line_arc_traits_2 +\cgalHasModels CGAL::Arr_conic_traits_2 +\cgalHasModels CGAL::Arr_rational_function_traits_2 +\cgalHasModels CGAL::Arr_Bezier_curve_traits_2 +\cgalHasModels CGAL::Arr_algebraic_segment_traits_2 +\cgalHasModels CGAL::Arr_curve_data_traits_2 +\cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2 +\cgalHasModelsEnd \sa `ArrangementBasicTraits_2` \sa `ArrangementXMonotoneTraits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h index 4a1febdc2d2..eb1b893f460 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h @@ -28,10 +28,11 @@ is recommended. To enable the old style without any overhead, the macro `CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any \cgal header is included. -\cgalHasModel `CGAL::Arr_naive_point_location` -\cgalHasModel `CGAL::Arr_walk_along_line_point_location` -\cgalHasModel `CGAL::Arr_trapezoid_ric_point_location` -\cgalHasModel `CGAL::Arr_landmarks_point_location` +\cgalHasModelsBegin CGAL::Arr_naive_point_location +\cgalHasModels CGAL::Arr_walk_along_line_point_location +\cgalHasModels CGAL::Arr_trapezoid_ric_point_location +\cgalHasModels CGAL::Arr_landmarks_point_location +\cgalHasModelsEnd \sa `CGAL::Arr_naive_point_location` \sa `CGAL::Arr_walk_along_line_point_location` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h index cc36ec97ea6..e12fda8a889 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h @@ -11,10 +11,11 @@ * * \cgalRefines{ArrangementBasicTraits_2} * - * \cgalHasModel `CGAL::Arr_linear_traits_2` - * \cgalHasModel `CGAL::Arr_rational_function_traits_2` - * \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2` - * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` + * \cgalHasModelsBegin CGAL::Arr_linear_traits_2 + * \cgalHasModels CGAL::Arr_rational_function_traits_2 + * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2 + * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2 + * \cgalHasModelsEnd * * \sa `ArrangementVerticalSideTraits_2` */ diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h index fd879fad9a0..4b31986adfb 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h @@ -9,7 +9,8 @@ specific format. \cgalRefines{ArrangementInputFormatter} -\cgalHasModel `CGAL::Arr_with_history_text_formatter` +\cgalHasModelsBegin CGAL::Arr_with_history_text_formatter +\cgalHasModelsEnd */ diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h index e766c2cfc26..8ff0dc5eda4 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h @@ -9,7 +9,8 @@ specific format. \cgalRefines{ArrangementOutputFormatter} -\cgalHasModel `CGAL::Arr_with_history_text_formatter` +\cgalHasModelsBegin CGAL::Arr_with_history_text_formatter +\cgalHasModelsEnd */ diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h index 5eae4b190c2..99e34f2ae6d 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h @@ -18,20 +18,21 @@ curve splitting. \cgalRefines{ArrangementBasicTraits_2} -\cgalHasModel `CGAL::Arr_segment_traits_2` -\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` -\cgalHasModel `CGAL::Arr_linear_traits_2` -\cgalHasModel `CGAL::Arr_polyline_traits_2` -\cgalHasModel `CGAL::Arr_circle_segment_traits_2` -\cgalHasModel `CGAL::Arr_line_arc_traits_2` -\cgalHasModel `CGAL::Arr_circular_arc_traits_2` -\cgalHasModel `CGAL::Arr_circular_line_arc_traits_2` -\cgalHasModel `CGAL::Arr_conic_traits_2` -\cgalHasModel `CGAL::Arr_rational_function_traits_2` -\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2` -\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2` -\cgalHasModel `CGAL::Arr_curve_data_traits_2` -\cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2` +\cgalHasModelsBegin CGAL::Arr_segment_traits_2 +\cgalHasModels CGAL::Arr_non_caching_segment_traits_2 +\cgalHasModels CGAL::Arr_linear_traits_2 +\cgalHasModels CGAL::Arr_polyline_traits_2 +\cgalHasModels CGAL::Arr_circle_segment_traits_2 +\cgalHasModels CGAL::Arr_line_arc_traits_2 +\cgalHasModels CGAL::Arr_circular_arc_traits_2 +\cgalHasModels CGAL::Arr_circular_line_arc_traits_2 +\cgalHasModels CGAL::Arr_conic_traits_2 +\cgalHasModels CGAL::Arr_rational_function_traits_2 +\cgalHasModels CGAL::Arr_Bezier_curve_traits_2 +\cgalHasModels CGAL::Arr_algebraic_segment_traits_2 +\cgalHasModels CGAL::Arr_curve_data_traits_2 +\cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2 +\cgalHasModelsEnd \sa `ArrangementBasicTraits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h index 9221705a709..2a90dfee44d 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h @@ -11,8 +11,9 @@ Models for the concept are used by the global `overlay()` function to maintain the auxiliary data stored with the \dcel records of the resulting overlaid arrangement, based on the contents of the input records. -\cgalHasModel `CGAL::Arr_default_overlay_traits` -\cgalHasModel `CGAL::Arr_face_overlay_traits` +\cgalHasModelsBegin CGAL::Arr_default_overlay_traits +\cgalHasModels CGAL::Arr_face_overlay_traits +\cgalHasModelsEnd \sa `overlay` diff --git a/BGL/doc/BGL/Concepts/EdgeListGraph.h b/BGL/doc/BGL/Concepts/EdgeListGraph.h index 3b614c86c07..93b23b76748 100644 --- a/BGL/doc/BGL/Concepts/EdgeListGraph.h +++ b/BGL/doc/BGL/Concepts/EdgeListGraph.h @@ -11,7 +11,7 @@ and adds the requirement for traversal of all edges in a graph. \cgalRefines{Graph} -\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink +\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink} \sa \link PkgBGLConcepts Graph Concepts \endlink */ diff --git a/BGL/doc/BGL/Concepts/FaceGraph.h b/BGL/doc/BGL/Concepts/FaceGraph.h index b7ea012f4c9..a8b8bbe1893 100644 --- a/BGL/doc/BGL/Concepts/FaceGraph.h +++ b/BGL/doc/BGL/Concepts/FaceGraph.h @@ -20,7 +20,7 @@ A face descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompara \cgalRefines{HalfedgeGraph} -\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink +\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink} \sa \link PkgBGLConcepts Graph Concepts \endlink */ diff --git a/BGL/doc/BGL/Concepts/FaceListGraph.h b/BGL/doc/BGL/Concepts/FaceListGraph.h index 6e7936f5ad9..046015b67d2 100644 --- a/BGL/doc/BGL/Concepts/FaceListGraph.h +++ b/BGL/doc/BGL/Concepts/FaceListGraph.h @@ -16,7 +16,7 @@ face iterator must be the same as the face descriptor of the graph. \cgalRefines{FaceGraph} -\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink +\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink} \sa \link PkgBGLConcepts Graph Concepts \endlink */ diff --git a/BGL/doc/BGL/Concepts/HalfedgeGraph.h b/BGL/doc/BGL/Concepts/HalfedgeGraph.h index 8a31a1a787a..7be2d2220d7 100644 --- a/BGL/doc/BGL/Concepts/HalfedgeGraph.h +++ b/BGL/doc/BGL/Concepts/HalfedgeGraph.h @@ -38,7 +38,7 @@ An edge descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompar A model of `HalfedgeGraph` must have the interior property `vertex_point` attached to its vertices. -\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink +\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink} \sa \link PkgBGLConcepts Graph Concepts \endlink */ diff --git a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h index 1019f3c336b..c5f8eeff689 100644 --- a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h +++ b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h @@ -16,7 +16,7 @@ halfedge iterator must be the same as the halfedge descriptor of the graph. \cgalRefines{HalfedgeGraph} -\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink +\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink} \sa \link PkgBGLConcepts Graph Concepts \endlink */ diff --git a/BGL/doc/BGL/Concepts/MutableFaceGraph.h b/BGL/doc/BGL/Concepts/MutableFaceGraph.h index 2ce0c981554..1f0f86c6a86 100644 --- a/BGL/doc/BGL/Concepts/MutableFaceGraph.h +++ b/BGL/doc/BGL/Concepts/MutableFaceGraph.h @@ -7,7 +7,7 @@ the requirement for operations to add faces and to modify face-halfedge relation \cgalRefines{FaceGraph,MutableHalfedgeGraph} -\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink +\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink} \sa \link PkgBGLConcepts Graph Concepts \endlink */ diff --git a/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h b/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h index 5ce56824a5a..86bd650fc86 100644 --- a/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h +++ b/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h @@ -8,7 +8,7 @@ update the incidence information between vertices and halfedges. \cgalRefines{HalfedgeGraph} -\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink +\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink} \sa \link PkgBGLConcepts Graph Concepts \endlink */ diff --git a/BGL/doc/BGL/Concepts/VertexListGraph.h b/BGL/doc/BGL/Concepts/VertexListGraph.h index aa88a4d1944..009fe00dac1 100644 --- a/BGL/doc/BGL/Concepts/VertexListGraph.h +++ b/BGL/doc/BGL/Concepts/VertexListGraph.h @@ -11,7 +11,7 @@ and adds the requirement for traversal of all vertices in a graph. \cgalRefines{Graph} -\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink +\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink} \sa \link PkgBGLConcepts Graph Concepts \endlink */ diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h index 7f9ea3dfcbb..9fd9c19943b 100644 --- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h +++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h @@ -8,10 +8,10 @@ namespace Barycentric_coordinates { A concept that describes the set of methods that should be defined for all coordinate models used to parameterize the class `Generalized_barycentric_coordinates_2`. -\cgalHasModel -- `Wachspress_2` -- `Mean_value_2` -- `Discrete_harmonic_2` +\cgalHasModelsBegin Wachspress_2 +\cgalHasModels Mean_value_2 +\cgalHasModels Discrete_harmonic_2 +\cgalHasModelsEnd \deprecated This part of the package is deprecated since the version 5.4 of \cgal. */ diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h index 1fe3c8fc2bd..bf07127b14d 100644 --- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h +++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h @@ -9,12 +9,11 @@ A concept that describes the set of requirements of the template parameter `GeomTraits` used to parameterize all classes and functions with 2D barycentric coordinates from the namespace `CGAL::Barycentric_coordinates`. -\cgalHasModel -- All models of `Kernel` -- `CGAL::Projection_traits_3` -- `CGAL::Projection_traits_xy_3` -- `CGAL::Projection_traits_yz_3` -- `CGAL::Projection_traits_xz_3` +\cgalHasModelsBareBegin{All models of `Kernel`} CGAL::Projection_traits_3 +\cgalHasModels CGAL::Projection_traits_xy_3 +\cgalHasModels CGAL::Projection_traits_yz_3 +\cgalHasModels CGAL::Projection_traits_xz_3 +\cgalHasModelsEnd */ class BarycentricTraits_2 { diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h index 9e6e353958c..9ace050c0d8 100644 --- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h +++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h @@ -13,7 +13,8 @@ elements, which share common edges and vertices. These finite elements are then used to approximate certain types of generalized barycentric coordinate functions. The domain is bounded by the polygon. -\cgalHasModel `Delaunay_domain_2` +\cgalHasModelsBegin Delaunay_domain_2 +\cgalHasModelsEnd */ class DiscretizedDomain_2 { diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h index c1f77e40a82..409316c5a4e 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h @@ -5,7 +5,8 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableBinaryFunction} -\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2` +\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2 +\cgalHasModelsEnd */ diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h index 336b992999d..f4fcfa096e9 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h @@ -6,7 +6,8 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableUnaryFunction} -\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2` +\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2 +\cgalHasModelsEnd */ diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h index 5e8c9d034a4..719878346a5 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h @@ -6,7 +6,8 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableUnaryFunction} -\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2` +\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2 +\cgalHasModelsEnd */ diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h index 0d90fbacb2f..1e98facf71d 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h @@ -5,7 +5,8 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableBinaryFunction} -\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Intersect_2` +\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Intersect_2 +\cgalHasModelsEnd */ diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h index 673b60c589b..2064a3ba079 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h @@ -5,7 +5,8 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableBinaryFunction} -\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Merge_2` +\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Merge_2 +\cgalHasModelsEnd */ diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h index 108eb017796..91f8903728c 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h @@ -5,7 +5,8 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableUnaryFunction} -\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Split_2` +\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Split_2 +\cgalHasModelsEnd */ diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h index 62ce1fb841f..6b66a66997b 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h @@ -16,13 +16,14 @@ as its source and the other as its target. \cgalRefines{ArrangementXMonotoneTraits_2} -\cgalHasModel `CGAL::Arr_segment_traits_2` -\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` -\cgalHasModel `CGAL::Arr_circle_segment_traits_2` -\cgalHasModel `CGAL::Arr_conic_traits_2` -\cgalHasModel `CGAL::Arr_rational_function_traits_2` -\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2` -\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2` +\cgalHasModelsBegin CGAL::Arr_segment_traits_2 +\cgalHasModels CGAL::Arr_non_caching_segment_traits_2 +\cgalHasModels CGAL::Arr_circle_segment_traits_2 +\cgalHasModels CGAL::Arr_conic_traits_2 +\cgalHasModels CGAL::Arr_rational_function_traits_2 +\cgalHasModels CGAL::Arr_Bezier_curve_traits_2 +\cgalHasModels CGAL::Arr_algebraic_segment_traits_2 +\cgalHasModelsEnd \sa `ArrangementXMonotoneTraits_2` diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h index ec5f5909ce3..9264a822bff 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h @@ -16,7 +16,8 @@ respectively \cgalRefines{ArrangementDcel} -\cgalHasModel `CGAL::Gps_default_dcel` +\cgalHasModelsBegin CGAL::Gps_default_dcel +\cgalHasModelsEnd \sa `GeneralPolygonSetDcelFace` \sa `GeneralPolygonSetDcelHalfedge` diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h index e33f52f2219..029f24e7b3f 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h @@ -9,7 +9,8 @@ to represent the underlying internal `Arrangement_2` data structure. \cgalRefines{ArrangementDcelFace} -\cgalHasModel `CGAL::Gps_face_base` +\cgalHasModelsBegin CGAL::Gps_face_base +\cgalHasModelsEnd \sa `ArrangementDcel` \sa `ArrangementDcelVertex` diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h index 7334559a7ef..900f5237229 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h @@ -8,7 +8,8 @@ to represent the underlying internal `Arrangement_2` data structure. \cgalRefines{ArrangementDcelHalfedge} -\cgalHasModel `CGAL::Gps_face_halfedge` +\cgalHasModelsBegin CGAL::Gps_face_halfedge +\cgalHasModelsEnd \sa `ArrangementDcel` \sa `ArrangementDcelVertex` diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h index 99001c39f1c..5271a780744 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h @@ -13,9 +13,10 @@ types. \cgalRefines{ArrangementDirectionalXMonotoneTraits_2} -\cgalHasModel `CGAL::Gps_segment_traits_2` -\cgalHasModel `CGAL::Gps_circle_segment_traits_2` -\cgalHasModel `CGAL::Gps_traits_2` +\cgalHasModelsBegin CGAL::Gps_segment_traits_2 +\cgalHasModels CGAL::Gps_circle_segment_traits_2 +\cgalHasModels CGAL::Gps_traits_2 +\cgalHasModelsEnd \sa `ArrangementDirectionalXMonotoneTraits_2` diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h index 2a46c3470bd..d9103ae6839 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h @@ -16,7 +16,8 @@ accordingly. Only counterclockwise oriented polygons are valid operands of Boolean set-operations. General polygon that represent holes must be clockwise oriented. -\cgalHasModel `CGAL::General_polygon_2` +\cgalHasModelsBegin CGAL::General_polygon_2 +\cgalHasModelsEnd */ diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h index 842290bb47f..c9d62f6cef6 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h @@ -9,7 +9,8 @@ A model of this concept represents a general polygon with holes. \cgalGeneralizes `GeneralPolygonWithHoles_2` -\cgalHasModel `GeneralPolygonSetTraits_2::Polygon_with_holes2` +\cgalHasModelsBegin GeneralPolygonSetTraits_2::Polygon_with_holes2 +\cgalHasModelsEnd \sa `GeneralPolygonWithHoles_2` diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h index 99324d14227..a9999735b0e 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h @@ -9,8 +9,9 @@ A model of this concept represents a simple general polygon. \cgalGeneralizes `GeneralPolygon_2` -\cgalHasModel `GeneralPolygonSetTraits_2::Polygon_2` -\cgalHasModel `CGAL::Polygon_2` +\cgalHasModelsBegin GeneralPolygonSetTraits_2::Polygon_2 +\cgalHasModels CGAL::Polygon_2 +\cgalHasModelsEnd \sa `GeneralPolygon_2` diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h index d026e62b587..05721090917 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h @@ -8,9 +8,10 @@ This concept defines the requirements for traits classes of \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Approximate_min_ellipsoid_d_traits_2` -\cgalHasModel `CGAL::Approximate_min_ellipsoid_d_traits_3` -\cgalHasModel `CGAL::Approximate_min_ellipsoid_d_traits_d` +\cgalHasModelsBegin CGAL::Approximate_min_ellipsoid_d_traits_2 +\cgalHasModels CGAL::Approximate_min_ellipsoid_d_traits_3 +\cgalHasModels CGAL::Approximate_min_ellipsoid_d_traits_d +\cgalHasModelsEnd \sa `CGAL::Min_ellipse_2` diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h index e593f73cb76..71cb832881e 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h @@ -6,7 +6,8 @@ This concept defines the requirements for traits classes of `CGAL::Min_circle_2`. -\cgalHasModel `CGAL::Min_circle_2_traits_2` +\cgalHasModelsBegin CGAL::Min_circle_2_traits_2 +\cgalHasModelsEnd \sa `CGAL::Min_circle_2` diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h index f4d480a00ba..d6cfac02a1f 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h @@ -6,7 +6,8 @@ This concept defines the requirements for traits classes of `CGAL::Min_ellipse_2`. -\cgalHasModel `CGAL::Min_ellipse_2_traits_2` +\cgalHasModelsBegin CGAL::Min_ellipse_2_traits_2 +\cgalHasModelsEnd \sa `CGAL::Min_ellipse_2` diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h index be4ba5f5a2d..17da54b7774 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h @@ -8,7 +8,8 @@ needed to compute minimum enclosing quadrilaterals of a planar point set using the functions `min_rectangle_2()`, `min_parallelogram_2()` and `min_strip_2()`. -\cgalHasModel `CGAL::Min_quadrilateral_default_traits_2` +\cgalHasModelsBegin CGAL::Min_quadrilateral_default_traits_2 +\cgalHasModelsEnd \sa `CGAL::min_rectangle_2()` \sa `CGAL::min_parallelogram_2()` diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h index bbf1b33c2e9..ddd404f13c6 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h @@ -6,9 +6,10 @@ This concept defines the requirements for traits classes of \f$ d\f$-dimensional min sphere and min annulus algorithms. -\cgalHasModel `CGAL::Min_sphere_annulus_d_traits_2` -\cgalHasModel `CGAL::Min_sphere_annulus_d_traits_3` -\cgalHasModel `CGAL::Min_sphere_annulus_d_traits_d` +\cgalHasModelsBegin CGAL::Min_sphere_annulus_d_traits_2 +\cgalHasModels CGAL::Min_sphere_annulus_d_traits_3 +\cgalHasModels CGAL::Min_sphere_annulus_d_traits_d +\cgalHasModelsEnd \sa `CGAL::Min_sphere_d` \sa `CGAL::Min_annulus_d` diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h index 49b32647f3c..163cc679065 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h @@ -6,13 +6,13 @@ A model of concept `MinSphereOfSpheresTraits` must provide the following constants, types, predicates and operations. -\cgalHasModel `CGAL::Min_sphere_of_spheres_d_traits_2` -\cgalHasModel `CGAL::Min_sphere_of_spheres_d_traits_3` -\cgalHasModel `CGAL::Min_sphere_of_spheres_d_traits_d` - -\cgalHasModel `CGAL::Min_sphere_of_points_d_traits_2` -\cgalHasModel `CGAL::Min_sphere_of_points_d_traits_3` -\cgalHasModel `CGAL::Min_sphere_of_points_d_traits_d` +\cgalHasModelsBegin CGAL::Min_sphere_of_spheres_d_traits_2 +\cgalHasModels CGAL::Min_sphere_of_spheres_d_traits_3 +\cgalHasModels CGAL::Min_sphere_of_spheres_d_traits_d +\cgalHasModels CGAL::Min_sphere_of_points_d_traits_2 +\cgalHasModels CGAL::Min_sphere_of_points_d_traits_3 +\cgalHasModels CGAL::Min_sphere_of_points_d_traits_d +\cgalHasModelsEnd */ class MinSphereOfSpheresTraits { diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h index 9c0727d44bd..2c9c9ba44d5 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h @@ -7,7 +7,8 @@ The concept `RectangularPCenterTraits_2` defines types and operations needed to compute rectilinear \f$ p\f$-centers of a planar point set using the function `CGAL::rectangular_p_center_2()`. -\cgalHasModel `CGAL::Rectangular_p_center_default_traits_2` +\cgalHasModelsBegin CGAL::Rectangular_p_center_default_traits_2 +\cgalHasModelsEnd \sa `CGAL::rectangular_p_center_2()` diff --git a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h index 7d28f370fc8..594f4c94ebb 100644 --- a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h +++ b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h @@ -10,8 +10,9 @@ the dimension, the `id`-number, and the boundaries of the box. \cgalRefines{Assignable} -\cgalHasModel CGAL::Box_intersection_d::Box_d -\cgalHasModel CGAL::Box_intersection_d::Box_with_handle_d +\cgalHasModelsBegin CGAL::Box_intersection_d::Box_d +\cgalHasModels CGAL::Box_intersection_d::Box_with_handle_d +\cgalHasModelsEnd \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink \sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink diff --git a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h index 03300e29d64..cf6dfcb546d 100644 --- a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h +++ b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h @@ -9,7 +9,8 @@ the boxes manipulated in these algorithms. \cgalRefines{Assignable,DefaultConstructible} -\cgalHasModel CGAL::Box_intersection_d::Box_traits_d +\cgalHasModelsBegin CGAL::Box_intersection_d::Box_traits_d +\cgalHasModelsEnd \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink \sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h index 322134ed592..f5a18c37220 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h @@ -11,7 +11,8 @@ are of a type that is a model of the concept \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel CGAL::Polynomial_for_circles_2_2 +\cgalHasModelsBegin CGAL::Polynomial_for_circles_2_2 +\cgalHasModelsEnd \sa `AlgebraicKernelForCircles` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h index a017fef7163..b01eedc5a49 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h @@ -9,7 +9,8 @@ coefficients are of a type that is a model of the concept \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel CGAL::Polynomial_1_2 +\cgalHasModelsBegin CGAL::Polynomial_1_2 +\cgalHasModelsEnd \sa `AlgebraicKernelForCircles` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h index 075d69941f9..d1771575964 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h @@ -7,7 +7,8 @@ Concept to represent the roots of a system of two equations of degree 2 in two variables `x` and `y` that are models of concept `AlgebraicKernelForCircles::PolynomialForCircles_2_2` -\cgalHasModel CGAL::Root_for_circles_2_2 +\cgalHasModelsBegin CGAL::Root_for_circles_2_2 +\cgalHasModelsEnd \sa `AlgebraicKernelForCircles` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h index 79dbf30fe5a..e0d50ab1b57 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h @@ -7,7 +7,8 @@ The `AlgebraicKernelForCircles` concept is meant to provide the curved kernel with all the algebraic functionalities required for the manipulation of circular arcs. -\cgalHasModel `CGAL::Algebraic_kernel_for_circles_2_2` +\cgalHasModelsBegin CGAL::Algebraic_kernel_for_circles_2_2 +\cgalHasModelsEnd \sa `CircularKernel` \sa `CGAL::Circular_kernel_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h index add345ad6ff..603867502f9 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h @@ -7,7 +7,8 @@ Concept for points on circles, circular arcs or line arcs. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Circular_arc_point_2` +\cgalHasModelsBegin CGAL::Circular_arc_point_2 +\cgalHasModelsEnd */ class CircularKernel::CircularArcPoint_2 { public: diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h index 34f8cef50e2..bd5586d0035 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h @@ -7,7 +7,8 @@ Concept for arcs of circles. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Circular_arc_2` +\cgalHasModelsBegin CGAL::Circular_arc_2 +\cgalHasModelsEnd */ diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h index 0400dd4bade..7f82890c16a 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h @@ -9,7 +9,8 @@ Concept for line segments supported by a line that is a model of \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Line_arc_2` +\cgalHasModelsBegin CGAL::Line_arc_2 +\cgalHasModelsEnd */ class CircularKernel::LineArc_2 { diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h index 681d46d9679..a151ed89191 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h @@ -5,8 +5,9 @@ \cgalRefines{Kernel} -\cgalHasModel `CGAL::Circular_kernel_2` -\cgalHasModel `CGAL::Exact_circular_kernel_2` +\cgalHasModelsBegin CGAL::Circular_kernel_2 +\cgalHasModels CGAL::Exact_circular_kernel_2 +\cgalHasModelsEnd \sa `Kernel` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h index 54db59349fc..0dbd299b9cd 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h @@ -11,7 +11,8 @@ are of a type that is a model of the concept \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel CGAL::Polynomial_for_spheres_2_3 +\cgalHasModelsBegin GAL::Polynomial_for_spheres_2_ +\cgalHasModelsEnd \sa `AlgebraicKernelForSpheres` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h index 023c13ebc20..8cf947c04ba 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h @@ -9,7 +9,8 @@ coefficients are of a type that is a model of the concept \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel CGAL::Polynomial_1_3 +\cgalHasModelsBegin CGAL::Polynomial_1_3 +\cgalHasModelsEnd \sa `AlgebraicKernelForSpheres` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h index df2b2ee627b..70866c01e37 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h @@ -8,7 +8,8 @@ capable of storing equations of lines. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel CGAL::Polynomials_for_lines_3 +\cgalHasModelsBegin CGAL::Polynomials_for_lines_3 +\cgalHasModelsEnd \sa `AlgebraicKernelForSpheres` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h index 61ac0d14a8b..2754b94e091 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h @@ -7,7 +7,8 @@ Concept to represent the roots of a system of three equations of degree 2 in three variables `x`, `y` and `z` that are models of concept `AlgebraicKernelForSpheres::PolynomialForSpheres_2_3`. -\cgalHasModel CGAL::Root_for_spheres_2_3 +\cgalHasModelsBegin CGAL::Root_for_spheres_2_3 +\cgalHasModelsEnd \sa `AlgebraicKernelForSpheres` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h index 58ab8c24ff0..e83eca8300d 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h @@ -7,7 +7,8 @@ The `AlgebraicKernelForSpheres` concept is meant to provide the curved kernel with all the algebraic functionalities required for the manipulation of spheres, circles, and circular arcs in 3D. -\cgalHasModel CGAL::Algebraic_kernel_for_spheres_2_3 +\cgalHasModelsBegin CGAL::Algebraic_kernel_for_spheres_2_3 +\cgalHasModelsEnd \sa `SphericalKernel` \sa `CGAL::Spherical_kernel_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h index 4a4494bc216..81128f2844e 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h @@ -7,7 +7,8 @@ Concept for points on spheres, circles, circular arcs or line arcs. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Circular_arc_point_3` +\cgalHasModelsBegin CGAL::Circular_arc_point_3 +\cgalHasModelsEnd */ diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h index ffefeb6aefb..5a8498f2824 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h @@ -7,7 +7,8 @@ Concept for arcs of circles. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Circular_arc_3` +\cgalHasModelsBegin CGAL::Circular_arc_3 +\cgalHasModelsEnd */ diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h index 5ea1f9aed8e..07946ba0f14 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h @@ -9,7 +9,8 @@ Concept for line segments supported by a line that is a model of \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Line_arc_3` +\cgalHasModelsBegin CGAL::Line_arc_3 +\cgalHasModelsEnd */ diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h index 950115d7c73..3bafc8659d0 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h @@ -5,8 +5,9 @@ \cgalRefines{Kernel} -\cgalHasModel `CGAL::Spherical_kernel_3` -\cgalHasModel CGAL::Exact_spherical_kernel_3 +\cgalHasModelsBegin CGAL::Spherical_kernel_3 +\cgalHasModels CGAL::Exact_spherical_kernel_3 +\cgalHasModelsEnd \sa `Kernel` diff --git a/Circulator/doc/Circulator/Concepts/ConstHandle.h b/Circulator/doc/Circulator/Concepts/ConstHandle.h index 3552dc5cb29..9ff3bea6b33 100644 --- a/Circulator/doc/Circulator/Concepts/ConstHandle.h +++ b/Circulator/doc/Circulator/Concepts/ConstHandle.h @@ -7,7 +7,8 @@ A constant handle. Refer to the `Handle` concept for more details. \cgalRefines{Descriptor} -\cgalHasModel const T* (const pointers) +\cgalHasModelsBegin const T* (const pointers) +\cgalHasModelsEnd \sa `Handle` diff --git a/Circulator/doc/Circulator/Concepts/ConstRange.h b/Circulator/doc/Circulator/Concepts/ConstRange.h index b690c3d97d3..643dc47c83b 100644 --- a/Circulator/doc/Circulator/Concepts/ConstRange.h +++ b/Circulator/doc/Circulator/Concepts/ConstRange.h @@ -7,8 +7,7 @@ A constant iterator range. Refer to the `Range` concept for more details. \cgalRefinesBare{Boost's %Range concept} -\cgalHasModel STL containers -\cgalHasModel `boost::iterator_range` +\cgalHasModelsBare{STL containers,`boost::iterator_range`} \sa `Range` diff --git a/Circulator/doc/Circulator/Concepts/Handle.h b/Circulator/doc/Circulator/Concepts/Handle.h index 748ab737efb..a5fade1d46f 100644 --- a/Circulator/doc/Circulator/Concepts/Handle.h +++ b/Circulator/doc/Circulator/Concepts/Handle.h @@ -23,10 +23,11 @@ operator is concerned (this serves the same purpose as NULL for pointers). (Note that this is not a generally supported feature of iterators of standard containers.) -\cgalHasModel T* (pointer) -\cgalHasModel const T* (const pointers) -\cgalHasModel `Iterator` -\cgalHasModel `Circulator` +\cgalHasModelsBegin T* (pointer) +\cgalHasModels const T* (const pointers) +\cgalHasModels Iterator +\cgalHasModels Circulator +\cgalHasModelsEnd */ class Handle { public: diff --git a/Circulator/doc/Circulator/Concepts/Range.h b/Circulator/doc/Circulator/Concepts/Range.h index 2da31fa5940..ef6cfd56d58 100644 --- a/Circulator/doc/Circulator/Concepts/Range.h +++ b/Circulator/doc/Circulator/Concepts/Range.h @@ -31,7 +31,7 @@ difference with iterators which are typically passed by value. \cgalRefinesBare{ConstRange,Boost's %Range concept} -\cgalHasModel STL containers +\cgalHasModelsBare{STL containers} */ diff --git a/Classification/doc/Classification/Concepts/Classifier.h b/Classification/doc/Classification/Concepts/Classifier.h index ca1f3cefc97..9a350599794 100644 --- a/Classification/doc/Classification/Concepts/Classifier.h +++ b/Classification/doc/Classification/Concepts/Classifier.h @@ -12,9 +12,10 @@ Concept describing a classifier used by classification functions (see `CGAL::Classification::classify()`, `CGAL::Classification::classify_with_local_smoothing()` and `CGAL::Classification::classify_with_graphcut()`). -\cgalHasModel `CGAL::Classification::Sum_of_weighted_features_classifier` -\cgalHasModel `CGAL::Classification::ETHZ::Random_forest_classifier` -\cgalHasModel `CGAL::Classification::OpenCV::Random_forest_classifier` +\cgalHasModelsBegin CGAL::Classification::Sum_of_weighted_features_classifier +\cgalHasModels CGAL::Classification::ETHZ::Random_forest_classifier +\cgalHasModels CGAL::Classification::OpenCV::Random_forest_classifier +\cgalHasModelsEnd */ class Classifier diff --git a/Classification/doc/Classification/Concepts/NeighborQuery.h b/Classification/doc/Classification/Concepts/NeighborQuery.h index eeed7fa074c..99aeb76cb2f 100644 --- a/Classification/doc/Classification/Concepts/NeighborQuery.h +++ b/Classification/doc/Classification/Concepts/NeighborQuery.h @@ -10,10 +10,11 @@ namespace Classification Concept describing a neighbor query used for classification. -\cgalHasModel `CGAL::Classification::Point_set_neighborhood::K_neighbor_query` -\cgalHasModel `CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query` -\cgalHasModel `CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query` -\cgalHasModel `CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query` +\cgalHasModelsBegin CGAL::Classification::Point_set_neighborhood::K_neighbor_query +\cgalHasModels CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query +\cgalHasModels CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query +\cgalHasModels CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query +\cgalHasModelsEnd */ class NeighborQuery diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h index cce3235390e..ad331c7bc22 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h +++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h @@ -5,7 +5,7 @@ The concept `CellAttribute` represents a non void attribute associated with a cell of a generic map. It can keep a descriptor to one dart of its associated cell, and can contain any information. -\cgalHasModel \link CGAL::Cell_attribute `CGAL::Cell_attribute`\endlink +\cgalHasModelsBare{\link CGAL::Cell_attribute `CGAL::Cell_attribute`\endlink} \sa `GenericMap` \sa `GenericMapItems` diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h index 03f492d1b08..ecf28bda596 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h +++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h @@ -6,7 +6,7 @@ The concept `CombinatorialMap` defines a d-dimensional combinatorial map. \cgalRefines{GenericMap} -\cgalHasModel \link CGAL::Combinatorial_map `CGAL::Combinatorial_map`\endlink +\cgalHasModelsBare{\link CGAL::Combinatorial_map `CGAL::Combinatorial_map`\endlink} For a combinatorial map, the function \link GenericMap::next `next`\endlink is equal to \f$ \beta_1\f$, \link GenericMap::previous `previous`\endlink is equal to \f$ \beta_0\f$ and the function \link GenericMap::opposite `opposite`\endlink is equal to \f$ \beta_i\f$. */ diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h index ae828e3cdf0..87113f9aa21 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h +++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h @@ -8,8 +8,8 @@ The concept `GenericMap` defines a d-dimensional generic map. This concep A generic map has a set of darts D, and functions \f$ f_0\f$,\f$ \ldots\f$,\f$ f_{d}\f$ that link these darts between them. -\cgalHasModel \link CGAL::Combinatorial_map `CGAL::Combinatorial_map`\endlink -\cgalHasModel \link CGAL::Generalized_map `CGAL::Generalized_map`\endlink +\cgalHasModelsBare{\link CGAL::Combinatorial_map `CGAL::Combinatorial_map`\endlink\n + \link CGAL::Generalized_map `CGAL::Generalized_map`\endlink} \sa `CombinatorialMap` \sa `GeneralizedMap` diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h index afd744baab4..6fd24033a72 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h +++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h @@ -4,7 +4,7 @@ The concept `GenericMapItems` allows to customize a dD generic map by choosing the information associated with darts, by enabling and disabling some attributes, and by choosing to use indices or handles. For that, it defines an inner class template named \link GenericMapItems::Dart_wrapper `Dart_wrapper`\endlink, with one template parameter, `Map`, a model of the `GenericMap` concept. This inner class can define the two types `%Dart_info` and `%Attributes`. -\cgalHasModel \link CGAL::Generic_map_min_items `CGAL::Generic_map_min_items`\endlink +\cgalHasModelsBare{\link CGAL::Generic_map_min_items `CGAL::Generic_map_min_items`\endlink} \sa `GenericMap` diff --git a/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h b/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h index 0bff4725d60..251e12f7fb9 100644 --- a/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h +++ b/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h @@ -9,12 +9,13 @@ primitives (objects and predicates) that the convex hull algorithms use. functions. The specific subset of these primitives required by each function is specified with each function. -\cgalHasModel `CGAL::Convex_hull_constructive_traits_2` -\cgalHasModel `CGAL::Convex_hull_traits_2` -\cgalHasModel `CGAL::Convex_hull_traits_adapter_2` -\cgalHasModel `CGAL::Projection_traits_xy_3` -\cgalHasModel `CGAL::Projection_traits_yz_3` -\cgalHasModel `CGAL::Projection_traits_xz_3` +\cgalHasModelsBegin CGAL::Convex_hull_constructive_traits_2 +\cgalHasModels CGAL::Convex_hull_traits_2 +\cgalHasModels CGAL::Convex_hull_traits_adapter_2 +\cgalHasModels CGAL::Projection_traits_xy_3 +\cgalHasModels CGAL::Projection_traits_yz_3 +\cgalHasModels CGAL::Projection_traits_xz_3 +\cgalHasModelsEnd */ diff --git a/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h b/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h index 7efcfcb9e93..711efc4d8aa 100644 --- a/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h +++ b/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h @@ -4,8 +4,9 @@ Requirements of the traits class of the function `CGAL::convex_hull_3()`. -\cgalHasModel `CGAL::Convex_hull_traits_3` -\cgalHasModel `CGAL::Extreme_points_traits_adapter_3` +\cgalHasModelsBegin CGAL::Convex_hull_traits_3 +\cgalHasModels CGAL::Extreme_points_traits_adapter_3 +\cgalHasModelsEnd */ class ConvexHullTraits_3 { diff --git a/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h b/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h index d69567d6102..6f3bad1286e 100644 --- a/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h +++ b/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h @@ -6,8 +6,8 @@ Requirements of the traits class used by the function `CGAL::is_strongly_convex_3()`, which is used for postcondition checking by `CGAL::convex_hull_3()`. -\cgalHasModel `CGAL::Convex_hull_traits_3` -\cgalHasModel All models of `Kernel` +\cgalHasModelsBareBegin{All models of `Kernel`} CGAL::Convex_hull_traits_3 +\cgalHasModelsEnd \sa `ConvexHullTraits_3` \sa `CGAL::is_strongly_convex_3()` diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h index abd9c2928ec..78e06df722d 100644 --- a/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h +++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h @@ -7,9 +7,10 @@ Requirements of the traits class to be used with the class `CGAL::Convex_hull_d`. -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Homogeneous_d` -\cgalHasModel `CGAL::Convex_hull_d_traits_3` +\cgalHasModelsBegin CGAL::Cartesian_d +\cgalHasModels CGAL::Homogeneous_d +\cgalHasModels CGAL::Convex_hull_d_traits_3 +\cgalHasModelsEnd */ class ConvexHullTraits_d { diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h index e798f331db4..23352fbe2e6 100644 --- a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h +++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h @@ -7,8 +7,9 @@ Requirements of the second traits class to be used with the class `CGAL::Delaunay_d`. -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Homogeneous_d` +\cgalHasModelsBegin CGAL::Cartesian_d +\cgalHasModels CGAL::Homogeneous_d +\cgalHasModelsEnd */ class DelaunayLiftedTraits_d { diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h index f2465c575fe..b8e91a96aa9 100644 --- a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h +++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h @@ -7,8 +7,9 @@ Requirements of the first traits class to be used with the class `CGAL::Delaunay_d`. -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Homogeneous_d` +\cgalHasModelsBegin CGAL::Cartesian_d +\cgalHasModels CGAL::Homogeneous_d +\cgalHasModelsEnd */ diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in index 7486ae587d7..97f12d55731 100644 --- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in @@ -136,18 +136,19 @@ ALIASES = "cgal=%CGAL" \ "cgalRefinesBare{1}=
@cgalRefines
\1
" \ "cgalRefinesBare{2}=
@cgalRefines
@c \1
\2
" \ "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \ - "cgalModelsHeader=Is Model Of" \ + "cgalModelsHeader=Is model of" \ "cgalModels{1}=
@cgalModelsHeader
@c \1
" \ "cgalModels{2}=
@cgalModelsHeader
@c \1
@c \2
" \ "cgalModelsBare{1}=
@cgalModelsHeader
\1
" \ - "cgalModelsBare{2}=
@cgalModelsHeader
@c \1
\2
" \ + "cgalModelsBare{2}=
@cgalModelsHeader
\1
\2
" \ "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \ - "cgalHasModel=\xrefitem hasModels \"Has Models\" \"Has Model Relationships\"" \ - "cgalHasModelsHeader=Has Models" \ + "cgalHasModelsHeader=Has models" \ "cgalHasModelsBegin=
@cgalHasModelsHeader
`" \ "cgalHasModels=`
`" \ "cgalHasModelsEnd=`
" \ - "cgalHasModelsBare{1}=
@cgalHasModels
\1
" \ + "cgalHasModelsBare{1}=
@cgalHasModelsHeader
\1
" \ + "cgalHasModelsBare{2}=
@cgalHasModelsHeader
\1
\2
" \ + "cgalHasModelsBareBegin{1}=
@cgalHasModelsHeader
\1
`" \ "cgalDebugBegin=\htmlonly
Debugging Support
\endhtmlonly \n" \ "cgalDebugEnd=\htmlonly
\endhtmlonly" \ "cgalDebugFunction=This is a function for debugging purpose." \ diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in index 3813f3748da..3a25e3c92be 100644 --- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in @@ -145,18 +145,19 @@ ALIASES = "cgal=%CGAL" \ "cgalRefinesBare{1}=
@cgalRefines
\1
" \ "cgalRefinesBare{2}=
@cgalRefines
@c \1
\2
" \ "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \ - "cgalModelsHeader=Is Model Of" \ + "cgalModelsHeader=Is model of" \ "cgalModels{1}=
@cgalModelsHeader
@c \1
" \ "cgalModels{2}=
@cgalModelsHeader
@c \1
@c \2
" \ "cgalModelsBare{1}=
@cgalModelsHeader
\1
" \ - "cgalModelsBare{2}=
@cgalModelsHeader
@c \1
\2
" \ + "cgalModelsBare{2}=
@cgalModelsHeader
\1
\2
" \ "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \ - "cgalHasModel=\xrefitem hasModels \"Has Models\" \"Has Model Relationships\"" \ - "cgalHasModelsHeader=Has Models" \ + "cgalHasModelsHeader=Has models" \ "cgalHasModelsBegin=
@cgalHasModelsHeader
`" \ "cgalHasModels=`
`" \ "cgalHasModelsEnd=`
" \ "cgalHasModelsBare{1}=
@cgalHasModelsHeader
\1
" \ + "cgalHasModelsBare{2}=
@cgalHasModelsHeader
\1
\2
" \ + "cgalHasModelsBareBegin{1}=
@cgalHasModelsHeader
\1
`" \ "cgalDebugBegin=\htmlonly[block]
Debugging Support
\endhtmlonly ^^" \ "cgalDebugEnd=\htmlonly[block]
\endhtmlonly" \ "cgalDebugFunction=This is a function for debugging purpose." \ diff --git a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h index 47b1f729035..66b3c1f3477 100644 --- a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h +++ b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h @@ -16,10 +16,11 @@ Note however, that these operations usually involve the projection of \cgalRefines{ArrangementXMonotoneTraits_2} -\cgalHasModel `CGAL::Env_triangle_traits_3` -\cgalHasModel `CGAL::Env_sphere_traits_3` -\cgalHasModel `CGAL::Env_plane_traits_3` -\cgalHasModel `CGAL::Env_surface_data_traits_3` +\cgalHasModelsBegin CGAL::Env_triangle_traits_3 +\cgalHasModels CGAL::Env_sphere_traits_3 +\cgalHasModels CGAL::Env_plane_traits_3 +\cgalHasModels CGAL::Env_surface_data_traits_3 +\cgalHasModelsEnd */ diff --git a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h index 91c430a9d91..f43d4b8944d 100644 --- a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h +++ b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h @@ -6,7 +6,7 @@ The concept `GeneralizedMap` defines a d-dimensional generalized map. \cgalRefines{GenericMap} -\cgalHasModel \link CGAL::Generalized_map `CGAL::Generalized_map`\endlink +\cgalHasModelsBare{\link CGAL::Generalized_map `CGAL::Generalized_map`\endlink} For a generalized map, the function \link GenericMap::next `next`\endlink is equal to \f$ \alpha_1\circ\alpha_0\f$, \link GenericMap::previous `previous`\endlink is equal to \f$ \alpha_0\circ\alpha_1\f$ and the function \link GenericMap::opposite `opposite`\endlink is equal to \f$ \alpha_i\circ\alpha_0\f$. */ diff --git a/Generator/doc/Generator/Concepts/CombinationElement.h b/Generator/doc/Generator/Concepts/CombinationElement.h index fc9712bb25c..8e4747e0839 100644 --- a/Generator/doc/Generator/Concepts/CombinationElement.h +++ b/Generator/doc/Generator/Concepts/CombinationElement.h @@ -4,9 +4,9 @@ A CombinationElement can be used as template parameter for the class `Combination_enumerator`. -\cgalHasModel Any integer type (`char`, `short`, `int`, `long`, etc.) -\cgalHasModel Pointers -\cgalHasModel Random access iterators +\cgalHasModelsBare{Any integer type (`char`, `short`, `int`, `long`, etc.)\n + Pointers\n + Random access iterators} \sa `CGAL::Combination_enumerator` diff --git a/Generator/doc/Generator/Concepts/PointGenerator.h b/Generator/doc/Generator/Concepts/PointGenerator.h index a17946b0cd6..2f96e53167d 100644 --- a/Generator/doc/Generator/Concepts/PointGenerator.h +++ b/Generator/doc/Generator/Concepts/PointGenerator.h @@ -5,20 +5,21 @@ The concept `PointGenerator` defines the requirements for a point generator, which can be used in places where input iterators are called for. -\cgalHasModel `CGAL::Random_points_in_ball_d` -\cgalHasModel `CGAL::Random_points_in_disc_2` -\cgalHasModel `CGAL::Random_points_in_square_2` -\cgalHasModel `CGAL::Random_points_in_triangle_2` -\cgalHasModel `CGAL::Random_points_on_circle_2` -\cgalHasModel `CGAL::Random_points_on_segment_2` -\cgalHasModel `CGAL::Random_points_on_square_2` -\cgalHasModel `CGAL::Random_points_in_cube_3` -\cgalHasModel `CGAL::Random_points_in_cube_d` -\cgalHasModel `CGAL::Random_points_in_sphere_3` -\cgalHasModel `CGAL::Random_points_in_triangle_3` -\cgalHasModel `CGAL::Random_points_in_tetrahedron_3` -\cgalHasModel `CGAL::Random_points_on_sphere_3` -\cgalHasModel `CGAL::Random_points_on_sphere_d` +\cgalHasModelsBegin CGAL::Random_points_in_ball_d +\cgalHasModels CGAL::Random_points_in_disc_2 +\cgalHasModels CGAL::Random_points_in_square_2 +\cgalHasModels CGAL::Random_points_in_triangle_2 +\cgalHasModels CGAL::Random_points_on_circle_2 +\cgalHasModels CGAL::Random_points_on_segment_2 +\cgalHasModels CGAL::Random_points_on_square_2 +\cgalHasModels CGAL::Random_points_in_cube_3 +\cgalHasModels CGAL::Random_points_in_cube_d +\cgalHasModels CGAL::Random_points_in_sphere_3 +\cgalHasModels CGAL::Random_points_in_triangle_3 +\cgalHasModels CGAL::Random_points_in_tetrahedron_3 +\cgalHasModels CGAL::Random_points_on_sphere_3 +\cgalHasModels CGAL::Random_points_on_sphere_d +\cgalHasModelsEnd */ diff --git a/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h b/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h index 3dbf4632cb9..424119d49b9 100644 --- a/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h +++ b/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h @@ -5,7 +5,7 @@ The concept `RandomConvexHullTraits_2` describes the requirements for the traits class used by the function `random_convex_hull_in_disc_2()`. -\cgalHasModel \cgal kernels. +\cgalHasModelsBare{All models of the concept `Kernel`} \cgalHeading{Operations} diff --git a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h index f796452dbeb..630b93345d1 100644 --- a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h +++ b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h @@ -5,7 +5,8 @@ The concept `RandomConvexSetTraits_2` describes the requirements of the traits class for the function `random_convex_set_2()`. -\cgalHasModel `CGAL::Random_convex_set_traits_2` +\cgalHasModelsBegin CGAL::Random_convex_set_traits_2 +\cgalHasModelsEnd */ diff --git a/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h b/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h index c0c512b6296..be8badeb641 100644 --- a/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h +++ b/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h @@ -5,7 +5,7 @@ The concept `RandomPolygonTraits_2` describes the requirements for the traits class used by the function `random_polygon_2()`. -\cgalHasModel \cgal kernels. +\cgalHasModelsBare{All models of the concept `Kernel`} \cgalHeading{Operations} diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h index 8fcb7edd26e..227ae11cc40 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h @@ -67,9 +67,10 @@ allocators internally. A default argument is mandatory for from the `` header file can be used as default allocator. -\cgalHasModel CGAL::HalfedgeDS_default -\cgalHasModel CGAL::HalfedgeDS_list -\cgalHasModel CGAL::HalfedgeDS_vector +\cgalHasModelsBegin CGAL::HalfedgeDS_default +\cgalHasModels CGAL::HalfedgeDS_list +\cgalHasModels CGAL::HalfedgeDS_vector +\cgalHasModelsEnd \sa `HalfedgeDSItems` \sa `CGAL::Polyhedron_3` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h index 5a405bb7770..cacaac7459a 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h @@ -23,8 +23,9 @@ can be bypassed by the user, but not by accident.) \cgalRefines{CopyConstructible,DefaultConstructible} -\cgalHasModel `CGAL::HalfedgeDS_face_base` -\cgalHasModel `CGAL::HalfedgeDS_face_min_base` +\cgalHasModelsBegin CGAL::HalfedgeDS_face_base +\cgalHasModels CGAL::HalfedgeDS_face_min_base +\cgalHasModelsEnd \sa `HalfedgeDS` \sa `HalfedgeDSItems` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h index f4d3652e4e2..5dae57935e8 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h @@ -33,8 +33,9 @@ more protection is provided for the `set_opposite()` member function. The base class `Base_base` provides access to it. (The protection could be bypassed also by an user, but not by accident.) -\cgalHasModel ::CGAL::HalfedgeDS_halfedge_base -\cgalHasModel ::CGAL::HalfedgeDS_halfedge_min_base +\cgalHasModelsBegin ::CGAL::HalfedgeDS_halfedge_base +\cgalHasModels ::CGAL::HalfedgeDS_halfedge_min_base +\cgalHasModelsEnd \sa `HalfedgeDS` \sa `HalfedgeDSItems` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h index 16d45020f90..51a99908bc0 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h @@ -16,9 +16,10 @@ and `Face` respectively. The requirements on these types are described on the manual pages of the concepts `HalfedgeDSVertex`, `HalfedgeDSHalfedge`, and `HalfedgeDSFace` respectively. -\cgalHasModel CGAL::HalfedgeDS_min_items -\cgalHasModel CGAL::HalfedgeDS_items_2 -\cgalHasModel CGAL::Polyhedron_items_3 +\cgalHasModelsBegin CGAL::HalfedgeDS_min_items +\cgalHasModels CGAL::HalfedgeDS_items_2 +\cgalHasModels CGAL::Polyhedron_items_3 +\cgalHasModelsEnd \sa `HalfedgeDS` \sa `HalfedgeDSVertex` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h index 172b6b933f1..38f5afab43c 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h @@ -23,8 +23,9 @@ could be bypassed by an user, but not by accident.) \cgalRefines{CopyConstructible,DefaultConstructible} -\cgalHasModel `CGAL::HalfedgeDS_vertex_base` -\cgalHasModel `CGAL::HalfedgeDS_vertex_min_base` +\cgalHasModelsBegin CGAL::HalfedgeDS_vertex_base +\cgalHasModels CGAL::HalfedgeDS_vertex_min_base +\cgalHasModelsEnd \sa `HalfedgeDS` \sa `HalfedgeDSItems` diff --git a/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h b/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h index c7f87971225..cf4b6f8d9d7 100644 --- a/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h +++ b/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h @@ -7,7 +7,7 @@ The concept `HeatMethodTraits_3` describes the types, predicates, and constructions required by the traits class parameter of `CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3`. -\cgalHasModel All the \cgal kernels +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} */ diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h index 5d2d5a39e3e..3299b6f89e3 100644 --- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h +++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h @@ -16,8 +16,9 @@ constructions on these objects. This concept refines `DelaunayTriangulationTraits_2` because the class `CGAL::Hyperbolic_Delaunay_triangulation_2` internally relies on the class `CGAL::Delaunay_triangulation_2`. -\cgalHasModel `CGAL::Hyperbolic_Delaunay_triangulation_traits_2` -\cgalHasModel `CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2` +\cgalHasModelsBegin CGAL::Hyperbolic_Delaunay_triangulation_traits_2 +\cgalHasModels CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2 +\cgalHasModelsEnd */ diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h index 368630cc55b..9f57d33da11 100644 --- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h +++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h @@ -41,7 +41,8 @@ This concept provides an interface for the functionality needed in faces to comp Delaunay triangulations in the hyperbolic plane. The function `tds_data()` is used internally by the triangulation class during the insertion of points in the triangulation. -\cgalHasModel `CGAL::Hyperbolic_triangulation_face_base_2` +\cgalHasModelsBegin CGAL::Hyperbolic_triangulation_face_base_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `HyperbolicFaceData` diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h index baa5e8e86b7..f6de632e04c 100644 --- a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h +++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h @@ -15,8 +15,9 @@ inscribed into a given convex polygon. precondition checking only. Therefore, they need not to be specified, in case that precondition checking is disabled. -\cgalHasModel `CGAL::Extremal_polygon_area_traits_2` -\cgalHasModel `CGAL::Extremal_polygon_perimeter_traits_2` +\cgalHasModelsBegin CGAL::Extremal_polygon_area_traits_2 +\cgalHasModels CGAL::Extremal_polygon_perimeter_traits_2 +\cgalHasModelsEnd \sa `CGAL::maximum_area_inscribed_k_gon_2()` \sa `CGAL::maximum_perimeter_inscribed_k_gon_2()` diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h index 2875e0a1aba..d3e1374d771 100644 --- a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h +++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h @@ -10,8 +10,9 @@ This concept provides the types of the geometric primitives used in this class and some function object types for the required predicates on those primitives. -\cgalHasModel `CGAL::Cartesian` -\cgalHasModel `CGAL::Homogeneous` +\cgalHasModelsBegin CGAL::Cartesian +\cgalHasModels CGAL::Homogeneous +\cgalHasModelsEnd \sa `CGAL::Largest_empty_iso_rectangle_2` diff --git a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h index 8ce13fd4e1d..4cb824c031b 100644 --- a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h +++ b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h @@ -7,7 +7,8 @@ traits class that defines the primitives used by the algorithm. The concept `GradientFittingTraits` defines this common set of requirements. -\cgalHasModel `CGAL::Interpolation_gradient_fitting_traits_2` +\cgalHasModelsBegin CGAL::Interpolation_gradient_fitting_traits_2 +\cgalHasModelsEnd \sa `InterpolationTraits` \sa `CGAL::Interpolation_traits_2` diff --git a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h index 03be7b11a8d..a07eb526d3c 100644 --- a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h +++ b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h @@ -7,8 +7,9 @@ Most interpolation functions are parameterized by a traits class that defines the primitives used in the interpolation algorithms. The concept `InterpolationTraits` defines this common set of requirements. -\cgalHasModel `CGAL::Interpolation_traits_2` -\cgalHasModel `CGAL::Interpolation_gradient_fitting_traits_2` +\cgalHasModelsBegin CGAL::Interpolation_traits_2 +\cgalHasModels CGAL::Interpolation_gradient_fitting_traits_2 +\cgalHasModelsEnd \sa `GradientFittingTraits` \sa `CGAL::sibson_c1_interpolation()` diff --git a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h index 254de6b64cd..1bc267a684e 100644 --- a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h +++ b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h @@ -9,8 +9,9 @@ The concept does not specify, whether the interval is open or closed. It is up to the implementer of a model for this concept to define that. -\cgalHasModel `CGAL::Interval_skip_list_interval` -\cgalHasModel `CGAL::Level_interval` +\cgalHasModelsBegin CGAL::Interval_skip_list_interval +\cgalHasModels CGAL::Level_interval +\cgalHasModelsEnd \sa `Interval_skip_list` diff --git a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h index 041a8eb9feb..9276d91c6b3 100644 --- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h +++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h @@ -13,8 +13,9 @@ the class Only constructors (from 3 scalars and copy constructors) and access methods to coordinates `x()`, `y()`, `z()` are needed. -\cgalHasModel `CGAL::Cartesian` -\cgalHasModel `CGAL::Simple_cartesian` +\cgalHasModelsBegin CGAL::Cartesian +\cgalHasModels CGAL::Simple_cartesian +\cgalHasModelsEnd \sa `LocalKernel` diff --git a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h index ba13fc2daad..75629fb37f1 100644 --- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h +++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h @@ -29,8 +29,9 @@ Only constructors (from 3 scalars and copy constructors) and access methods to coordinates `x()`, `y()`, `z()` are needed for the point and vector types. -\cgalHasModel `CGAL::Cartesian` -\cgalHasModel `CGAL::Simple_cartesian` +\cgalHasModelsBegin CGAL::Cartesian +\cgalHasModels CGAL::Simple_cartesian +\cgalHasModelsEnd \sa `DataKernel` \sa `SvdTraits` diff --git a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h index d7fa271e560..a732c7891a3 100644 --- a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h +++ b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h @@ -8,7 +8,8 @@ namespace Kernel { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Circle_2` + \cgalHasModelsBegin CGAL::Circle_2 + \cgalHasModelsEnd \sa `Kernel::BoundedSide_2` \sa `Kernel::ComputeSquaredRadius_2` @@ -38,7 +39,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Circle_3` + \cgalHasModelsBegin CGAL::Circle_3 + \cgalHasModelsEnd \sa `Kernel::ComputeApproximateArea_3` \sa `Kernel::ComputeApproximateSquaredLength_3` @@ -67,7 +69,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Direction_2` + \cgalHasModels CGAL::Direction_2 + \cgalHasModelsEnd \sa `Kernel::CompareAngleWithXAxis_2` \sa `Kernel::ComputeDx_2` @@ -91,7 +94,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Direction_3` + \cgalHasModels CGAL::Direction_3 + \cgalHasModelsEnd \sa `Kernel::ConstructDirection_3` \sa `Kernel::ConstructOppositeDirection_3` @@ -111,7 +115,8 @@ A type representing isocuboids in three dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Iso_cuboid_3` +\cgalHasModelsBegin CGAL::Iso_cuboid_3 +\cgalHasModelsEnd \sa `Kernel::BoundedSide_3` \sa `Kernel::ComputeVolume_3` @@ -136,7 +141,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Iso_rectangle_2` + \cgalHasModels CGAL::Iso_rectangle_2 + \cgalHasModelsEnd \sa `Kernel::ConstructIsoRectangle_2` \sa `Kernel::ComputeXmin_2` @@ -168,7 +174,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Line_2` + \cgalHasModels CGAL::Line_2 + \cgalHasModelsEnd \sa `Kernel::CompareXAtY_2` \sa `Kernel::ComputeSquaredDistance_2` @@ -204,7 +211,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Line_3` + \cgalHasModels CGAL::Line_3 + \cgalHasModelsEnd \sa `Kernel::ComputeSquaredDistance_3` \sa `Kernel::ConstructDirection_3` @@ -235,7 +243,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Object` + \cgalHasModels CGAL::Object + \cgalHasModelsEnd \sa `Kernel::Assign_2` \sa `Kernel::ConstructObject_2` @@ -256,7 +265,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Object` + \cgalHasModels CGAL::Object + \cgalHasModelsEnd \sa `Kernel::Assign_3` \sa `Kernel::ConstructObject_3` @@ -275,7 +285,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Plane_3` + \cgalHasModels CGAL::Plane_3 + \cgalHasModelsEnd \sa `Kernel::ComputeSquaredDistance_3` \sa `Kernel::ConstructBaseVector_3` @@ -312,7 +323,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Point_2` + \cgalHasModels CGAL::Point_2 + \cgalHasModelsEnd \sa `Kernel::Angle_2` \sa `Kernel::AreOrderedAlongLine_2` @@ -371,7 +383,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Point_3` + \cgalHasModels CGAL::Point_3 + \cgalHasModelsEnd \sa `Kernel::Angle_3` \sa `Kernel::AreOrderedAlongLine_3` @@ -432,7 +445,8 @@ A type representing rays in two dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Ray_2` +\cgalHasModelsBegin CGAL::Ray_2 +\cgalHasModelsEnd \sa `Kernel::CollinearHasOn_2` \sa `Kernel::ComputeSquaredDistance_2` @@ -464,7 +478,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Ray_3` + \cgalHasModelsBegin CGAL::Ray_3 + \cgalHasModelsEnd \sa `Kernel::ComputeSquaredDistance_3` \sa `Kernel::ConstructDirection_3` @@ -492,7 +507,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Segment_2` + \cgalHasModelsBegin CGAL::Segment_2 + \cgalHasModelsEnd \sa `Kernel::CollinearHasOn_2` \sa `Kernel::ComputeSquaredDistance_2` @@ -526,7 +542,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Segment_3` + \cgalHasModelsBegin CGAL::Segment_3 + \cgalHasModelsEnd \sa `Kernel::ComputeSquaredDistance_3` \sa `Kernel::ComputeSquaredLength_3` @@ -556,7 +573,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Sphere_3` + \cgalHasModelsBegin CGAL::Sphere_3 + \cgalHasModelsEnd \sa `Kernel::BoundedSide_3` \sa `Kernel::ComputeSquaredRadius_3` @@ -586,7 +604,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Tetrahedron_3` + \cgalHasModelsBegin CGAL::Tetrahedron_3 + \cgalHasModelsEnd \sa `Kernel::BoundedSide_3` \sa `Kernel::ComputeVolume_3` @@ -617,7 +636,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Triangle_2` + \cgalHasModelsBegin CGAL::Triangle_2 + \cgalHasModelsEnd \sa `Kernel::BoundedSide_2` \sa `Kernel::ComputeArea_2` @@ -650,7 +670,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Triangle_3` + \cgalHasModelsBegin CGAL::Triangle_3 + \cgalHasModelsEnd \sa `Kernel::ComputeSquaredArea_3` \sa `Kernel::ConstructCentroid_3` @@ -675,7 +696,8 @@ public: \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalHasModel `CGAL::Vector_2` + \cgalHasModelsBegin CGAL::Vector_2 + \cgalHasModelsEnd \sa `Kernel::ComputeDeterminant_2` \sa `Kernel::ComputeScalarProduct_2` @@ -708,7 +730,8 @@ A type representing vectors in three dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Vector_3` +\cgalHasModelsBegin CGAL::Vector_3 +\cgalHasModelsEnd \sa `Kernel::CompareDihedralAngle_3` \sa `Kernel::ComputeDeterminant_3` @@ -744,7 +767,8 @@ A type representing weighted points in two dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Weighted_point_2` +\cgalHasModelsBegin CGAL::Weighted_point_2 +\cgalHasModelsEnd \sa `Kernel::ConstructWeightedPoint_2` \sa `Kernel::ComputeWeight_2` @@ -771,7 +795,8 @@ A type representing weighted points in three dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Weighted_point_3` +\cgalHasModelsBegin CGAL::Weighted_point_3 +\cgalHasModelsEnd \sa `Kernel::ConstructWeightedPoint_3` \sa `Kernel::ComputeWeight_3` diff --git a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h index 3ff7dcfc133..ad4a0782765 100644 --- a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h +++ b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h @@ -20,14 +20,15 @@ `Construct_`. If the result type is a number type, the name is prefixed by `Compute_`. When the result type is not determined, no prefix is used. - \cgalHasModel `CGAL::Cartesian` - \cgalHasModel `CGAL::Homogeneous` - \cgalHasModel `CGAL::Simple_cartesian` - \cgalHasModel `CGAL::Simple_homogeneous` - \cgalHasModel `CGAL::Filtered_kernel` - \cgalHasModel `CGAL::Exact_predicates_exact_constructions_kernel` - \cgalHasModel `CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt` - \cgalHasModel `CGAL::Exact_predicates_inexact_constructions_kernel` + \cgalHasModelsBegin galHasModel `CGAL::Cartesian + \cgalHasModels CGAL::Homogeneous + \cgalHasModels CGAL::Simple_cartesian + \cgalHasModels CGAL::Simple_homogeneous + \cgalHasModels CGAL::Filtered_kernel + \cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel + \cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt + \cgalHasModels CGAL::Exact_predicates_inexact_constructions_kernel + \cgalHasModelsEnd \sa `Kernel_d` \sa `CGAL::Ambient_dimension` diff --git a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h index 57cfbc7d058..63e05367baf 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h @@ -8,8 +8,9 @@ general kernel concept. It adds 2 functors, the meaning of which would be unclear in kernels of fixed dimension. \cgalRefines{Kernel_d} -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Homogeneous_d` +\cgalHasModelsBegin CGAL::Cartesian_d +\cgalHasModels CGAL::Homogeneous_d +\cgalHasModelsEnd */ class KernelWithLifting_d { public: diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h index 6b1378e66ae..a56284feab8 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h @@ -18,10 +18,11 @@ predicates. The former replace constructors of the kernel classes and constructive procedures in the kernel. There are also function objects replacing operators, especially for equality testing. -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Homogeneous_d` -\cgalHasModel `CGAL::Epick_d` -\cgalHasModel `CGAL::Epeck_d` +\cgalHasModelsBegin CGAL::Cartesian_d +\cgalHasModels CGAL::Homogeneous_d +\cgalHasModels CGAL::Epick_d +\cgalHasModels CGAL::Epeck_d +\cgalHasModelsEnd */ class Kernel_d { public: diff --git a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h index 932880c6f89..f8a25811d42 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h @@ -13,8 +13,9 @@ correct. For example, if the linear system solver declares a linear system \f$ A x = b\f$ unsolvable it also returns a vector \f$ c\f$ such that \f$ c^T A = 0\f$ and \f$ c^T b \neq 0\f$. -\cgalHasModel `CGAL::Linear_algebraHd` -\cgalHasModel `CGAL::Linear_algebraCd` +\cgalHasModelsBegin CGAL::Linear_algebraHd +\cgalHasModels CGAL::Linear_algebraCd +\cgalHasModelsEnd */ diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h index 4e7e19343b9..6f97471a99c 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h @@ -7,7 +7,7 @@ The concept `CellAttributeWithPoint` is a refinement of the `CellAttribute` conc \cgalRefines{CellAttribute} -\cgalHasModel \link CGAL::Cell_attribute_with_point `CGAL::Cell_attribute_with_point`\endlink +\cgalHasModelsBare{\link CGAL::Cell_attribute_with_point `CGAL::Cell_attribute_with_point`\endlink} \sa `LinearCellComplexItems` diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h index c64aa00f4ff..740405fc5b3 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h @@ -7,8 +7,8 @@ The concept `LinearCellComplex` represents a linear cell complex in dimension `d \cgalRefines{GenericMap} -\cgalHasModel \link CGAL::Linear_cell_complex_for_combinatorial_map `CGAL::Linear_cell_complex_for_combinatorial_map`\endlink -\cgalHasModel \link CGAL::Linear_cell_complex_for_generalized_map `CGAL::Linear_cell_complex_for_generalized_map`\endlink +\cgalHasModelsBare{\link CGAL::Linear_cell_complex_for_combinatorial_map `CGAL::Linear_cell_complex_for_combinatorial_map`\endlink\n + \link CGAL::Linear_cell_complex_for_generalized_map `CGAL::Linear_cell_complex_for_generalized_map`\endlink} \sa `LinearCellComplexItems` \sa `LinearCellComplexTraits` diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h index caf8d260895..25df3bed183 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h @@ -9,7 +9,8 @@ The concept `LinearCellComplexItems` refines the concept of `GenericMapItems` by The first type in `Attributes` tuple must be a model of the `CellAttributeWithPoint` concept. -\cgalHasModel `CGAL::Linear_cell_complex_min_items` +\cgalHasModelsBegin CGAL::Linear_cell_complex_min_items +\cgalHasModelsEnd \sa `LinearCellComplex` \sa `CellAttributeWithPoint` diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h index ef4c0f72cf0..cb7de2d8382 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h @@ -5,7 +5,7 @@ Required types and functors for the `LinearCellComplexTraits` concept. This geometric traits concept is used in the \link CGAL::Linear_cell_complex_for_combinatorial_map `Linear_cell_complex_for_combinatorial_map`\endlink and \link CGAL::Linear_cell_complex_for_generalized_map `Linear_cell_complex_for_generalized_map`\endlink classes. -\cgalHasModel \link CGAL::Linear_cell_complex_traits `CGAL::Linear_cell_complex_traits`\endlink +\cgalHasModelsBare{\link CGAL::Linear_cell_complex_traits `CGAL::Linear_cell_complex_traits`\endlink} \sa `CGAL::Linear_cell_complex_for_combinatorial_map` \sa `CGAL::Linear_cell_complex_for_generalized_map` diff --git a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h index 287afa30758..37512a501ec 100644 --- a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h +++ b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h @@ -8,7 +8,8 @@ A class `BasicMatrix` has to provide the following types and operations in order to be a model for `BasicMatrix`. -\cgalHasModel `CGAL::Dynamic_matrix` +\cgalHasModelsBegin CGAL::Dynamic_matrix +\cgalHasModelsEnd \sa `MonotoneMatrixSearchTraits` \sa `SortedMatrixSearchTraits` diff --git a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h index 483a45b68a0..3f44b807ffd 100644 --- a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h +++ b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h @@ -21,7 +21,8 @@ add most of the functionality described above to arbitrary matrix classes. -\cgalHasModel `CGAL::Dynamic_matrix` +\cgalHasModelsBegin CGAL::Dynamic_matrix +\cgalHasModelsEnd \sa `CGAL::monotone_matrix_search()` diff --git a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h index ad49f24d349..e96a49bfdbe 100644 --- a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h +++ b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h @@ -8,7 +8,8 @@ needed to compute the smallest entry in a set of sorted matrices that fulfills a certain feasibility criterion using the function `CGAL::sorted_matrix_search`. -\cgalHasModel `CGAL::Sorted_matrix_search_traits_adaptor` +\cgalHasModelsBegin CGAL::Sorted_matrix_search_traits_adaptor +\cgalHasModelsEnd \sa `CGAL::sorted_matrix_search()` \sa `BasicMatrix` diff --git a/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h b/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h index 04cebff70d0..745c85b0d9f 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h @@ -17,8 +17,8 @@ points on constrained edges. \cgalRefines{DelaunayTriangulationTraits_2} -\cgalHasModel Any model of `Kernel` concept. In particular, all \cgal kernels -\cgalHasModel `Projection_traits_xy_3` +\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3 +\cgalHasModelsEnd */ diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h index 4c9bd5eec8b..abe11ca79a8 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h @@ -13,7 +13,8 @@ meshing domain or not. \cgalRefines{ConstrainedTriangulationFaceBase_2} -\cgalHasModel `CGAL::Delaunay_mesh_face_base_2` +\cgalHasModelsBegin CGAL::Delaunay_mesh_face_base_2 +\cgalHasModelsEnd */ diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h index 042980a9684..25d8388d962 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h @@ -12,8 +12,8 @@ object `Construct_circumcenter_2`. \cgalRefines{ConformingDelaunayTriangulationTraits_2} -\cgalHasModel Any model of the `Kernel` concept. In particular, all \cgal kernels -\cgalHasModel `CGAL::Projection_traits_xy_3` +\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3 +\cgalHasModelsEnd */ diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h index 9385dae29ae..34188802119 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h @@ -13,7 +13,8 @@ the mesh density everywhere while modifying the mesh. \cgalRefines{TriangulationVertexBase_2} -\cgalHasModel `CGAL::Delaunay_mesh_vertex_base_2` +\cgalHasModelsBegin CGAL::Delaunay_mesh_vertex_base_2 +\cgalHasModelsEnd */ diff --git a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h index c7ff08ec100..929119fb29a 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h @@ -37,8 +37,9 @@ comparable as the meshing algorithm will order bad triangles by quality, to split those with smallest quality first. The predicate `Is_bad` computes the quality of the triangle as a by-product. -\cgalHasModel `CGAL::Delaunay_mesh_criteria_2` -\cgalHasModel `CGAL::Delaunay_mesh_size_criteria_2` +\cgalHasModelsBegin CGAL::Delaunay_mesh_criteria_2 +\cgalHasModels CGAL::Delaunay_mesh_size_criteria_2 +\cgalHasModelsEnd */ diff --git a/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h index 8d6b076a3ef..0ca302d56fb 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h @@ -16,7 +16,7 @@ function from \f$ \mathbb{R}^3\f$ to \f$ \mathbb{R}\f$), the do-intersect predic is computed by evaluations of the function values at both end points of the segment. -\cgalHasModel Any \cgal Kernel. +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} \sa `ImplicitSurfaceTraits_3` \sa `IntersectionGeometricTraits_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h index a1b35060f85..d5637c9b8e1 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h @@ -9,7 +9,7 @@ forming its boundary. The concept `IntersectionGeometricTraits_3` mainly provides the detection and construction of intersections between segments and triangles. -\cgalHasModel All models of the `Kernel` concept. +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} \sa `BisectionGeometricTraits_3` \sa `CGAL::Polyhedral_mesh_domain_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h index 028d9e70d9f..7ad4c56ad1c 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h @@ -43,8 +43,9 @@ each cell (see below). \cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3,CopyConstructible} -\cgalHasModel `CGAL::Compact_mesh_cell_base_3` -\cgalHasModel `CGAL::Mesh_cell_base_3` +\cgalHasModelsBegin CGAL::Compact_mesh_cell_base_3 +\cgalHasModels CGAL::Mesh_cell_base_3 +\cgalHasModelsEnd \sa `CGAL::make_mesh_3()` \sa `MeshDomain_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h index d3b0b83f0a6..4691571e9f1 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h @@ -9,7 +9,8 @@ that concern either mesh tetrahedra or surface facets. The concept `MeshCellCriteria_3` describes the types that handle the refinement criteria for mesh tetrahedra. -\cgalHasModel `CGAL::Mesh_cell_criteria_3` +\cgalHasModelsBegin CGAL::Mesh_cell_criteria_3 +\cgalHasModelsEnd \sa `MeshEdgeCriteria_3` \sa `MeshFacetCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h index c53644cb36f..e1570416dd7 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h @@ -14,7 +14,8 @@ that describes the requirements, in terms of sizing, for the discretization of t \cgalRefines{MeshCriteria_3} -\cgalHasModel `CGAL::Mesh_criteria_3` +\cgalHasModelsBegin CGAL::Mesh_criteria_3 +\cgalHasModelsEnd \sa `MeshEdgeCriteria_3` \sa `MeshFacetCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h index ea4a1f33ea3..189afcbffcb 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h @@ -12,7 +12,8 @@ while the refinement criteria for surface facets are described by the concept `MeshFacetCriteria_3`. The concept `MeshCriteria_3` encapsulates these concepts. -\cgalHasModel `CGAL::Mesh_criteria_3` +\cgalHasModelsBegin CGAL::Mesh_criteria_3 +\cgalHasModelsEnd \sa `MeshFacetCriteria_3` \sa `MeshCellCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h index 644a3a46046..fbb2f2cc8ee 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h @@ -5,7 +5,8 @@ The concept `MeshDomainField_3` describes a scalar field which could be queried at any point of the space. -\cgalHasModel `CGAL::Mesh_constant_domain_field_3` +\cgalHasModelsBegin CGAL::Mesh_constant_domain_field_3 +\cgalHasModelsEnd \sa `MeshDomain_3` \sa `MeshDomainWithFeatures_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h index 18e97b9a275..80df66b599a 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h @@ -17,8 +17,9 @@ between two ordered points on the same curve. \cgalRefines{MeshDomain_3} -\cgalHasModel `CGAL::Mesh_domain_with_polyline_features_3` -\cgalHasModel `CGAL::Polyhedral_mesh_domain_with_features_3` +\cgalHasModelsBegin CGAL::Mesh_domain_with_polyline_features_3 +\cgalHasModels CGAL::Polyhedral_mesh_domain_with_features_3 +\cgalHasModelsEnd \sa `MeshDomain_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h index 240f9b0f1fb..56c6ed59ad1 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h @@ -29,8 +29,9 @@ A segment, ray or line is said to intersect properly the domain boundary if it includes points which are strictly inside and strictly outside the domain (resp. the subdomain). -\cgalHasModel `CGAL::Polyhedral_mesh_domain_3` -\cgalHasModel `CGAL::Labeled_mesh_domain_3` +\cgalHasModelsBegin CGAL::Polyhedral_mesh_domain_3 +\cgalHasModels CGAL::Labeled_mesh_domain_3 +\cgalHasModelsEnd \sa `MeshVertexBase_3` \sa `MeshCellBase_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h index 4c044751069..41b3bab4451 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h @@ -7,7 +7,8 @@ the 1-dimensional features of the domain. It provides an upper bound for the distance between two protecting ball centers that are consecutive on a 1-feature. -\cgalHasModel `CGAL::Mesh_edge_criteria_3` +\cgalHasModelsBegin CGAL::Mesh_edge_criteria_3 +\cgalHasModelsEnd \sa `MeshCellCriteria_3` \sa `MeshFacetCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h index 325dedeff05..f8bad1f29cc 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h @@ -9,7 +9,8 @@ that concern either mesh tetrahedra or surface facets. The concept `MeshFacetCriteria_3` describes the types that handle the refinement criteria for surface facets. -\cgalHasModel `CGAL::Mesh_facet_criteria_3` +\cgalHasModelsBegin CGAL::Mesh_facet_criteria_3 +\cgalHasModelsEnd \sa `MeshCellCriteria_3` \sa `MeshEdgeCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h index bfe6e4b8d98..ce8469eb8aa 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h @@ -6,7 +6,7 @@ The concept `MeshPolyline_3` implements a container of points designed to repres Types and functions provided in this concept are such as standard template library containers are natural models of this concept. -\cgalHasModel `std::vector` for any Kernel of \cgal is a natural model of this concept. +\cgalHasModelsBare{`std::vector` for any Kernel of \cgal is a natural model of this concept.} \sa `CGAL::Mesh_domain_with_polyline_features_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h index 99b7a9d8270..3e1a8cf734d 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h @@ -9,7 +9,7 @@ a mesh generation process. \cgalRefines{RegularTriangulationTraits_3} -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} In addition to the requirements described for the traits class RegularTriangulationTraits_3, the geometric traits class of a diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h index 4739741b01c..f4f2ff9d9b8 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h @@ -22,7 +22,8 @@ each cell (see below). \cgalRefines{SimplicialMeshVertexBase_3,RegularTriangulationVertexBase_3,SurfaceMeshVertexBase_3} -\cgalHasModel `CGAL::Mesh_vertex_base_3` +\cgalHasModelsBegin CGAL::Mesh_vertex_base_3 +\cgalHasModelsEnd \sa `CGAL::make_mesh_3()` \sa `CGAL::refine_mesh_3()` diff --git a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h index 03f9ff4880a..1d3a376d3de 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h @@ -5,7 +5,8 @@ The concept `TriangleAccessor_3` represents an accessor to a triangulated polyhedral surface, intersection free and without boundaries. -\cgalHasModel `CGAL::Triangle_accessor_3,K>` +\cgalHasModelsBegin CGAL::Triangle_accessor_3,K> +\cgalHasModelsEnd \sa `CGAL::Polyhedral_mesh_domain_3` \sa `CGAL::make_mesh_3()` diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h index 20b4cf23fb7..0f81aaa6a90 100644 --- a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h +++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h @@ -6,11 +6,12 @@ A model of the `PolygonConvexDecomposition_2` concept is capable of decomposing an input polygon \f$ P\f$ into a set of convex sub-polygons \f$ P_1, \ldots, P_k\f$, such that \f$ \cup_{i=1}^{k}{P_k} = P\f$. -\cgalHasModel `CGAL::Small_side_angle_bisector_decomposition_2` -\cgalHasModel `CGAL::Optimal_convex_decomposition_2` -\cgalHasModel `CGAL::Hertel_Mehlhorn_convex_decomposition_2` -\cgalHasModel `CGAL::Greene_convex_decomposition_2` -\cgalHasModel `CGAL::Polygon_nop_decomposition_2` +\cgalHasModelsBegin CGAL::Small_side_angle_bisector_decomposition_2 +\cgalHasModels CGAL::Optimal_convex_decomposition_2 +\cgalHasModels CGAL::Hertel_Mehlhorn_convex_decomposition_2 +\cgalHasModels CGAL::Greene_convex_decomposition_2 +\cgalHasModels CGAL::Polygon_nop_decomposition_2 +\cgalHasModelsEnd */ diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h index 7c27e91a6c8..64b8d099507 100644 --- a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h +++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h @@ -9,8 +9,9 @@ convex sub-polygons \f$ P_1, \ldots, P_k\f$, such that \cgalRefines{PolygonConvexDecomposition_2} -\cgalHasModel `CGAL::Polygon_vertical_decomposition_2` -\cgalHasModel `CGAL::Polygon_triangulation_decomposition_2` +\cgalHasModelsBegin CGAL::Polygon_vertical_decomposition_2 +\cgalHasModels CGAL::Polygon_triangulation_decomposition_2 +\cgalHasModelsEnd */ diff --git a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h index c315deb05fd..1bf64f2a9c9 100644 --- a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h +++ b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h @@ -9,7 +9,8 @@ function object. It maps objects of its domain type `Key` to the integral image type `std::size_t`. The image values have to be unique for all keys in the domain type `Key`. -\cgalHasModel `CGAL::Handle_hash_function` +\cgalHasModelsBegin CGAL::Handle_hash_function +\cgalHasModelsEnd \sa `CGAL::Unique_hash_map` diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h index 022ed5c526b..0e0467a9f39 100644 --- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h +++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h @@ -8,7 +8,8 @@ In case this associated type is a model of `Modularizable`, this is indicated by Boolean tag `ModularTraits::Is_modularizable`. The mapping into the `Residue_type` is provided by the functor `ModularTraits::Modular_image`. -\cgalHasModel CGAL::Modular_traits +\cgalHasModelsBegin CGAL::Modular_traits +\cgalHasModelsEnd \sa `CGAL::Residue` \sa `Modularizable` diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h index 0001b5b400b..8db45a2f428 100644 --- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h +++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h @@ -18,18 +18,20 @@ of denominator, are not `Modularizable`. This is due to the fact that the denominator may be zero modulo the prime, which can not be represented. -\cgalHasModel `int` -\cgalHasModel `long` -\cgalHasModel `CORE::BigInt` -\cgalHasModel `CGAL::Gmpz` -\cgalHasModel `leda_integer` -\cgalHasModel `mpz_class` +\cgalHasModelsBegin int +\cgalHasModels long +\cgalHasModels CORE::BigInt +\cgalHasModels CGAL::Gmpz +\cgalHasModels leda_integer +\cgalHasModels mpz_class +\cgalHasModelsEnd The following types are `Modularizable` iff their template arguments are. -\cgalHasModel `CGAL::Lazy_exact_nt` -\cgalHasModel `CGAL::Sqrt_extension` -\cgalHasModel `CGAL::Polynomial` +\cgalHasModelsBegin CGAL::Lazy_exact_nt +\cgalHasModels CGAL::Sqrt_extension +\cgalHasModels CGAL::Polynomial +\cgalHasModelsEnd \sa `CGAL::Residue` \sa `CGAL::Modular_traits` diff --git a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h index 8d5e82f7fed..7161d6725e7 100644 --- a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h +++ b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h @@ -38,9 +38,10 @@ functionality for changing between standard affine and extended geometry. At the same time it provides extensible geometric primitives on the extended geometric objects. -\cgalHasModel `CGAL::Extended_cartesian` -\cgalHasModel `CGAL::Extended_homogeneous` -\cgalHasModel `CGAL::Filtered_extended_homogeneous` +\cgalHasModelsBegin CGAL::Extended_cartesian +\cgalHasModels CGAL::Extended_homogeneous +\cgalHasModels CGAL::Filtered_extended_homogeneous +\cgalHasModelsEnd */ diff --git a/Number_types/doc/Number_types/Concepts/RootOf_2.h b/Number_types/doc/Number_types/Concepts/RootOf_2.h index a772693794d..c29f30b3ab2 100644 --- a/Number_types/doc/Number_types/Concepts/RootOf_2.h +++ b/Number_types/doc/Number_types/Concepts/RootOf_2.h @@ -30,8 +30,8 @@ special construction for extensions of degree 2: \cgalRefines{DefaultConstructible,CopyConstructible,FromIntConstructible, ImplicitInteroperable with `RT`,ImplicitInteroperable with `FT`} -\cgalHasModel `double` (not exact) -\cgalHasModel `CGAL::Sqrt_extension` +\cgalHasModelsBareBegin{`double` (not exact)} CGAL::Sqrt_extension +\cgalHasModelsEnd \sa `CGAL::make_root_of_2` \sa `CGAL::make_sqrt` diff --git a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h index dceb2345f0c..fad3d71782a 100644 --- a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h +++ b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h @@ -8,7 +8,8 @@ a 3x3 matrix type. \cgalRefines{Kernel} -\cgalHasModel `CGAL::Oriented_bounding_box_traits_3` +\cgalHasModelsBegin CGAL::Oriented_bounding_box_traits_3 +\cgalHasModelsEnd */ class OrientedBoundingBoxTraits_3 diff --git a/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h b/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h index fe99dd293c4..39b2c65b4e1 100644 --- a/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h +++ b/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h @@ -8,8 +8,8 @@ for the traits class of `CGAL::Optimal_transportation_reconstruction_2`. \cgalRefines{DelaunayTriangulationTraits_2} -\cgalHasModel Any model of the `Kernel` concept -\cgalHasModel `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended) +\cgalHasModelsBare{All models of the \cgal concept `Kernel`, + `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended)} \sa `CGAL::Optimal_transportation_reconstruction_2` diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h index eac6e2e914d..8b6e0e06631 100644 --- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h +++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h @@ -5,9 +5,10 @@ The concept `OrthtreeTraits` defines the requirements for the template parameter of the `CGAL::Orthtree` class. - \cgalHasModel `CGAL::Orthtree_traits_2` - \cgalHasModel `CGAL::Orthtree_traits_3` - \cgalHasModel `CGAL::Orthtree_traits_d` + \cgalHasModelsBegin galHasModel `CGAL::Orthtree_traits_2 + \cgalHasModels CGAL::Orthtree_traits_3 + \cgalHasModels CGAL::Orthtree_traits_d + \cgalHasModelsEnd */ class OrthtreeTraits { diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h index d763be714e5..c03e9deb207 100644 --- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h +++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h @@ -9,10 +9,11 @@ A traversal is used to iterate on a tree with a user-selected order (e.g. preorder, postorder). - \cgalHasModel `CGAL::Orthtrees::Preorder_traversal` - \cgalHasModel `CGAL::Orthtrees::Postorder_traversal` - \cgalHasModel `CGAL::Orthtrees::Leaves_traversal` - \cgalHasModel `CGAL::Orthtrees::Level_traversal` + \cgalHasModelsBegin galHasModel `CGAL::Orthtrees::Preorder_traversal + \cgalHasModels CGAL::Orthtrees::Postorder_traversal + \cgalHasModels CGAL::Orthtrees::Leaves_traversal + \cgalHasModels CGAL::Orthtrees::Level_traversal + \cgalHasModelsEnd */ class OrthtreeTraversal { diff --git a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h index c1919ce2444..ff7c9417c08 100644 --- a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h @@ -6,7 +6,8 @@ Requirements of a traits class used by `convex_partition_is_valid_2` for testing the validity of a convex partition of a polygon. -\cgalHasModel `CGAL::Partition_traits_2` +\cgalHasModelsBegin CGAL::Partition_traits_2 +\cgalHasModelsEnd \sa `CGAL::approx_convex_partition_2()` \sa `CGAL::greene_approx_convex_partition_2()` diff --git a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h index d677751f991..0c0d7e3fc97 100644 --- a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h @@ -6,8 +6,9 @@ Requirements of a traits class to be used with the function `is_y_monotone_2()` that tests whether a sequence of 2D points defines a \f$ y\f$-monotone polygon or not. -\cgalHasModel `CGAL::Partition_traits_2` -\cgalHasModel `CGAL::Kernel_traits_2` +\cgalHasModelsBegin CGAL::Partition_traits_2 +\cgalHasModels CGAL::Kernel_traits_2 +\cgalHasModelsEnd \sa `CGAL::Is_y_monotone_2` \sa `CGAL::y_monotone_partition_2()` diff --git a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h index 3f1e4722dc2..85676075bb4 100644 --- a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h @@ -8,7 +8,8 @@ an optimal convex partition of a polygon. \cgalRefines{PartitionTraits_2} -\cgalHasModel `CGAL::Partition_traits_2` +\cgalHasModelsBegin CGAL::Partition_traits_2 +\cgalHasModelsEnd \sa `CGAL::convex_partition_is_valid_2()` \sa `CGAL::Partition_is_valid_traits_2` diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h index 31f7e3c0136..b91ad810935 100644 --- a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h @@ -14,7 +14,8 @@ function `CGAL::is_convex_2()` and the concept `YMonotonePartitionTraits_2` for the additional requirements for testing for convexity and \f$ y\f$-monotonicity, respectively. -\cgalHasModel `CGAL::Partition_is_valid_traits_2` +\cgalHasModelsBegin CGAL::Partition_is_valid_traits_2 +\cgalHasModelsEnd \sa `CGAL::approx_convex_partition_2()` \sa `CGAL::greene_approx_convex_partition_2()` diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h index c4c3827f664..2ad93228b1b 100644 --- a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h @@ -8,7 +8,8 @@ common to all traits classes. The concept `PartitionTraits_2` defines this common set of requirements. -\cgalHasModel `CGAL::Partition_traits_2` +\cgalHasModelsBegin CGAL::Partition_traits_2 +\cgalHasModelsEnd \sa `CGAL::approx_convex_partition_2()` \sa `CGAL::greene_approx_convex_partition_2()` diff --git a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h index b0e5ff298d1..ab72c01a9f0 100644 --- a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h +++ b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h @@ -6,8 +6,9 @@ Function object that determines if a sequence of points represents a valid partition polygon or not, where "valid" can assume any of several meanings (e.g., convex or \f$ y\f$-monotone). -\cgalHasModel `CGAL::Is_convex_2` -\cgalHasModel `CGAL::Is_y_monotone_2` +\cgalHasModelsBegin CGAL::Is_convex_2 +\cgalHasModels CGAL::Is_y_monotone_2 +\cgalHasModelsEnd \sa `CGAL::approx_convex_partition_2()` \sa `CGAL::convex_partition_is_valid_2()` diff --git a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h index a7500c62d6b..6212b11620a 100644 --- a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h @@ -6,7 +6,8 @@ Requirements of a traits class that is used by `y_monotone_partition_is_valid_2` for testing the validity of a \f$ y\f$-monotone partition of a polygon. -\cgalHasModel `CGAL::Partition_traits_2` +\cgalHasModelsBegin CGAL::Partition_traits_2 +\cgalHasModelsEnd \sa `CGAL::partition_is_valid_2()` \sa `CGAL::y_monotone_partition_2()` diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h index 402a3eca806..bda0b95ab29 100644 --- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h +++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h @@ -27,7 +27,8 @@ dual functions are called. The additional predicate type `::Periodic_2DelaunayTriangulationTraits_2::Compare_distance_2` is required if calls to `nearest_vertex(..)` are issued. -\cgalHasModel `CGAL::Periodic_2_Delaunay_triangulation_traits_2` +\cgalHasModelsBegin CGAL::Periodic_2_Delaunay_triangulation_traits_2 +\cgalHasModelsEnd \sa `DelaunayTriangulationTraits_2` */ diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h index c3d9e3b3c7b..56d28d5a217 100644 --- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h +++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h @@ -7,7 +7,8 @@ The concept `Periodic_2Offset_2` describes a two-/dimensional integer vector with some specialized access functions and operations. -\cgalHasModel `CGAL::Periodic_2_offset_2` +\cgalHasModelsBegin CGAL::Periodic_2_offset_2 +\cgalHasModelsEnd \sa `Periodic_2TriangulationTraits_2` \sa `Periodic_2DelaunayTriangulationTraits_2` diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h index 7d7771d981e..96769827f33 100644 --- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h +++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h @@ -13,7 +13,8 @@ vertex \f$ i\f$. \cgalRefines{TriangulationFaceBase_2} -\cgalHasModel `CGAL::Periodic_2_triangulation_face_base_2` +\cgalHasModelsBegin CGAL::Periodic_2_triangulation_face_base_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `TriangulationFaceBase_2` diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h index 71bfd55b268..58dad3ed62d 100644 --- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h +++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h @@ -24,7 +24,8 @@ In addition to the requirements described for the traits class Periodic triangulation must fulfill the following requirements: -\cgalHasModel `CGAL::Periodic_2_triangulation_traits_2` +\cgalHasModelsBegin CGAL::Periodic_2_triangulation_traits_2 +\cgalHasModelsEnd \sa `TriangulationTraits_2` \sa `CGAL::Periodic_2_triangulation_2` diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h index 26c88f7b157..33d799fec24 100644 --- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h +++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h @@ -16,7 +16,8 @@ The storage of the offset is only needed when a triangulation is copied. \cgalRefines{TriangulationVertexBase_2} -\cgalHasModel` CGAL::Periodic_2_triangulation_vertex_base_2` +\cgalHasModelsBegin CGAL::Periodic_2_triangulation_vertex_base_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `TriangulationVertexBase_2` diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h index 51a0f2dff73..2794a7f365a 100644 --- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h +++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h @@ -22,8 +22,8 @@ Wrapping any model of `Periodic_3MeshDomain_3` with the class `CGAL::Mesh_domain_with_polyline_features_3` gives a model of `Periodic_3MeshDomainWithFeatures_3`. -\cgalHasModel `CGAL::Mesh_domain_with_polyline_features_3< - CGAL::Labeled_mesh_domain_3 >` +\cgalHasModelsBegin CGAL::Mesh_domain_with_polyline_features_3 > +\cgalHasModelsEnd \sa `CGAL::Periodic_3_function_wrapper` diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h index d646476f139..63170e01edb 100644 --- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h +++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h @@ -20,7 +20,8 @@ The class `CGAL::Labeled_mesh_domain_3` paired with a periodic labeling fun is a model of this concept. It is possible to create artificially periodic functions through the class `CGAL::Periodic_3_function_wrapper`. -\cgalHasModel `CGAL::Labeled_mesh_domain_3` +\cgalHasModelsBegin CGAL::Labeled_mesh_domain_3 +\cgalHasModelsEnd \sa `CGAL::Labeled_mesh_domain_3` diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h index 9ca96674cc7..1d72f228180 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h @@ -15,7 +15,8 @@ functor the version without offsets. \cgalRefines{Periodic_3TriangulationTraits_3,DelaunayTriangulationTraits_3} -\cgalHasModel `CGAL::Periodic_3_Delaunay_triangulation_traits_3` +\cgalHasModelsBegin CGAL::Periodic_3_Delaunay_triangulation_traits_3 +\cgalHasModelsEnd In addition to the requirements described by the concepts `Periodic_3TriangulationTraits_3` and `DelaunayTriangulationTraits_3`, diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h index 1896b2291dc..b5a467b4cd8 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h @@ -6,7 +6,8 @@ The concept `Periodic_3Offset_3` describes a three-dimensional integer vector with some specialized access functions and operations. -\cgalHasModel `CGAL::Periodic_3_offset_3` +\cgalHasModelsBegin CGAL::Periodic_3_offset_3 +\cgalHasModelsEnd \sa `Periodic_3TriangulationTraits_3` \sa `Periodic_3DelaunayTriangulationTraits_3` diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h index 803505e302e..29c9fae1dc6 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h @@ -5,10 +5,9 @@ \cgalRefines{RegularTriangulationCellBase_3,Periodic_3TriangulationDSCellBase_3} -\cgalHasModel `CGAL::Regular_triangulation_cell_base_3 >` -\cgalHasModel `CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3 >` +\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_3 > +\cgalHasModels CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3 > +\cgalHasModelsEnd The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the traits class used in `CGAL::Periodic_3_regular_triangulation_3`. diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h index 762aceede94..8f5ce76dab5 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h @@ -5,8 +5,8 @@ \cgalRefines{RegularTriangulationVertexBase_3,Periodic_3TriangulationDSVertexBase_3} -\cgalHasModel `CGAL::Regular_triangulation_vertex_base_3 >` +\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_3 > +\cgalHasModelsEnd The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the traits class used in `CGAL::Periodic_3_regular_triangulation_3`. diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h index c84d4e8885c..c128b08f82e 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h @@ -15,7 +15,8 @@ functor the version without offsets. \cgalRefines{Periodic_3TriangulationTraits_3,RegularTriangulationTraits_3} -\cgalHasModel `CGAL::Periodic_3_regular_triangulation_traits_3` +\cgalHasModelsBegin CGAL::Periodic_3_regular_triangulation_traits_3 +\cgalHasModelsEnd In addition to the requirements described for the traits class RegularTriangulationTraits_3, the geometric traits class of a diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h index 048264c8c7b..9f575b84869 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h @@ -18,7 +18,8 @@ does not contain any information. \cgalRefines{TriangulationDSCellBase_3} -\cgalHasModel `CGAL::Periodic_3_triangulation_ds_cell_base_3` +\cgalHasModelsBegin CGAL::Periodic_3_triangulation_ds_cell_base_3 +\cgalHasModelsEnd \sa `TriangulationDataStructure_3` \sa `TriangulationDSCellBase_3` diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h index cc3de413a70..14b032fc1bc 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h @@ -12,7 +12,8 @@ a vertex provides access to one of its incident cells through a handle. \cgalRefines{TriangulationDSVertexBase_3} -\cgalHasModel `CGAL::Periodic_3_triangulation_ds_vertex_base_3` +\cgalHasModelsBegin CGAL::Periodic_3_triangulation_ds_vertex_base_3 +\cgalHasModelsEnd \sa `TriangulationDataStructure_3` \sa `TriangulationDSVertexBase_3` diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h index f786b27ea94..ace2ebb8199 100644 --- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h +++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h @@ -14,7 +14,8 @@ functor the version without offsets. \cgalRefines{TriangulationTraits_3} -\cgalHasModel `CGAL::Periodic_3_triangulation_traits_3` +\cgalHasModelsBegin CGAL::Periodic_3_triangulation_traits_3 +\cgalHasModelsEnd \sa `Periodic_3DelaunayTriangulationTraits_3` \sa `Periodic_3RegularTriangulationTraits_3` diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h index 6628fffd89f..7532e1b0797 100644 --- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h +++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h @@ -12,7 +12,8 @@ to `Periodic_4HyperbolicTriangulationTraits_2` that needs to be fulfilled by any class used to instantiate the first template parameter of the class `CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_2`. -\cgalHasModel `CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2` +\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2 +\cgalHasModelsEnd */ diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h index 959e3c3a25e..9766710af1e 100644 --- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h +++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h @@ -20,7 +20,8 @@ corresponding vertex produces the canonical representative of the face in the hy Hyperbolic translations are represented by a nested type which is provided by the concept `Periodic_4HyperbolicDelaunayTriangulationTraits_2`. -\cgalHasModel `CGAL::Periodic_4_hyperbolic_triangulation_face_base_2` +\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_triangulation_face_base_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `Periodic_4HyperbolicTriangulationVertexBase_2` diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h index 3221dc57a11..eb8bfe0b89d 100644 --- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h +++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h @@ -14,7 +14,8 @@ translation during the insertion process. A boolean flag indicates whether the face stores a translation or not. The value of the flag is automatically set when storing or removing a translation. -\cgalHasModel `CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2` +\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `Periodic_4HyperbolicTriangulationFaceBase_2` diff --git a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h index 97517ca4a3d..f17b26f951a 100644 --- a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h +++ b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h @@ -8,8 +8,9 @@ * represents the outer boundary and the general polygons that represent * the holes. * - * \cgalHasModel `CGAL::General_polygon_with_holes_2` - * \cgalHasModel `CGAL::Polygon_with_holes_2` + * \cgalHasModelsBegin CGAL::General_polygon_with_holes_2 + * \cgalHasModels CGAL::Polygon_with_holes_2 + * \cgalHasModelsEnd */ class GeneralPolygonWithHoles_2 { diff --git a/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h b/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h index 674a57e4374..068194985bc 100644 --- a/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h +++ b/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h @@ -14,10 +14,10 @@ and refer to the description of the kernel concept for details. \cgalRefines{DefaultConstructible,CopyConstructable} -\cgalHasModel The kernels supplied by \cgal are models of `PolygonTraits_2`. -\cgalHasModel `CGAL::Projection_traits_xy_3` -\cgalHasModel `CGAL::Projection_traits_yz_3` -\cgalHasModel `CGAL::Projection_traits_xz_3` +\cgalHasModelsBareBegin{The kernels supplied by \cgal are models of `PolygonTraits_2`} CGAL::Projection_traits_xy_3 +\cgalHasModels CGAL::Projection_traits_yz_3 +\cgalHasModels CGAL::Projection_traits_xz_3 +\cgalHasModelsEnd \sa `CGAL::Polygon_2` diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h index a46ff1fe7a2..facce5d714b 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h @@ -6,7 +6,8 @@ /// the creation of new faces and new edges. /// /// \cgalRefines{CopyConstructible} -/// \cgalHasModel `CGAL::Polygon_mesh_processing::Corefinement::Default_visitor`. +/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Corefinement::Default_visitor +/// \cgalHasModelsEnd class PMPCorefinementVisitor{ public: diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h index 61575e3ff89..ec983951220 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h @@ -7,7 +7,7 @@ /// `sample_triangle_mesh()`, `approximate_Hausdorff_distance()` and `max_distance_to_triangle_mesh()` /// /// \cgalRefines{AABBGeomTraits,SpatialSortingTraits_3} -/// \cgalHasModel Any 3D Kernel is a model of this concept. +/// \cgalHasModelsBare{Any 3D Kernel is a model of this concept} class PMPDistanceTraits{ public: diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h index 9ef06093cb2..11af2abad0f 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h @@ -9,7 +9,8 @@ /// If that fails, it uses an algorithm with cubic running time (*cubic phase*). /// /// \cgalRefines{CopyConstructible} -/// \cgalHasModel `CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor`. +/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor +/// \cgalHasModelsEnd class PMPHolefillingVisitor{ public: diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h index a4efc83d703..d0597a5c90e 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h @@ -7,7 +7,8 @@ /// during the orientation process. /// /// \cgalRefines{CopyConstructible} -/// \cgalHasModel `CGAL::Polygon_mesh_processing::Default_orientation_visitor`. +/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Default_orientation_visitor +/// \cgalHasModelsEnd class PMPPolygonSoupOrientationVisitor{ public: diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h index f3fdef28beb..a8c885e7b13 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h @@ -6,7 +6,8 @@ /// the creation of new faces. /// /// \cgalRefines{CopyConstructible} -/// \cgalHasModel `CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor`. +/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor +/// \cgalHasModelsEnd class PMPTriangulateFaceVisitor { diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h index 62c23598c49..c4b306a73a2 100644 --- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h +++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h @@ -13,8 +13,9 @@ polyhedral surface renames faces to facets. \cgalRefines{HalfedgeDSItems} -\cgalHasModel `CGAL::Polyhedron_items_3` -\cgalHasModel `CGAL::Polyhedron_min_items_3` +\cgalHasModelsBegin CGAL::Polyhedron_items_3 +\cgalHasModels CGAL::Polyhedron_min_items_3 +\cgalHasModelsEnd \sa `CGAL::Polyhedron_3` \sa `HalfedgeDSItems` diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h index 6849eb7f175..5dc824c7d55 100644 --- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h +++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h @@ -10,9 +10,9 @@ and can be used directly as template argument. \cgalRefines{CopyConstructible,Assignable} -\cgalHasModel `CGAL::Polyhedron_traits_3` -\cgalHasModel `CGAL::Polyhedron_traits_with_normals_3` -\cgalHasModel All models of the `Kernel` concept, e.g., `CGAL::Simple_cartesian` +\cgalHasModelsBareBegin{All models of the `Kernel` concept, e.g. `CGAL::Simple_cartesian`} CGAL::Polyhedron_traits_3 +\cgalHasModels CGAL::Polyhedron_traits_with_normals_3 +\cgalHasModelsEnd \sa `CGAL::Polyhedron_3` diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h index 4722bcaa72c..525753e4c75 100644 --- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h +++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h @@ -12,9 +12,10 @@ preserve the overall polyline set shape as much as possible \cgalRefines{CopyConstructible,Assignable} -\cgalHasModel `CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost` -\cgalHasModel `CGAL::Polyline_simplification_2::Scaled_squared_distance_cost` -\cgalHasModel `CGAL::Polyline_simplification_2::Squared_distance_cost` +\cgalHasModelsBegin CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost +\cgalHasModels CGAL::Polyline_simplification_2::Scaled_squared_distance_cost +\cgalHasModels CGAL::Polyline_simplification_2::Squared_distance_cost +\cgalHasModelsEnd */ diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h index 62e84c66f48..bb5b1d98948 100644 --- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h +++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h @@ -5,9 +5,10 @@ Models of this concept are passed to the polyline simplification algorithm to indicate when to stop the process. -\cgalHasModel `CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold` -\cgalHasModel `CGAL::Polyline_simplification_2::Stop_below_count_threshold` -\cgalHasModel `CGAL::Polyline_simplification_2::Stop_above_cost_threshold` +\cgalHasModelsBegin CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold +\cgalHasModels CGAL::Polyline_simplification_2::Stop_below_count_threshold +\cgalHasModels CGAL::Polyline_simplification_2::Stop_above_cost_threshold +\cgalHasModelsEnd */ class PolylineSimplificationStopPredicate diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h index c51684ad8d6..20aff75a93b 100644 --- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h +++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h @@ -8,7 +8,8 @@ whether a vertex can be removed, and the cost of the removal. \cgalRefines{TriangulationVertexBase_2} -\cgalHasModel `CGAL::Polyline_simplification_2::Vertex_base_2` +\cgalHasModelsBegin CGAL::Polyline_simplification_2::Vertex_base_2 +\cgalHasModelsEnd \sa `TriangulationFaceBase_2` \sa `CGAL::Constrained_triangulation_plus_2` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h index d5552d6b328..7ce0406f064 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h @@ -31,7 +31,8 @@ is possible to select a certain variable. \sa `Polynomial_d` -\cgalHasModel `CGAL::Polynomial_traits_d` +\cgalHasModelsBegin CGAL::Polynomial_traits_d +\cgalHasModelsEnd */ diff --git a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h index ed86c99c683..6a5a0c84a05 100644 --- a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h +++ b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h @@ -32,7 +32,8 @@ coefficient is a `Field` the polynomial is model of `EuclideanRing`. \sa `AlgebraicStructureTraits` \sa `PolynomialTraits_d` -\cgalHasModel `CGAL::Polynomial` +\cgalHasModelsBegin CGAL::Polynomial +\cgalHasModelsEnd */ diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h index a792e16ee38..64c1383c051 100644 --- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h +++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h @@ -7,10 +7,11 @@ The concept `AllFurthestNeighborsTraits_2` defines types and operations needed to compute all furthest neighbors for the vertices of a convex polygon using the function `all_furthest_neighbors_2()`. -\cgalHasModel `CGAL::Cartesian` -\cgalHasModel `CGAL::Homogeneous` -\cgalHasModel `CGAL::Simple_cartesian` -\cgalHasModel `CGAL::Simple_homogeneous` +\cgalHasModelsBegin CGAL::Cartesian +\cgalHasModels CGAL::Homogeneous +\cgalHasModels CGAL::Simple_cartesian +\cgalHasModels CGAL::Simple_homogeneous +\cgalHasModelsEnd \sa `CGAL::all_furthest_neighbors_2()` diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h index cfece60d3a4..34286f63b4b 100644 --- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h +++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h @@ -6,9 +6,10 @@ This concept defines the requirements for traits classes of \f$ d\f$-dimensional optimisation algorithms. -\cgalHasModel `CGAL::Polytope_distance_d_traits_2` -\cgalHasModel `CGAL::Polytope_distance_d_traits_3` -\cgalHasModel `CGAL::Polytope_distance_d_traits_d` +\cgalHasModelsBegin CGAL::Polytope_distance_d_traits_2 +\cgalHasModels CGAL::Polytope_distance_d_traits_3 +\cgalHasModels CGAL::Polytope_distance_d_traits_d +\cgalHasModelsEnd \sa `CGAL::Polytope_distance_d` diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h index 6f882dd1280..5794f471658 100644 --- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h +++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h @@ -12,7 +12,8 @@ Whatever the coordinates of the points are, it is required for the width-algorithm to have access to the homogeneous representation of points. -\cgalHasModel CGAL::Width_default_traits_3 +\cgalHasModelsBegin CGAL::Width_default_traits_3 +\cgalHasModelsEnd \sa `CGAL::Width_3` diff --git a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h index 6cc3639cff5..1882b05c73e 100644 --- a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h +++ b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h @@ -35,9 +35,10 @@ The description is given by appropriate random-access iterators over the program data, see below. The program therefore comes in dense representation which includes zero entries. -\cgalHasModel `CGAL::Quadratic_program` -\cgalHasModel `CGAL::Quadratic_program_from_mps` -\cgalHasModel `CGAL::Linear_program_from_iterators` +\cgalHasModelsBegin CGAL::Quadratic_program +\cgalHasModels CGAL::Quadratic_program_from_mps +\cgalHasModels CGAL::Linear_program_from_iterators +\cgalHasModelsEnd and the other concepts diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h index e3a75a9aaf7..0e4c2928cec 100644 --- a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h +++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h @@ -29,17 +29,19 @@ The description is given by appropriate random-access iterators over the program data, see below. The program therefore comes in dense representation which includes zero entries. -\cgalHasModel `CGAL::Quadratic_program` -\cgalHasModel `CGAL::Quadratic_program_from_mps` -\cgalHasModel `CGAL::Nonnegative_linear_program_from_iterators` +\cgalHasModelsBegin CGAL::Quadratic_program +\cgalHasModels CGAL::Quadratic_program_from_mps +\cgalHasModels CGAL::Nonnegative_linear_program_from_iterators +\cgalHasModelsEnd The value types of all iterator types (nested iterator types, respectively, for `A_iterator`) must be convertible to some common `IntegralDomain` `ET`. -\cgalHasModel `CGAL::Quadratic_program` -\cgalHasModel `CGAL::Quadratic_program_from_mps` -\cgalHasModel `CGAL::Nonnegative_linear_program_from_iterators` +\cgalHasModelsBegin CGAL::Quadratic_program +\cgalHasModels CGAL::Quadratic_program_from_mps +\cgalHasModels CGAL::Nonnegative_linear_program_from_iterators +\cgalHasModelsEnd \sa `QuadraticProgram` \sa `LinearProgram` diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h index 585eb911b0a..f531f27550c 100644 --- a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h +++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h @@ -33,9 +33,10 @@ The description is given by appropriate random-access iterators over the program data, see below. The program therefore comes in dense representation which includes zero entries. -\cgalHasModel `CGAL::Quadratic_program` -\cgalHasModel `CGAL::Quadratic_program_from_mps` -\cgalHasModel `CGAL::Nonnegative_quadratic_program_from_iterators` +\cgalHasModelsBegin CGAL::Quadratic_program +\cgalHasModels CGAL::Quadratic_program_from_mps +\cgalHasModels CGAL::Nonnegative_quadratic_program_from_iterators +\cgalHasModelsEnd The value types of all iterator types (nested iterator types, respectively, for `A_iterator` and `D_iterator`) must be diff --git a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h index 6070e27ceb9..e2531015388 100644 --- a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h +++ b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h @@ -34,9 +34,10 @@ The description is given by appropriate random-access iterators over the program data, see below. The program therefore comes in dense representation which includes zero entries. -\cgalHasModel `CGAL::Quadratic_program` -\cgalHasModel `CGAL::Quadratic_program_from_mps` -\cgalHasModel `CGAL::Quadratic_program_from_iterators` +\cgalHasModelsBegin CGAL::Quadratic_program +\cgalHasModels CGAL::Quadratic_program_from_mps +\cgalHasModels CGAL::Quadratic_program_from_iterators +\cgalHasModelsEnd The value types of all iterator types (nested iterator types, respectively, for `A_iterator` and `D_iterator`) must be diff --git a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h index d76e8032e54..1359f35074e 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h @@ -48,7 +48,8 @@ of the input complex. \cgalRefines{MeshComplex_3InTriangulation_3} -\cgalHasModel `CGAL::Mesh_complex_3_in_triangulation_3` +\cgalHasModelsBegin CGAL::Mesh_complex_3_in_triangulation_3 +\cgalHasModelsEnd \sa `MeshComplex_3InTriangulation_3` \sa `MeshDomainWithFeatures_3` diff --git a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h index c3b1696a58d..fa640570e27 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h @@ -42,7 +42,8 @@ the current approximation of each subdomain and each boundary surface patch. The data structure encodes the final mesh at the end of the meshing process. -\cgalHasModel `CGAL::Mesh_complex_3_in_triangulation_3` +\cgalHasModelsBegin CGAL::Mesh_complex_3_in_triangulation_3 +\cgalHasModelsEnd \sa `MeshDomain_3` \sa `MeshComplexWithFeatures_3InTriangulation_3` diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h index ff424c1281d..50ac974f979 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h @@ -18,10 +18,11 @@ of the triangulation that are surface facets. \cgalRefines{TriangulationCellBase_3,CopyConstructible} -\cgalHasModel `CGAL::Compact_mesh_cell_base_3` -\cgalHasModel `CGAL::Mesh_cell_base_3` -\cgalHasModel `CGAL::Simplicial_mesh_cell_base_3` -\cgalHasModel `CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3` +\cgalHasModelsBegin CGAL::Compact_mesh_cell_base_3 +\cgalHasModels CGAL::Mesh_cell_base_3 +\cgalHasModels CGAL::Simplicial_mesh_cell_base_3 +\cgalHasModels CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3 +\cgalHasModelsEnd */ diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h index ad034bbb982..938ce50e7e2 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h @@ -16,9 +16,10 @@ and to an index characteristic of this face. \cgalRefines{TriangulationVertexBase_3} -\cgalHasModel `CGAL::Mesh_vertex_base_3` -\cgalHasModel `CGAL::Simplicial_mesh_vertex_base_3` -\cgalHasModel `CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3` +\cgalHasModelsBegin CGAL::Mesh_vertex_base_3 +\cgalHasModels CGAL::Simplicial_mesh_vertex_base_3 +\cgalHasModels CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3 +\cgalHasModelsEnd */ diff --git a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h index 8235e55f4f0..4c700b18520 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h +++ b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h @@ -6,8 +6,9 @@ The concept `Descriptor` allows to describe a unique object in an abstract model \cgalRefines{DefaultConstructible,CopyConstructible,Assignable,EqualityComparable} -\cgalHasModel `Index` -\cgalHasModel `Handle` +\cgalHasModelsBegin Index +\cgalHasModels Handle +\cgalHasModelsEnd */ class Descriptor {}; diff --git a/STL_Extension/doc/STL_Extension/Concepts/Hashable.h b/STL_Extension/doc/STL_Extension/Concepts/Hashable.h index 3c7f0b5cf71..ab5c0429a90 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/Hashable.h +++ b/STL_Extension/doc/STL_Extension/Concepts/Hashable.h @@ -6,10 +6,8 @@ A type `Key` is a model of the concept `Hashable` if the specializations `boost::hash` and `std::hash` exist. -\cgalHasModel All handles and indices of \cgal data structures. -\cgalHasModel All handles of OpenMesh, by including the specializations -of the `graph_traits` header files provided by \cgal. -They can be disables by defining the macro `CGAL_DISABLE_HASH_OPENMESH`. +\cgalHasModelsBare{All handles and indices of \cgal data structures, + All handles of OpenMesh\, by including the specializations of the `graph_traits` header files provided by \cgal. They can be disables by defining the macro `CGAL_DISABLE_HASH_OPENMESH`.} \sa `CGAL::Unique_hash_map` \sa `std::unordered_set` diff --git a/STL_Extension/doc/STL_Extension/Concepts/Index.h b/STL_Extension/doc/STL_Extension/Concepts/Index.h index 544e714fa8a..c94791cd287 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/Index.h +++ b/STL_Extension/doc/STL_Extension/Concepts/Index.h @@ -6,8 +6,9 @@ The concept `Index` is a refinement of `Descriptor` which must be convertible fr \cgalRefines{Descriptor} -\cgalHasModel int -\cgalHasModel size_t +\cgalHasModelsBegin int +\cgalHasModels size_t +\cgalHasModelsEnd \cgalHeading{Notation} diff --git a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h index 3a285603271..00f421a6c67 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h +++ b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h @@ -12,19 +12,20 @@ The concept `ProjectionObject` is modeled after the STL concept `UnaryFunction`, but takes also care of (const) references. -\cgalHasModel CGAL::Identity -\cgalHasModel CGAL::Dereference -\cgalHasModel CGAL::Get_address -\cgalHasModel CGAL::Cast_function_object -\cgalHasModel CGAL::Project_vertex -\cgalHasModel CGAL::Project_facet -\cgalHasModel CGAL::Project_point -\cgalHasModel CGAL::Project_normal -\cgalHasModel CGAL::Project_plane -\cgalHasModel CGAL::Project_next -\cgalHasModel CGAL::Project_prev -\cgalHasModel CGAL::Project_next_opposite -\cgalHasModel CGAL::Project_opposite_prev +\cgalHasModelsBegin CGAL::Identity +\cgalHasModels CGAL::Dereference +\cgalHasModels CGAL::Get_address +\cgalHasModels CGAL::Cast_function_object +\cgalHasModels CGAL::Project_vertex +\cgalHasModels CGAL::Project_facet +\cgalHasModels CGAL::Project_point +\cgalHasModels CGAL::Project_normal +\cgalHasModels CGAL::Project_plane +\cgalHasModels CGAL::Project_next +\cgalHasModels CGAL::Project_prev +\cgalHasModels CGAL::Project_next_opposite +\cgalHasModels CGAL::Project_opposite_prev +\cgalHasModelsEnd */ diff --git a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h index e11d85a35a1..02e8a321150 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h +++ b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h @@ -21,7 +21,8 @@ We call `S` the surjective function such that `S(object)` is the \"thing\" that is locked when one tries to lock `object`. In the previous example, `S(point)` is the voxel containing `point`. -\cgalHasModel `CGAL::Spatial_lock_grid_3` +\cgalHasModelsBegin CGAL::Spatial_lock_grid_3 +\cgalHasModelsEnd */ class SurjectiveLockDataStructure { diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h index e083e399ac7..35367ad681f 100644 --- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h +++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h @@ -11,8 +11,9 @@ namespace Scale_space_reconstruction_3 { * A mesher is a functor that can be applied to a range of * points and that returns a set of facets. * - * \cgalHasModel CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher - * \cgalHasModel CGAL::Scale_space_reconstruction_3::Advancing_front_mesher + * \cgalHasModelsBegin CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher + * \cgalHasModels CGAL::Scale_space_reconstruction_3::Advancing_front_mesher + * \cgalHasModelsEnd * */ class Mesher diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h index 0cfdd7b5499..326cc4ff2df 100644 --- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h +++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h @@ -15,8 +15,9 @@ namespace Scale_space_reconstruction_3 { * \note the functor can be applied several times by the scale space * reconstruction algorithm. * - * \cgalHasModel CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother - * \cgalHasModel CGAL::Scale_space_reconstruction_3::Jet_smoother + * \cgalHasModelsBegin CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother + * \cgalHasModels CGAL::Scale_space_reconstruction_3::Jet_smoother + * \cgalHasModelsEnd */ class Smoother { diff --git a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h index 71373681e98..f61385ec589 100644 --- a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h +++ b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h @@ -9,12 +9,13 @@ the keys and intervals, and provide comparison functions that are needed for window queries. -\cgalHasModel `CGAL::Range_segment_tree_set_traits_2` -\cgalHasModel `CGAL::Range_segment_tree_set_traits_3` -\cgalHasModel `CGAL::Range_tree_map_traits_2` -\cgalHasModel `CGAL::Range_tree_map_traits_3` -\cgalHasModel `CGAL::Segment_tree_map_traits_2` -\cgalHasModel `CGAL::Segment_tree_map_traits_3` +\cgalHasModelsBegin CGAL::Range_segment_tree_set_traits_2 +\cgalHasModels CGAL::Range_segment_tree_set_traits_3 +\cgalHasModels CGAL::Range_tree_map_traits_2 +\cgalHasModels CGAL::Range_tree_map_traits_3 +\cgalHasModels CGAL::Segment_tree_map_traits_2 +\cgalHasModels CGAL::Segment_tree_map_traits_3 +\cgalHasModelsEnd \cgalHeading{Example} diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h index 566beb42485..f5be21ae15e 100644 --- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h +++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h @@ -33,7 +33,8 @@ We only describe the additional requirements with respect to the \cgalRefines{ApolloniusGraphDataStructure_2} -\cgalHasModel `CGAL::Triangulation_data_structure_2` +\cgalHasModelsBegin CGAL::Triangulation_data_structure_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `ApolloniusGraphDataStructure_2` diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h index 4b96dab0907..ee8181103a4 100644 --- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h +++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h @@ -9,7 +9,8 @@ requirements for the face base class of the \cgalRefines{TriangulationFaceBase_2} -\cgalHasModel `CGAL::Segment_Delaunay_graph_face_base_2` +\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_face_base_2 +\cgalHasModelsEnd \sa `SegmentDelaunayGraphDataStructure_2` \sa `SegmentDelaunayGraphTraits_2` diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h index 7ab5a65a26b..d53cbd55ccf 100644 --- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h +++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h @@ -26,7 +26,8 @@ The `SegmentDelaunayGraphHierarchyVertexBase_2` concept does not introduce any constructors in addition to those of the `SegmentDelaunayGraphVertexBase_2` concept. -\cgalHasModel CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2 > +\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2 > +\cgalHasModelsEnd \sa `SegmentDelaunayGraphDataStructure_2` \sa `SegmentDelaunayGraphVertexBase_2` diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h index 5370b1b3026..99d6bf2ca9e 100644 --- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h +++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h @@ -8,7 +8,8 @@ requirements for the sites of a segment Delaunay graph. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Segment_Delaunay_graph_site_2` +\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_site_2 +\cgalHasModelsEnd \sa `SegmentDelaunayGraphTraits_2` \sa `CGAL::Segment_Delaunay_graph_site_2` diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h index 3f391babafa..d79098a554c 100644 --- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h +++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h @@ -11,7 +11,8 @@ by storing handles to points instead of points. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Segment_Delaunay_graph_storage_site_2` +\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_storage_site_2 +\cgalHasModelsEnd \sa `SegmentDelaunayGraphTraits_2` \sa `CGAL::Segment_Delaunay_graph_site_2` diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h index 78e8bda7d6e..e4866423c15 100644 --- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h +++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h @@ -15,7 +15,8 @@ See section \ref Segment_Delaunay_graph_2StronglyIntersecting for more informati \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Segment_Delaunay_graph_storage_traits_2` +\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_storage_traits_2 +\cgalHasModelsEnd \sa `SegmentDelaunayGraphTraits_2` */ diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h index e68b4212b19..78e56ed2f6c 100644 --- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h +++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h @@ -14,10 +14,11 @@ the concept `SegmentDelaunayGraphSite_2`. It also provides constructions for sites and several function object types for the predicates. -\cgalHasModel `CGAL::Segment_Delaunay_graph_traits_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_traits_without_intersections_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_filtered_traits_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2` +\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_traits_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_traits_without_intersections_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_filtered_traits_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2 +\cgalHasModelsEnd \sa `SegmentDelaunayGraphSite_2` \sa `CGAL::Segment_Delaunay_graph_2` diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h index 778a709b5a6..48097737f24 100644 --- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h +++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h @@ -11,7 +11,8 @@ requirements for the vertex base class of the site of the segment Delaunay graph and provides access to one of its incident faces through a `Face_handle`. -\cgalHasModel `CGAL::Segment_Delaunay_graph_vertex_base_2` +\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_vertex_base_2 +\cgalHasModelsEnd \sa `SegmentDelaunayGraphTraits_2` \sa `SegmentDelaunayGraphSite_2` diff --git a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h index 4a4a626b8eb..4a8ec7f78fc 100644 --- a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h +++ b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h @@ -36,10 +36,11 @@ with respect to the \cgalRefines{SegmentDelaunayGraphTraits_2} -\cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_traits_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2` +\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_Linf_traits_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2 +\cgalHasModelsEnd \sa `SegmentDelaunayGraphSite_2` \sa `CGAL::Segment_Delaunay_graph_Linf_2` diff --git a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h index 4f0424d9664..cb1e7eed119 100644 --- a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h +++ b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h @@ -7,7 +7,7 @@ \cgalRefines{DefaultConstructible,PolygonTraits_2} - \cgalHasModel Any CGAL kernel, e.g., CGAL::Exact_predicates_exact_constructions_kernel. + \cgalHasModelsBare{Any CGAL kernel, e.g., CGAL::Exact_predicates_exact_constructions_kernel.} */ diff --git a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h index 5441f324e94..e581f066cb6 100644 --- a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h +++ b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h @@ -12,8 +12,8 @@ input data has to be provided in form of a random access iterator. Point and normal property maps have to be provided to extract the points and the normals from the input. -\cgalHasModel -- `CGAL::Shape_detection::Efficient_RANSAC_traits` +\cgalHasModelsBegin CGAL::Shape_detection::Efficient_RANSAC_traits +\cgalHasModelsEnd */ class EfficientRANSACTraits{ diff --git a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h index 5495e5d0c9a..88df769ec09 100644 --- a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h +++ b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h @@ -5,11 +5,11 @@ A concept that describes the set of methods used by the `CGAL::Shape_detection::Region_growing` to access neighbors of an item. -\cgalHasModel -- `CGAL::Shape_detection::Point_set::K_neighbor_query` -- `CGAL::Shape_detection::Point_set::Sphere_neighbor_query` -- `CGAL::Shape_detection::Polygon_mesh::Polyline_graph` -- `CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query` +\cgalHasModelsBegin CGAL::Shape_detection::Point_set::K_neighbor_query +\cgalHasModels CGAL::Shape_detection::Point_set::Sphere_neighbor_query +\cgalHasModels CGAL::Shape_detection::Polygon_mesh::Polyline_graph +\cgalHasModels CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query +\cgalHasModelsEnd */ class NeighborQuery { diff --git a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h index f1366dc8aba..af3212c6759 100644 --- a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h +++ b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h @@ -7,14 +7,14 @@ to maintain a region. A region is represented by a set items, which are included in this region. -\cgalHasModel -- `CGAL::Shape_detection::Point_set::Least_squares_line_fit_region` -- `CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region` -- `CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region` -- `CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region` -- `CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region` -- `CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region` -- `CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region` +\cgalHasModelsBegin CGAL::Shape_detection::Point_set::Least_squares_line_fit_region +\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region +\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region +\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region +\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region +\cgalHasModels CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region +\cgalHasModels CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region +\cgalHasModelsEnd */ class RegionType { diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h index f0e4a54c1a1..9ed67563fdc 100644 --- a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h +++ b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h @@ -10,10 +10,10 @@ a model of this concept, the user sets such directions and provides a way to ori contour edges towards these directions. All contour regularization functions in this package are parameterized by this concept. -\cgalHasModel -- `Contours::Longest_direction_2` -- `Contours::Multiple_directions_2` -- `Contours::User_defined_directions_2` +\cgalHasModelsBegin Contours::Longest_direction_2 +\cgalHasModels Contours::Multiple_directions_2 +\cgalHasModels Contours::User_defined_directions_2 +\cgalHasModelsEnd */ class ContourDirections { diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h index 4d8074eee9d..20dbf1801e1 100644 --- a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h +++ b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h @@ -9,8 +9,8 @@ A concept that describes the set of methods used by the class `QP_regularization` to access neighbors of a geometric object being regularized. -\cgalHasModel -- `Segments::Delaunay_neighbor_query_2` +\cgalHasModelsBegin Segments::Delaunay_neighbor_query_2 +\cgalHasModelsEnd */ class NeighborQuery { diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h index eb3a764af8e..ab3bbb08b7b 100644 --- a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h +++ b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h @@ -9,9 +9,9 @@ A concept that describes the set of methods used by the class `QP_regularization` to access various data required for setting up the the global regularization problem. -\cgalHasModel -- `Segments::Angle_regularization_2` -- `Segments::Offset_regularization_2` +\cgalHasModelsBegin Segments::Angle_regularization_2 +\cgalHasModels Segments::Offset_regularization_2 +\cgalHasModelsEnd */ class RegularizationType { diff --git a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h index 6551020f4f0..180cbeeb64d 100644 --- a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h +++ b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h @@ -10,7 +10,8 @@ polyhedral mesh approximating a skin surface \cgalRefines{RegularTriangulationTraits_3} -\cgalHasModel `CGAL::Skin_surface_traits_3` +\cgalHasModelsBegin CGAL::Skin_surface_traits_3 +\cgalHasModelsEnd \sa `CGAL::Skin_surface_3` \sa `CGAL::Skin_surface_traits_3` diff --git a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h index a4dad53d72e..237a5d3049d 100644 --- a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h +++ b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h @@ -9,8 +9,9 @@ The concept requires a constructor from an iterator range of weighted points and a shrink factor. By default the input balls are grown in such that the skin surface wraps around the input balls. -\cgalHasModel `CGAL::Skin_surface_3` -\cgalHasModel `CGAL::Union_of_balls_3` +\cgalHasModelsBegin CGAL::Skin_surface_3 +\cgalHasModels CGAL::Union_of_balls_3 +\cgalHasModelsEnd */ diff --git a/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h b/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h index 0138ce98d6b..163d17faa16 100644 --- a/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h +++ b/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h @@ -11,7 +11,8 @@ some function object types for the required predicates on those primitives. \cgalRefines{ArrangementTraits_2} -\cgalHasModel `CGAL::Snap_rounding_traits_2` +\cgalHasModelsBegin CGAL::Snap_rounding_traits_2 +\cgalHasModelsEnd */ class SnapRoundingTraits_2 { @@ -171,7 +172,7 @@ namespace SRTraits_2{ \cgalConcept Represents an iso rectangle \cgalRefines{DefaultConstructible,CopyConstructible,Assignable} - \cgalHasModel \link SnapRoundingTraits_2::Iso_rectangle_2 `Snap_rounding_traits_2::Iso_rectangle_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Iso_rectangle_2 `Snap_rounding_traits_2::Iso_rectangle_2` \endlink} */ class IsoRectangle_2 {}; @@ -180,7 +181,7 @@ class IsoRectangle_2 \ingroup PkgSnapRounding2Concepts \cgalConcept \cgalRefines{AdaptableBinaryFunction} - \cgalHasModel \link SnapRoundingTraits_2::Construct_vertex_2 `Snap_rounding_traits_2::Construct_vertex_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_vertex_2 `Snap_rounding_traits_2::Construct_vertex_2` \endlink} */ class ConstructVertex_2 { @@ -197,7 +198,7 @@ class ConstructVertex_2 \ingroup PkgSnapRounding2Concepts \cgalConcept \cgalRefines{AdaptableBinaryFunction} - \cgalHasModel \link SnapRoundingTraits_2::Construct_segment_2 `Snap_rounding_traits_2::Construct_segment_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_segment_2 `Snap_rounding_traits_2::Construct_segment_2` \endlink} */ class ConstructSegment_2 { @@ -214,7 +215,7 @@ class ConstructSegment_2 \ingroup PkgSnapRounding2Concepts \cgalConcept \cgalRefines{AdaptableQuaternaryFunction} - \cgalHasModel \link SnapRoundingTraits_2::Construct_iso_rectangle_2 `Snap_rounding_traits_2::Construct_iso_rectangle_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_iso_rectangle_2 `Snap_rounding_traits_2::Construct_iso_rectangle_2` \endlink} */ class ConstructIsoRectangle_2 { @@ -235,7 +236,7 @@ class ConstructIsoRectangle_2 \ingroup PkgSnapRounding2Concepts \cgalConcept \cgalRefines{AdaptableBinaryFunction} - \cgalHasModel \link SnapRoundingTraits_2::Compare_x_2 `Snap_rounding_traits_2::Compare_x_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Compare_x_2 `Snap_rounding_traits_2::Compare_x_2` \endlink} */ class CompareX_2 { @@ -251,7 +252,7 @@ class CompareX_2 \ingroup PkgSnapRounding2Concepts \cgalConcept \cgalRefines{AdaptableBinaryFunction} - \cgalHasModel \link SnapRoundingTraits_2::Compare_y_2 `Snap_rounding_traits_2::Compare_y_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Compare_y_2 `Snap_rounding_traits_2::Compare_y_2` \endlink} */ class CompareY_2 { @@ -268,7 +269,7 @@ class CompareY_2 \ingroup PkgSnapRounding2Concepts \cgalConcept \cgalRefines{AdaptableQuaternaryFunction} - \cgalHasModel \link SnapRoundingTraits_2::Snap_2 `Snap_rounding_traits_2::Snap_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Snap_2 `Snap_rounding_traits_2::Snap_2` \endlink} */ class Snap_2 { @@ -287,7 +288,7 @@ class Snap_2 \ingroup PkgSnapRounding2Concepts \cgalConcept \cgalRefines{AdaptableBinaryFunction} - \cgalHasModel \link SnapRoundingTraits_2::Integer_grid_point_2 `Snap_rounding_traits_2::Integer_grid_point_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Integer_grid_point_2 `Snap_rounding_traits_2::Integer_grid_point_2` \endlink} */ class IntegerGridPoint_2 @@ -308,7 +309,7 @@ class IntegerGridPoint_2 \ingroup PkgSnapRounding2Concepts \cgalConcept \cgalRefines{AdaptableTernaryFunction} - \cgalHasModel \link SnapRoundingTraits_2::Minkowski_sum_with_pixel_2 `Snap_rounding_traits_2::Minkowski_sum_with_pixel_2` \endlink + \cgalHasModelsBare{\link SnapRoundingTraits_2::Minkowski_sum_with_pixel_2 `Snap_rounding_traits_2::Minkowski_sum_with_pixel_2` \endlink} */ class MinkowskiSumWithPixel_2 { diff --git a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h index 7b00e83e119..41594f6cbfe 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h @@ -19,7 +19,8 @@ follows: \tparam FT Number type \tparam dim Dimension of the matrices and vectors -\cgalHasModel `CGAL::Eigen_diagonalize_traits` +\cgalHasModelsBegin CGAL::Eigen_diagonalize_traits +\cgalHasModelsEnd */ template class DiagonalizeTraits diff --git a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h index 8504337f1fc..015153dd324 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h @@ -7,7 +7,8 @@ class MixedIntegerProgramTraits `MixedIntegerProgramVariable` is a concept of a variable in a Mixed Integer Programming (MIP) problem. -\cgalHasModel `CGAL::Variable` +\cgalHasModelsBegin CGAL::Variable +\cgalHasModelsEnd */ template class MixedIntegerProgramVariable @@ -112,7 +113,8 @@ public: `MixedIntegerProgramLinearConstraint` is a concept of a linear constraint in a Mixed Integer Programming (MIP) problem. -\cgalHasModel `CGAL::Linear_constraint` +\cgalHasModelsBegin CGAL::Linear_constraint +\cgalHasModelsEnd */ template class MixedIntegerProgramLinearConstraint @@ -209,7 +211,8 @@ public: `MixedIntegerProgramLinearObjective` is a concept of the linear objective function in a Mixed Integer Programming (MIP) problem. -\cgalHasModel `CGAL::Linear_objective` +\cgalHasModelsBegin CGAL::Linear_objective +\cgalHasModelsEnd */ template class MixedIntegerProgramLinearObjective @@ -277,9 +280,10 @@ Mixed Integer Programming (MIP) problems. A model of this concept stores the int variables, linear objective, and linear constraints (if any) and provides a method to solve the problem. -\cgalHasModel `CGAL::Mixed_integer_program_traits` -\cgalHasModel `CGAL::GLPK_mixed_integer_program_traits` -\cgalHasModel `CGAL::SCIP_mixed_integer_program_traits` +\cgalHasModelsBegin CGAL::Mixed_integer_program_traits +\cgalHasModels CGAL::GLPK_mixed_integer_program_traits +\cgalHasModels CGAL::SCIP_mixed_integer_program_traits +\cgalHasModelsEnd */ template class MixedIntegerProgramTraits diff --git a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h index 36c16f629ea..07781ed7265 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h +++ b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h @@ -7,7 +7,8 @@ Concept describing the set of requirements for solving the normal equation \f$ A \sa `SparseLinearAlgebraTraits_d` -\cgalHasModel `CGAL::Eigen_solver_traits` +\cgalHasModelsBegin CGAL::Eigen_solver_traits +\cgalHasModelsEnd */ class NormalEquationSparseLinearAlgebraTraits_d { diff --git a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h index 189f0da26b7..f929f231c7b 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h @@ -24,8 +24,8 @@ where \f$ l_i \in \mathbb{R} \cup \{-\infty\} \f$ for all \f$ i \f$, where \f$ u_i \in \mathbb{R} \cup \{+\infty\} \f$ for all \f$ i \f$. -\cgalHasModel -`CGAL::OSQP_quadratic_program_traits` +\cgalHasModelsBegin CGAL::OSQP_quadratic_program_traits +\cgalHasModelsEnd */ class QuadraticProgramTraits { diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h index e0555447812..7c04f914bd4 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h @@ -4,7 +4,8 @@ The concept `SparseLinearAlgebraTraits_d` is used to solve sparse linear systems A\f$ \times \f$ X = B. -\cgalHasModel `CGAL::Eigen_solver_traits` +\cgalHasModelsBegin CGAL::Eigen_solver_traits +\cgalHasModelsEnd */ class SparseLinearAlgebraTraits_d { @@ -62,7 +63,8 @@ by a sparse matrix. \cgalRefines{DefaultConstructible} -\cgalHasModel `CGAL::Eigen_vector` +\cgalHasModelsBegin CGAL::Eigen_vector +\cgalHasModelsEnd \sa `SparseLinearAlgebraTraits_d` \sa `SparseLinearAlgebraTraits_d::Matrix` @@ -129,8 +131,9 @@ NT& operator[](Index row); \cgalRefines{Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Eigen_sparse_matrix` -\cgalHasModel `CGAL::Eigen_sparse_symmetric_matrix` +\cgalHasModelsBegin CGAL::Eigen_sparse_matrix +\cgalHasModels CGAL::Eigen_sparse_symmetric_matrix +\cgalHasModelsEnd \sa `SparseLinearAlgebraTraits_d` \sa `SparseLinearAlgebraTraits_d::Vector` diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h index 0313402d356..34df486f1e6 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h @@ -8,7 +8,8 @@ method to solve the system for different right-hand vectors. \cgalRefines{SparseLinearAlgebraTraits_d} -\cgalHasModel `CGAL::Eigen_solver_traits` +\cgalHasModelsBegin CGAL::Eigen_solver_traits +\cgalHasModelsEnd */ class SparseLinearAlgebraWithFactorTraits_d { public: diff --git a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h index 939b29a4959..2c843090296 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h @@ -5,7 +5,8 @@ The concept `SvdTraits` describes the linear algebra types and algorithms needed to solve in the least square sense a linear system with a singular value decomposition - \cgalHasModel `CGAL::Eigen_svd` +\cgalHasModelsBegin galHasModel `CGAL::Eigen_svd +\cgalHasModelsEnd */ class SvdTraits { @@ -51,7 +52,8 @@ public: \cgalConcept Concept of vector type used by the concept `SvdTraits`. -\cgalHasModel `CGAL::Eigen_vector` +\cgalHasModelsBegin CGAL::Eigen_vector +\cgalHasModelsEnd */ class SvdTraits::Vector { @@ -88,7 +90,8 @@ Concept of matrix type used by the concept `SvdTraits`. \cgalRefines{DefaultConstructible,Assignable} -\cgalHasModel `CGAL::Eigen_matrix` +\cgalHasModelsBegin CGAL::Eigen_matrix +\cgalHasModelsEnd */ class SvdTraits::Matrix { diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h index a8aa2640a2c..4e0837b36be 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h @@ -4,8 +4,9 @@ The concept `FuzzyQueryItem` describes the requirements for fuzzy `d`-dimensional spatial objects. -\cgalHasModel `CGAL::Fuzzy_sphere` +\cgalHasModelsBegin CGAL::Fuzzy_sphere \cgalHasModel `CGAL::Fuzzy_iso_box` +\cgalHasModelsEnd */ diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h index fd72ee75e07..7a8506131f6 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h @@ -8,8 +8,9 @@ To optimize distance computations transformed distances are used, e.g., for a Euclidean distance the transformed distance is the squared Euclidean distance. -\cgalHasModel `CGAL::Manhattan_distance_iso_box_point` -\cgalHasModel `CGAL::Euclidean_distance_sphere_point` +\cgalHasModelsBegin CGAL::Manhattan_distance_iso_box_point +\cgalHasModels CGAL::Euclidean_distance_sphere_point +\cgalHasModelsEnd */ diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h index d2a398589d8..b2f826e4074 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h @@ -8,8 +8,9 @@ E.g., for an Euclidean distance the transformed distance is the squared Euclidea \cgalRefines{GeneralDistance} -\cgalHasModel `CGAL::Euclidean_distance` -\cgalHasModel `CGAL::Weighted_Minkowski_distance` +\cgalHasModelsBegin CGAL::Euclidean_distance +\cgalHasModels CGAL::Weighted_Minkowski_distance +\cgalHasModelsEnd */ diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h index 5e7e310f0a5..feb9af6f79e 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h @@ -8,12 +8,13 @@ range search queries in a model of `SpatialTree`. \cgalRefines{SearchTraits} -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Homogeneous_d` -\cgalHasModel `CGAL::Epick_d` -\cgalHasModel `CGAL::Epeck_d` -\cgalHasModel `CGAL::Search_traits_2` -\cgalHasModel `CGAL::Search_traits_3` +\cgalHasModelsBegin CGAL::Cartesian_d +\cgalHasModels CGAL::Homogeneous_d +\cgalHasModels CGAL::Epick_d +\cgalHasModels CGAL::Epeck_d +\cgalHasModels CGAL::Search_traits_2 +\cgalHasModels CGAL::Search_traits_3 +\cgalHasModelsEnd \sa `SearchTraits` \sa `CGAL::Search_traits_adapter` diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h index df585ebf4fc..96857238a64 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h @@ -5,7 +5,7 @@ The concept `SearchGeomTraits_2` defines the requirements for the template parameter of the search traits classes. -\cgalHasModel Any \cgal Kernel +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} */ class SearchGeomTraits_2 { diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h index 243277705d8..85191a1b096 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h @@ -5,7 +5,7 @@ The concept `SearchGeomTraits_3` defines the requirements for the template parameter of the search traits classes. -\cgalHasModel All models of the concept `Kernel` +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} */ diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h index 65240b519ce..6bfe70109e0 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h @@ -5,14 +5,15 @@ The concept `SearchTraits` defines the requirements for the template parameter of the search classes. -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Homogeneous_d` -\cgalHasModel `CGAL::Epick_d` -\cgalHasModel `CGAL::Epeck_d` -\cgalHasModel `CGAL::Search_traits_2` -\cgalHasModel `CGAL::Search_traits_3` -\cgalHasModel `CGAL::Search_traits_d` -\cgalHasModel `CGAL::Search_traits` +\cgalHasModelsBegin CGAL::Cartesian_d +\cgalHasModels CGAL::Homogeneous_d +\cgalHasModels CGAL::Epick_d +\cgalHasModels CGAL::Epeck_d +\cgalHasModels CGAL::Search_traits_2 +\cgalHasModels CGAL::Search_traits_3 +\cgalHasModels CGAL::Search_traits_d +\cgalHasModels CGAL::Search_traits +\cgalHasModelsEnd \sa `RangeSearchTraits` \sa `CGAL::Search_traits_adapter` diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h index 271d102b067..ecdc521ce9f 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h @@ -11,7 +11,8 @@ space is said to be on the negative side of the separator and the other part of space is said to be on the positive side of the separator. -\cgalHasModel `CGAL::Plane_separator` +\cgalHasModelsBegin CGAL::Plane_separator +\cgalHasModelsEnd */ diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h index 6ff8b6d31b0..58d396cec22 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h @@ -5,7 +5,8 @@ The concept `SpatialTree` defines the requirements for a tree supporting both neighbor searching and approximate range searching. -\cgalHasModel `CGAL::Kd_tree` +\cgalHasModelsBegin CGAL::Kd_tree +\cgalHasModelsEnd */ diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h index ee553429837..88a18887640 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h @@ -7,13 +7,14 @@ The concept `Splitter` defines the requirements for a function object class implementing a splitting rule. \cgalAdvancedEnd -\cgalHasModel `CGAL::Fair` -\cgalHasModel `CGAL::Median_of_rectangle` -\cgalHasModel `CGAL::Median_of_max_spread` -\cgalHasModel `CGAL::Midpoint_of_rectangle` -\cgalHasModel `CGAL::Midpoint_of_max_spread` -\cgalHasModel `CGAL::Sliding_fair` -\cgalHasModel `CGAL::Sliding_midpoint` +\cgalHasModelsBegin CGAL::Fair +\cgalHasModels CGAL::Median_of_rectangle +\cgalHasModels CGAL::Median_of_max_spread +\cgalHasModels CGAL::Midpoint_of_rectangle +\cgalHasModels CGAL::Midpoint_of_max_spread +\cgalHasModels CGAL::Sliding_fair +\cgalHasModels CGAL::Sliding_midpoint +\cgalHasModelsEnd */ diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h index e2bb9ee8881..8a48e705bd0 100644 --- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h +++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h @@ -9,8 +9,8 @@ primitives (objects and predicates) that the sorting algorithms use. `SpatialSortingTraits_2` defines the complete set of primitives required in these functions and functors. -\cgalHasModel Any \cgal kernel. -\cgalHasModel `CGAL::Spatial_sort_traits_adapter_2` +\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Spatial_sort_traits_adapter_2 +\cgalHasModelsEnd */ diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h index 7fad8da4666..2cef4c17269 100644 --- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h +++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h @@ -9,8 +9,8 @@ primitives (objects and predicates) that the sorting algorithms use. `SpatialSortingTraits_3` defines the complete set of primitives required in these functions and functors. -\cgalHasModel Any \cgal kernel. -\cgalHasModel `CGAL::Spatial_sort_traits_adapter_3` +\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Spatial_sort_traits_adapter_3 +\cgalHasModelsEnd */ diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h index c91e76a99cd..a0c4dfd031d 100644 --- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h +++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h @@ -9,8 +9,8 @@ primitives (objects and predicates) that the sorting algorithms use. `SpatialSortingTraits_d` defines the complete set of primitives required in these functions and functors. -\cgalHasModel Any \cgal `d`-dimensional kernel. -\cgalHasModel `CGAL::Spatial_sort_traits_adapter_d` +\cgalHasModelsBareBegin{Any \cgal `d`-dimensional kernel.} CGAL::Spatial_sort_traits_adapter_d +\cgalHasModelsEnd */ diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h index d0c364262cb..15aa1efc7da 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h @@ -7,7 +7,8 @@ The concept `PolygonOffsetBuilderTraits_2` describes the requirements for the geometric traits class required by the algorithm class `CGAL::Polygon_offset_builder_2`. -\cgalHasModel `CGAL::Polygon_offset_builder_traits_2` +\cgalHasModelsBegin CGAL::Polygon_offset_builder_traits_2 +\cgalHasModelsEnd \sa `CGAL::Polygon_offset_builder_2` */ diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h index f971c1c880c..a19486171c4 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h @@ -7,7 +7,8 @@ The concept `StraightSkeletonBuilderTraits_2` describes the requirements for the geometric traits class required by the algorithm class `CGAL::Straight_skeleton_builder_2`. -\cgalHasModel `CGAL::Straight_skeleton_builder_traits_2` +\cgalHasModelsBegin CGAL::Straight_skeleton_builder_traits_2 +\cgalHasModelsEnd */ class StraightSkeletonBuilderTraits_2 { public: diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h index 4860b9ab6b8..316fbc4b0e0 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h @@ -5,7 +5,8 @@ The concept `StraightSkeletonBuilder_2_Visitor` describes the requirements of the visitor class required by the algorithm class `CGAL::Straight_skeleton_builder_2` in its third template parameter. -\cgalHasModel `CGAL::Dummy_straight_skeleton_builder_2_visitor` +\cgalHasModelsBegin CGAL::Dummy_straight_skeleton_builder_2_visitor +\cgalHasModelsEnd \sa `CGAL::Straight_skeleton_builder_2` */ diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h index 311987667fb..16bf5a396b5 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h @@ -8,7 +8,8 @@ The concept `StraightSkeletonFace_2` describes the requirements for the face typ `StraightSkeleton_2` concept. It is a refinement of the `HalfedgeDSFace` concept with support for storage of the incident halfedge. -\cgalHasModel `CGAL::Straight_skeleton_face_base_2` +\cgalHasModelsBegin CGAL::Straight_skeleton_face_base_2 +\cgalHasModelsEnd \sa `StraightSkeletonVertex_2` \sa `StraightSkeletonHalfedge_2` diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h index 6225e4f613f..22caa9419c0 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h @@ -12,7 +12,8 @@ The only geometric embedding used by the Straight Skeleton Data Structure are th in the contour and skeleton vertices. However, for any halfedge, there is a 2D segment implicitly given by its `source` and `target` vertices. -\cgalHasModel `CGAL::Straight_skeleton_halfedge_base_2` +\cgalHasModelsBegin CGAL::Straight_skeleton_halfedge_base_2 +\cgalHasModelsEnd \sa `StraightSkeleton_2` \sa `StraightSkeletonHalfedge_2` diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h index 55f5c799095..a95688dc6e7 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h @@ -6,7 +6,8 @@ The concept `StraightSkeletonItemsConverter_2` describes the requirements for it as the third template argument to the class `Straight_skeleton_converter_2`. It converts the `HDS` items from one type of straight skeleton to another. -\cgalHasModel `CGAL::Straight_skeleton_items_converter_2` +\cgalHasModelsBegin CGAL::Straight_skeleton_items_converter_2 +\cgalHasModelsEnd \sa `CGAL::Straight_skeleton_converter_2` */ diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h index 7a26285dccf..a53a002940e 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h @@ -9,7 +9,8 @@ The concept `StraightSkeletonVertex_2` describes the requirements for the vertex with support for storage of the incident halfedge. The `StraightSkeletonVertex_2` concept requires the geometric embedding to be a 2D point. -\cgalHasModel `CGAL::Straight_skeleton_vertex_base_2` +\cgalHasModelsBegin CGAL::Straight_skeleton_vertex_base_2 +\cgalHasModelsEnd \sa `StraightSkeletonHalfedge_2` \sa `StraightSkeletonFace_2` diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h index 18a85973c5b..52dcfe61484 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h @@ -9,7 +9,8 @@ used to represent a straight skeleton. It refines the concept `HalfedgeDS` and adds additional requirements on the nested types `Vertex`, `Halfedge`, and `Face` of the halfedge data structure. -\cgalHasModel `CGAL::Straight_skeleton_2` +\cgalHasModelsBegin CGAL::Straight_skeleton_2 +\cgalHasModelsEnd \attention This concept explicitly protects all the modifying operations of the base `HalfedgeDS` concept. Only the algorithm diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h index ec96722d926..6f001fda04e 100644 --- a/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h +++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h @@ -9,8 +9,9 @@ the second template parameter of the class provides the operation that integrates a new point from a given point with a predefined step, and according to a specified vector. -\cgalHasModel `CGAL::Euler_integrator_2` -\cgalHasModel `CGAL::Runge_kutta_integrator_2` +\cgalHasModelsBegin CGAL::Euler_integrator_2 +\cgalHasModels CGAL::Runge_kutta_integrator_2 +\cgalHasModelsEnd */ diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h index a55c74b6ac2..e1394b70945 100644 --- a/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h +++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h @@ -9,7 +9,7 @@ the template parameter of the class This concept provides the types handled by the `CGAL::Stream_lines_2` class. -\cgalHasModel The kernels of \cgal are models for this traits class. +\cgalHasModelsBare{The kernels of \cgal are models for this traits class.} */ class StreamLinesTraits_2 { diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h index 9b44da48a2f..b42a88dba95 100644 --- a/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h +++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h @@ -9,8 +9,9 @@ the first template parameter of the class provides the types of the geometric primitives used in the placement of streamlines and some functions for answering different queries. -\cgalHasModel `CGAL::Regular_grid_2` -\cgalHasModel `CGAL::Triangular_field_2` +\cgalHasModelsBegin CGAL::Regular_grid_2 +\cgalHasModels CGAL::Triangular_field_2 +\cgalHasModelsEnd */ diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h index c5a06d95618..2a0e662a0e8 100644 --- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h +++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h @@ -11,7 +11,8 @@ policy concept of geometric computations is used in \cgalRefines{SubdivisionMask_3} -\cgalHasModel `CGAL::DooSabin_mask_3` +\cgalHasModelsBegin CGAL::DooSabin_mask_3 +\cgalHasModelsEnd \sa `CGAL::Subdivision_method_3` diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h index bb28f171b02..22c59d45ad2 100644 --- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h +++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h @@ -11,7 +11,8 @@ policy concept of geometric computations is used in \cgalRefines{SubdivisionMask_3} -\cgalHasModel `CGAL::CatmullClark_mask_3` +\cgalHasModelsBegin CGAL::CatmullClark_mask_3 +\cgalHasModelsEnd \sa `CGAL::Subdivision_method_3` diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h index 6050b444ad3..2faff045bd6 100644 --- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h +++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h @@ -10,7 +10,8 @@ policy concept of geometric computations is used in \cgalRefines{SubdivisionMask_3} -\cgalHasModel `CGAL::Loop_mask_3` +\cgalHasModelsBegin CGAL::Loop_mask_3 +\cgalHasModelsEnd \sa `CGAL::Subdivision_method_3` */ diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h index ee5fc38d907..ed311db671a 100644 --- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h +++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h @@ -9,7 +9,8 @@ policy concept of geometric computations is used in \cgalRefines{SubdivisionMask_3} -\cgalHasModel `CGAL::Sqrt3_mask_3` +\cgalHasModelsBegin CGAL::Sqrt3_mask_3 +\cgalHasModelsEnd \sa `CGAL::Subdivision_method_3` diff --git a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h index f84b271c289..68364e07863 100644 --- a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h +++ b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h @@ -6,8 +6,9 @@ The concept `ErrorMetricProxy` defines the notion of proxy, computes the fitting error from a face to a proxy, and fits a proxy from a range of faces. -\cgalHasModel `CGAL::Surface_mesh_approximation::L21_metric_plane_proxy` -\cgalHasModel `CGAL::Surface_mesh_approximation::L2_metric_plane_proxy` +\cgalHasModelsBegin CGAL::Surface_mesh_approximation::L21_metric_plane_proxy +\cgalHasModels CGAL::Surface_mesh_approximation::L2_metric_plane_proxy +\cgalHasModelsEnd */ class ErrorMetricProxy { diff --git a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h index a8dbb00b46b..65137707986 100644 --- a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h +++ b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h @@ -9,8 +9,9 @@ to implement models of this concept. \cgalRefines{DefaultConstructible} -\cgalHasModel `CGAL::Deformation_Eigen_closest_rotation_traits_3` -\cgalHasModel `CGAL::Deformation_Eigen_polar_closest_rotation_traits_3` +\cgalHasModelsBegin CGAL::Deformation_Eigen_closest_rotation_traits_3 +\cgalHasModels CGAL::Deformation_Eigen_polar_closest_rotation_traits_3 +\cgalHasModelsEnd */ class DeformationClosestRotationTraits_3{ diff --git a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h index 32a71b17f71..67002d031ae 100644 --- a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h +++ b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h @@ -12,16 +12,17 @@ the border of a given mesh. Construction and destruction are undefined. -\cgalHasModel `CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3` -\cgalHasModel `CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3` +\cgalHasModelsBegin CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3 +\cgalHasModels CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3 +\cgalHasModelsEnd \sa `CGAL::Surface_mesh_parameterization::Orbifold_Tutte_parameterizer_3` */ diff --git a/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h b/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h index 93450589cfc..2e0a58fa0a2 100644 --- a/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h +++ b/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h @@ -5,7 +5,7 @@ The concept `SegmentationGeomTraits` describes the set of requirements of the geometric traits needed by the segmentation functions. -\cgalHasModel All the \cgal Kernels +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} \cgalRefines{AABBGeomTraits} diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h index 652c3457496..51d4ae712eb 100644 --- a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h +++ b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h @@ -8,7 +8,8 @@ predicates, and constructions required by the traits class parameter of `CGAL::Surface_mesh_shortest_path`. \cgalRefines{CopyConstructible,Assignable} -\cgalHasModel `CGAL::Surface_mesh_shortest_path_traits` +\cgalHasModelsBegin CGAL::Surface_mesh_shortest_path_traits +\cgalHasModelsEnd */ diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h index 24a05f636c2..f31143efcc6 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h @@ -12,9 +12,10 @@ or can be intentionally returned to prevent the edge from being collapsed. \cgalRefines{DefaultConstructible,CopyConstructible} -\cgalHasModel `CGAL::Surface_mesh_simplification::Edge_length_cost` -\cgalHasModel `CGAL::Surface_mesh_simplification::LindstromTurk_cost` -\cgalHasModel `CGAL::Surface_mesh_simplification::GarlandHeckbert_policies` +\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Edge_length_cost +\cgalHasModels CGAL::Surface_mesh_simplification::LindstromTurk_cost +\cgalHasModels CGAL::Surface_mesh_simplification::GarlandHeckbert_policies +\cgalHasModelsEnd */ class GetCost diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h index e576472cb34..bb66ff08d05 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h @@ -14,11 +14,12 @@ or can be intentionally returned to prevent the edge from being collapsed. \cgalRefines{DefaultConstructible,CopyConstructible} -\cgalHasModel `CGAL::Surface_mesh_simplification::Midpoint_placement` -\cgalHasModel `CGAL::Surface_mesh_simplification::LindstromTurk_placement` -\cgalHasModel `CGAL::Surface_mesh_simplification::GarlandHeckbert_policies` -\cgalHasModel `CGAL::Surface_mesh_simplification::Bounded_normal_change_placement` -\cgalHasModel `CGAL::Surface_mesh_simplification::Constrained_placement` +\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Midpoint_placement +\cgalHasModels CGAL::Surface_mesh_simplification::LindstromTurk_placement +\cgalHasModels CGAL::Surface_mesh_simplification::GarlandHeckbert_policies +\cgalHasModels CGAL::Surface_mesh_simplification::Bounded_normal_change_placement +\cgalHasModels CGAL::Surface_mesh_simplification::Constrained_placement +\cgalHasModelsEnd */ diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h index 324c87f45ee..b6654407400 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h @@ -14,8 +14,9 @@ be absent). The value `boost::none` indicates that the edge should not be collap \cgalRefines{DefaultConstructible,CopyConstructible} -\cgalHasModel `CGAL::Surface_mesh_simplification::Bounded_normal_change_filter` -\cgalHasModel `CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter` +\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Bounded_normal_change_filter +\cgalHasModels CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter +\cgalHasModelsEnd */ diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h index ad5f22d4ccb..df8fc845f5b 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h @@ -4,11 +4,12 @@ The concept `StopPredicate` describes the requirements for the predicate which indicates if the simplification process must finish. -\cgalHasModel `CGAL::Surface_mesh_simplification::Edge_count_stop_predicate` -\cgalHasModel `CGAL::Surface_mesh_simplification::Face_count_stop_predicate` -\cgalHasModel `CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate` -\cgalHasModel `CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate` -\cgalHasModel `CGAL::Surface_mesh_simplification::Edge_length_stop_predicate` +\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Edge_count_stop_predicate +\cgalHasModels CGAL::Surface_mesh_simplification::Face_count_stop_predicate +\cgalHasModels CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate +\cgalHasModels CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate +\cgalHasModels CGAL::Surface_mesh_simplification::Edge_length_stop_predicate +\cgalHasModelsEnd */ class StopPredicate { diff --git a/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h b/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h index 824b21454e5..b7466a2ecd4 100644 --- a/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h +++ b/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h @@ -5,7 +5,7 @@ * * Traits class concept defining the requirements of the class `CGAL::Mean_curvature_flow_skeletonization`. * - * \cgalHasModel Any \cgal `Kernel` with `double` as `%Kernel::%FT` + * \cgalHasModelsBare{Any \cgal `Kernel` with `double` as `%Kernel::%FT`} * * */ diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h index 01c344d316c..6f6355c9390 100644 --- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h +++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h @@ -9,8 +9,8 @@ \cgalRefines{GenericMap} - \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map`\endlink - \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map`\endlink + \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map`\endlink\n + \link CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map`\endlink} */ class PolygonalSchema diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h index 8ee52354e37..0bf077baf42 100644 --- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h +++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h @@ -6,7 +6,7 @@ \cgalRefines{GenericMapItems} - \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_min_items `CGAL::Surface_mesh_topology::Polygonal_schema_min_items`\endlink + \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Polygonal_schema_min_items `CGAL::Surface_mesh_topology::Polygonal_schema_min_items`\endlink} */ class PolygonalSchemaItems diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h index 0062dd18e48..4650a313f02 100644 --- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h +++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h @@ -5,8 +5,8 @@ The concept `WeightFunctor` defines a functor to calculate the weight of an edge. - \cgalHasModel \link CGAL::Surface_mesh_topology::Unit_weight_functor `CGAL::Surface_mesh_topology::Unit_weight_functor`\endlink - \cgalHasModel \link CGAL::Surface_mesh_topology::Euclidean_length_weight_functor `CGAL::Surface_mesh_topology::Euclidean_length_weight_functor`\endlink + \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Unit_weight_functor `CGAL::Surface_mesh_topology::Unit_weight_functor`\endlink, + \link CGAL::Surface_mesh_topology::Euclidean_length_weight_functor `CGAL::Surface_mesh_topology::Euclidean_length_weight_functor`\endlink} */ class WeightFunctor { public: diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h index a713151a311..319bf352f0c 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h @@ -7,8 +7,8 @@ The concept `ImplicitFunction` describes a function object whose `operator()` computes the values of a function \f$ f : \mathbb{R}^3 \longrightarrow \mathbb{R}\f$. -\cgalHasModel CGAL::Gray_level_image_3 -\cgalHasModel any pointer to a function of type `FT (*)(Point)` +\cgalHasModelsBareBegin{any pointer to a function of type `FT (*)(Point)`} CGAL::Gray_level_image_3 +\cgalHasModelsEnd \sa `CGAL::Implicit_surface_3` \sa `CGAL::make_surface_mesh()` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h index fed39a225af..28814f2648e 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h @@ -15,7 +15,7 @@ the concept `ImplicitSurfaceTraits_3` provides the types, predicates and constru that are passed to the generated model of `SurfaceMeshTraits_3`. -\cgalHasModel Any \cgal Kernel. +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} \sa `CGAL::Implicit_surface_3` \sa `CGAL::make_surface_mesh()` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h index f418f71e47b..1b16bc506f1 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h @@ -37,8 +37,9 @@ of the restriction to the surface of a three dimensional triangulation. In the following we call surface center of a facet, the center of its biggest Delaunay surface ball. -\cgalHasModel `CGAL::Surface_mesh_cell_base_3` -\cgalHasModel `CGAL::Surface_mesh_default_triangulation_3::Cell` +\cgalHasModelsBegin CGAL::Surface_mesh_cell_base_3 +\cgalHasModels CGAL::Surface_mesh_default_triangulation_3::Cell +\cgalHasModelsEnd \sa `SurfaceMeshTriangulation_3` \sa `SurfaceMeshComplex_2InTriangulation_3` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h index 1f8cb4f169f..ec9eba19372 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h @@ -30,7 +30,8 @@ A model of this concept is a type to be plugged as first template parameter in the function template `CGAL::make_surface_mesh()`. -\cgalHasModel `CGAL::Surface_mesh_complex_2_in_triangulation_3` +\cgalHasModelsBegin CGAL::Surface_mesh_complex_2_in_triangulation_3 +\cgalHasModelsEnd \sa `CGAL::make_surface_mesh()` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h index 28b866387ea..7380607aca0 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h @@ -33,7 +33,8 @@ is just a lexicographical comparison. The meshing algorithm handles facets with lowest quality first. The qualities are computed by a function `is_bad(const Facet& f, const Quality& q)`. -\cgalHasModel `CGAL::Surface_mesh_default_criteria_3` +\cgalHasModelsBegin CGAL::Surface_mesh_default_criteria_3 +\cgalHasModelsEnd \sa `CGAL::make_surface_mesh()` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h index 15d0256b2bc..dd728781a7f 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h @@ -11,7 +11,8 @@ and to compute some intersection points if any exists. The concept `SurfaceMeshTraits_3` also includes a funcctor able to provide a small set of initial points on the surface. -\cgalHasModel `CGAL::Surface_mesh_traits_generator_3::type` +\cgalHasModelsBegin CGAL::Surface_mesh_traits_generator_3::type +\cgalHasModelsEnd \sa `CGAL::make_surface_mesh()` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h index 7d502a9bf41..7af1aba64ca 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h @@ -17,7 +17,7 @@ the requirements for the triangulation type plugged in the class `CGAL::Surface_mesh_complex_2_in_triangulation_3`. -\cgalHasModel Any 3D Delaunay triangulation class of \cgal +\cgalHasModelsBare{Any 3D Delaunay triangulation class of \cgal} \sa `CGAL::Triangulation_3` \sa `CGAL::Delaunay_triangulation_3` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h index 5e1f3b3098d..086b7759ac9 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h @@ -31,8 +31,9 @@ integers, which, when they are valid, store respectively the number of complex facets incident to the vertex and the number of connected components of the adjacency graph of those facets. -\cgalHasModel `CGAL::Surface_mesh_vertex_base_3` -\cgalHasModel `CGAL::Surface_mesh_default_triangulation_3::Vertex` +\cgalHasModelsBegin CGAL::Surface_mesh_vertex_base_3 +\cgalHasModels CGAL::Surface_mesh_default_triangulation_3::Vertex +\cgalHasModelsEnd \sa `SurfaceMeshComplex_2InTriangulation_3` \sa `CGAL::Surface_mesh_complex_2_in_triangulation_3` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h index 6e0694fda56..0e5cca74dfe 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h @@ -8,7 +8,8 @@ The surface types are required to be copy constructible and assignable. -\cgalHasModel `CGAL::Implicit_surface_3` +\cgalHasModelsBegin CGAL::Implicit_surface_3 +\cgalHasModelsEnd \sa `CGAL::make_surface_mesh()` \sa `SurfaceMeshTraits_3` diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h index d3bc61921c5..e10d068c1b1 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h @@ -48,7 +48,8 @@ that the `CGAL::Triangulation_data_structure_2` actually uses as a base class for the class `CGAL::Triangulation_data_structure_2::Face`. -\cgalHasModel `CGAL::Triangulation_ds_face_base_2` +\cgalHasModelsBegin CGAL::Triangulation_ds_face_base_2 +\cgalHasModelsEnd \sa `TriangulationDSVertexBase_2` \sa `CGAL::Triangulation_data_structure_2` diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h index 8402f4f4442..e47b7cfbf3f 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h @@ -44,7 +44,8 @@ that the `CGAL::Triangulation_data_structure_2` actually uses as a base class for the class of `CGAL::Triangulation_data_structure_2::Vertex`. -\cgalHasModel `CGAL::Triangulation_ds_vertex_base_2` +\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_2 +\cgalHasModelsEnd \sa `TriangulationDSFaceBase_2` \sa `CGAL::Triangulation_data_structure_2` diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h index b2c1b5a0886..a5daedcbc28 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h @@ -64,7 +64,8 @@ the rank of this item in the output order. When dimension \f$ <\f$ 2, the same information is output for faces of maximal dimension instead of faces. -\cgalHasModel `CGAL::Triangulation_data_structure_2` +\cgalHasModelsBegin CGAL::Triangulation_data_structure_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2::Face` \sa `TriangulationDataStructure_2::Vertex` @@ -726,7 +727,8 @@ In order to obtain new vertices or destruct unused vertices, the user must call the `create_vertex()` and `delete_vertex()` methods of the triangulation data structure. -\cgalHasModel `CGAL::Triangulation_ds_vertex_base_2` +\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_2 +\cgalHasModelsEnd \sa `TriangulationDSVertexBase_2` \sa `TriangulationDataStructure_2::Face` @@ -847,7 +849,8 @@ The methods `create_face()` and have to be used to define new faces and to delete no longer used faces. -\cgalHasModel `CGAL::Triangulation_ds_face_base_2` +\cgalHasModelsBegin CGAL::Triangulation_ds_face_base_2 +\cgalHasModelsEnd \sa `TriangulationDSFaceBase_2` \sa `TriangulationDataStructure_2` diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h index 4ce03689c74..59f5b45bbe2 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h @@ -33,7 +33,8 @@ cell classes. The rebound base classes so obtained are the classes which are used as base classes for the final vertex and cell classes. More information can be found in Section \ref TDS3secdesign. -\cgalHasModel `CGAL::Triangulation_ds_cell_base_3` +\cgalHasModelsBegin CGAL::Triangulation_ds_cell_base_3 +\cgalHasModelsEnd \sa `TriangulationDSVertexBase_3` \sa `CGAL::Triangulation_data_structure_3` diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h index eef2cf0d3d4..9ef2cd34bbc 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h @@ -28,7 +28,8 @@ cell classes. The rebound base classes so obtained are the classes which are used as base classes for the final vertex and cell classes. More information can be found in Section \ref TDS3secdesign. -\cgalHasModel `CGAL::Triangulation_ds_vertex_base_3` +\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_3 +\cgalHasModelsEnd \sa `TriangulationDSCellBase_3` \sa `CGAL::Triangulation_data_structure_3` diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h index 081f9f98513..a2c6d41e933 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h @@ -65,7 +65,8 @@ neighbors of each cell, where the index corresponds to the preceding list of cells. When dimension < 3, the same information is stored for faces of maximal dimension instead of cells. -\cgalHasModel `CGAL::Triangulation_data_structure_3` +\cgalHasModelsBegin CGAL::Triangulation_data_structure_3 +\cgalHasModelsEnd \sa `TriangulationDataStructure_3::Vertex` \sa `TriangulationDataStructure_3::Cell` diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h index 01d05c5c873..aa3f4d68dc1 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h @@ -6,7 +6,8 @@ Cell base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`. -\cgalHasModel `CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3` +\cgalHasModelsBegin CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3 +\cgalHasModelsEnd */ class RemeshingCellBase_3 diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h index d275fbc03a7..ad71f044d99 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h @@ -10,7 +10,7 @@ of the class `Remeshing_triangulation_3`. It defines the geometric objects (points, segments, triangles, and tetrahedra) forming the triangulation together with a few geometric predicates and constructions on these objects. -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} \sa `CGAL::Triangulation_3` */ diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h index 0e9b0e86003..2b1b5bc8fc3 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h @@ -6,7 +6,8 @@ Vertex base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`. -\cgalHasModel `Tetrahedral_remeshing::Remeshing_vertex_base_3` +\cgalHasModelsBegin Tetrahedral_remeshing::Remeshing_vertex_base_3 +\cgalHasModelsEnd */ class RemeshingVertexBase_3 diff --git a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h index 670217bb50d..14395b71b93 100644 --- a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h @@ -9,8 +9,9 @@ a Delaunay triangulation. It corresponds to the first template parameter of the \cgalRefines{TriangulationTraits} -\cgalHasModel `CGAL::Epick_d` -\cgalHasModel `CGAL::Epeck_d` +\cgalHasModelsBegin CGAL::Epick_d +\cgalHasModels CGAL::Epeck_d +\cgalHasModelsEnd \sa `TriangulationTraits` */ diff --git a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h index 00ec18a9e8c..35b31839b7a 100644 --- a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h @@ -9,8 +9,9 @@ a regular triangulation. It corresponds to the first template parameter of the c \cgalRefines{TriangulationTraits} -\cgalHasModel `CGAL::Epick_d` -\cgalHasModel `CGAL::Epeck_d` +\cgalHasModelsBegin CGAL::Epick_d +\cgalHasModels CGAL::Epeck_d +\cgalHasModelsEnd \sa `TriangulationTraits` */ diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h index 24188ada103..d92afbd427e 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h @@ -15,7 +15,8 @@ The dimension of a face is implicitly set when `TriangulationDSFace::set_index` is called two times to set the first two vertices (`i = 0` and `i = 1`), then the dimension is 1. -\cgalHasModel `CGAL::Triangulation_face` +\cgalHasModelsBegin CGAL::Triangulation_face +\cgalHasModelsEnd \sa `TriangulationDSFullCell` \sa `TriangulationDSVertex` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h index a29eef83396..3e32c2423a2 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h @@ -36,8 +36,9 @@ of `CGAL::Triangulation_data_structure::Vertex`. \cgalRefines{TriangulationDataStructure::FullCell} -\cgalHasModel `CGAL::Triangulation_ds_full_cell` -\cgalHasModel `CGAL::Triangulation_full_cell` +\cgalHasModelsBegin CGAL::Triangulation_ds_full_cell +\cgalHasModels CGAL::Triangulation_full_cell +\cgalHasModelsEnd \sa `TriangulationDSVertex` \sa `TriangulationDSFace` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h index 30b22c4994b..c23aaabe1ea 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h @@ -36,8 +36,9 @@ of `CGAL::Triangulation_data_structure::Vertex`. \cgalRefines{TriangulationDataStructure::Vertex} -\cgalHasModel `CGAL::Triangulation_ds_vertex` -\cgalHasModel `CGAL::Triangulation_vertex` +\cgalHasModelsBegin CGAL::Triangulation_ds_vertex +\cgalHasModels CGAL::Triangulation_vertex +\cgalHasModelsEnd \sa `TriangulationDSFullCell` \sa `TriangulationDSFace` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h index 3e3228db4c9..c17ded6feb1 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h @@ -69,7 +69,8 @@ The classes `Vertex` and `Full_cell` have to provide the relevant I/O operators (possibly empty). -\cgalHasModel `CGAL::Triangulation_data_structure` +\cgalHasModelsBegin CGAL::Triangulation_data_structure +\cgalHasModelsEnd \sa `TriangulationDataStructure::Vertex` \sa `TriangulationDataStructure::FullCell` @@ -660,8 +661,9 @@ It sets requirements of combinatorial nature only, as geometry is not concerned here. In particular, we only require that the vertex holds a handle to a full cell incident to it in the triangulation. -\cgalHasModel `CGAL::Triangulation_ds_vertex` -\cgalHasModel `CGAL::Triangulation_vertex` +\cgalHasModelsBegin CGAL::Triangulation_ds_vertex +\cgalHasModels CGAL::Triangulation_vertex +\cgalHasModelsEnd \sa `TriangulationDataStructure::FullCell` \sa `TriangulationDataStructure::Face` @@ -767,8 +769,9 @@ full cell as well as handles to the adjacent full cells. Two full cells are said to be adjacent when they share a facet. Adjacent full cells are called hereafter neighbors. -\cgalHasModel `CGAL::Triangulation_ds_full_cell` -\cgalHasModel `CGAL::Triangulation_full_cell` +\cgalHasModelsBegin CGAL::Triangulation_ds_full_cell +\cgalHasModels CGAL::Triangulation_full_cell +\cgalHasModelsEnd \sa `TriangulationDataStructure::FullCell` \sa `TriangulationDataStructure::Face` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h index 74750c4117a..eba0214810a 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h @@ -10,7 +10,8 @@ represent a full cell. \cgalRefines{TriangulationDSFullCell We only list below the additional specific requirements of `TriangulationFullCell`} -\cgalHasModel `CGAL::Triangulation_full_cell` +\cgalHasModelsBegin CGAL::Triangulation_full_cell +\cgalHasModelsEnd \sa `CGAL::Triangulation_full_cell` \sa `TriangulationVertex` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h index 87018c11c3c..3d004b52c28 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h @@ -14,8 +14,9 @@ traits must refine `SpatialSortingTraits_d`. The insertion is then optimized using spatial sorting. This is not required if the points are inserted one by one. -\cgalHasModel `CGAL::Epick_d` -\cgalHasModel `CGAL::Epeck_d` +\cgalHasModelsBegin CGAL::Epick_d +\cgalHasModels CGAL::Epeck_d +\cgalHasModelsEnd \sa `DelaunayTriangulationTraits` */ diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h index 0ea82971793..956acd269f1 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h @@ -12,7 +12,8 @@ We only list below the additional specific requirements of ::TriangulationVertex Compared to ::TriangulationDSVertex, the main difference is the addition of an association of the vertex with a geometric point. -\cgalHasModel `CGAL::Triangulation_vertex` +\cgalHasModelsBegin CGAL::Triangulation_vertex +\cgalHasModelsEnd \cgalHeading{Input/Output} diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h index f0483d539cc..bf4b52d43c4 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h @@ -17,10 +17,10 @@ The concept `ConstrainedDelaunayTriangulationTraits_2` refines both the concept \cgalRefines{DelaunayTriangulationTraits_2,ConstrainedTriangulationTraits_2} -\cgalHasModel All \cgal Kernels -\cgalHasModel `CGAL::Projection_traits_xy_3` -\cgalHasModel `CGAL::Projection_traits_yz_3` -\cgalHasModel `CGAL::Projection_traits_xz_3` +\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3 +\cgalHasModels CGAL::Projection_traits_yz_3 +\cgalHasModels CGAL::Projection_traits_xz_3 +\cgalHasModelsEnd \sa `TriangulationTraits_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h index 1d49d678c47..a5a98882faa 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h @@ -19,7 +19,8 @@ constraints. Defines the same types as the `TriangulationFaceBase_2` concept -\cgalHasModel `CGAL::Constrained_triangulation_face_base_2` +\cgalHasModelsBegin CGAL::Constrained_triangulation_face_base_2 +\cgalHasModelsEnd \sa `TriangulationFaceBase_2` \sa `CGAL::Constrained_triangulation_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h index 6f7a9e5ea85..0af95612856 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h @@ -19,11 +19,11 @@ to compute the squared distance between a point and a line \cgalRefines{TriangulationTraits_2} -\cgalHasModel All \cgal Kernels -\cgalHasModel `CGAL::Projection_traits_3` -\cgalHasModel `CGAL::Projection_traits_xy_3` -\cgalHasModel `CGAL::Projection_traits_yz_3` -\cgalHasModel `CGAL::Projection_traits_xz_3` +\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_3 +\cgalHasModels CGAL::Projection_traits_xy_3 +\cgalHasModels CGAL::Projection_traits_yz_3 +\cgalHasModels CGAL::Projection_traits_xz_3 +\cgalHasModelsEnd \sa `TriangulationTraits_2` \sa `ConstrainedDelaunayTriangulationTraits_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h index 32b251a5060..d223c281d3c 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h @@ -22,12 +22,12 @@ required if the method `nearest_vertex()` is used. \cgalRefines{TriangulationTraits_2} -\cgalHasModel \cgal kernels -\cgalHasModel `CGAL::Projection_traits_3` (not for dual Voronoi functions) -\cgalHasModel `CGAL::Projection_traits_xy_3` (not for dual Voronoi functions) -\cgalHasModel `CGAL::Projection_traits_xy_3` (not for dual Voronoi functions) -\cgalHasModel `CGAL::Projection_traits_yz_3` (not for dual Voronoi functions) -\cgalHasModel `CGAL::Projection_traits_xz_3` (not for dual Voronoi functions) +\cgalHasModelsBare{All models of the \cgal concept `Kernel`\n + `CGAL::Projection_traits_3` (not for dual Voronoi functions)\n + `CGAL::Projection_traits_xy_3` (not for dual Voronoi functions)\n + `CGAL::Projection_traits_xy_3` (not for dual Voronoi functions)\n + `CGAL::Projection_traits_yz_3` (not for dual Voronoi functions)\n + `CGAL::Projection_traits_xz_3` (not for dual Voronoi functions)} \sa `TriangulationTraits_2` */ diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h index 6d69fe98604..26c24a4e86b 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h @@ -34,7 +34,8 @@ in the face a list to store hidden vertices. \cgalRefines{TriangulationFaceBase_2} -\cgalHasModel `CGAL::Regular_triangulation_face_base_2` +\cgalHasModelsBegin CGAL::Regular_triangulation_face_base_2 +\cgalHasModelsEnd \sa `TriangulationFaceBase_2` \sa `RegularTriangulationVertexBase_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h index 89ae384c8bf..e935587ab86 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h @@ -18,7 +18,7 @@ of Delaunay triangulations. \cgalRefines{TriangulationTraits_2} -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} \sa `CGAL::Regular_triangulation_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h index 62230e270a7..af73baa9681 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h @@ -35,7 +35,8 @@ vertex of the triangulation or a hidden vertex. \cgalRefines{TriangulationVertexBase_2} -\cgalHasModel `CGAL::Regular_triangulation_vertex_base_2` +\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_2 +\cgalHasModelsEnd \sa `TriangulationVertexBase_2` \sa `CGAL::Regular_triangulation_vertex_base_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h index 353f5631060..17ee831ec0b 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h @@ -16,7 +16,8 @@ and only provided for symmetry with the vertex case. \cgalRefines{TriangulationDSFaceBase_2} -\cgalHasModel `CGAL::Triangulation_face_base_2` +\cgalHasModelsBegin CGAL::Triangulation_face_base_2 +\cgalHasModelsEnd \sa `TriangulationVertexBase_2` \sa `CGAL::Triangulation_face_base_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h index 5d473eabfb6..497c1fadde7 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h @@ -14,7 +14,8 @@ next and previous level triangulations. \cgalRefines{TriangulationVertexBase_2} -\cgalHasModel `CGAL::Triangulation_hierarchy_vertex_base_2` +\cgalHasModelsBegin CGAL::Triangulation_hierarchy_vertex_base_2 +\cgalHasModelsEnd \sa `CGAL::Triangulation_hierarchy_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h index eeee9572516..f158bbeea8d 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h @@ -12,11 +12,11 @@ provides the types of the geometric primitives used in the triangulation and some function object types for the required predicates on those primitives. -\cgalHasModel All models of `Kernel`. -\cgalHasModel `CGAL::Projection_traits_3` -\cgalHasModel `CGAL::Projection_traits_xy_3` -\cgalHasModel `CGAL::Projection_traits_yz_3` -\cgalHasModel `CGAL::Projection_traits_xz_3` +\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_3 +\cgalHasModels CGAL::Projection_traits_xy_3 +\cgalHasModels CGAL::Projection_traits_yz_3 +\cgalHasModels CGAL::Projection_traits_xz_3 +\cgalHasModelsEnd \sa `CGAL::Triangulation_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h index 0ce1e0012c9..c5e59974834 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h @@ -8,7 +8,8 @@ and provides an additional information storage. \cgalRefines{TriangulationVertexBase_2} -\cgalHasModel `CGAL::Triangulation_vertex_base_with_info_2` +\cgalHasModelsBegin CGAL::Triangulation_vertex_base_with_info_2 +\cgalHasModelsEnd */ diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h index bec156dc516..816e93b382a 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h @@ -15,7 +15,8 @@ the vertex base of a triangulation stores a point. \cgalRefines{TriangulationDSVertexBase_2} -\cgalHasModel `CGAL::Triangulation_vertex_base_2` +\cgalHasModelsBegin CGAL::Triangulation_vertex_base_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `TriangulationDataStructure_2::Vertex` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h index b6e1a9b2515..4df0ce0f752 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h @@ -11,8 +11,9 @@ in the cell an operator that computes its circumcenter. \cgalRefines{TriangulationCellBase_3} -\cgalHasModel `CGAL::Delaunay_triangulation_cell_base_3` -\cgalHasModel `CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3` +\cgalHasModelsBegin CGAL::Delaunay_triangulation_cell_base_3 +\cgalHasModels CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3 +\cgalHasModelsEnd \sa `DelaunayTriangulationTraits_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h index c1f46f3fb4f..b727b6013c9 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h @@ -10,13 +10,14 @@ predicates and constructions on these objects. \cgalRefines{TriangulationTraits_3} -\cgalHasModel `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended) -\cgalHasModel `CGAL::Exact_predicates_exact_constructions_kernel` (recommended for Voronoi) -\cgalHasModel `CGAL::Filtered_kernel` -\cgalHasModel `CGAL::Cartesian` -\cgalHasModel `CGAL::Simple_cartesian` -\cgalHasModel `CGAL::Homogeneous` -\cgalHasModel `CGAL::Simple_homogeneous` +\cgalHasModelsBegin CGAL::Exact_predicates_inexact_constructions_kernel (recommended) +\cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel (recommended for Voronoi) +\cgalHasModels CGAL::Filtered_kernel +\cgalHasModels CGAL::Cartesian +\cgalHasModels CGAL::Simple_cartesian +\cgalHasModels CGAL::Homogeneous +\cgalHasModels CGAL::Simple_homogeneous +\cgalHasModelsEnd In addition to the requirements described for the traits class of `CGAL::Triangulation_3`, the geometric traits class of a diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h index 4f83db499d7..9c776448106 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h @@ -19,7 +19,8 @@ circumcenter by calling `invalidate_weighted_circumcenter_cache()`. \cgalRefines{RegularTriangulationCellBase_3} -\cgalHasModel `CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3` +\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3 +\cgalHasModelsEnd \sa `RegularTriangulationTraits_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h index 7a00e04f1d8..b7362aca63f 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h @@ -35,7 +35,8 @@ and an operator to compute its weighted circumcenter. \cgalRefines{TriangulationCellBase_3} -\cgalHasModel `CGAL::Regular_triangulation_cell_base_3` +\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_3 +\cgalHasModelsEnd \sa `RegularTriangulationTraits_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h index 91057fe887f..41cd3c59fbc 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h @@ -15,7 +15,7 @@ or the weighted point \f$ {p}^{(w)}=(p,w_p)\f$. \cgalRefines{TriangulationTraits_3} -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} \sa `CGAL::Regular_triangulation_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h index 3881593c2d3..aa5da85428d 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h @@ -9,7 +9,8 @@ by adding a geometric point member. \cgalRefines{TriangulationDSVertexBase_3} -\cgalHasModel `CGAL::Regular_triangulation_vertex_base_3` +\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_3 +\cgalHasModelsEnd \sa `RegularTriangulationCellBase_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h index 5064256e445..4efba49955a 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h @@ -8,7 +8,8 @@ and provides an additional information storage. \cgalRefines{TriangulationCellBase_3} -\cgalHasModel `CGAL::Triangulation_cell_base_with_info_3` +\cgalHasModelsBegin CGAL::Triangulation_cell_base_with_info_3 +\cgalHasModelsEnd */ diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h index 69ae982347c..419ba6c4417 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h @@ -10,8 +10,9 @@ structure apply. \cgalRefines{TriangulationDSCellBase_3} -\cgalHasModel `CGAL::Triangulation_cell_base_3` -\cgalHasModel `CGAL::Triangulation_cell_base_with_info_3` +\cgalHasModelsBegin CGAL::Triangulation_cell_base_3 +\cgalHasModels CGAL::Triangulation_cell_base_with_info_3 +\cgalHasModelsEnd \sa `TriangulationVertexBase_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h index d7c62d3e4c6..96a428da050 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h @@ -11,7 +11,7 @@ triangles and tetrahedra) forming the triangulation together with a few geometric predicates and constructions on these objects: lexicographical comparison, orientation in case of coplanar points and orientation in space. -\cgalHasModel All models of `Kernel`. +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} \sa `CGAL::Triangulation_3` */ diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h index c9cf46d0062..2801c458013 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h @@ -8,7 +8,8 @@ and provides an additional information storage. \cgalRefines{TriangulationVertexBase_3} -\cgalHasModel `CGAL::Triangulation_vertex_base_with_info_3` +\cgalHasModelsBegin CGAL::Triangulation_vertex_base_with_info_3 +\cgalHasModelsEnd */ diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h index cd91c12e9a8..75d23eb5581 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h @@ -9,8 +9,9 @@ for the triangulation data structure. \cgalRefines{TriangulationDSVertexBase_3} -\cgalHasModel `CGAL::Triangulation_vertex_base_3` -\cgalHasModel `CGAL::Triangulation_vertex_base_with_info_3` +\cgalHasModelsBegin CGAL::Triangulation_vertex_base_3 +\cgalHasModels CGAL::Triangulation_vertex_base_with_info_3 +\cgalHasModelsEnd \sa `TriangulationCellBase_3` diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h index 397c3a7e799..d73727aaabc 100644 --- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h +++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h @@ -11,8 +11,9 @@ parameter of the class `CGAL::Delaunay_triangulation_on_sphere_2`. To the requirements listed within the concept `TriangulationOnSphereTraits_2`, this concept adds types and functors requirements related to build the dual on the sphere. -\cgalHasModel `CGAL::Delaunay_triangulation_on_sphere_traits_2` -\cgalHasModel `CGAL::Projection_on_sphere_traits_3` +\cgalHasModelsBegin CGAL::Delaunay_triangulation_on_sphere_traits_2 +\cgalHasModels CGAL::Projection_on_sphere_traits_3 +\cgalHasModelsEnd */ class DelaunayTriangulationOnSphereTraits_2 { diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h index fbb6ac030ed..0d1fe175810 100644 --- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h +++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h @@ -19,7 +19,8 @@ then the triangulation is not an orientable triangulated surface without boundar In this case, fictitious faces are added to the triangulation, called ghost faces, such that the triangulation is a topological sphere. -\cgalHasModel `CGAL::Triangulation_on_sphere_face_base_2` +\cgalHasModelsBegin CGAL::Triangulation_on_sphere_face_base_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `TriangulationOnSphereVertexBase_2` diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h index 0dad5563ff7..4ccf99b9a26 100644 --- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h +++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h @@ -13,8 +13,9 @@ triangulation and the function object types for the required predicates on those In particular, the traits class is expected to contain information about the sphere (center and radius) on which the points of the triangulation lie, as well as to provide means to change this information. -\cgalHasModel `CGAL::Delaunay_triangulation_on_sphere_traits_2` -\cgalHasModel `CGAL::Projection_on_sphere_traits_3` +\cgalHasModelsBegin CGAL::Delaunay_triangulation_on_sphere_traits_2 +\cgalHasModels CGAL::Projection_on_sphere_traits_3 +\cgalHasModelsEnd \sa `DelaunayTriangulationOnSphereTraits_2` */ diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h index 23b6971fd89..7701fde798b 100644 --- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h +++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h @@ -9,7 +9,8 @@ of a triangulation data structure to be plugged in a triangulation on the sphere It refines the concept `TriangulationDSVertexBase_2`, adding geometric information: the vertex base of a triangulation stores a point. -\cgalHasModel `CGAL::Triangulation_on_sphere_vertex_base_2` +\cgalHasModelsBegin CGAL::Triangulation_on_sphere_vertex_base_2 +\cgalHasModelsEnd \sa `TriangulationDataStructure_2` \sa `TriangulationOnSphereFaceBase_2` diff --git a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h index 46213272fa9..3d656b13a16 100644 --- a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h +++ b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h @@ -6,9 +6,10 @@ A model of the `Visibility_2` concept can be attached to an `Arrangement_2` instance to answer visibility queries within the faces of this arrangement. -\cgalHasModel `CGAL::Simple_polygon_visibility_2` -\cgalHasModel `CGAL::Rotational_sweep_visibility_2` -\cgalHasModel `CGAL::Triangular_expansion_visibility_2` +\cgalHasModelsBegin CGAL::Simple_polygon_visibility_2 +\cgalHasModels CGAL::Rotational_sweep_visibility_2 +\cgalHasModels CGAL::Triangular_expansion_visibility_2 +\cgalHasModelsEnd */ class Visibility_2 { diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h index 218a51a9d10..916a678290f 100644 --- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h +++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h @@ -13,15 +13,16 @@ graph they take as an argument, the last ones does. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Identity_policy_2` -\cgalHasModel `CGAL::Apollonius_graph_degeneracy_removal_policy_2` -\cgalHasModel `CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2` -\cgalHasModel `CGAL::Delaunay_triangulation_degeneracy_removal_policy_2` -\cgalHasModel `CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2` -\cgalHasModel `CGAL::Regular_triangulation_degeneracy_removal_policy_2` -\cgalHasModel `CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2` +\cgalHasModelsBegin CGAL::Identity_policy_2 +\cgalHasModels CGAL::Apollonius_graph_degeneracy_removal_policy_2 +\cgalHasModels CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2 +\cgalHasModels CGAL::Delaunay_triangulation_degeneracy_removal_policy_2 +\cgalHasModels CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2 +\cgalHasModels CGAL::Regular_triangulation_degeneracy_removal_policy_2 +\cgalHasModels CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2 +\cgalHasModelsEnd \sa `DelaunayGraph_2` \sa `AdaptationTraits_2` diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h index bdd87560936..941a0b9dfbe 100644 --- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h +++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h @@ -11,10 +11,11 @@ tag is provided for determining whether this functor is defined or not. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} -\cgalHasModel `CGAL::Apollonius_graph_adaptation_traits_2` -\cgalHasModel `CGAL::Delaunay_triangulation_adaptation_traits_2` -\cgalHasModel `CGAL::Regular_triangulation_adaptation_traits_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_adaptation_traits_2` +\cgalHasModelsBegin CGAL::Apollonius_graph_adaptation_traits_2 +\cgalHasModels CGAL::Delaunay_triangulation_adaptation_traits_2 +\cgalHasModels CGAL::Regular_triangulation_adaptation_traits_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_adaptation_traits_2 +\cgalHasModelsEnd \sa `DelaunayGraph_2` \sa `CGAL::Voronoi_diagram_2` diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h index 3459c48dc9f..01749c2be48 100644 --- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h +++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h @@ -18,13 +18,13 @@ iterators and circulators that allow to traverse it (completely or partially). All iterators and circulators must be convertible to the corresponding handles. -\cgalHasModel `CGAL::Delaunay_triangulation_2` -\cgalHasModel `CGAL::Regular_triangulation_2` -\cgalHasModel `CGAL::Triangulation_hierarchy_2` provided that `Tr` is a model of `DelaunayGraph_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_2` -\cgalHasModel `CGAL::Segment_Delaunay_graph_hierarchy_2` -\cgalHasModel `CGAL::Apollonius_graph_2` -\cgalHasModel `CGAL::Apollonius_graph_hierarchy_2` +\cgalHasModelsBareBegin{ `CGAL::Triangulation_hierarchy_2` provided that `Tr` is a model of `DelaunayGraph_2`} CGAL::Delaunay_triangulation_2 +\cgalHasModels CGAL::Regular_triangulation_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_2 +\cgalHasModels CGAL::Segment_Delaunay_graph_hierarchy_2 +\cgalHasModels CGAL::Apollonius_graph_2 +\cgalHasModels CGAL::Apollonius_graph_hierarchy_2 +\cgalHasModelsEnd \sa `AdaptationTraits_2` \sa `AdaptationPolicy_2` diff --git a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h index 4b882bd82d5..a6f6793d19c 100644 --- a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h +++ b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h @@ -5,11 +5,10 @@ A concept that describes the set of requirements of classes used in the computation of analytic weights in 2D. -\cgalHasModel -- All models of `Kernel` -- `CGAL::Projection_traits_xy_3` -- `CGAL::Projection_traits_yz_3` -- `CGAL::Projection_traits_xz_3` +\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} sCGAL:Projection_traits_xy_3 +\cgalHasModels CGAL::Projection_traits_yz_3 +\cgalHasModels CGAL::Projection_traits_xz_3 +\cgalHasModelsEnd */ class AnalyticWeightTraits_2 { diff --git a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h index 3560a85f478..5aab656b612 100644 --- a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h +++ b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h @@ -5,8 +5,7 @@ A concept that describes the set of requirements of classes used in the computation of analytic weights in 3D. -\cgalHasModel -- All models of `Kernel` +\cgalHasModelsBare{All models of the \cgal concept `Kernel`} */ class AnalyticWeightTraits_3 { diff --git a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h index 89638d209f6..95d700e8e51 100644 --- a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h +++ b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h @@ -5,10 +5,10 @@ A concept that describes the set of methods required in all classes used in the computation of 2D generalized barycentric weights. -\cgalHasModel -- `CGAL::Weights::Wachspress_weights_2` -- `CGAL::Weights::Mean_value_weights_2` -- `CGAL::Weights::Discrete_harmonic_weights_2` +\cgalHasModelsBegin CGAL::Weights::Wachspress_weights_2 +\cgalHasModels CGAL::Weights::Mean_value_weights_2 +\cgalHasModels CGAL::Weights::Discrete_harmonic_weights_2 +\cgalHasModelsEnd */ class BarycentricWeights_2 {