replaced

\ccPkgMaturity{Introduced in \cgal\ 
by 
\ccPkgIntroducedInCGAL{

Alpha_shapes_2/doc_tex/Alpha_shapes_2/PkgDescription.tex

@@ -8,6 +8,6 @@ alpha values and a filtration on the triangulation faces (this filtration is bas
 alpha value for which each face is included on the alpha-complex).}
 
 \ccPkgDependsOn{\ccRef[2D Triangulation]{Pkg:Triangulation2}}
-\ccPkgMaturity{Introduced in \cgal\ 2.4}
+\ccPkgIntroducedInCGAL{2.4}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Alpha_shapes_3/doc_tex/Alpha_shapes_3/PkgDescription.tex

@@ -7,6 +7,6 @@ alpha values and a filtration on the triangulation faces (this filtration is bas
 alpha value for which each face is included on the alpha-complex).}
 
 \ccPkgDependsOn{\ccRef[2D Triangulation]{Pkg:Triangulation3}}
-\ccPkgMaturity{Introduced in \cgal\ 2.4}
+\ccPkgIntroducedInCGAL{2.4}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Apollonius_graph_2/doc_tex/Apollonius_graph_2/PkgDescription.tex

@@ -10,6 +10,6 @@
       dynamic.}
 
 \ccPkgDependsOn{\ccRef[2D Triangulation Data Structure]{Pkg:TDS2}}
-\ccPkgMaturity{Introduced in \cgal\ 3.0}
+\ccPkgIntroducedInCGAL{3.0}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Boolean_set_operations_2/doc_tex/Boolean_set_operations_2/PkgDescription.tex

@@ -8,6 +8,6 @@ particular, it contains the implementation of regularized Boolean
 set-operations, intersection predicates, and point containment predicates.}
 
 \ccPkgDependsOn{\ccRef[2D Arrangements]{Pkg:Arrangement2}}
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex

@@ -9,6 +9,6 @@ tests of surfaces etc.
 }
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 3.1}
+\ccPkgIntroducedInCGAL{3.1}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Convex_hull_2/doc_tex/Convex_hull_2/PkgDescription.tex

@@ -8,6 +8,6 @@ points and subsequences of hull points, such as the lower and upper
 hull of a set of points.}
 
 %\ccPkgDependsOn{\ccRefPkg:Triangulation2}
-\ccPkgMaturity{Introduced in \cgal\ 1.0}
+\ccPkgIntroducedInCGAL{1.0}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Convex_hull_3/doc_tex/Convex_hull_3/PkgDescription.tex

@@ -10,6 +10,6 @@ dynamic computation.}
 
 \ccPkgDependsOn{All algorithms produce as output a \ccRef[3D Polyhedron]{Pkg:Polyhedron}. 
                 The dynamic algorithms depend on \ccRef[3D Triangulations]{Pkg:Triangulation3}}
-\ccPkgMaturity{Introduced in \cgal\ 1.0}
+\ccPkgIntroducedInCGAL{1.0}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Curved_kernel/doc_tex/Curved_kernel/PkgDescription.tex

@@ -5,6 +5,6 @@ functionalities on circles, circular arcs and line segments in the
 plane. 
 }
 
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

HalfedgeDS/doc_tex/HalfedgeDS/PkgDescription.tex

@@ -12,6 +12,6 @@ informations, for example the halfedge pointers in faces or the
 storage of faces at all.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 2.3}
+\ccPkgIntroducedInCGAL{2.3}
 \ccPkgLicense{\ccLicenseLGPL}
 \end{ccPkgDescription}

Interpolation/doc_tex/Interpolation/PkgDescription.tex

@@ -8,6 +8,6 @@ point. The package further offers functions for natural neighbor
 interpolation.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 3.1}
+\ccPkgIntroducedInCGAL{3.1}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Kernel_23/doc_tex/Kernel_23/PkgDescription.tex

@@ -6,6 +6,6 @@ as well as predicates and constructions for these objects. The kernels
 mainly differ in the way they handle robustness issues.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 1.0}
+\ccPkgIntroducedInCGAL{1.0}
 \ccPkgLicense{\ccLicenseLGPL}
 \end{ccPkgDescription}

Kernel_d/doc_tex/Convex_hull_d/PkgDescription.tex

@@ -4,6 +4,6 @@
 for computing convex hulls and Delaunay triagulations in $d$-dimensional Euclidean space.}
 
 
-\ccPkgMaturity{Introduced in \cgal\ 1.0}
+\ccPkgIntroducedInCGAL{1.0}
 \ccPkgLicense{\ccLicenseLGPL}
 \end{ccPkgDescription}

