Remove more semi-colons inside \ccNestedType (for the manual index).

Algebraic_kernel_for_circles/doc_tex/Algebraic_kernel_for_circles_ref/Root_of_traits_2.tex

@@ -8,6 +8,6 @@ Associates types for algebraic numbers to \ccc{RT}, supposed to be a \ccc{RingNu
 
 \ccTypes
 
-\ccNestedType{Root_of_2;}{Model of \ccc{RootOf_2.}}
+\ccNestedType{Root_of_2}{Model of \ccc{RootOf_2}.}
 
 \end{ccRefClass}

BGL/doc_tex/BGL_ref/HalfedgeGraph.tex

@@ -67,7 +67,7 @@ must be used to represent it.
 
 
 
-  \ccNestedType{halfedge_graph_traits<HalfedgeGraph>::undirected_edge_iterator;}
+  \ccNestedType{halfedge_graph_traits<HalfedgeGraph>::undirected_edge_iterator}
   {An iterator that iterates over one and only one of the directed edges
   in each pair of opposite directed edges. The value type of the iterator 
   is \ccc{boost::graph_traits<HalfedgeGraph>::edge_descriptor}.}{}

Kinetic_data_structures/doc_tex/Kinetic_framework_ref/Function.tex

@@ -25,7 +25,7 @@ The concept \ccClassName\ represents a function.
 
 \ccTypes
 
-\ccNestedType{NT}{The number type used in describing the function;}
+\ccNestedType{NT}{The number type used in describing the function.}
 
 \ccConstructor{Function(NT);}{Construct a constant function from a number.}
 

Skin_surface_3/doc_tex/Skin_surface_3_ref/MarchingTetrahedraObserver_3.tex

@@ -34,12 +34,12 @@
   the triangulation}{}
 \ccThreeToTwo
 
