From d7f3bba7429b8883b24b1eee2e8e59a0980d72d9 Mon Sep 17 00:00:00 2001 From: albert-github Date: Wed, 1 Feb 2023 18:13:16 +0100 Subject: [PATCH 1/5] issue #7231 Improvement of layout of refines relations. Implemented: - no extra "Refines" page - Refines on one line - Refines always in code style - `2 arguments` -> `two arguments` (for consistency - added also the `\qualifier` Implemented in Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h Results a.o. - doc_output/Kernel_23/classKernel_1_1Circle__2.html - doc_output/Kernel_23/classKernel_1_1BoundedSide__3.html Note: due to the fact that this is a test implementation pages outside the scope of Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h might not be correct (in respect to code appearance of refines and multiple refines) --- .../doc/resources/1.9.3/BaseDoxyfile.in | 4 +- .../Concepts/FunctionObjectConcepts.h | 534 +++++++++--------- 2 files changed, 268 insertions(+), 270 deletions(-) diff --git a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in index 775ba2ce757e..1c7aa5fe6100 100644 --- a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in @@ -321,7 +321,9 @@ ALIASES = "cgal=%CGAL" \ "cgalFigureCaptionEnd=\htmlonly[block] \endhtmlonly
" \ "cgalConcept=\details
^^ \brief" \ "cgalConceptNamespace=\details
^^ \brief" \ - "cgalRefines=\xrefitem refines \"Refines\" \"Refinement Relationships\"" \ + "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." \ "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/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h b/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h index c770d0b7b404..e808efa2b3ff 100644 --- a/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h +++ b/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h @@ -103,7 +103,7 @@ class Angle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `are_ordered_along_line_grp` @@ -133,7 +133,7 @@ class AreOrderedAlongLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `are_ordered_along_line_grp` @@ -163,7 +163,7 @@ class AreOrderedAlongLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `parallel_grp` @@ -204,7 +204,7 @@ class AreParallel_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `parallel_grp` @@ -253,7 +253,7 @@ class AreParallel_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `are_strictly_ordered_along_line_grp` @@ -285,7 +285,7 @@ class AreStrictlyOrderedAlongLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `are_strictly_ordered_along_line_grp` @@ -317,7 +317,7 @@ class AreStrictlyOrderedAlongLine_3 { \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Object` \sa `Kernel::Object_2` @@ -348,7 +348,7 @@ class Assign_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. \sa `CGAL::Object` @@ -379,7 +379,7 @@ class Assign_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` \sa `CGAL::Triangle_2` @@ -428,7 +428,7 @@ class BoundedSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Sphere_3` @@ -481,9 +481,7 @@ class BoundedSide_3 { A type representing an iterator to the Cartesian coordinates of a point in two dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \sa `Kernel::ConstructCartesianConstIterator_2` @@ -500,9 +498,7 @@ class CartesianConstIterator_2 { A type representing an iterator to the Cartesian coordinates of a point in three dimensions. - \cgalRefines CopyConstructible - \cgalRefines Assignable - \cgalRefines DefaultConstructible + \cgalRefines{CopyConstructible,Assignable,DefaultConstructible} \sa `Kernel::ConstructCartesianConstIterator_3` @@ -516,7 +512,7 @@ class CartesianConstIterator_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `collinear_are_ordered_along_line_grp` @@ -545,7 +541,7 @@ class CollinearAreOrderedAlongLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `collinear_are_ordered_along_line_grp` @@ -573,7 +569,7 @@ class CollinearAreOrderedAlongLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `collinear_are_strictly_ordered_along_line_grp` @@ -602,7 +598,7 @@ class CollinearAreStrictlyOrderedAlongLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `collinear_are_strictly_ordered_along_line_grp` @@ -631,7 +627,7 @@ class CollinearAreStrictlyOrderedAlongLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Ray_2` \sa `CGAL::Segment_2` @@ -666,7 +662,7 @@ class CollinearHasOn_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `collinear_grp` @@ -693,7 +689,7 @@ class Collinear_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `collinear_grp` @@ -720,7 +716,7 @@ class Collinear_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} */ class CompareAngleWithXAxis_2 { @@ -825,7 +821,7 @@ class CompareDihedralAngle_3 { \sa `compare_distance_to_point_grp` \sa `compare_squared_distance_grp` - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} */ class CompareDistance_2 { @@ -876,7 +872,7 @@ class CompareDistance_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `Kernel::CompareSquaredDistance_3` \sa `compare_distance_to_point_grp` @@ -927,7 +923,7 @@ class CompareDistance_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_2` for the definition of power distance. @@ -954,7 +950,7 @@ class ComparePowerDistance_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definition of power distance. @@ -983,7 +979,7 @@ class ComparePowerDistance_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} */ class CompareSignedDistanceToLine_2 { public: @@ -1014,7 +1010,7 @@ class CompareSignedDistanceToLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_slopes_grp` @@ -1060,7 +1056,7 @@ class CompareSlope_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_slopes_grp` @@ -1095,7 +1091,7 @@ class CompareSlope_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `compare_distance_to_point_grp` \sa `compare_squared_distance_grp` @@ -1131,7 +1127,7 @@ class CompareSquaredDistance_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `Kernel::CompareDistance_3` \sa `compare_distance_to_point_grp` @@ -1167,7 +1163,7 @@ class CompareSquaredDistance_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `compare_squared_radius_grp` @@ -1223,7 +1219,7 @@ class CompareSquaredRadius_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` +\cgalRefines{AdaptableFunctor} \sa `ComputePowerProduct_3` for the definition of of orthogonality for power distances. @@ -1268,7 +1264,7 @@ class CompareWeightedSquaredRadius_3 \image html compare_x_at_y.png \image latex compare_x_at_y.png - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `compare_x_at_y_grp` @@ -1329,7 +1325,7 @@ class CompareXAtY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_xyz_grp` @@ -1358,7 +1354,7 @@ class CompareXYZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_xy_grp` \sa `Kernel::CompareYX_2` @@ -1388,7 +1384,7 @@ class CompareXY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_xy_grp` @@ -1422,7 +1418,7 @@ class CompareXY_3 { \image html compare1.png \image latex compare1.png - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_x_grp` @@ -1478,7 +1474,7 @@ class CompareX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_x_grp` @@ -1509,7 +1505,7 @@ class CompareX_3 { \image html compare2.png \image latex compare2.png - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \anchor fig-compare2 \sa `compare_y_at_x_grp` @@ -1596,7 +1592,7 @@ class CompareYAtX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_yx_grp` \sa `Kernel::CompareXY_2` @@ -1630,7 +1626,7 @@ class CompareYX_2 { \image html compare1.png \image latex compare1.png - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_y_grp` @@ -1689,7 +1685,7 @@ class CompareY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_y_grp` @@ -1716,7 +1712,7 @@ class CompareY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_z_grp` @@ -1744,7 +1740,7 @@ class CompareZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeA_2 { @@ -1767,7 +1763,7 @@ class ComputeA_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeA_3 { @@ -1792,7 +1788,7 @@ class ComputeA_3 { \sa `CGAL::Circle_3` - \cgalRefines AdaptableFunctor + \cgalRefines{AdaptableFunctor} */ class ComputeApproximateArea_3 { @@ -1816,7 +1812,7 @@ class ComputeApproximateArea_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeApproximateAngle_3 { @@ -1852,7 +1848,7 @@ class ComputeApproximateAngle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeApproximateDihedralAngle_3 { @@ -1882,7 +1878,7 @@ class ComputeApproximateDihedralAngle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Circle_3` @@ -1907,7 +1903,7 @@ class ComputeApproximateSquaredLength_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Circle_3` @@ -1932,7 +1928,7 @@ class ComputeAreaDividedByPi_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Iso_rectangle_2` \sa `CGAL::Triangle_2` @@ -1971,7 +1967,7 @@ class ComputeArea_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Triangle_3` @@ -2005,7 +2001,7 @@ class ComputeArea_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeB_2 { @@ -2029,7 +2025,7 @@ class ComputeB_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeB_3 { @@ -2053,7 +2049,7 @@ class ComputeB_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeC_2 { @@ -2077,7 +2073,7 @@ class ComputeC_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeC_3 { @@ -2101,7 +2097,7 @@ class ComputeC_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeD_3 { @@ -2125,7 +2121,7 @@ class ComputeD_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_2` \sa `determinant_grp` @@ -2152,7 +2148,7 @@ class ComputeDeterminant_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `CGAL::Vector_3` \sa `determinant_grp` @@ -2183,7 +2179,7 @@ class ComputeDeterminant_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeDx_2 { @@ -2207,7 +2203,7 @@ class ComputeDx_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeDx_3 { @@ -2231,7 +2227,7 @@ class ComputeDx_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeDy_2 { @@ -2254,7 +2250,7 @@ class ComputeDy_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeDy_3 { @@ -2277,7 +2273,7 @@ class ComputeDy_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeDz_3 { @@ -2300,7 +2296,7 @@ class ComputeDz_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeHx_2 { @@ -2328,7 +2324,7 @@ class ComputeHx_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeHx_3 { @@ -2356,7 +2352,7 @@ class ComputeHx_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeHy_2 { @@ -2384,7 +2380,7 @@ class ComputeHy_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeHy_3 { @@ -2412,7 +2408,7 @@ class ComputeHy_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeHw_2 { @@ -2441,7 +2437,7 @@ class ComputeHw_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeHw_3 { @@ -2469,7 +2465,7 @@ class ComputeHw_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeHz_3 { @@ -2497,7 +2493,7 @@ class ComputeHz_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with five arguments) + \cgalRefines{AdaptableFunctor (with five arguments)} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definitions of power distance and orthogonality. @@ -2526,7 +2522,7 @@ class ComputePowerDistanceToPowerSphere_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_3` @@ -2567,7 +2563,7 @@ class ComputePowerProduct_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_2` @@ -2611,7 +2607,7 @@ class ComputePowerProduct_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with 2 arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} */ class ComputeLInfinityDistance_2 { @@ -2634,7 +2630,7 @@ class ComputeLInfinityDistance_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeLInfinityDistance_3 { @@ -2662,7 +2658,7 @@ class ComputeLInfinityDistance_3 { \sa `CGAL::Vector_2` \sa scalar_product_grp - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} */ class ComputeScalarProduct_2 { @@ -2686,7 +2682,7 @@ class ComputeScalarProduct_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_3` \sa scalar_product_grp @@ -2714,7 +2710,7 @@ class ComputeScalarProduct_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Triangle_3` @@ -2746,7 +2742,7 @@ class ComputeSquaredArea_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `squared_distance_grp` @@ -2781,7 +2777,7 @@ class ComputeSquaredDistance_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `squared_distance_grp` @@ -2817,7 +2813,7 @@ class ComputeSquaredDistance_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Circle_3` @@ -2843,7 +2839,7 @@ class ComputeSquaredLengthDividedByPiSquare_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Vector_2` \sa `CGAL::Segment_2` @@ -2874,7 +2870,7 @@ class ComputeSquaredLength_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Vector_3` \sa `CGAL::Segment_3` @@ -2905,7 +2901,7 @@ class ComputeSquaredLength_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Circle_2` \sa `squared_radius_grp` @@ -2952,7 +2948,7 @@ class ComputeSquaredRadius_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Sphere_3` \sa `CGAL::Circle_3` @@ -3018,7 +3014,7 @@ class ComputeSquaredRadius_3 { \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_2` for the definition of orthogonality for power distances. -\cgalRefines `AdaptableFunctor` +\cgalRefines{AdaptableFunctor} */ class ComputeSquaredRadiusSmallestOrthogonalCircle_2 @@ -3051,7 +3047,7 @@ class ComputeSquaredRadiusSmallestOrthogonalCircle_2 \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definition of of orthogonality for power distances. -\cgalRefines `AdaptableFunctor` +\cgalRefines{AdaptableFunctor} */ class ComputeSquaredRadiusSmallestOrthogonalSphere_3 @@ -3086,7 +3082,7 @@ class ComputeSquaredRadiusSmallestOrthogonalSphere_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Tetrahedron_3` @@ -3130,7 +3126,7 @@ class ComputeVolume_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeWeight_2 { @@ -3152,7 +3148,7 @@ class ComputeWeight_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeWeight_3 { @@ -3177,7 +3173,7 @@ class ComputeWeight_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeX_2 { @@ -3206,7 +3202,7 @@ class ComputeX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeX_3 { @@ -3234,7 +3230,7 @@ class ComputeX_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeXmax_2 { @@ -3257,7 +3253,7 @@ class ComputeXmax_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeXmax_3 { @@ -3280,7 +3276,7 @@ class ComputeXmax_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeXmin_2 { @@ -3303,7 +3299,7 @@ class ComputeXmin_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeXmin_3 { @@ -3328,7 +3324,7 @@ class ComputeXmin_3 { \sa `compare_y_at_x_grp` - \cgalRefines AdaptableFunctor + \cgalRefines{AdaptableFunctor} */ class ComputeYAtX_2 { @@ -3354,7 +3350,7 @@ class ComputeYAtX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeY_2 { @@ -3382,7 +3378,7 @@ class ComputeY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeY_3 { @@ -3410,7 +3406,7 @@ class ComputeY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeYmax_2 { @@ -3433,7 +3429,7 @@ class ComputeYmax_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeYmax_3 { @@ -3456,7 +3452,7 @@ class ComputeYmax_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeYmin_2 { @@ -3479,7 +3475,7 @@ class ComputeYmin_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeYmin_3 { @@ -3502,7 +3498,7 @@ class ComputeYmin_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeZ_3 { @@ -3530,7 +3526,7 @@ class ComputeZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeZmax_3 { @@ -3550,7 +3546,7 @@ class ComputeZmax_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` + \cgalRefines{AdaptableFunctor} */ class ComputeZmin_3 { @@ -3571,7 +3567,7 @@ class ComputeZmin_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `Kernel::ConstructCentroid_2` \sa `centroid_grp` @@ -3648,7 +3644,7 @@ class ConstructBarycenter_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `Kernel::ConstructCentroid_3` \sa `centroid_grp` @@ -3726,7 +3722,7 @@ class ConstructBarycenter_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` @@ -3756,7 +3752,7 @@ class ConstructBaseVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} */ class ConstructBbox_2 { @@ -3804,7 +3800,7 @@ class ConstructBbox_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} */ class ConstructBbox_3 { @@ -3864,7 +3860,7 @@ class ConstructBbox_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines AdaptableFunctor + \cgalRefines{AdaptableFunctor} \sa `bisector_grp` @@ -3904,7 +3900,7 @@ class ConstructBisector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `bisector_grp` @@ -3946,7 +3942,7 @@ class ConstructBisector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `Kernel::CartesianConstIterator_2` @@ -3992,7 +3988,7 @@ class ConstructCartesianConstIterator_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `Kernel::CartesianConstIterator_3` @@ -4036,7 +4032,7 @@ class ConstructCartesianConstIterator_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with one argument) +\cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Circle_2` @@ -4061,7 +4057,7 @@ class ConstructCenter_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Sphere_3` \sa `CGAL::Circle_3` @@ -4093,7 +4089,7 @@ class ConstructCenter_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `Kernel::ConstructBarycenter_2` \sa `centroid_grp` @@ -4135,7 +4131,7 @@ class ConstructCentroid_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `Kernel::ConstructBarycenter_3` \sa `centroid_grp` @@ -4182,7 +4178,7 @@ class ConstructCentroid_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `CGAL::Circle_2` @@ -4253,7 +4249,7 @@ class ConstructCircle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `CGAL::Circle_3` @@ -4335,7 +4331,7 @@ class ConstructCircle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `circumcenter_grp` @@ -4375,7 +4371,7 @@ class ConstructCircumcenter_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `circumcenter_grp` @@ -4431,7 +4427,7 @@ class ConstructCircumcenter_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `cross_product_grp` \sa `determinant_grp` @@ -4458,7 +4454,7 @@ class ConstructCrossProductVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_2` @@ -4484,7 +4480,7 @@ class ConstructDifferenceOfVectors_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_3` @@ -4511,7 +4507,7 @@ class ConstructDifferenceOfVectors_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Direction_2` @@ -4552,7 +4548,7 @@ class ConstructDirection_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Direction_3` @@ -4593,7 +4589,7 @@ class ConstructDirection_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_2` @@ -4619,7 +4615,7 @@ class ConstructDividedVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_3` @@ -4645,7 +4641,7 @@ class ConstructDividedVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `equidistant_line_grp` @@ -4674,7 +4670,7 @@ class ConstructEquidistantLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with two arguments) +\cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Iso_cuboid_3` @@ -4729,7 +4725,7 @@ class ConstructIsoCuboid_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Iso_rectangle_2` @@ -4782,7 +4778,7 @@ class ConstructIsoRectangle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` \sa `ConstructProjectedXYPoint_2` @@ -4811,7 +4807,7 @@ class ConstructLiftedPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Line_2` @@ -4864,7 +4860,7 @@ class ConstructLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Line_3` @@ -4918,7 +4914,7 @@ class ConstructLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Iso_rectangle_2` \sa `CGAL::Segment_2` @@ -4953,7 +4949,7 @@ class ConstructMaxVertex_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Segment_3` @@ -4989,7 +4985,7 @@ class ConstructMaxVertex_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `midpoint_grp` @@ -5019,7 +5015,7 @@ class ConstructMidpoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `midpoint_grp` @@ -5051,7 +5047,7 @@ class ConstructMidpoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Iso_rectangle_2` \sa `CGAL::Segment_2` @@ -5086,7 +5082,7 @@ class ConstructMinVertex_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Segment_3` @@ -5121,7 +5117,7 @@ class ConstructMinVertex_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `normal_grp` \sa `unit_normal_grp` @@ -5151,7 +5147,7 @@ class ConstructNormal_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. @@ -5183,7 +5179,7 @@ class ConstructObject_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. \sa `CGAL::Object` @@ -5215,7 +5211,7 @@ class ConstructObject_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Circle_2` @@ -5241,7 +5237,7 @@ class ConstructOppositeCircle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Direction_2` @@ -5268,7 +5264,7 @@ class ConstructOppositeDirection_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Direction_3` @@ -5295,7 +5291,7 @@ class ConstructOppositeDirection_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Line_2` @@ -5323,7 +5319,7 @@ class ConstructOppositeLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Line_3` @@ -5349,7 +5345,7 @@ class ConstructOppositeLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Plane_3` @@ -5375,7 +5371,7 @@ class ConstructOppositePlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Ray_2` @@ -5400,7 +5396,7 @@ class ConstructOppositeRay_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Ray_3` @@ -5426,7 +5422,7 @@ class ConstructOppositeRay_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Segment_2` @@ -5452,7 +5448,7 @@ class ConstructOppositeSegment_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Segment_3` @@ -5480,7 +5476,7 @@ class ConstructOppositeSegment_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Sphere_3` @@ -5506,7 +5502,7 @@ class ConstructOppositeSphere_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Triangle_2` @@ -5534,7 +5530,7 @@ class ConstructOppositeTriangle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Vector_2` @@ -5559,7 +5555,7 @@ class ConstructOppositeVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with one argument) +\cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Vector_3` @@ -5585,7 +5581,7 @@ class ConstructOppositeVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Plane_3` \sa `Kernel::ConstructCrossProductVector_3` @@ -5621,7 +5617,7 @@ class ConstructOrthogonalVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Direction_2` @@ -5651,7 +5647,7 @@ class ConstructPerpendicularDirection_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Line_2` @@ -5679,7 +5675,7 @@ class ConstructPerpendicularLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` @@ -5709,7 +5705,7 @@ class ConstructPerpendicularLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` @@ -5737,7 +5733,7 @@ class ConstructPerpendicularPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_2` @@ -5768,7 +5764,7 @@ class ConstructPerpendicularVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` @@ -5849,7 +5845,7 @@ class ConstructPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Line_2` \sa `CGAL::Ray_2` @@ -5898,7 +5894,7 @@ class ConstructPointOn_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Line_3` \sa `CGAL::Plane_3` @@ -5952,7 +5948,7 @@ class ConstructPointOn_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Point_2` @@ -5993,7 +5989,7 @@ class ConstructPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Point_3` @@ -6033,7 +6029,7 @@ class ConstructPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Line_2` @@ -6059,7 +6055,7 @@ class ConstructProjectedPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Line_3` \sa `CGAL::Plane_3` @@ -6110,7 +6106,7 @@ class ConstructProjectedPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` \sa `ConstructLiftedPoint_3` @@ -6142,7 +6138,7 @@ class ConstructProjectedXYPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Weighted_point_2` @@ -6167,7 +6163,7 @@ class ConstructRadicalAxis_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` @@ -6196,7 +6192,7 @@ class ConstructRadicalLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two argument) + \cgalRefines{AdaptableFunctor (with two argument)} \sa `CGAL::Sphere_3` @@ -6224,7 +6220,7 @@ class ConstructRadicalPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Ray_2` @@ -6272,7 +6268,7 @@ class ConstructRay_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Ray_3` @@ -6320,7 +6316,7 @@ class ConstructRay_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_2` */ @@ -6349,7 +6345,7 @@ class ConstructScaledVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_3` @@ -6382,7 +6378,7 @@ class ConstructScaledVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Ray_2` @@ -6410,7 +6406,7 @@ class ConstructSecondPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Ray_3` @@ -6438,7 +6434,7 @@ class ConstructSecondPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Segment_2` @@ -6465,7 +6461,7 @@ class ConstructSegment_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Segment_3` @@ -6492,7 +6488,7 @@ class ConstructSegment_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Segment_2` \sa `CGAL::Ray_2` @@ -6528,7 +6524,7 @@ class ConstructSource_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Segment_3` \sa `CGAL::Ray_3` @@ -6564,7 +6560,7 @@ class ConstructSource_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `CGAL::Sphere_3` @@ -6640,7 +6636,7 @@ class ConstructSphere_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_2` @@ -6668,7 +6664,7 @@ class ConstructSumOfVectors_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_3` @@ -6694,7 +6690,7 @@ class ConstructSumOfVectors_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Triangle_3` @@ -6719,7 +6715,7 @@ class ConstructSupportingPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Segment_2` @@ -6746,7 +6742,7 @@ class ConstructTarget_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Segment_3` @@ -6773,7 +6769,7 @@ class ConstructTarget_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `CGAL::Tetrahedron_3` @@ -6801,7 +6797,7 @@ class ConstructTetrahedron_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Point_2` @@ -6837,7 +6833,7 @@ class ConstructTranslatedPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Point_3` @@ -6873,7 +6869,7 @@ class ConstructTranslatedPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `CGAL::Triangle_2` @@ -6900,7 +6896,7 @@ class ConstructTriangle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `CGAL::Triangle_3` @@ -6929,7 +6925,7 @@ class ConstructTriangle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with three arguments) +\cgalRefines{AdaptableFunctor (with three arguments)} \sa `normal_grp` \sa `unit_normal_grp` @@ -6959,7 +6955,7 @@ class ConstructUnitNormal_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_2` \sa `Kernel::ConstructScaledVector_2` @@ -7019,7 +7015,7 @@ class ConstructVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Vector_3` \sa `Kernel::ConstructScaledVector_3` @@ -7079,7 +7075,7 @@ class ConstructVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Iso_rectangle_2` \sa `CGAL::Segment_2` @@ -7128,7 +7124,7 @@ class ConstructVertex_2 { \image html IsoCuboid.png \image latex IsoCuboid.png -\cgalRefines `AdaptableFunctor` (with two arguments) +\cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Segment_3` @@ -7182,7 +7178,7 @@ class ConstructVertex_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with two arguments) +\cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Weighted_point_2` @@ -7208,7 +7204,7 @@ class ConstructWeightedCircumcenter_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with two arguments) +\cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Weighted_point_3` @@ -7234,7 +7230,7 @@ class ConstructWeightedCircumcenter_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Weighted_point_2` */ @@ -7270,7 +7266,7 @@ class ConstructWeightedPoint_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Weighted_point_3` @@ -7309,7 +7305,7 @@ class ConstructWeightedPoint_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `coplanar_orientation_grp` @@ -7364,7 +7360,7 @@ class CoplanarOrientation_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `coplanar_side_of_bounded_circle_grp` @@ -7394,7 +7390,7 @@ class CoplanarSideOfBoundedCircle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `coplanar_grp` @@ -7422,7 +7418,7 @@ class Coplanar_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `CGAL::Direction_2` @@ -7455,7 +7451,7 @@ class CounterclockwiseInBetween_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `do_intersect_grp` @@ -7492,7 +7488,7 @@ class DoIntersect_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `do_intersect_grp` @@ -7535,7 +7531,7 @@ class DoIntersect_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_xy_grp` @@ -7563,7 +7559,7 @@ class EqualXY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `x_equal_grp` @@ -7589,7 +7585,7 @@ class EqualX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `x_equal_grp` @@ -7615,7 +7611,7 @@ class EqualX_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `y_equal_grp` @@ -7641,7 +7637,7 @@ class EqualY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `y_equal_grp` @@ -7667,7 +7663,7 @@ class EqualY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `z_equal_grp` @@ -7693,7 +7689,7 @@ class EqualZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` \sa `CGAL::Direction_2` @@ -7776,7 +7772,7 @@ class Equal_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Direction_3` \sa `CGAL::Iso_cuboid_3` @@ -7880,7 +7876,7 @@ class Equal_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` \sa `CGAL::Iso_rectangle_2` @@ -7924,7 +7920,7 @@ class HasOnBoundary_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Sphere_3` @@ -7967,7 +7963,7 @@ class HasOnBoundary_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` \sa `CGAL::Iso_rectangle_2` @@ -8010,7 +8006,7 @@ class HasOnBoundedSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Sphere_3` @@ -8062,7 +8058,7 @@ class HasOnBoundedSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` \sa `CGAL::Line_2` @@ -8104,7 +8100,7 @@ class HasOnNegativeSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` \sa `CGAL::Sphere_3` @@ -8145,7 +8141,7 @@ class HasOnNegativeSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` \sa `CGAL::Line_2` @@ -8186,7 +8182,7 @@ class HasOnPositiveSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` \sa `CGAL::Sphere_3` @@ -8227,7 +8223,7 @@ class HasOnPositiveSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` \sa `CGAL::Iso_rectangle_2` @@ -8272,7 +8268,7 @@ class HasOnUnboundedSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Sphere_3` @@ -8316,7 +8312,7 @@ class HasOnUnboundedSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Line_2` \sa `CGAL::Ray_2` @@ -8357,7 +8353,7 @@ class HasOn_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_3` \sa `CGAL::Line_3` @@ -8444,7 +8440,7 @@ class HasOn_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa \link intersection_grp `CGAL::intersection()` \endlink */ @@ -8471,7 +8467,7 @@ class Intersect_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two or three arguments) + \cgalRefines{AdaptableFunctor (with two or three arguments)} \sa intersection_linear_grp */ @@ -8500,7 +8496,7 @@ class Intersect_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Circle_2` \sa `CGAL::Iso_rectangle_2` @@ -8555,7 +8551,7 @@ class IsDegenerate_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Circle_3` \sa `CGAL::Iso_cuboid_3` @@ -8629,7 +8625,7 @@ class IsDegenerate_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Line_2` \sa `CGAL::Ray_2` @@ -8666,7 +8662,7 @@ class IsHorizontal_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one argument) + \cgalRefines{AdaptableFunctor (with one argument)} \sa `CGAL::Line_2` \sa `CGAL::Ray_2` @@ -8705,7 +8701,7 @@ class IsVertical_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `left_turn_grp` @@ -8733,7 +8729,7 @@ class LeftTurn_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `has_smaller_distance_to_point_grp` @@ -8762,7 +8758,7 @@ class LessDistanceToPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `has_smaller_distance_to_point_grp` @@ -8790,7 +8786,7 @@ class LessDistanceToPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} */ class LessRotateCCW_2 { @@ -8821,7 +8817,7 @@ class LessRotateCCW_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `has_smaller_signed_distance_to_line_grp` @@ -8863,7 +8859,7 @@ class LessSignedDistanceToLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `has_smaller_signed_distance_to_plane_grp` @@ -8903,7 +8899,7 @@ class LessSignedDistanceToPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `lexicographically_xyz_smaller_grp` @@ -8933,7 +8929,7 @@ class LessXYZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `lexicographically_xy_smaller_grp` @@ -8962,7 +8958,7 @@ class LessXY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_xy_grp` @@ -8990,7 +8986,7 @@ class LessXY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_x_grp` @@ -9018,7 +9014,7 @@ class LessX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_x_grp` @@ -9045,7 +9041,7 @@ class LessX_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_yx_grp` @@ -9073,7 +9069,7 @@ class LessYX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_y_grp` @@ -9100,7 +9096,7 @@ class LessY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `compare_y_grp` @@ -9155,7 +9151,7 @@ class LessZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with one arguments) + \cgalRefines{AdaptableFunctor (with one arguments)} */ class NonZeroCoordinateIndex_3 { @@ -9180,7 +9176,7 @@ class NonZeroCoordinateIndex_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with three arguments) + \cgalRefines{AdaptableFunctor (with three arguments)} \sa `orientation_grp` @@ -9219,7 +9215,7 @@ class Orientation_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `orientation_grp` @@ -9265,7 +9261,7 @@ class Orientation_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Circle_2` \sa `CGAL::Line_2` @@ -9322,7 +9318,7 @@ class OrientedSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with two arguments) + \cgalRefines{AdaptableFunctor (with two arguments)} \sa `CGAL::Plane_3` \sa `CGAL::Sphere_3` @@ -9380,7 +9376,7 @@ class OrientedSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with four arguments) +\cgalRefines{AdaptableFunctor (with four arguments)} \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_2` for the definition of orthogonality for power distances. @@ -9446,7 +9442,7 @@ class PowerSideOfBoundedPowerCircle_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with five arguments) +\cgalRefines{AdaptableFunctor (with five arguments)} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definition of orthogonality for power distances. @@ -9527,7 +9523,7 @@ class PowerSideOfBoundedPowerSphere_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_2` for the definition of power distance. @@ -9564,7 +9560,7 @@ class PowerSideOfOrientedPowerCircle_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines `AdaptableFunctor` (with five arguments) +\cgalRefines{AdaptableFunctor (with five arguments)} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definition of power distance. @@ -9613,7 +9609,7 @@ class PowerSideOfOrientedPowerSphere_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `side_of_bounded_circle_grp` @@ -9653,7 +9649,7 @@ class SideOfBoundedCircle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with five arguments) + \cgalRefines{AdaptableFunctor (with five arguments)} \sa `side_of_bounded_sphere_grp` @@ -9705,7 +9701,7 @@ class SideOfBoundedSphere_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with four arguments) + \cgalRefines{AdaptableFunctor (with four arguments)} \sa `side_of_oriented_circle_grp` @@ -9745,7 +9741,7 @@ class SideOfOrientedCircle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines `AdaptableFunctor` (with five arguments) + \cgalRefines{AdaptableFunctor (with five arguments)} \sa `side_of_oriented_sphere_grp` From 106e7d4325abde936e46a16b6600bd40a78dbb9e Mon Sep 17 00:00:00 2001 From: albert-github Date: Thu, 2 Feb 2023 09:44:01 +0100 Subject: [PATCH 2/5] issue #7231 Improvement of layout of refines relations. Updating the 1.8.4 and 1.8.13 version as well --- Documentation/doc/resources/1.8.13/BaseDoxyfile.in | 4 +++- Documentation/doc/resources/1.8.4/BaseDoxyfile.in | 4 +++- 2 files changed, 6 insertions(+), 2 deletions(-) diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in index 3d749fa16b65..e81e84db8acc 100644 --- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in @@ -298,7 +298,9 @@ ALIASES = "cgal=%CGAL" \ "cgalFigureCaptionEnd=\htmlonly
\endhtmlonly" \ "cgalConcept=\details
\n \brief" \ "cgalConceptNamespace=\details
\n \brief" \ - "cgalRefines=\xrefitem refines \"Refines\" \"Refinement Relationships\"" \ + "cgalRefines=Refines:" \ + "cgalRefines{1}=@cgalRefines @c \1." \ + "cgalRefines{3}=@cgalRefines @c \1, @c \2 and @c \3." \ "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 10f3050a8f32..161b4edc5381 100644 --- a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in @@ -281,7 +281,9 @@ ALIASES += "cgalFigureCaptionEnd=\htmlonly \endhtmlonly
" ALIASES += "cgalConcept=\details
\n \brief" ALIASES += "cgalConceptNamespace=\details
\n \brief" -ALIASES += "cgalRefines=\xrefitem refines \"Refines\" \"Refinement Relationships\"" +ALIASES += "cgalRefines=Refines:" \ +ALIASES += "cgalRefines{1}=@cgalRefines @c \1." \ +ALIASES += "cgalRefines{3}=@cgalRefines @c \1, @c \2 and @c \3." \ ALIASES += "cgalRequires=\xrefitem requires \"Requires\" \"Type Requirements\"" ALIASES += "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" ALIASES += "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" From 2d60f4698506bd19995d24a0a626505f9c809a41 Mon Sep 17 00:00:00 2001 From: albert-github Date: Tue, 14 Mar 2023 17:37:50 +0100 Subject: [PATCH 3/5] 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 191b388edf9a..d4d98be930d5 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 de83a001ec8b..a90c498a7ec3 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 b1db24dab217..c7f0e806faf6 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 458f63668afc..c68ff917daa3 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 f26365293438..9eac0a57c463 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 2e2e4d2cd0f1..77116e3a7a19 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 b6296f69ff85..5a470643ad7b 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 1dfc1c08856b..92244b790ff2 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 8627e7249440..9eccaa1a37b4 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 4c7602959a22..e72950d3346a 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 47c2486c1129..91addf365a9c 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 f50af0ba0481..27aace6db8d5 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 8fd2c91c3432..c8f6bffc0028 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 c9e6bed7986c..1825473190d5 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 5f45b13441ca..af160cb22beb 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 1d925e33ae9c..2e2dc349407b 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 4d5e5858a269..2a19674b46f9 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 5186f117a585..5ba0a2fc9a1f 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 a21df7852182..0cc33797b3eb 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 2f5cc4d4b2d7..15035610c407 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 d7d340b0bc3e..694218851983 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 0393f355733b..cf0c4615928a 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 3c464a428119..8609a9a9cbe7 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 fdf80ccb5d53..d786a07704df 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 beb3f93bfaf0..fbedea0a5cc8 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 a00fc6117af6..6f4de356deb4 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 a078885017cf..eaa438e6c903 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 092de9ee6513..d7521aafcaab 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 a0fa98677889..ebdcbfe2189c 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 9f6467406ddb..2636122f3792 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 ca66c5637279..8f38c630da67 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 bc4c71769a4e..a04e3446f91a 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 9f2d4d7fcf15..81607c825081 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 a976457061a4..13f0683f87da 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 237a3be3cc2c..89bb2c1346a8 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 1e0eec328502..4257cfad3c48 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 783caf4f115e..c8d112ca99ea 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 b09a262eea1d..2941d4a69cb2 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 9d73121096c9..45222cbe10b4 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 37b6e85e6dfb..a2b6c5036f02 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 0471c50f6140..5087c6b2f5c8 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 48c231df209e..5a2bdf72bd60 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 b9ce0d868b37..5e77b24f981d 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 ae6b9c14d0b1..e9fea74b2d70 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 9588064cd040..ade530535ce7 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 81e5feb778c6..260359204aba 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 fcc7b68feaa5..80e5511d2097 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 2e28f355dd63..080d18c69236 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 1e3a350dc982..0bd7b9ce4b7b 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 f46b2e003c9b..b01c54743be1 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 2396ab840891..b50727dbcf9e 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 4ccc43286775..63d351683872 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 c45b33274fb2..b357a91a9afd 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 1ddba4f69511..c2269e0d9421 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 56009e09f910..98c0175abc9f 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 add3def2d3cd..7e0691c3d314 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 acfdf7c3778e..7d438091838d 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 26d30e364bd7..c9c2f475f8eb 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 79a14f66cc22..570abe049977 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 934ba0bdeb4f..5f7ea507dec8 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 c19a7d3407aa..90ef3fe920f1 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 d666401a9e47..d647cf7aaaf5 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 73f949503310..07c8ff0e8f7e 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 abfa45a09c3c..e7f42fdd9122 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 6ca57ad52eba..1f5eee4a6501 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 efbbae9df514..0921ee760f29 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 5b1728385683..1841b4f26bde 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 3ce2fb4357cf..280ea8187668 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 da93c279b9dd..32cc79350250 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 fd5f1beb55c5..c6d15f5d6f78 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 1452d243f958..ad91b67ba65a 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 4ebd692fd83f..eb955bfa2358 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 350d11d07259..eaadbc2390f6 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 d7d7d953f91b..0f892ac0d22a 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 7102e0a0a0f6..f53b0237d9e5 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 e53144c26217..c502d4d62f3b 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 257eeca6c41c..8d7cd73951f9 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 d69f64efc507..223405fd2c86 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 f07cfb83469c..659fb1bf8026 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 7fcfda1c043d..e9cc6c5402f9 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 ab188387ae26..29dc332f5b70 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 ec661097621e..4ddb1e23caa8 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 64b81633bcf7..2ad0e71d6671 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 f83faaa1561e..db318d53d33c 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 e0a5888020a7..40eb088b2c95 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 76d97be2dc2f..57b30f90d2f1 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 4b6e7d88b868..a6f1c1fca181 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 7065f6e55ccf..5015af963f61 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 22f5e4668760..5485e96fcb2e 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 00dcd06f13b6..570b419998e4 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 f563af694361..6d9fbcbe4304 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 4ffdc52948d0..6e23176c2d94 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 ca23a4c3220c..1fd4060952f9 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 08be16af81f1..d6b3aa7f35f6 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 256d3b5f9be1..59d9593e5fcf 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 234f348e1343..e84810fdc788 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 e9633df00d2c..f0c11a972c7e 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 8c3209da2e8b..cca93a7c829c 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 8145923b6697..a2ed0353dddc 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 5ef6ff44848d..5fa6db8c6e66 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 e25279179aa2..201d7e9e91a3 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 d80f20bbf3a7..956aad8144f9 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 3c1f816a2071..66e4e53e8986 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 1bb6de041b84..01f854b6426f 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 4d66951502f8..3a31719bb756 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 8e38e97c6861..4339c3f369dd 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 e93a6c0a6575..413311319d65 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 f52b2204e5a8..a485ec1a6238 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 513e447d56c7..5f50c695ceaa 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 c4c925e9a17d..670752239a71 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 cabaa47827ee..53bfaa495915 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 57db167d7570..f4bc83bd1a91 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 d01577defe14..117023bc8326 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 68c708c27af2..72620babd22d 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 9ea422987a29..e5c4146c9fa1 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 c87fbde0a03a..472c793d9f4b 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 0e8d46774074..6fc6381803af 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 38ccaa1be9b1..d923f9b27dba 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 1dfc0736077b..41cf7e2f6c63 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 036e21226bc6..0350b6ce6543 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 a1584b33c6e7..47bba6ea7443 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 c63f98ab59b6..d9a69236ee8f 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 744142e9fb9b..1831b790c564 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 a2fc977951f3..db0df3c8cc80 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 41b560fa1016..8e61d8c75009 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 3c099c814760..a37db7c40f65 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 025d45da35d5..0844ee649a4c 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 ca9f706c6148..78273b889476 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 08cf82d8f49c..45210b92d0c3 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 14b758b64ef2..6b23acac29d8 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 e64fd76ca070..b92f249431b3 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 1f7c84838566..4b8cbbbf7c28 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 d0d5df6846a9..a29b1d335311 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 fcd6b4d81a10..37a519a7ecaf 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 67722a077a27..ec84ff22035a 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 15d25b7c742d..4b4dc18d53d6 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 fa56a6a59e46..e03e3bfa9385 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 c2b074cbe21c..afc3942cba8d 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 dc7998ec0af0..394f98f5a3be 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 0ef3e9c1f45b..09de38a67c54 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 39d8aa7c182c..9a06f1e409c3 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 6e44953bc004..3f93d80deb2a 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 92ff014dfdaa..be39ea2b6b19 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 8c1f6db2d0d2..88e4fff19f09 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 f6079dc6a6f5..e659a3be2972 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 e050e9e288e5..1e8603639d0e 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 e5cff1def056..f42663dd8da0 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 426a8ffee3b2..cc66b479fbe8 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 d33d87663c01..3b01d80db4f2 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 ebf9395c7c77..c53f51ef0569 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 d617129c29c3..8190767e71c5 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 3c22b2edb2b1..f1b7d62ca689 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 865e6732d1cd..fa8468d49dcc 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 69eb18a96a16..455bef4d160a 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 16395831d632..689d2b7af2d3 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 bb81a8eb17fa..87ff1eb159c6 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 13123e1006b4..94614dfc81a9 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 da63fe4a11e3..05bac54d5a27 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 c82717702bda..cc36ec97ea62 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 0e9a09101c42..fd879fad9a03 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 3241f955cd53..e766c2cfc26b 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 6d6d59c544bc..5eae4b190c2d 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 685aed4fff51..3b614c86c079 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 40346595ac6f..b7ea012f4c9b 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 d50e7a275f22..6e7936f5ad9d 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 a6fc002b0aa7..8a31a1a787ac 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 3d0f4cfdcfed..1019f3c336bd 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 7df4f7b4b5bb..2ce0c9815546 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 8ea1da9f5610..5ce56824a5ae 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 0b0300834922..aa88a4d1944d 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 972825d1bf8d..c1f77e40a827 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 ff77632107f6..336b992999dd 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 3b9248da8718..5e8c9d034a44 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 ec0153358c73..0d90fbacb2f9 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 49023ab8810f..673b60c589b4 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 7e8499c446ce..108eb017796f 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 20ef75870ff2..62ce1fb841f8 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 9b39e7302405..ec5f5909ce3e 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 c97aec19a9cd..e33f52f22197 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 111c71d5be70..7334559a7eff 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 86f4cc299daa..99001c39f1c1 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 0966bde729b8..2a46c3470bdf 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 729c28a35e9b..842290bb47f4 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 7fb8ac367658..99324d142277 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 0ac583cb7f4d..d026e62b5878 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 77e31af2333c..7d28f370fc8c 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 9e703546d802..03300e29d644 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 c0c2127bdae8..322134ed592a 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 ca4499496263..a017fef71637 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 4fe0a0634686..2f522044c533 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 a5b9d2309e07..add345ad6ff8 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 f4b96d13896a..34f8cef50e2e 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 049ba805721e..64717a66455f 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 82199174d218..c80728dab670 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 96dd144986e7..866ddde00eda 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 e91b15e507b8..d6e999f0aa04 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 6e36d4863ed2..963e2850b081 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 c585d4d49f5e..af440398eccf 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 42ebf7de7950..fa89125974e8 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 35f5da604095..7c0494c296ec 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 691906fd50cd..aaf61364475f 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 2988791ce150..367fc274a644 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 01bd12e7dd0f..3b180f46c3e3 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 16bfb06b4dfd..1cdf8d0517f4 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 732cad52b7ef..999c3f53549c 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 1d4961a5f38e..0400dd4bade1 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 a4dd44be0fd9..681d46d96790 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 fc6919d1206f..54db59349fc0 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 b2315881a945..023c13ebc201 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 56b001436068..2f1093ba78c3 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 2e96ac10ede7..df2b2ee627bd 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 18e1fee3248f..41bf30f066ee 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 65cf545a758a..4a4494bc216e 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 07b5f8c91299..ffefeb6aefb9 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 9c973dd7b1b6..9dc558943763 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 b1cdc0c5aba1..800618797107 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 94973b8988d7..b9dac20ddd14 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 f2ac72661ec7..2599e4d2b170 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 4dd2a9b1d01d..bbc40c24da1e 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 d5ea290aad24..d37d38691c92 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 63ad9be46459..a26135c41f90 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 303cdb0df13e..634d35c61fd2 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 64cce14141e9..82e336776149 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 4bd4855859b9..dea4257ec622 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 ec3c844a0027..7f83899646e2 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 4ef95a25365b..2cb9c2310761 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 4f3e7b42c76e..37f8129c34e5 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 05998c569032..15aec31b4f96 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 7ecb6f3f3a7e..984798fc609a 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 ccd903ef0132..b3b1a55a10a6 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 a62f183035b5..5ea1f9aed8ed 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 66498784fd23..950115d7c73e 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 ec0a668ee405..3552dc5cb29d 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 8e3360e2acbd..b690c3d97d38 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 131b18b881ec..748ab737efb7 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 40f8dda0c5c8..2da31fa59408 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 007d8b424c56..03f492d1b081 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 530aa1a2b80b..ae828e3cdf0d 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 f1de55dcdc20..f35f45139c2c 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 e81e84db8acc..69351ed254e8 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 161b4edc5381..70267fd649dc 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 7c66b30ccad0..3fcdb56be680 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 c53b330bca7a..47b1f7290356 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 172e2481899f..91c430a9d914 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 897e22925041..5a405bb77708 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 c8f23d4ce2f4..172b6b933f1e 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 0406a5c8416a..5d2d5a39e3e7 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 a472fde6d311..368630cc55be 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 @@ class HyperbolicFaceData { \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 2b59a48ca237..d7fa271e5600 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 @@ class Circle_2 { 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 @@ class Circle_3 { 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 @@ class Direction_2 { 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 @@ class Direction_3 { 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 @@ class IsoCuboid_3 { 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 @@ class IsoRectangle_2 { 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 @@ class Line_2 { 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 @@ class Line_3 { \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 @@ class Object_2 { \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 @@ class Object_3 { 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 @@ class Plane_3 { 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 @@ class Point_2 { 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 @@ class Point_3 { 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 @@ class Ray_2 { 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 @@ class Ray_3 { 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 @@ class Segment_2 { 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 @@ class Segment_3 { 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 @@ class Sphere_3 { 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 @@ class Tetrahedron_3 { 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 @@ class Triangle_2 { 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 @@ class Triangle_3 { 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 @@ class Vector_2 { 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 @@ class Vector_3 { 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 @@ class WeightedPoint_2 { 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 20a9138097f5..c951a0735efc 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 150986a2cf4e..10695e97732f 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 1f27a871c2da..0b03cae29369 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 94b42cfd6668..b1235d5e6faf 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 a31bcc6ff3b0..57cfbc7d0584 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 be301610300a..4e7e19343b9e 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 e3e4733f78a3..c64aa00f4ff9 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 909ce593c9ff..caf8d2608952 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 73400f49df47..04cebff70d04 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 7964f79f1622..4c9bd5eec8b9 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 f2c6a9f01302..042980a96840 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 91b814551f5f..9385dae29ae3 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 a6ba2ba7d6f6..028d9e70d9fe 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 1a64924802c9..c53644cb36fc 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 279762200af1..18e97b9a2753 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 4d1af2635282..e4d5a977a1c1 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 1b1cb0d712b1..4739741b01c7 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 e70c1fed3992..7c27e91a6c80 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 93ca015aac67..1ae6322420b7 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 d19cced014fa..a20436793916 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 9c10536f514f..c2e9a68f6bb8 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 74cbbcaca6ab..dceb2345f0cd 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 3c5afb03b1f7..fe99dd293c4c 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 1c1222024724..3f1e4722dc2b 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 6bc1a42ce382..402a3eca8062 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 d6f3e40edbf4..7d7771d981ee 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 f5161d682ed5..71bfd55b2688 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 0ed7a18153ab..26c88f7b1579 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 c437d8a3e1e0..51a0f2dff739 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 bd86a2a74aeb..21ecbca9cc09 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 a21917ec41e5..9ca96674cc79 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 59afc1e24c3b..803505e302eb 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 43ff786e30ac..762aceede946 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 b3b645b972e4..ed986883f585 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 ccbb25caee01..048264c8c7b1 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 fc9c47c0f9b0..cc3de413a708 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 be1990d1f14b..3133ceb9342f 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 a067dd98e925..6628fffd89f5 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 3d0e812a744f..959e3c3a25e9 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 89605fe87f70..bdd463403a6c 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 b6a54d13e708..3221dc57a11e 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 da1061323f56..e133b35e03db 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 d405005be6e7..674a57e4374b 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 1db30f8aaae2..a46ff1fe7a24 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 0009489dcec7..61575e3ff892 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 d94b280a96c5..9ef06093cb22 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 93b40c15cb73..a4efc83d7039 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 b7106277b52d..f3fdef28beba 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 432c0d928fc6..62c23598c49f 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 @@ class PolyhedronItems_3 { /// `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 @@ class PolyhedronItems_3 { /// `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 a2a041ef1d02..6849eb7f1750 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 44b11cad95f6..4722bcaa72c8 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 b613845544c0..c51684ad8d63 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 b6f735f2882c..1081e03f96d5 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 0b871831f44b..032463dbb78c 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 a3a4c9518343..2a85da5c35b6 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 7b535f13e494..7b11254ead81 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 d15d226c6b26..eaeb5e26abad 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 fa2bd4158027..75e1471aa16e 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 274a0b433a0e..4f8c0ae3710a 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 8d584576126f..7d8836bc94eb 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 c676b4b4f89b..77f53dbffa89 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 133b06a3b12d..9935b08186f7 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 05aa9c8b1b49..276310f193d5 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 6ccf00c9e050..d33fcd49f1db 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 a96fe3cc1584..f3bd777d571f 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 552167e0580d..df17960acf9b 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 28f0a70c292d..a18ccc0aff87 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 77eaba22966c..96e8878607ae 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 59808eeec4dc..a0cea949b8cc 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 2eeb6a37ac3c..3f778a6fc9eb 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 232ad8b574be..a72a45afa29e 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 3cd8c8b4c974..f7f628d6ea3c 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 3ec0eea9f4fb..b89b7a3fd02e 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 ea85063a6e74..e21f8b68621e 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 d79dfe991982..cdb070fc521c 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 d9eaf355a1df..32609fbdbecf 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 421cca004921..eb39344b00e5 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 8e0922061407..514f8ea16f04 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 3418ef03626f..d98b393b1c32 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 64274c8d8791..778c613de30f 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 5369cf55ca6f..8c86eb901bad 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 21952cec677d..0c786a280547 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 cf269798372d..6e0e9fe887dd 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 0779a4391346..d8e7b9f2e55c 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 a547947df935..522be10a6b29 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 e337487c90df..69c6804f5752 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 a64b2ba5f338..5668a6ea84ba 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 80cb293e1aa2..ba73655f5c6d 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 24b8655b4647..9d491d6cb525 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 8d2418ca54b4..89dc6556dadc 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 7695c92709ff..d3cb343e3045 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 7c2ba845b5d6..476854ee8d9b 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 f62b124bfc48..ce8264632038 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 c314610f9eef..d724fa862010 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 3ade609f016f..85ef0b83f4f7 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 71a9a19baa45..d0adc1fc1d5c 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 aa387211e154..ee171b9e9fe7 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 1c7e54032571..11beaab299be 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 c2a2286212f2..2d82736c7a71 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 e49c7b645c2c..8ad8143d57d4 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 f65e69667163..3b1ffa9e0bb8 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 00ed2670ffbb..c4bfc0bf7231 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 14a89ae6692e..950c026ae43e 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 4d7bca50f256..d5552d6b328e 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 e918979f7909..ed86c99c6838 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 f97cdcb318b9..d76e8032e54c 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 4ac54ef66db1..ff424c1281da 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 0ada434d3eb0..ad034bbb9823 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 233d75b030c9..8235e55f4f01 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 7d4cc3809030..544e714fa8a8 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 58a16cb543a8..566beb42485e 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 8837bc14b74b..4b96dab0907b 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 6b70d36fb874..7ab5a65a26b7 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 d52818a7e702..5370b1b30262 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 743727a2a630..3f391babafa1 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 63d1ae08db2d..78e8bda7d6e7 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 3d1de41b15d6..e68b4212b191 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 903d9e92b685..778a709b5a68 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 d654765e03c0..4a4a626b8eba 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 f67bf8ba17b3..4f0424d96645 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 0dad254c330a..6551020f4f05 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 5f908c59c867..0138ce98d6bd 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 1857644c9d28..e05554478123 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 5bf3bf2aba1c..0313402d3560 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 518b8df6532c..939b29a4959c 100644 --- a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h +++ b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h @@ -86,8 +86,7 @@ class SvdTraits::Vector \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 34618365fea3..d2a398589d80 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 3d418953f5cc..5e7e310f0a59 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 eed4756e9e20..cc2cf00a120a 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 eb9ca638cb5c..f4fd0166ebbb 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 555ec0d5b874..311987667fb9 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 ba9548e64b53..1f31421336ab 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 9c9a5765a5cd..7a26285dccfc 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 340fb8a08b24..18a85973c5ba 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 f53d4db7ef4b..c5a06d956182 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 18f3c196d5fd..bb28f171b025 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 d149cd9ee660..6050b444ad3e 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 77fe974dd626..ee5fc38d9079 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 c4a67edc2af7..a8dbb00b46b7 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 @@ class DeformationClosestRotationTraits_3{ /// @} -}; \ 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 7ac7398f1217..41b10daa4a71 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 b5f5010acdce..93450589cfcf 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 ff38140189c6..652c3457496d 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 @@ class SurfaceMeshShortestPathTraits /// @} -}; \ 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 05cc98d46981..24a05f636c29 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 e48fbe8ccb74..e576472cb34e 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 b0b254733b4f..324c87f45ee7 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 03fe479f999b..01c344d316cb 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 a92d7a1af8b3..8ee52354e37e 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 0b2dc2c93bda..f418f71e47b7 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 bf96a622f14f..5e1f3b3098dc 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 f701e8e06bce..d3bc61921c50 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 37f979d4717f..8402f4f4442c 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 0c7108a3d674..4ce03689c740 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 9435ee7e9e55..eef2cf0d3d4f 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 81ee216aa7fd..01d05c5c873d 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 451a9425179f..d275fbc03a71 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 21fa97e1ed66..0e9b0e86003e 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 06d779529ae5..670217bb50db 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 0ed01519e694..00ec18a9e8cd 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 3c32f97f7c5f..a29eef833969 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 5e3def7d9bd8..30b22c4994b0 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 8c0f1f76cf4b..74750c4117a2 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 52a4d18d1764..87018c11c3ce 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 6b2e67375ae0..0ea829717934 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 c804bcfb43fb..f0483d539cc8 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 25e727870aaa..1d49d678c471 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 a9dd8effbb97..fe3a7ec053e7 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 5eaf3c65fbb0..32b251a50604 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 9f06a2a0c9ca..6d69fe98604e 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 dcdbe5c4ee37..89ae384c8bfa 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 b60278ee1d2b..62230e270a73 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 8d72a27345da..353f56310609 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 e2d570c15fda..5d473eabfb6d 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 82340f339f15..eeee95725166 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 08153a6ae317..0ce1e0012c96 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 c48ecda04403..bec156dc516f 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 b9fca9c841fe..b6e1a9b25158 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 36b9c71d8d28..c1f46f3fb4ff 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 a864994ac49b..4f83db499d7f 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 f90ebf94b1d9..7a00e04f1d8b 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 e04b4c5a2036..91057fe887f9 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 4de91c31526d..3881593c2d3f 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 8f53f0fbc6cb..5064256e4454 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 7486341f733a..69ae982347cb 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 fe8a37f203bb..d7c62d3e4c62 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 677a66d94b4b..c9cf46d00629 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 c113c124403e..cd91c12e9a86 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 ca03f9c3c1fd..397c3a7e7992 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 ab66482d9bbf..fbb6ac030edc 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 c93c6b88ebc3..0dad5563ff72 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 70fbbc3131bb..23b6971fd895 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 a46f2df35945..e0dd1cdc4616 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 eb747a669a46..43519f9e79cb 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 4cc31a5b14c1..201e815138b0 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 50f807bf0bb9..3459c48dc9f4 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} From 064a92e107dc28aac5d908aee3960b5f0eaa2ead Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Tue, 11 Apr 2023 13:54:29 +0200 Subject: [PATCH 4/5] add missing concepts --- Documentation/doc/Documentation/General.txt | 42 +++++++++++++++++++++ 1 file changed, 42 insertions(+) diff --git a/Documentation/doc/Documentation/General.txt b/Documentation/doc/Documentation/General.txt index f35f45139c2c..1307be68ce87 100644 --- a/Documentation/doc/Documentation/General.txt +++ b/Documentation/doc/Documentation/General.txt @@ -85,6 +85,48 @@ public: result_type operator()(first_argument_type, second_argument_type, third_argument_type); }; +/// \cgalConcept +/// Adaptable functor with four arguments +/// \cgalRefines{AdaptableFunctor} +class AdaptableQuaternaryFunction +{ +public: + /// result_type + typedef unspecified_type result_type; + /// first argument_type + typedef unspecified_type first_argument_type; + /// second argument_type + typedef unspecified_type second_argument_type; + /// third argument_type + typedef unspecified_type third_argument_type; + /// fourth argument_type + typedef unspecified_type fourth_argument_type; + /// operator type + result_type operator()(first_argument_type, second_argument_type, third_argument_type, fourth_argument_type); +}; + +/// \cgalConcept +/// Adaptable functor with five arguments +/// \cgalRefines{AdaptableFunctor} +class AdaptableQuinaryFunction +{ +public: + /// result_type + typedef unspecified_type result_type; + /// first argument_type + typedef unspecified_type first_argument_type; + /// second argument_type + typedef unspecified_type second_argument_type; + /// third argument_type + typedef unspecified_type third_argument_type; + /// fourth argument_type + typedef unspecified_type fourth_argument_type; + /// fifth argument_type + typedef unspecified_type fifth_argument_type; + /// operator type + result_type operator()(first_argument_type, second_argument_type, third_argument_type, fourth_argument_type, fifth_argument_type); +}; + /// \cgalConcept /// Concept from the \cpp standard. /// See https://en.cppreference.com/w/cpp/named_req/Iterator From b21b984daae672d52c779d92c0aac7507f593ed2 Mon Sep 17 00:00:00 2001 From: albert-github Date: Wed, 12 Apr 2023 09:49:53 +0200 Subject: [PATCH 5/5] issue #7231 Improvement of layout of refines relations. Adjusted after review - usage of `Adaptable...Function` instead of `AdapatableFunctor (with... arguments)` - corrected some incorrect / superfluous `}` --- .../AlgebraicKernel_d_1--MakeCoprime_1.h | 2 +- .../AlgebraicKernel_d_2--MakeCoprime_2.h | 2 +- .../Concepts/WeightedAlphaShapeTraits_2.h | 2 +- .../Concepts/FunctionObjectConcepts.h | 436 +++++++++--------- ...ernel--ConstructCartesianConstIterator_d.h | 2 +- .../Concepts/Kernel--Construct_max_vertex_d.h | 2 +- .../Concepts/Kernel--Construct_min_vertex_d.h | 2 +- .../doc/Number_types/Concepts/RootOf_2.h | 2 +- .../Concepts/AdaptationPolicy_2.h | 10 +- .../Concepts/AdaptationTraits_2.h | 8 +- 10 files changed, 234 insertions(+), 234 deletions(-) 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 63d351683872..fe0106719e02 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{AdaptableQuinaryFunction} \sa `AlgebraicKernel_d_1::IsCoprime_1` 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 659fb1bf8026..5bb1699de435 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{AdaptableQuinaryFunction} \sa `AlgebraicKernel_d_2::IsCoprime_2` 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 5485e96fcb2e..62d404c3c384 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/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h b/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h index 67bf74dee02f..573c5ac8fbab 100644 --- a/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h +++ b/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h @@ -103,7 +103,7 @@ class Angle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `are_ordered_along_line_grp` @@ -133,7 +133,7 @@ class AreOrderedAlongLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `are_ordered_along_line_grp` @@ -163,7 +163,7 @@ class AreOrderedAlongLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `parallel_grp` @@ -204,7 +204,7 @@ class AreParallel_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `parallel_grp` @@ -253,7 +253,7 @@ class AreParallel_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `are_strictly_ordered_along_line_grp` @@ -285,7 +285,7 @@ class AreStrictlyOrderedAlongLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `are_strictly_ordered_along_line_grp` @@ -317,7 +317,7 @@ class AreStrictlyOrderedAlongLine_3 { \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Object` \sa `Kernel::Object_2` @@ -348,7 +348,7 @@ class Assign_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. \sa `CGAL::Object` @@ -379,7 +379,7 @@ class Assign_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Triangle_2` @@ -428,7 +428,7 @@ class BoundedSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Sphere_3` @@ -512,7 +512,7 @@ class CartesianConstIterator_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `collinear_are_ordered_along_line_grp` @@ -541,7 +541,7 @@ class CollinearAreOrderedAlongLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `collinear_are_ordered_along_line_grp` @@ -569,7 +569,7 @@ class CollinearAreOrderedAlongLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `collinear_are_strictly_ordered_along_line_grp` @@ -598,7 +598,7 @@ class CollinearAreStrictlyOrderedAlongLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `collinear_are_strictly_ordered_along_line_grp` @@ -627,7 +627,7 @@ class CollinearAreStrictlyOrderedAlongLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Ray_2` \sa `CGAL::Segment_2` @@ -662,7 +662,7 @@ class CollinearHasOn_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `collinear_grp` @@ -689,7 +689,7 @@ class Collinear_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `collinear_grp` @@ -716,7 +716,7 @@ class Collinear_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} */ class CompareAngleWithXAxis_2 { @@ -821,7 +821,7 @@ class CompareDihedralAngle_3 { \sa `compare_distance_to_point_grp` \sa `compare_squared_distance_grp` - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} */ class CompareDistance_2 { @@ -872,7 +872,7 @@ class CompareDistance_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `Kernel::CompareSquaredDistance_3` \sa `compare_distance_to_point_grp` @@ -923,7 +923,7 @@ class CompareDistance_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_2` for the definition of power distance. @@ -950,7 +950,7 @@ class ComparePowerDistance_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definition of power distance. @@ -979,7 +979,7 @@ class ComparePowerDistance_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} */ class CompareSignedDistanceToLine_2 { public: @@ -1010,7 +1010,7 @@ class CompareSignedDistanceToLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_slopes_grp` @@ -1056,7 +1056,7 @@ class CompareSlope_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_slopes_grp` @@ -1091,7 +1091,7 @@ class CompareSlope_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `compare_distance_to_point_grp` \sa `compare_squared_distance_grp` @@ -1127,7 +1127,7 @@ class CompareSquaredDistance_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `Kernel::CompareDistance_3` \sa `compare_distance_to_point_grp` @@ -1163,7 +1163,7 @@ class CompareSquaredDistance_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `compare_squared_radius_grp` @@ -1264,7 +1264,7 @@ class CompareWeightedSquaredRadius_3 \image html compare_x_at_y.png \image latex compare_x_at_y.png - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `compare_x_at_y_grp` @@ -1325,7 +1325,7 @@ class CompareXAtY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_xyz_grp` @@ -1354,7 +1354,7 @@ class CompareXYZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_xy_grp` \sa `Kernel::CompareYX_2` @@ -1384,7 +1384,7 @@ class CompareXY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_xy_grp` @@ -1418,7 +1418,7 @@ class CompareXY_3 { \image html compare1.png \image latex compare1.png - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_x_grp` @@ -1474,7 +1474,7 @@ class CompareX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_x_grp` @@ -1505,7 +1505,7 @@ class CompareX_3 { \image html compare2.png \image latex compare2.png - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \anchor fig-compare2 \sa `compare_y_at_x_grp` @@ -1592,7 +1592,7 @@ class CompareYAtX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_yx_grp` \sa `Kernel::CompareXY_2` @@ -1626,7 +1626,7 @@ class CompareYX_2 { \image html compare1.png \image latex compare1.png - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_y_grp` @@ -1685,7 +1685,7 @@ class CompareY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_y_grp` @@ -1712,7 +1712,7 @@ class CompareY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_z_grp` @@ -1878,7 +1878,7 @@ class ComputeApproximateDihedralAngle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Circle_3` @@ -1903,7 +1903,7 @@ class ComputeApproximateSquaredLength_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Circle_3` @@ -1928,7 +1928,7 @@ class ComputeAreaDividedByPi_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Iso_rectangle_2` \sa `CGAL::Triangle_2` @@ -1967,7 +1967,7 @@ class ComputeArea_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Triangle_3` @@ -2121,7 +2121,7 @@ class ComputeD_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_2` \sa `determinant_grp` @@ -2148,7 +2148,7 @@ class ComputeDeterminant_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `CGAL::Vector_3` \sa `determinant_grp` @@ -2493,7 +2493,7 @@ class ComputeHz_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with five arguments)} + \cgalRefines{AdaptableQuinaryFunction} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definitions of power distance and orthogonality. @@ -2522,7 +2522,7 @@ class ComputePowerDistanceToPowerSphere_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_3` @@ -2563,7 +2563,7 @@ class ComputePowerProduct_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_2` @@ -2607,7 +2607,7 @@ class ComputePowerProduct_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} */ class ComputeLInfinityDistance_2 { @@ -2658,7 +2658,7 @@ class ComputeLInfinityDistance_3 { \sa `CGAL::Vector_2` \sa scalar_product_grp - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} */ class ComputeScalarProduct_2 { @@ -2682,7 +2682,7 @@ class ComputeScalarProduct_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_3` \sa scalar_product_grp @@ -2710,7 +2710,7 @@ class ComputeScalarProduct_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Triangle_3` @@ -2742,7 +2742,7 @@ class ComputeSquaredArea_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `squared_distance_grp` @@ -2777,7 +2777,7 @@ class ComputeSquaredDistance_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `squared_distance_grp` @@ -2813,7 +2813,7 @@ class ComputeSquaredDistance_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Circle_3` @@ -2839,7 +2839,7 @@ class ComputeSquaredLengthDividedByPiSquare_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Vector_2` \sa `CGAL::Segment_2` @@ -2870,7 +2870,7 @@ class ComputeSquaredLength_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Vector_3` \sa `CGAL::Segment_3` @@ -2901,7 +2901,7 @@ class ComputeSquaredLength_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Circle_2` \sa `squared_radius_grp` @@ -2948,7 +2948,7 @@ class ComputeSquaredRadius_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Sphere_3` \sa `CGAL::Circle_3` @@ -3082,7 +3082,7 @@ class ComputeSquaredRadiusSmallestOrthogonalSphere_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Tetrahedron_3` @@ -3567,7 +3567,7 @@ class ComputeZmin_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `Kernel::ConstructCentroid_2` \sa `centroid_grp` @@ -3644,7 +3644,7 @@ class ConstructBarycenter_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `Kernel::ConstructCentroid_3` \sa `centroid_grp` @@ -3722,7 +3722,7 @@ class ConstructBarycenter_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` @@ -3752,7 +3752,7 @@ class ConstructBaseVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} */ class ConstructBbox_2 { @@ -3800,7 +3800,7 @@ class ConstructBbox_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} */ class ConstructBbox_3 { @@ -3900,7 +3900,7 @@ class ConstructBisector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `bisector_grp` @@ -3942,7 +3942,7 @@ class ConstructBisector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `Kernel::CartesianConstIterator_2` @@ -3988,7 +3988,7 @@ class ConstructCartesianConstIterator_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `Kernel::CartesianConstIterator_3` @@ -4032,7 +4032,7 @@ class ConstructCartesianConstIterator_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with one argument)} +\cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Circle_2` @@ -4057,7 +4057,7 @@ class ConstructCenter_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Sphere_3` \sa `CGAL::Circle_3` @@ -4089,7 +4089,7 @@ class ConstructCenter_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `Kernel::ConstructBarycenter_2` \sa `centroid_grp` @@ -4131,7 +4131,7 @@ class ConstructCentroid_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `Kernel::ConstructBarycenter_3` \sa `centroid_grp` @@ -4178,7 +4178,7 @@ class ConstructCentroid_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `CGAL::Circle_2` @@ -4249,7 +4249,7 @@ class ConstructCircle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `CGAL::Circle_3` @@ -4331,7 +4331,7 @@ class ConstructCircle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `circumcenter_grp` @@ -4371,7 +4371,7 @@ class ConstructCircumcenter_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `circumcenter_grp` @@ -4427,7 +4427,7 @@ class ConstructCircumcenter_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `cross_product_grp` \sa `determinant_grp` @@ -4454,7 +4454,7 @@ class ConstructCrossProductVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_2` @@ -4480,7 +4480,7 @@ class ConstructDifferenceOfVectors_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_3` @@ -4507,7 +4507,7 @@ class ConstructDifferenceOfVectors_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Direction_2` @@ -4548,7 +4548,7 @@ class ConstructDirection_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Direction_3` @@ -4589,7 +4589,7 @@ class ConstructDirection_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_2` @@ -4615,7 +4615,7 @@ class ConstructDividedVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_3` @@ -4641,7 +4641,7 @@ class ConstructDividedVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `equidistant_line_grp` @@ -4670,7 +4670,7 @@ class ConstructEquidistantLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with two arguments)} +\cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Iso_cuboid_3` @@ -4725,7 +4725,7 @@ class ConstructIsoCuboid_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Iso_rectangle_2` @@ -4778,7 +4778,7 @@ class ConstructIsoRectangle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` \sa `ConstructProjectedXYPoint_2` @@ -4807,7 +4807,7 @@ class ConstructLiftedPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Line_2` @@ -4860,7 +4860,7 @@ class ConstructLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Line_3` @@ -4914,7 +4914,7 @@ class ConstructLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Iso_rectangle_2` \sa `CGAL::Segment_2` @@ -4949,7 +4949,7 @@ class ConstructMaxVertex_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Segment_3` @@ -4985,7 +4985,7 @@ class ConstructMaxVertex_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `midpoint_grp` @@ -5015,7 +5015,7 @@ class ConstructMidpoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `midpoint_grp` @@ -5047,7 +5047,7 @@ class ConstructMidpoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Iso_rectangle_2` \sa `CGAL::Segment_2` @@ -5082,7 +5082,7 @@ class ConstructMinVertex_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Segment_3` @@ -5117,7 +5117,7 @@ class ConstructMinVertex_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `normal_grp` \sa `unit_normal_grp` @@ -5147,7 +5147,7 @@ class ConstructNormal_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. @@ -5179,7 +5179,7 @@ class ConstructObject_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \deprecated This class is deprecated since \cgal 4.3 and type safe ways should be preferred. \sa `CGAL::Object` @@ -5211,7 +5211,7 @@ class ConstructObject_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Circle_2` @@ -5237,7 +5237,7 @@ class ConstructOppositeCircle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Direction_2` @@ -5264,7 +5264,7 @@ class ConstructOppositeDirection_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Direction_3` @@ -5291,7 +5291,7 @@ class ConstructOppositeDirection_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Line_2` @@ -5319,7 +5319,7 @@ class ConstructOppositeLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Line_3` @@ -5345,7 +5345,7 @@ class ConstructOppositeLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Plane_3` @@ -5371,7 +5371,7 @@ class ConstructOppositePlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Ray_2` @@ -5396,7 +5396,7 @@ class ConstructOppositeRay_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Ray_3` @@ -5422,7 +5422,7 @@ class ConstructOppositeRay_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Segment_2` @@ -5448,7 +5448,7 @@ class ConstructOppositeSegment_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Segment_3` @@ -5476,7 +5476,7 @@ class ConstructOppositeSegment_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Sphere_3` @@ -5502,7 +5502,7 @@ class ConstructOppositeSphere_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Triangle_2` @@ -5530,7 +5530,7 @@ class ConstructOppositeTriangle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Vector_2` @@ -5555,7 +5555,7 @@ class ConstructOppositeVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with one argument)} +\cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Vector_3` @@ -5581,7 +5581,7 @@ class ConstructOppositeVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Plane_3` \sa `Kernel::ConstructCrossProductVector_3` @@ -5617,7 +5617,7 @@ class ConstructOrthogonalVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Direction_2` @@ -5647,7 +5647,7 @@ class ConstructPerpendicularDirection_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Line_2` @@ -5675,7 +5675,7 @@ class ConstructPerpendicularLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` @@ -5705,7 +5705,7 @@ class ConstructPerpendicularLine_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` @@ -5733,7 +5733,7 @@ class ConstructPerpendicularPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_2` @@ -5763,7 +5763,7 @@ class ConstructPerpendicularVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` @@ -5844,7 +5844,7 @@ class ConstructPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Line_2` \sa `CGAL::Ray_2` @@ -5893,7 +5893,7 @@ class ConstructPointOn_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Line_3` \sa `CGAL::Plane_3` @@ -5947,7 +5947,7 @@ class ConstructPointOn_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Point_2` @@ -5988,7 +5988,7 @@ class ConstructPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Point_3` @@ -6028,7 +6028,7 @@ class ConstructPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Line_2` @@ -6054,7 +6054,7 @@ class ConstructProjectedPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Line_3` \sa `CGAL::Plane_3` @@ -6105,7 +6105,7 @@ class ConstructProjectedPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` \sa `ConstructLiftedPoint_3` @@ -6137,7 +6137,7 @@ class ConstructProjectedXYPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Weighted_point_2` @@ -6162,7 +6162,7 @@ class ConstructRadicalAxis_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` @@ -6191,7 +6191,7 @@ class ConstructRadicalLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two argument)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Sphere_3` @@ -6219,7 +6219,7 @@ class ConstructRadicalPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Ray_2` @@ -6267,7 +6267,7 @@ class ConstructRay_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Ray_3` @@ -6315,7 +6315,7 @@ class ConstructRay_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_2` */ @@ -6344,7 +6344,7 @@ class ConstructScaledVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_3` @@ -6377,7 +6377,7 @@ class ConstructScaledVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Ray_2` @@ -6405,7 +6405,7 @@ class ConstructSecondPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Ray_3` @@ -6433,7 +6433,7 @@ class ConstructSecondPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Segment_2` @@ -6460,7 +6460,7 @@ class ConstructSegment_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Segment_3` @@ -6487,7 +6487,7 @@ class ConstructSegment_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Segment_2` \sa `CGAL::Ray_2` @@ -6523,7 +6523,7 @@ class ConstructSource_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Segment_3` \sa `CGAL::Ray_3` @@ -6559,7 +6559,7 @@ class ConstructSource_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `CGAL::Sphere_3` @@ -6635,7 +6635,7 @@ class ConstructSphere_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_2` @@ -6663,7 +6663,7 @@ class ConstructSumOfVectors_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_3` @@ -6689,7 +6689,7 @@ class ConstructSumOfVectors_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Triangle_3` @@ -6714,7 +6714,7 @@ class ConstructSupportingPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Segment_2` @@ -6741,7 +6741,7 @@ class ConstructTarget_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Segment_3` @@ -6768,7 +6768,7 @@ class ConstructTarget_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `CGAL::Tetrahedron_3` @@ -6796,7 +6796,7 @@ class ConstructTetrahedron_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Point_2` @@ -6832,7 +6832,7 @@ class ConstructTranslatedPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Point_3` @@ -6868,7 +6868,7 @@ class ConstructTranslatedPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `CGAL::Triangle_2` @@ -6895,7 +6895,7 @@ class ConstructTriangle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `CGAL::Triangle_3` @@ -6924,7 +6924,7 @@ class ConstructTriangle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with three arguments)} +\cgalRefines{AdaptableTernaryFunction} \sa `normal_grp` \sa `unit_normal_grp` @@ -6954,7 +6954,7 @@ class ConstructUnitNormal_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_2` \sa `Kernel::ConstructScaledVector_2` @@ -7014,7 +7014,7 @@ class ConstructVector_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Vector_3` \sa `Kernel::ConstructScaledVector_3` @@ -7074,7 +7074,7 @@ class ConstructVector_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Iso_rectangle_2` \sa `CGAL::Segment_2` @@ -7123,7 +7123,7 @@ class ConstructVertex_2 { \image html IsoCuboid.png \image latex IsoCuboid.png -\cgalRefines{AdaptableFunctor (with two arguments)} +\cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Segment_3` @@ -7177,7 +7177,7 @@ class ConstructVertex_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with two arguments)} +\cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Weighted_point_2` @@ -7203,7 +7203,7 @@ class ConstructWeightedCircumcenter_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with two arguments)} +\cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Weighted_point_3` @@ -7229,7 +7229,7 @@ class ConstructWeightedCircumcenter_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Weighted_point_2` */ @@ -7265,7 +7265,7 @@ class ConstructWeightedPoint_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Weighted_point_3` @@ -7304,7 +7304,7 @@ class ConstructWeightedPoint_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `coplanar_orientation_grp` @@ -7359,7 +7359,7 @@ class CoplanarOrientation_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `coplanar_side_of_bounded_circle_grp` @@ -7389,7 +7389,7 @@ class CoplanarSideOfBoundedCircle_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `coplanar_grp` @@ -7417,7 +7417,7 @@ class Coplanar_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `CGAL::Direction_2` @@ -7450,7 +7450,7 @@ class CounterclockwiseInBetween_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `do_intersect_grp` @@ -7487,7 +7487,7 @@ class DoIntersect_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `do_intersect_grp` @@ -7530,7 +7530,7 @@ class DoIntersect_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_xy_grp` @@ -7558,7 +7558,7 @@ class EqualXY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `x_equal_grp` @@ -7584,7 +7584,7 @@ class EqualX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `x_equal_grp` @@ -7610,7 +7610,7 @@ class EqualX_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `y_equal_grp` @@ -7636,7 +7636,7 @@ class EqualY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `y_equal_grp` @@ -7662,7 +7662,7 @@ class EqualY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `z_equal_grp` @@ -7688,7 +7688,7 @@ class EqualZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Direction_2` @@ -7771,7 +7771,7 @@ class Equal_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Direction_3` \sa `CGAL::Iso_cuboid_3` @@ -7875,7 +7875,7 @@ class Equal_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Iso_rectangle_2` @@ -7919,7 +7919,7 @@ class HasOnBoundary_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Sphere_3` @@ -7962,7 +7962,7 @@ class HasOnBoundary_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Iso_rectangle_2` @@ -8005,7 +8005,7 @@ class HasOnBoundedSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Sphere_3` @@ -8057,7 +8057,7 @@ class HasOnBoundedSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Line_2` @@ -8099,7 +8099,7 @@ class HasOnNegativeSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` \sa `CGAL::Sphere_3` @@ -8140,7 +8140,7 @@ class HasOnNegativeSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Line_2` @@ -8181,7 +8181,7 @@ class HasOnPositiveSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` \sa `CGAL::Sphere_3` @@ -8222,7 +8222,7 @@ class HasOnPositiveSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Iso_rectangle_2` @@ -8267,7 +8267,7 @@ class HasOnUnboundedSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Iso_cuboid_3` \sa `CGAL::Sphere_3` @@ -8311,7 +8311,7 @@ class HasOnUnboundedSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Line_2` \sa `CGAL::Ray_2` @@ -8352,7 +8352,7 @@ class HasOn_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_3` \sa `CGAL::Line_3` @@ -8439,7 +8439,7 @@ class HasOn_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa \link intersection_grp `CGAL::intersection()` \endlink */ @@ -8466,7 +8466,7 @@ class Intersect_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two or three arguments)} + \cgalRefines{AdaptableBinaryFunctor, AdaptableTernaryFunctor} \sa intersection_linear_grp */ @@ -8495,7 +8495,7 @@ class Intersect_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Iso_rectangle_2` @@ -8550,7 +8550,7 @@ class IsDegenerate_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Circle_3` \sa `CGAL::Iso_cuboid_3` @@ -8624,7 +8624,7 @@ class IsDegenerate_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Line_2` \sa `CGAL::Ray_2` @@ -8661,7 +8661,7 @@ class IsHorizontal_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one argument)} + \cgalRefines{AdaptableUnaryFunction} \sa `CGAL::Line_2` \sa `CGAL::Ray_2` @@ -8700,7 +8700,7 @@ class IsVertical_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `left_turn_grp` @@ -8728,7 +8728,7 @@ class LeftTurn_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `has_smaller_distance_to_point_grp` @@ -8757,7 +8757,7 @@ class LessDistanceToPoint_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `has_smaller_distance_to_point_grp` @@ -8785,7 +8785,7 @@ class LessDistanceToPoint_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} */ class LessRotateCCW_2 { @@ -8816,7 +8816,7 @@ class LessRotateCCW_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `has_smaller_signed_distance_to_line_grp` @@ -8858,7 +8858,7 @@ class LessSignedDistanceToLine_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `has_smaller_signed_distance_to_plane_grp` @@ -8898,7 +8898,7 @@ class LessSignedDistanceToPlane_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `lexicographically_xyz_smaller_grp` @@ -8928,7 +8928,7 @@ class LessXYZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `lexicographically_xy_smaller_grp` @@ -8957,7 +8957,7 @@ class LessXY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_xy_grp` @@ -8985,7 +8985,7 @@ class LessXY_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_x_grp` @@ -9013,7 +9013,7 @@ class LessX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_x_grp` @@ -9040,7 +9040,7 @@ class LessX_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_yx_grp` @@ -9068,7 +9068,7 @@ class LessYX_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_y_grp` @@ -9095,7 +9095,7 @@ class LessY_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `compare_y_grp` @@ -9150,7 +9150,7 @@ class LessZ_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with one arguments)} + \cgalRefines{AdaptableUnaryFunction} */ class NonZeroCoordinateIndex_3 { @@ -9175,7 +9175,7 @@ class NonZeroCoordinateIndex_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with three arguments)} + \cgalRefines{AdaptableTernaryFunction} \sa `orientation_grp` @@ -9214,7 +9214,7 @@ class Orientation_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `orientation_grp` @@ -9260,7 +9260,7 @@ class Orientation_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Circle_2` \sa `CGAL::Line_2` @@ -9317,7 +9317,7 @@ class OrientedSide_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with two arguments)} + \cgalRefines{AdaptableBinaryFunction} \sa `CGAL::Plane_3` \sa `CGAL::Sphere_3` @@ -9375,7 +9375,7 @@ class OrientedSide_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with four arguments)} +\cgalRefines{AdaptableQuaternaryFunction} \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_2` for the definition of orthogonality for power distances. @@ -9441,7 +9441,7 @@ class PowerSideOfBoundedPowerCircle_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with five arguments)} +\cgalRefines{AdaptableQuinaryFunction} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definition of orthogonality for power distances. @@ -9522,7 +9522,7 @@ class PowerSideOfBoundedPowerSphere_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `CGAL::Weighted_point_2` \sa `ComputePowerProduct_2` for the definition of power distance. @@ -9559,7 +9559,7 @@ class PowerSideOfOrientedPowerCircle_2 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept -\cgalRefines{AdaptableFunctor (with five arguments)} +\cgalRefines{AdaptableQuinaryFunction} \sa `CGAL::Weighted_point_3` \sa `ComputePowerProduct_3` for the definition of power distance. @@ -9608,7 +9608,7 @@ class PowerSideOfOrientedPowerSphere_3 \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `side_of_bounded_circle_grp` @@ -9648,7 +9648,7 @@ class SideOfBoundedCircle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with five arguments)} + \cgalRefines{AdaptableQuinaryFunction} \sa `side_of_bounded_sphere_grp` @@ -9700,7 +9700,7 @@ class SideOfBoundedSphere_3 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with four arguments)} + \cgalRefines{AdaptableQuaternaryFunction} \sa `side_of_oriented_circle_grp` @@ -9740,7 +9740,7 @@ class SideOfOrientedCircle_2 { \ingroup PkgKernel23ConceptsFunctionObjects \cgalConcept - \cgalRefines{AdaptableFunctor (with five arguments)} + \cgalRefines{AdaptableQuinaryFunction} \sa `side_of_oriented_sphere_grp` 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 10695e97732f..b2585622b90a 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{AdaptableUnaryFunction} \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 0b03cae29369..b4dc50544e1a 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{AdaptableUnaryFunction} */ 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 b1235d5e6faf..b04b09bfffb1 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{AdaptableUnaryFunction} */ class Kernel_d::Construct_min_vertex_d { diff --git a/Number_types/doc/Number_types/Concepts/RootOf_2.h b/Number_types/doc/Number_types/Concepts/RootOf_2.h index c2e9a68f6bb8..a772693794da 100644 --- a/Number_types/doc/Number_types/Concepts/RootOf_2.h +++ b/Number_types/doc/Number_types/Concepts/RootOf_2.h @@ -27,7 +27,7 @@ special construction for extensions of degree 2: - `CGAL::make_sqrt()` -\cgalRefines{DefaultConstructible,CopyConstructible,FromIntConstructible} +\cgalRefines{DefaultConstructible,CopyConstructible,FromIntConstructible, ImplicitInteroperable with `RT`,ImplicitInteroperable with `FT`} \cgalHasModel `double` (not exact) 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 43519f9e79cb..218a51a9d103 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 @@ -82,8 +82,8 @@ A type for the predicate functor that is responsible for rejecting an edge of the Delaunay graph (or equivalently rejecting its dual edge in the Voronoi diagram). It must be model of the concepts `DefaultConstructible`, -`CopyConstructible`, `Assignable`, and `AdaptableFunctor` -(with two arguments). It must provide the following operators: +`CopyConstructible`, `Assignable`, and `AdaptableBinaryFunction`. +It must provide the following operators: `bool operator()(Delaunay_graph dg, Delaunay_edge e)` @@ -104,8 +104,8 @@ A type for the predicate functor that is responsible for rejecting a vertex of the Delaunay graph (or equivalently its dual face in the Voronoi diagram - hence the name of the functor). It must be model of the concepts `DefaultConstructible`, -`CopyConstructible`, `Assignable`, `AdaptableFunctor` -(with two arguments). It must provide the following operator: +`CopyConstructible`, `Assignable`, `AdaptableBinaryFunction`. +It must provide the following operator:
`bool operator()(Delaunay graph dg, Delaunay_vertex_handle v)`
@@ -126,7 +126,7 @@ typedef unspecified_type Has_inserter; A type for a functor that inserts sites in the Delaunay graph. It must be model of the concepts `DefaultConstructible`, `CopyConstructible`, `Assignable`, -`AdaptableFunctor` (with two arguments). It must provide the +`AdaptableBinaryFunction` following operator
`Delaunay_vertex_handle operator()(Delaunay_graph& dg, Site_2 t)`
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 201e815138b0..bdd875609361 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 @@ -63,7 +63,7 @@ typedef Delaunay_graph::Vertex_handle Delaunay_vertex_handle; A type for a functor that accesses the site associated with a vertex. The functor should be a model of the concepts `DefaultConstructible`, `CopyConstructible`, -`Assignable` and `AdaptableFunctor` (with one argument). The +`Assignable` and `AdaptableUnaryFunction`. The functor must provide the following operator:
`result_type operator()(Delaunay_vertex_handle v)`
@@ -79,7 +79,7 @@ constructs the dual point of a (triangular) face in the Delaunay graph. This point is the Voronoi vertex of the three sites defining the face in the Delaunay graph. The functor must be a model of the concepts `DefaultConstructible`, `CopyConstructible`, -`Assignable`, `AdaptableFunctor` (with one argument). It +`Assignable`, `AdaptableUnaryFunction`. It must provide the following operator:
`Point_2 operator()(Delaunay_face_handle f)`
. @@ -107,8 +107,8 @@ the source and target vertices of the edge. In all other cases, the search result is a vertex, namely, the unique vertex of the Delaunay graph closest to the query point. The functor must be a model of the concepts `DefaultConstructible`, -`CopyConstructible`, `Assignable`, `AdaptableFunctor` -(with two arguments). It must provide the following operator: +`CopyConstructible`, `Assignable`, `AdaptableBinaryFunction`. +It must provide the following operator:
`result_type operator()(Delaunay_graph dg, Point_2 p)`