Kernel_d/doc_tex/Kernel_d/PkgDescription.tex

@@ -5,6 +5,6 @@ vector, direction, line, ray, segment, circle in d dimensional Euclidean space,
 as well as predicates and constructions for these objects.}
 
 %\ccPkgDependsOn{\ccRefPkg:Triangulation2}
-\ccPkgMaturity{Introduced in \cgal\ 2.0}
+\ccPkgIntroducedInCGAL{2.0}
 \ccPkgLicense{\ccLicenseLGPL}
 \end{ccPkgDescription}

Kinetic_data_structures/doc_tex/Kinetic_data_structures/PkgDescription.tex

@@ -9,7 +9,7 @@ or inexact operations on primitives which move along polynomial
 trajectories.  }
 
 \ccPkgDependsOn{\ccRef[KDS Framework]{Pkg:KdsFramework}. Two dimensional visualization depends on \ccThirdPartyQt, three dimensional visualization depends on \ccThirdPartyCoin. }
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseLGPL}
 
 \end{ccPkgDescription}

Kinetic_data_structures/doc_tex/Kinetic_framework/PkgDescription.tex

@@ -8,6 +8,6 @@ supports exact or inexact operations on primitives which move along
 polynomial trajectories.  }
 
 \ccPkgDependsOn{Two dimensional visualization depends on  \ccThirdPartyQt, three dimensional visualization depends on \ccThirdPartyCoin. }
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 
 \end{ccPkgDescription}

Mesh_2/doc_tex/Mesh_2/PkgDescription.tex

@@ -17,6 +17,6 @@ and set no restriction on the angle formed
  by two constraints sharing an endpoint.}
 
 \ccPkgDependsOn{\ccRef[2D Delaunay Triangulation]{Pkg:Triangulation2}}
-\ccPkgMaturity{Introduced in \cgal\ 3.1}
+\ccPkgIntroducedInCGAL{3.1}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Nef_2/doc_tex/Nef_2/PkgDescription.tex

@@ -11,6 +11,6 @@ are more topological unary set operations that are closed in the
 domain of Nef polygons interior, boundary, and closure.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 3.0}
+\ccPkgIntroducedInCGAL{3.0}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Nef_3/doc_tex/Nef_3/PkgDescription.tex

@@ -9,6 +9,6 @@ isolated vertices and antennas). Nef polyhedra distinguish between
 open and closed sets and can represent non-manifold geometry.}
 
 \ccPkgDependsOn{\ccRef[2D Nef Polygons]{Pkg:Nef2}, \ccRef[Nef Polygons on the Sphere]{Pkg:NefS2} }
-\ccPkgMaturity{Introduced in \cgal\ 3.1}
+\ccPkgIntroducedInCGAL{3.1}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Nef_S2/doc_tex/Nef_S2/PkgDescription.tex

@@ -4,6 +4,6 @@
 Here halfplanes correspond to half spheres delimited by great circles. }
 
 \ccPkgDependsOn{\ccRef[2D Nef Polygon]{Pkg:Nef2}}
-\ccPkgMaturity{Introduced in \cgal\ 3.1}
+\ccPkgIntroducedInCGAL{3.1}
 
 \end{ccPkgDescription}

Optimisation_doc/doc_tex/Optimisation/PkgDescription.tex

@@ -5,7 +5,7 @@ This package provides algorithms for computing bounding volumes of point sets, a
 It further provides algorithms for computing inscribed areas. }
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 2.4}
+\ccPkgIntroducedInCGAL{2.4}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}
 
@@ -16,6 +16,6 @@ This package provides algorithms for computing bounding volumes of point sets, a
 It further provides algorithms for computing inscribed areas. }
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 2.4}
+\ccPkgIntroducedInCGAL{2.4}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Polyhedron/doc_tex/Polyhedron/PkgDescription.tex

@@ -7,6 +7,6 @@ class of representable surfaces to orientable 2-manifolds - with and
 without boundary. If the surface is closed we call it a polyhedron.}
 
 \ccPkgDependsOn{\ccRef[Halfedge Data Structure]{Pkg:HDS}}
-\ccPkgMaturity{Introduced in \cgal\ 2.4}
+\ccPkgIntroducedInCGAL{2.4}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Principal_component_analysis/doc_tex/Principal_component_analysis/PkgDescription.tex

@@ -9,6 +9,6 @@ fitting for point sets in 2D, and point sets as well as triangle sets
 in 3D.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

SearchStructures/doc_tex/SearchStructures/PkgDescription.tex