-\ccNestedType{Triangulation_cell_handle;}{handle to the Cell type of
+\ccNestedType{Triangulation_cell_handle}{handle to the Cell type of
   the triangulation}
-\ccNestedType{Polyhedron_vertex_handle;}{handle to the Vertex type of
+\ccNestedType{Polyhedron_vertex_handle}{handle to the Vertex type of
   the polyhedron}
 \ccGlue
-\ccNestedType{Polyhedron_facet_handle;}{handle to the Facet type of the
+\ccNestedType{Polyhedron_facet_handle}{handle to the Facet type of the
   polyhedron}
 
 

Skin_surface_3/doc_tex/Skin_surface_3_ref/MarchingTetrahedraTraits_3.tex

@@ -26,17 +26,17 @@ triangulation.
   
 \ccTypes
 
-%\ccNestedType{Converter;}{Function object that can convert points defined by
+%\ccNestedType{Converter}{Function object that can convert points defined by
 %  the \ccc{triangulation} to points defined by the \ccc{HDS}}
 
-\ccNestedType{Triangulation;}{The type of the triangulation}
-\ccNestedType{Halfedge_DS;}{The type of the half-edge data structure}
-\ccNestedType{Cell_handle;}{handle to the Cell type of the triangulation}
+\ccNestedType{Triangulation}{The type of the triangulation}
+\ccNestedType{Halfedge_DS}{The type of the half-edge data structure}
+\ccNestedType{Cell_handle}{handle to the Cell type of the triangulation}
 
 % \ccGlue
-\ccNestedType{HDS_point;}{the point type defined by the kernel of the
+\ccNestedType{HDS_point}{the point type defined by the kernel of the
   polyhedron}
-% \ccNestedType{HDS_RT;}{the number type defined by the kernel of the polyhedron}
+% \ccNestedType{HDS_RT}{the number type defined by the kernel of the polyhedron}
 
 \ccCreation
 \ccCreationVariable{traits}

Skin_surface_3/doc_tex/Skin_surface_3_ref/SkinSurfaceQuadraticSurfaceTraits_3.tex

@@ -24,10 +24,10 @@
 
   \ccTypes
 
-  \ccNestedType{RT;}{The ring type.}\ccGlue
-  \ccNestedType{Point_3;}{The point type.}\ccGlue
-  \ccNestedType{Vector_3;}{The vector type.}\ccGlue
-  \ccNestedType{Segment_3;}{The segment type.}
+  \ccNestedType{RT}{The ring type.}\ccGlue
+  \ccNestedType{Point_3}{The point type.}\ccGlue
+  \ccNestedType{Vector_3}{The vector type.}\ccGlue
+  \ccNestedType{Segment_3}{The segment type.}
 
   %\ccConstants
   \ccCreation 

Skin_surface_3/doc_tex/Skin_surface_3_ref/Skin_surface_3.tex

@@ -54,7 +54,7 @@
 %  \ccNestedType{TMC_traits}{The traits class used for the triangulated
 %    mixed complex}
 %  \ccGlue
-%  \ccNestedType{Triangulated_mixed_complex;}{The type of a 3D
+%  \ccNestedType{Triangulated_mixed_complex}{The type of a 3D
 %    triangulation that is used to store the triangulated mixed
 %    complex.}
 %  \ccGlue

Skin_surface_3/doc_tex/Skin_surface_3_ref/Union_of_balls_3.tex

@@ -52,7 +52,7 @@
 %    mixed complex}
 %  \ccGlue
 %%
-%  \ccNestedType{Triangulated_mixed_complex;}{The type of a 3D
+%  \ccNestedType{Triangulated_mixed_complex}{The type of a 3D
 %    triangulation that is used to store the power diagram (which is
 %    the triangulated mixed complex for a shrink factor equal to one).}
 %  \ccGlue

Spatial_searching/doc_tex/Spatial_searching_ref/IsoBox_d.tex

@@ -23,7 +23,7 @@ The concept \ccRefName\ describes the requirements for iso-boxes.
 
 \ccTypes
 
-\ccNestedType{Point_d;}{Point type.} 
+\ccNestedType{Point_d}{Point type.} 
 
 \ccCreation
 \ccCreationVariable{b}  %% choose variable name

Spatial_searching/doc_tex/Spatial_searching_ref/Kd_tree.tex

@@ -36,14 +36,14 @@ tree shall be built with extended nodes, and \ccc{CGAL::Tag_false} otherwise.
 
 \ccTypedef{Traits::Point_d Point_d;} {Point class.}
 \ccTypedef{Traits::FT FT;}{Number type.}
-\ccNestedType{Splitter;}{Splitter type.}
+\ccNestedType{Splitter}{Splitter type.}
 
-\ccNestedType{iterator;}{Bidirectional iterator with value type \ccc{Point_d} that allows
+\ccNestedType{iterator}{Bidirectional iterator with value type \ccc{Point_d} that allows
 	to enumerate all points in the tree.}
 
 \begin{ccAdvanced}
-\ccNestedType{Node_handle;}{A handle with value type \ccc{Kd_tree_node<Traits,Splitter>}.}
-\ccNestedType{Point_d_iterator;} {Random access iterator 
+\ccNestedType{Node_handle}{A handle with value type \ccc{Kd_tree_node<Traits,Splitter>}.}
+\ccNestedType{Point_d_iterator} {Random access iterator 
 with value type \ccc{Point_d*}.}
 \end{ccAdvanced}
 

Spatial_searching/doc_tex/Spatial_searching_ref/Point_container.tex

@@ -40,7 +40,7 @@ $d$-dimensional points of the concept \ccc{SearchTraits}, for example
 
 \ccTypedef{Traits::FT FT;}{Number type.}
 \ccTypedef{Traits::Point_d Point_d;}{Point type.}
-\ccNestedType{iterator;}{An iterator with value type \ccc{Point_d*}.}
+\ccNestedType{iterator}{An iterator with value type \ccc{Point_d*}.}
 
 %----------------------------------------
 \ccCreation

Spatial_searching/doc_tex/Spatial_searching_ref/SpatialTree.tex

@@ -25,11 +25,11 @@ both neighbor searching and approximate range searching.
 
 \ccNestedType{SearchTraits}{Search traits.}
 \ccNestedType{Point_d}{Point type.}
-\ccNestedType{iterator;}{Bidirectional iterator with value type \ccc{Point_d} that allows
+\ccNestedType{iterator}{Bidirectional iterator with value type \ccc{Point_d} that allows
 	to enumerate all points in the tree.}
 
-\ccNestedType{Node_handle;}{Node handle.}
-\ccNestedType{Point_d_iterator;}{Iterator with value type \ccc{Point_d*}.}
+\ccNestedType{Node_handle}{Node handle.}
+\ccNestedType{Point_d_iterator}{Iterator with value type \ccc{Point_d*}.}
 \ccNestedType{Splitter}{Splitter.}
 \ccNestedType{Distance}{Distance.}
 

Spatial_searching/doc_tex/Spatial_searching_ref/TreeTraits.tex

@@ -25,11 +25,11 @@ stored at a leaf node.
 
 \ccTypes
 
-\ccNestedType{Point;}{$d$-dimensional point.}
-\ccNestedType{Point_iterator;}{Point iterator.}
-\ccNestedType{Container;}{Point container.}
-\ccNestedType{Separator;}{Separator.}
-\ccNestedType{NT;}{Number type.}
+\ccNestedType{Point}{$d$-dimensional point.}
+\ccNestedType{Point_iterator}{Point iterator.}
+\ccNestedType{Container}{Point container.}
+\ccNestedType{Separator}{Separator.}
+\ccNestedType{NT}{Number type.}
 
 \ccCreation
 \ccCreationVariable{tr}  %% choose variable name

Stream_lines_2/doc_tex/Stream_lines_2_ref/Stream_lines_2.tex

@@ -47,9 +47,9 @@ The class \ccRefName\ has two template parameters. The first parameter
 The class \ccRefName\ provides also two types for handling
 streamlines:
 
-\ccNestedType{Point_iterator_2;}{iterator of points with value type \ccc{Point_2}.}
+\ccNestedType{Point_iterator_2}{iterator of points with value type \ccc{Point_2}.}
 \ccGlue
-\ccNestedType{Stream_line_iterator_2;}{an iterator to visit the streamlines with value type \ccc{std::pair<Point_iterator_2, Point_iterator_2>}.}
+\ccNestedType{Stream_line_iterator_2}{an iterator to visit the streamlines with value type \ccc{std::pair<Point_iterator_2, Point_iterator_2>}.}
 \ccGlue
 
 

Triangulation_2/doc_tex/Triangulation_2_ref/Regular_triangulation_2.tex

@@ -170,7 +170,7 @@ instantiation for the \ccc{Tds} parameter by the class
 vertices that are not hidden.}
 \ccNestedType{Finite_vertices_iterator}{An iterator that allows to enumerate the
 finite vertices that are not hidden.}
-\ccNestedType{Hidden_vertices_iterator;}{An iterator that allows to enumerate the
+\ccNestedType{Hidden_vertices_iterator}{An iterator that allows to enumerate the
 hidden vertices.}