diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h index cee0dc90296..3abb0cf153b 100644 --- a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h +++ b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h @@ -13,11 +13,11 @@ The concept `AABBPrimitive` describes the requirements for the primitives stored The `Primitive` type can be, e.g., a wrapper around a `Handle`. Assume for instance that the input objects are the triangle faces of a mesh stored as a `CGAL::Polyhedron_3`. The `Datum` would be a `Triangle_3` and the `Id` would be a polyhedron `Face_handle`. Method `datum()` can return either a `Triangle_3` constructed on the fly from the face handle or a `Triangle_3` stored internally. This provides a way for the user to trade memory for efficiency. \cgalHasModelsBegin -\cgalModels{CGAL::AABB_primitive} -\cgalModels{CGAL::AABB_segment_primitive} -\cgalModels{CGAL::AABB_triangle_primitive} -\cgalModels{CGAL::AABB_halfedge_graph_segment_primitive} -\cgalModels{CGAL::AABB_face_graph_triangle_primitive} +\cgalHasModels{CGAL::AABB_primitive} +\cgalHasModels{CGAL::AABB_segment_primitive} +\cgalHasModels{CGAL::AABB_triangle_primitive} +\cgalHasModels{CGAL::AABB_halfedge_graph_segment_primitive} +\cgalHasModels{CGAL::AABB_face_graph_triangle_primitive} \cgalHasModelsEnd */ diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h index 27f6805cbca..416cc785468 100644 --- a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h +++ b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h @@ -22,9 +22,9 @@ The `Datum` would be a `Triangle_3` and the `Id` a `std::size_t`. The shared dat The method `datum(const Shared_data&)` then returns a triangle from the vector. \cgalHasModelsBegin -\cgalModels{CGAL::AABB_primitive} -\cgalModels{CGAL::AABB_halfedge_graph_segment_primitive} -\cgalModels{CGAL::AABB_face_graph_triangle_primitive} +\cgalHasModels{CGAL::AABB_primitive} +\cgalHasModels{CGAL::AABB_halfedge_graph_segment_primitive} +\cgalHasModels{CGAL::AABB_face_graph_triangle_primitive} \cgalHasModelsEnd */ diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h index 1df2c9802b2..a372fc66524 100644 --- a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h +++ b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h @@ -8,7 +8,7 @@ The concept `AABBRayIntersectionTraits` is a refinement of the concept distance of an intersection along a ray. \cgalHasModelsBegin -\cgalModels{CGAL::AABB_traits} +\cgalHasModels{CGAL::AABB_traits} \cgalHasModelsEnd \sa `CGAL::AABB_tree` diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h index 5dfba2998c8..3b02a004439 100644 --- a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h +++ b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h @@ -6,7 +6,7 @@ The concept `AABBTraits` provides the geometric primitive types and methods for the class `CGAL::AABB_tree`. \cgalHasModelsBegin -\cgalModels{CGAL::AABB_traits} +\cgalHasModels{CGAL::AABB_traits} \cgalHasModelsEnd \cgalRefines{SearchGeomTraits_3} diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h index d21861c1c28..13c87daede5 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h @@ -29,7 +29,7 @@ algebraic operations within that structure. \sa `CGAL::Field_with_root_of_tag` \cgalHasModelsBegin -\cgalModels{CGAL::Algebraic_structure_traits} +\cgalHasModels{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 5cd89e524e6..eeb128e81b6 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h @@ -10,16 +10,16 @@ for Cartesian kernels. \cgalRefines{Field,RealEmbeddable} \cgalHasModelsBegin -\cgalModels{float} -\cgalModels{double} -\cgalModels{CGAL::Gmpq} -\cgalModels{CGAL::Interval_nt} -\cgalModels{CGAL::Interval_nt_advanced} -\cgalModels{CGAL::Lazy_exact_nt} -\cgalModels{CGAL::Quotient} -\cgalModels{leda_rational} -\cgalModels{leda_bigfloat} -\cgalModels{leda_real} +\cgalHasModels{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` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h index f1248606d90..d4f0b88f916 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h @@ -9,7 +9,7 @@ In case the associated type is a `Fraction`, a model of `FractionTraits` provide as the numerator and denominator type. \cgalHasModelsBegin -\cgalModels{CGAL::Fraction_traits} +\cgalHasModels{CGAL::Fraction_traits} \cgalHasModelsEnd \sa `FractionTraits_::Decompose` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h index f31912ba5d8..779b96188a7 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h @@ -7,9 +7,9 @@ A model of the concept `FromIntConstructible` is required to be constructible from int. \cgalHasModelsBegin -\cgalModels{int} -\cgalModels{long} -\cgalModels{double} +\cgalHasModels{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 312eff6326f..4a40e131286 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h @@ -8,7 +8,7 @@ A model of `RealEmbeddableTraits` is associated to a number type to the concept `RealEmbeddable`. \cgalHasModelsBegin -\cgalModels{CGAL::Real_embeddable_traits} +\cgalHasModels{CGAL::Real_embeddable_traits} \cgalHasModelsEnd */ 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 4bc59c9e388..b895e7665b9 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 @@ -9,8 +9,8 @@ algebraic functionalities on univariate polynomials of general degree \f$ d\f$. \cgalRefines{CopyConstructible,Assignable} \cgalHasModelsBegin -\cgalModels{CGAL::Algebraic_kernel_rs_gmpz_d_1} -\cgalModels{CGAL::Algebraic_kernel_rs_gmpq_d_1} +\cgalHasModels{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 498eaed26d7..a3bcacd1fc2 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 @@ -10,7 +10,7 @@ The concept `AlphaShapeFace_2` describes the requirements for the base face of a Periodic_2TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation} \cgalHasModelsBegin -\cgalModels{CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class)} +\cgalHasModels{CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class)} \cgalHasModelsEnd */ 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 bf8076c9794..49244706c9b 100644 --- a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h +++ b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h @@ -10,10 +10,10 @@ 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`. \cgalHasModelsBegin -\cgalModels{CGAL::Alpha_wraps_3_::Point_set_oracle} -\cgalModels{CGAL::Alpha_wraps_3_::Segment_soup_oracle} -\cgalModels{CGAL::Alpha_wraps_3_::Triangle_mesh_oracle} -\cgalModels{CGAL::Alpha_wraps_3_::Triangle_soup_oracle} +\cgalHasModels{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 */ 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 78e8ce69c6a..914bf0feedf 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 @@ -28,7 +28,7 @@ We only describe the additional requirements with respect to the \cgalRefines{TriangulationDataStructure_2} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_data_structure_2} +\cgalHasModels{CGAL::Triangulation_data_structure_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_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 354d27f68bf..76d3320b2dd 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 @@ -20,7 +20,7 @@ next and previous level graphs. types in addition to those of `ApolloniusGraphVertexBase_2`. \cgalHasModelsBegin -\cgalModels{CGAL::Apollonius_graph_hierarchy_vertex_base_2 >} +\cgalHasModels{CGAL::Apollonius_graph_hierarchy_vertex_base_2 >} \cgalHasModelsEnd \sa `ApolloniusGraphDataStructure_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 d62bc56484e..f14497d3ec6 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 @@ -13,8 +13,8 @@ constructions for sites and several function object types for the predicates. \cgalHasModelsBegin -\cgalModels{CGAL::Apollonius_graph_traits_2} -\cgalModels{CGAL::Apollonius_graph_filtered_traits_2} +\cgalHasModels{CGAL::Apollonius_graph_traits_2} +\cgalHasModels{CGAL::Apollonius_graph_filtered_traits_2} \cgalHasModelsEnd \sa `CGAL::Apollonius_graph_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 45e4bd35745..f6246b21112 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 @@ -13,7 +13,7 @@ sites. The container stores the hidden sites related to the vertex. \cgalRefines{TriangulationVertexBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Apollonius_graph_vertex_base_2} +\cgalHasModels{CGAL::Apollonius_graph_vertex_base_2} \cgalHasModelsEnd \sa `ApolloniusGraphDataStructure_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 8b105f4dab9..3a43a08c1a2 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{Functor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementApproximateTraits_2::Approximate_2} + * \cgalHasModels{ArrangementApproximateTraits_2::Approximate_2} * \cgalHasModelsEnd */ class Approximate_2 { 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 a5c401dc85f..8c9f51309ab 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{Functor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementXMonotoneTraits_2::Are_mergeable_2} + * \cgalHasModels{ArrangementXMonotoneTraits_2::Are_mergeable_2} * \cgalHasModelsEnd */ class AreMergeable_2 { 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 0d85b1f0ae7..ad6f44f179a 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableTernaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_} + * \cgalHasModels{ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_} * \cgalHasModelsEnd */ class CompareXNearBoundary_2 { 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 8fccd130906..28208660fec 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 @@ -6,9 +6,9 @@ namespace ArrTraits { * \cgalRefines{AdaptableFunctor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2} - * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2} - * \cgalModels{ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2} + * \cgalHasModels{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 { 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 77eea00561d..af30ebbfb93 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 @@ -6,9 +6,9 @@ namespace ArrTraits { * \cgalRefines{AdaptableFunctor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2} - * \cgalModels{ArrangementClosedTopTraits_2::Compare_x_on_boundary_2} - * \cgalModels{ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2} + * \cgalHasModels{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 { 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 9e9e4fe45cd..466869d5a01 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 @@ -5,7 +5,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Compare_x_2} + * \cgalHasModels{ArrangementBasicTraits_2::Compare_x_2} * \cgalHasModelsEnd */ class CompareX_2 { 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 7e423c1d5cd..db282c6d238 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Compare_xy_2} + * \cgalHasModels{ArrangementBasicTraits_2::Compare_xy_2} * \cgalHasModelsEnd */ class CompareXy_2 { 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 871add8868c..f49c04d0ec1 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableTernaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_left_2} + * \cgalHasModels{ArrangementBasicTraits_2::Compare_y_at_x_left_2} * \cgalHasModelsEnd */ class CompareYAtXLeft_2 { 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 4959f78d530..62fe93cdc3a 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableTernaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_right_2} + * \cgalHasModels{ArrangementBasicTraits_2::Compare_y_at_x_right_2} * \cgalHasModelsEnd */ class CompareYAtXRight_2 { 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 55ae2fc00fa..bc8d1d81573 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_2} + * \cgalHasModels{ArrangementBasicTraits_2::Compare_y_at_x_2} * \cgalHasModelsEnd */ class CompareYAtX_2 { 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 e2ab7e9cae9..cb11491e316 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableTernaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2} + * \cgalHasModels{ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2} * \cgalHasModelsEnd */ class CompareYNearBoundary_2 { 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 38a9090fd53..206458c178b 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 @@ -6,10 +6,10 @@ namespace ArrTraits { * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2} - * \cgalModels{ArrangementClosedRightTraits_2::Compare_y_on_boundary_2} - * \cgalModels{ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2} - * \cgalModels{ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2} + * \cgalHasModels{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 { 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 75306891423..12a1109a33b 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{Functor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementConstructCurveTraits_2::Construct_curve_2} + * \cgalHasModels{ArrangementConstructCurveTraits_2::Construct_curve_2} * \cgalHasModelsEnd */ class ConstructCurve_2 { 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 85b5f9a7fe2..85d379693bf 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Construct_max_vertex_2} + * \cgalHasModels{ArrangementBasicTraits_2::Construct_max_vertex_2} * \cgalHasModelsEnd */ class ConstructMaxVertex_2 { 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 a434876ac15..f9f8f3b99ac 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Construct_min_vertex_2} + * \cgalHasModels{ArrangementBasicTraits_2::Construct_min_vertex_2} * \cgalHasModelsEnd */ class ConstructMinVertex_2 { 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 73a5a007b91..39c1e7b42e5 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{Functor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2} + * \cgalHasModels{ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2} * \cgalHasModelsEnd */ class ConstructXMonotoneCurve_2 { 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 6ecf5245832..5268f489519 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 @@ -7,7 +7,7 @@ namespace ArrTraits { * * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * \cgalHasModelsBegin - * \cgalModels{ArrangementTraits_2::Curve_2} + * \cgalHasModels{ArrangementTraits_2::Curve_2} * \cgalHasModelsEnd */ class Curve_2 { 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 ca9e3d1a098..ed6d47ed592 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Equal_2} + * \cgalHasModels{ArrangementBasicTraits_2::Equal_2} * \cgalHasModelsEnd */ class Equal_2 { 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 df17bc89d08..feda290b2eb 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{Functor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementXMonotoneTraits_2::Intersect_2} + * \cgalHasModels{ArrangementXMonotoneTraits_2::Intersect_2} * \cgalHasModelsEnd */ class Intersect_2 { 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 6ead4d30e3f..351ae415352 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2} + * \cgalHasModels{ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2} * \cgalHasModelsEnd */ class IsOnXIdentification_2 { 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 9da39191b06..5ca8c772233 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2} + * \cgalHasModels{ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2} * \cgalHasModelsEnd */ class IsOnYIdentification_2 { 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 1df66d52a0b..e6894c911cf 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Is_vertical_2} + * \cgalHasModels{ArrangementBasicTraits_2::Is_vertical_2} * \cgalHasModelsEnd */ class IsVertical_2 { 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 2731e990a2f..f88d4200140 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{Functor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementTraits_2::Make_x_monotone_2} + * \cgalHasModels{ArrangementTraits_2::Make_x_monotone_2} * \cgalHasModelsEnd */ class MakeXMonotone_2 { 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 b2ec195a148..0ff9c3ff392 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 @@ -6,7 +6,7 @@ namespace ArrTraits { * \cgalRefines{Functor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementXMonotoneTraits_2::Merge_2} + * \cgalHasModels{ArrangementXMonotoneTraits_2::Merge_2} * \cgalHasModelsEnd */ class Merge_2 { 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 1973f4a5371..3f0c55da195 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 @@ -6,9 +6,9 @@ namespace ArrTraits { * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementVerticalSideTraits_2::Parameter_space_in_x_2} - * \cgalModels{ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2} - * \cgalModels{ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2} + * \cgalHasModels{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 { 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 19dae4f4cde..c598003b214 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 @@ -6,9 +6,9 @@ namespace ArrTraits { * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModelsBegin - * \cgalModels{ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2} - * \cgalModels{ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2} - * \cgalModels{ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2} + * \cgalHasModels{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 { 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 cc53c3b9467..337ccf35ae5 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 @@ -8,7 +8,7 @@ namespace ArrTraits { * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::Point_2} + * \cgalHasModels{ArrangementBasicTraits_2::Point_2} * \cgalHasModelsEnd */ class Point_2 { 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 71519a41aea..68a833aa549 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 @@ -5,7 +5,7 @@ namespace ArrTraits { * \cgalRefines{Functor} * * \cgalHasModelsBegin - * \cgalModels{ArrangementXMonotoneTraits_2::Split_2} + * \cgalHasModels{ArrangementXMonotoneTraits_2::Split_2} * \cgalHasModelsEnd */ class Split_2 { 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 cf004f92dd0..3b61bb2dca4 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 @@ -7,7 +7,7 @@ namespace ArrTraits { * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * * \cgalHasModelsBegin - * \cgalModels{ArrangementBasicTraits_2::X_monotone_curve_2} + * \cgalHasModels{ArrangementBasicTraits_2::X_monotone_curve_2} * \cgalHasModelsEnd */ class XMonotoneCurve_2 { 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 a6940b050c1..7dfd9a01f6b 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 @@ -9,14 +9,14 @@ point. \cgalRefines{ArrangementBasicTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Arr_conic_traits_2} -\cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2} -\cgalModels{CGAL::Arr_linear_traits_2} -\cgalModels{CGAL::Arr_non_caching_segment_traits_2} -\cgalModels{CGAL::Arr_segment_traits_2} -\cgalModels{CGAL::Arr_polycurve_traits_2} -\cgalModels{CGAL::Arr_polyline_traits_2} -\cgalModels{CGAL::Arr_rational_function_traits_2} +\cgalHasModels{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`, 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 6edbb7820d6..e30fada356a 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 @@ -10,7 +10,7 @@ * incident relations between them. * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_spherical_topology_traits_2} + * \cgalHasModels{CGAL::Arr_spherical_topology_traits_2} * \cgalHasModelsEnd */ 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 530aac71c9c..3771c0af1e0 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 @@ -28,21 +28,21 @@ * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_segment_traits_2} - * \cgalModels{CGAL::Arr_non_caching_segment_basic_traits_2} - * \cgalModels{CGAL::Arr_non_caching_segment_traits_2} - * \cgalModels{CGAL::Arr_linear_traits_2} - * \cgalModels{CGAL::Arr_polyline_traits_2} - * \cgalModels{CGAL::Arr_circle_segment_traits_2} - * \cgalModels{CGAL::Arr_line_arc_traits_2} - * \cgalModels{CGAL::Arr_circular_arc_traits_2} - * \cgalModels{CGAL::Arr_circular_line_arc_traits_2} - * \cgalModels{CGAL::Arr_conic_traits_2} - * \cgalModels{CGAL::Arr_rational_function_traits_2} - * \cgalModels{CGAL::Arr_Bezier_curve_traits_2} - * \cgalModels{CGAL::Arr_algebraic_segment_traits_2} - * \cgalModels{CGAL::Arr_curve_data_traits_2} - * \cgalModels{CGAL::Arr_consolidated_curve_data_traits_2} + * \cgalHasModels{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 */ 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 c0f8193d057..570967c2932 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 @@ -8,13 +8,13 @@ * \cgalRefines{ArrangementTraits_2} * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_conic_traits_2} - * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2} - * \cgalModels{CGAL::Arr_linear_traits_2} - * \cgalModels{CGAL::Arr_non_caching_segment_traits_2} - * \cgalModels{CGAL::Arr_segment_traits_2} - * \cgalModels{CGAL::Arr_polyline_traits_2} - * \cgalModels{CGAL::Arr_rational_function_traits_2} + * \cgalHasModels{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 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 7bfebe4906f..6d0a822280e 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 @@ -8,13 +8,13 @@ * \cgalRefines{ArrangementBasicTraits_2} * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_conic_traits_2} - * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2} - * \cgalModels{CGAL::Arr_linear_traits_2} - * \cgalModels{CGAL::Arr_non_caching_segment_traits_2} - * \cgalModels{CGAL::Arr_segment_traits_2} - * \cgalModels{CGAL::Arr_polyline_traits_2} - * \cgalModels{CGAL::Arr_rational_function_traits_2} + * \cgalHasModels{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`, 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 b750989c9ff..b0cb67e12e9 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 @@ -15,10 +15,10 @@ * `ArrangementDcelInnerCcb`, and `ArrangementDcelIsolatedVertex` respectively.) * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_dcel_base} - * \cgalModels{CGAL::Arr_default_dcel} - * \cgalModels{CGAL::Arr_face_extended_dcel} - * \cgalModels{CGAL::Arr_extended_dcel} + * \cgalHasModels{CGAL::Arr_dcel_base} + * \cgalHasModels{CGAL::Arr_default_dcel} + * \cgalHasModels{CGAL::Arr_face_extended_dcel} + * \cgalHasModels{CGAL::Arr_extended_dcel} * \cgalHasModelsEnd * * \sa `ArrangementDcelVertex` 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 c3d607c6e98..f263a1aae0d 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 @@ -11,9 +11,9 @@ Instantiate a dcel class with many different possible types without ad-hoc limit \cgalRefines{ArrangementDcel} \cgalHasModelsBegin -\cgalModels{CGAL::Arr_default_dcel} -\cgalModels{CGAL::Arr_face_extended_dcel} -\cgalModels{CGAL::Arr_extended_dcel} +\cgalHasModels{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 8dfbfb22707..e28c300acea 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 @@ -12,10 +12,10 @@ * \cgalRefines{ArrangementBasicTraits_2} * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_linear_traits_2} - * \cgalModels{CGAL::Arr_rational_function_traits_2} - * \cgalModels{CGAL::Arr_algebraic_segment_traits_2} - * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2} + * \cgalHasModels{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 07c14685f6e..286b02727ad 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 @@ -6,9 +6,9 @@ * specific format. * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_text_formatter} - * \cgalModels{CGAL::Arr_face_extended_text_formatter} - * \cgalModels{CGAL::Arr_extended_dcel_text_formatter} + * \cgalHasModels{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 79624fa8238..75c1a6bd241 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 @@ -12,14 +12,14 @@ * \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2} * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_conic_traits_2} - * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2} - * \cgalModels{CGAL::Arr_linear_traits_2} - * \cgalModels{CGAL::Arr_non_caching_segment_traits_2} - * \cgalModels{CGAL::Arr_segment_traits_2} - * \cgalModels{CGAL::Arr_polycurve_traits_2} - * \cgalModels{CGAL::Arr_polyline_traits_2} - * \cgalModels{CGAL::Arr_rational_function_traits_2} + * \cgalHasModels{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 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 3bf6b089be6..7cce69c075d 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 @@ -40,11 +40,11 @@ * \cgalRefines{ArrangementBasicTraits_2} * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_linear_traits_2} - * \cgalModels{CGAL::Arr_rational_function_traits_2} - * \cgalModels{CGAL::Arr_algebraic_segment_traits_2} - * \cgalModels{CGAL::Arr_curve_data_traits_2} - * \cgalModels{CGAL::Arr_consolidated_curve_data_traits_2} + * \cgalHasModels{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` 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 eb6c67a142b..bb1846ad8f5 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 @@ -7,9 +7,9 @@ A model for the `ArrangementOutputFormatter` concept supports a set of functions writing an arrangement to an output stream using a specific format. \cgalHasModelsBegin -\cgalModels{CGAL::Arr_text_formatter} -\cgalModels{CGAL::Arr_face_extended_text_formatter} -\cgalModels{CGAL::Arr_extended_dcel_text_formatter} +\cgalHasModels{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 782af5d25cd..4217e268e82 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 @@ -21,10 +21,10 @@ the old style without any overhead, the macro \cgal header is included. \cgalHasModelsBegin -\cgalModels{CGAL::Arr_naive_point_location} -\cgalModels{CGAL::Arr_walk_along_line_point_location} -\cgalModels{CGAL::Arr_trapezoid_ric_point_location} -\cgalModels{CGAL::Arr_landmarks_point_location} +\cgalHasModels{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` 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 2c2d0ad0208..25fde7ef42d 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 @@ -12,7 +12,7 @@ * ArrangementContractedBottomTraits_2,ArrangementContractedTopTraits_2} * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2} + * \cgalHasModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2} * \cgalHasModelsEnd * * \sa `ArrangementOpenBoundaryTraits_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 defff744a97..bf0c5121709 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 @@ -21,9 +21,9 @@ * At this point we do not expose all the requirements of this concept. * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_bounded_planar_topology_traits_2} - * \cgalModels{CGAL::Arr_unb_planar_topology_traits_2} - * \cgalModels{CGAL::Arr_spherical_topology_traits_2} + * \cgalHasModels{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 897ede7f25a..e7f2288b560 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 @@ -31,20 +31,20 @@ that accept such curves, such as `intsert()`. \cgalRefines{ArrangementXMonotoneTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Arr_segment_traits_2} -\cgalModels{CGAL::Arr_non_caching_segment_traits_2} -\cgalModels{CGAL::Arr_linear_traits_2} -\cgalModels{CGAL::Arr_polyline_traits_2} -\cgalModels{CGAL::Arr_circle_segment_traits_2} -\cgalModels{CGAL::Arr_line_arc_traits_2} -\cgalModels{CGAL::Arr_circular_arc_traits_2} -\cgalModels{CGAL::Arr_circular_line_arc_traits_2} -\cgalModels{CGAL::Arr_conic_traits_2} -\cgalModels{CGAL::Arr_rational_function_traits_2} -\cgalModels{CGAL::Arr_Bezier_curve_traits_2} -\cgalModels{CGAL::Arr_algebraic_segment_traits_2} -\cgalModels{CGAL::Arr_curve_data_traits_2} -\cgalModels{CGAL::Arr_consolidated_curve_data_traits_2} +\cgalHasModels{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/ArrangementVerticalRayShoot_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h index 0b7c89be158..f82ff109737 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 @@ -29,10 +29,10 @@ is recommended. To enable the old style without any overhead, the macro \cgal header is included. \cgalHasModelsBegin -\cgalModels{CGAL::Arr_naive_point_location} -\cgalModels{CGAL::Arr_walk_along_line_point_location} -\cgalModels{CGAL::Arr_trapezoid_ric_point_location} -\cgalModels{CGAL::Arr_landmarks_point_location} +\cgalHasModels{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` 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 2b9d1c9f6c1..88802d7ad61 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 @@ -12,10 +12,10 @@ * \cgalRefines{ArrangementBasicTraits_2} * * \cgalHasModelsBegin - * \cgalModels{CGAL::Arr_linear_traits_2} - * \cgalModels{CGAL::Arr_rational_function_traits_2} - * \cgalModels{CGAL::Arr_algebraic_segment_traits_2} - * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2} + * \cgalHasModels{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 601725e3c06..0e6ec4d3af8 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 @@ -10,7 +10,7 @@ specific format. \cgalRefines{ArrangementInputFormatter} \cgalHasModelsBegin -\cgalModels{CGAL::Arr_with_history_text_formatter} +\cgalHasModels{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 287a3a9f7eb..2aa87cc1d95 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 @@ -10,7 +10,7 @@ specific format. \cgalRefines{ArrangementOutputFormatter} \cgalHasModelsBegin -\cgalModels{CGAL::Arr_with_history_text_formatter} +\cgalHasModels{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 32e49f947dc..88cc075b5b1 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 @@ -19,20 +19,20 @@ curve splitting. \cgalRefines{ArrangementBasicTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Arr_segment_traits_2} -\cgalModels{CGAL::Arr_non_caching_segment_traits_2} -\cgalModels{CGAL::Arr_linear_traits_2} -\cgalModels{CGAL::Arr_polyline_traits_2} -\cgalModels{CGAL::Arr_circle_segment_traits_2} -\cgalModels{CGAL::Arr_line_arc_traits_2} -\cgalModels{CGAL::Arr_circular_arc_traits_2} -\cgalModels{CGAL::Arr_circular_line_arc_traits_2} -\cgalModels{CGAL::Arr_conic_traits_2} -\cgalModels{CGAL::Arr_rational_function_traits_2} -\cgalModels{CGAL::Arr_Bezier_curve_traits_2} -\cgalModels{CGAL::Arr_algebraic_segment_traits_2} -\cgalModels{CGAL::Arr_curve_data_traits_2} -\cgalModels{CGAL::Arr_consolidated_curve_data_traits_2} +\cgalHasModels{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 678d26425c4..137ccd40de4 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 @@ -12,8 +12,8 @@ maintain the auxiliary data stored with the \dcel records of the resulting overlaid arrangement, based on the contents of the input records. \cgalHasModelsBegin -\cgalModels{CGAL::Arr_default_overlay_traits} -\cgalModels{CGAL::Arr_face_overlay_traits} +\cgalHasModels{CGAL::Arr_default_overlay_traits} +\cgalHasModels{CGAL::Arr_face_overlay_traits} \cgalHasModelsEnd \sa `overlay` 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 35818aa505d..933edcacacb 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 @@ -9,9 +9,9 @@ A concept that describes the set of methods that should be defined for all coord models used to parameterize the class `Generalized_barycentric_coordinates_2`. \cgalHasModelsBegin -\cgalModels{Wachspress_2} -\cgalModels{Mean_value_2} -\cgalModels{Discrete_harmonic_2} +\cgalHasModels{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/DiscretizedDomain_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h index b1613da6b02..394a074d270 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 @@ -14,7 +14,7 @@ used to approximate certain types of generalized barycentric coordinate function The domain is bounded by the polygon. \cgalHasModelsBegin -\cgalModels{Delaunay_domain_2} +\cgalHasModels{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 bc3fa2117d3..65fd4f347a8 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 @@ -6,7 +6,7 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableBinaryFunction} \cgalHasModelsBegin -\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2} +\cgalHasModels{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 a2e684be626..e7714c04561 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 @@ -7,7 +7,7 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableUnaryFunction} \cgalHasModelsBegin -\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2} +\cgalHasModels{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 bac19b87072..92ee2585b2d 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 @@ -7,7 +7,7 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableUnaryFunction} \cgalHasModelsBegin -\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2} +\cgalHasModels{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 f82f215155a..0a62ec61aad 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 @@ -6,7 +6,7 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableBinaryFunction} \cgalHasModelsBegin -\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Intersect_2} +\cgalHasModels{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 a2b89befdec..18f8f26e936 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 @@ -6,7 +6,7 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableBinaryFunction} \cgalHasModelsBegin -\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Merge_2} +\cgalHasModels{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 7bca25154fd..5d6529d4862 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 @@ -6,7 +6,7 @@ namespace ArrDirectionalTraits { \cgalRefines{AdaptableUnaryFunction} \cgalHasModelsBegin -\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Split_2} +\cgalHasModels{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 15aaffd0788..3278e482000 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 @@ -17,13 +17,13 @@ as its source and the other as its target. \cgalRefines{ArrangementXMonotoneTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Arr_segment_traits_2} -\cgalModels{CGAL::Arr_non_caching_segment_traits_2} -\cgalModels{CGAL::Arr_circle_segment_traits_2} -\cgalModels{CGAL::Arr_conic_traits_2} -\cgalModels{CGAL::Arr_rational_function_traits_2} -\cgalModels{CGAL::Arr_Bezier_curve_traits_2} -\cgalModels{CGAL::Arr_algebraic_segment_traits_2} +\cgalHasModels{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 3151c6eb074..6d28d6afbf4 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 @@ -17,7 +17,7 @@ respectively \cgalRefines{ArrangementDcel} \cgalHasModelsBegin -\cgalModels{CGAL::Gps_default_dcel} +\cgalHasModels{CGAL::Gps_default_dcel} \cgalHasModelsEnd \sa `GeneralPolygonSetDcelFace` 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 123f3b883cf..01a99bce20e 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 @@ -10,7 +10,7 @@ to represent the underlying internal `Arrangement_2` data structure. \cgalRefines{ArrangementDcelFace} \cgalHasModelsBegin -\cgalModels{CGAL::Gps_face_base} +\cgalHasModels{CGAL::Gps_face_base} \cgalHasModelsEnd \sa `ArrangementDcel` 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 3f254f685a2..a21a5fd8b7f 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 @@ -9,7 +9,7 @@ to represent the underlying internal `Arrangement_2` data structure. \cgalRefines{ArrangementDcelHalfedge} \cgalHasModelsBegin -\cgalModels{CGAL::Gps_face_halfedge} +\cgalHasModels{CGAL::Gps_face_halfedge} \cgalHasModelsEnd \sa `ArrangementDcel` 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 bd1afb8ed78..2c8966d8239 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 @@ -14,9 +14,9 @@ types. \cgalRefines{ArrangementDirectionalXMonotoneTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Gps_segment_traits_2} -\cgalModels{CGAL::Gps_circle_segment_traits_2} -\cgalModels{CGAL::Gps_traits_2} +\cgalHasModels{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 b9e25593526..e8a9a5b76e5 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 @@ -17,7 +17,7 @@ of Boolean set-operations. General polygon that represent holes must be clockwise oriented. \cgalHasModelsBegin -\cgalModels{CGAL::General_polygon_2} +\cgalHasModels{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 2515be1d0e7..ae3edc16589 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 @@ -10,7 +10,7 @@ A model of this concept represents a general polygon with holes. \cgalGeneralizes `GeneralPolygonWithHoles_2` \cgalHasModelsBegin -\cgalModels{GeneralPolygonSetTraits_2::Polygon_with_holes2} +\cgalHasModels{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 dc6486a1a31..18872ffd1a0 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 @@ -10,8 +10,8 @@ A model of this concept represents a simple general polygon. \cgalGeneralizes `GeneralPolygon_2` \cgalHasModelsBegin -\cgalModels{GeneralPolygonSetTraits_2::Polygon_2} -\cgalModels{CGAL::Polygon_2} +\cgalHasModels{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 0ce3d2249b9..62853106bae 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 @@ -9,9 +9,9 @@ This concept defines the requirements for traits classes of \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_2} -\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_3} -\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_d} +\cgalHasModels{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 3e25f230aeb..0e78063f3e0 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h @@ -7,7 +7,7 @@ This concept defines the requirements for traits classes of `CGAL::Min_circle_2`. \cgalHasModelsBegin -\cgalModels{CGAL::Min_circle_2_traits_2} +\cgalHasModels{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 853c3243813..d498ece7baf 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h @@ -7,7 +7,7 @@ This concept defines the requirements for traits classes of `CGAL::Min_ellipse_2`. \cgalHasModelsBegin -\cgalModels{CGAL::Min_ellipse_2_traits_2} +\cgalHasModels{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 592d52d69d9..65ffccff529 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h @@ -9,7 +9,7 @@ set using the functions `min_rectangle_2()`, `min_parallelogram_2()` and `min_strip_2()`. \cgalHasModelsBegin -\cgalModels{CGAL::Min_quadrilateral_default_traits_2} +\cgalHasModels{CGAL::Min_quadrilateral_default_traits_2} \cgalHasModelsEnd \sa `CGAL::min_rectangle_2()` diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h index 0d812dd559b..6815393e7bd 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h @@ -7,9 +7,9 @@ This concept defines the requirements for traits classes of \f$ d\f$-dimensional min sphere and min annulus algorithms. \cgalHasModelsBegin -\cgalModels{CGAL::Min_sphere_annulus_d_traits_2} -\cgalModels{CGAL::Min_sphere_annulus_d_traits_3} -\cgalModels{CGAL::Min_sphere_annulus_d_traits_d} +\cgalHasModels{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` diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h index 2e19511b810..9e08fa9312a 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h @@ -7,12 +7,12 @@ A model of concept `MinSphereOfSpheresTraits` must provide the following constants, types, predicates and operations. \cgalHasModelsBegin -\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_2} -\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_3} -\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_d} -\cgalModels{CGAL::Min_sphere_of_points_d_traits_2} -\cgalModels{CGAL::Min_sphere_of_points_d_traits_3} -\cgalModels{CGAL::Min_sphere_of_points_d_traits_d} +\cgalHasModels{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 */ diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h index b72e77f91d3..4b18a7a762a 100644 --- a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h +++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h @@ -8,7 +8,7 @@ needed to compute rectilinear \f$ p\f$-centers of a planar point set using the function `CGAL::rectangular_p_center_2()`. \cgalHasModelsBegin -\cgalModels{CGAL::Rectangular_p_center_default_traits_2} +\cgalHasModels{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 d41ffd3d842..edd402137ed 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 @@ -11,8 +11,8 @@ the dimension, the `id`-number, and the boundaries of the box. \cgalRefines{Assignable} \cgalHasModelsBegin -\cgalModels{CGAL::Box_intersection_d::Box_d} -\cgalModels{CGAL::Box_intersection_d::Box_with_handle_d} +\cgalHasModels{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 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 98cb8e4a34f..c3541e6cfd2 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 @@ -10,7 +10,7 @@ the boxes manipulated in these algorithms. \cgalRefines{Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Box_intersection_d::Box_traits_d} +\cgalHasModels{CGAL::Box_intersection_d::Box_traits_d} \cgalHasModelsEnd \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_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 05175484ac2..6018fabb347 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 @@ -12,7 +12,7 @@ are of a type that is a model of the concept \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Polynomial_for_circles_2_2} +\cgalHasModels{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 ee376204999..d045a84662e 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 @@ -10,7 +10,7 @@ coefficients are of a type that is a model of the concept \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Polynomial_1_2} +\cgalHasModels{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 13cdb511935..b11014950b4 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 @@ -8,7 +8,7 @@ in two variables `x` and `y` that are models of concept `AlgebraicKernelForCircles::PolynomialForCircles_2_2` \cgalHasModelsBegin -\cgalModels{CGAL::Root_for_circles_2_2} +\cgalHasModels{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 9b259e047c3..6241ca39f35 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h @@ -8,7 +8,7 @@ curved kernel with all the algebraic functionalities required for the manipulation of circular arcs. \cgalHasModelsBegin -\cgalModels{CGAL::Algebraic_kernel_for_circles_2_2} +\cgalHasModels{CGAL::Algebraic_kernel_for_circles_2_2} \cgalHasModelsEnd \sa `CircularKernel` 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 82cf9487e87..d9019e31e3a 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 @@ -8,7 +8,7 @@ Concept for points on circles, circular arcs or line arcs. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Circular_arc_point_2} +\cgalHasModels{CGAL::Circular_arc_point_2} \cgalHasModelsEnd */ class CircularKernel::CircularArcPoint_2 { 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 d5833dfa55d..dff040e6a32 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 @@ -8,7 +8,7 @@ Concept for arcs of circles. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Circular_arc_2} +\cgalHasModels{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 e92230b10a0..ca08be2ae84 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 @@ -10,7 +10,7 @@ Concept for line segments supported by a line that is a model of \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Line_arc_2} +\cgalHasModels{CGAL::Line_arc_2} \cgalHasModelsEnd */ 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 d5c912468c6..1c78b2d50ea 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h @@ -6,8 +6,8 @@ \cgalRefines{Kernel} \cgalHasModelsBegin -\cgalModels{CGAL::Circular_kernel_2} -\cgalModels{CGAL::Exact_circular_kernel_2} +\cgalHasModels{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 70aa9278d6b..99b16c59c63 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 @@ -12,7 +12,7 @@ are of a type that is a model of the concept \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{GAL::Polynomial_for_spheres_2_} +\cgalHasModels{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 6423e3805a0..0df9eeb89b1 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 @@ -10,7 +10,7 @@ coefficients are of a type that is a model of the concept \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Polynomial_1_3} +\cgalHasModels{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 99d40b5860a..6dd59fc1a88 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 @@ -9,7 +9,7 @@ capable of storing equations of lines. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Polynomials_for_lines_3} +\cgalHasModels{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 cb25b3d6244..5da83e31c6f 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 @@ -8,7 +8,7 @@ in three variables `x`, `y` and `z` that are models of concept `AlgebraicKernelForSpheres::PolynomialForSpheres_2_3`. \cgalHasModelsBegin -\cgalModels{CGAL::Root_for_spheres_2_3} +\cgalHasModels{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 585101b73df..c258b5020a9 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h @@ -8,7 +8,7 @@ curved kernel with all the algebraic functionalities required for the manipulation of spheres, circles, and circular arcs in 3D. \cgalHasModelsBegin -\cgalModels{CGAL::Algebraic_kernel_for_spheres_2_3} +\cgalHasModels{CGAL::Algebraic_kernel_for_spheres_2_3} \cgalHasModelsEnd \sa `SphericalKernel` 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 8c932d22712..60f3f613b6d 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 @@ -8,7 +8,7 @@ Concept for points on spheres, circles, circular arcs or line arcs. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Circular_arc_point_3} +\cgalHasModels{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 644a5077384..ad062120fdc 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 @@ -8,7 +8,7 @@ Concept for arcs of circles. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Circular_arc_3} +\cgalHasModels{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 ca26700179f..0c750dff3ac 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 @@ -10,7 +10,7 @@ Concept for line segments supported by a line that is a model of \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Line_arc_3} +\cgalHasModels{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 22b38914961..23be29fe5b6 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h @@ -6,8 +6,8 @@ \cgalRefines{Kernel} \cgalHasModelsBegin -\cgalModels{CGAL::Spherical_kernel_3} -\cgalModels{CGAL::Exact_spherical_kernel_3} +\cgalHasModels{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 b15f9c6fd0c..281902ecce4 100644 --- a/Circulator/doc/Circulator/Concepts/ConstHandle.h +++ b/Circulator/doc/Circulator/Concepts/ConstHandle.h @@ -8,7 +8,7 @@ A constant handle. Refer to the `Handle` concept for more details. \cgalRefines{Descriptor} \cgalHasModelsBegin -\cgalModels{const T* (const pointers)} +\cgalHasModels{const T* (const pointers)} \cgalHasModelsEnd \sa `Handle` diff --git a/Circulator/doc/Circulator/Concepts/Handle.h b/Circulator/doc/Circulator/Concepts/Handle.h index 0e531736bcf..fd08f96c22b 100644 --- a/Circulator/doc/Circulator/Concepts/Handle.h +++ b/Circulator/doc/Circulator/Concepts/Handle.h @@ -24,10 +24,10 @@ operator is concerned (this serves the same purpose as NULL for pointers). standard containers.) \cgalHasModelsBegin -\cgalModels{T* (pointer)} -\cgalModels{const T* (const pointers)} -\cgalModels{Iterator} -\cgalModels{Circulator} +\cgalHasModels{T* (pointer)} +\cgalHasModels{const T* (const pointers)} +\cgalHasModels{Iterator} +\cgalHasModels{Circulator} \cgalHasModelsEnd */ class Handle { diff --git a/Classification/doc/Classification/Concepts/Classifier.h b/Classification/doc/Classification/Concepts/Classifier.h index fefec08fceb..03ba639d256 100644 --- a/Classification/doc/Classification/Concepts/Classifier.h +++ b/Classification/doc/Classification/Concepts/Classifier.h @@ -13,9 +13,9 @@ Concept describing a classifier used by classification functions (see `CGAL::Classification::classify_with_graphcut()`). \cgalHasModelsBegin -\cgalModels{CGAL::Classification::Sum_of_weighted_features_classifier} -\cgalModels{CGAL::Classification::ETHZ::Random_forest_classifier} -\cgalModels{CGAL::Classification::OpenCV::Random_forest_classifier} +\cgalHasModels{CGAL::Classification::Sum_of_weighted_features_classifier} +\cgalHasModels{CGAL::Classification::ETHZ::Random_forest_classifier} +\cgalHasModels{CGAL::Classification::OpenCV::Random_forest_classifier} \cgalHasModelsEnd */ diff --git a/Classification/doc/Classification/Concepts/NeighborQuery.h b/Classification/doc/Classification/Concepts/NeighborQuery.h index 4db42f7b4b8..8de58a6c523 100644 --- a/Classification/doc/Classification/Concepts/NeighborQuery.h +++ b/Classification/doc/Classification/Concepts/NeighborQuery.h @@ -11,10 +11,10 @@ namespace Classification Concept describing a neighbor query used for classification. \cgalHasModelsBegin -\cgalModels{CGAL::Classification::Point_set_neighborhood::K_neighbor_query} -\cgalModels{CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query} -\cgalModels{CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query} -\cgalModels{CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query} +\cgalHasModels{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 */ 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 f5e1d3a6f36..639a45e5f4c 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 @@ -10,12 +10,12 @@ functions. The specific subset of these primitives required by each function is specified with each function. \cgalHasModelsBegin -\cgalModels{CGAL::Convex_hull_constructive_traits_2} -\cgalModels{CGAL::Convex_hull_traits_2} -\cgalModels{CGAL::Convex_hull_traits_adapter_2} -\cgalModels{CGAL::Projection_traits_xy_3} -\cgalModels{CGAL::Projection_traits_yz_3} -\cgalModels{CGAL::Projection_traits_xz_3} +\cgalHasModels{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 b9fd8dac230..ba20411843b 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 @@ -5,8 +5,8 @@ Requirements of the traits class of the function `CGAL::convex_hull_3()`. \cgalHasModelsBegin -\cgalModels{CGAL::Convex_hull_traits_3} -\cgalModels{CGAL::Extreme_points_traits_adapter_3} +\cgalHasModels{CGAL::Convex_hull_traits_3} +\cgalHasModels{CGAL::Extreme_points_traits_adapter_3} \cgalHasModelsEnd */ 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 fce2c1aa320..19c5793f9c0 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 @@ -8,9 +8,9 @@ Requirements of the traits class to be used with the class `CGAL::Convex_hull_d`. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian_d} -\cgalModels{CGAL::Homogeneous_d} -\cgalModels{CGAL::Convex_hull_d_traits_3} +\cgalHasModels{CGAL::Cartesian_d} +\cgalHasModels{CGAL::Homogeneous_d} +\cgalHasModels{CGAL::Convex_hull_d_traits_3} \cgalHasModelsEnd */ 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 0937e25239c..a584e7433ed 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 @@ -8,8 +8,8 @@ Requirements of the second traits class to be used with the class `CGAL::Delaunay_d`. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian_d} -\cgalModels{CGAL::Homogeneous_d} +\cgalHasModels{CGAL::Cartesian_d} +\cgalHasModels{CGAL::Homogeneous_d} \cgalHasModelsEnd */ 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 2f91bbf7d82..c04db63b19c 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 @@ -8,8 +8,8 @@ Requirements of the first traits class to be used with the class `CGAL::Delaunay_d`. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian_d} -\cgalModels{CGAL::Homogeneous_d} +\cgalHasModels{CGAL::Cartesian_d} +\cgalHasModels{CGAL::Homogeneous_d} \cgalHasModelsEnd */ diff --git a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h index 02ae3ebf7cf..3665e2ae25a 100644 --- a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h +++ b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h @@ -17,10 +17,10 @@ Note however, that these operations usually involve the projection of \cgalRefines{ArrangementXMonotoneTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Env_triangle_traits_3} -\cgalModels{CGAL::Env_sphere_traits_3} -\cgalModels{CGAL::Env_plane_traits_3} -\cgalModels{CGAL::Env_surface_data_traits_3} +\cgalHasModels{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/Generator/doc/Generator/Concepts/PointGenerator.h b/Generator/doc/Generator/Concepts/PointGenerator.h index 5a70e5f0ebd..39019e4b99a 100644 --- a/Generator/doc/Generator/Concepts/PointGenerator.h +++ b/Generator/doc/Generator/Concepts/PointGenerator.h @@ -6,20 +6,20 @@ The concept `PointGenerator` defines the requirements for a point generator, which can be used in places where input iterators are called for. \cgalHasModelsBegin -\cgalModels{CGAL::Random_points_in_ball_d} -\cgalModels{CGAL::Random_points_in_disc_2} -\cgalModels{CGAL::Random_points_in_square_2} -\cgalModels{CGAL::Random_points_in_triangle_2} -\cgalModels{CGAL::Random_points_on_circle_2} -\cgalModels{CGAL::Random_points_on_segment_2} -\cgalModels{CGAL::Random_points_on_square_2} -\cgalModels{CGAL::Random_points_in_cube_3} -\cgalModels{CGAL::Random_points_in_cube_d} -\cgalModels{CGAL::Random_points_in_sphere_3} -\cgalModels{CGAL::Random_points_in_triangle_3} -\cgalModels{CGAL::Random_points_in_tetrahedron_3} -\cgalModels{CGAL::Random_points_on_sphere_3} -\cgalModels{CGAL::Random_points_on_sphere_d} +\cgalHasModels{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/RandomConvexSetTraits_2.h b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h index 669f54809b3..05cb1eda3a8 100644 --- a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h +++ b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h @@ -6,7 +6,7 @@ The concept `RandomConvexSetTraits_2` describes the requirements of the traits class for the function `random_convex_set_2()`. \cgalHasModelsBegin -\cgalModels{CGAL::Random_convex_set_traits_2} +\cgalHasModels{CGAL::Random_convex_set_traits_2} \cgalHasModelsEnd */ diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h index 6b99d22b415..ed5f246b5f0 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h @@ -68,9 +68,9 @@ from the `` header file can be used as default allocator. \cgalHasModelsBegin -\cgalModels{CGAL::HalfedgeDS_default} -\cgalModels{CGAL::HalfedgeDS_list} -\cgalModels{CGAL::HalfedgeDS_vector} +\cgalHasModels{CGAL::HalfedgeDS_default} +\cgalHasModels{CGAL::HalfedgeDS_list} +\cgalHasModels{CGAL::HalfedgeDS_vector} \cgalHasModelsEnd \sa `HalfedgeDSItems` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h index fb3c3e05d2a..e8ef9f27a86 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h @@ -24,8 +24,8 @@ can be bypassed by the user, but not by accident.) \cgalRefines{CopyConstructible,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::HalfedgeDS_face_base} -\cgalModels{CGAL::HalfedgeDS_face_min_base} +\cgalHasModels{CGAL::HalfedgeDS_face_base} +\cgalHasModels{CGAL::HalfedgeDS_face_min_base} \cgalHasModelsEnd \sa `HalfedgeDS` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h index f726b2c4383..d464d21ca1c 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h @@ -34,8 +34,8 @@ function. The base class `Base_base` provides access to it. (The protection could be bypassed also by an user, but not by accident.) \cgalHasModelsBegin -\cgalModels{::CGAL::HalfedgeDS_halfedge_base} -\cgalModels{::CGAL::HalfedgeDS_halfedge_min_base} +\cgalHasModels{::CGAL::HalfedgeDS_halfedge_base} +\cgalHasModels{::CGAL::HalfedgeDS_halfedge_min_base} \cgalHasModelsEnd \sa `HalfedgeDS` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h index 3b52eeb48a5..b4399e4121c 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h @@ -17,9 +17,9 @@ types are described on the manual pages of the concepts `HalfedgeDSVertex`, `HalfedgeDSHalfedge`, and `HalfedgeDSFace` respectively. \cgalHasModelsBegin -\cgalModels{CGAL::HalfedgeDS_min_items} -\cgalModels{CGAL::HalfedgeDS_items_2} -\cgalModels{CGAL::Polyhedron_items_3} +\cgalHasModels{CGAL::HalfedgeDS_min_items} +\cgalHasModels{CGAL::HalfedgeDS_items_2} +\cgalHasModels{CGAL::Polyhedron_items_3} \cgalHasModelsEnd \sa `HalfedgeDS` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h index ce576613630..19efa29448b 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h @@ -24,8 +24,8 @@ could be bypassed by an user, but not by accident.) \cgalRefines{CopyConstructible,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::HalfedgeDS_vertex_base} -\cgalModels{CGAL::HalfedgeDS_vertex_min_base} +\cgalHasModels{CGAL::HalfedgeDS_vertex_base} +\cgalHasModels{CGAL::HalfedgeDS_vertex_min_base} \cgalHasModelsEnd \sa `HalfedgeDS` 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 39a254eec7e..1aaec1a1a00 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 @@ -17,8 +17,8 @@ This concept refines `DelaunayTriangulationTraits_2` because the class `CGAL::Hy internally relies on the class `CGAL::Delaunay_triangulation_2`. \cgalHasModelsBegin -\cgalModels{CGAL::Hyperbolic_Delaunay_triangulation_traits_2} -\cgalModels{CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2} +\cgalHasModels{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 51a984a3c98..f4f5ab1c62e 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 @@ -42,7 +42,7 @@ Delaunay triangulations in the hyperbolic plane. The function `tds_data()` is us internally by the triangulation class during the insertion of points in the triangulation. \cgalHasModelsBegin -\cgalModels{CGAL::Hyperbolic_triangulation_face_base_2} +\cgalHasModels{CGAL::Hyperbolic_triangulation_face_base_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_2` diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h index 407337905ef..d31bfb5c861 100644 --- a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h +++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h @@ -16,8 +16,8 @@ precondition checking only. Therefore, they need not to be specified, in case that precondition checking is disabled. \cgalHasModelsBegin -\cgalModels{CGAL::Extremal_polygon_area_traits_2} -\cgalModels{CGAL::Extremal_polygon_perimeter_traits_2} +\cgalHasModels{CGAL::Extremal_polygon_area_traits_2} +\cgalHasModels{CGAL::Extremal_polygon_perimeter_traits_2} \cgalHasModelsEnd \sa `CGAL::maximum_area_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 79629048104..5a269cc649f 100644 --- a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h +++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h @@ -11,8 +11,8 @@ this class and some function object types for the required predicates on those primitives. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian} -\cgalModels{CGAL::Homogeneous} +\cgalHasModels{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 0cdbc888f21..222fc82d203 100644 --- a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h +++ b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h @@ -8,7 +8,7 @@ traits class that defines the primitives used by the algorithm. The concept `GradientFittingTraits` defines this common set of requirements. \cgalHasModelsBegin -\cgalModels{CGAL::Interpolation_gradient_fitting_traits_2} +\cgalHasModels{CGAL::Interpolation_gradient_fitting_traits_2} \cgalHasModelsEnd \sa `InterpolationTraits` diff --git a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h index 18b806952cb..d3b8bd79bec 100644 --- a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h +++ b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h @@ -8,8 +8,8 @@ defines the primitives used in the interpolation algorithms. The concept `InterpolationTraits` defines this common set of requirements. \cgalHasModelsBegin -\cgalModels{CGAL::Interpolation_traits_2} -\cgalModels{CGAL::Interpolation_gradient_fitting_traits_2} +\cgalHasModels{CGAL::Interpolation_traits_2} +\cgalHasModels{CGAL::Interpolation_gradient_fitting_traits_2} \cgalHasModelsEnd \sa `GradientFittingTraits` 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 fe7cbbd266e..7ca67466f3c 100644 --- a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h +++ b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h @@ -10,8 +10,8 @@ closed. It is up to the implementer of a model for this concept to define that. \cgalHasModelsBegin -\cgalModels{CGAL::Interval_skip_list_interval} -\cgalModels{CGAL::Level_interval} +\cgalHasModels{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 93d2ee819e5..bea789a167b 100644 --- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h +++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h @@ -14,8 +14,8 @@ Only constructors (from 3 scalars and copy constructors) and access methods to coordinates `x()`, `y()`, `z()` are needed. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian} -\cgalModels{CGAL::Simple_cartesian} +\cgalHasModels{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 d4981cf4f84..17dbcfae03f 100644 --- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h +++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h @@ -30,8 +30,8 @@ methods to coordinates `x()`, `y()`, `z()` are needed for the point and vector types. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian} -\cgalModels{CGAL::Simple_cartesian} +\cgalHasModels{CGAL::Cartesian} +\cgalHasModels{CGAL::Simple_cartesian} \cgalHasModelsEnd \sa `DataKernel` diff --git a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h index 9433ac9dd05..57ad06016b8 100644 --- a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h +++ b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h @@ -9,7 +9,7 @@ namespace Kernel { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Circle_2} + \cgalHasModels{CGAL::Circle_2} \cgalHasModelsEnd \sa `Kernel::BoundedSide_2` @@ -41,7 +41,7 @@ class Circle_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Circle_3} + \cgalHasModels{CGAL::Circle_3} \cgalHasModelsEnd \sa `Kernel::ComputeApproximateArea_3` @@ -71,7 +71,8 @@ class Circle_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Direction_2} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Direction_2} \cgalHasModelsEnd \sa `Kernel::CompareAngleWithXAxis_2` @@ -96,7 +97,8 @@ class Direction_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Direction_3} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Direction_3} \cgalHasModelsEnd \sa `Kernel::ConstructDirection_3` @@ -118,7 +120,7 @@ A type representing isocuboids in three dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Iso_cuboid_3} +\cgalHasModels{CGAL::Iso_cuboid_3} \cgalHasModelsEnd \sa `Kernel::BoundedSide_3` @@ -144,7 +146,8 @@ class IsoCuboid_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Iso_rectangle_2} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Iso_rectangle_2} \cgalHasModelsEnd \sa `Kernel::ConstructIsoRectangle_2` @@ -177,7 +180,8 @@ class IsoRectangle_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Line_2} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Line_2} \cgalHasModelsEnd \sa `Kernel::CompareXAtY_2` @@ -214,7 +218,8 @@ class Line_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Line_3} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Line_3} \cgalHasModelsEnd \sa `Kernel::ComputeSquaredDistance_3` @@ -246,7 +251,8 @@ class Line_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Object} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Object} \cgalHasModelsEnd \sa `Kernel::Assign_2` @@ -268,7 +274,8 @@ class Object_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Object} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Object} \cgalHasModelsEnd \sa `Kernel::Assign_3` @@ -288,7 +295,8 @@ class Object_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Plane_3} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Plane_3} \cgalHasModelsEnd \sa `Kernel::ComputeSquaredDistance_3` @@ -326,7 +334,8 @@ class Plane_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Point_2} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Point_2} \cgalHasModelsEnd \sa `Kernel::Angle_2` @@ -386,7 +395,8 @@ class Point_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} - \cgalModels{CGAL::Point_3} + \cgalHasModelsBegin + \cgalHasModels{CGAL::Point_3} \cgalHasModelsEnd \sa `Kernel::Angle_3` @@ -449,7 +459,7 @@ A type representing rays in two dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Ray_2} +\cgalHasModels{CGAL::Ray_2} \cgalHasModelsEnd \sa `Kernel::CollinearHasOn_2` @@ -483,7 +493,7 @@ class Ray_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Ray_3} + \cgalHasModels{CGAL::Ray_3} \cgalHasModelsEnd \sa `Kernel::ComputeSquaredDistance_3` @@ -513,7 +523,7 @@ class Ray_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Segment_2} + \cgalHasModels{CGAL::Segment_2} \cgalHasModelsEnd \sa `Kernel::CollinearHasOn_2` @@ -549,7 +559,7 @@ class Segment_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Segment_3} + \cgalHasModels{CGAL::Segment_3} \cgalHasModelsEnd \sa `Kernel::ComputeSquaredDistance_3` @@ -581,7 +591,7 @@ class Segment_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Sphere_3} + \cgalHasModels{CGAL::Sphere_3} \cgalHasModelsEnd \sa `Kernel::BoundedSide_3` @@ -613,7 +623,7 @@ class Sphere_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Tetrahedron_3} + \cgalHasModels{CGAL::Tetrahedron_3} \cgalHasModelsEnd \sa `Kernel::BoundedSide_3` @@ -646,7 +656,7 @@ class Tetrahedron_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Triangle_2} + \cgalHasModels{CGAL::Triangle_2} \cgalHasModelsEnd \sa `Kernel::BoundedSide_2` @@ -681,7 +691,7 @@ class Triangle_2 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Triangle_3} + \cgalHasModels{CGAL::Triangle_3} \cgalHasModelsEnd \sa `Kernel::ComputeSquaredArea_3` @@ -708,7 +718,7 @@ class Triangle_3 { \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin - \cgalModels{CGAL::Vector_2} + \cgalHasModels{CGAL::Vector_2} \cgalHasModelsEnd \sa `Kernel::ComputeDeterminant_2` @@ -743,7 +753,7 @@ A type representing vectors in three dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Vector_3} +\cgalHasModels{CGAL::Vector_3} \cgalHasModelsEnd \sa `Kernel::CompareDihedralAngle_3` @@ -781,7 +791,7 @@ A type representing weighted points in two dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Weighted_point_2} +\cgalHasModels{CGAL::Weighted_point_2} \cgalHasModelsEnd \sa `Kernel::ConstructWeightedPoint_2` @@ -810,7 +820,7 @@ A type representing weighted points in three dimensions. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Weighted_point_3} +\cgalHasModels{CGAL::Weighted_point_3} \cgalHasModelsEnd \sa `Kernel::ConstructWeightedPoint_3` diff --git a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h index 2da2b9d8fb9..e312763fd33 100644 --- a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h +++ b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h @@ -21,14 +21,14 @@ When the result type is not determined, no prefix is used. \cgalHasModelsBegin - \cgalModels{CGAL::Cartesian} - \cgalModels{CGAL::Homogeneous} - \cgalModels{CGAL::Simple_cartesian} - \cgalModels{CGAL::Simple_homogeneous} - \cgalModels{CGAL::Filtered_kernel} - \cgalModels{CGAL::Exact_predicates_exact_constructions_kernel} - \cgalModels{CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt} - \cgalModels{CGAL::Exact_predicates_inexact_constructions_kernel} + \cgalHasModels{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` diff --git a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h index 4a8e19db8cd..fd43b0acbca 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h @@ -9,8 +9,8 @@ unclear in kernels of fixed dimension. \cgalRefines{Kernel_d} \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian_d} -\cgalModels{CGAL::Homogeneous_d} +\cgalHasModels{CGAL::Cartesian_d} +\cgalHasModels{CGAL::Homogeneous_d} \cgalHasModelsEnd */ class KernelWithLifting_d { diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h index c4ac4f607c8..6b484f16e14 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h @@ -19,10 +19,10 @@ constructive procedures in the kernel. There are also function objects replacing operators, especially for equality testing. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian_d} -\cgalModels{CGAL::Homogeneous_d} -\cgalModels{CGAL::Epick_d} -\cgalModels{CGAL::Epeck_d} +\cgalHasModels{CGAL::Cartesian_d} +\cgalHasModels{CGAL::Homogeneous_d} +\cgalHasModels{CGAL::Epick_d} +\cgalHasModels{CGAL::Epeck_d} \cgalHasModelsEnd */ class Kernel_d { diff --git a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h index 8dff375eaea..e0e523e5363 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h @@ -14,8 +14,8 @@ 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$. \cgalHasModelsBegin -\cgalModels{CGAL::Linear_algebraHd} -\cgalModels{CGAL::Linear_algebraCd} +\cgalHasModels{CGAL::Linear_algebraHd} +\cgalHasModels{CGAL::Linear_algebraCd} \cgalHasModelsEnd */ 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 abc3d27eaf2..4f40ff9f074 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h @@ -10,7 +10,7 @@ The concept `LinearCellComplexItems` refines the concept of `GenericMapItems` by The first type in `Attributes` tuple must be a model of the `CellAttributeWithPoint` concept. \cgalHasModelsBegin -\cgalModels{CGAL::Linear_cell_complex_min_items} +\cgalHasModels{CGAL::Linear_cell_complex_min_items} \cgalHasModelsEnd \sa `LinearCellComplex` diff --git a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h index 9a7b265540b..db4833f4218 100644 --- a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h +++ b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h @@ -9,7 +9,7 @@ types and operations in order to be a model for `BasicMatrix`. \cgalHasModelsBegin -\cgalModels{CGAL::Dynamic_matrix} +\cgalHasModels{CGAL::Dynamic_matrix} \cgalHasModelsEnd \sa `MonotoneMatrixSearchTraits` diff --git a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h index b20b74de1d0..4c40f6e5138 100644 --- a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h +++ b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h @@ -22,7 +22,7 @@ matrix classes. \cgalHasModelsBegin -\cgalModels{CGAL::Dynamic_matrix} +\cgalHasModels{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 99c3cfcba77..94bea1becca 100644 --- a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h +++ b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h @@ -9,7 +9,7 @@ that fulfills a certain feasibility criterion using the function `CGAL::sorted_matrix_search`. \cgalHasModelsBegin -\cgalModels{CGAL::Sorted_matrix_search_traits_adaptor} +\cgalHasModels{CGAL::Sorted_matrix_search_traits_adaptor} \cgalHasModelsEnd \sa `CGAL::sorted_matrix_search()` diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h index 7bc632d6fa8..e4289950e0c 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h @@ -14,7 +14,7 @@ meshing domain or not. \cgalRefines{ConstrainedTriangulationFaceBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Delaunay_mesh_face_base_2} +\cgalHasModels{CGAL::Delaunay_mesh_face_base_2} \cgalHasModelsEnd diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h index ac7a4a69161..26f52e7993c 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h @@ -14,7 +14,7 @@ the mesh density everywhere while modifying the mesh. \cgalRefines{TriangulationVertexBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Delaunay_mesh_vertex_base_2} +\cgalHasModels{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 06f5f865e33..c4dc873cc51 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h @@ -38,8 +38,8 @@ to split those with smallest quality first. The predicate `Is_bad` computes the quality of the triangle as a by-product. \cgalHasModelsBegin -\cgalModels{CGAL::Delaunay_mesh_criteria_2} -\cgalModels{CGAL::Delaunay_mesh_size_criteria_2} +\cgalHasModels{CGAL::Delaunay_mesh_criteria_2} +\cgalHasModels{CGAL::Delaunay_mesh_size_criteria_2} \cgalHasModelsEnd diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h index 44f0e818123..fe6dee8ad14 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h @@ -44,8 +44,8 @@ each cell (see below). \cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3,CopyConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Compact_mesh_cell_base_3} -\cgalModels{CGAL::Mesh_cell_base_3} +\cgalHasModels{CGAL::Compact_mesh_cell_base_3} +\cgalHasModels{CGAL::Mesh_cell_base_3} \cgalHasModelsEnd \sa `CGAL::make_mesh_3()` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h index bc8a60b51d3..b278477fb78 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h @@ -10,7 +10,7 @@ The concept `MeshCellCriteria_3` describes the types that handle the refinement criteria for mesh tetrahedra. \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_cell_criteria_3} +\cgalHasModels{CGAL::Mesh_cell_criteria_3} \cgalHasModelsEnd \sa `MeshEdgeCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h index dcb2123ec62..895fa9e8c0f 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h @@ -15,7 +15,7 @@ that describes the requirements, in terms of sizing, for the discretization of t \cgalRefines{MeshCriteria_3} \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_criteria_3} +\cgalHasModels{CGAL::Mesh_criteria_3} \cgalHasModelsEnd \sa `MeshEdgeCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h index 83fad908d25..43587310ddd 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h @@ -13,7 +13,7 @@ are described by the concept `MeshFacetCriteria_3`. The concept `MeshCriteria_3` encapsulates these concepts. \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_criteria_3} +\cgalHasModels{CGAL::Mesh_criteria_3} \cgalHasModelsEnd \sa `MeshFacetCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h index d3f7d1e61ea..c264f53332c 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h @@ -6,7 +6,7 @@ The concept `MeshDomainField_3` describes a scalar field which could be queried at any point of the space. \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_constant_domain_field_3} +\cgalHasModels{CGAL::Mesh_constant_domain_field_3} \cgalHasModelsEnd \sa `MeshDomain_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h index 3a3a79f1105..2dc7f6acd98 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h @@ -18,8 +18,8 @@ between two ordered points on the same curve. \cgalRefines{MeshDomain_3} \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_domain_with_polyline_features_3} -\cgalModels{CGAL::Polyhedral_mesh_domain_with_features_3} +\cgalHasModels{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 03ca9f2fef7..401e5f8efc1 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h @@ -30,8 +30,8 @@ if it includes points which are strictly inside and strictly outside the domain (resp. the subdomain). \cgalHasModelsBegin -\cgalModels{CGAL::Polyhedral_mesh_domain_3} -\cgalModels{CGAL::Labeled_mesh_domain_3} +\cgalHasModels{CGAL::Polyhedral_mesh_domain_3} +\cgalHasModels{CGAL::Labeled_mesh_domain_3} \cgalHasModelsEnd \sa `MeshVertexBase_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h index 930a627cc76..367fda23008 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h @@ -8,7 +8,7 @@ It provides an upper bound for the distance between two protecting ball centers that are consecutive on a 1-feature. \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_edge_criteria_3} +\cgalHasModels{CGAL::Mesh_edge_criteria_3} \cgalHasModelsEnd \sa `MeshCellCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h index a0c32629c5a..e8590456276 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h @@ -10,7 +10,7 @@ The concept `MeshFacetCriteria_3` describes the types that handle the refinement criteria for surface facets. \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_facet_criteria_3} +\cgalHasModels{CGAL::Mesh_facet_criteria_3} \cgalHasModelsEnd \sa `MeshCellCriteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h index 20a62546c2c..be66168fa4c 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h @@ -23,7 +23,7 @@ each cell (see below). \cgalRefines{SimplicialMeshVertexBase_3,RegularTriangulationVertexBase_3,SurfaceMeshVertexBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_vertex_base_3} +\cgalHasModels{CGAL::Mesh_vertex_base_3} \cgalHasModelsEnd \sa `CGAL::make_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 7be6df1aece..b009b35f6d4 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h @@ -6,7 +6,7 @@ The concept `TriangleAccessor_3` represents an accessor to a triangulated polyhe surface, intersection free and without boundaries. \cgalHasModelsBegin -\cgalModels{CGAL::Triangle_accessor_3,K>} +\cgalHasModels{CGAL::Triangle_accessor_3,K>} \cgalHasModelsEnd \sa `CGAL::Polyhedral_mesh_domain_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 848c46adfda..547dde07838 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 @@ -7,11 +7,11 @@ 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$. \cgalHasModelsBegin -\cgalModels{CGAL::Small_side_angle_bisector_decomposition_2} -\cgalModels{CGAL::Optimal_convex_decomposition_2} -\cgalModels{CGAL::Hertel_Mehlhorn_convex_decomposition_2} -\cgalModels{CGAL::Greene_convex_decomposition_2} -\cgalModels{CGAL::Polygon_nop_decomposition_2} +\cgalHasModels{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 6cf7eb45c35..5a1fac77173 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 @@ -10,8 +10,8 @@ convex sub-polygons \f$ P_1, \ldots, P_k\f$, such that \cgalRefines{PolygonConvexDecomposition_2} \cgalHasModelsBegin -\cgalModels{CGAL::Polygon_vertical_decomposition_2} -\cgalModels{CGAL::Polygon_triangulation_decomposition_2} +\cgalHasModels{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 b3f2543843f..8509b42a07f 100644 --- a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h +++ b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h @@ -10,7 +10,7 @@ the integral image type `std::size_t`. The image values have to be unique for all keys in the domain type `Key`. \cgalHasModelsBegin -\cgalModels{CGAL::Handle_hash_function} +\cgalHasModels{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 a78fde1730a..53e9c0badd0 100644 --- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h +++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h @@ -9,7 +9,7 @@ Boolean tag `ModularTraits::Is_modularizable`. The mapping into the `Residue_typ provided by the functor `ModularTraits::Modular_image`. \cgalHasModelsBegin -\cgalModels{CGAL::Modular_traits} +\cgalHasModels{CGAL::Modular_traits} \cgalHasModelsEnd \sa `CGAL::Residue` diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h index 1d7f832f5d8..6bc74bc0084 100644 --- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h +++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h @@ -19,20 +19,20 @@ This is due to the fact that the denominator may be zero modulo the prime, which can not be represented. \cgalHasModelsBegin -\cgalModels{int} -\cgalModels{long} -\cgalModels{CORE::BigInt} -\cgalModels{CGAL::Gmpz} -\cgalModels{leda_integer} -\cgalModels{mpz_class} +\cgalHasModels{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. \cgalHasModelsBegin -\cgalModels{CGAL::Lazy_exact_nt} -\cgalModels{CGAL::Sqrt_extension} -\cgalModels{CGAL::Polynomial} +\cgalHasModels{CGAL::Lazy_exact_nt} +\cgalHasModels{CGAL::Sqrt_extension} +\cgalHasModels{CGAL::Polynomial} \cgalHasModelsEnd \sa `CGAL::Residue` diff --git a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h index c46d39daa54..b6e6da24820 100644 --- a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h +++ b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h @@ -39,9 +39,9 @@ geometry. At the same time it provides extensible geometric primitives on the extended geometric objects. \cgalHasModelsBegin -\cgalModels{CGAL::Extended_cartesian} -\cgalModels{CGAL::Extended_homogeneous} -\cgalModels{CGAL::Filtered_extended_homogeneous} +\cgalHasModels{CGAL::Extended_cartesian} +\cgalHasModels{CGAL::Extended_homogeneous} +\cgalHasModels{CGAL::Filtered_extended_homogeneous} \cgalHasModelsEnd */ 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 40fdf24e2d8..80f3c1e28dc 100644 --- a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h +++ b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h @@ -9,7 +9,7 @@ a 3x3 matrix type. \cgalRefines{Kernel} \cgalHasModelsBegin -\cgalModels{CGAL::Oriented_bounding_box_traits_3} +\cgalHasModels{CGAL::Oriented_bounding_box_traits_3} \cgalHasModelsEnd */ diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h index 83408944f2b..fdb0781ba26 100644 --- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h +++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h @@ -6,9 +6,9 @@ template parameter of the `CGAL::Orthtree` class. \cgalHasModelsBegin - \cgalModels{CGAL::Orthtree_traits_2} - \cgalModels{CGAL::Orthtree_traits_3} - \cgalModels{CGAL::Orthtree_traits_d} + \cgalHasModels{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 851482d8751..5aeda690079 100644 --- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h +++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h @@ -10,10 +10,10 @@ (e.g. preorder, postorder). \cgalHasModelsBegin - \cgalModels{CGAL::Orthtrees::Preorder_traversal} - \cgalModels{CGAL::Orthtrees::Postorder_traversal} - \cgalModels{CGAL::Orthtrees::Leaves_traversal} - \cgalModels{CGAL::Orthtrees::Level_traversal} + \cgalHasModels{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 6b9be975123..ad0d171d07a 100644 --- a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h @@ -7,7 +7,7 @@ by `convex_partition_is_valid_2` for testing the validity of a convex partition of a polygon. \cgalHasModelsBegin -\cgalModels{CGAL::Partition_traits_2} +\cgalHasModels{CGAL::Partition_traits_2} \cgalHasModelsEnd \sa `CGAL::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 112995c86f1..12b863da2ad 100644 --- a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h @@ -7,8 +7,8 @@ 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. \cgalHasModelsBegin -\cgalModels{CGAL::Partition_traits_2} -\cgalModels{CGAL::Kernel_traits_2} +\cgalHasModels{CGAL::Partition_traits_2} +\cgalHasModels{CGAL::Kernel_traits_2} \cgalHasModelsEnd \sa `CGAL::Is_y_monotone_2` diff --git a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h index 1ef70344a2d..c1f7de776c6 100644 --- a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h @@ -9,7 +9,7 @@ an optimal convex partition of a polygon. \cgalRefines{PartitionTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Partition_traits_2} +\cgalHasModels{CGAL::Partition_traits_2} \cgalHasModelsEnd \sa `CGAL::convex_partition_is_valid_2()` diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h index 7edbe6dcde6..537588e4ecf 100644 --- a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h @@ -15,7 +15,7 @@ and the concept `YMonotonePartitionTraits_2` for the additional requirements for testing for convexity and \f$ y\f$-monotonicity, respectively. \cgalHasModelsBegin -\cgalModels{CGAL::Partition_is_valid_traits_2} +\cgalHasModels{CGAL::Partition_is_valid_traits_2} \cgalHasModelsEnd \sa `CGAL::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 910d565cf10..955d8da4547 100644 --- a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h @@ -9,7 +9,7 @@ to all traits classes. The concept `PartitionTraits_2` defines this common set o requirements. \cgalHasModelsBegin -\cgalModels{CGAL::Partition_traits_2} +\cgalHasModels{CGAL::Partition_traits_2} \cgalHasModelsEnd \sa `CGAL::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 662bdb369a9..be190734ab0 100644 --- a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h +++ b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h @@ -7,8 +7,8 @@ valid partition polygon or not, where "valid" can assume any of several meanings (e.g., convex or \f$ y\f$-monotone). \cgalHasModelsBegin -\cgalModels{CGAL::Is_convex_2} -\cgalModels{CGAL::Is_y_monotone_2} +\cgalHasModels{CGAL::Is_convex_2} +\cgalHasModels{CGAL::Is_y_monotone_2} \cgalHasModelsEnd \sa `CGAL::approx_convex_partition_2()` diff --git a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h index 7869a2122e9..aaf6d9eea5a 100644 --- a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h @@ -7,7 +7,7 @@ by `y_monotone_partition_is_valid_2` for testing the validity of a \f$ y\f$-monotone partition of a polygon. \cgalHasModelsBegin -\cgalModels{CGAL::Partition_traits_2} +\cgalHasModels{CGAL::Partition_traits_2} \cgalHasModelsEnd \sa `CGAL::partition_is_valid_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 0ae4f0fedcf..f9a8d6be4d9 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 @@ -28,7 +28,7 @@ dual functions are called. The additional predicate type `nearest_vertex(..)` are issued. \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_2_Delaunay_triangulation_traits_2} +\cgalHasModels{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 172f176c7cf..3ff8cfc2b53 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 @@ -8,7 +8,7 @@ The concept `Periodic_2Offset_2` describes a two-/dimensional integer vector with some specialized access functions and operations. \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_2_offset_2} +\cgalHasModels{CGAL::Periodic_2_offset_2} \cgalHasModelsEnd \sa `Periodic_2TriangulationTraits_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 da6b89b93a2..41eb5dded8e 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 @@ -14,7 +14,7 @@ vertex \f$ i\f$. \cgalRefines{TriangulationFaceBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_2_triangulation_face_base_2} +\cgalHasModels{CGAL::Periodic_2_triangulation_face_base_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_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 1d93a35edbe..658d1a104da 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 @@ -25,7 +25,7 @@ Periodic triangulation must fulfill the following requirements: \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_2_triangulation_traits_2} +\cgalHasModels{CGAL::Periodic_2_triangulation_traits_2} \cgalHasModelsEnd \sa `TriangulationTraits_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 eeae18dcd70..f9d6f4cc5a6 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 @@ -17,7 +17,7 @@ The storage of the offset is only needed when a triangulation is copied. \cgalRefines{TriangulationVertexBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_2_triangulation_vertex_base_2} +\cgalHasModels{CGAL::Periodic_2_triangulation_vertex_base_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_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 73f7d1339a5..27c90fd712b 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 @@ -23,7 +23,7 @@ Wrapping any model of `Periodic_3MeshDomain_3` with the class of `Periodic_3MeshDomainWithFeatures_3`. \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_domain_with_polyline_features_3 >} +\cgalHasModels{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 b92341527b9..2d4ef680a92 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 @@ -21,7 +21,7 @@ is a model of this concept. It is possible to create artificially periodic funct through the class `CGAL::Periodic_3_function_wrapper`. \cgalHasModelsBegin -\cgalModels{CGAL::Labeled_mesh_domain_3} +\cgalHasModels{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 571b9a0fa98..10eab7ef1c8 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 @@ -16,7 +16,7 @@ functor the version without offsets. \cgalRefines{Periodic_3TriangulationTraits_3,DelaunayTriangulationTraits_3} \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_3_Delaunay_triangulation_traits_3} +\cgalHasModels{CGAL::Periodic_3_Delaunay_triangulation_traits_3} \cgalHasModelsEnd In addition to the requirements described by the concepts 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 2cb71cf9bcc..6de19e6a0d2 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 @@ -7,7 +7,7 @@ The concept `Periodic_3Offset_3` describes a three-dimensional integer vector with some specialized access functions and operations. \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_3_offset_3} +\cgalHasModels{CGAL::Periodic_3_offset_3} \cgalHasModelsEnd \sa `Periodic_3TriangulationTraits_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 05b10c71e02..1f2c12dbba3 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 @@ -6,8 +6,8 @@ \cgalRefines{RegularTriangulationCellBase_3,Periodic_3TriangulationDSCellBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Regular_triangulation_cell_base_3 >} -\cgalModels{CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3 >} +\cgalHasModels{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 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 be6214920cb..a0ecbaa24e4 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 @@ -6,7 +6,7 @@ \cgalRefines{RegularTriangulationVertexBase_3,Periodic_3TriangulationDSVertexBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Regular_triangulation_vertex_base_3 >} +\cgalHasModels{CGAL::Regular_triangulation_vertex_base_3 >} \cgalHasModelsEnd The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the 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 cdc5a72ead5..b190e091be4 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 @@ -16,7 +16,7 @@ functor the version without offsets. \cgalRefines{Periodic_3TriangulationTraits_3,RegularTriangulationTraits_3} \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_3_regular_triangulation_traits_3} +\cgalHasModels{CGAL::Periodic_3_regular_triangulation_traits_3} \cgalHasModelsEnd In addition to the requirements described for the traits class 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 d6e735e497f..5ce61b440a8 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 @@ -19,7 +19,7 @@ does not contain any information. \cgalRefines{TriangulationDSCellBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_3_triangulation_ds_cell_base_3} +\cgalHasModels{CGAL::Periodic_3_triangulation_ds_cell_base_3} \cgalHasModelsEnd \sa `TriangulationDataStructure_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 2665d89bdef..fe9e9872026 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 @@ -13,7 +13,7 @@ a vertex provides access to one of its incident cells through a handle. \cgalRefines{TriangulationDSVertexBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_3_triangulation_ds_vertex_base_3} +\cgalHasModels{CGAL::Periodic_3_triangulation_ds_vertex_base_3} \cgalHasModelsEnd \sa `TriangulationDataStructure_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 67b8f33a78a..b25e098a01c 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 @@ -15,7 +15,7 @@ functor the version without offsets. \cgalRefines{TriangulationTraits_3} \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_3_triangulation_traits_3} +\cgalHasModels{CGAL::Periodic_3_triangulation_traits_3} \cgalHasModelsEnd \sa `Periodic_3DelaunayTriangulationTraits_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 77501fa9399..17efb2f3505 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 @@ -13,7 +13,7 @@ by any class used to instantiate the first template parameter of the class `CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_2`. \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2} +\cgalHasModels{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 92d62dfeeb2..2ebf4a74bbd 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 @@ -21,7 +21,7 @@ Hyperbolic translations are represented by a nested type which is provided by th `Periodic_4HyperbolicDelaunayTriangulationTraits_2`. \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_4_hyperbolic_triangulation_face_base_2} +\cgalHasModels{CGAL::Periodic_4_hyperbolic_triangulation_face_base_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_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 40b3cb0d34b..5b3c5f915eb 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 @@ -15,7 +15,7 @@ A boolean flag indicates whether the face stores a translation or not. The value set when storing or removing a translation. \cgalHasModelsBegin -\cgalModels{CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2} +\cgalHasModels{CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_2` diff --git a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h index 6f58a4de0e8..c27e8b4a706 100644 --- a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h +++ b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h @@ -9,8 +9,8 @@ * the holes. * * \cgalHasModelsBegin - * \cgalModels{CGAL::General_polygon_with_holes_2} - * \cgalModels{CGAL::Polygon_with_holes_2} + * \cgalHasModels{CGAL::General_polygon_with_holes_2} + * \cgalHasModels{CGAL::Polygon_with_holes_2} * \cgalHasModelsEnd */ 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 683f7f58136..03d52b5a881 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h @@ -7,7 +7,7 @@ /// /// \cgalRefines{CopyConstructible} /// \cgalHasModelsBegin -/// \cgalModels{CGAL::Polygon_mesh_processing::Corefinement::Default_visitor} +/// \cgalHasModels{CGAL::Polygon_mesh_processing::Corefinement::Default_visitor} /// \cgalHasModelsEnd class PMPCorefinementVisitor{ 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 e524ca75ffe..67b8b029403 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h @@ -10,7 +10,7 @@ /// /// \cgalRefines{CopyConstructible} /// \cgalHasModelsBegin -/// \cgalModels{CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor} +/// \cgalHasModels{CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor} /// \cgalHasModelsEnd class PMPHolefillingVisitor{ 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 0016e1cb865..0308f62f516 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h @@ -8,7 +8,7 @@ /// /// \cgalRefines{CopyConstructible} /// \cgalHasModelsBegin -/// \cgalModels{CGAL::Polygon_mesh_processing::Default_orientation_visitor} +/// \cgalHasModels{CGAL::Polygon_mesh_processing::Default_orientation_visitor} /// \cgalHasModelsEnd class PMPPolygonSoupOrientationVisitor{ 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 3bc52ba8786..d091f15fa64 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h @@ -7,7 +7,7 @@ /// /// \cgalRefines{CopyConstructible} /// \cgalHasModelsBegin -/// \cgalModels{CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor} +/// \cgalHasModels{CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor} /// \cgalHasModelsEnd diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h index d75b5d0b491..f6b86ba2c1c 100644 --- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h +++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h @@ -14,9 +14,9 @@ polyhedral surface renames faces to facets. \cgalRefines{HalfedgeDSItems} \cgalHasModelsBegin -\cgalModels{CGAL::Polyhedron_items_3} -\cgalModels{CGAL::Polyhedron_min_items_3} -\cgalModels{CGAL::Polyhedron_items_with_id_3} +\cgalHasModels{CGAL::Polyhedron_items_3} +\cgalHasModels{CGAL::Polyhedron_min_items_3} +\cgalHasModels{CGAL::Polyhedron_items_with_id_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 bf8fb4b60ab..94f5ed07797 100644 --- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h +++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h @@ -13,9 +13,9 @@ preserve the overall polyline set shape as much as possible \cgalRefines{CopyConstructible,Assignable} \cgalHasModelsBegin -\cgalModels{CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost} -\cgalModels{CGAL::Polyline_simplification_2::Scaled_squared_distance_cost} -\cgalModels{CGAL::Polyline_simplification_2::Squared_distance_cost} +\cgalHasModels{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 5d95499fd69..0c2ae58a59f 100644 --- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h +++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h @@ -6,9 +6,9 @@ Models of this concept are passed to the polyline simplification algorithm to in when to stop the process. \cgalHasModelsBegin -\cgalModels{CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold} -\cgalModels{CGAL::Polyline_simplification_2::Stop_below_count_threshold} -\cgalModels{CGAL::Polyline_simplification_2::Stop_above_cost_threshold} +\cgalHasModels{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 */ 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 e4d8d079a59..19838b07ac7 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 @@ -9,7 +9,7 @@ whether a vertex can be removed, and the cost of the removal. \cgalRefines{TriangulationVertexBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Polyline_simplification_2::Vertex_base_2} +\cgalHasModels{CGAL::Polyline_simplification_2::Vertex_base_2} \cgalHasModelsEnd \sa `TriangulationFaceBase_2` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h index c1c13ad9640..d7d961ac56d 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h @@ -32,7 +32,7 @@ is possible to select a certain variable. \sa `Polynomial_d` \cgalHasModelsBegin -\cgalModels{CGAL::Polynomial_traits_d} +\cgalHasModels{CGAL::Polynomial_traits_d} \cgalHasModelsEnd */ diff --git a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h index 2b41053230e..e58552f582f 100644 --- a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h +++ b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h @@ -33,7 +33,7 @@ coefficient is a `Field` the polynomial is model of `EuclideanRing`. \sa `PolynomialTraits_d` \cgalHasModelsBegin -\cgalModels{CGAL::Polynomial} +\cgalHasModels{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 a0b89952bc0..874782161e7 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 @@ -8,10 +8,10 @@ needed to compute all furthest neighbors for the vertices of a convex polygon using the function `all_furthest_neighbors_2()`. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian} -\cgalModels{CGAL::Homogeneous} -\cgalModels{CGAL::Simple_cartesian} -\cgalModels{CGAL::Simple_homogeneous} +\cgalHasModels{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 1198e0d9869..32004e174ba 100644 --- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h +++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h @@ -7,9 +7,9 @@ This concept defines the requirements for traits classes of \f$ d\f$-dimensional optimisation algorithms. \cgalHasModelsBegin -\cgalModels{CGAL::Polytope_distance_d_traits_2} -\cgalModels{CGAL::Polytope_distance_d_traits_3} -\cgalModels{CGAL::Polytope_distance_d_traits_d} +\cgalHasModels{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 7295ea2e296..5686aec87e1 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 @@ -13,7 +13,7 @@ width-algorithm to have access to the homogeneous representation of points. \cgalHasModelsBegin -\cgalModels{CGAL::Width_default_traits_3} +\cgalHasModels{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 206dbdb1a57..ce598886ee9 100644 --- a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h +++ b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h @@ -36,9 +36,9 @@ iterators over the program data, see below. The program therefore comes in dense representation which includes zero entries. \cgalHasModelsBegin -\cgalModels{CGAL::Quadratic_program} -\cgalModels{CGAL::Quadratic_program_from_mps} -\cgalModels{CGAL::Linear_program_from_iterators} +\cgalHasModels{CGAL::Quadratic_program} +\cgalHasModels{CGAL::Quadratic_program_from_mps} +\cgalHasModels{CGAL::Linear_program_from_iterators} \cgalHasModelsEnd diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h index e9bbee8dadd..b9304ca0737 100644 --- a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h +++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h @@ -30,9 +30,9 @@ iterators over the program data, see below. The program therefore comes in dense representation which includes zero entries. \cgalHasModelsBegin -\cgalModels{CGAL::Quadratic_program} -\cgalModels{CGAL::Quadratic_program_from_mps} -\cgalModels{CGAL::Nonnegative_linear_program_from_iterators} +\cgalHasModels{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 @@ -40,9 +40,9 @@ types, respectively, for `A_iterator`) must be convertible to some common `IntegralDomain` `ET`. \cgalHasModelsBegin -\cgalModels{CGAL::Quadratic_program} -\cgalModels{CGAL::Quadratic_program_from_mps} -\cgalModels{CGAL::Nonnegative_linear_program_from_iterators} +\cgalHasModels{CGAL::Quadratic_program} +\cgalHasModels{CGAL::Quadratic_program_from_mps} +\cgalHasModels{CGAL::Nonnegative_linear_program_from_iterators} \cgalHasModelsEnd \sa `QuadraticProgram` diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h index 508ac094f4a..07709e9da11 100644 --- a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h +++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h @@ -34,9 +34,9 @@ iterators over the program data, see below. The program therefore comes in dense representation which includes zero entries. \cgalHasModelsBegin -\cgalModels{CGAL::Quadratic_program} -\cgalModels{CGAL::Quadratic_program_from_mps} -\cgalModels{CGAL::Nonnegative_quadratic_program_from_iterators} +\cgalHasModels{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 diff --git a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h index 3b3ebe86f27..f5948e20519 100644 --- a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h +++ b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h @@ -35,9 +35,9 @@ iterators over the program data, see below. The program therefore comes in dense representation which includes zero entries. \cgalHasModelsBegin -\cgalModels{CGAL::Quadratic_program} -\cgalModels{CGAL::Quadratic_program_from_mps} -\cgalModels{CGAL::Quadratic_program_from_iterators} +\cgalHasModels{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 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 e29abc65d3b..f436119cf12 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h @@ -49,7 +49,7 @@ of the input complex. \cgalRefines{MeshComplex_3InTriangulation_3} \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_complex_3_in_triangulation_3} +\cgalHasModels{CGAL::Mesh_complex_3_in_triangulation_3} \cgalHasModelsEnd \sa `MeshComplex_3InTriangulation_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 2bd6bf5d8e8..35a40e898e3 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h @@ -43,7 +43,7 @@ and each boundary surface patch. The data structure encodes the final mesh at the end of the meshing process. \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_complex_3_in_triangulation_3} +\cgalHasModels{CGAL::Mesh_complex_3_in_triangulation_3} \cgalHasModelsEnd \sa `MeshDomain_3` diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h index 37c1aa8a1df..12332226a75 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h @@ -19,10 +19,10 @@ of the triangulation that are surface facets. \cgalRefines{TriangulationCellBase_3,CopyConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Compact_mesh_cell_base_3} -\cgalModels{CGAL::Mesh_cell_base_3} -\cgalModels{CGAL::Simplicial_mesh_cell_base_3} -\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3} +\cgalHasModels{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 accc2c9b77a..24878f48bd4 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h @@ -17,9 +17,9 @@ and to an index characteristic of this face. \cgalRefines{TriangulationVertexBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Mesh_vertex_base_3} -\cgalModels{CGAL::Simplicial_mesh_vertex_base_3} -\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3} +\cgalHasModels{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 900c6874eb3..7b630692708 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h +++ b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h @@ -7,8 +7,8 @@ The concept `Descriptor` allows to describe a unique object in an abstract model \cgalRefines{DefaultConstructible,CopyConstructible,Assignable,EqualityComparable} \cgalHasModelsBegin -\cgalModels{Index} -\cgalModels{Handle} +\cgalHasModels{Index} +\cgalHasModels{Handle} \cgalHasModelsEnd */ diff --git a/STL_Extension/doc/STL_Extension/Concepts/Index.h b/STL_Extension/doc/STL_Extension/Concepts/Index.h index 4a3c749305d..7b89ed870e3 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/Index.h +++ b/STL_Extension/doc/STL_Extension/Concepts/Index.h @@ -7,8 +7,8 @@ The concept `Index` is a refinement of `Descriptor` which must be convertible fr \cgalRefines{Descriptor} \cgalHasModelsBegin -\cgalModels{int} -\cgalModels{size_t} +\cgalHasModels{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 55cd05e95da..871f9dc3b1b 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h +++ b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h @@ -13,19 +13,19 @@ concept `UnaryFunction`, but takes also care of (const) references. \cgalHasModelsBegin -\cgalModels{CGAL::Identity} -\cgalModels{CGAL::Dereference} -\cgalModels{CGAL::Get_address} -\cgalModels{CGAL::Cast_function_object} -\cgalModels{CGAL::Project_vertex} -\cgalModels{CGAL::Project_facet} -\cgalModels{CGAL::Project_point} -\cgalModels{CGAL::Project_normal} -\cgalModels{CGAL::Project_plane} -\cgalModels{CGAL::Project_next} -\cgalModels{CGAL::Project_prev} -\cgalModels{CGAL::Project_next_opposite} -\cgalModels{CGAL::Project_opposite_prev} +\cgalHasModels{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 89f447da3b5..c9780c60226 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h +++ b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h @@ -22,7 +22,7 @@ is the \"thing\" that is locked when one tries to lock `object`. In the previous example, `S(point)` is the voxel containing `point`. \cgalHasModelsBegin -\cgalModels{CGAL::Spatial_lock_grid_3} +\cgalHasModels{CGAL::Spatial_lock_grid_3} \cgalHasModelsEnd */ 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 64979029e17..0f3004320b7 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 @@ -12,8 +12,8 @@ namespace Scale_space_reconstruction_3 { * points and that returns a set of facets. * * \cgalHasModelsBegin - * \cgalModels{CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher} - * \cgalModels{CGAL::Scale_space_reconstruction_3::Advancing_front_mesher} + * \cgalHasModels{CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher} + * \cgalHasModels{CGAL::Scale_space_reconstruction_3::Advancing_front_mesher} * \cgalHasModelsEnd * */ 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 8eaa935ce3c..20cac9eabdf 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 @@ -16,8 +16,8 @@ namespace Scale_space_reconstruction_3 { * reconstruction algorithm. * * \cgalHasModelsBegin - * \cgalModels{CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother} - * \cgalModels{CGAL::Scale_space_reconstruction_3::Jet_smoother} + * \cgalHasModels{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 75e97ae287b..ede7918eb83 100644 --- a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h +++ b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h @@ -10,12 +10,12 @@ are needed for window queries. \cgalHasModelsBegin -\cgalModels{CGAL::Range_segment_tree_set_traits_2} -\cgalModels{CGAL::Range_segment_tree_set_traits_3} -\cgalModels{CGAL::Range_tree_map_traits_2} -\cgalModels{CGAL::Range_tree_map_traits_3} -\cgalModels{CGAL::Segment_tree_map_traits_2} -\cgalModels{CGAL::Segment_tree_map_traits_3} +\cgalHasModels{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 15c80be49e4..88e901da204 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 @@ -34,7 +34,7 @@ We only describe the additional requirements with respect to the \cgalRefines{ApolloniusGraphDataStructure_2} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_data_structure_2} +\cgalHasModels{CGAL::Triangulation_data_structure_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_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 4ae9eec2503..98c4ddcd1be 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 @@ -10,7 +10,7 @@ requirements for the face base class of the \cgalRefines{TriangulationFaceBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Segment_Delaunay_graph_face_base_2} +\cgalHasModels{CGAL::Segment_Delaunay_graph_face_base_2} \cgalHasModelsEnd \sa `SegmentDelaunayGraphDataStructure_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 d7a281a8d81..b33a87abea8 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 @@ -27,7 +27,7 @@ introduce any constructors in addition to those of the `SegmentDelaunayGraphVertexBase_2` concept. \cgalHasModelsBegin -\cgalModels{CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2 >} +\cgalHasModels{CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2 >} \cgalHasModelsEnd \sa `SegmentDelaunayGraphDataStructure_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 65002722e6d..879c81bdcc0 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 @@ -9,7 +9,7 @@ requirements for the sites of a segment Delaunay graph. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Segment_Delaunay_graph_site_2} +\cgalHasModels{CGAL::Segment_Delaunay_graph_site_2} \cgalHasModelsEnd \sa `SegmentDelaunayGraphTraits_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 fbe6887f2eb..e6605fbcdac 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 @@ -12,7 +12,7 @@ by storing handles to points instead of points. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Segment_Delaunay_graph_storage_site_2} +\cgalHasModels{CGAL::Segment_Delaunay_graph_storage_site_2} \cgalHasModelsEnd \sa `SegmentDelaunayGraphTraits_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 e733426405d..27ed7f806d6 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 @@ -16,7 +16,7 @@ See section \ref Segment_Delaunay_graph_2StronglyIntersecting for more informati \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Segment_Delaunay_graph_storage_traits_2} +\cgalHasModels{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 7297c1db831..933124e25d1 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 @@ -15,10 +15,10 @@ constructions for sites and several function object types for the predicates. \cgalHasModelsBegin -\cgalModels{CGAL::Segment_Delaunay_graph_traits_2} -\cgalModels{CGAL::Segment_Delaunay_graph_traits_without_intersections_2} -\cgalModels{CGAL::Segment_Delaunay_graph_filtered_traits_2} -\cgalModels{CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2} +\cgalHasModels{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` 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 32b0b36ab17..2651f8171ff 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 @@ -12,7 +12,7 @@ site of the segment Delaunay graph and provides access to one of its incident faces through a `Face_handle`. \cgalHasModelsBegin -\cgalModels{CGAL::Segment_Delaunay_graph_vertex_base_2} +\cgalHasModels{CGAL::Segment_Delaunay_graph_vertex_base_2} \cgalHasModelsEnd \sa `SegmentDelaunayGraphTraits_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 a384691661a..62c9a4f8f5b 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 @@ -37,10 +37,10 @@ with respect to the \cgalRefines{SegmentDelaunayGraphTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Segment_Delaunay_graph_Linf_traits_2} -\cgalModels{CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2} -\cgalModels{CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2} -\cgalModels{CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2} +\cgalHasModels{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` diff --git a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h index 9005865d80e..a8d30d3a47f 100644 --- a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h +++ b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h @@ -13,7 +13,7 @@ Point and normal property maps have to be provided to extract the points and the normals from the input. \cgalHasModelsBegin -\cgalModels{CGAL::Shape_detection::Efficient_RANSAC_traits} +\cgalHasModels{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 76926590b35..f0522b061ef 100644 --- a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h +++ b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h @@ -6,10 +6,10 @@ A concept that describes the set of methods used by the `CGAL::Shape_detection:: to access neighbors of an item. \cgalHasModelsBegin -\cgalModels{CGAL::Shape_detection::Point_set::K_neighbor_query} -\cgalModels{CGAL::Shape_detection::Point_set::Sphere_neighbor_query} -\cgalModels{CGAL::Shape_detection::Polygon_mesh::Polyline_graph} -\cgalModels{CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query} +\cgalHasModels{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 09b97911b5d..e1f2551fa5b 100644 --- a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h +++ b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h @@ -8,13 +8,13 @@ to maintain a region. A region is represented by a set items, which are included in this region. \cgalHasModelsBegin -\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_line_fit_region} -\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region} -\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region} -\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region} -\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region} -\cgalModels{CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region} -\cgalModels{CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region} +\cgalHasModels{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 cf96c3abe8e..9803efdf5c2 100644 --- a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h +++ b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h @@ -11,9 +11,9 @@ contour edges towards these directions. All contour regularization functions in this package are parameterized by this concept. \cgalHasModelsBegin -\cgalModels{Contours::Longest_direction_2} -\cgalModels{Contours::Multiple_directions_2} -\cgalModels{Contours::User_defined_directions_2} +\cgalHasModels{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 f2cd1486593..ebfa48ea755 100644 --- a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h +++ b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h @@ -10,7 +10,7 @@ A concept that describes the set of methods used by the class a geometric object being regularized. \cgalHasModelsBegin -\cgalModels{Segments::Delaunay_neighbor_query_2} +\cgalHasModels{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 ed3a10b5e28..bb3956c75a3 100644 --- a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h +++ b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h @@ -10,8 +10,8 @@ A concept that describes the set of methods used by the class required for setting up the the global regularization problem. \cgalHasModelsBegin -\cgalModels{Segments::Angle_regularization_2} -\cgalModels{Segments::Offset_regularization_2} +\cgalHasModels{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 363d63a6775..e0d7e4196bb 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 @@ -11,7 +11,7 @@ polyhedral mesh approximating a skin surface \cgalRefines{RegularTriangulationTraits_3} \cgalHasModelsBegin -\cgalModels{CGAL::Skin_surface_traits_3} +\cgalHasModels{CGAL::Skin_surface_traits_3} \cgalHasModelsEnd \sa `CGAL::Skin_surface_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 22146acf83a..58fef5d3800 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 @@ -10,8 +10,8 @@ weighted points and a shrink factor. By default the input balls are grown in such that the skin surface wraps around the input balls. \cgalHasModelsBegin -\cgalModels{CGAL::Skin_surface_3} -\cgalModels{CGAL::Union_of_balls_3} +\cgalHasModels{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 49dd95d0533..5cc0f58e596 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 @@ -12,7 +12,7 @@ some function object types for the required predicates on those primitives. \cgalRefines{ArrangementTraits_2} \cgalHasModelsBegin -\cgalModels{CGAL::Snap_rounding_traits_2} +\cgalHasModels{CGAL::Snap_rounding_traits_2} \cgalHasModelsEnd */ diff --git a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h index 7791fbf59a9..8c22838c7cc 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h @@ -20,7 +20,7 @@ For example, a matrix of dimension 3 is defined as \tparam dim Dimension of the matrices and vectors \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_diagonalize_traits} +\cgalHasModels{CGAL::Eigen_diagonalize_traits} \cgalHasModelsEnd */ template diff --git a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h index f73b3d14396..b20bbdcb36f 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h @@ -8,7 +8,7 @@ class MixedIntegerProgramTraits a Mixed Integer Programming (MIP) problem. \cgalHasModelsBegin -\cgalModels{CGAL::Variable} +\cgalHasModels{CGAL::Variable} \cgalHasModelsEnd */ template @@ -115,7 +115,7 @@ class MixedIntegerProgramVariable constraint in a Mixed Integer Programming (MIP) problem. \cgalHasModelsBegin -\cgalModels{CGAL::Linear_constraint} +\cgalHasModels{CGAL::Linear_constraint} \cgalHasModelsEnd */ template @@ -214,7 +214,7 @@ class MixedIntegerProgramLinearConstraint objective function in a Mixed Integer Programming (MIP) problem. \cgalHasModelsBegin -\cgalModels{CGAL::Linear_objective} +\cgalHasModels{CGAL::Linear_objective} \cgalHasModelsEnd */ template @@ -284,9 +284,9 @@ variables, linear objective, and linear constraints (if any) and provides a meth to solve the problem. \cgalHasModelsBegin -\cgalModels{CGAL::Mixed_integer_program_traits} -\cgalModels{CGAL::GLPK_mixed_integer_program_traits} -\cgalModels{CGAL::SCIP_mixed_integer_program_traits} +\cgalHasModels{CGAL::Mixed_integer_program_traits} +\cgalHasModels{CGAL::GLPK_mixed_integer_program_traits} +\cgalHasModels{CGAL::SCIP_mixed_integer_program_traits} \cgalHasModelsEnd */ template diff --git a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h index 49fb8ee1937..11e2d309d26 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h +++ b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h @@ -8,7 +8,7 @@ Concept describing the set of requirements for solving the normal equation \f$ A \sa `SparseLinearAlgebraTraits_d` \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_solver_traits} +\cgalHasModels{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 7ed6bf55f2b..f03f5ed21ce 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h @@ -25,7 +25,7 @@ where \f$ u_i \in \mathbb{R} \cup \{+\infty\} \f$ for all \f$ i \f$. \cgalHasModelsBegin -\cgalModels{CGAL::OSQP_quadratic_program_traits} +\cgalHasModels{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 9d236d47d3d..b44b686dbb8 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h @@ -5,7 +5,7 @@ The concept `SparseLinearAlgebraTraits_d` is used to solve sparse linear systems A\f$ \times \f$ X = B. \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_solver_traits} +\cgalHasModels{CGAL::Eigen_solver_traits} \cgalHasModelsEnd */ class SparseLinearAlgebraTraits_d @@ -65,7 +65,7 @@ by a sparse matrix. \cgalRefines{DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_vector} +\cgalHasModels{CGAL::Eigen_vector} \cgalHasModelsEnd \sa `SparseLinearAlgebraTraits_d` @@ -134,8 +134,8 @@ NT& operator[](Index row); \cgalRefines{Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_sparse_matrix} -\cgalModels{CGAL::Eigen_sparse_symmetric_matrix} +\cgalHasModels{CGAL::Eigen_sparse_matrix} +\cgalHasModels{CGAL::Eigen_sparse_symmetric_matrix} \cgalHasModelsEnd \sa `SparseLinearAlgebraTraits_d` diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h index c8792ccab3a..7c5f65cc824 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h @@ -9,7 +9,7 @@ method to solve the system for different right-hand vectors. \cgalRefines{SparseLinearAlgebraTraits_d} \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_solver_traits} +\cgalHasModels{CGAL::Eigen_solver_traits} \cgalHasModelsEnd */ class SparseLinearAlgebraWithFactorTraits_d { diff --git a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h index cd0ec9832ee..dfad56236b8 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h @@ -6,7 +6,7 @@ to solve in the least square sense a linear system with a singular value decomposition \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_svd} +\cgalHasModels{CGAL::Eigen_svd} \cgalHasModelsEnd */ class SvdTraits @@ -54,7 +54,7 @@ class SvdTraits Concept of vector type used by the concept `SvdTraits`. \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_vector} +\cgalHasModels{CGAL::Eigen_vector} \cgalHasModelsEnd */ class SvdTraits::Vector @@ -93,7 +93,7 @@ Concept of matrix type used by the concept `SvdTraits`. \cgalRefines{DefaultConstructible,Assignable} \cgalHasModelsBegin -\cgalModels{CGAL::Eigen_matrix} +\cgalHasModels{CGAL::Eigen_matrix} \cgalHasModelsEnd */ class SvdTraits::Matrix diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h index 6bf09d1211a..99569575b99 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h @@ -9,8 +9,8 @@ e.g., for a Euclidean distance the transformed distance is the squared Euclidean distance. \cgalHasModelsBegin -\cgalModels{CGAL::Manhattan_distance_iso_box_point} -\cgalModels{CGAL::Euclidean_distance_sphere_point} +\cgalHasModels{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 a12b6e2a244..658d58f77d2 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h @@ -9,8 +9,8 @@ E.g., for an Euclidean distance the transformed distance is the squared Euclidea \cgalRefines{GeneralDistance} \cgalHasModelsBegin -\cgalModels{CGAL::Euclidean_distance} -\cgalModels{CGAL::Weighted_Minkowski_distance} +\cgalHasModels{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 22a34f8c6de..d78a094006e 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h @@ -9,12 +9,12 @@ range search queries in a model of `SpatialTree`. \cgalRefines{SearchTraits} \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian_d} -\cgalModels{CGAL::Homogeneous_d} -\cgalModels{CGAL::Epick_d} -\cgalModels{CGAL::Epeck_d} -\cgalModels{CGAL::Search_traits_2} -\cgalModels{CGAL::Search_traits_3} +\cgalHasModels{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` diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h index 358c828ff6f..ec5dcdae42d 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h @@ -6,14 +6,14 @@ The concept `SearchTraits` defines the requirements for the template parameter of the search classes. \cgalHasModelsBegin -\cgalModels{CGAL::Cartesian_d} -\cgalModels{CGAL::Homogeneous_d} -\cgalModels{CGAL::Epick_d} -\cgalModels{CGAL::Epeck_d} -\cgalModels{CGAL::Search_traits_2} -\cgalModels{CGAL::Search_traits_3} -\cgalModels{CGAL::Search_traits_d} -\cgalModels{CGAL::Search_traits} +\cgalHasModels{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` diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h index 357dbbfff46..32855bdf044 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h @@ -12,7 +12,7 @@ other part of space is said to be on the positive side of the separator. \cgalHasModelsBegin -\cgalModels{CGAL::Plane_separator} +\cgalHasModels{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 aa483a29780..0f505a4864a 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h @@ -6,7 +6,7 @@ The concept `SpatialTree` defines the requirements for a tree supporting both neighbor searching and approximate range searching. \cgalHasModelsBegin -\cgalModels{CGAL::Kd_tree} +\cgalHasModels{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 6621186a2f7..d4fc0cf64d6 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h @@ -8,13 +8,13 @@ The concept `Splitter` defines the requirements for a function object class impl \cgalAdvancedEnd \cgalHasModelsBegin -\cgalModels{CGAL::Fair} -\cgalModels{CGAL::Median_of_rectangle} -\cgalModels{CGAL::Median_of_max_spread} -\cgalModels{CGAL::Midpoint_of_rectangle} -\cgalModels{CGAL::Midpoint_of_max_spread} -\cgalModels{CGAL::Sliding_fair} -\cgalModels{CGAL::Sliding_midpoint} +\cgalHasModels{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/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h index f5f7270e043..9d48912fb45 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 @@ -8,7 +8,7 @@ The concept `PolygonOffsetBuilderTraits_2` describes the requirements for the ge required by the algorithm class `CGAL::Polygon_offset_builder_2`. \cgalHasModelsBegin -\cgalModels{CGAL::Polygon_offset_builder_traits_2} +\cgalHasModels{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 5df86d3e2a6..0be531bf0bf 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 @@ -8,7 +8,7 @@ The concept `StraightSkeletonBuilderTraits_2` describes the requirements for the geometric traits class required by the algorithm class `CGAL::Straight_skeleton_builder_2`. \cgalHasModelsBegin -\cgalModels{CGAL::Straight_skeleton_builder_traits_2} +\cgalHasModels{CGAL::Straight_skeleton_builder_traits_2} \cgalHasModelsEnd */ class StraightSkeletonBuilderTraits_2 { 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 7937ab43535..f18d851ce8b 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 @@ -6,7 +6,7 @@ The concept `StraightSkeletonBuilder_2_Visitor` describes the requirements of th required by the algorithm class `CGAL::Straight_skeleton_builder_2` in its third template parameter. \cgalHasModelsBegin -\cgalModels{CGAL::Dummy_straight_skeleton_builder_2_visitor} +\cgalHasModels{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 af125ad42f5..2c476b2e20c 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 @@ -9,7 +9,7 @@ The concept `StraightSkeletonFace_2` describes the requirements for the face typ with support for storage of the incident halfedge. \cgalHasModelsBegin -\cgalModels{CGAL::Straight_skeleton_face_base_2} +\cgalHasModels{CGAL::Straight_skeleton_face_base_2} \cgalHasModelsEnd \sa `StraightSkeletonVertex_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 67f6dafc5c4..d047dc14b53 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 @@ -13,7 +13,7 @@ in the contour and skeleton vertices. However, for any halfedge, there is a 2D s given by its `source` and `target` vertices. \cgalHasModelsBegin -\cgalModels{CGAL::Straight_skeleton_halfedge_base_2} +\cgalHasModels{CGAL::Straight_skeleton_halfedge_base_2} \cgalHasModelsEnd \sa `StraightSkeleton_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 0bf7cab0c87..beb00c9b520 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 @@ -7,7 +7,7 @@ as the third template argument to the class `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 29f50118cb4..fac06961dec 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 @@ -10,7 +10,7 @@ with support for storage of the incident halfedge. The `StraightSkeletonVertex_2 requires the geometric embedding to be a 2D point. \cgalHasModelsBegin -\cgalModels{CGAL::Straight_skeleton_vertex_base_2} +\cgalHasModels{CGAL::Straight_skeleton_vertex_base_2} \cgalHasModelsEnd \sa `StraightSkeletonHalfedge_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 9df0937e9ff..3bcdaa2597d 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 @@ -10,7 +10,7 @@ used to represent a straight skeleton. It refines the concept `Vertex`, `Halfedge`, and `Face` of the halfedge data structure. \cgalHasModelsBegin -\cgalModels{CGAL::Straight_skeleton_2} +\cgalHasModels{CGAL::Straight_skeleton_2} \cgalHasModelsEnd \attention This concept explicitly protects all the modifying 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 9e23002f51d..a04c6c6e523 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 @@ -10,8 +10,8 @@ provides the operation that integrates a new point from a given point with a predefined step, and according to a specified vector. \cgalHasModelsBegin -\cgalModels{CGAL::Euler_integrator_2} -\cgalModels{CGAL::Runge_kutta_integrator_2} +\cgalHasModels{CGAL::Euler_integrator_2} +\cgalHasModels{CGAL::Runge_kutta_integrator_2} \cgalHasModelsEnd */ 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 b79ed1e740f..0cdfedfcb1c 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 @@ -10,8 +10,8 @@ provides the types of the geometric primitives used in the placement of streamlines and some functions for answering different queries. \cgalHasModelsBegin -\cgalModels{CGAL::Regular_grid_2} -\cgalModels{CGAL::Triangular_field_2} +\cgalHasModels{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 ea351a5d2ba..21326e8a37c 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 @@ -12,7 +12,7 @@ policy concept of geometric computations is used in \cgalRefines{SubdivisionMask_3} \cgalHasModelsBegin -\cgalModels{CGAL::DooSabin_mask_3} +\cgalHasModels{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 15a337e68c9..3397ef818fe 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 @@ -12,7 +12,7 @@ policy concept of geometric computations is used in \cgalRefines{SubdivisionMask_3} \cgalHasModelsBegin -\cgalModels{CGAL::CatmullClark_mask_3} +\cgalHasModels{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 190f970bd00..2e799fb5952 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 @@ -11,7 +11,7 @@ policy concept of geometric computations is used in \cgalRefines{SubdivisionMask_3} \cgalHasModelsBegin -\cgalModels{CGAL::Loop_mask_3} +\cgalHasModels{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 72823a073e1..2cd7648f637 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 @@ -10,7 +10,7 @@ policy concept of geometric computations is used in \cgalRefines{SubdivisionMask_3} \cgalHasModelsBegin -\cgalModels{CGAL::Sqrt3_mask_3} +\cgalHasModels{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 f6e59cdaf67..11f66968dae 100644 --- a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h +++ b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h @@ -7,8 +7,8 @@ computes the fitting error from a face to a proxy, and fits a proxy from a range of faces. \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_approximation::L21_metric_plane_proxy} -\cgalModels{CGAL::Surface_mesh_approximation::L2_metric_plane_proxy} +\cgalHasModels{CGAL::Surface_mesh_approximation::L21_metric_plane_proxy} +\cgalHasModels{CGAL::Surface_mesh_approximation::L2_metric_plane_proxy} \cgalHasModelsEnd */ 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 4332ebda74b..5a8a704883d 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 @@ -10,8 +10,8 @@ to implement models of this concept. \cgalRefines{DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Deformation_Eigen_closest_rotation_traits_3} -\cgalModels{CGAL::Deformation_Eigen_polar_closest_rotation_traits_3} +\cgalHasModels{CGAL::Deformation_Eigen_closest_rotation_traits_3} +\cgalHasModels{CGAL::Deformation_Eigen_polar_closest_rotation_traits_3} \cgalHasModelsEnd */ 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 35a8d8a2e1a..cf9b2957984 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 @@ -13,16 +13,16 @@ the border of a given mesh. Construction and destruction are undefined. \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3} -\cgalModels{CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3} +\cgalHasModels{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_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h index 9724634b10f..dd08086b4a5 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 @@ -9,7 +9,7 @@ predicates, and constructions required by the traits class parameter of \cgalRefines{CopyConstructible,Assignable} \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_shortest_path_traits} +\cgalHasModels{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 2bd7a6bd201..907b5db3dd0 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h @@ -13,9 +13,9 @@ or can be intentionally returned to prevent the edge from being collapsed. \cgalRefines{DefaultConstructible,CopyConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_simplification::Edge_length_cost} -\cgalModels{CGAL::Surface_mesh_simplification::LindstromTurk_cost} -\cgalModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies} +\cgalHasModels{CGAL::Surface_mesh_simplification::Edge_length_cost} +\cgalHasModels{CGAL::Surface_mesh_simplification::LindstromTurk_cost} +\cgalHasModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies} \cgalHasModelsEnd */ 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 cf87c5e2400..5fdf445d9be 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h @@ -15,11 +15,11 @@ or can be intentionally returned to prevent the edge from being collapsed. \cgalRefines{DefaultConstructible,CopyConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_simplification::Midpoint_placement} -\cgalModels{CGAL::Surface_mesh_simplification::LindstromTurk_placement} -\cgalModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies} -\cgalModels{CGAL::Surface_mesh_simplification::Bounded_normal_change_placement} -\cgalModels{CGAL::Surface_mesh_simplification::Constrained_placement} +\cgalHasModels{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 6f53b84171e..19332024102 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h @@ -15,8 +15,8 @@ be absent). The value `boost::none` indicates that the edge should not be collap \cgalRefines{DefaultConstructible,CopyConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_simplification::Bounded_normal_change_filter} -\cgalModels{CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter} +\cgalHasModels{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 9a51402119c..e09a0c1f03b 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h @@ -5,11 +5,11 @@ The concept `StopPredicate` describes the requirements for the predicate which indicates if the simplification process must finish. \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_simplification::Edge_count_stop_predicate} -\cgalModels{CGAL::Surface_mesh_simplification::Face_count_stop_predicate} -\cgalModels{CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate} -\cgalModels{CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate} -\cgalModels{CGAL::Surface_mesh_simplification::Edge_length_stop_predicate} +\cgalHasModels{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 */ diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h index 3dcc8a0dedf..fbf8c2662c7 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h @@ -38,8 +38,8 @@ triangulation. In the following we call surface center of a facet, the center of its biggest Delaunay surface ball. \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_cell_base_3} -\cgalModels{CGAL::Surface_mesh_default_triangulation_3::Cell} +\cgalHasModels{CGAL::Surface_mesh_cell_base_3} +\cgalHasModels{CGAL::Surface_mesh_default_triangulation_3::Cell} \cgalHasModelsEnd \sa `SurfaceMeshTriangulation_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 35b923bbb8b..185c14e9e9d 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h @@ -31,7 +31,7 @@ parameter in the function template `CGAL::make_surface_mesh()`. \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_complex_2_in_triangulation_3} +\cgalHasModels{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 0f3431af56c..ecc980a35cf 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h @@ -34,7 +34,7 @@ with lowest quality first. The qualities are computed by a function `is_bad(const Facet& f, const Quality& q)`. \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_default_criteria_3} +\cgalHasModels{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 672f7466948..412f6503b70 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h @@ -12,7 +12,7 @@ points if any exists. The concept `SurfaceMeshTraits_3` also includes a funcctor a small set of initial points on the surface. \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_traits_generator_3::type} +\cgalHasModels{CGAL::Surface_mesh_traits_generator_3::type} \cgalHasModelsEnd \sa `CGAL::make_surface_mesh()` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h index 32663ac10dd..1889afd3c84 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h @@ -32,8 +32,8 @@ complex facets incident to the vertex and the number of connected components of the adjacency graph of those facets. \cgalHasModelsBegin -\cgalModels{CGAL::Surface_mesh_vertex_base_3} -\cgalModels{CGAL::Surface_mesh_default_triangulation_3::Vertex} +\cgalHasModels{CGAL::Surface_mesh_vertex_base_3} +\cgalHasModels{CGAL::Surface_mesh_default_triangulation_3::Vertex} \cgalHasModelsEnd \sa `SurfaceMeshComplex_2InTriangulation_3` diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h index 4b4d11da894..04f2064c682 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h @@ -9,7 +9,7 @@ are required to be copy constructible and assignable. \cgalHasModelsBegin -\cgalModels{CGAL::Implicit_surface_3} +\cgalHasModels{CGAL::Implicit_surface_3} \cgalHasModelsEnd \sa `CGAL::make_surface_mesh()` diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h index e1dc359a13f..be2cbf0b6ce 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h @@ -49,7 +49,7 @@ actually uses as a base class for the class `CGAL::Triangulation_data_structure_2::Face`. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_face_base_2} +\cgalHasModels{CGAL::Triangulation_ds_face_base_2} \cgalHasModelsEnd \sa `TriangulationDSVertexBase_2` diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h index 994a0f82b9b..6c5cbe4c7e6 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h @@ -45,7 +45,7 @@ actually uses as a base class for the class of `CGAL::Triangulation_data_structure_2::Vertex`. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_vertex_base_2} +\cgalHasModels{CGAL::Triangulation_ds_vertex_base_2} \cgalHasModelsEnd \sa `TriangulationDSFaceBase_2` diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h index a0731074095..5b458bc3250 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h @@ -65,7 +65,7 @@ When dimension \f$ <\f$ 2, the same information is output for faces of maximal dimension instead of faces. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_data_structure_2} +\cgalHasModels{CGAL::Triangulation_data_structure_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_2::Face` @@ -729,7 +729,7 @@ call the `create_vertex()` and `delete_vertex()` methods of the triangulation data structure. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_vertex_base_2} +\cgalHasModels{CGAL::Triangulation_ds_vertex_base_2} \cgalHasModelsEnd \sa `TriangulationDSVertexBase_2` @@ -852,7 +852,7 @@ have to be used to define new faces and to delete no longer used faces. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_face_base_2} +\cgalHasModels{CGAL::Triangulation_ds_face_base_2} \cgalHasModelsEnd \sa `TriangulationDSFaceBase_2` diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h index 8f8ec146dbf..4b586536381 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h @@ -34,7 +34,7 @@ which are used as base classes for the final vertex and cell classes. More information can be found in Section \ref TDS3secdesign. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_cell_base_3} +\cgalHasModels{CGAL::Triangulation_ds_cell_base_3} \cgalHasModelsEnd \sa `TriangulationDSVertexBase_3` diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h index 0a9d10b04bf..3e3e58e37ea 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h @@ -29,7 +29,7 @@ are used as base classes for the final vertex and cell classes. More information can be found in Section \ref TDS3secdesign. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_vertex_base_3} +\cgalHasModels{CGAL::Triangulation_ds_vertex_base_3} \cgalHasModelsEnd \sa `TriangulationDSCellBase_3` diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h index c3a7ba38023..bdd21ca6d4b 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h @@ -66,7 +66,7 @@ list of cells. When dimension < 3, the same information is stored for faces of maximal dimension instead of cells. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_data_structure_3} +\cgalHasModels{CGAL::Triangulation_data_structure_3} \cgalHasModelsEnd \sa `TriangulationDataStructure_3::Vertex` diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h index 342e203e259..ca104a80988 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h @@ -7,7 +7,7 @@ Cell base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`. \cgalHasModelsBegin -\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3} +\cgalHasModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3} \cgalHasModelsEnd */ diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h index 2ce117b8ff3..484782a6547 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h @@ -7,7 +7,7 @@ Vertex base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`. \cgalHasModelsBegin -\cgalModels{Tetrahedral_remeshing::Remeshing_vertex_base_3} +\cgalHasModels{Tetrahedral_remeshing::Remeshing_vertex_base_3} \cgalHasModelsEnd */ diff --git a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h index 1dd4fa17d49..5432de4a1f2 100644 --- a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h @@ -10,8 +10,8 @@ a Delaunay triangulation. It corresponds to the first template parameter of the \cgalRefines{TriangulationTraits} \cgalHasModelsBegin -\cgalModels{CGAL::Epick_d} -\cgalModels{CGAL::Epeck_d} +\cgalHasModels{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 1afb3084639..8180b4f3007 100644 --- a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h @@ -10,8 +10,8 @@ a regular triangulation. It corresponds to the first template parameter of the c \cgalRefines{TriangulationTraits} \cgalHasModelsBegin -\cgalModels{CGAL::Epick_d} -\cgalModels{CGAL::Epeck_d} +\cgalHasModels{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 b72f4ee1fd0..3a582c7ba0f 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h @@ -16,7 +16,7 @@ The dimension of a face is implicitly set when first two vertices (`i = 0` and `i = 1`), then the dimension is 1. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_face} +\cgalHasModels{CGAL::Triangulation_face} \cgalHasModelsEnd \sa `TriangulationDSFullCell` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h index 231e29f5a08..df9d474ea4b 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h @@ -37,8 +37,8 @@ of `CGAL::Triangulation_data_structure::Vertex`. \cgalRefines{TriangulationDataStructure::FullCell} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_full_cell} -\cgalModels{CGAL::Triangulation_full_cell} +\cgalHasModels{CGAL::Triangulation_ds_full_cell} +\cgalHasModels{CGAL::Triangulation_full_cell} \cgalHasModelsEnd \sa `TriangulationDSVertex` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h index 51fb7cad627..f9be6db6366 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h @@ -37,8 +37,8 @@ of `CGAL::Triangulation_data_structure::Vertex`. \cgalRefines{TriangulationDataStructure::Vertex} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_vertex} -\cgalModels{CGAL::Triangulation_vertex} +\cgalHasModels{CGAL::Triangulation_ds_vertex} +\cgalHasModels{CGAL::Triangulation_vertex} \cgalHasModelsEnd \sa `TriangulationDSFullCell` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h index a8da6d39849..6ab5522df50 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h @@ -70,7 +70,7 @@ The classes `Vertex` and (possibly empty). \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_data_structure} +\cgalHasModels{CGAL::Triangulation_data_structure} \cgalHasModelsEnd \sa `TriangulationDataStructure::Vertex` @@ -663,8 +663,8 @@ 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. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_vertex} -\cgalModels{CGAL::Triangulation_vertex} +\cgalHasModels{CGAL::Triangulation_ds_vertex} +\cgalHasModels{CGAL::Triangulation_vertex} \cgalHasModelsEnd \sa `TriangulationDataStructure::FullCell` @@ -772,8 +772,8 @@ are said to be adjacent when they share a facet. Adjacent full cells are called hereafter neighbors. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_ds_full_cell} -\cgalModels{CGAL::Triangulation_full_cell} +\cgalHasModels{CGAL::Triangulation_ds_full_cell} +\cgalHasModels{CGAL::Triangulation_full_cell} \cgalHasModelsEnd \sa `TriangulationDataStructure::FullCell` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h index 95cac2eab13..ff141326deb 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h @@ -11,7 +11,7 @@ represent a full cell. additional specific requirements of `TriangulationFullCell`} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_full_cell} +\cgalHasModels{CGAL::Triangulation_full_cell} \cgalHasModelsEnd \sa `CGAL::Triangulation_full_cell` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h index 198e3a73650..660b270a101 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h @@ -15,8 +15,8 @@ then optimized using spatial sorting. This is not required if the points are inserted one by one. \cgalHasModelsBegin -\cgalModels{CGAL::Epick_d} -\cgalModels{CGAL::Epeck_d} +\cgalHasModels{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 457339f28b0..9648500277a 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h @@ -13,7 +13,7 @@ Compared to ::TriangulationDSVertex, the main difference is the addition of an association of the vertex with a geometric point. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_vertex} +\cgalHasModels{CGAL::Triangulation_vertex} \cgalHasModelsEnd \cgalHeading{Input/Output} diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h index 73951fc22c1..50e30987b42 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h @@ -20,7 +20,7 @@ constraints. Defines the same types as the `TriangulationFaceBase_2` concept \cgalHasModelsBegin -\cgalModels{CGAL::Constrained_triangulation_face_base_2} +\cgalHasModels{CGAL::Constrained_triangulation_face_base_2} \cgalHasModelsEnd \sa `TriangulationFaceBase_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h index 4ec20557747..7602ca70584 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h @@ -35,7 +35,7 @@ in the face a list to store hidden vertices. \cgalRefines{TriangulationFaceBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Regular_triangulation_face_base_2} +\cgalHasModels{CGAL::Regular_triangulation_face_base_2} \cgalHasModelsEnd \sa `TriangulationFaceBase_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h index feee66c0b11..5cbfa1b9442 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h @@ -36,7 +36,7 @@ vertex of the triangulation or a hidden vertex. \cgalRefines{TriangulationVertexBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Regular_triangulation_vertex_base_2} +\cgalHasModels{CGAL::Regular_triangulation_vertex_base_2} \cgalHasModelsEnd \sa `TriangulationVertexBase_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h index 9a364975955..e83d910e4a4 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h @@ -17,7 +17,7 @@ and only provided for symmetry with the vertex case. \cgalRefines{TriangulationDSFaceBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_face_base_2} +\cgalHasModels{CGAL::Triangulation_face_base_2} \cgalHasModelsEnd \sa `TriangulationVertexBase_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h index 83e3992d81c..416da371080 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h @@ -15,7 +15,7 @@ next and previous level triangulations. \cgalRefines{TriangulationVertexBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_hierarchy_vertex_base_2} +\cgalHasModels{CGAL::Triangulation_hierarchy_vertex_base_2} \cgalHasModelsEnd \sa `CGAL::Triangulation_hierarchy_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h index 8cca35af421..63ffeab1a29 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h @@ -9,7 +9,7 @@ and provides an additional information storage. \cgalRefines{TriangulationVertexBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_vertex_base_with_info_2} +\cgalHasModels{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 9790b02cecc..94e5c7da0a0 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h @@ -16,7 +16,7 @@ the vertex base of a triangulation stores a point. \cgalRefines{TriangulationDSVertexBase_2} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_vertex_base_2} +\cgalHasModels{CGAL::Triangulation_vertex_base_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_2` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h index b71b96cc439..fdb8b9ee870 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h @@ -12,8 +12,8 @@ in the cell an operator that computes its circumcenter. \cgalRefines{TriangulationCellBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Delaunay_triangulation_cell_base_3} -\cgalModels{CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3} +\cgalHasModels{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 3493e4ef1fa..3a7514fab6a 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h @@ -11,13 +11,13 @@ predicates and constructions on these objects. \cgalRefines{TriangulationTraits_3} \cgalHasModelsBegin -\cgalModels{CGAL::Exact_predicates_inexact_constructions_kernel (recommended)} -\cgalModels{CGAL::Exact_predicates_exact_constructions_kernel (recommended for Voronoi)} -\cgalModels{CGAL::Filtered_kernel} -\cgalModels{CGAL::Cartesian} -\cgalModels{CGAL::Simple_cartesian} -\cgalModels{CGAL::Homogeneous} -\cgalModels{CGAL::Simple_homogeneous} +\cgalHasModels{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 diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h index cd00268b2b9..6851d616de3 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h @@ -20,7 +20,7 @@ circumcenter by calling `invalidate_weighted_circumcenter_cache()`. \cgalRefines{RegularTriangulationCellBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3} +\cgalHasModels{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 b95816da296..ffafd4be04e 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h @@ -36,7 +36,7 @@ and an operator to compute its weighted circumcenter. \cgalRefines{TriangulationCellBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Regular_triangulation_cell_base_3} +\cgalHasModels{CGAL::Regular_triangulation_cell_base_3} \cgalHasModelsEnd \sa `RegularTriangulationTraits_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h index 09d9ce0a0fc..3e5f0e3ba47 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h @@ -10,7 +10,7 @@ by adding a geometric point member. \cgalRefines{TriangulationDSVertexBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Regular_triangulation_vertex_base_3} +\cgalHasModels{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 84add9f98c9..e7d5d046a08 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h @@ -9,7 +9,7 @@ and provides an additional information storage. \cgalRefines{TriangulationCellBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_cell_base_with_info_3} +\cgalHasModels{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 8b26efc32c4..f405c54afba 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h @@ -11,8 +11,8 @@ structure apply. \cgalRefines{TriangulationDSCellBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_cell_base_3} -\cgalModels{CGAL::Triangulation_cell_base_with_info_3} +\cgalHasModels{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/TriangulationVertexBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h index 37e2fd97140..06b02f5c227 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h @@ -9,7 +9,7 @@ and provides an additional information storage. \cgalRefines{TriangulationVertexBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_vertex_base_with_info_3} +\cgalHasModels{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 5110b87d71f..45955a3a8f0 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h @@ -10,8 +10,8 @@ for the triangulation data structure. \cgalRefines{TriangulationDSVertexBase_3} \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_vertex_base_3} -\cgalModels{CGAL::Triangulation_vertex_base_with_info_3} +\cgalHasModels{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 df1da8edad5..6c4dcec4016 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 @@ -12,8 +12,8 @@ To the requirements listed within the concept `TriangulationOnSphereTraits_2`, this concept adds types and functors requirements related to build the dual on the sphere. \cgalHasModelsBegin -\cgalModels{CGAL::Delaunay_triangulation_on_sphere_traits_2} -\cgalModels{CGAL::Projection_on_sphere_traits_3} +\cgalHasModels{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 5e49109a4da..b87fe2a5deb 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 @@ -20,7 +20,7 @@ In this case, fictitious faces are added to the triangulation, called ghost f such that the triangulation is a topological sphere. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_on_sphere_face_base_2} +\cgalHasModels{CGAL::Triangulation_on_sphere_face_base_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_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 ea94dfc395c..4ccc0171175 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 @@ -14,8 +14,8 @@ In particular, the traits class is expected to contain information about the sph on which the points of the triangulation lie, as well as to provide means to change this information. \cgalHasModelsBegin -\cgalModels{CGAL::Delaunay_triangulation_on_sphere_traits_2} -\cgalModels{CGAL::Projection_on_sphere_traits_3} +\cgalHasModels{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 23f0fbce9e0..721c593a940 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 @@ -10,7 +10,7 @@ It refines the concept `TriangulationDSVertexBase_2`, adding geometric informati the vertex base of a triangulation stores a point. \cgalHasModelsBegin -\cgalModels{CGAL::Triangulation_on_sphere_vertex_base_2} +\cgalHasModels{CGAL::Triangulation_on_sphere_vertex_base_2} \cgalHasModelsEnd \sa `TriangulationDataStructure_2` diff --git a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h index a39c04b2179..0ec12be0297 100644 --- a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h +++ b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h @@ -7,9 +7,9 @@ A model of the `Visibility_2` concept can be attached to an `Arrangement_2` inst answer visibility queries within the faces of this arrangement. \cgalHasModelsBegin -\cgalModels{CGAL::Simple_polygon_visibility_2} -\cgalModels{CGAL::Rotational_sweep_visibility_2} -\cgalModels{CGAL::Triangular_expansion_visibility_2} +\cgalHasModels{CGAL::Simple_polygon_visibility_2} +\cgalHasModels{CGAL::Rotational_sweep_visibility_2} +\cgalHasModels{CGAL::Triangular_expansion_visibility_2} \cgalHasModelsEnd */ 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 bec40a64a9f..22bf669821e 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 @@ -14,15 +14,15 @@ graph they take as an argument, the last ones does. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Identity_policy_2} -\cgalModels{CGAL::Apollonius_graph_degeneracy_removal_policy_2} -\cgalModels{CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2} -\cgalModels{CGAL::Delaunay_triangulation_degeneracy_removal_policy_2} -\cgalModels{CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2} -\cgalModels{CGAL::Regular_triangulation_degeneracy_removal_policy_2} -\cgalModels{CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2} -\cgalModels{CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2} -\cgalModels{CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2} +\cgalHasModels{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` 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 452c25d3e02..56bc3b66ed6 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 @@ -12,10 +12,10 @@ tag is provided for determining whether this functor is defined or not. \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModelsBegin -\cgalModels{CGAL::Apollonius_graph_adaptation_traits_2} -\cgalModels{CGAL::Delaunay_triangulation_adaptation_traits_2} -\cgalModels{CGAL::Regular_triangulation_adaptation_traits_2} -\cgalModels{CGAL::Segment_Delaunay_graph_adaptation_traits_2} +\cgalHasModels{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` diff --git a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h index 76104f35929..0a59f4ae4e1 100644 --- a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h +++ b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h @@ -6,9 +6,9 @@ A concept that describes the set of methods required in all classes used in the computation of 2D generalized barycentric weights. \cgalHasModelsBegin -\cgalModels{CGAL::Weights::Wachspress_weights_2} -\cgalModels{CGAL::Weights::Mean_value_weights_2} -\cgalModels{CGAL::Weights::Discrete_harmonic_weights_2} +\cgalHasModels{CGAL::Weights::Wachspress_weights_2} +\cgalHasModels{CGAL::Weights::Mean_value_weights_2} +\cgalHasModels{CGAL::Weights::Discrete_harmonic_weights_2} \cgalHasModelsEnd */ class BarycentricWeights_2 {