@@ -5,6 +5,6 @@ sets, and to enumerate all ranges enclosing a query point. The provided data str
 are static and they are optimized for fast queries.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 2.4}
+\ccPkgIntroducedInCGAL{2.4}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Segment_Delaunay_graph_2/doc_tex/Segment_Delaunay_graph_2/PkgDescription.tex

@@ -7,6 +7,6 @@
       dynamic.}
 
 \ccPkgDependsOn{\ccRef[2D Triangulation Data Structure]{Pkg:TDS2}}
-\ccPkgMaturity{Introduced in \cgal\ 3.1}
+\ccPkgIntroducedInCGAL{3.1}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Snap_rounding_2/doc_tex/Snap_rounding_2/PkgDescription.tex

@@ -10,6 +10,6 @@ is at least half-the-width-of-a-pixel away from any non-incident
 edge. This package supports both methods.}
 
 \ccPkgDependsOn{\ccRef[Arrangements]{Pkg:Arrangement2}}
-\ccPkgMaturity{Introduced in \cgal\ 3.1}
+\ccPkgIntroducedInCGAL{3.1}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Straight_skeleton_2/doc_tex/Straight_skeleton_2/PkgDescription.tex

@@ -6,6 +6,6 @@ polygon with holes and an algorithm to construct inward offset
 polygons at any offset distance given a straight skeleton.}
 
 \ccPkgDependsOn{ \ccRef[Halfedge Data Structure]{Pkg:HDS}}
-\ccPkgMaturity{Introduced in \cgal 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Stream_lines_2/doc_tex/Stream_lines_2/PkgDescription.tex

@@ -12,6 +12,6 @@ centers of the biggest empty circles to start the integration of the
 streamlines.}
 
 \ccPkgDependsOn{\ccRef[2D Delaunay triangulation]{Pkg:Triangulation2}}
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Subdivision_method_3/doc_tex/Subdivision_method_3/PkgDescription.tex

@@ -11,6 +11,6 @@ can be easily extended by substituting the geometry computation of the
 refinement host.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseLGPL}
 \end{ccPkgDescription}

Surface_mesh_parameterization/doc_tex/Surface_mesh_parameterization/PkgDescription.tex

@@ -9,7 +9,7 @@ authalic parameterization, Floater mean value coordinates or Tutte
 barycentric mapping.}
 
 \ccPkgDependsOn{Solvers as \ccThirdPartyOpenNL\ or \ccThirdPartyTaucs.}
-\ccPkgMaturity{Introduced in \cgal 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseQPL}
 
 \end{ccPkgDescription}

Surface_mesher/doc_tex/Surface_mesher/PkgDescription.tex

@@ -17,6 +17,6 @@ of some function and surfaces described as a gray
 level set in a three-dimensional image.}
 
 %\ccPkgDependsOn{ }
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Triangulation_2/doc_tex/TDS_2/PkgDescription.tex

@@ -9,7 +9,7 @@ and provides basic  combinatorial operation on the triangulation.
 }
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 2.0}
+\ccPkgIntroducedInCGAL{2.0}
 \ccPkgLicense{\ccLicenseQPL}
 
 \end{ccPkgDescription}

Triangulation_2/doc_tex/Triangulation_2/PkgDescription.tex

@@ -22,6 +22,6 @@ are provided: some of them handle intersections between input constraints
 segment while others do not. }
 
 \ccPkgDependsOn{\ccRef[2D Triangulation Data Structure]{Pkg:TDS2}}
-\ccPkgMaturity{Introduced in \cgal\ 2.0}
+\ccPkgIntroducedInCGAL{2.0}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Triangulation_3/doc_tex/TriangulationDS_3/PkgDescription.tex

@@ -8,6 +8,6 @@ and cells of the triangulation
 and provides basic  combinatorial operations on the triangulation.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 2.1}
+\ccPkgIntroducedInCGAL{2.1}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Triangulation_3/doc_tex/Triangulation_3/PkgDescription.tex

@@ -17,6 +17,6 @@ triangulations offer nearest neighbor queries
 and primitives to build the dual Voronoi and power diagrams.}
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 2.1}
+\ccPkgIntroducedInCGAL{2.1}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}

Voronoi_diagram_2/doc_tex/Voronoi_diagram_2/PkgDescription.tex

@@ -13,6 +13,6 @@ the adaptor allows for the incremental or dynamic construction of
 Voronoi diagrams and can support point location queries. }
 
 %\ccPkgDependsOn{}
-\ccPkgMaturity{Introduced in \cgal\ 3.2}
+\ccPkgIntroducedInCGAL{3.2}
 \ccPkgLicense{\ccLicenseQPL}
 \end{ccPkgDescription}