From 2d60f4698506bd19995d24a0a626505f9c809a41 Mon Sep 17 00:00:00 2001 From: albert-github Date: Tue, 14 Mar 2023 17:37:50 +0100 Subject: [PATCH] issue #7231 Improvement of layout of refines relations. - Adjusted cgalRefines according to reviews - Implemented it in all files --- .../doc/AABB_tree/Concepts/AABBGeomTraits.h | 2 +- .../Concepts/AABBRayIntersectionGeomTraits.h | 2 +- AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h | 2 +- ...ancingFrontSurfaceReconstructionTraits_3.h | 2 +- .../Concepts/AlgebraicStructureTraits--Div.h | 4 +- .../AlgebraicStructureTraits--DivMod.h | 2 +- .../AlgebraicStructureTraits--Divides.h | 2 +- .../Concepts/AlgebraicStructureTraits--Gcd.h | 2 +- ...gebraicStructureTraits--IntegralDivision.h | 2 +- .../AlgebraicStructureTraits--Inverse.h | 2 +- .../AlgebraicStructureTraits--IsOne.h | 2 +- .../AlgebraicStructureTraits--IsSquare.h | 2 +- .../AlgebraicStructureTraits--IsZero.h | 2 +- .../AlgebraicStructureTraits--KthRoot.h | 2 +- .../Concepts/AlgebraicStructureTraits--Mod.h | 2 +- .../AlgebraicStructureTraits--RootOf.h | 2 +- .../AlgebraicStructureTraits--Simplify.h | 2 +- .../Concepts/AlgebraicStructureTraits--Sqrt.h | 2 +- .../AlgebraicStructureTraits--Square.h | 2 +- .../AlgebraicStructureTraits--UnitPart.h | 2 +- .../Concepts/EuclideanRing.h | 2 +- .../Algebraic_foundations/Concepts/Field.h | 2 +- .../Concepts/FieldNumberType.h | 3 +- .../Concepts/FieldWithKthRoot.h | 2 +- .../Concepts/FieldWithRootOf.h | 2 +- .../Concepts/FieldWithSqrt.h | 2 +- .../Concepts/FractionTraits.h | 4 +- .../Concepts/ImplicitInteroperable.h | 2 +- .../Concepts/IntegralDomain.h | 2 +- .../Concepts/IntegralDomainWithoutDivision.h | 6 +- .../Concepts/RealEmbeddable.h | 3 +- .../Concepts/RealEmbeddableTraits--Abs.h | 2 +- .../Concepts/RealEmbeddableTraits--Compare.h | 2 +- .../RealEmbeddableTraits--IsNegative.h | 2 +- .../RealEmbeddableTraits--IsPositive.h | 2 +- .../Concepts/RealEmbeddableTraits--IsZero.h | 2 +- .../Concepts/RealEmbeddableTraits--Sgn.h | 2 +- .../Concepts/RealEmbeddableTraits--ToDouble.h | 2 +- .../RealEmbeddableTraits--ToInterval.h | 2 +- .../Concepts/RingNumberType.h | 3 +- .../Concepts/UniqueFactorizationDomain.h | 2 +- ...gebraicKernel_d_1--ApproximateAbsolute_1.h | 2 +- ...gebraicKernel_d_1--ApproximateRelative_1.h | 2 +- .../AlgebraicKernel_d_1--BoundBetween_1.h | 2 +- .../Concepts/AlgebraicKernel_d_1--Compare_1.h | 2 +- ...AlgebraicKernel_d_1--ComputePolynomial_1.h | 2 +- ...raicKernel_d_1--ConstructAlgebraicReal_1.h | 2 +- .../AlgebraicKernel_d_1--IsCoprime_1.h | 2 +- .../AlgebraicKernel_d_1--IsSquareFree_1.h | 2 +- .../AlgebraicKernel_d_1--IsZeroAt_1.h | 2 +- .../Concepts/AlgebraicKernel_d_1--Isolate_1.h | 2 +- .../AlgebraicKernel_d_1--MakeCoprime_1.h | 2 +- .../AlgebraicKernel_d_1--MakeSquareFree_1.h | 2 +- ...AlgebraicKernel_d_1--NumberOfSolutions_1.h | 2 +- .../Concepts/AlgebraicKernel_d_1--SignAt_1.h | 2 +- .../Concepts/AlgebraicKernel_d_1--Solve_1.h | 3 +- ...gebraicKernel_d_1--SquareFreeFactorize_1.h | 3 +- .../Concepts/AlgebraicKernel_d_1.h | 3 +- ...ebraicKernel_d_2--ApproximateAbsoluteX_2.h | 2 +- ...ebraicKernel_d_2--ApproximateAbsoluteY_2.h | 2 +- ...ebraicKernel_d_2--ApproximateRelativeX_2.h | 2 +- ...ebraicKernel_d_2--ApproximateRelativeY_2.h | 2 +- .../AlgebraicKernel_d_2--BoundBetweenX_2.h | 2 +- .../AlgebraicKernel_d_2--BoundBetweenY_2.h | 2 +- .../AlgebraicKernel_d_2--CompareXY_2.h | 2 +- .../AlgebraicKernel_d_2--CompareX_2.h | 2 +- .../AlgebraicKernel_d_2--CompareY_2.h | 2 +- ...lgebraicKernel_d_2--ComputePolynomialX_2.h | 2 +- ...lgebraicKernel_d_2--ComputePolynomialY_2.h | 2 +- .../AlgebraicKernel_d_2--ComputeX_2.h | 2 +- .../AlgebraicKernel_d_2--ComputeY_2.h | 2 +- ...raicKernel_d_2--ConstructAlgebraicReal_2.h | 2 +- .../AlgebraicKernel_d_2--IsCoprime_2.h | 2 +- .../AlgebraicKernel_d_2--IsSquareFree_2.h | 2 +- .../AlgebraicKernel_d_2--IsZeroAt_2.h | 2 +- .../AlgebraicKernel_d_2--IsolateX_2.h | 2 +- .../AlgebraicKernel_d_2--IsolateY_2.h | 2 +- .../Concepts/AlgebraicKernel_d_2--Isolate_2.h | 2 +- .../AlgebraicKernel_d_2--MakeCoprime_2.h | 2 +- .../AlgebraicKernel_d_2--MakeSquareFree_2.h | 2 +- ...AlgebraicKernel_d_2--NumberOfSolutions_2.h | 2 +- .../Concepts/AlgebraicKernel_d_2--SignAt_2.h | 2 +- .../Concepts/AlgebraicKernel_d_2--Solve_2.h | 3 +- ...gebraicKernel_d_2--SquareFreeFactorize_2.h | 3 +- .../Concepts/AlgebraicKernel_d_2.h | 4 +- .../Concepts/AlphaShapeFace_2.h | 6 +- .../Concepts/AlphaShapeTraits_2.h | 4 +- .../Concepts/AlphaShapeVertex_2.h | 6 +- .../Concepts/WeightedAlphaShapeTraits_2.h | 2 +- .../Concepts/AlphaShapeCell_3.h | 6 +- .../Concepts/AlphaShapeTraits_3.h | 4 +- .../Concepts/AlphaShapeVertex_3.h | 6 +- .../Concepts/FixedAlphaShapeCell_3.h | 6 +- .../Concepts/FixedAlphaShapeTraits_3.h | 4 +- .../Concepts/FixedAlphaShapeVertex_3.h | 6 +- .../FixedWeightedAlphaShapeTraits_3.h | 4 +- .../Concepts/WeightedAlphaShapeTraits_3.h | 4 +- .../Concepts/ApolloniusGraphDataStructure_2.h | 2 +- .../ApolloniusGraphHierarchyVertexBase_2.h | 2 +- .../Concepts/ApolloniusGraphTraits_2.h | 2 +- .../Concepts/ApolloniusGraphVertexBase_2.h | 2 +- .../Concepts/ArrTraits--Approximate_2.h | 2 +- .../Concepts/ArrTraits--AreMergeable_2.h | 2 +- .../ArrTraits--CompareXNearBoundary_2.h | 2 +- ...rrTraits--CompareXOnBoundaryOfCurveEnd_2.h | 2 +- .../ArrTraits--CompareXOnBoundary_2.h | 2 +- .../Concepts/ArrTraits--CompareX_2.h | 2 +- .../Concepts/ArrTraits--CompareXy_2.h | 2 +- .../Concepts/ArrTraits--CompareYAtXLeft_2.h | 2 +- .../Concepts/ArrTraits--CompareYAtXRight_2.h | 2 +- .../Concepts/ArrTraits--CompareYAtX_2.h | 2 +- .../ArrTraits--CompareYNearBoundary_2.h | 2 +- .../ArrTraits--CompareYOnBoundary_2.h | 2 +- .../Concepts/ArrTraits--ConstructCurve_2.h | 2 +- .../ArrTraits--ConstructMaxVertex_2.h | 2 +- .../ArrTraits--ConstructMinVertex_2.h | 2 +- .../ArrTraits--ConstructXMonotoneCurve_2.h | 2 +- .../Concepts/ArrTraits--Curve_2.h | 4 +- .../Concepts/ArrTraits--Equal_2.h | 2 +- .../Concepts/ArrTraits--Intersect_2.h | 2 +- .../ArrTraits--IsOnXIdentification_2.h | 2 +- .../ArrTraits--IsOnYIdentification_2.h | 2 +- .../Concepts/ArrTraits--IsVertical_2.h | 2 +- .../Concepts/ArrTraits--MakeXMonotone_2.h | 2 +- .../Concepts/ArrTraits--Merge_2.h | 2 +- .../Concepts/ArrTraits--ParameterSpaceInX_2.h | 2 +- .../Concepts/ArrTraits--ParameterSpaceInY_2.h | 2 +- .../Concepts/ArrTraits--Point_2.h | 4 +- .../Concepts/ArrTraits--Split_2.h | 2 +- .../Concepts/ArrTraits--XMonotoneCurve_2.h | 4 +- .../Concepts/ArrangementApproximateTraits_2.h | 2 +- .../Concepts/ArrangementBasicTraits_2.h | 4 +- .../Concepts/ArrangementBottomSideTraits_2.h | 2 +- .../ArrangementClosedBottomTraits_2.h | 2 +- .../Concepts/ArrangementClosedLeftTraits_2.h | 2 +- .../Concepts/ArrangementClosedRightTraits_2.h | 2 +- .../Concepts/ArrangementClosedTopTraits_2.h | 2 +- .../ArrangementConstructCurveTraits_2.h | 2 +- ...rangementConstructXMonotoneCurveTraits_2.h | 2 +- .../ArrangementContractedBottomTraits_2.h | 2 +- .../ArrangementContractedLeftTraits_2.h | 2 +- .../ArrangementContractedRightTraits_2.h | 2 +- .../ArrangementContractedTopTraits_2.h | 2 +- .../Concepts/ArrangementDcelWithRebind.h | 2 +- .../ArrangementHorizontalSideTraits_2.h | 2 +- .../ArrangementIdentifiedHorizontalTraits_2.h | 2 +- .../ArrangementIdentifiedVerticalTraits_2.h | 2 +- .../Concepts/ArrangementLandmarkTraits_2.h | 3 +- .../Concepts/ArrangementLeftSideTraits_2.h | 2 +- .../Concepts/ArrangementOpenBottomTraits_2.h | 2 +- .../ArrangementOpenBoundaryTraits_2.h | 2 +- .../Concepts/ArrangementOpenLeftTraits_2.h | 2 +- .../Concepts/ArrangementOpenRightTraits_2.h | 2 +- .../Concepts/ArrangementOpenTopTraits_2.h | 2 +- .../Concepts/ArrangementRightSideTraits_2.h | 2 +- .../ArrangementSphericalBoundaryTraits_2.h | 7 +- .../Concepts/ArrangementTopSideTraits_2.h | 2 +- .../Concepts/ArrangementTraits_2.h | 2 +- .../ArrangementVerticalSideTraits_2.h | 2 +- .../ArrangementWithHistoryInputFormatter.h | 2 +- .../ArrangementWithHistoryOutputFormatter.h | 2 +- .../Concepts/ArrangementXMonotoneTraits_2.h | 2 +- BGL/doc/BGL/Concepts/EdgeListGraph.h | 2 +- BGL/doc/BGL/Concepts/FaceGraph.h | 2 +- BGL/doc/BGL/Concepts/FaceListGraph.h | 2 +- BGL/doc/BGL/Concepts/HalfedgeGraph.h | 3 +- BGL/doc/BGL/Concepts/HalfedgeListGraph.h | 2 +- BGL/doc/BGL/Concepts/MutableFaceGraph.h | 3 +- BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h | 2 +- BGL/doc/BGL/Concepts/VertexListGraph.h | 2 +- .../ArrDirectionalTraits--AreMergeable_2.h | 4 +- ...rDirectionalTraits--CompareEndpointsXy_2.h | 2 +- ...rrDirectionalTraits--ConstructOpposite_2.h | 2 +- .../ArrDirectionalTraits--Intersect_2.h | 2 +- .../Concepts/ArrDirectionalTraits--Merge_2.h | 2 +- .../Concepts/ArrDirectionalTraits--Split_2.h | 4 +- .../ArrangementDirectionalXMonotoneTraits_2.h | 2 +- .../Concepts/GeneralPolygonSetDcel.h | 2 +- .../Concepts/GeneralPolygonSetDcelFace.h | 2 +- .../Concepts/GeneralPolygonSetDcelHalfedge.h | 2 +- .../Concepts/GeneralPolygonSetTraits_2.h | 2 +- .../Concepts/GeneralPolygon_2.h | 2 +- .../GpsTraitsGeneralPolygonWithHoles_2.h | 4 +- .../Concepts/GpsTraitsGeneralPolygon_2.h | 4 +- .../ApproximateMinEllipsoid_d_Traits_d.h | 4 +- .../Concepts/BoxIntersectionBox_d.h | 2 +- .../Concepts/BoxIntersectionTraits_d.h | 3 +- ...rnelForCircles--PolynomialForCircles_2_2.h | 4 +- ...lgebraicKernelForCircles--Polynomial_1_2.h | 4 +- .../Concepts/CircularKernel--BoundedSide_2.h | 2 +- .../CircularKernel--CircularArcPoint_2.h | 4 +- .../Concepts/CircularKernel--CircularArc_2.h | 4 +- .../Concepts/CircularKernel--CompareXY_2.h | 2 +- .../Concepts/CircularKernel--CompareX_2.h | 2 +- .../Concepts/CircularKernel--CompareY_2.h | 2 +- .../CircularKernel--ConstructBbox_2.h | 2 +- .../CircularKernel--ConstructCircle_2.h | 2 +- .../CircularKernel--ConstructLine_2.h | 2 +- .../Concepts/CircularKernel--DoIntersect_2.h | 2 +- .../Concepts/CircularKernel--Equal_2.h | 2 +- .../CircularKernel--HasOnBoundedSide_2.h | 2 +- .../CircularKernel--HasOnUnboundedSide_2.h | 2 +- .../Concepts/CircularKernel--HasOn_2.h | 2 +- .../Concepts/CircularKernel--Intersect_2.h | 2 +- .../Concepts/CircularKernel--IsVertical_2.h | 2 +- .../Concepts/CircularKernel--LineArc_2.h | 4 +- .../Concepts/CircularKernel.h | 2 +- ...rnelForSpheres--PolynomialForSpheres_2_3.h | 4 +- ...lgebraicKernelForSpheres--Polynomial_1_3.h | 4 +- ...ernelForSpheres--PolynomialsForCircles_3.h | 4 +- ...cKernelForSpheres--PolynomialsForLines_3.h | 4 +- .../Concepts/SphericalKernel--BoundedSide_3.h | 2 +- .../SphericalKernel--CircularArcPoint_3.h | 4 +- .../Concepts/SphericalKernel--CircularArc_3.h | 4 +- .../Concepts/SphericalKernel--CompareXYZ_3.h | 2 +- .../Concepts/SphericalKernel--CompareXY_3.h | 2 +- .../Concepts/SphericalKernel--CompareX_3.h | 2 +- .../Concepts/SphericalKernel--CompareY_3.h | 2 +- .../Concepts/SphericalKernel--CompareZ_3.h | 2 +- ...ernel--ComputeApproximateSquaredLength_3.h | 2 +- .../SphericalKernel--ConstructBbox_3.h | 2 +- .../SphericalKernel--ConstructLine_3.h | 2 +- .../SphericalKernel--ConstructPlane_3.h | 2 +- .../SphericalKernel--ConstructSphere_3.h | 2 +- .../Concepts/SphericalKernel--DoIntersect_3.h | 2 +- .../Concepts/SphericalKernel--Equal_3.h | 2 +- .../SphericalKernel--HasOnBoundedSide_3.h | 2 +- .../SphericalKernel--HasOnUnboundedSide_3.h | 2 +- .../Concepts/SphericalKernel--HasOn_3.h | 2 +- .../Concepts/SphericalKernel--Intersect_3.h | 2 +- .../Concepts/SphericalKernel--LineArc_3.h | 4 +- .../Concepts/SphericalKernel.h | 2 +- .../doc/Circulator/Concepts/ConstHandle.h | 2 +- .../doc/Circulator/Concepts/ConstRange.h | 2 +- Circulator/doc/Circulator/Concepts/Handle.h | 2 +- Circulator/doc/Circulator/Concepts/Range.h | 3 +- .../Concepts/CombinatorialMap.h | 2 +- .../Combinatorial_map/Concepts/GenericMap.h | 2 +- Documentation/doc/Documentation/General.txt | 6 +- .../doc/resources/1.8.13/BaseDoxyfile.in | 11 +- .../doc/resources/1.8.4/BaseDoxyfile.in | 12 ++- .../doc/resources/1.9.3/BaseDoxyfile.in | 11 +- .../Envelope_3/Concepts/EnvelopeTraits_3.h | 2 +- .../Generalized_map/Concepts/GeneralizedMap.h | 2 +- .../doc/HalfedgeDS/Concepts/HalfedgeDSFace.h | 3 +- .../HalfedgeDS/Concepts/HalfedgeDSVertex.h | 3 +- .../HyperbolicDelaunayTriangulationTraits_2.h | 2 +- .../HyperbolicTriangulationFaceBase_2.h | 2 +- .../doc/Kernel_23/Concepts/GeomObjects.h | 100 +++++------------- .../Kernel--CartesianConstIterator_d.h | 4 +- ...ernel--ConstructCartesianConstIterator_d.h | 2 +- .../Concepts/Kernel--Construct_max_vertex_d.h | 2 +- .../Concepts/Kernel--Construct_min_vertex_d.h | 2 +- .../Kernel_d/Concepts/KernelWithLifting_d.h | 2 +- .../Concepts/CellAttributeWithPoint.h | 2 +- .../Concepts/LinearCellComplex.h | 2 +- .../Concepts/LinearCellComplexItems.h | 2 +- .../ConformingDelaunayTriangulationTraits_2.h | 2 +- .../Mesh_2/Concepts/DelaunayMeshFaceBase_2.h | 2 +- .../Mesh_2/Concepts/DelaunayMeshTraits_2.h | 2 +- .../Concepts/DelaunayMeshVertexBase_2.h | 2 +- Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h | 4 +- .../Concepts/MeshCriteriaWithFeatures_3.h | 2 +- .../Concepts/MeshDomainWithFeatures_3.h | 2 +- .../Concepts/MeshTriangulationTraits_3.h | 2 +- Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h | 4 +- .../PolygonWithHolesConvexDecomposition_2.h | 2 +- .../Concepts/ModularTraits--ModularImage.h | 2 +- ...odularTraits--ModularImageRepresentative.h | 2 +- .../doc/Number_types/Concepts/RootOf_2.h | 7 +- .../Concepts/OrientedBoundingBoxTraits.h | 2 +- ...imalTransportationReconstructionTraits_2.h | 2 +- .../Concepts/OptimalConvexPartitionTraits_2.h | 2 +- .../Periodic_2DelaunayTriangulationTraits_2.h | 2 +- .../Periodic_2TriangulationFaceBase_2.h | 2 +- .../Periodic_2TriangulationTraits_2.h | 2 +- .../Periodic_2TriangulationVertexBase_2.h | 2 +- .../Periodic_3MeshDomainWithFeatures_3.h | 2 +- .../Concepts/Periodic_3MeshDomain_3.h | 2 +- .../Periodic_3DelaunayTriangulationTraits_3.h | 3 +- ...riodic_3RegularTriangulationDSCellBase_3.h | 3 +- ...odic_3RegularTriangulationDSVertexBase_3.h | 3 +- .../Periodic_3RegularTriangulationTraits_3.h | 3 +- .../Periodic_3TriangulationDSCellBase_3.h | 2 +- .../Periodic_3TriangulationDSVertexBase_3.h | 2 +- .../Periodic_3TriangulationTraits_3.h | 2 +- ...4HyperbolicDelaunayTriangulationTraits_2.h | 2 +- ...iodic_4HyperbolicTriangulationFaceBase_2.h | 2 +- ...eriodic_4HyperbolicTriangulationTraits_2.h | 2 +- ...dic_4HyperbolicTriangulationVertexBase_2.h | 2 +- .../Concepts/GeneralPolygonWithHoles_2.h | 4 +- .../doc/Polygon/Concepts/PolygonTraits_2.h | 2 +- .../Concepts/PMPCorefinementVisitor.h | 2 +- .../Concepts/PMPDistanceTraits.h | 3 +- .../Concepts/PMPHolefillingVisitor.h | 2 +- .../PMPPolygonSoupOrientationVisitor.h | 2 +- .../Concepts/PMPTriangulateFaceVisitor.h | 2 +- .../Polyhedron/Concepts/PolyhedronItems_3.h | 6 +- .../Polyhedron/Concepts/PolyhedronTraits_3.h | 3 +- .../PolylineSimplificationCostFunction.h | 3 +- .../PolylineSimplificationVertexBase_2.h | 2 +- .../PolynomialTraits_d--Canonicalize.h | 4 +- .../Concepts/PolynomialTraits_d--Compare.h | 4 +- ...--ConstructCoefficientConstIteratorRange.h | 4 +- ...ctInnermostCoefficientConstIteratorRange.h | 4 +- .../PolynomialTraits_d--ConstructPolynomial.h | 4 +- .../Concepts/PolynomialTraits_d--Degree.h | 4 +- .../PolynomialTraits_d--DegreeVector.h | 4 +- .../PolynomialTraits_d--Differentiate.h | 4 +- .../Concepts/PolynomialTraits_d--Evaluate.h | 4 +- .../PolynomialTraits_d--EvaluateHomogeneous.h | 4 +- ...olynomialTraits_d--GcdUpToConstantFactor.h | 4 +- .../PolynomialTraits_d--GetCoefficient.h | 4 +- ...ynomialTraits_d--GetInnermostCoefficient.h | 4 +- ...ialTraits_d--InnermostLeadingCoefficient.h | 4 +- ...ts_d--IntegralDivisionUpToConstantFactor.h | 4 +- .../Concepts/PolynomialTraits_d--Invert.h | 4 +- .../PolynomialTraits_d--IsSquareFree.h | 4 +- .../Concepts/PolynomialTraits_d--IsZeroAt.h | 4 +- .../PolynomialTraits_d--IsZeroAtHomogeneous.h | 4 +- .../PolynomialTraits_d--LeadingCoefficient.h | 4 +- .../PolynomialTraits_d--MakeSquareFree.h | 4 +- ...lynomialTraits_d--MonomialRepresentation.h | 4 +- .../Concepts/PolynomialTraits_d--Move.h | 4 +- .../PolynomialTraits_d--MultivariateContent.h | 4 +- .../Concepts/PolynomialTraits_d--Negate.h | 4 +- .../Concepts/PolynomialTraits_d--Permute.h | 4 +- ...ynomialTraits_d--PolynomialSubresultants.h | 4 +- ..._d--PolynomialSubresultantsWithCofactors.h | 4 +- ...lTraits_d--PrincipalSturmHabichtSequence.h | 4 +- ...lynomialTraits_d--PrincipalSubresultants.h | 4 +- .../PolynomialTraits_d--PseudoDivision.h | 4 +- ...lynomialTraits_d--PseudoDivisionQuotient.h | 4 +- ...ynomialTraits_d--PseudoDivisionRemainder.h | 4 +- .../Concepts/PolynomialTraits_d--Resultant.h | 4 +- .../Concepts/PolynomialTraits_d--Scale.h | 4 +- .../PolynomialTraits_d--ScaleHomogeneous.h | 4 +- .../Concepts/PolynomialTraits_d--Shift.h | 4 +- .../Concepts/PolynomialTraits_d--SignAt.h | 4 +- .../PolynomialTraits_d--SignAtHomogeneous.h | 4 +- .../PolynomialTraits_d--SquareFreeFactorize.h | 4 +- ...d--SquareFreeFactorizeUpToConstantFactor.h | 4 +- ...PolynomialTraits_d--SturmHabichtSequence.h | 4 +- ...its_d--SturmHabichtSequenceWithCofactors.h | 4 +- .../Concepts/PolynomialTraits_d--Substitute.h | 4 +- ...olynomialTraits_d--SubstituteHomogeneous.h | 4 +- .../Concepts/PolynomialTraits_d--Swap.h | 4 +- .../PolynomialTraits_d--TotalDegree.h | 4 +- .../Concepts/PolynomialTraits_d--Translate.h | 4 +- ...PolynomialTraits_d--TranslateHomogeneous.h | 4 +- .../PolynomialTraits_d--UnivariateContent.h | 4 +- ...s_d--UnivariateContentUpToConstantFactor.h | 4 +- .../Polynomial/Concepts/PolynomialTraits_d.h | 2 +- .../doc/Polynomial/Concepts/Polynomial_d.h | 2 +- ...shComplexWithFeatures_3InTriangulation_3.h | 2 +- .../Concepts/SimplicialMeshCellBase_3.h | 3 +- .../Concepts/SimplicialMeshVertexBase_3.h | 2 +- .../doc/STL_Extension/Concepts/Descriptor.h | 5 +- .../doc/STL_Extension/Concepts/Index.h | 2 +- .../SegmentDelaunayGraphDataStructure_2.h | 2 +- .../Concepts/SegmentDelaunayGraphFaceBase_2.h | 2 +- ...egmentDelaunayGraphHierarchyVertexBase_2.h | 2 +- .../Concepts/SegmentDelaunayGraphSite_2.h | 4 +- .../SegmentDelaunayGraphStorageSite_2.h | 4 +- .../SegmentDelaunayGraphStorageTraits_2.h | 4 +- .../Concepts/SegmentDelaunayGraphTraits_2.h | 2 +- .../SegmentDelaunayGraphVertexBase_2.h | 2 +- .../SegmentDelaunayGraphLinfTraits_2.h | 2 +- .../Concepts/CastingTraits_2.h | 3 +- .../Concepts/SkinSurfaceTraits_3.h | 2 +- .../Concepts/SnapRoundingTraits_2.h | 22 ++-- .../Concepts/SparseLinearAlgebraTraits_d.h | 5 +- .../SparseLinearAlgebraWithFactorTraits_d.h | 2 +- .../doc/Solver_interface/Concepts/SvdTraits.h | 3 +- .../Concepts/OrthogonalDistance.h | 2 +- .../Concepts/RangeSearchTraits.h | 2 +- .../Concepts/PolygonOffsetBuilderTraits_2.h | 2 +- .../StraightSkeletonBuilderTraits_2.h | 3 +- .../Concepts/StraightSkeletonFace_2.h | 2 +- .../Concepts/StraightSkeletonHalfedge_2.h | 2 +- .../Concepts/StraightSkeletonVertex_2.h | 2 +- .../Concepts/StraightSkeleton_2.h | 2 +- .../Subdivision_method_3/Concepts/DQQMask_3.h | 2 +- .../Subdivision_method_3/Concepts/PQQMask_3.h | 2 +- .../Subdivision_method_3/Concepts/PTQMask_3.h | 2 +- .../Concepts/Sqrt3Mask_3.h | 2 +- .../DeformationClosestRotationTraits_3.h | 4 +- .../Concepts/RawPoint_3.h | 2 +- .../Concepts/SegmentationGeomTraits.h | 2 +- .../Concepts/SurfaceMeshShortestPathTraits.h | 4 +- .../Concepts/GetCost.h | 3 +- .../Concepts/GetPlacement.h | 3 +- .../Concepts/PlacementFilter.h | 3 +- .../Concepts/PolygonalSchema.h | 2 +- .../Concepts/PolygonalSchemaItems.h | 2 +- .../Concepts/SurfaceMeshCellBase_3.h | 2 +- .../Concepts/SurfaceMeshVertexBase_3.h | 2 +- .../Concepts/TriangulationDSFaceBase_2.h | 2 +- .../Concepts/TriangulationDSVertexBase_2.h | 2 +- .../Concepts/TriangulationDSCellBase_3.h | 2 +- .../Concepts/TriangulationDSVertexBase_3.h | 2 +- .../Concepts/RemeshingCellBase_3.h | 2 +- .../Concepts/RemeshingTriangulationTraits_3.h | 2 +- .../Concepts/RemeshingVertexBase_3.h | 2 +- .../Concepts/DelaunayTriangulationTraits.h | 2 +- .../Concepts/RegularTriangulationTraits.h | 2 +- .../Concepts/TriangulationDSFullCell.h | 2 +- .../Concepts/TriangulationDSVertex.h | 2 +- .../Concepts/TriangulationFullCell.h | 4 +- .../Concepts/TriangulationTraits.h | 2 +- .../Concepts/TriangulationVertex.h | 2 +- ...ConstrainedDelaunayTriangulationTraits_2.h | 3 +- .../ConstrainedTriangulationFaceBase_2.h | 2 +- .../ConstrainedTriangulationTraits_2.h | 2 +- .../Concepts/DelaunayTriangulationTraits_2.h | 2 +- .../Concepts/RegularTriangulationFaceBase_2.h | 2 +- .../Concepts/RegularTriangulationTraits_2.h | 2 +- .../RegularTriangulationVertexBase_2.h | 2 +- .../Concepts/TriangulationFaceBase_2.h | 2 +- .../TriangulationHierarchyVertexBase_2.h | 2 +- .../Concepts/TriangulationTraits_2.h | 2 +- .../TriangulationVertexBaseWithInfo_2.h | 2 +- .../Concepts/TriangulationVertexBase_2.h | 2 +- .../DelaunayTriangulationCellBase_3.h | 2 +- .../Concepts/DelaunayTriangulationTraits_3.h | 2 +- ...lationCellBaseWithWeightedCircumcenter_3.h | 2 +- .../Concepts/RegularTriangulationCellBase_3.h | 2 +- .../Concepts/RegularTriangulationTraits_3.h | 2 +- .../RegularTriangulationVertexBase_3.h | 2 +- .../TriangulationCellBaseWithInfo_3.h | 2 +- .../Concepts/TriangulationCellBase_3.h | 2 +- .../Concepts/TriangulationTraits_3.h | 2 +- .../TriangulationVertexBaseWithInfo_3.h | 2 +- .../Concepts/TriangulationVertexBase_3.h | 2 +- .../DelaunayTriangulationOnSphereTraits_2.h | 2 +- .../TriangulationOnSphereFaceBase_2.h | 2 +- .../Concepts/TriangulationOnSphereTraits_2.h | 2 +- .../TriangulationOnSphereVertexBase_2.h | 2 +- .../CGAL/Voronoi_diagram_2.h | 3 +- .../Concepts/AdaptationPolicy_2.h | 2 +- .../Concepts/AdaptationTraits_2.h | 2 +- .../Concepts/DelaunayGraph_2.h | 2 +- 442 files changed, 527 insertions(+), 766 deletions(-) diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h index 191b388edf9..d4d98be930d 100644 --- a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h +++ b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h @@ -9,7 +9,7 @@ and compute intersections between query objects and the primitives stored in the In addition, it contains predicates and constructors to compute distances between a point query and the primitives stored in the AABB tree. -\cgalRefines `SearchGeomTraits_3` +\cgalRefines{SearchGeomTraits_3} \cgalHasModel All models of the concept `Kernel` diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h index de83a001ec8..a90c498a7ec 100644 --- a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h +++ b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h @@ -7,7 +7,7 @@ concept `AABBGeomTraits`. In addition to the types required by `AABBGeomTraits` it also requires types and functors necessary to define the Intersection_distance functor. -\cgalRefines `AABBGeomTraits` +\cgalRefines{AABBGeomTraits} \cgalHasModel All models of the concept `Kernel` diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h index b1db24dab21..c7f0e806faf 100644 --- a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h +++ b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h @@ -7,7 +7,7 @@ The concept `AABBTraits` provides the geometric primitive types and methods for \cgalHasModel `CGAL::AABB_traits` -\cgalRefines `SearchGeomTraits_3` +\cgalRefines{SearchGeomTraits_3} \sa `CGAL::AABB_traits` \sa `CGAL::AABB_tree` diff --git a/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h b/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h index 458f63668af..c68ff917daa 100644 --- a/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h +++ b/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h @@ -9,7 +9,7 @@ used in the class `CGAL::Advancing_front_surface_reconstruction`. It defines the geometric objects (points, segments...) forming the triangulation together with a few geometric predicates and constructions on these objects. -\cgalRefines `DelaunayTriangulationTraits_3` +\cgalRefines{DelaunayTriangulationTraits_3} \cgalHasModel All models of `Kernel`. */ diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Div.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Div.h index f2636529343..9eac0a57c46 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Div.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Div.h @@ -8,7 +8,7 @@ namespace AlgebraicStructureTraits_{ `AdaptableBinaryFunction` computes the integral quotient of division with remainder. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicStructureTraits` \sa `AlgebraicStructureTraits_::Mod` @@ -58,4 +58,4 @@ template result_type operator()(NT1 x, NT2 y); }; /* end Div */ -} \ No newline at end of file +} diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--DivMod.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--DivMod.h index 2e2e4d2cd0f..77116e3a7a1 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--DivMod.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--DivMod.h @@ -189,7 +189,7 @@ r -\cgalRefines `AdaptableFunctor` +\cgalRefines{AdaptableFunctor} \sa `AlgebraicStructureTraits` \sa `AlgebraicStructureTraits_::Mod` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Divides.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Divides.h index b6296f69ff8..5a470643ad7 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Divides.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Divides.h @@ -16,7 +16,7 @@ This functor is required to provide two operators. The first operator takes two arguments and returns true if the first argument divides the second argument. The second operator returns \f$ c\f$ via the additional third argument. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicStructureTraits` \sa `AlgebraicStructureTraits_::IntegralDivision` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Gcd.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Gcd.h index 1dfc1c08856..92244b790ff 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Gcd.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Gcd.h @@ -17,7 +17,7 @@ unit-normal (i.e.\ have unit part 1). to the partial order of divisibility. This is because an element \f$ a \in R\f$ is said to divide \f$ b \in R\f$, iff \f$ \exists r \in R\f$ such that \f$ a \cdot r = b\f$. Thus, \f$ 0\f$ is divided by every element of the Ring, in particular by itself. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IntegralDivision.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IntegralDivision.h index 8627e724944..9eccaa1a37b 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IntegralDivision.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IntegralDivision.h @@ -13,7 +13,7 @@ exists (i.e.\ if \f$ x\f$ is divisible by \f$ y\f$). Otherwise the effect of inv this operation is undefined. Since the ring represented is an integral domain, \f$ z\f$ is uniquely defined if it exists. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicStructureTraits` \sa `AlgebraicStructureTraits_::Divides` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Inverse.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Inverse.h index 4c7602959a2..e72950d3346 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Inverse.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Inverse.h @@ -8,7 +8,7 @@ namespace AlgebraicStructureTraits_{ `AdaptableUnaryFunction` providing the inverse element with respect to multiplication of a `Field`. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsOne.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsOne.h index 47c2486c112..91addf365a9 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsOne.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsOne.h @@ -8,7 +8,7 @@ namespace AlgebraicStructureTraits_{ `AdaptableUnaryFunction`, returns true in case the argument is the one of the ring. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsSquare.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsSquare.h index f50af0ba048..27aace6db8d 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsSquare.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsSquare.h @@ -13,7 +13,7 @@ A ring element \f$ x\f$ is said to be a square iff there exists a ring element \ that \f$ x= y*y\f$. In case the ring is a `UniqueFactorizationDomain`, \f$ y\f$ is uniquely defined up to multiplication by units. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsZero.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsZero.h index 8fd2c91c343..c8f6bffc002 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsZero.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--IsZero.h @@ -7,7 +7,7 @@ namespace AlgebraicStructureTraits_{ `AdaptableUnaryFunction`, returns true in case the argument is the zero element of the ring. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicStructureTraits` \sa `RealEmbeddableTraits_::IsZero` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--KthRoot.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--KthRoot.h index c9e6bed7986..1825473190d 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--KthRoot.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--KthRoot.h @@ -7,7 +7,7 @@ namespace AlgebraicStructureTraits_{ `AdaptableBinaryFunction` providing the k-th root. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `FieldWithRootOf` \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Mod.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Mod.h index 5f45b13441c..af160cb22be 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Mod.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Mod.h @@ -7,7 +7,7 @@ namespace AlgebraicStructureTraits_ { `AdaptableBinaryFunction` computes the remainder of division with remainder. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicStructureTraits` \sa `AlgebraicStructureTraits_::Div` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--RootOf.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--RootOf.h index 1d925e33ae9..2e2dc349407 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--RootOf.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--RootOf.h @@ -8,7 +8,7 @@ namespace AlgebraicStructureTraits_{ `AdaptableFunctor` computes a real root of a square-free univariate polynomial. -\cgalRefines `AdaptableFunctor` +\cgalRefines{AdaptableFunctor} \sa `FieldWithRootOf` \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Simplify.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Simplify.h index 4d5e5858a26..2a19674b46f 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Simplify.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Simplify.h @@ -7,7 +7,7 @@ namespace AlgebraicStructureTraits_{ This `AdaptableUnaryFunction` may simplify a given object. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Sqrt.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Sqrt.h index 5186f117a58..5ba0a2fc9a1 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Sqrt.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Sqrt.h @@ -7,7 +7,7 @@ namespace AlgebraicStructureTraits_{ `AdaptableUnaryFunction` providing the square root. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Square.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Square.h index a21df785218..0cc33797b3e 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Square.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--Square.h @@ -7,7 +7,7 @@ namespace AlgebraicStructureTraits_{ `AdaptableUnaryFunction`, computing the square of the argument. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--UnitPart.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--UnitPart.h index 2f5cc4d4b2d..15035610c40 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--UnitPart.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits--UnitPart.h @@ -21,7 +21,7 @@ hence the unit-part of a non-zero integer is its sign. For a `Field`, every non-zero element is a unit and is its own unit part, its unit normal associate being one. The unit part of zero is, by convention, one. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicStructureTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h index d7d340b0bc3..69421885198 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h @@ -25,7 +25,7 @@ The most prominent example of a Euclidean ring are the integers. Whenever both \f$ x\f$ and \f$ y\f$ are positive, then it is conventional to choose the smallest positive remainder \f$ r\f$. -\cgalRefines `UniqueFactorizationDomain` +\cgalRefines{UniqueFactorizationDomain} \sa `IntegralDomainWithoutDivision` \sa `IntegralDomain` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/Field.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/Field.h index 0393f355733..cf0c4615928 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/Field.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/Field.h @@ -16,7 +16,7 @@ Moreover, `CGAL::Algebraic_structure_traits< Field >` is a model of - \link AlgebraicStructureTraits::Algebraic_category `CGAL::Algebraic_structure_traits< Field >::Algebraic_category` \endlink derived from `CGAL::Field_tag` - \link AlgebraicStructureTraits::Inverse `CGAL::Algebraic_structure_traits< FieldWithSqrt >::Inverse` \endlink which is a model of `AlgebraicStructureTraits_::Inverse` -\cgalRefines `IntegralDomain` +\cgalRefines{IntegralDomain} \sa `IntegralDomainWithoutDivision` \sa `IntegralDomain` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h index 3c464a42811..8609a9a9cbe 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h @@ -7,8 +7,7 @@ The concept `FieldNumberType` combines the requirements of the concepts A model of `FieldNumberType` can be used as a template parameter for Cartesian kernels. -\cgalRefines `Field` -\cgalRefines `RealEmbeddable` +\cgalRefines{Field,RealEmbeddable} \cgalHasModel float \cgalHasModel double diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithKthRoot.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithKthRoot.h index fdf80ccb5d5..d786a07704d 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithKthRoot.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithKthRoot.h @@ -10,7 +10,7 @@ Moreover, `CGAL::Algebraic_structure_traits< FieldWithKthRoot >` is a model of ` - \link AlgebraicStructureTraits::Algebraic_category `CGAL::Algebraic_structure_traits< FieldWithKthRoot >::Algebraic_category` \endlink derived from `CGAL::Field_with_kth_root_tag` - \link AlgebraicStructureTraits::Kth_root `CGAL::Algebraic_structure_traits< FieldWithKthRoot >::Kth_root` \endlink which is a model of `AlgebraicStructureTraits_::KthRoot` -\cgalRefines `FieldWithSqrt` +\cgalRefines{FieldWithSqrt} \sa `IntegralDomainWithoutDivision` \sa `IntegralDomain` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithRootOf.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithRootOf.h index beb3f93bfaf..fbedea0a5cc 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithRootOf.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithRootOf.h @@ -11,7 +11,7 @@ Moreover, `CGAL::Algebraic_structure_traits< FieldWithRootOf >` is a model of `A - \link AlgebraicStructureTraits::Algebraic_category `CGAL::Algebraic_structure_traits< FieldWithRootOf >::Algebraic_category` \endlink derived from `CGAL::Field_with_kth_root_tag` - \link AlgebraicStructureTraits::Root_of `CGAL::Algebraic_structure_traits< FieldWithRootOf >::Root_of` \endlink which is a model of `AlgebraicStructureTraits_::RootOf` -\cgalRefines `FieldWithKthRoot` +\cgalRefines{FieldWithKthRoot} \sa `IntegralDomainWithoutDivision` \sa `IntegralDomain` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithSqrt.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithSqrt.h index a00fc6117af..6f4de356deb 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithSqrt.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldWithSqrt.h @@ -10,7 +10,7 @@ Moreover, `CGAL::Algebraic_structure_traits< FieldWithSqrt >` is a model of `Alg - \link AlgebraicStructureTraits::Algebraic_category `CGAL::Algebraic_structure_traits< FieldWithSqrt >::Algebraic_category` \endlink derived from `CGAL::Field_with_sqrt_tag` - \link AlgebraicStructureTraits::Sqrt `CGAL::Algebraic_structure_traits< FieldWithSqrt >::Sqrt` \endlink which is a model of `AlgebraicStructureTraits_::Sqrt` -\cgalRefines `Field` +\cgalRefines{Field} \sa `IntegralDomainWithoutDivision` \sa `IntegralDomain` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h index a078885017c..eaa438e6c90 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h @@ -113,7 +113,7 @@ FractionTraits::Denominator_type & d); `AdaptableBinaryFunction`, returns the fraction of its arguments. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `Fraction` \sa `FractionTraits` @@ -168,7 +168,7 @@ This can be considered as a relaxed version of `AlgebraicStructureTraits_::Gcd`, this is needed because it is not guaranteed that `FractionTraits::Denominator_type` is a model of `UniqueFactorizationDomain`. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `Fraction` \sa `FractionTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h index 092de9ee651..d7521aafcaa 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h @@ -16,7 +16,7 @@ In this case \link CGAL::Coercion_traits::Are_implicit_interoperable `CGAL::Coercion_traits::Are_implicit_interoperable`\endlink is `CGAL::Tag_true`. -\cgalRefines `ExplicitInteroperable` +\cgalRefines{ExplicitInteroperable} \sa `CGAL::Coercion_traits` \sa `ExplicitInteroperable` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/IntegralDomain.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/IntegralDomain.h index a0fa9867788..ebdcbfe2189 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/IntegralDomain.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/IntegralDomain.h @@ -16,7 +16,7 @@ Moreover, `CGAL::Algebraic_structure_traits< IntegralDomain >` is a model of - \link AlgebraicStructureTraits::Integral_division `CGAL::Algebraic_structure_traits< IntegralDomain >::Integral_division` \endlink which is a model of `AlgebraicStructureTraits_::IntegralDivision` - \link AlgebraicStructureTraits::Divides `CGAL::Algebraic_structure_traits< IntegralDomain >::Divides` \endlink which is a model of `AlgebraicStructureTraits_::Divides` -\cgalRefines `IntegralDomainWithoutDivision` +\cgalRefines{IntegralDomainWithoutDivision} \sa `IntegralDomainWithoutDivision` \sa `IntegralDomain` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/IntegralDomainWithoutDivision.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/IntegralDomainWithoutDivision.h index 9f6467406dd..2636122f379 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/IntegralDomainWithoutDivision.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/IntegralDomainWithoutDivision.h @@ -29,11 +29,7 @@ Moreover, `CGAL::Algebraic_structure_traits< IntegralDomainWithoutDivision >` is - \link AlgebraicStructureTraits::Simplify `CGAL::Algebraic_structure_traits< IntegralDomainWithoutDivision >::Simplify` \endlink which is a model of `AlgebraicStructureTraits_::Simplify` - \link AlgebraicStructureTraits::Unit_part `CGAL::Algebraic_structure_traits< IntegralDomainWithoutDivision >::Unit_part` \endlink which is a model of `AlgebraicStructureTraits_::UnitPart` -\cgalRefines `Assignable` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` -\cgalRefines `EqualityComparable` -\cgalRefines `FromIntConstructible` +\cgalRefines{Assignable,CopyConstructible,DefaultConstructible,EqualityComparable,FromIntConstructible} \sa `IntegralDomainWithoutDivision` \sa `IntegralDomain` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddable.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddable.h index ca66c563727..8f38c630da6 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddable.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddable.h @@ -38,8 +38,7 @@ If a number type is a model of both `IntegralDomainWithoutDivision` and `RealEmbeddable`, it follows that the ring represented by such a number type is a sub-ring of the real numbers and hence has characteristic zero. -\cgalRefines `EqualityComparable` -\cgalRefines `LessThanComparable` +\cgalRefines{EqualityComparable,LessThanComparable} \sa `RealEmbeddableTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Abs.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Abs.h index bc4c71769a4..a04e3446f91 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Abs.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Abs.h @@ -7,7 +7,7 @@ namespace RealEmbeddableTraits_ { `AdaptableUnaryFunction` computes the absolute value of a number. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `RealEmbeddableTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Compare.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Compare.h index 9f2d4d7fcf1..81607c82508 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Compare.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Compare.h @@ -7,7 +7,7 @@ namespace RealEmbeddableTraits_ { `AdaptableBinaryFunction` compares two real embeddable numbers. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `RealEmbeddableTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsNegative.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsNegative.h index a976457061a..13f0683f87d 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsNegative.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsNegative.h @@ -7,7 +7,7 @@ namespace RealEmbeddableTraits_ { `AdaptableUnaryFunction`, returns true in case the argument is negative. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `RealEmbeddableTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsPositive.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsPositive.h index 237a3be3cc2..89bb2c1346a 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsPositive.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsPositive.h @@ -7,7 +7,7 @@ namespace RealEmbeddableTraits_ { `AdaptableUnaryFunction`, returns true in case the argument is positive. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `RealEmbeddableTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsZero.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsZero.h index 1e0eec32850..4257cfad3c4 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsZero.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--IsZero.h @@ -7,7 +7,7 @@ namespace RealEmbeddableTraits_ { `AdaptableUnaryFunction`, returns true in case the argument is 0. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `RealEmbeddableTraits` \sa `AlgebraicStructureTraits_::IsZero` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Sgn.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Sgn.h index 783caf4f115..c8d112ca99e 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Sgn.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--Sgn.h @@ -7,7 +7,7 @@ namespace RealEmbeddableTraits_ { This `AdaptableUnaryFunction` computes the sign of a real embeddable number. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `RealEmbeddableTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--ToDouble.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--ToDouble.h index b09a262eea1..2941d4a69cb 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--ToDouble.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--ToDouble.h @@ -11,7 +11,7 @@ embeddable number. Remark: In order to control the quality of approximation one has to resort to methods that are specific to NT. There are no general guarantees whatsoever. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `RealEmbeddableTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--ToInterval.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--ToInterval.h index 9d73121096c..45222cbe10b 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--ToInterval.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits--ToInterval.h @@ -9,7 +9,7 @@ namespace RealEmbeddableTraits_ { number \f$ x\f$ a double interval containing \f$ x\f$. This interval is represented by `std::pair`. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `RealEmbeddableTraits` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h index 37b6e85e6df..a2b6c5036f0 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h @@ -8,8 +8,7 @@ The concept `RingNumberType` combines the requirements of the concepts A model of `RingNumberType` can be used as a template parameter for Homogeneous kernels. -\cgalRefines `IntegralDomainWithoutDivision` -\cgalRefines `RealEmbeddable` +\cgalRefines{IntegralDomainWithoutDivision,RealEmbeddable} \cgalHasModel \cpp built-in number types \cgalHasModel `CGAL::Gmpq` diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/UniqueFactorizationDomain.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/UniqueFactorizationDomain.h index 0471c50f614..5087c6b2f5c 100644 --- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/UniqueFactorizationDomain.h +++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/UniqueFactorizationDomain.h @@ -23,7 +23,7 @@ is a model of `AlgebraicStructureTraits` providing: derived from `CGAL::Unique_factorization_domain_tag` - \link AlgebraicStructureTraits::Gcd `CGAL::Algebraic_structure_traits< UniqueFactorizationDomain >::Gcd` \endlink which is a model of `AlgebraicStructureTraits_::Gcd` -\cgalRefines `IntegralDomain` +\cgalRefines{IntegralDomain} \sa `IntegralDomainWithoutDivision` \sa `IntegralDomain` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ApproximateAbsolute_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ApproximateAbsolute_1.h index 48c231df209..5a2bdf72bd6 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ApproximateAbsolute_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ApproximateAbsolute_1.h @@ -7,7 +7,7 @@ A model of `AlgebraicKernel_d_1::ApproximateAbsolute_1` is an `AdaptableBinaryFu approximation of an `AlgebraicKernel_d_1::Algebraic_real_1` value with respect to a given absolute precision. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_1::ApproximateRelative_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ApproximateRelative_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ApproximateRelative_1.h index b9ce0d868b3..5e77b24f981 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ApproximateRelative_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ApproximateRelative_1.h @@ -7,7 +7,7 @@ A model of `AlgebraicKernel_d_1::ApproximateRelative_1` is an `AdaptableBinaryFu approximation of an `AlgebraicKernel_d_1::Algebraic_real_1` value with respect to a given relative precision. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_1::ApproximateAbsolute_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--BoundBetween_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--BoundBetween_1.h index ae6b9c14d0b..e9fea74b2d7 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--BoundBetween_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--BoundBetween_1.h @@ -7,7 +7,7 @@ Computes a number of type `AlgebraicKernel_d_1::Bound` in-between two `AlgebraicKernel_d_1::Algebraic_real_1` values. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} */ diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Compare_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Compare_1.h index 9588064cd04..ade530535ce 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Compare_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Compare_1.h @@ -5,7 +5,7 @@ Compares `AlgebraicKernel_d_1::Algebraic_real_1` values. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} */ class AlgebraicKernel_d_1::Compare_1 { diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ComputePolynomial_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ComputePolynomial_1.h index 81e5feb778c..260359204ab 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ComputePolynomial_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ComputePolynomial_1.h @@ -6,7 +6,7 @@ Computes a square free univariate polynomial \f$ p\f$, such that the given `AlgebraicKernel_d_1::Algebraic_real_1` is a root of \f$ p\f$. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_1::Isolate_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ConstructAlgebraicReal_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ConstructAlgebraicReal_1.h index fcc7b68feaa..80e5511d209 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ConstructAlgebraicReal_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--ConstructAlgebraicReal_1.h @@ -5,7 +5,7 @@ Constructs `AlgebraicKernel_d_1::Algebraic_real_1`. -\cgalRefines `AdaptableFunctor` +\cgalRefines{AdaptableFunctor} \sa `AlgebraicKernel_d_2::ConstructAlgebraicReal_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsCoprime_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsCoprime_1.h index 2e28f355dd6..080d18c6923 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsCoprime_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsCoprime_1.h @@ -6,7 +6,7 @@ Determines whether a given pair of univariate polynomials \f$ p_1, p_2\f$ is coprime, namely if \f$ \deg({\rm gcd}(p_1 ,p_2)) = 0\f$. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_1::MakeCoprime_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsSquareFree_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsSquareFree_1.h index 1e3a350dc98..0bd7b9ce4b7 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsSquareFree_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsSquareFree_1.h @@ -5,7 +5,7 @@ Computes whether the given univariate polynomial is square free. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_1::MakeSquareFree_1` \sa `AlgebraicKernel_d_1::SquareFreeFactorize_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsZeroAt_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsZeroAt_1.h index f46b2e003c9..b01c54743be 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsZeroAt_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--IsZeroAt_1.h @@ -6,7 +6,7 @@ Computes whether an `AlgebraicKernel_d_1::Polynomial_1` is zero at a given `AlgebraicKernel_d_1::Algebraic_real_1`. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_1::SignAt_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Isolate_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Isolate_1.h index 2396ab84089..b50727dbcf9 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Isolate_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Isolate_1.h @@ -6,7 +6,7 @@ Computes an open isolating interval for an `AlgebraicKernel_d_1::Algebraic_real_1` with respect to the real roots of a given univariate polynomial. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_1::ComputePolynomial_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--MakeCoprime_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--MakeCoprime_1.h index 4ccc4328677..63d35168387 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--MakeCoprime_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--MakeCoprime_1.h @@ -16,7 +16,7 @@ such that \f$ q_1\f$ and \f$ q_2\f$ are coprime. It returns true if \f$ p_1\f$ and \f$ p_2\f$ are already coprime. -\cgalRefines `AdaptableFunctor` with five arguments +\cgalRefines{AdaptableFunctor (with five arguments)} \sa `AlgebraicKernel_d_1::IsCoprime_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--MakeSquareFree_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--MakeSquareFree_1.h index c45b33274fb..b357a91a9af 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--MakeSquareFree_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--MakeSquareFree_1.h @@ -5,7 +5,7 @@ Returns a square free part of a univariate polynomial. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_1::IsSquareFree_1` \sa `AlgebraicKernel_d_1::SquareFreeFactorize_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--NumberOfSolutions_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--NumberOfSolutions_1.h index 1ddba4f6951..c2269e0d942 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--NumberOfSolutions_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--NumberOfSolutions_1.h @@ -5,7 +5,7 @@ Computes the number of real solutions of the given univariate polynomial. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_1::ConstructAlgebraicReal_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--SignAt_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--SignAt_1.h index 56009e09f91..98c0175abc9 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--SignAt_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--SignAt_1.h @@ -7,7 +7,7 @@ Computes the sign of a univariate polynomial `AlgebraicKernel_d_1::Polynomial_1` at a real value of type `AlgebraicKernel_d_1::Algebraic_real_1`. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_1::IsZeroAt_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Solve_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Solve_1.h index add3def2d3c..7e0691c3d31 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Solve_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--Solve_1.h @@ -5,8 +5,7 @@ Computes the real roots of a univariate polynomial. -\cgalRefines `Assignable` -\cgalRefines `CopyConstructible` +\cgalRefines{Assignable,CopyConstructible} */ diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--SquareFreeFactorize_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--SquareFreeFactorize_1.h index acfdf7c3778..7d438091838 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--SquareFreeFactorize_1.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1--SquareFreeFactorize_1.h @@ -14,8 +14,7 @@ and a constant factor \f$ c\f$, such that The factor multiplicity pairs \f$ \f$ are written to the given output iterator. The constant factor \f$ c\f$ is not computed. -\cgalRefines `Assignable` -\cgalRefines `CopyConstructible` +\cgalRefines{Assignable,CopyConstructible} \sa `AlgebraicKernel_d_1::IsSquareFree_1` \sa `AlgebraicKernel_d_1::MakeSquareFree_1` 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 26d30e364bd..c9c2f475f8e 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 @@ -6,8 +6,7 @@ A model of the `AlgebraicKernel_d_1` concept is meant to provide the algebraic functionalities on univariate polynomials of general degree \f$ d\f$. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable} \cgalHasModel `CGAL::Algebraic_kernel_rs_gmpz_d_1` \cgalHasModel `CGAL::Algebraic_kernel_rs_gmpq_d_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateAbsoluteX_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateAbsoluteX_2.h index 79a14f66cc2..570abe04997 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateAbsoluteX_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateAbsoluteX_2.h @@ -7,7 +7,7 @@ A model of `AlgebraicKernel_d_2::ApproximateAbsoluteX_2` is an `AdaptableBinaryF approximation of the \f$ x\f$-coordinate of an `AlgebraicKernel_d_2::Algebraic_real_2` value with respect to a given absolute precision. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::ApproximateRelativeX_2` \sa `AlgebraicKernel_d_1::ApproximateAbsolute_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateAbsoluteY_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateAbsoluteY_2.h index 934ba0bdeb4..5f7ea507dec 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateAbsoluteY_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateAbsoluteY_2.h @@ -7,7 +7,7 @@ A model of `AlgebraicKernel_d_2::ApproximateAbsoluteY_2` is an `AdaptableBinaryF approximation of the \f$ y\f$-coordinate of an `AlgebraicKernel_d_2::Algebraic_real_2` value with respect to a given absolute precision. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::ApproximateRelativeY_2` \sa `AlgebraicKernel_d_1::ApproximateAbsolute_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateRelativeX_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateRelativeX_2.h index c19a7d3407a..90ef3fe920f 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateRelativeX_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateRelativeX_2.h @@ -7,7 +7,7 @@ A model of `AlgebraicKernel_d_2::ApproximateRelativeX_2` is an `AdaptableBinaryF approximation of the \f$ x\f$-coordinate of an `AlgebraicKernel_d_2::Algebraic_real_2` value with respect to a given relative precision. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::ApproximateAbsoluteY_2` \sa `AlgebraicKernel_d_1::ApproximateAbsolute_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateRelativeY_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateRelativeY_2.h index d666401a9e4..d647cf7aaaf 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateRelativeY_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ApproximateRelativeY_2.h @@ -7,7 +7,7 @@ A model of `AlgebraicKernel_d_2::ApproximateRelativeY_2` is an `AdaptableBinaryF approximation of the \f$ y\f$-coordinate of an `AlgebraicKernel_d_2::Algebraic_real_2` value with respect to a given relative precision. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::ApproximateAbsoluteY_2` \sa `AlgebraicKernel_d_1::ApproximateAbsolute_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--BoundBetweenX_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--BoundBetweenX_2.h index 73f94950331..07c8ff0e8f7 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--BoundBetweenX_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--BoundBetweenX_2.h @@ -7,7 +7,7 @@ Computes a number of type `AlgebraicKernel_d_1::Bound` in-between the first coordinates of two `AlgebraicKernel_d_2::AlgebraicReal_2`. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::BoundBetweenY_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--BoundBetweenY_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--BoundBetweenY_2.h index abfa45a09c3..e7f42fdd912 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--BoundBetweenY_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--BoundBetweenY_2.h @@ -7,7 +7,7 @@ Computes a number of type `AlgebraicKernel_d_1::Bound` in-between the second coordinates of two `AlgebraicKernel_d_2::AlgebraicReal_2`. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::BoundBetweenX_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareXY_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareXY_2.h index 6ca57ad52eb..1f5eee4a650 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareXY_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareXY_2.h @@ -5,7 +5,7 @@ Compares `AlgebraicKernel_d_2::Algebraic_real_2`s lexicographically. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::CompareX_2` \sa `AlgebraicKernel_d_2::CompareY_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareX_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareX_2.h index efbbae9df51..0921ee760f2 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareX_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareX_2.h @@ -5,7 +5,7 @@ Compares the first coordinates of `AlgebraicKernel_d_2::Algebraic_real_2`s. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::CompareY_2` \sa `AlgebraicKernel_d_2::CompareXY_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareY_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareY_2.h index 5b172838568..1841b4f26bd 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareY_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--CompareY_2.h @@ -5,7 +5,7 @@ Compares the second coordinated of `AlgebraicKernel_d_2::Algebraic_real_2`s. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::CompareX_2` \sa `AlgebraicKernel_d_2::CompareXY_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputePolynomialX_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputePolynomialX_2.h index 3ce2fb4357c..280ea818766 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputePolynomialX_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputePolynomialX_2.h @@ -6,7 +6,7 @@ Computes a univariate square free polynomial \f$ p\f$, such that the first coordinate of a given `AlgebraicKernel_d_2::Algebraic_real_2` is a real root of \f$ p\f$. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_2::ComputePolynomialY_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputePolynomialY_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputePolynomialY_2.h index da93c279b9d..32cc7935025 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputePolynomialY_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputePolynomialY_2.h @@ -6,7 +6,7 @@ Computes a univariate square free polynomial \f$ p\f$, such that the second coordinate of a given `AlgebraicKernel_d_2::Algebraic_real_2` is a real root of \f$ p\f$. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_2::ComputePolynomialX_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputeX_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputeX_2.h index fd5f1beb55c..c6d15f5d6f7 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputeX_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputeX_2.h @@ -6,7 +6,7 @@ Computes the first coordinate of an `AlgebraicKernel_d_2::AlgebraicReal_2`. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_2::ComputeY_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputeY_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputeY_2.h index 1452d243f95..ad91b67ba65 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputeY_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ComputeY_2.h @@ -6,7 +6,7 @@ Computes the second coordinate of an `AlgebraicKernel_d_2::AlgebraicReal_2`. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_2::ComputeY_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ConstructAlgebraicReal_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ConstructAlgebraicReal_2.h index 4ebd692fd83..eb955bfa235 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ConstructAlgebraicReal_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--ConstructAlgebraicReal_2.h @@ -5,7 +5,7 @@ Constructs an `AlgebraicKernel_d_2::Algebraic_real_2`. -\cgalRefines `AdaptableFunctor` +\cgalRefines{AdaptableFunctor} \sa `AlgebraicKernel_d_1::ConstructAlgebraicReal_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsCoprime_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsCoprime_2.h index 350d11d0725..eaadbc2390f 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsCoprime_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsCoprime_2.h @@ -5,7 +5,7 @@ Computes whether a given pair of bivariate polynomials is coprime. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::MakeCoprime_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsSquareFree_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsSquareFree_2.h index d7d7d953f91..0f892ac0d22 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsSquareFree_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsSquareFree_2.h @@ -5,7 +5,7 @@ Computes whether the given bivariate polynomial is square free. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_2::MakeSquareFree_2` \sa `AlgebraicKernel_d_2::SquareFreeFactorize_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsZeroAt_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsZeroAt_2.h index 7102e0a0a0f..f53b0237d9e 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsZeroAt_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsZeroAt_2.h @@ -6,7 +6,7 @@ Computes whether an `AlgebraicKernel_d_2::Polynomial_2` is zero at a given `AlgebraicKernel_d_2::Algebraic_real_2`. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::SignAt_2` \sa `AlgebraicKernel_d_1::IsZeroAt_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsolateX_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsolateX_2.h index e53144c2621..c502d4d62f3 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsolateX_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsolateX_2.h @@ -6,7 +6,7 @@ Computes an isolating interval for the first coordinate of an `AlgebraicKernel_d_2::Algebraic_real_2` with respect to the real roots of a univariate polynomial. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::IsolateY_2` \sa `AlgebraicKernel_d_2::ComputePolynomialX_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsolateY_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsolateY_2.h index 257eeca6c41..8d7cd73951f 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsolateY_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--IsolateY_2.h @@ -6,7 +6,7 @@ Computes an isolating interval for the second coordinate of an `AlgebraicKernel_d_2::Algebraic_real_2` with respect to the real roots of a univariate polynomial. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::IsolateX_2` \sa `AlgebraicKernel_d_2::ComputePolynomialX_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--Isolate_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--Isolate_2.h index d69f64efc50..223405fd2c8 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--Isolate_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--Isolate_2.h @@ -5,7 +5,7 @@ Computes an isolating box for a given `AlgebraicKernel_d_2::Algebraic_real_2`. -\cgalRefines `AdaptableFunctor` +\cgalRefines{AdaptableFunctor} \sa `AlgebraicKernel_d_2::IsolateX_2` \sa `AlgebraicKernel_d_2::IsolateY_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--MakeCoprime_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--MakeCoprime_2.h index f07cfb83469..659fb1bf802 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--MakeCoprime_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--MakeCoprime_2.h @@ -13,7 +13,7 @@ That is, it computes \f$ g, q_1, q_2\f$ such that: \f$ c_2 \cdot p_2 = g \cdot q_2\f$ for some constant \f$ c_2\f$, such that \f$ q_1\f$ and \f$ q_2\f$ are coprime. -\cgalRefines `AdaptableFunctor` with five arguments +\cgalRefines{AdaptableFunctor} with five arguments \sa `AlgebraicKernel_d_2::IsCoprime_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--MakeSquareFree_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--MakeSquareFree_2.h index 7fcfda1c043..e9cc6c5402f 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--MakeSquareFree_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--MakeSquareFree_2.h @@ -5,7 +5,7 @@ Returns a square free part of a bivariate polynomial. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `AlgebraicKernel_d_2::IsSquareFree_2` \sa `AlgebraicKernel_d_2::SquareFreeFactorize_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--NumberOfSolutions_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--NumberOfSolutions_2.h index ab188387ae2..29dc332f5b7 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--NumberOfSolutions_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--NumberOfSolutions_2.h @@ -5,7 +5,7 @@ Computes the number of real solutions of the given bivariate polynomial system. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::ConstructAlgebraicReal_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--SignAt_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--SignAt_2.h index ec661097621..4ddb1e23caa 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--SignAt_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--SignAt_2.h @@ -7,7 +7,7 @@ Computes the sign of a bivariate polynomial `AlgebraicKernel_d_2::Polynomial_2` at a value of type `AlgebraicKernel_d_2::Algebraic_real_2`. -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \sa `AlgebraicKernel_d_2::IsZeroAt_2` \sa `AlgebraicKernel_d_1::SignAt_1` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--Solve_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--Solve_2.h index 64b81633bcf..2ad0e71d667 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--Solve_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--Solve_2.h @@ -6,8 +6,7 @@ Computes the real zero-dimensional solutions of a bivariate polynomial system. The multiplicity stored in the output iterator is the multiplicity in the system. -\cgalRefines `Assignable` -\cgalRefines `CopyConstructible` +\cgalRefines{Assignable,CopyConstructible} */ class AlgebraicKernel_d_2::Solve_2 { public: diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--SquareFreeFactorize_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--SquareFreeFactorize_2.h index f83faaa1561..db318d53d33 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--SquareFreeFactorize_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2--SquareFreeFactorize_2.h @@ -14,8 +14,7 @@ and a constant factor \f$ c\f$, such that The factor multiplicity pairs \f$ \f$ are written to the given output iterator. The constant factor \f$ c\f$ is not computed. -\cgalRefines `Assignable` -\cgalRefines `CopyConstructible` +\cgalRefines{Assignable,CopyConstructible} \sa `AlgebraicKernel_d_2::IsSquareFree_2` \sa `AlgebraicKernel_d_2::MakeSquareFree_2` diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2.h index e0a5888020a..40eb088b2c9 100644 --- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2.h +++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_2.h @@ -6,9 +6,7 @@ A model of the `AlgebraicKernel_d_2` concept gathers necessary tools for solving and handling bivariate polynomial systems of general degree \f$ d\f$. -\cgalRefines `AlgebraicKernel_d_1` -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{AlgebraicKernel_d_1,CopyConstructible,Assignable} \sa `AlgebraicKernel_d_1` 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 76d97be2dc2..57b30f90d2f 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 @@ -5,9 +5,9 @@ The concept `AlphaShapeFace_2` describes the requirements for the base face of an alpha shape. -\cgalRefines `TriangulationFaceBase_2`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `RegularTriangulationFaceBase_2`, if the underlying triangulation of the alpha shape is a regular triangulation. -\cgalRefines `Periodic_2TriangulationFaceBase_2`, if the underlying triangulation of the alpha shape is a periodic triangulation. +\cgalRefines{TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a Delaunay triangulation, + RegularTriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a regular triangulation, + Periodic_2TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation} \cgalHasModel `CGAL::Alpha_shape_face_base_2` (templated with the appropriate triangulation face base class). diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h index 4b6e7d88b86..a6f1c1fca18 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h @@ -6,8 +6,8 @@ The concept `AlphaShapeTraits_2` describes the requirements for the geometric traits class of the underlying Delaunay triangulation of a basic alpha shape. -\cgalRefines `DelaunayTriangulationTraits_2`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `Periodic_2DelaunayTriangulationTraits_2`, if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation. +\cgalRefines{DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a Delaunay triangulation, + Periodic_2DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation} \cgalHasModel All models of `Kernel`. \cgalHasModel Projection traits such as `CGAL::Projection_traits_xy_3`. diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h index 7065f6e55cc..5015af963f6 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h @@ -5,9 +5,9 @@ The concept `AlphaShapeVertex_2` describes the requirements for the base vertex of an alpha shape. -\cgalRefines `TriangulationVertexBase_2`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `RegularTriangulationVertexBase_2`, if the underlying triangulation of the alpha shape is a regular triangulation. -\cgalRefines `Periodic_2TriangulationVertexBase_2`, if the underlying triangulation of the alpha shape is a periodic triangulation. +\cgalRefines{TriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a Delaunay triangulation, + RegularTriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a regular triangulation, + Periodic_2TriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation} \cgalHasModel `CGAL::Alpha_shape_vertex_base_2` (templated with the appropriate triangulation vertex base class). */ diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h index 22f5e466876..5485e96fcb2 100644 --- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h +++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h @@ -7,7 +7,7 @@ The concept `WeightedAlphaShapeTraits_2` describes the requirements for the geometric traits class of the underlying regular triangulation of a weighted alpha shape. -\cgalRefines `RegularTriangulationTraits_2`, if the underlying triangulation of the alpha shape is a regular triangulation. +\cgalRefines{RegularTriangulationTraits_2} if the underlying triangulation of the alpha shape is a regular triangulation.} \cgalHasModel All models of `Kernel`. \cgalHasModel Projection traits such as `CGAL::Projection_traits_xy_3`. diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h index 00dcd06f13b..570b419998e 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h @@ -5,9 +5,9 @@ The concept `AlphaShapeCell_3` describes the requirements for the base cell of an alpha shape. -\cgalRefines `DelaunayTriangulationCellBase_3`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `RegularTriangulationCellBase_3`, if the underlying triangulation of the alpha shape is a regular triangulation. -\cgalRefines `Periodic_3TriangulationDSCellBase_3`, if the underlying triangulation of the alpha shape is a periodic triangulation. +\cgalRefines{DelaunayTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation, + RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation, + Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation} \cgalHasModel `CGAL::Alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class). diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h index f563af69436..6d9fbcbe430 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h @@ -7,8 +7,8 @@ The concept `AlphaShapeTraits_3` describes the requirements for the geometric traits class of the underlying Delaunay triangulation of a basic alpha shape. -\cgalRefines `DelaunayTriangulationTraits_3`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `Periodic_3DelaunayTriangulationTraits_3`, if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation. +\cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation, + Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation} \cgalHasModel All models of `Kernel`. diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h index 4ffdc52948d..6e23176c2d9 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h @@ -5,9 +5,9 @@ The concept `AlphaShapeVertex_3` describes the requirements for the base vertex of an alpha shape. -\cgalRefines `TriangulationVertexBase_3`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `RegularTriangulationVertexBase_3`, if the underlying triangulation of the alpha shape is a regular triangulation. -\cgalRefines `Periodic_3TriangulationDSVertexBase_3`, if the underlying triangulation of the alpha shape is a periodic triangulation. +\cgalRefines{TriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation. + RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation. + Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation} \cgalHasModel `CGAL::Alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class). diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h index ca23a4c3220..1fd4060952f 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h @@ -5,9 +5,9 @@ The concept `FixedAlphaShapeCell_3` describes the requirements for the base cell of a alpha shape with a fixed value alpha. -\cgalRefines `DelaunayTriangulationCellBase_3`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `RegularTriangulationCellBase_3`, if the underlying triangulation of the alpha shape is a regular triangulation. -\cgalRefines `Periodic_3TriangulationDSCellBase_3`, if the underlying triangulation of the alpha shape is a periodic triangulation. +\cgalRefines{DelaunayTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation, + RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation, + Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation} \cgalHasModel `CGAL::Fixed_alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class). */ diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h index 08be16af81f..d6b3aa7f35f 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h @@ -7,8 +7,8 @@ The concept `FixedAlphaShapeTraits_3` describes the requirements for the geometric traits class of the underlying Delaunay triangulation of a basic alpha shape with a fixed value alpha. -\cgalRefines `DelaunayTriangulationTraits_3`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `Periodic_3DelaunayTriangulationTraits_3`, if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation. +\cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation, + Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation} \cgalHasModel All models of `Kernel`. diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h index 256d3b5f9be..59d9593e5fc 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h @@ -5,9 +5,9 @@ The concept `FixedAlphaShapeVertex_3` describes the requirements for the base vertex of a alpha shape with a fixed value alpha. -\cgalRefines `TriangulationVertexBase_3`, if the underlying triangulation of the alpha shape is a Delaunay triangulation. -\cgalRefines `RegularTriangulationVertexBase_3`, if the underlying triangulation of the alpha shape is a regular triangulation. -\cgalRefines `Periodic_3TriangulationDSVertexBase_3`, if the underlying triangulation of the alpha shape is a periodic triangulation. +\cgalRefines{TriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation, + RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation, + Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation} \cgalHasModel `CGAL::Fixed_alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class). */ diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h index 234f348e134..e84810fdc78 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h @@ -6,8 +6,8 @@ The concept `FixedWeightedAlphaShapeTraits_3` describes the requirements for the geometric traits class of the underlying regular triangulation of a weighted alpha shape with fixed alpha value. -\cgalRefines `RegularTriangulationTraits_3`, if the underlying triangulation of the alpha shape is a regular triangulation. -\cgalRefines `Periodic_3RegularTriangulationTraits_3`, if the underlying triangulation of the alpha shape is a periodic regular triangulation. +\cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation, + Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation} \cgalHasModel All models of `Kernel`. diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h index e9633df00d2..f0c11a972c7 100644 --- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h +++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h @@ -7,8 +7,8 @@ The concept `WeightedAlphaShapeTraits_3` describes the requirements for the geometric traits class of the underlying regular triangulation of a weighted alpha shape. -\cgalRefines `RegularTriangulationTraits_3`, if the underlying triangulation of the alpha shape is a regular triangulation. -\cgalRefines `Periodic_3RegularTriangulationTraits_3`, if the underlying triangulation of the alpha shape is a periodic regular triangulation. +\cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation, + Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation} \cgalHasModel All models of `Kernel`. 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 8c3209da2e8..cca93a7c829 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 @@ -25,7 +25,7 @@ merged. We only describe the additional requirements with respect to the `TriangulationDataStructure_2` concept. -\cgalRefines `TriangulationDataStructure_2` +\cgalRefines{TriangulationDataStructure_2} \cgalHasModel `CGAL::Triangulation_data_structure_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 8145923b669..a2ed0353ddd 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 @@ -12,7 +12,7 @@ refines the concept `ApolloniusGraphVertexBase_2`, by adding two vertex handles to the corresponding vertices for the next and previous level graphs. -\cgalRefines `ApolloniusGraphVertexBase_2` +\cgalRefines{ApolloniusGraphVertexBase_2} \cgalHeading{Types} 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 5ef6ff44848..5fa6db8c6e6 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 @@ -3,7 +3,7 @@ \ingroup PkgApolloniusGraph2Concepts \cgalConcept -\cgalRefines `TriangulationTraits_2` +\cgalRefines{TriangulationTraits_2} The concept `ApolloniusGraphTraits_2` provides the traits requirements for the `Apollonius_graph_2` class. In particular, 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 e25279179aa..201d7e9e91a 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 @@ -10,7 +10,7 @@ Apollonius site and provides access to one of its incident faces through a `Face_handle`. In addition, it maintains a container of sites. The container stores the hidden sites related to the vertex. -\cgalRefines `TriangulationVertexBase_2` +\cgalRefines{TriangulationVertexBase_2} \cgalHasModel `CGAL::Apollonius_graph_vertex_base_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 d80f20bbf3a..956aad8144f 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines Functor + * \cgalRefines{Functor} * * \cgalHasModel ArrangementApproximateTraits_2::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 3c1f816a207..66e4e53e898 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines Functor + * \cgalRefines{Functor} * * \cgalHasModel ArrangementXMonotoneTraits_2::Are_mergeable_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 1bb6de041b8..01f854b6426 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableTernaryFunction + * \cgalRefines{AdaptableTernaryFunction} * * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_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 4d66951502f..3a31719bb75 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableFunctor + * \cgalRefines{AdaptableFunctor} * * \cgalHasModel ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2 * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_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 8e38e97c686..4339c3f369d 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableFunctor + * \cgalRefines{AdaptableFunctor} * * \cgalHasModel ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2 * \cgalHasModel ArrangementClosedTopTraits_2::Compare_x_on_boundary_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 e93a6c0a657..413311319d6 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 @@ -2,7 +2,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableBinaryFunction + * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::Compare_x_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 f52b2204e5a..a485ec1a623 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableBinaryFunction + * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::Compare_xy_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 513e447d56c..5f50c695cea 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableTernaryFunction + * \cgalRefines{AdaptableTernaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_left_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 c4c925e9a17..670752239a7 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableTernaryFunction + * \cgalRefines{AdaptableTernaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_right_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 cabaa47827e..53bfaa49591 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableBinaryFunction + * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_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 57db167d757..f4bc83bd1a9 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableTernaryFunction + * \cgalRefines{AdaptableTernaryFunction} * * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_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 d01577defe1..117023bc832 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableBinaryFunction + * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModel ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2 * \cgalHasModel ArrangementClosedRightTraits_2::Compare_y_on_boundary_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 68c708c27af..72620babd22 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines Functor + * \cgalRefines{Functor} * * \cgalHasModel ArrangementConstructCurveTraits_2::Construct_curve_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 9ea422987a2..e5c4146c9fa 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableUnaryFunction + * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::Construct_max_vertex_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 c87fbde0a03..472c793d9f4 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableUnaryFunction + * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::Construct_min_vertex_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 0e8d4677407..6fc6381803a 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines Functor + * \cgalRefines{Functor} * * \cgalHasModel ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_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 38ccaa1be9b..d923f9b27db 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 @@ -5,9 +5,7 @@ namespace ArrTraits { * * represents a general planar curve. * - * \cgalRefines DefaultConstructible - * \cgalRefines CopyConstructible - * \cgalRefines Assignable + * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * \cgalHasModel ArrangementTraits_2::Curve_2 */ 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 1dfc0736077..41cf7e2f6c6 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableBinaryFunction + * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::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 036e21226bc..0350b6ce654 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines Functor + * \cgalRefines{Functor} * * \cgalHasModel ArrangementXMonotoneTraits_2::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 a1584b33c6e..47bba6ea744 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableUnaryFunction + * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModel ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_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 c63f98ab59b..d9a69236ee8 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableUnaryFunction + * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModel ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_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 744142e9fb9..1831b790c56 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableUnaryFunction + * \cgalRefines{AdaptableUnaryFunction} * * \cgalHasModel ArrangementBasicTraits_2::Is_vertical_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 a2fc977951f..db0df3c8cc8 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines Functor + * \cgalRefines{Functor} * * \cgalHasModel ArrangementTraits_2::Make_x_monotone_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 41b560fa101..8e61d8c7500 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines Functor + * \cgalRefines{Functor} * * \cgalHasModel ArrangementXMonotoneTraits_2::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 3c099c81476..a37db7c40f6 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableBinaryFunction + * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModel ArrangementVerticalSideTraits_2::Parameter_space_in_x_2 * \cgalHasModel ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_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 025d45da35d..0844ee649a4 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 @@ -3,7 +3,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines AdaptableBinaryFunction + * \cgalRefines{AdaptableBinaryFunction} * * \cgalHasModel ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2 * \cgalHasModel ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_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 ca9f706c614..78273b88947 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 @@ -5,9 +5,7 @@ namespace ArrTraits { * * Represents a point in the plane. * - * \cgalRefines DefaultConstructible - * \cgalRefines CopyConstructible - * \cgalRefines Assignable + * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * * \cgalHasModel ArrangementBasicTraits_2::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 08cf82d8f49..45210b92d0c 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 @@ -2,7 +2,7 @@ namespace ArrTraits { /*! \ingroup PkgArrangementOnSurface2ConceptsFunctionObjects * \cgalConcept * - * \cgalRefines Functor + * \cgalRefines{Functor} * * \cgalHasModel ArrangementXMonotoneTraits_2::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 14b758b64ef..6b23acac29d 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 @@ -4,9 +4,7 @@ namespace ArrTraits { * * Represents a planar (weakly) \f$x\f$-monotone curve. * - * \cgalRefines DefaultConstructible - * \cgalRefines CopyConstructible - * \cgalRefines Assignable + * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * * \cgalHasModel ArrangementBasicTraits_2::X_monotone_curve_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 e64fd76ca07..b92f249431b 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 @@ -6,7 +6,7 @@ The concept `ArrangementApproximateTraits_2` refines the basic traits concept `ArrangementBasicTraits_2`. A model of this concept is able to approximate a point. -\cgalRefines `ArrangementBasicTraits_2` +\cgalRefines{ArrangementBasicTraits_2} \cgalHasModel `CGAL::Arr_conic_traits_2` \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` 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 1f7c8483856..4b8cbbbf7c2 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 @@ -25,9 +25,7 @@ * `Bottom_side_category`, and `Top_side_category`. Each such type must be * convertible to the type `CGAL::Arr_oblivious_side_tag`. * - * \cgalRefines DefaultConstructible - * \cgalRefines CopyConstructible - * \cgalRefines Assignable + * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * * \cgalHasModel `CGAL::Arr_segment_traits_2` * \cgalHasModel `CGAL::Arr_non_caching_segment_basic_traits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBottomSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBottomSideTraits_2.h index d0d5df6846a..a29b1d33531 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBottomSideTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBottomSideTraits_2.h @@ -10,7 +10,7 @@ * boundary sides (that is, left, right, and top) are purposeful, and can have * models. * - * \cgalRefines `ArrangementHorizontalSideTraits_2` + * \cgalRefines{ArrangementHorizontalSideTraits_2} * * \sa `ArrangementLeftSideTraits_2`, * `ArrangementRightSideTraits_2`, and diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedBottomTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedBottomTraits_2.h index fcd6b4d81a1..37a519a7eca 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedBottomTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedBottomTraits_2.h @@ -8,7 +8,7 @@ * reach this boundary side. A model of this concept can handle curves that * reach the left boundary side when it is closed. * - * \cgalRefines `ArrangementBottomSideTraits_2` + * \cgalRefines{ArrangementBottomSideTraits_2} * * \sa `ArrangementClosedLeftTraits_2`, * `ArrangementClosedRightTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedLeftTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedLeftTraits_2.h index 67722a077a2..ec84ff22035 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedLeftTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedLeftTraits_2.h @@ -8,7 +8,7 @@ * this boundary side. A model of this concept can handle curves that reach the * left boundary side when it is closed. - * \cgalRefines `ArrangementLeftSideTraits_2` + * \cgalRefines{ArrangementLeftSideTraits_2} \sa `ArrangementClosedRightTraits_2`, `ArrangementClosedBottomTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedRightTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedRightTraits_2.h index 15d25b7c742..4b4dc18d53d 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedRightTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedRightTraits_2.h @@ -8,7 +8,7 @@ * this boundary side. A model of this concept can handle curves that reach the * right boundary side when it is closed. * - * \cgalRefines `ArrangementRightSideTraits_2` + * \cgalRefines{ArrangementRightSideTraits_2} * * \sa `ArrangementClosedLeftTraits_2`, * `ArrangementClosedBottomTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedTopTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedTopTraits_2.h index fa56a6a59e4..e03e3bfa938 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedTopTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementClosedTopTraits_2.h @@ -8,7 +8,7 @@ * this boundary side. A model of this concept can handle curves that reach the * top boundary side when it is closed. * - * \cgalRefines `ArrangementTopSideTraits_2` + * \cgalRefines{ArrangementTopSideTraits_2} * * \sa `ArrangementClosedLeftTraits_2`, * `ArrangementClosedRightTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h index c2b074cbe21..afc3942cba8 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 @@ -5,7 +5,7 @@ * traits concept `ArrangementBasicTraits_2`. A model of this concept is able * to construct a curve from two points. * - * \cgalRefines `ArrangementTraits_2` + * \cgalRefines{ArrangementTraits_2} * * \cgalHasModel `CGAL::Arr_conic_traits_2` * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h index dc7998ec0af..394f98f5a3b 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 @@ -5,7 +5,7 @@ * traits concept `ArrangementBasicTraits_2`. A model of this concept is able to * construct an \f$ x\f$-monotone curve from two points. * - * \cgalRefines `ArrangementBasicTraits_2` + * \cgalRefines{ArrangementBasicTraits_2} * * \cgalHasModel `CGAL::Arr_conic_traits_2` * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedBottomTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedBottomTraits_2.h index 0ef3e9c1f45..09de38a67c5 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedBottomTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedBottomTraits_2.h @@ -8,7 +8,7 @@ * expected to reach this boundary side. A model of this concept can handle * curves that reach the bottom boundary side when it is contracted. * - * \cgalRefines `ArrangementBottomSideTraits_2` + * \cgalRefines{ArrangementBottomSideTraits_2} * * \sa `ArrangementContractedLeftTraits_2`, * `ArrangementContractedRightTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedLeftTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedLeftTraits_2.h index 39d8aa7c182..9a06f1e409c 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedLeftTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedLeftTraits_2.h @@ -8,7 +8,7 @@ * expected to reach this boundary side. A model of this concept can handle * curves that reach the left boundary side when it is contracted. * - * \cgalRefines `ArrangementLeftSideTraits_2` + * \cgalRefines{ArrangementLeftSideTraits_2} * * \sa `ArrangementContractedRightTraits_2`, * `ArrangementContractedBottomTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedRightTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedRightTraits_2.h index 6e44953bc00..3f93d80deb2 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedRightTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedRightTraits_2.h @@ -8,7 +8,7 @@ * expected to reach this boundary side. A model of this concept can handle * curves that reach the right boundary side when it is contracted. * - * \cgalRefines `ArrangementRightSideTraits_2` + * \cgalRefines{ArrangementRightSideTraits_2} * * \sa `ArrangementContractedLeftTraits_2`, * `ArrangementContractedBottomTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedTopTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedTopTraits_2.h index 92ff014dfda..be39ea2b6b1 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedTopTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementContractedTopTraits_2.h @@ -8,7 +8,7 @@ * expected to reach this boundary side. A model of this concept can handle * curves that reach the top boundary side when it is contracted. * - * \cgalRefines `ArrangementTopSideTraits_2` + * \cgalRefines{ArrangementTopSideTraits_2} * * \sa `ArrangementContractedLeftTraits_2`, * `ArrangementContractedRightTraits_2`, 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 8c1f6db2d0d..88e4fff19f0 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 @@ -8,7 +8,7 @@ a policy clone idiom in form of a rebind struct-template. Instantiate a dcel class with many different possible types without ad-hoc limitations on type of the dcel classes. -\cgalRefines `ArrangementDcel` +\cgalRefines{ArrangementDcel} \cgalHasModel `CGAL::Arr_default_dcel` \cgalHasModel `CGAL::Arr_face_extended_dcel` 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 f6079dc6a6f..e659a3be297 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 @@ -9,7 +9,7 @@ * approach the remaining boundary sides (that is, left and right) are * purposeful, and can have models. * - * \cgalRefines `ArrangementBasicTraits_2` + * \cgalRefines{ArrangementBasicTraits_2} * * \cgalHasModel `CGAL::Arr_linear_traits_2` * \cgalHasModel `CGAL::Arr_rational_function_traits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementIdentifiedHorizontalTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementIdentifiedHorizontalTraits_2.h index e050e9e288e..1e8603639d0 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementIdentifiedHorizontalTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementIdentifiedHorizontalTraits_2.h @@ -6,7 +6,7 @@ * identified on the bottom and top sides and curves inserted into the * arrangement are expected to reach these boundary sides. * - * \cgalRefines `ArrangementBasicTraits_2` + * \cgalRefines{ArrangementBasicTraits_2} * * \sa `ArrangementIdentifiedVerticalTraits_2`, * `ArrangementOpenBottomTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementIdentifiedVerticalTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementIdentifiedVerticalTraits_2.h index e5cff1def05..f42663dd8da 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementIdentifiedVerticalTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementIdentifiedVerticalTraits_2.h @@ -6,7 +6,7 @@ * identified on the left and right sides and curves inserted into the * arrangement are expected to reach these boundary sides. * - * \cgalRefines `ArrangementBasicTraits_2` + * \cgalRefines{ArrangementBasicTraits_2} * * \sa `ArrangementIdentifiedHorizontalTraits_2`, * `ArrangementOpenLeftTraits_2`, 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 426a8ffee3b..cc66b479fbe 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 @@ -9,8 +9,7 @@ * `CGAL::Arrangement_2` class template, where the Traits parameter * is substituted with a model of this concept. * - * \cgalRefines `ArrangementApproximateTraits_2` and - * `ArrangementConstructXMonotoneCurveTraits_2` + * \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2} * * \cgalHasModel `CGAL::Arr_conic_traits_2` * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLeftSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLeftSideTraits_2.h index d33d87663c0..3b01d80db4f 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLeftSideTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLeftSideTraits_2.h @@ -10,7 +10,7 @@ * boundary sides (that is, right, bottom, and top) are purposeful, and can have * models. * - * \cgalRefines `ArrangementVerticalSideTraits_2` + * \cgalRefines{ArrangementVerticalSideTraits_2} * * \sa `ArrangementRightSideTraits_2`, * `ArrangementBottomSideTraits_2`, and diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBottomTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBottomTraits_2.h index ebf9395c7c7..c53f51ef056 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBottomTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBottomTraits_2.h @@ -8,7 +8,7 @@ * reach this boundary side. A model of this concept can handle curves that * reach the bottom boundary side when it is open. * - * \cgalRefines `ArrangementBottomSideTraits_2` + * \cgalRefines{ArrangementBottomSideTraits_2} * * \sa `ArrangementOpenLeftTraits_2`, * `ArrangementOpenRightTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h index d617129c29c..8190767e71c 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 @@ -37,7 +37,7 @@ * rectangle. When the parameter space is bounded, it is the exact geometric * embedding of the implicit bounding rectangle. * - * \cgalRefines `ArrangementBasicTraits_2` + * \cgalRefines{ArrangementBasicTraits_2} * * \cgalHasModel `CGAL::Arr_linear_traits_2` * \cgalHasModel `CGAL::Arr_rational_function_traits_2` diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenLeftTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenLeftTraits_2.h index 3c22b2edb2b..f1b7d62ca68 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenLeftTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenLeftTraits_2.h @@ -8,7 +8,7 @@ * this boundary side. A model of this concept can handle curves that reach the * left boundary side when it is open. * - * \cgalRefines `ArrangementLeftSideTraits_2` + * \cgalRefines{ArrangementLeftSideTraits_2} * * \sa `ArrangementOpenRightTraits_2`, * `ArrangementOpenBottomTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenRightTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenRightTraits_2.h index 865e6732d1c..fa8468d49dc 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenRightTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenRightTraits_2.h @@ -8,7 +8,7 @@ * this boundary side. A model of this concept can handle curves that reach the * right boundary side when it is open. * - * \cgalRefines `ArrangementRightSideTraits_2` + * \cgalRefines{ArrangementRightSideTraits_2} * * \sa `ArrangementOpenLeftTraits_2`, * `ArrangementOpenBottomTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenTopTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenTopTraits_2.h index 69eb18a96a1..455bef4d160 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenTopTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenTopTraits_2.h @@ -8,7 +8,7 @@ * this boundary side. A model of this concept can handle curves that reach the * top boundary side when it is open. * - * \cgalRefines `ArrangementTopSideTraits_2` + * \cgalRefines{ArrangementTopSideTraits_2} * * \sa `ArrangementOpenLeftTraits_2`, * `ArrangementOpenRightTraits_2`, diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementRightSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementRightSideTraits_2.h index 16395831d63..689d2b7af2d 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementRightSideTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementRightSideTraits_2.h @@ -10,7 +10,7 @@ * boundary sides (that is, left, bottom, and top) are purposeful, and can have * models. * - * \cgalRefines `ArrangementVerticalSideTraits_2` + * \cgalRefines{ArrangementVerticalSideTraits_2} * * \sa `ArrangementLeftSideTraits_2`, * `ArrangementBottomSideTraits_2`, and 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 bb81a8eb17f..87ff1eb159c 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 @@ -8,11 +8,8 @@ * space, the sphere is the mapping of which, is identified on the left and * right sides and contracted at the top and bottom sides. * - * \cgalRefines `ArrangementBasicTraits_2` - * \cgalRefines `ArrangementIdentifiedVerticalTraits_2` - * \cgalRefines `ArrangementContractedBottomTraits_2` - * \cgalRefines `ArrangementContractedTopTraits_2` - * \cgalRefines + * \cgalRefines{ArrangementBasicTraits_2,ArrangementIdentifiedVerticalTraits_2, + * ArrangementContractedBottomTraits_2,ArrangementContractedTopTraits_2} * * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2` * diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopSideTraits_2.h index 13123e1006b..94614dfc81a 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopSideTraits_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopSideTraits_2.h @@ -10,7 +10,7 @@ * boundary sides (that is, left, right, and bottom) are purposeful, and can * have models. * - * \cgalRefines `ArrangementHorizontalSideTraits_2` + * \cgalRefines{ArrangementHorizontalSideTraits_2} * * \sa `ArrangementLeftSideTraits_2`, * `ArrangementRightSideTraits_2`, and 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 da63fe4a11e..05bac54d5a2 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 @@ -28,7 +28,7 @@ arbitrary curves, which may be not \f$ x\f$-monotone must define the different types to allow proper dispatching of the free functions that accept such curves, such as `intsert()`. -\cgalRefines `ArrangementXMonotoneTraits_2` +\cgalRefines{ArrangementXMonotoneTraits_2} \cgalHasModel `CGAL::Arr_segment_traits_2` \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` 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 c82717702bd..cc36ec97ea6 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 @@ -9,7 +9,7 @@ * remaining boundary sides (that is, bottom and top) are purposeful, and can * have models. * - * \cgalRefines `ArrangementBasicTraits_2` + * \cgalRefines{ArrangementBasicTraits_2} * * \cgalHasModel `CGAL::Arr_linear_traits_2` * \cgalHasModel `CGAL::Arr_rational_function_traits_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 0e9a09101c4..fd879fad9a0 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 @@ -7,7 +7,7 @@ A model for the `ArrangementWithHistoryInputFormatter` concept supports a set of reading an arrangement-with-history instance from an input stream using a specific format. -\cgalRefines `ArrangementInputFormatter` +\cgalRefines{ArrangementInputFormatter} \cgalHasModel `CGAL::Arr_with_history_text_formatter` 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 3241f955cd5..e766c2cfc26 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 @@ -7,7 +7,7 @@ A model for the `ArrangementWithHistoryOutputFormatter` concept supports a set o writing an arrangement-with-history instance to an output stream using a specific format. -\cgalRefines `ArrangementOutputFormatter` +\cgalRefines{ArrangementOutputFormatter} \cgalHasModel `CGAL::Arr_with_history_text_formatter` 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 6d6d59c544b..5eae4b190c2 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 @@ -16,7 +16,7 @@ A model of this refined concept therefore needs to compute the intersections (and possibly overlaps) between two \f$ x\f$-monotone curves and to support curve splitting. -\cgalRefines `ArrangementBasicTraits_2` +\cgalRefines{ArrangementBasicTraits_2} \cgalHasModel `CGAL::Arr_segment_traits_2` \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2` diff --git a/BGL/doc/BGL/Concepts/EdgeListGraph.h b/BGL/doc/BGL/Concepts/EdgeListGraph.h index 685aed4fff5..3b614c86c07 100644 --- a/BGL/doc/BGL/Concepts/EdgeListGraph.h +++ b/BGL/doc/BGL/Concepts/EdgeListGraph.h @@ -9,7 +9,7 @@ The concept `EdgeListGraph` refines the concept Graph and adds the requirement for traversal of all edges in a graph. -\cgalRefines Graph +\cgalRefines{Graph} \cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink diff --git a/BGL/doc/BGL/Concepts/FaceGraph.h b/BGL/doc/BGL/Concepts/FaceGraph.h index 40346595ac6..b7ea012f4c9 100644 --- a/BGL/doc/BGL/Concepts/FaceGraph.h +++ b/BGL/doc/BGL/Concepts/FaceGraph.h @@ -18,7 +18,7 @@ A face descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompara \cgalAssociatedTypesEnd -\cgalRefines `HalfedgeGraph` +\cgalRefines{HalfedgeGraph} \cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink diff --git a/BGL/doc/BGL/Concepts/FaceListGraph.h b/BGL/doc/BGL/Concepts/FaceListGraph.h index d50e7a275f2..6e7936f5ad9 100644 --- a/BGL/doc/BGL/Concepts/FaceListGraph.h +++ b/BGL/doc/BGL/Concepts/FaceListGraph.h @@ -14,7 +14,7 @@ face iterator must be the same as the face descriptor of the graph. \cgalAssociatedTypesEnd -\cgalRefines `FaceGraph` +\cgalRefines{FaceGraph} \cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink diff --git a/BGL/doc/BGL/Concepts/HalfedgeGraph.h b/BGL/doc/BGL/Concepts/HalfedgeGraph.h index a6fc002b0aa..8a31a1a787a 100644 --- a/BGL/doc/BGL/Concepts/HalfedgeGraph.h +++ b/BGL/doc/BGL/Concepts/HalfedgeGraph.h @@ -34,8 +34,7 @@ An edge descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompar \cgalAssociatedTypesEnd -\cgalRefines `IncidenceGraph` -\cgalRefines `PropertyGraph` +\cgalRefines{IncidenceGraph,PropertyGraph} A model of `HalfedgeGraph` must have the interior property `vertex_point` attached to its vertices. diff --git a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h index 3d0f4cfdcfe..1019f3c336b 100644 --- a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h +++ b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h @@ -14,7 +14,7 @@ halfedge iterator must be the same as the halfedge descriptor of the graph. \cgalAssociatedTypesEnd -\cgalRefines `HalfedgeGraph` +\cgalRefines{HalfedgeGraph} \cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink diff --git a/BGL/doc/BGL/Concepts/MutableFaceGraph.h b/BGL/doc/BGL/Concepts/MutableFaceGraph.h index 7df4f7b4b5b..2ce0c981554 100644 --- a/BGL/doc/BGL/Concepts/MutableFaceGraph.h +++ b/BGL/doc/BGL/Concepts/MutableFaceGraph.h @@ -5,8 +5,7 @@ The concept `MutableFaceGraph` refines the concepts `FaceGraph` and `MutableHalfedgeGraph` and adds the requirement for operations to add faces and to modify face-halfedge relations. -\cgalRefines `FaceGraph` -\cgalRefines `MutableHalfedgeGraph` +\cgalRefines{FaceGraph,MutableHalfedgeGraph} \cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink diff --git a/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h b/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h index 8ea1da9f561..5ce56824a5a 100644 --- a/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h +++ b/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h @@ -6,7 +6,7 @@ The concept `MutableHalfedgeGraph` refines the concept `HalfedgeGraph` and adds the requirements for operations to add vertices and edges, and to update the incidence information between vertices and halfedges. -\cgalRefines `HalfedgeGraph` +\cgalRefines{HalfedgeGraph} \cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink diff --git a/BGL/doc/BGL/Concepts/VertexListGraph.h b/BGL/doc/BGL/Concepts/VertexListGraph.h index 0b030083492..aa88a4d1944 100644 --- a/BGL/doc/BGL/Concepts/VertexListGraph.h +++ b/BGL/doc/BGL/Concepts/VertexListGraph.h @@ -9,7 +9,7 @@ The concept `VertexListGraph` refines the concept Graph and adds the requirement for traversal of all vertices in a graph. -\cgalRefines Graph +\cgalRefines{Graph} \cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink 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 972825d1bf8..c1f77e40a82 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 @@ -3,7 +3,7 @@ namespace ArrDirectionalTraits { \ingroup PkgBooleanSetOperations2Concepts \cgalConcept -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2` @@ -31,4 +31,4 @@ ArrDirectionalTraits::X_monotone_curve_2 xc2); }; /* end ArrDirectionalTraits::AreMergeable_2 */ -} \ No newline at end of file +} 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 ff77632107f..336b992999d 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 @@ -4,7 +4,7 @@ namespace ArrDirectionalTraits { \ingroup PkgBooleanSetOperations2Concepts \cgalConcept -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2` 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 3b9248da871..5e8c9d034a4 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 @@ -4,7 +4,7 @@ namespace ArrDirectionalTraits { \ingroup PkgBooleanSetOperations2Concepts \cgalConcept -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2` 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 ec0153358c7..0d90fbacb2f 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 @@ -3,7 +3,7 @@ namespace ArrDirectionalTraits { \ingroup PkgBooleanSetOperations2Concepts \cgalConcept -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Intersect_2` 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 49023ab8810..673b60c589b 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 @@ -3,7 +3,7 @@ namespace ArrDirectionalTraits { \ingroup PkgBooleanSetOperations2Concepts \cgalConcept -\cgalRefines `AdaptableBinaryFunction` +\cgalRefines{AdaptableBinaryFunction} \cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Merge_2` 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 7e8499c446c..108eb017796 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 @@ -3,7 +3,7 @@ namespace ArrDirectionalTraits { \ingroup PkgBooleanSetOperations2Concepts \cgalConcept -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Split_2` @@ -34,4 +34,4 @@ ArrDirectionalTraits::X_monotone_curve_2& xc2); }; /* end ArrDirectionalTraits::Split_2 */ -} \ No newline at end of file +} 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 20ef75870ff..62ce1fb841f 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 @@ -14,7 +14,7 @@ If the traits class is also a model of also required to have a direction, namely one of these two endpoint serves as its source and the other as its target. -\cgalRefines `ArrangementXMonotoneTraits_2` +\cgalRefines{ArrangementXMonotoneTraits_2} \cgalHasModel `CGAL::Arr_segment_traits_2` \cgalHasModel `CGAL::Arr_non_caching_segment_traits_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 9b39e730240..ec5f5909ce3 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 @@ -14,7 +14,7 @@ the `Halfedge` and `Face` types being models of the concepts `GeneralPolygonSetDcelHalfedge` and `GeneralPolygonSetDcelFace` respectively -\cgalRefines `ArrangementDcel` +\cgalRefines{ArrangementDcel} \cgalHasModel `CGAL::Gps_default_dcel` 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 c97aec19a9c..e33f52f2219 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 @@ -7,7 +7,7 @@ A face record in a \em Dcel data structure used by the `General_polygon_set_2` and `Polygon_set_2` template classes to represent the underlying internal `Arrangement_2` data structure. -\cgalRefines `ArrangementDcelFace` +\cgalRefines{ArrangementDcelFace} \cgalHasModel `CGAL::Gps_face_base` 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 111c71d5be7..7334559a7ef 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 @@ -6,7 +6,7 @@ A halfedge record in a \em Dcel data structure used by the `General_polygon_set_2` and `Polygon_set_2` template classes to represent the underlying internal `Arrangement_2` data structure. -\cgalRefines `ArrangementDcelHalfedge` +\cgalRefines{ArrangementDcelHalfedge} \cgalHasModel `CGAL::Gps_face_halfedge` 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 86f4cc299da..99001c39f1c 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 @@ -11,7 +11,7 @@ a type that represents a general polygon and another one that represents general polygon with holes. It also requires operations that operate on these types. -\cgalRefines `ArrangementDirectionalXMonotoneTraits_2` +\cgalRefines{ArrangementDirectionalXMonotoneTraits_2} \cgalHasModel `CGAL::Gps_segment_traits_2` \cgalHasModel `CGAL::Gps_circle_segment_traits_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 0966bde729b..2a46c3470bd 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 @@ -3,7 +3,7 @@ \ingroup PkgBooleanSetOperations2Concepts \cgalConcept -\cgalRefines `GpsTraitsGeneralPolygon_2` +\cgalRefines{GpsTraitsGeneralPolygon_2} A model of this concept represents a simple general-polygon. The geometric mapping of the edges of the polygon must be \f$ x\f$-monotone curves. 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 729c28a35e9..842290bb47f 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 @@ -5,9 +5,7 @@ A model of this concept represents a general polygon with holes. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalGeneralizes `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 7fb8ac36765..99324d14227 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 @@ -5,9 +5,7 @@ A model of this concept represents a simple general polygon. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalGeneralizes `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 0ac583cb7f4..d026e62b587 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 @@ -6,9 +6,7 @@ This concept defines the requirements for traits classes of `CGAL::Approximate_min_ellipsoid_d`. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Approximate_min_ellipsoid_d_traits_2` \cgalHasModel `CGAL::Approximate_min_ellipsoid_d_traits_3` 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 77e31af2333..7d28f370fc8 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 @@ -8,7 +8,7 @@ with a default traits class that assumes that the boxes are a model of this `BoxIntersectionBox_d` concept. This concept defines the access functions to the dimension, the `id`-number, and the boundaries of the box. -\cgalRefines `Assignable` +\cgalRefines{Assignable} \cgalHasModel CGAL::Box_intersection_d::Box_d \cgalHasModel CGAL::Box_intersection_d::Box_with_handle_d 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 9e703546d80..03300e29d64 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 @@ -7,8 +7,7 @@ sequences of iso-oriented boxes. This concept defines the access functions to the dimension, the `id`-number, and the boundaries of the boxes manipulated in these algorithms. -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{Assignable,DefaultConstructible} \cgalHasModel CGAL::Box_intersection_d::Box_traits_d 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 c0c2127bdae..322134ed592 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 @@ -9,9 +9,7 @@ of circles, whose center's coordinates, as well as the square of the radius, are of a type that is a model of the concept `FieldNumberType`. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel CGAL::Polynomial_for_circles_2_2 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 ca449949626..a017fef7163 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 @@ -7,9 +7,7 @@ Concept to represent bivariate polynomials of degree 1 whose coefficients are of a type that is a model of the concept `RingNumberType`. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel CGAL::Polynomial_1_2 diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--BoundedSide_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--BoundedSide_2.h index 4fe0a063468..2f522044c53 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--BoundedSide_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--BoundedSide_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::BoundedSide_2` +\cgalRefines{Kernel::BoundedSide_2} \sa `CircularKernel::HasOnBoundedSide_2` \sa `CircularKernel::HasOnUnboundedSide_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h index a5b9d2309e0..add345ad6ff 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 @@ -5,9 +5,7 @@ Concept for points on circles, circular arcs or line arcs. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Circular_arc_point_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 f4b96d13896..34f8cef50e2 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 @@ -5,9 +5,7 @@ Concept for arcs of circles. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Circular_arc_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareXY_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareXY_2.h index 049ba805721..64717a66455 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareXY_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareXY_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::CompareXY_2` +\cgalRefines{Kernel::CompareXY_2} \sa `CircularKernel::CompareX_2` \sa `CircularKernel::CompareY_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareX_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareX_2.h index 82199174d21..c80728dab67 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareX_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareX_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::CompareX_2` +\cgalRefines{Kernel::CompareX_2} \sa `CircularKernel::CompareY_2` \sa `CircularKernel::CompareXY_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareY_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareY_2.h index 96dd144986e..866ddde00ed 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareY_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CompareY_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::CompareY_2` +\cgalRefines{Kernel::CompareY_2} \sa `CircularKernel::CompareX_2` \sa `CircularKernel::CompareXY_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructBbox_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructBbox_2.h index e91b15e507b..d6e999f0aa0 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructBbox_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructBbox_2.h @@ -5,7 +5,7 @@ A function object concept to construct a bounding box of geometric objects: -\cgalRefines Kernel::ConstructBbox_2 +\cgalRefines{Kernel::ConstructBbox_2} */ diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructCircle_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructCircle_2.h index 6e36d4863ed..963e2850b08 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructCircle_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructCircle_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::ConstructCircle_2` +\cgalRefines{Kernel::ConstructCircle_2} \sa `CircularKernel::GetEquation` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructLine_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructLine_2.h index c585d4d49f5..af440398ecc 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructLine_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--ConstructLine_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::ConstructLine_2` +\cgalRefines{Kernel::ConstructLine_2} \sa `CircularKernel::GetEquation` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--DoIntersect_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--DoIntersect_2.h index 42ebf7de795..fa89125974e 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--DoIntersect_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--DoIntersect_2.h @@ -5,7 +5,7 @@ Testing whether two curves intersect. -\cgalRefines `Kernel::DoIntersect_2` +\cgalRefines{Kernel::DoIntersect_2} \sa \link do_intersect_grp `CGAL::do_intersect()` \endlink diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--Equal_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--Equal_2.h index 35f5da60409..7c0494c296e 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--Equal_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--Equal_2.h @@ -5,7 +5,7 @@ Testing equality between objects. -\cgalRefines `Kernel::Equal_2` +\cgalRefines{Kernel::Equal_2} \sa `CircularKernel::CompareX_2` \sa `CircularKernel::CompareY_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOnBoundedSide_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOnBoundedSide_2.h index 691906fd50c..aaf61364475 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOnBoundedSide_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOnBoundedSide_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::HasOnBoundedSide_2` +\cgalRefines{Kernel::HasOnBoundedSide_2} \sa `CircularKernel::BoundedSide_2` \sa `CircularKernel::HasOnUnboundedSide_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOnUnboundedSide_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOnUnboundedSide_2.h index 2988791ce15..367fc274a64 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOnUnboundedSide_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOnUnboundedSide_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::HasOnUnboundedSide_2` +\cgalRefines{Kernel::HasOnUnboundedSide_2} \sa `CircularKernel::BoundedSide_2` \sa `CircularKernel::HasOnBoundedSide_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOn_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOn_2.h index 01bd12e7dd0..3b180f46c3e 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOn_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--HasOn_2.h @@ -5,7 +5,7 @@ To test whether a point lies on a curve. -\cgalRefines `Kernel::HasOn_2` +\cgalRefines{Kernel::HasOn_2} */ class CircularKernel::HasOn_2 { diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--Intersect_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--Intersect_2.h index 16bfb06b4df..1cdf8d0517f 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--Intersect_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--Intersect_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::Intersect_2` +\cgalRefines{Kernel::Intersect_2} \sa \link intersection_grp `CGAL::intersection()` \endlink diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--IsVertical_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--IsVertical_2.h index 732cad52b7e..999c3f53549 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--IsVertical_2.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--IsVertical_2.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel::IsVertical_2` +\cgalRefines{Kernel::IsVertical_2} */ class CircularKernel::IsVertical_2 { 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 1d4961a5f38..0400dd4bade 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 @@ -7,9 +7,7 @@ Concept for line segments supported by a line that is a model of `Kernel::Line_2` and whose endpoints are models of the `CircularKernel::CircularArcPoint_2` concept. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Line_arc_2` diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h index a4dd44be0fd..681d46d9679 100644 --- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h +++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel2GeometricConcepts \cgalConcept -\cgalRefines `Kernel` +\cgalRefines{Kernel} \cgalHasModel `CGAL::Circular_kernel_2` \cgalHasModel `CGAL::Exact_circular_kernel_2` 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 fc6919d1206..54db59349fc 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 @@ -9,9 +9,7 @@ of spheres, whose center's coordinates, as well as the square of the radius, are of a type that is a model of the concept `FieldNumberType`. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel CGAL::Polynomial_for_spheres_2_3 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 b2315881a94..023c13ebc20 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 @@ -7,9 +7,7 @@ Concept to represent trivariate polynomials of degree 1 whose coefficients are of a type that is a model of the concept `RingNumberType`. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel CGAL::Polynomial_1_3 diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForCircles_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForCircles_3.h index 56b00143606..2f1093ba78c 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForCircles_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForCircles_3.h @@ -6,9 +6,7 @@ Concept to represent a system of polynomials on `FieldNumberType` capable of storing equations of circles. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \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 2e96ac10ede..df2b2ee627b 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 @@ -6,9 +6,7 @@ Concept to represent a system of polynomials on `FieldNumberType` capable of storing equations of lines. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel CGAL::Polynomials_for_lines_3 diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--BoundedSide_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--BoundedSide_3.h index 18e1fee3248..41bf30f066e 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--BoundedSide_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--BoundedSide_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::BoundedSide_3` +\cgalRefines{Kernel::BoundedSide_3} \sa `SphericalKernel::HasOnBoundedSide_3` \sa `SphericalKernel::HasOnUnboundedSide_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h index 65cf545a758..4a4494bc216 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 @@ -5,9 +5,7 @@ Concept for points on spheres, circles, circular arcs or line arcs. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Circular_arc_point_3` 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 07b5f8c9129..ffefeb6aefb 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 @@ -5,9 +5,7 @@ Concept for arcs of circles. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Circular_arc_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareXYZ_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareXYZ_3.h index 9c973dd7b1b..9dc55894376 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareXYZ_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareXYZ_3.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel3GeometricConcepts \cgalConcept -\cgalRefines `Kernel::CompareXYZ_3` +\cgalRefines{Kernel::CompareXYZ_3} \sa `SphericalKernel::CompareX_3` \sa `SphericalKernel::CompareY_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareXY_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareXY_3.h index b1cdc0c5aba..80061879710 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareXY_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareXY_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::CompareXY_3` +\cgalRefines{Kernel::CompareXY_3} \sa `SphericalKernel::CompareX_3` \sa `SphericalKernel::CompareY_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareX_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareX_3.h index 94973b8988d..b9dac20ddd1 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareX_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareX_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::CompareX_3` +\cgalRefines{Kernel::CompareX_3} \sa `SphericalKernel::CompareY_3` \sa `SphericalKernel::CompareZ_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareY_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareY_3.h index f2ac72661ec..2599e4d2b17 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareY_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareY_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::CompareY_3` +\cgalRefines{Kernel::CompareY_3} \sa `SphericalKernel::CompareX_3` \sa `SphericalKernel::CompareZ_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareZ_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareZ_3.h index 4dd2a9b1d01..bbc40c24da1 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareZ_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CompareZ_3.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel3GeometricConcepts \cgalConcept -\cgalRefines `Kernel::CompareZ_3` +\cgalRefines{Kernel::CompareZ_3} \sa `SphericalKernel::CompareX_3` \sa `SphericalKernel::CompareY_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ComputeApproximateSquaredLength_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ComputeApproximateSquaredLength_3.h index d5ea290aad2..d37d38691c9 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ComputeApproximateSquaredLength_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ComputeApproximateSquaredLength_3.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel3GeometricConcepts \cgalConcept -\cgalRefines `Kernel::ComputeApproximateSquaredLength_3` +\cgalRefines{Kernel::ComputeApproximateSquaredLength_3} */ diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructBbox_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructBbox_3.h index 63ad9be4645..a26135c41f9 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructBbox_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructBbox_3.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel3GeometricConcepts \cgalConcept -\cgalRefines Kernel::ConstructBbox_3 +\cgalRefines{Kernel::ConstructBbox_3} */ diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructLine_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructLine_3.h index 303cdb0df13..634d35c61fd 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructLine_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructLine_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::ConstructLine_3` +\cgalRefines{Kernel::ConstructLine_3} \sa `SphericalKernel::GetEquation` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructPlane_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructPlane_3.h index 64cce14141e..82e33677614 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructPlane_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructPlane_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::ConstructPlane_3` +\cgalRefines{Kernel::ConstructPlane_3} \sa `SphericalKernel::GetEquation` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructSphere_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructSphere_3.h index 4bd4855859b..dea4257ec62 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructSphere_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--ConstructSphere_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::ConstructSphere_3` +\cgalRefines{Kernel::ConstructSphere_3} \sa `SphericalKernel::GetEquation` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--DoIntersect_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--DoIntersect_3.h index ec3c844a002..7f83899646e 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--DoIntersect_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--DoIntersect_3.h @@ -5,7 +5,7 @@ \brief Testing whether two curves or surfaces intersect. -\cgalRefines `Kernel::DoIntersect_3` +\cgalRefines{Kernel::DoIntersect_3} \sa \link do_intersect_grp `CGAL::do_intersect()` \endlink diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--Equal_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--Equal_3.h index 4ef95a25365..2cb9c231076 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--Equal_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--Equal_3.h @@ -5,7 +5,7 @@ Testing equality between objects. -\cgalRefines `Kernel::Equal_3` +\cgalRefines{Kernel::Equal_3} \sa `SphericalKernel::CompareX_3` \sa `SphericalKernel::CompareY_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOnBoundedSide_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOnBoundedSide_3.h index 4f3e7b42c76..37f8129c34e 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOnBoundedSide_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOnBoundedSide_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::HasOnBoundedSide_3` +\cgalRefines{Kernel::HasOnBoundedSide_3} \sa `SphericalKernel::BoundedSide_3` \sa `SphericalKernel::HasOnUnboundedSide_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOnUnboundedSide_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOnUnboundedSide_3.h index 05998c56903..15aec31b4f9 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOnUnboundedSide_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOnUnboundedSide_3.h @@ -5,7 +5,7 @@ \brief -\cgalRefines `Kernel::HasOnUnboundedSide_3` +\cgalRefines{Kernel::HasOnUnboundedSide_3} \sa `SphericalKernel::BoundedSide_3` \sa `SphericalKernel::HasOnBoundedSide_3` diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOn_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOn_3.h index 7ecb6f3f3a7..984798fc609 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOn_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--HasOn_3.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel3GeometricConcepts \cgalConcept -\cgalRefines `Kernel::HasOn_3` +\cgalRefines{Kernel::HasOn_3} */ class SphericalKernel::HasOn_3 { public: diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--Intersect_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--Intersect_3.h index ccd903ef013..b3b1a55a10a 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--Intersect_3.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--Intersect_3.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel3GeometricConcepts \cgalConcept -\cgalRefines `Kernel::Intersect_3` +\cgalRefines{Kernel::Intersect_3} \sa \link intersection_grp `CGAL::intersection()` \endlink */ 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 a62f183035b..5ea1f9aed8e 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 @@ -7,9 +7,7 @@ Concept for line segments supported by a line that is a model of `Kernel::Line_3`, and whose endpoints are models of the `SphericalKernel::CircularArcPoint_3` concept. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Line_arc_3` 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 66498784fd2..950115d7c73 100644 --- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h +++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h @@ -3,7 +3,7 @@ \ingroup PkgCircularKernel3GeometricConcepts \cgalConcept -\cgalRefines `Kernel` +\cgalRefines{Kernel} \cgalHasModel `CGAL::Spherical_kernel_3` \cgalHasModel CGAL::Exact_spherical_kernel_3 diff --git a/Circulator/doc/Circulator/Concepts/ConstHandle.h b/Circulator/doc/Circulator/Concepts/ConstHandle.h index ec0a668ee40..3552dc5cb29 100644 --- a/Circulator/doc/Circulator/Concepts/ConstHandle.h +++ b/Circulator/doc/Circulator/Concepts/ConstHandle.h @@ -5,7 +5,7 @@ A constant handle. Refer to the `Handle` concept for more details. -\cgalRefines Descriptor +\cgalRefines{Descriptor} \cgalHasModel const T* (const pointers) diff --git a/Circulator/doc/Circulator/Concepts/ConstRange.h b/Circulator/doc/Circulator/Concepts/ConstRange.h index 8e3360e2acb..b690c3d97d3 100644 --- a/Circulator/doc/Circulator/Concepts/ConstRange.h +++ b/Circulator/doc/Circulator/Concepts/ConstRange.h @@ -5,7 +5,7 @@ A constant iterator range. Refer to the `Range` concept for more details. -\cgalRefines Boost's Range concept +\cgalRefinesBare{Boost's %Range concept} \cgalHasModel STL containers \cgalHasModel `boost::iterator_range` diff --git a/Circulator/doc/Circulator/Concepts/Handle.h b/Circulator/doc/Circulator/Concepts/Handle.h index 131b18b881e..748ab737efb 100644 --- a/Circulator/doc/Circulator/Concepts/Handle.h +++ b/Circulator/doc/Circulator/Concepts/Handle.h @@ -16,7 +16,7 @@ Like iterators, the handle can be passed as template argument to the type of the element pointed to. The `iterator_category` is `void`. -\cgalRefines Descriptor +\cgalRefines{Descriptor} The default constructed object must be unique as far as the equality operator is concerned (this serves the same purpose as NULL for pointers). diff --git a/Circulator/doc/Circulator/Concepts/Range.h b/Circulator/doc/Circulator/Concepts/Range.h index 40f8dda0c5c..2da31fa5940 100644 --- a/Circulator/doc/Circulator/Concepts/Range.h +++ b/Circulator/doc/Circulator/Concepts/Range.h @@ -29,8 +29,7 @@ Finally, let us note that ranges, in general (especially in template context) need to be passed and returned by (const) reference for efficiency. This is a difference with iterators which are typically passed by value. -\cgalRefines `ConstRange` -\cgalRefines Boost's Range concept +\cgalRefinesBare{ConstRange,Boost's %Range concept} \cgalHasModel STL containers diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h index 007d8b424c5..03f492d1b08 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h +++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h @@ -4,7 +4,7 @@ The concept `CombinatorialMap` defines a d-dimensional combinatorial map. -\cgalRefines `GenericMap` +\cgalRefines{GenericMap} \cgalHasModel \link CGAL::Combinatorial_map `CGAL::Combinatorial_map`\endlink diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h index 530aa1a2b80..ae828e3cdf0 100644 --- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h +++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h @@ -4,7 +4,7 @@ The concept `GenericMap` defines a d-dimensional generic map. This concept is defined only to factorize the common notions between \link CombinatorialMap `CombinatorialMap`\endlink and \link GeneralizedMap `GeneralizedMap`\endlink concepts. -\cgalRefines DefaultConstructible +\cgalRefines{DefaultConstructible} A generic map has a set of darts D, and functions \f$ f_0\f$,\f$ \ldots\f$,\f$ f_{d}\f$ that link these darts between them. diff --git a/Documentation/doc/Documentation/General.txt b/Documentation/doc/Documentation/General.txt index f1de55dcdc2..f35f45139c2 100644 --- a/Documentation/doc/Documentation/General.txt +++ b/Documentation/doc/Documentation/General.txt @@ -39,7 +39,7 @@ class AdaptableFunctor {}; /// \cgalConcept /// Adaptable functor with one argument -/// \cgalRefines AdaptableFunctor +/// \cgalRefines{AdaptableFunctor} class AdaptableUnaryFunction { public: @@ -53,7 +53,7 @@ public: /// \cgalConcept /// Adaptable functor with two arguments -/// \cgalRefines AdaptableFunctor +/// \cgalRefines{AdaptableFunctor} class AdaptableBinaryFunction { public: @@ -69,7 +69,7 @@ public: /// \cgalConcept /// Adaptable functor with three arguments -/// \cgalRefines AdaptableFunctor +/// \cgalRefines{AdaptableFunctor} class AdaptableTernaryFunction { public: diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in index e81e84db8ac..69351ed254e 100644 --- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in @@ -298,9 +298,14 @@ ALIASES = "cgal=%CGAL" \ "cgalFigureCaptionEnd=\htmlonly
\endhtmlonly" \ "cgalConcept=\details
\n \brief" \ "cgalConceptNamespace=\details
\n \brief" \ - "cgalRefines=Refines:" \ - "cgalRefines{1}=@cgalRefines @c \1." \ - "cgalRefines{3}=@cgalRefines @c \1, @c \2 and @c \3." \ + "cgalRefines=Refines" \ + "cgalRefines{1}=
@cgalRefines
@c \1
" \ + "cgalRefines{2}=
@cgalRefines
@c \1
@c \2
" \ + "cgalRefines{3}=
@cgalRefines
@c \1
@c \2
@c \3
" \ + "cgalRefines{4}=
@cgalRefines
@c \1
@c \2
@c \3
@c \4
" \ + "cgalRefines{5}=
@cgalRefines
@c \1
@c \2
@c \3
@c \4
@c \5
" \ + "cgalRefinesBare{1}=
@cgalRefines
\1
" \ + "cgalRefinesBare{2}=
@cgalRefines
@c \1
\2
" \ "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \ "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \ "cgalHasModel=\xrefitem hasModels \"Has Models\" \"Has Model Relationships\"" \ diff --git a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in index 161b4edc538..70267fd649d 100644 --- a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in @@ -280,10 +280,14 @@ ALIASES += "cgalFigureCaptionEnd=\htmlonly \endhtmlonly
" # thus removes its include statement ALIASES += "cgalConcept=\details
\n \brief" ALIASES += "cgalConceptNamespace=\details
\n \brief" - -ALIASES += "cgalRefines=Refines:" \ -ALIASES += "cgalRefines{1}=@cgalRefines @c \1." \ -ALIASES += "cgalRefines{3}=@cgalRefines @c \1, @c \2 and @c \3." \ +ALIASES += "cgalRefines=Refines" +ALIASES += "cgalRefines{1}=
@cgalRefines
@c \1
" +ALIASES += "cgalRefines{2}=
@cgalRefines
@c \1
@c \2
" +ALIASES += "cgalRefines{3}=
@cgalRefines
@c \1
@c \2
@c \3
" +ALIASES += "cgalRefines{4}=
@cgalRefines
@c \1
@c \2
@c \3
@c \4
" +ALIASES += "cgalRefines{5}=
@cgalRefines
@c \1
@c \2
@c \3
@c \4
@c \5
" +ALIASES += "cgalRefinesBare{1}=
@cgalRefines
\1
" +ALIASES += "cgalRefinesBare{2}=
@cgalRefines
@c \1
\2
" ALIASES += "cgalRequires=\xrefitem requires \"Requires\" \"Type Requirements\"" ALIASES += "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" ALIASES += "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" diff --git a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in index 7c66b30ccad..3fcdb56be68 100644 --- a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in @@ -321,9 +321,14 @@ ALIASES = "cgal=%CGAL" \ "cgalFigureCaptionEnd=\htmlonly[block] \endhtmlonly
" \ "cgalConcept=\details
^^ \brief" \ "cgalConceptNamespace=\details
^^ \brief" \ - "cgalRefines=Refines:" \ - "cgalRefines{1}=@qualifier \"\1\" ^^ @cgalRefines @c \1." \ - "cgalRefines{3}=@qualifier \"\1\" ^^ @qualifier \"\2\" ^^ @qualifier \"\3\" ^^ @cgalRefines @c \1, @c \2 and @c \3." \ + "cgalRefines=Refines" \ + "cgalRefines{1}=
@cgalRefines
@c \1
" \ + "cgalRefines{2}=
@cgalRefines
@c \1
@c \2
" \ + "cgalRefines{3}=
@cgalRefines
@c \1
@c \2
@c \3
" \ + "cgalRefines{4}=
@cgalRefines
@c \1
@c \2
@c \3
@c \4
" \ + "cgalRefines{5}=
@cgalRefines
@c \1
@c \2
@c \3
@c \4
@c \5
" \ + "cgalRefinesBare{1}=
@cgalRefines
\1
" \ + "cgalRefinesBare{2}=
@cgalRefines
@c \1
\2
" \ "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \ "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \ "cgalHasModel=\xrefitem hasModels \"Has Models\" \"Has Model Relationships\"" \ diff --git a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h index c53b330bca7..47b1f729035 100644 --- a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h +++ b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h @@ -14,7 +14,7 @@ respectively, and some constructions and predicates on these types. Note however, that these operations usually involve the projection of 3D objects onto the \f$ xy\f$-plane. -\cgalRefines `ArrangementXMonotoneTraits_2` +\cgalRefines{ArrangementXMonotoneTraits_2} \cgalHasModel `CGAL::Env_triangle_traits_3` \cgalHasModel `CGAL::Env_sphere_traits_3` diff --git a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h index 172e2481899..91c430a9d91 100644 --- a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h +++ b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h @@ -4,7 +4,7 @@ The concept `GeneralizedMap` defines a d-dimensional generalized map. -\cgalRefines `GenericMap` +\cgalRefines{GenericMap} \cgalHasModel \link CGAL::Generalized_map `CGAL::Generalized_map`\endlink diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h index 897e2292504..5a405bb7770 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h @@ -21,8 +21,7 @@ halfedge data structure they must be derived from a base class `Base` where the modifying member functions are still public. (The protection can be bypassed by the user, but not by accident.) -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,DefaultConstructible} \cgalHasModel `CGAL::HalfedgeDS_face_base` \cgalHasModel `CGAL::HalfedgeDS_face_min_base` diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h index c8f23d4ce2f..172b6b933f1 100644 --- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h +++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h @@ -21,8 +21,7 @@ halfedge data structure they must be derived from a base class `Base` where the modifying member functions are still public. (The protection could be bypassed by an user, but not by accident.) -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,DefaultConstructible} \cgalHasModel `CGAL::HalfedgeDS_vertex_base` \cgalHasModel `CGAL::HalfedgeDS_vertex_min_base` 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 0406a5c8416..5d2d5a39e3e 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 @@ -5,7 +5,7 @@ \ingroup PkgHyperbolicTriangulation2Concepts \cgalConcept -\cgalRefines DelaunayTriangulationTraits_2 +\cgalRefines{DelaunayTriangulationTraits_2} The concept `HyperbolicDelaunayTriangulationTraits_2` describes the set of requirements to be fulfilled by any class used to instantiate the first template parameter of the class 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 a472fde6d31..368630cc55b 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 @@ -32,7 +32,7 @@ public: \ingroup PkgHyperbolicTriangulation2Concepts \cgalConcept -\cgalRefines TriangulationFaceBase_2 +\cgalRefines{TriangulationFaceBase_2} The concept `HyperbolicTriangulationFaceBase_2` describes the requirements for the base face class of a hyperbolic triangulation data structure. diff --git a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h index 2b59a48ca23..d7fa271e560 100644 --- a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h +++ b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h @@ -6,9 +6,7 @@ namespace Kernel { A type representing circles in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Circle_2` @@ -38,9 +36,7 @@ public: A type representing circles in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Circle_3` @@ -69,9 +65,7 @@ public: A type representing directions in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Direction_2` @@ -95,9 +89,7 @@ public: A type representing directions in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Direction_3` @@ -117,9 +109,7 @@ public: A type representing isocuboids in three dimensions. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Iso_cuboid_3` @@ -144,9 +134,7 @@ public: A type representing iso-rectangles in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Iso_rectangle_2` @@ -178,9 +166,7 @@ public: A type representing straight lines (and halfspaces) in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Line_2` @@ -216,9 +202,7 @@ public: A type representing straight lines in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Line_3` @@ -249,9 +233,7 @@ public: \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Object` @@ -272,9 +254,7 @@ public: \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Object` @@ -293,9 +273,7 @@ public: A type representing planes (and half-spaces) in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Plane_3` @@ -332,9 +310,7 @@ public: A type representing points in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Point_2` @@ -393,9 +369,7 @@ public: A type representing points in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Point_3` @@ -456,9 +430,7 @@ public: A type representing rays in two dimensions. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Ray_2` @@ -490,9 +462,7 @@ public: A type representing rays in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Ray_3` @@ -520,9 +490,7 @@ public: A type representing segments in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Segment_2` @@ -556,9 +524,7 @@ public: A type representing segments in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Segment_3` @@ -588,9 +554,7 @@ public: A type representing spheres in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Sphere_3` @@ -620,9 +584,7 @@ public: A type representing tetrahedra in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Tetrahedron_3` @@ -653,9 +615,7 @@ public: A type representing triangles in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Triangle_2` @@ -688,9 +648,7 @@ public: A type representing triangles in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Triangle_3` @@ -715,9 +673,7 @@ public: A type representing vectors in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Vector_2` @@ -750,9 +706,7 @@ public: A type representing vectors in three dimensions. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Vector_3` @@ -788,9 +742,7 @@ public: A type representing weighted points in two dimensions. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Weighted_point_2` @@ -817,9 +769,7 @@ public: A type representing weighted points in three dimensions. -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Weighted_point_3` diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h index 20a9138097f..c951a0735ef 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h @@ -6,9 +6,7 @@ A type representing an iterator to the Cartesian coordinates of a point in `d` dimensions. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` -\cgalRefines `DefaultConstructible` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalModels `BidirectionalIterator` diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel--ConstructCartesianConstIterator_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel--ConstructCartesianConstIterator_d.h index 150986a2cf4..10695e97732 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/Kernel--ConstructCartesianConstIterator_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel--ConstructCartesianConstIterator_d.h @@ -3,7 +3,7 @@ \ingroup PkgKernelDKernelConcept \cgalConcept -\cgalRefines `AdaptableFunctor` (with one argument) +\cgalRefines{AdaptableFunctor (with one argument)} \sa `Kernel_d::CartesianConstIterator_d` diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel--Construct_max_vertex_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel--Construct_max_vertex_d.h index 1f27a871c2d..0b03cae2936 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/Kernel--Construct_max_vertex_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel--Construct_max_vertex_d.h @@ -3,7 +3,7 @@ \ingroup PkgKernelDKernelConcept \cgalConcept -\cgalRefines `AdaptableFunctor` (with one argument) +\cgalRefines{AdaptableFunctor (with one argument)} */ class Kernel_d::Construct_max_vertex_d { diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel--Construct_min_vertex_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel--Construct_min_vertex_d.h index 94b42cfd666..b1235d5e6fa 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/Kernel--Construct_min_vertex_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel--Construct_min_vertex_d.h @@ -3,7 +3,7 @@ \ingroup PkgKernelDKernelConcept \cgalConcept -\cgalRefines `AdaptableFunctor` (with one argument) +\cgalRefines{AdaptableFunctor (with one argument)} */ class Kernel_d::Construct_min_vertex_d { diff --git a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h index a31bcc6ff3b..57cfbc7d058 100644 --- a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h +++ b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h @@ -7,7 +7,7 @@ The concept of a kernel with lifting is a small refinement of the general kernel concept. It adds 2 functors, the meaning of which would be unclear in kernels of fixed dimension. -\cgalRefines `Kernel_d` +\cgalRefines{Kernel_d} \cgalHasModel `CGAL::Cartesian_d` \cgalHasModel `CGAL::Homogeneous_d` */ diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h index be301610300..4e7e19343b9 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h @@ -5,7 +5,7 @@ The concept `CellAttributeWithPoint` is a refinement of the `CellAttribute` concept, to represent a cell attribute containing a point. -\cgalRefines `CellAttribute` +\cgalRefines{CellAttribute} \cgalHasModel \link CGAL::Cell_attribute_with_point `CGAL::Cell_attribute_with_point`\endlink diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h index e3e4733f78a..c64aa00f4ff 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h @@ -5,7 +5,7 @@ The concept `LinearCellComplex` represents a linear cell complex in dimension `d`, in an ambient space of dimension `d2`. This is a model of the concept of `GenericMap` adding a requirement to ensure that each vertex of the map is associated with a model of `CellAttributeWithPoint`. -\cgalRefines `GenericMap` +\cgalRefines{GenericMap} \cgalHasModel \link CGAL::Linear_cell_complex_for_combinatorial_map `CGAL::Linear_cell_complex_for_combinatorial_map`\endlink \cgalHasModel \link CGAL::Linear_cell_complex_for_generalized_map `CGAL::Linear_cell_complex_for_generalized_map`\endlink 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 909ce593c9f..caf8d260895 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h @@ -5,7 +5,7 @@ The concept `LinearCellComplexItems` refines the concept of `GenericMapItems` by adding the requirement that 0-attributes are enabled, and associated with attributes that are models of the `CellAttributeWithPoint` concept. -\cgalRefines `GenericMapItems` +\cgalRefines{GenericMapItems} The first type in `Attributes` tuple must be a model of the `CellAttributeWithPoint` concept. diff --git a/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h b/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h index 73400f49df4..04cebff70d0 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h @@ -15,7 +15,7 @@ the concept `::FieldWithSqrt`. This field type and the constructors are used by the conforming algorithm to compute Steiner points on constrained edges. -\cgalRefines `DelaunayTriangulationTraits_2` +\cgalRefines{DelaunayTriangulationTraits_2} \cgalHasModel Any model of `Kernel` concept. In particular, all \cgal kernels \cgalHasModel `Projection_traits_xy_3` diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h index 7964f79f162..4c9bd5eec8b 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h @@ -11,7 +11,7 @@ The concept `DelaunayMeshFaceBase_2` refines the concept to a Boolean marker, that indicates if the face is in the meshing domain or not. -\cgalRefines `ConstrainedTriangulationFaceBase_2` +\cgalRefines{ConstrainedTriangulationFaceBase_2} \cgalHasModel `CGAL::Delaunay_mesh_face_base_2` diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h index f2c6a9f0130..042980a9684 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h @@ -10,7 +10,7 @@ The concept `DelaunayMeshTraits_2` refines the concept `ConformingDelaunayTriangulationTraits_2`. It provides a construction object `Construct_circumcenter_2`. -\cgalRefines `ConformingDelaunayTriangulationTraits_2` +\cgalRefines{ConformingDelaunayTriangulationTraits_2} \cgalHasModel Any model of the `Kernel` concept. In particular, all \cgal kernels \cgalHasModel `CGAL::Projection_traits_xy_3` diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h index 91b814551f5..9385dae29ae 100644 --- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h +++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h @@ -11,7 +11,7 @@ The concept `DelaunayMeshVertexBase_2` refines the concept to a `double` marker, that is useful for the mesh optimizers to keep the mesh density everywhere while modifying the mesh. -\cgalRefines `TriangulationVertexBase_2` +\cgalRefines{TriangulationVertexBase_2} \cgalHasModel `CGAL::Delaunay_mesh_vertex_base_2` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h index a6ba2ba7d6f..028d9e70d9f 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h @@ -41,9 +41,7 @@ and `is_facet_visited(1)` in parallel must be safe) Moreover, the parallel algorithms require an erase counter in each cell (see below). -\cgalRefines `SimplicialMeshCellBase_3` -\cgalRefines `RegularTriangulationCellBaseWithWeightedCircumcenter_3` -\cgalRefines `CopyConstructible` +\cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3,CopyConstructible} \cgalHasModel `CGAL::Compact_mesh_cell_base_3` \cgalHasModel `CGAL::Mesh_cell_base_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h index 1a64924802c..c53644cb36f 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h @@ -12,7 +12,7 @@ additionally encapsulates the concept `MeshEdgeCriteria_3`, that describes the requirements, in terms of sizing, for the discretization of the domain \f$ 1\f$-dimensional features. -\cgalRefines `MeshCriteria_3` +\cgalRefines{MeshCriteria_3} \cgalHasModel `CGAL::Mesh_criteria_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h index 279762200af..18e97b9a275 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h @@ -15,7 +15,7 @@ without auto-intersections. Each curve is also assumed to be oriented. Therefore it is possible to define the signed geodesic distance between two ordered points on the same curve. -\cgalRefines `MeshDomain_3` +\cgalRefines{MeshDomain_3} \cgalHasModel `CGAL::Mesh_domain_with_polyline_features_3` \cgalHasModel `CGAL::Polyhedral_mesh_domain_with_features_3` diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h index 4d1af263528..e4d5a977a1c 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h @@ -7,7 +7,7 @@ The concept `MeshTriangulationTraits_3` describes the requirements for the geometric traits class of the underlying regular triangulation used during a mesh generation process. -\cgalRefines RegularTriangulationTraits_3 +\cgalRefines{RegularTriangulationTraits_3} \cgalHasModel All models of `Kernel`. diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h index 1b1cb0d712b..4739741b01c 100644 --- a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h +++ b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h @@ -20,9 +20,7 @@ and two `Vertex_handle` called 'intrusive'. The parallel algorithms require an erase counter in each cell (see below). -\cgalRefines `SimplicialMeshVertexBase_3` -\cgalRefines `RegularTriangulationVertexBase_3` -\cgalRefines `SurfaceMeshVertexBase_3` +\cgalRefines{SimplicialMeshVertexBase_3,RegularTriangulationVertexBase_3,SurfaceMeshVertexBase_3} \cgalHasModel `CGAL::Mesh_vertex_base_3` 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 e70c1fed399..7c27e91a6c8 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 @@ -7,7 +7,7 @@ decomposing an input polygon \f$ P\f$, which may have holes, 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$. -\cgalRefines `PolygonConvexDecomposition_2` +\cgalRefines{PolygonConvexDecomposition_2} \cgalHasModel `CGAL::Polygon_vertical_decomposition_2` \cgalHasModel `CGAL::Polygon_triangulation_decomposition_2` diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits--ModularImage.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits--ModularImage.h index 93ca015aac6..1ae6322420b 100644 --- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits--ModularImage.h +++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits--ModularImage.h @@ -10,7 +10,7 @@ with respect to a homomorphism \f$ \varphi\f$ from the The homomorphism preserves the mapping of `int` into both types , i.e., \f$ \varphi(\mathrm{Type}(i)) == \mathrm{Residue\_type}(i)\f$. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `ModularTraits` diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits--ModularImageRepresentative.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits--ModularImageRepresentative.h index d19cced014f..a2043679391 100644 --- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits--ModularImageRepresentative.h +++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits--ModularImageRepresentative.h @@ -5,7 +5,7 @@ This `AdaptableUnaryFunction` returns a representative in the original type of a given modular image. More precisely, it implements the *right inverse* of a proper restriction of the homomorphism \f$ \varphi\f$, which is implemented by `ModularTraits::ModularImage`. -\cgalRefines `AdaptableUnaryFunction` +\cgalRefines{AdaptableUnaryFunction} \sa `ModularTraits` diff --git a/Number_types/doc/Number_types/Concepts/RootOf_2.h b/Number_types/doc/Number_types/Concepts/RootOf_2.h index 9c10536f514..c2e9a68f6bb 100644 --- a/Number_types/doc/Number_types/Concepts/RootOf_2.h +++ b/Number_types/doc/Number_types/Concepts/RootOf_2.h @@ -27,11 +27,8 @@ special construction for extensions of degree 2: - `CGAL::make_sqrt()` -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` -\cgalRefines `FromIntConstructible` -\cgalRefines `ImplicitInteroperable` with `RT` -\cgalRefines `ImplicitInteroperable` with `FT` +\cgalRefines{DefaultConstructible,CopyConstructible,FromIntConstructible} + ImplicitInteroperable with `RT`,ImplicitInteroperable with `FT`} \cgalHasModel `double` (not exact) \cgalHasModel `CGAL::Sqrt_extension` 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 74cbbcaca6a..dceb2345f0c 100644 --- a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h +++ b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h @@ -6,7 +6,7 @@ The concept `OrientedBoundingBoxTraits_3` describes the requirements of the trai used in the function `CGAL::oriented_bounding_box()`, and in particular the need for a 3x3 matrix type. -\cgalRefines `Kernel` +\cgalRefines{Kernel} \cgalHasModel `CGAL::Oriented_bounding_box_traits_3` diff --git a/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h b/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h index 3c5afb03b1f..fe99dd293c4 100644 --- a/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h +++ b/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h @@ -6,7 +6,7 @@ The concept `OptimalTransportationReconstructionTraits_2` describes the requirements for the traits class of `CGAL::Optimal_transportation_reconstruction_2`. -\cgalRefines `DelaunayTriangulationTraits_2` +\cgalRefines{DelaunayTriangulationTraits_2} \cgalHasModel Any model of the `Kernel` concept \cgalHasModel `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended) diff --git a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h index 1c122202472..3f1e4722dc2 100644 --- a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h +++ b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h @@ -6,7 +6,7 @@ Requirements of a traits class to be used with the function `optimal_convex_partition_2()` that computes an optimal convex partition of a polygon. -\cgalRefines `PartitionTraits_2` +\cgalRefines{PartitionTraits_2} \cgalHasModel `CGAL::Partition_traits_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 6bc1a42ce38..402a3eca806 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 @@ -14,7 +14,7 @@ predicates from `DelaunayTriangulationTraits_2` can be used directly. For efficiency reasons we maintain for each functor the version without offsets. -\cgalRefines `DelaunayTriangulationTraits_2` and `Periodic_2TriangulationTraits_2` +\cgalRefines{DelaunayTriangulationTraits_2,Periodic_2TriangulationTraits_2} In addition to the requirements of the concepts `Periodic_2TriangulationTraits_2` and `DelaunayTriangulationTraits_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 d6f3e40edbf..7d7771d981e 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 @@ -11,7 +11,7 @@ its four vertices and to its four neighbor faces. The vertices and neighbors are indexed 0, 1 and 2. Neighbor \f$ i\f$ lies opposite to vertex \f$ i\f$. -\cgalRefines `TriangulationFaceBase_2` +\cgalRefines{TriangulationFaceBase_2} \cgalHasModel `CGAL::Periodic_2_triangulation_face_base_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 f5161d682ed..71bfd55b268 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 @@ -18,7 +18,7 @@ predicates from `TriangulationTraits_2` can be used directly. For efficiency reasons we maintain for each functor the version without offsets. -\cgalRefines `TriangulationTraits_2` +\cgalRefines{TriangulationTraits_2} In addition to the requirements described for the traits class `TriangulationTraits_2`, the geometric traits class of a Periodic triangulation must fulfill the following 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 0ed7a18153a..26c88f7b157 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 @@ -14,7 +14,7 @@ to one of its incident faces through a handle. The storage of the offset is only needed when a triangulation is copied. -\cgalRefines `TriangulationVertexBase_2` +\cgalRefines{TriangulationVertexBase_2} \cgalHasModel` CGAL::Periodic_2_triangulation_vertex_base_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 c437d8a3e1e..51a0f2dff73 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 @@ -2,7 +2,7 @@ \ingroup PkgPeriodic3Mesh3Concepts \cgalConcept -\cgalRefines `MeshDomainWithFeatures_3` and `Periodic_3MeshDomain_3` +\cgalRefines{MeshDomainWithFeatures_3,Periodic_3MeshDomain_3} The concept `Periodic_3MeshDomainWithFeatures_3` describes the knowledge required on the object to be discretized. 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 bd86a2a74ae..21ecbca9cc0 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 @@ -2,7 +2,7 @@ \ingroup PkgPeriodic3Mesh3Concepts \cgalConcept -\cgalRefines `MeshDomain_3` +\cgalRefines{MeshDomain_3} The concept `Periodic_3MeshDomain_3` describes the knowledge required on the object to be discretized. 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 a21917ec41e..9ca96674cc7 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 @@ -13,8 +13,7 @@ work with point-offset pairs. In most cases the offsets will be can be used directly. For efficiency reasons we maintain for each functor the version without offsets. -\cgalRefines `Periodic_3TriangulationTraits_3` -\cgalRefines `DelaunayTriangulationTraits_3` +\cgalRefines{Periodic_3TriangulationTraits_3,DelaunayTriangulationTraits_3} \cgalHasModel `CGAL::Periodic_3_Delaunay_triangulation_traits_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 59afc1e24c3..803505e302e 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 @@ -3,8 +3,7 @@ \ingroup PkgPeriodic3Triangulation3Concepts \cgalConcept -\cgalRefines `RegularTriangulationCellBase_3` -\cgalRefines `Periodic_3TriangulationDSCellBase_3` +\cgalRefines{RegularTriangulationCellBase_3,Periodic_3TriangulationDSCellBase_3} \cgalHasModel `CGAL::Regular_triangulation_cell_base_3 >` diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h index 43ff786e30a..762aceede94 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 @@ -3,8 +3,7 @@ \ingroup PkgPeriodic3Triangulation3Concepts \cgalConcept -\cgalRefines `RegularTriangulationVertexBase_3` -\cgalRefines `Periodic_3TriangulationDSVertexBase_3` +\cgalRefines{RegularTriangulationVertexBase_3,Periodic_3TriangulationDSVertexBase_3} \cgalHasModel `CGAL::Regular_triangulation_vertex_base_3 >` diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h index b3b645b972e..ed986883f58 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 @@ -13,8 +13,7 @@ work with point-offset pairs. In most cases the offsets will be can be used directly. For efficiency reasons we maintain for each functor the version without offsets. -\cgalRefines `Periodic_3TriangulationTraits_3` -\cgalRefines `RegularTriangulationTraits_3` +\cgalRefines{Periodic_3TriangulationTraits_3,RegularTriangulationTraits_3} \cgalHasModel `CGAL::Periodic_3_regular_triangulation_traits_3` 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 ccbb25caee0..048264c8c7b 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 @@ -16,7 +16,7 @@ additionally store an offset for each vertex. Only the last three bits of each integer are required to be stored. The remaining part does not contain any information. -\cgalRefines `TriangulationDSCellBase_3` +\cgalRefines{TriangulationDSCellBase_3} \cgalHasModel `CGAL::Periodic_3_triangulation_ds_cell_base_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 fc9c47c0f9b..cc3de413a70 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 @@ -10,7 +10,7 @@ At the base level of 3D-triangulations (see Sections \ref P3Triangulation3secdesign and \ref TDS3secdesign), a vertex provides access to one of its incident cells through a handle. -\cgalRefines `TriangulationDSVertexBase_3` +\cgalRefines{TriangulationDSVertexBase_3} \cgalHasModel `CGAL::Periodic_3_triangulation_ds_vertex_base_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 be1990d1f14..3133ceb9342 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 @@ -12,7 +12,7 @@ work with point-offset pairs. In most cases the offsets will be can be used directly. For efficiency reasons we maintain for each functor the version without offsets. -\cgalRefines `TriangulationTraits_3` +\cgalRefines{TriangulationTraits_3} \cgalHasModel `CGAL::Periodic_3_triangulation_traits_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 a067dd98e92..6628fffd89f 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 @@ -5,7 +5,7 @@ \ingroup PkgPeriodic4HyperbolicTriangulation2Concepts \cgalConcept -\cgalRefines `Periodic_4HyperbolicTriangulationTraits_2` +\cgalRefines{Periodic_4HyperbolicTriangulationTraits_2} The concept `Periodic_4HyperbolicDelaunayTriangulationTraits_2` adds a requirement to `Periodic_4HyperbolicTriangulationTraits_2` that needs to be fulfilled 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 3d0e812a744..959e3c3a25e 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 @@ -5,7 +5,7 @@ \ingroup PkgPeriodic4HyperbolicTriangulation2Concepts \cgalConcept -\cgalRefines `TriangulationFaceBase_2` +\cgalRefines{TriangulationFaceBase_2} A refinement of the concept `TriangulationFaceBase_2` that adds an interface for hyperbolic translations. diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationTraits_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationTraits_2.h index 89605fe87f7..bdd463403a6 100644 --- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationTraits_2.h +++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationTraits_2.h @@ -5,7 +5,7 @@ \ingroup PkgPeriodic4HyperbolicTriangulation2Concepts \cgalConcept -\cgalRefines `HyperbolicDelaunayTriangulationTraits_2` +\cgalRefines{HyperbolicDelaunayTriangulationTraits_2} The concept `Periodic_4HyperbolicTriangulationTraits_2` describes the set of requirements to be fulfilled by any class used to instantiate the first template parameter of the class 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 b6a54d13e70..3221dc57a11 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 @@ -5,7 +5,7 @@ \ingroup PkgPeriodic4HyperbolicTriangulation2Concepts \cgalConcept -\cgalRefines `TriangulationVertexBase_2` +\cgalRefines{TriangulationVertexBase_2} A refinement of the concept `TriangulationVertexBase_2` that adds an interface for hyperbolic translations. diff --git a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h index da1061323f5..e133b35e03d 100644 --- a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h +++ b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h @@ -1,9 +1,7 @@ /*! \ingroup PkgPolygon2Concepts * \cgalConcept * - * \cgalRefines `DefaultConstructible` - * \cgalRefines `CopyConstructible` - * \cgalRefines `Assignable` + * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} * * A model of this concept represents a general polygon with holes. The * concept requires the ability to access the general polygon that diff --git a/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h b/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h index d405005be6e..674a57e4374 100644 --- a/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h +++ b/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h @@ -12,7 +12,7 @@ The requirements of `PolygonTraits_2` are a subset of the kernel requirements. We only list the types and methods which are required and refer to the description of the kernel concept for details. -\cgalRefines `DefaultConstructible` and `CopyConstructable` +\cgalRefines{DefaultConstructible,CopyConstructable} \cgalHasModel The kernels supplied by \cgal are models of `PolygonTraits_2`. \cgalHasModel `CGAL::Projection_traits_xy_3` 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 1db30f8aaae..a46ff1fe7a2 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h @@ -5,7 +5,7 @@ /// used in \link PMP_corefinement_grp corefinement-related functions \endlink to track /// the creation of new faces and new edges. /// -/// \cgalRefines `CopyConstructible` +/// \cgalRefines{CopyConstructible} /// \cgalHasModel `CGAL::Polygon_mesh_processing::Corefinement::Default_visitor`. class PMPCorefinementVisitor{ diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h index 0009489dcec..61575e3ff89 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h @@ -6,8 +6,7 @@ /// those concepts, it also requires types and functors needed by the functions `approximate_max_distance_to_point_set()`, /// `sample_triangle_mesh()`, `approximate_Hausdorff_distance()` and `max_distance_to_triangle_mesh()` /// -/// \cgalRefines `AABBGeomTraits` -/// \cgalRefines `SpatialSortingTraits_3` +/// \cgalRefines{AABBGeomTraits,SpatialSortingTraits_3} /// \cgalHasModel Any 3D Kernel is a model of this concept. class PMPDistanceTraits{ 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 d94b280a96c..9ef06093cb2 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h @@ -8,7 +8,7 @@ /// may use an algorithm with a quadratic running time relying on the 3D Delaunay triangulation (*quadratic phase*). /// If that fails, it uses an algorithm with cubic running time (*cubic phase*). /// -/// \cgalRefines `CopyConstructible` +/// \cgalRefines{CopyConstructible} /// \cgalHasModel `CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor`. 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 93b40c15cb7..a4efc83d703 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h @@ -6,7 +6,7 @@ /// the detection of non-manifold simplices and the modifications performed to polygons /// during the orientation process. /// -/// \cgalRefines `CopyConstructible` +/// \cgalRefines{CopyConstructible} /// \cgalHasModel `CGAL::Polygon_mesh_processing::Default_orientation_visitor`. 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 b7106277b52..f3fdef28beb 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h @@ -5,7 +5,7 @@ /// used in \link PMP_meshing_grp triangulation-related functions \endlink to track /// the creation of new faces. /// -/// \cgalRefines `CopyConstructible` +/// \cgalRefines{CopyConstructible} /// \cgalHasModel `CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor`. diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h index 432c0d928fc..62c23598c49 100644 --- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h +++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h @@ -11,7 +11,7 @@ support the point for vertices and the optional plane equation for facets. Note that the items class uses face instead of facet. Only the polyhedral surface renames faces to facets. -\cgalRefines `HalfedgeDSItems` +\cgalRefines{HalfedgeDSItems} \cgalHasModel `CGAL::Polyhedron_items_3` \cgalHasModel `CGAL::Polyhedron_min_items_3` @@ -65,7 +65,7 @@ public: /// `HalfedgeDSItems::Vertex` concept. This concept adds the requirement /// for the support of the geometry. /// - /// \cgalRefines `HalfedgeDSItems::Vertex` + /// \cgalRefines{HalfedgeDSItems::Vertex} class Vertex { public: /// \name Types in PolyhedronItems_3::Vertex_wrapper::Vertex @@ -102,7 +102,7 @@ public: /// `HalfedgeDSItems::Face` concept. This concept adds the requirement /// for the support of the geometry. /// - /// \cgalRefines `HalfedgeDSItems::Face` + /// \cgalRefines{HalfedgeDSItems::Face} class Face { public: /*! diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h index a2a041ef1d0..6849eb7f175 100644 --- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h +++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h @@ -8,8 +8,7 @@ geometric traits concept is used in the polyhedral surface data structure `CGAL::Polyhedron_3`. Any \cgal kernel is a model of this concept and can be used directly as template argument. -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable} \cgalHasModel `CGAL::Polyhedron_traits_3` \cgalHasModel `CGAL::Polyhedron_traits_with_normals_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 44b11cad95f..4722bcaa72c 100644 --- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h +++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h @@ -10,8 +10,7 @@ sets before and after removal. The smaller the error the lower the cost. The algorithm processes vertices in increasing cost order to preserve the overall polyline set shape as much as possible -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable} \cgalHasModel `CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost` \cgalHasModel `CGAL::Polyline_simplification_2::Scaled_squared_distance_cost` 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 b613845544c..c51684ad8d6 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 @@ -6,7 +6,7 @@ The polyline simplification algorithm stores in the vertices whether a vertex can be removed, and the cost of the removal. -\cgalRefines `TriangulationVertexBase_2` +\cgalRefines{TriangulationVertexBase_2} \cgalHasModel `CGAL::Polyline_simplification_2::Vertex_base_2` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Canonicalize.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Canonicalize.h index b6f735f2882..1081e03f96d 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Canonicalize.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Canonicalize.h @@ -20,9 +20,7 @@ For all other cases the notion of uniqueness is up to the concrete model. Note that the computed polynomial has the same zero set as the given one. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Compare.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Compare.h index 0b871831f44..032463dbb78 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Compare.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Compare.h @@ -9,9 +9,7 @@ order with preference to the outermost variable. This functor is well defined if `PolynomialTraits_d::Innermost_coefficient_type` is `RealEmbeddable`. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructCoefficientConstIteratorRange.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructCoefficientConstIteratorRange.h index a3a4c951834..2a85da5c35b 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructCoefficientConstIteratorRange.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructCoefficientConstIteratorRange.h @@ -7,9 +7,7 @@ This `AdaptableUnaryFunction` returns a const iterator range over the coefficients of the given polynomial, with respect to the outermost variable, \f$ x_{d-1}\f$. The range starts with the coefficient for \f$ x_{d-1}^0\f$. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructInnermostCoefficientConstIteratorRange.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructInnermostCoefficientConstIteratorRange.h index 7b535f13e49..7b11254ead8 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructInnermostCoefficientConstIteratorRange.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructInnermostCoefficientConstIteratorRange.h @@ -6,9 +6,7 @@ This `AdaptableUnaryFunction` returns a const iterator range over all innermost coefficients of the given polynomial. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructPolynomial.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructPolynomial.h index d15d226c6b2..eaeb5e26aba 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructPolynomial.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ConstructPolynomial.h @@ -6,9 +6,7 @@ This `AdaptableFunctor` provides several operators to construct objects of type `PolynomialTraits_d::Polynomial_d`. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Degree.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Degree.h index fa2bd415802..75e1471aa16 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Degree.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Degree.h @@ -16,9 +16,7 @@ The degree of the zero polynomial is set to \f$ 0\f$. From the mathematical point of view this should be \f$ -infinity\f$, but this would imply an inconvenient return type. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--DegreeVector.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--DegreeVector.h index 274a0b433a0..4f8c0ae3710 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--DegreeVector.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--DegreeVector.h @@ -10,9 +10,7 @@ where the monomial order is the lexicographic order giving outer variables a higher priority. In particular, this is the monomial that belongs to the innermost leading coefficient of \f$ p\f$. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Differentiate.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Differentiate.h index 8d584576126..7d8836bc94e 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Differentiate.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Differentiate.h @@ -6,9 +6,7 @@ This `AdaptableUnaryFunction` computes the derivative of a `PolynomialTraits_d::Polynomial_d` with respect to one variable. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Evaluate.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Evaluate.h index c676b4b4f89..77f53dbffa8 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Evaluate.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Evaluate.h @@ -6,9 +6,7 @@ This `AdaptableBinaryFunction` evaluates `PolynomialTraits_d::Polynomial_d` with respect to one variable. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--EvaluateHomogeneous.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--EvaluateHomogeneous.h index 133b06a3b12..9935b08186f 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--EvaluateHomogeneous.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--EvaluateHomogeneous.h @@ -10,9 +10,7 @@ This `AdaptableFunctor` provides evaluation of a For instance the polynomial \f$ p = 5x^2y^3 + y\f$ is interpreted as the homogeneous polynomial \f$ p[x](u,v) = 5x^2u^3 + uv^2\f$ and evaluated as such. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GcdUpToConstantFactor.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GcdUpToConstantFactor.h index 05aa9c8b1b4..276310f193d 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GcdUpToConstantFactor.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GcdUpToConstantFactor.h @@ -18,9 +18,7 @@ This functor computes \f$ gcd\_utcf(f,g) = D * gcd(f,g)\f$, for some \f$ D \in R\f$ such that \f$ gcd\_utcf(f,g) \in R[x_0,\dots,x_{d-1}]\f$. Hence, \f$ gcd\_utcf(f,g)\f$ may not be a divisor of \f$ f\f$ and \f$ g\f$ in \f$ R[x_0,\dots,x_{d-1}]\f$. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GetCoefficient.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GetCoefficient.h index 6ccf00c9e05..d33fcd49f1d 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GetCoefficient.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GetCoefficient.h @@ -6,9 +6,7 @@ This `AdaptableBinaryFunction` provides access to coefficients of a `PolynomialTraits_d::Polynomial_d`. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GetInnermostCoefficient.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GetInnermostCoefficient.h index a96fe3cc158..f3bd777d571 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GetInnermostCoefficient.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--GetInnermostCoefficient.h @@ -7,9 +7,7 @@ For the given `PolynomialTraits_d::Polynomial_d` this `AdaptableBinaryFunction` returns the coefficient of the (multivariate) monomial specified by the given `CGAL::Exponent_vector`. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--InnermostLeadingCoefficient.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--InnermostLeadingCoefficient.h index 552167e0580..df17960acf9 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--InnermostLeadingCoefficient.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--InnermostLeadingCoefficient.h @@ -6,9 +6,7 @@ This `AdaptableUnaryFunction` computes the innermost leading coefficient of a `PolynomialTraits_d::Polynomial_d` \f$ p\f$. The innermost leading coefficient is recursively defined as the innermost leading coefficient of the leading coefficient of \f$ p\f$. In case \f$ p\f$ is univariate it coincides with the leading coefficient. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IntegralDivisionUpToConstantFactor.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IntegralDivisionUpToConstantFactor.h index 28f0a70c292..a18ccc0aff8 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IntegralDivisionUpToConstantFactor.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IntegralDivisionUpToConstantFactor.h @@ -9,9 +9,7 @@ of two polynomials of type `PolynomialTraits_d::Polynomial_d` \pre \f$ g\f$ divides \f$ f\f$ in \f$ Q(R)[x_0,\dots,x_{d-1}]\f$, where \f$ Q(R)\f$ is the quotient field of the base ring \f$ R\f$, `PolynomialTraits_d::Innermost_coefficient_type`. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Invert.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Invert.h index 77eaba22966..96e8878607a 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Invert.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Invert.h @@ -13,9 +13,7 @@ the polynomial is considered as a univariate polynomial in one specific variable This functor is provided for efficiency reasons, since this operation just inverts the order of the coefficients with respect to the specified variable. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsSquareFree.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsSquareFree.h index 59808eeec4d..a0cea949b8c 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsSquareFree.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsSquareFree.h @@ -10,9 +10,7 @@ is square free. Note that this statement does cover constant factors, i.e., whether the multivariate content contains a square. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAt.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAt.h index 2eeb6a37ac3..3f778a6fc9e 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAt.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAt.h @@ -7,9 +7,7 @@ This `AdaptableFunctor` returns whether a `PolynomialTraits_d::Polynomial_d` \f$ p\f$ is zero at a given Cartesian point, which is represented as an iterator range. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAtHomogeneous.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAtHomogeneous.h index 232ad8b574b..a72a45afa29 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAtHomogeneous.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAtHomogeneous.h @@ -12,9 +12,7 @@ The polynomial is interpreted as a homogeneous polynomial in all variables. For instance the polynomial \f$ p(x_0,x_1) = x_0^2x_1^3+x_1^4\f$ is interpreted as the homogeneous polynomial \f$ p(x_0,x_1,w) = x_0^2x_1^3+x_1^4w^1\f$. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--LeadingCoefficient.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--LeadingCoefficient.h index 3cd8c8b4c97..f7f628d6ea3 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--LeadingCoefficient.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--LeadingCoefficient.h @@ -6,9 +6,7 @@ This `AdaptableUnaryFunction` computes the leading coefficient of a `PolynomialTraits_d::Polynomial_d`. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MakeSquareFree.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MakeSquareFree.h index 3ec0eea9f4f..b89b7a3fd02 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MakeSquareFree.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MakeSquareFree.h @@ -14,9 +14,7 @@ such that \f$ p = a \cdot g_1^{m_1} \cdot ... \cdot g_n^{m_n}\f$, where all \f$ Given this decomposition, the square free part is defined as the product \f$ g_1 \cdot ... \cdot g_n\f$, which is computed by this functor. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MonomialRepresentation.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MonomialRepresentation.h index ea85063a6e7..e21f8b68621 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MonomialRepresentation.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MonomialRepresentation.h @@ -8,9 +8,7 @@ that is, it writes all non zero terms of the polynomial as `std::pair` into the given output iterator. -\cgalRefines \ref Assignable -\cgalRefines \ref CopyConstructible -\cgalRefines \ref DefaultConstructible +\cgalRefines{Assignable,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Move.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Move.h index d79dfe99198..cdb070fc521 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Move.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Move.h @@ -10,9 +10,7 @@ one position while \f$ x_i\f$ is moved to the former position of \f$ x_j\f$. This function may be used to make a certain variable the outer most variable. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MultivariateContent.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MultivariateContent.h index d9eaf355a1d..32609fbdbec 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MultivariateContent.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--MultivariateContent.h @@ -10,9 +10,7 @@ view on the polynomial, that is, it computes the gcd of all innermost coefficien This functor is well defined if `PolynomialTraits_d::Innermost_coefficient_type` is a `Field` or a `UniqueFactorizationDomain`. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Negate.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Negate.h index 421cca00492..eb39344b00e 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Negate.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Negate.h @@ -11,9 +11,7 @@ the polynomial is considered as a univariate polynomial in one specific variable This functor is provided for efficiency reasons, since this operation just flips the sign of all odd coefficients with respect to the specified variable. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Permute.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Permute.h index 8e092206140..514f8ea16f0 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Permute.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Permute.h @@ -15,9 +15,7 @@ change the order of the variables such that \f$ x_0 \mapsto x_2\f$, \f$ x_1 \mapsto x_0\f$, \f$ x_2 \mapsto x_1\f$ and \f$ x_3 \mapsto x_3\f$. In this case the iterator range should contain the sequence \f$ [2,0,1,3]\f$. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PolynomialSubresultants.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PolynomialSubresultants.h index 3418ef03626..d98b393b1c3 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PolynomialSubresultants.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PolynomialSubresultants.h @@ -32,9 +32,7 @@ The result is written in an output range, starting with the \f$ 0\f$-th subresul \note This functor is optional. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PolynomialSubresultantsWithCofactors.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PolynomialSubresultantsWithCofactors.h index 64274c8d879..778c613de30 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PolynomialSubresultantsWithCofactors.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PolynomialSubresultantsWithCofactors.h @@ -16,9 +16,7 @@ starting with the \f$ 0\f$-th subresultant and the corresponding cofactors. \note This functor is optional. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PrincipalSturmHabichtSequence.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PrincipalSturmHabichtSequence.h index 5369cf55ca6..8c86eb901ba 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PrincipalSturmHabichtSequence.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PrincipalSturmHabichtSequence.h @@ -19,9 +19,7 @@ the polynomial \f$ f\f$. \note This functor is optional. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PrincipalSubresultants.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PrincipalSubresultants.h index 21952cec677..0c786a28054 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PrincipalSubresultants.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PrincipalSubresultants.h @@ -19,9 +19,7 @@ principal subresultant \f$ \mathrm{sres}_0(p,q)\f$ \note This functor is optional. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivision.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivision.h index cf269798372..6e0e9fe887d 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivision.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivision.h @@ -16,9 +16,7 @@ Hence in general it is not possible to invert the leading coefficient of \f$ g\f Instead \f$ f\f$ is extended by \f$ D\f$ allowing integral divisions in the internal computation. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivisionQuotient.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivisionQuotient.h index 0779a439134..d8e7b9f2e55 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivisionQuotient.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivisionQuotient.h @@ -12,9 +12,7 @@ where \f$ D = leading\_coefficient(g)^{max(0, degree(f)-degree(g)+1)}\f$ This functor computes \f$ q\f$. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivisionRemainder.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivisionRemainder.h index a547947df93..522be10a6b2 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivisionRemainder.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--PseudoDivisionRemainder.h @@ -12,9 +12,7 @@ where \f$ D = leading\_coefficient(g)^{max(0, degree(f)-degree(g)+1)}\f$ This functor computes \f$ r\f$. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Resultant.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Resultant.h index e337487c90d..69c6804f575 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Resultant.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Resultant.h @@ -54,9 +54,7 @@ which is a variant of the Euclidean Algorithm. More sophisticated methods may use modular arithmetic and interpolation. For more information we refer to, e.g., \cgalCite{gg-mca-99}. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Scale.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Scale.h index a64b2ba5f33..5668a6ea84b 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Scale.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Scale.h @@ -10,9 +10,7 @@ it computes \f$ p(c\cdot x)\f$. Note that this functor operates on the polynomial in the univariate view, that is, the polynomial is considered as a univariate polynomial in one specific variable. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ScaleHomogeneous.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ScaleHomogeneous.h index 80cb293e1aa..ba73655f5c6 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ScaleHomogeneous.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--ScaleHomogeneous.h @@ -10,9 +10,7 @@ that is, it computes \f$ b^{degree(p)}\cdot p(a/b\cdot x)\f$. Note that this functor operates on the polynomial in the univariate view, that is, the polynomial is considered as a univariate homogeneous polynomial in one specific variable. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Shift.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Shift.h index 24b8655b464..9d491d6cb52 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Shift.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Shift.h @@ -9,9 +9,7 @@ by the given power of the specified variable. This functor is provided for efficiency reasons, since multiplication by some variable will in general correspond to a shift of coefficients in the internal representation. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAt.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAt.h index 8d2418ca54b..89dc6556dad 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAt.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAt.h @@ -10,9 +10,7 @@ as an iterator range. This functor is well defined if `PolynomialTraits_d::Innermost_coefficient_type` is `RealEmbeddable`. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAtHomogeneous.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAtHomogeneous.h index 7695c92709f..d3cb343e304 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAtHomogeneous.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAtHomogeneous.h @@ -15,9 +15,7 @@ polynomial \f$ p(x_0,x_1,w) = x_0^2x_1^3+x_1^4w^1\f$. This functor is well defined if `PolynomialTraits_d::Innermost_coefficient_type` is `RealEmbeddable`. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SquareFreeFactorize.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SquareFreeFactorize.h index 7c2ba845b5d..476854ee8d9 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SquareFreeFactorize.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SquareFreeFactorize.h @@ -15,9 +15,7 @@ The pairs \f$ (g_i,m_i)\f$ are written into the given output iterator. This functor is well defined if `PolynomialTraits_d::Polynomial_d` is a `UniqueFactorizationDomain`. -\cgalRefines Assignable -\cgalRefines CopyConstructible -\cgalRefines DefaultConstructible +\cgalRefines{Assignable,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SquareFreeFactorizeUpToConstantFactor.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SquareFreeFactorizeUpToConstantFactor.h index f62b124bfc4..ce826463203 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SquareFreeFactorizeUpToConstantFactor.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SquareFreeFactorizeUpToConstantFactor.h @@ -19,9 +19,7 @@ This functor is well defined even though `PolynomialTraits_d::Innermost_coefficient_type` may not be a `UniqueFactorizationDomain`. -\cgalRefines Assignable -\cgalRefines CopyConstructible -\cgalRefines DefaultConstructible +\cgalRefines{Assignable,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SturmHabichtSequence.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SturmHabichtSequence.h index c314610f9ee..d724fa86201 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SturmHabichtSequence.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SturmHabichtSequence.h @@ -34,9 +34,7 @@ the discriminant of \f$ f\f$ up to a multiple of the leading coefficient). \note This functor is optional. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SturmHabichtSequenceWithCofactors.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SturmHabichtSequenceWithCofactors.h index 3ade609f016..85ef0b83f4f 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SturmHabichtSequenceWithCofactors.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SturmHabichtSequenceWithCofactors.h @@ -16,9 +16,7 @@ and the corresponding cofactors. \note This functor is optional. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Substitute.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Substitute.h index 71a9a19baa4..d0adc1fc1d5 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Substitute.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Substitute.h @@ -7,9 +7,7 @@ This `Functor` substitutes all variables of a given multivariate `PolynomialTraits_d::Polynomial_d` by the values given in the iterator range, where begin refers the value for the innermost variable. -\cgalRefines Assignable -\cgalRefines CopyConstructible -\cgalRefines DefaultConstructible +\cgalRefines{Assignable,CopyConstructible,DefaultConstructible} \cgalHeading{Types} diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SubstituteHomogeneous.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SubstituteHomogeneous.h index aa387211e15..ee171b9e9fe 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SubstituteHomogeneous.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SubstituteHomogeneous.h @@ -13,9 +13,7 @@ Hence the iterator range is required to be of length `PolynomialTraits_d::d+1`. For instance the polynomial \f$ p(x_0,x_1) = x_0^2x_1^3+x_1^4\f$ is interpreted as the homogeneous polynomial \f$ p(x_0,x_1,w) = x_0^2x_1^3+x_1^4w^1\f$. -\cgalRefines Assignable -\cgalRefines CopyConstructible -\cgalRefines DefaultConstructible +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHeading{Types} diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Swap.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Swap.h index 1c7e5403257..11beaab299b 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Swap.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Swap.h @@ -5,9 +5,7 @@ This `AdaptableFunctor` swaps two variables of a multivariate polynomial. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--TotalDegree.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--TotalDegree.h index c2a2286212f..2d82736c7a7 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--TotalDegree.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--TotalDegree.h @@ -17,9 +17,7 @@ The total degree of the zero polynomial is set to \f$ 0\f$. From the mathematical point of view this should be \f$ -\infty\f$, but this would imply an inconvenient return type. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Translate.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Translate.h index e49c7b645c2..8ad8143d57d 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Translate.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--Translate.h @@ -10,9 +10,7 @@ for a given polynomial \f$ p\f$ and constant \f$ c\f$ it computes \f$ p(x+c)\f$. Note that this functor operates on the polynomial in the univariate view, that is, the polynomial is considered as a univariate polynomial in one specific variable. -\cgalRefines `AdaptableBinaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableBinaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--TranslateHomogeneous.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--TranslateHomogeneous.h index f65e6966716..3b1ffa9e0bb 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--TranslateHomogeneous.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--TranslateHomogeneous.h @@ -10,9 +10,7 @@ that is, it computes \f$ b^{degree(p)}\cdot p(x+a/b)\f$. Note that this functor operates on the polynomial in the univariate view, that is, the polynomial is considered as a univariate homogeneous polynomial in one specific variable. -\cgalRefines `AdaptableFunctor` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--UnivariateContent.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--UnivariateContent.h index 00ed2670ffb..c4bfc0bf723 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--UnivariateContent.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--UnivariateContent.h @@ -12,9 +12,7 @@ coefficients with respect to one variable. This functor is well defined if `PolynomialTraits_d::Coefficient_type` is a `Field` or a `UniqueFactorizationDomain`. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--UnivariateContentUpToConstantFactor.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--UnivariateContentUpToConstantFactor.h index 14a89ae6692..950c026ae43 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--UnivariateContentUpToConstantFactor.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--UnivariateContentUpToConstantFactor.h @@ -15,9 +15,7 @@ and `PolynomialTraits_d::MultivariateContent`. However, a concept `PolynomialTraits_d::MultivariateContentUpToConstantFactor` does not exist since the result is trivial. -\cgalRefines `AdaptableUnaryFunction` -\cgalRefines `CopyConstructible` -\cgalRefines `DefaultConstructible` +\cgalRefines{AdaptableUnaryFunction,CopyConstructible,DefaultConstructible} \sa `Polynomial_d` \sa `PolynomialTraits_d` diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h index 4d7bca50f25..d5552d6b328 100644 --- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h +++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h @@ -27,7 +27,7 @@ Many functors consider the polynomial as a univariate polynomial in one variable By default this is the outermost variable \f$ x_{d-1}\f$. However, in general it is possible to select a certain variable. -\cgalRefines `AlgebraicStructureTraits` +\cgalRefines{AlgebraicStructureTraits} \sa `Polynomial_d` diff --git a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h index e918979f790..ed86c99c683 100644 --- a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h +++ b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h @@ -12,7 +12,7 @@ A model of `Polynomial_d` must be accompanied by a traits class Please have a look at the concept `PolynomialTraits_d`, since nearly all functionality related to polynomials is provided by the traits. -\cgalRefines `IntegralDomainWithoutDivision` +\cgalRefines{IntegralDomainWithoutDivision} The algebraic structure of `Polynomial_d` depends on the algebraic structure of `PolynomialTraits_d::Innermost_coefficient_type`: 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 f97cdcb318b..d76e8032e54 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h @@ -46,7 +46,7 @@ is then approximated by a subdomain (resp. a surface patch) of the embedded comp while the curves and corners represent the \f$ 1\f$ and \f$ 0\f$-dimensional features of the input complex. -\cgalRefines `MeshComplex_3InTriangulation_3` +\cgalRefines{MeshComplex_3InTriangulation_3} \cgalHasModel `CGAL::Mesh_complex_3_in_triangulation_3` diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h index 4ac54ef66db..ff424c1281d 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h @@ -16,8 +16,7 @@ in case of a multi-domain. Moreover, this concept adds four markers per cell to mark the facets of the triangulation that are surface facets. -\cgalRefines `TriangulationCellBase_3 ` -\cgalRefines `CopyConstructible` +\cgalRefines{TriangulationCellBase_3,CopyConstructible} \cgalHasModel `CGAL::Compact_mesh_cell_base_3` \cgalHasModel `CGAL::Mesh_cell_base_3` diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h index 0ada434d3eb..ad034bbb982 100644 --- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h +++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h @@ -14,7 +14,7 @@ to an integer representing the dimension of the lowest dimensional face of the input 3D complex on which the vertex lies, and to an index characteristic of this face. -\cgalRefines `TriangulationVertexBase_3` +\cgalRefines{TriangulationVertexBase_3} \cgalHasModel `CGAL::Mesh_vertex_base_3` \cgalHasModel `CGAL::Simplicial_mesh_vertex_base_3` diff --git a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h index 233d75b030c..8235e55f4f0 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h +++ b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h @@ -4,10 +4,7 @@ The concept `Descriptor` allows to describe a unique object in an abstract model. -\cgalRefines DefaultConstructible -\cgalRefines CopyConstructible -\cgalRefines Assignable -\cgalRefines EqualityComparable +\cgalRefines{DefaultConstructible,CopyConstructible,Assignable,EqualityComparable} \cgalHasModel `Index` \cgalHasModel `Handle` diff --git a/STL_Extension/doc/STL_Extension/Concepts/Index.h b/STL_Extension/doc/STL_Extension/Concepts/Index.h index 7d4cc380903..544e714fa8a 100644 --- a/STL_Extension/doc/STL_Extension/Concepts/Index.h +++ b/STL_Extension/doc/STL_Extension/Concepts/Index.h @@ -4,7 +4,7 @@ The concept `Index` is a refinement of `Descriptor` which must be convertible from and to `std::size_t`, and must be incrementable and decrementable. -\cgalRefines `Descriptor` +\cgalRefines{Descriptor} \cgalHasModel int \cgalHasModel size_t 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 58a16cb543a..566beb42485 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 @@ -31,7 +31,7 @@ returned. We only describe the additional requirements with respect to the `ApolloniusGraphDataStructure_2` concept. -\cgalRefines `ApolloniusGraphDataStructure_2` +\cgalRefines{ApolloniusGraphDataStructure_2} \cgalHasModel `CGAL::Triangulation_data_structure_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 8837bc14b74..4b96dab0907 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 @@ -7,7 +7,7 @@ The concept `SegmentDelaunayGraphFaceBase_2` describes the requirements for the face base class of the `SegmentDelaunayGraphDataStructure_2` concept. -\cgalRefines `TriangulationFaceBase_2` +\cgalRefines{TriangulationFaceBase_2} \cgalHasModel `CGAL::Segment_Delaunay_graph_face_base_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 6b70d36fb87..7ab5a65a26b 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 @@ -12,7 +12,7 @@ refines the concept `SegmentDelaunayGraphVertexBase_2`, by adding two vertex handles to the corresponding vertices for the next and previous level graphs. -\cgalRefines `SegmentDelaunayGraphVertexBase_2` +\cgalRefines{SegmentDelaunayGraphVertexBase_2} \cgalHeading{Types} 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 d52818a7e70..5370b1b3026 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 @@ -6,9 +6,7 @@ The concept `SegmentDelaunayGraphSite_2` provides the requirements for the sites of a segment Delaunay graph. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Segment_Delaunay_graph_site_2` diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h index 743727a2a63..3f391babafa 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 @@ -9,9 +9,7 @@ storage sites are sites that are used to store the information of a site in a more compact form (that uses less storage). This is achieved by storing handles to points instead of points. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Segment_Delaunay_graph_storage_site_2` diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h index 63d1ae08db2..78e8bda7d6e 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 @@ -13,9 +13,7 @@ only store handles to the points in the container. See section \ref Segment_Delaunay_graph_2StronglyIntersecting for more information. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` -\cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Segment_Delaunay_graph_storage_traits_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 3d1de41b15d..e68b4212b19 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 @@ -4,7 +4,7 @@ \cgalConcept -\cgalRefines `TriangulationTraits_2` +\cgalRefines{TriangulationTraits_2} The concept `SegmentDelaunayGraphTraits_2` provides the traits requirements for the `CGAL::Segment_Delaunay_graph_2` and 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 903d9e92b68..778a709b5a6 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 @@ -3,7 +3,7 @@ \ingroup PkgSegmentDelaunayGraph2Concepts \cgalConcept -\cgalRefines `TriangulationDSVertexBase_2` +\cgalRefines{TriangulationDSVertexBase_2} The concept `SegmentDelaunayGraphVertexBase_2` describes the requirements for the vertex base class of the 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 d654765e03c..4a4a626b8eb 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 @@ -34,7 +34,7 @@ of the `SegmentDelaunayGraphLinfTraits_2` concept with respect to the `SegmentDelaunayGraphTraits_2` concept. -\cgalRefines `SegmentDelaunayGraphTraits_2` +\cgalRefines{SegmentDelaunayGraphTraits_2} \cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_traits_2` \cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2` diff --git a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h index f67bf8ba17b..4f0424d9664 100644 --- a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h +++ b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h @@ -5,8 +5,7 @@ This concept generalizes the concept of a 2D Kernel. - \cgalRefines `DefaultConstructible` - \cgalRefines `PolygonTraits_2` + \cgalRefines{DefaultConstructible,PolygonTraits_2} \cgalHasModel Any CGAL kernel, e.g., CGAL::Exact_predicates_exact_constructions_kernel. 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 0dad254c330..6551020f4f0 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 @@ -8,7 +8,7 @@ This geometric traits concept is used for the construction of a polyhedral mesh approximating a skin surface `CGAL::Skin_surface_3`. -\cgalRefines `RegularTriangulationTraits_3` +\cgalRefines{RegularTriangulationTraits_3} \cgalHasModel `CGAL::Skin_surface_traits_3` 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 5f908c59c86..0138ce98d6b 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 @@ -9,7 +9,7 @@ the free function \ref CGAL::snap_rounding_2() `CGAL::snap_rounding_2` */ @@ -170,9 +170,7 @@ namespace SRTraits_2{ \ingroup PkgSnapRounding2Concepts \cgalConcept Represents an iso rectangle - \cgalRefines `DefaultConstructible` - \cgalRefines `CopyConstructible` - \cgalRefines `Assignable` + \cgalRefines{DefaultConstructible,CopyConstructible,Assignable} \cgalHasModel \link SnapRoundingTraits_2::Iso_rectangle_2 `Snap_rounding_traits_2::Iso_rectangle_2` \endlink */ class IsoRectangle_2 @@ -181,7 +179,7 @@ class IsoRectangle_2 /*! \ingroup PkgSnapRounding2Concepts \cgalConcept - \cgalRefines `AdaptableBinaryFunction` + \cgalRefines{AdaptableBinaryFunction} \cgalHasModel \link SnapRoundingTraits_2::Construct_vertex_2 `Snap_rounding_traits_2::Construct_vertex_2` \endlink */ class ConstructVertex_2 @@ -198,7 +196,7 @@ class ConstructVertex_2 /*! \ingroup PkgSnapRounding2Concepts \cgalConcept - \cgalRefines `AdaptableBinaryFunction` + \cgalRefines{AdaptableBinaryFunction} \cgalHasModel \link SnapRoundingTraits_2::Construct_segment_2 `Snap_rounding_traits_2::Construct_segment_2` \endlink */ class ConstructSegment_2 @@ -215,7 +213,7 @@ class ConstructSegment_2 /*! \ingroup PkgSnapRounding2Concepts \cgalConcept - \cgalRefines `AdaptableQuaternaryFunction` + \cgalRefines{AdaptableQuaternaryFunction} \cgalHasModel \link SnapRoundingTraits_2::Construct_iso_rectangle_2 `Snap_rounding_traits_2::Construct_iso_rectangle_2` \endlink */ class ConstructIsoRectangle_2 @@ -236,7 +234,7 @@ class ConstructIsoRectangle_2 /*! \ingroup PkgSnapRounding2Concepts \cgalConcept - \cgalRefines `AdaptableBinaryFunction` + \cgalRefines{AdaptableBinaryFunction} \cgalHasModel \link SnapRoundingTraits_2::Compare_x_2 `Snap_rounding_traits_2::Compare_x_2` \endlink */ class CompareX_2 @@ -252,7 +250,7 @@ class CompareX_2 /*! \ingroup PkgSnapRounding2Concepts \cgalConcept - \cgalRefines `AdaptableBinaryFunction` + \cgalRefines{AdaptableBinaryFunction} \cgalHasModel \link SnapRoundingTraits_2::Compare_y_2 `Snap_rounding_traits_2::Compare_y_2` \endlink */ class CompareY_2 @@ -269,7 +267,7 @@ class CompareY_2 /*! \ingroup PkgSnapRounding2Concepts \cgalConcept - \cgalRefines `AdaptableQuaternaryFunction` + \cgalRefines{AdaptableQuaternaryFunction} \cgalHasModel \link SnapRoundingTraits_2::Snap_2 `Snap_rounding_traits_2::Snap_2` \endlink */ class Snap_2 @@ -288,7 +286,7 @@ class Snap_2 /*! \ingroup PkgSnapRounding2Concepts \cgalConcept - \cgalRefines `AdaptableBinaryFunction` + \cgalRefines{AdaptableBinaryFunction} \cgalHasModel \link SnapRoundingTraits_2::Integer_grid_point_2 `Snap_rounding_traits_2::Integer_grid_point_2` \endlink */ @@ -309,7 +307,7 @@ class IntegerGridPoint_2 /*! \ingroup PkgSnapRounding2Concepts \cgalConcept - \cgalRefines `AdaptableTernaryFunction` + \cgalRefines{AdaptableTernaryFunction} \cgalHasModel \link SnapRoundingTraits_2::Minkowski_sum_with_pixel_2 `Snap_rounding_traits_2::Minkowski_sum_with_pixel_2` \endlink */ class MinkowskiSumWithPixel_2 diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h index 1857644c9d2..e0555447812 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h @@ -60,7 +60,7 @@ bool linear_solver(const Matrix& A, const Vector& B, Vector& X, NT& D); `SparseLinearAlgebraTraits_d::Vector` is a concept of a vector that can be multiplied by a sparse matrix. -\cgalRefines DefaultConstructible +\cgalRefines{DefaultConstructible} \cgalHasModel `CGAL::Eigen_vector` @@ -127,8 +127,7 @@ NT& operator[](Index row); `SparseLinearAlgebraTraits_d::Matrix` is a concept of a sparse matrix class. -\cgalRefines Assignable -\cgalRefines DefaultConstructible +\cgalRefines{Assignable,DefaultConstructible} \cgalHasModel `CGAL::Eigen_sparse_matrix` \cgalHasModel `CGAL::Eigen_sparse_symmetric_matrix` diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h index 5bf3bf2aba1..0313402d356 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h @@ -6,7 +6,7 @@ A model of this concept stores the left-hand matrix (denoted \f$ A \f$) and provides an additional factorization method to solve the system for different right-hand vectors. -\cgalRefines `SparseLinearAlgebraTraits_d` +\cgalRefines{SparseLinearAlgebraTraits_d} \cgalHasModel `CGAL::Eigen_solver_traits` */ diff --git a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h index 518b8df6532..939b29a4959 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h @@ -86,8 +86,7 @@ public: \cgalConcept Concept of matrix type used by the concept `SvdTraits`. -\cgalRefines `DefaultConstructible` -\cgalRefines `Assignable` +\cgalRefines{DefaultConstructible,Assignable} \cgalHasModel `CGAL::Eigen_matrix` */ diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h index 34618365fea..d2a398589d8 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h @@ -6,7 +6,7 @@ Requirements of an orthogonal distance class supporting incremental distance upd To optimize distance computations transformed distances are used. E.g., for an Euclidean distance the transformed distance is the squared Euclidean distance. -\cgalRefines `GeneralDistance` +\cgalRefines{GeneralDistance} \cgalHasModel `CGAL::Euclidean_distance` \cgalHasModel `CGAL::Weighted_Minkowski_distance` diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h index 3d418953f5c..5e7e310f0a5 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h @@ -6,7 +6,7 @@ The concept `RangeSearchTraits` defines the requirements for the template parameter of the search classes. This concept also defines requirements to range search queries in a model of `SpatialTree`. -\cgalRefines `SearchTraits` +\cgalRefines{SearchTraits} \cgalHasModel `CGAL::Cartesian_d` \cgalHasModel `CGAL::Homogeneous_d` 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 eed4756e9e2..cc2cf00a120 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 @@ -2,7 +2,7 @@ \ingroup PkgStraightSkeleton2Concepts \cgalConcept -\cgalRefines `StraightSkeletonBuilderTraits_2` +\cgalRefines{StraightSkeletonBuilderTraits_2} The concept `PolygonOffsetBuilderTraits_2` describes the requirements for the geometric traits class required by the algorithm class `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 eb9ca638cb5..f4fd0166ebb 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 @@ -2,8 +2,7 @@ \ingroup PkgStraightSkeleton2Concepts \cgalConcept -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` +\cgalRefines{DefaultConstructible,CopyConstructible} The concept `StraightSkeletonBuilderTraits_2` describes the requirements for the geometric traits class required by the algorithm class `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 555ec0d5b87..311987667fb 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 @@ -2,7 +2,7 @@ \ingroup PkgStraightSkeleton2Concepts \cgalConcept -\cgalRefines `HalfedgeDSFace` +\cgalRefines{HalfedgeDSFace} The concept `StraightSkeletonFace_2` describes the requirements for the face type of the `StraightSkeleton_2` concept. It is a refinement of the `HalfedgeDSFace` concept 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 ba9548e64b5..1f31421336a 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 @@ -2,7 +2,7 @@ \ingroup PkgStraightSkeleton2Concepts \cgalConcept -\cgalRefines `HalfedgeDSHalfedge` +\cgalRefines{HalfedgeDSHalfedge} The concept `StraightSkeletonHalfedge_2` describes the requirements for the halfedge type of the `StraightSkeleton_2` concept. It is a refinement of the `HalfedgeDSHalfedge` concept. 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 9c9a5765a5c..7a26285dccf 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 @@ -2,7 +2,7 @@ \ingroup PkgStraightSkeleton2Concepts \cgalConcept -\cgalRefines `HalfedgeDSVertex` +\cgalRefines{HalfedgeDSVertex} The concept `StraightSkeletonVertex_2` describes the requirements for the vertex type of the `StraightSkeleton_2` concept. It is a refinement of the `HalfedgeDSVertex` concept 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 340fb8a08b2..18a85973c5b 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 @@ -2,7 +2,7 @@ \ingroup PkgStraightSkeleton2Concepts \cgalConcept -\cgalRefines `HalfedgeDS` +\cgalRefines{HalfedgeDS} The concept `StraightSkeleton_2` describes the requirements for the data structure used to represent a straight skeleton. It refines the concept 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 f53d4db7ef4..c5a06d95618 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 @@ -9,7 +9,7 @@ policy concept of geometric computations is used in \image html DSCornerMask.svg -\cgalRefines `SubdivisionMask_3` +\cgalRefines{SubdivisionMask_3} \cgalHasModel `CGAL::DooSabin_mask_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 18f3c196d5f..bb28f171b02 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 @@ -9,7 +9,7 @@ policy concept of geometric computations is used in \image html CCBorderMask.svg -\cgalRefines `SubdivisionMask_3` +\cgalRefines{SubdivisionMask_3} \cgalHasModel `CGAL::CatmullClark_mask_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 d149cd9ee66..6050b444ad3 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 @@ -8,7 +8,7 @@ policy concept of geometric computations is used in \image html LoopBorderMask.svg -\cgalRefines `SubdivisionMask_3` +\cgalRefines{SubdivisionMask_3} \cgalHasModel `CGAL::Loop_mask_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 77fe974dd62..ee5fc38d907 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 @@ -7,7 +7,7 @@ Required member functions for the `Sqrt3Mask_3` concept. This policy concept of geometric computations is used in `CGAL::Subdivision_method_3::Sqrt3`. -\cgalRefines `SubdivisionMask_3` +\cgalRefines{SubdivisionMask_3} \cgalHasModel `CGAL::Sqrt3_mask_3` 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 c4a67edc2af..a8dbb00b46b 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 @@ -7,7 +7,7 @@ The definition of close depends on the model. The fact that some basic operations are hidden behind a function is to allow to benefit from optimizations like expression template from libraries used to implement models of this concept. -\cgalRefines `DefaultConstructible` +\cgalRefines{DefaultConstructible} \cgalHasModel `CGAL::Deformation_Eigen_closest_rotation_traits_3` \cgalHasModel `CGAL::Deformation_Eigen_polar_closest_rotation_traits_3` @@ -55,4 +55,4 @@ public: /// @} -}; \ No newline at end of file +}; diff --git a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/RawPoint_3.h b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/RawPoint_3.h index 7ac7398f121..41b10daa4a7 100644 --- a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/RawPoint_3.h +++ b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/RawPoint_3.h @@ -1,6 +1,6 @@ /// \ingroup PkgSurfaceMeshDeformationConcepts /// \cgalConcept -/// \cgalRefines `DefaultConstructible` and `Assignable` +/// \cgalRefines{DefaultConstructible,Assignable} /// /// Concept describing the set of requirements of a simple point type. /// diff --git a/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h b/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h index b5f5010acdc..93450589cfc 100644 --- a/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h +++ b/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h @@ -7,7 +7,7 @@ of the geometric traits needed by the segmentation functions. \cgalHasModel All the \cgal Kernels -\cgalRefines AABBGeomTraits +\cgalRefines{AABBGeomTraits} */ diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h index ff38140189c..652c3457496 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 @@ -7,7 +7,7 @@ The concept `SurfaceMeshShortestPathTraits` describes the types, predicates, and constructions required by the traits class parameter of `CGAL::Surface_mesh_shortest_path`. -\cgalRefines `CopyConstructible` and `Assignable` +\cgalRefines{CopyConstructible,Assignable} \cgalHasModel `CGAL::Surface_mesh_shortest_path_traits` */ @@ -340,4 +340,4 @@ public: /// @} -}; \ No newline at end of file +}; 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 05cc98d4698..24a05f636c2 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h @@ -10,8 +10,7 @@ An absent cost indicates that the edge should not be collapsed. This could be the result of a computational limitation (such as an overflow), or can be intentionally returned to prevent the edge from being collapsed. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` +\cgalRefines{DefaultConstructible,CopyConstructible} \cgalHasModel `CGAL::Surface_mesh_simplification::Edge_length_cost` \cgalHasModel `CGAL::Surface_mesh_simplification::LindstromTurk_cost` 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 e48fbe8ccb7..e576472cb34 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h @@ -12,8 +12,7 @@ be absent). An absent result indicates that the edge should not be collapsed. This could be the result of a computational limitation (such as an overflow), or can be intentionally returned to prevent the edge from being collapsed. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` +\cgalRefines{DefaultConstructible,CopyConstructible} \cgalHasModel `CGAL::Surface_mesh_simplification::Midpoint_placement` \cgalHasModel `CGAL::Surface_mesh_simplification::LindstromTurk_placement` 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 b0b254733b4..324c87f45ee 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h @@ -12,8 +12,7 @@ priority queue. The placement returned is a `boost::optional` value (i.e., it can be absent). The value `boost::none` indicates that the edge should not be collapsed. -\cgalRefines `DefaultConstructible` -\cgalRefines `CopyConstructible` +\cgalRefines{DefaultConstructible,CopyConstructible} \cgalHasModel `CGAL::Surface_mesh_simplification::Bounded_normal_change_filter` \cgalHasModel `CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter` diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h index 03fe479f999..01c344d316c 100644 --- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h +++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h @@ -7,7 +7,7 @@ PolygonalSchema::Dart_info should be a class having a public data member std::string m_label. PolygonalSchema::dimension should be equal to 2. - \cgalRefines GenericMap + \cgalRefines{GenericMap} \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map`\endlink \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map`\endlink diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h index a92d7a1af8b..8ee52354e37 100644 --- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h +++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h @@ -4,7 +4,7 @@ The concept `PolygonalSchemaItems` allows to customize a `PolygonalSchema` by choosing the information associated with darts, and by enabling and disabling some attributes. `%Dart_wrapper::%Dart_info`, should be a class having a public data member std::string m_label. - \cgalRefines GenericMapItems + \cgalRefines{GenericMapItems} \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_min_items `CGAL::Surface_mesh_topology::Polygonal_schema_min_items`\endlink */ diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h index 0b2dc2c93bd..f418f71e47b 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h @@ -21,7 +21,7 @@ a three dimensional triangulation type The concept `SurfaceMeshCellBase_3` describes the cell base type required in this triangulation type. -\cgalRefines `DelaunayTriangulationCellBase_3` +\cgalRefines{DelaunayTriangulationCellBase_3} The concept `SurfaceMeshCellBase_3` adds four markers to mark the facets of the triangulation that belong to the two dimensional diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h index bf96a622f14..5e1f3b3098d 100644 --- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h +++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h @@ -21,7 +21,7 @@ a three dimensional triangulation type The concept `SurfaceMeshVertexBase_3` describes the vertex base type required in this triangulation type. -\cgalRefines `TriangulationVertexBase_3` +\cgalRefines{TriangulationVertexBase_3} The surface mesher algorithm issues frequent queries about the status of the vertices with respect to the two dimensional complex that represents the current surface approximation. The class diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h index f701e8e06bc..d3bc61921c5 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h @@ -3,7 +3,7 @@ \ingroup PkgTDS2Concepts \cgalConcept -\cgalRefines `TriangulationDataStructure_2::Face` +\cgalRefines{TriangulationDataStructure_2::Face} The concept `TriangulationDSFaceBase_2` describes the requirements for the face base class of a `CGAL::Triangulation_data_structure_2`. diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h index 37f979d4717..8402f4f4442 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h @@ -3,7 +3,7 @@ \ingroup PkgTDS2Concepts \cgalConcept -\cgalRefines `TriangulationDataStructure_2::Vertex` +\cgalRefines{TriangulationDataStructure_2::Vertex} The concept `TriangulationDSVertexBase_2` describes the requirements for the vertex base class of a `CGAL::Triangulation_data_structure_2`. diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h index 0c7108a3d67..4ce03689c74 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h @@ -3,7 +3,7 @@ \ingroup PkgTDS3Concepts \cgalConcept -\cgalRefines TriangulationDataStructure_3::Cell +\cgalRefines{TriangulationDataStructure_3::Cell} The concept `TriangulationDSCellBase_3` describes the requirements for the cell base class of a `CGAL::Triangulation_data_structure_3`. diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h index 9435ee7e9e5..eef2cf0d3d4 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h @@ -3,7 +3,7 @@ \ingroup PkgTDS3Concepts \cgalConcept -\cgalRefines TriangulationDataStructure_3::Vertex +\cgalRefines{TriangulationDataStructure_3::Vertex} The concept TriangulationDSVertexBase_3 describes the requirements for the vertex base class of a CGAL::Triangulation_data_structure_3. diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h index 81ee216aa7f..01d05c5c873 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h @@ -2,7 +2,7 @@ \ingroup PkgTetrahedralRemeshingConcepts \cgalConcept -\cgalRefines SimplicialMeshCellBase_3 +\cgalRefines{SimplicialMeshCellBase_3} Cell base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`. diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h index 451a9425179..d275fbc03a7 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h @@ -3,7 +3,7 @@ \ingroup PkgTetrahedralRemeshingConcepts \cgalConcept -\cgalRefines TriangulationTraits_3 +\cgalRefines{TriangulationTraits_3} The concept `RemeshingTriangulationTraits_3` is the first template parameter of the class `Remeshing_triangulation_3`. It defines the geometric objects diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h index 21fa97e1ed6..0e9b0e86003 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h @@ -2,7 +2,7 @@ \ingroup PkgTetrahedralRemeshingConcepts \cgalConcept -\cgalRefines SimplicialMeshVertexBase_3 +\cgalRefines{SimplicialMeshVertexBase_3} Vertex base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`. diff --git a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h index 06d779529ae..670217bb50d 100644 --- a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h @@ -7,7 +7,7 @@ This concept describes the geometric types and predicates required to build a Delaunay triangulation. It corresponds to the first template parameter of the class `CGAL::Delaunay_triangulation`. -\cgalRefines `TriangulationTraits` +\cgalRefines{TriangulationTraits} \cgalHasModel `CGAL::Epick_d` \cgalHasModel `CGAL::Epeck_d` diff --git a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h index 0ed01519e69..00ec18a9e8c 100644 --- a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h @@ -7,7 +7,7 @@ This concept describes the geometric types and predicates required to build a regular triangulation. It corresponds to the first template parameter of the class `CGAL::Regular_triangulation`. -\cgalRefines `TriangulationTraits` +\cgalRefines{TriangulationTraits} \cgalHasModel `CGAL::Epick_d` \cgalHasModel `CGAL::Epeck_d` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h index 3c32f97f7c5..a29eef83396 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h @@ -34,7 +34,7 @@ that the `CGAL::Triangulation_data_structure` actually uses as a base class for the class of `CGAL::Triangulation_data_structure::Vertex`. -\cgalRefines `TriangulationDataStructure::FullCell` +\cgalRefines{TriangulationDataStructure::FullCell} \cgalHasModel `CGAL::Triangulation_ds_full_cell` \cgalHasModel `CGAL::Triangulation_full_cell` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h index 5e3def7d9bd..30b22c4994b 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h @@ -34,7 +34,7 @@ that the `CGAL::Triangulation_data_structure` actually uses as a base class for the class of `CGAL::Triangulation_data_structure::Vertex`. -\cgalRefines `TriangulationDataStructure::Vertex` +\cgalRefines{TriangulationDataStructure::Vertex} \cgalHasModel `CGAL::Triangulation_ds_vertex` \cgalHasModel `CGAL::Triangulation_vertex` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h index 8c0f1f76cf4..74750c4117a 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h @@ -7,8 +7,8 @@ The concept `TriangulationFullCell` describes the requirements on the type used class `CGAL::Triangulation`, and its derived classes, to represent a full cell. -\cgalRefines `TriangulationDSFullCell` We only list below the -additional specific requirements of `TriangulationFullCell`. +\cgalRefines{TriangulationDSFullCell We only list below the +additional specific requirements of `TriangulationFullCell`} \cgalHasModel `CGAL::Triangulation_full_cell` diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h index 52a4d18d176..87018c11c3c 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h @@ -7,7 +7,7 @@ This concept describes the geometric types and predicates required to build a triangulation. It corresponds to the first template parameter of the class `CGAL::Triangulation`. -\cgalRefines `SpatialSortingTraits_d` +\cgalRefines{SpatialSortingTraits_d} If a range of points is inserted, the traits must refine `SpatialSortingTraits_d`. The insertion is diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h index 6b2e67375ae..0ea82971793 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h @@ -7,7 +7,7 @@ The concept `TriangulationVertex` describes the requirements on the type used by class `CGAL::Triangulation`, and its derived classes, to represent a vertex. -\cgalRefines `TriangulationDSVertex` +\cgalRefines{TriangulationDSVertex} We only list below the additional specific requirements of ::TriangulationVertex. Compared to ::TriangulationDSVertex, the main difference is the addition of an association of the vertex with a geometric point. diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h index c804bcfb43f..f0483d539cc 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h @@ -15,8 +15,7 @@ The concept `ConstrainedDelaunayTriangulationTraits_2` refines both the concept `DelaunayTriangulationTraits_2` and the concept `ConstrainedTriangulationTraits_2`. -\cgalRefines `DelaunayTriangulationTraits_2` -\cgalRefines `ConstrainedTriangulationTraits_2` +\cgalRefines{DelaunayTriangulationTraits_2,ConstrainedTriangulationTraits_2} \cgalHasModel All \cgal Kernels \cgalHasModel `CGAL::Projection_traits_xy_3` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h index 25e727870aa..1d49d678c47 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h @@ -13,7 +13,7 @@ has to be a model of the concept providing functionalities to deal with constraints. -\cgalRefines `TriangulationFaceBase_2` +\cgalRefines{TriangulationFaceBase_2} \cgalHeading{Types} diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h index a9dd8effbb9..fe3a7ec053e 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h @@ -17,7 +17,7 @@ traits class is also required to provide additional types to compute the squared distance between a point and a line -\cgalRefines `TriangulationTraits_2` +\cgalRefines{TriangulationTraits_2} \cgalHasModel All \cgal Kernels \cgalHasModel `CGAL::Projection_traits_3` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h index 5eaf3c65fbb..32b251a5060 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h @@ -19,7 +19,7 @@ and are required only if the dual functions are called. The additional predicate type `Compare_distance_2` is required if the method `nearest_vertex()` is used. -\cgalRefines `TriangulationTraits_2` +\cgalRefines{TriangulationTraits_2} \cgalHasModel \cgal kernels diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h index 9f06a2a0c9c..6d69fe98604 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h @@ -32,7 +32,7 @@ of the concept `RegularTriangulationFaceBase_2` , which refines the concept `TriangulationFaceBase_2` by adding in the face a list to store hidden vertices. -\cgalRefines `TriangulationFaceBase_2` +\cgalRefines{TriangulationFaceBase_2} \cgalHasModel `CGAL::Regular_triangulation_face_base_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h index dcdbe5c4ee3..89ae384c8bf 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h @@ -16,7 +16,7 @@ is the fundamental test to build regular triangulations as the `side_of_oriented_circle` test is the fundamental test of Delaunay triangulations. -\cgalRefines `TriangulationTraits_2` +\cgalRefines{TriangulationTraits_2} \cgalHasModel All models of `Kernel`. diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h index b60278ee1d2..62230e270a7 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h @@ -33,7 +33,7 @@ The concept `RegularTriangulationVertexBase_2` refines the concept just adding a Boolean to mark if the vertex is a vertex of the triangulation or a hidden vertex. -\cgalRefines `TriangulationVertexBase_2` +\cgalRefines{TriangulationVertexBase_2} \cgalHasModel `CGAL::Regular_triangulation_vertex_base_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h index 8d72a27345d..353f5631060 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h @@ -14,7 +14,7 @@ currently the triangulations do not store any geometric information in the faces and, thus this concept is just equal to `TriangulationDSFaceBase_2` and only provided for symmetry with the vertex case. -\cgalRefines `TriangulationDSFaceBase_2` +\cgalRefines{TriangulationDSFaceBase_2} \cgalHasModel `CGAL::Triangulation_face_base_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h index e2d570c15fd..5d473eabfb6 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h @@ -12,7 +12,7 @@ refines the concept `TriangulationVertexBase_2`, adding handles to the corresponding vertices in the next and previous level triangulations. -\cgalRefines `TriangulationVertexBase_2` +\cgalRefines{TriangulationVertexBase_2} \cgalHasModel `CGAL::Triangulation_hierarchy_vertex_base_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h index 82340f339f1..eeee9572516 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h @@ -3,7 +3,7 @@ \ingroup PkgTriangulation2Concepts \cgalConcept -\cgalRefines SpatialSortingTraits_2 +\cgalRefines{SpatialSortingTraits_2} The concept `TriangulationTraits_2` describes the set of requirements to be fulfilled by any class used to instantiate the first template diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h index 08153a6ae31..0ce1e0012c9 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h @@ -6,7 +6,7 @@ A type model of this concept can be used as vertex base by a triangulation and provides an additional information storage. -\cgalRefines `TriangulationVertexBase_2` +\cgalRefines{TriangulationVertexBase_2} \cgalHasModel `CGAL::Triangulation_vertex_base_with_info_2` diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h index c48ecda0440..bec156dc516 100644 --- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h +++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h @@ -13,7 +13,7 @@ The concept `TriangulationVertexBase_2` refines the concept adding geometric information: the vertex base of a triangulation stores a point. -\cgalRefines `TriangulationDSVertexBase_2` +\cgalRefines{TriangulationDSVertexBase_2} \cgalHasModel `CGAL::Triangulation_vertex_base_2` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h index b9fca9c841f..b6e1a9b2515 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h @@ -9,7 +9,7 @@ the concept `TriangulationCellBase_3` by adding in the cell an operator that computes its circumcenter. -\cgalRefines `TriangulationCellBase_3` +\cgalRefines{TriangulationCellBase_3} \cgalHasModel `CGAL::Delaunay_triangulation_cell_base_3` \cgalHasModel `CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h index 36b9c71d8d2..c1f46f3fb4f 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h @@ -8,7 +8,7 @@ The concept `DelaunayTriangulationTraits_3` is the first template parameter of t segments...) forming the triangulation together with a few geometric predicates and constructions on these objects. -\cgalRefines `TriangulationTraits_3` +\cgalRefines{TriangulationTraits_3} \cgalHasModel `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended) \cgalHasModel `CGAL::Exact_predicates_exact_constructions_kernel` (recommended for Voronoi) diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h index a864994ac49..4f83db499d7 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h @@ -17,7 +17,7 @@ is returned. Functions that modify the vertices of the cell will also invalidate the weighted circumcenter by calling `invalidate_weighted_circumcenter_cache()`. -\cgalRefines `RegularTriangulationCellBase_3` +\cgalRefines{RegularTriangulationCellBase_3} \cgalHasModel `CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h index f90ebf94b1d..7a00e04f1d8 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h @@ -33,7 +33,7 @@ the concept `TriangulationCellBase_3` by adding in the cell a container to store hidden points and an operator to compute its weighted circumcenter. -\cgalRefines `TriangulationCellBase_3` +\cgalRefines{TriangulationCellBase_3} \cgalHasModel `CGAL::Regular_triangulation_cell_base_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h index e04b4c5a203..91057fe887f 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h @@ -13,7 +13,7 @@ Triangulation3secclassRegulartriangulation. To simplify notation, \f$ p\f$ will often denote in the sequel either the point \f$ p\in\mathbb{R}^3\f$ or the weighted point \f$ {p}^{(w)}=(p,w_p)\f$. -\cgalRefines `TriangulationTraits_3` +\cgalRefines{TriangulationTraits_3} \cgalHasModel All models of `Kernel`. diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h index 4de91c31526..3881593c2d3 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h @@ -7,7 +7,7 @@ The base vertex of a regular triangulation must be a model of the concept `RegularTriangulationVertexBase_3`, which refines the concept `TriangulationDSVertexBase_3` by adding a geometric point member. -\cgalRefines `TriangulationDSVertexBase_3` +\cgalRefines{TriangulationDSVertexBase_3} \cgalHasModel `CGAL::Regular_triangulation_vertex_base_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h index 8f53f0fbc6c..5064256e445 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h @@ -6,7 +6,7 @@ A type model of this concept can be used as cell base by a triangulation and provides an additional information storage. -\cgalRefines `TriangulationCellBase_3` +\cgalRefines{TriangulationCellBase_3} \cgalHasModel `CGAL::Triangulation_cell_base_with_info_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h index 7486341f733..69ae982347c 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h @@ -8,7 +8,7 @@ geometric information, so only the requirements of the triangulation data structure apply. -\cgalRefines `TriangulationDSCellBase_3` +\cgalRefines{TriangulationDSCellBase_3} \cgalHasModel `CGAL::Triangulation_cell_base_3` \cgalHasModel `CGAL::Triangulation_cell_base_with_info_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h index fe8a37f203b..d7c62d3e4c6 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h @@ -3,7 +3,7 @@ \ingroup PkgTriangulation3Concepts \cgalConcept -\cgalRefines SpatialSortingTraits_3 +\cgalRefines{SpatialSortingTraits_3} The concept `TriangulationTraits_3` is the first template parameter of the class `Triangulation_3`. It defines the geometric objects (points, segments, diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h index 677a66d94b4..c9cf46d0062 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h @@ -6,7 +6,7 @@ A type model of this concept can be used as vertex base by a triangulation and provides an additional information storage. -\cgalRefines `TriangulationVertexBase_3` +\cgalRefines{TriangulationVertexBase_3} \cgalHasModel `CGAL::Triangulation_vertex_base_with_info_3` diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h index c113c124403..cd91c12e9a8 100644 --- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h +++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h @@ -7,7 +7,7 @@ The vertex base used by the geometric triangulation must store a point. We list here the additional requirements compared to a vertex base usable for the triangulation data structure. -\cgalRefines `TriangulationDSVertexBase_3` +\cgalRefines{TriangulationDSVertexBase_3} \cgalHasModel `CGAL::Triangulation_vertex_base_3` \cgalHasModel `CGAL::Triangulation_vertex_base_with_info_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 ca03f9c3c1f..397c3a7e799 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 @@ -2,7 +2,7 @@ \ingroup PkgTriangulationOnSphere2Concepts \cgalConcept -\cgalRefines TriangulationOnSphereTraits_2 +\cgalRefines{TriangulationOnSphereTraits_2} The concept `DelaunayTriangulationOnSphereTraits_2` describes the set of requirements to be fulfilled by any class used to instantiate the first template 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 ab66482d9bb..fbb6ac030ed 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 @@ -2,7 +2,7 @@ \ingroup PkgTriangulationOnSphere2Concepts \cgalConcept -\cgalRefines `TriangulationDSFaceBase_2` +\cgalRefines{TriangulationDSFaceBase_2} The concept `TriangulationOnSphereFaceBase_2` describes the requirements for a face class of a triangulation data structure that is itself plugged into a triangulation on the sphere. 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 c93c6b88ebc..0dad5563ff7 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 @@ -2,7 +2,7 @@ \ingroup PkgTriangulationOnSphere2Concepts \cgalConcept -\cgalRefines SpatialSortingTraits_3 +\cgalRefines{SpatialSortingTraits_3} The concept `TriangulationOnSphereTraits_2` describes the set of requirements to be fulfilled by any class used to instantiate the first template 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 70fbbc3131b..23b6971fd89 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 @@ -2,7 +2,7 @@ \ingroup PkgTriangulationOnSphere2Concepts \cgalConcept -\cgalRefines `TriangulationDSVertexBase_2` +\cgalRefines{TriangulationDSVertexBase_2} The concept `TriangulationOnSphereVertexBase_2` describes the requirements for the vertex base class of a triangulation data structure to be plugged in a triangulation on the sphere. diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h index a46f2df3594..e0dd1cdc461 100644 --- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h +++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h @@ -15,8 +15,7 @@ that is similar to that of \cgal's arrangements. \tparam AP must be a model of the `AdaptationPolicy_2` concept. The third template parameter defaults to `CGAL::Identity_policy_2`. -\cgalRefines `DefaultConstructible,` \cgalRefines `CopyConstructible,` \cgalRefines `Assignable` - +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \sa `CGAL::Delaunay_triangulation_2` \sa `CGAL::Regular_triangulation_2` diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h index eb747a669a4..43519f9e79c 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 @@ -11,7 +11,7 @@ functor is optional and a tag determines whether it is provided or not. Note that while the first two functors do not modify the Delaunay graph they take as an argument, the last ones does. -\cgalRefines `DefaultConstructible,` \cgalRefines `CopyConstructible,` \cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Identity_policy_2` \cgalHasModel `CGAL::Apollonius_graph_degeneracy_removal_policy_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 4cc31a5b14c..201e815138b 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 @@ -9,7 +9,7 @@ accessing geometric information in the Delaunay graph that is needed by the It optionally defines a functor for performing nearest site queries. A tag is provided for determining whether this functor is defined or not. -\cgalRefines `DefaultConstructible,` \cgalRefines `CopyConstructible,` \cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHasModel `CGAL::Apollonius_graph_adaptation_traits_2` \cgalHasModel `CGAL::Delaunay_triangulation_adaptation_traits_2` diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h index 50f807bf0bb..3459c48dc9f 100644 --- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h +++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h @@ -9,7 +9,7 @@ class. The `DelaunayGraph_2` concept essentially defines the requirements that a class representing a Delaunay graph must obey so that the Voronoi diagram adaptor can adapt it. -\cgalRefines `DefaultConstructible,` \cgalRefines `CopyConstructible,` \cgalRefines `Assignable` +\cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \cgalHeading{Traversal of the Delaunay graph}