diff --git a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in index 418c2e49c58d..aabe7dd3cd7d 100644 --- a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in @@ -264,7 +264,7 @@ ALIASES = "sc{1}=\1 \endhtmlonly" \ "cgalDebugFunction=This is a function for debugging purpose." \ "cgalAdvancedBegin=^^ \htmlonly[block]
Advanced
\endhtmlonly ^^" \ - "cgalAdvancedEnd=\htmlonly[block]
\endhtmlonly" \ + "cgalAdvancedEnd=^^ \htmlonly[block] \endhtmlonly" \ "cgalAdvancedFunction=This is an advanced function." \ "cgalAdvancedClass=This is an advanced class." \ "cgalAdvancedType=This is an advanced type." \ diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h index adfe27b875e9..7efd97aab280 100644 --- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h +++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h @@ -515,7 +515,6 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2 Converts the current triangulation into the same periodic triangulation in the 1-sheeted covering space. \pre `is_triangulation_in_1_sheet()` - \cgalAdvancedEnd */ void convert_to_1_sheeted_covering(); @@ -992,7 +991,6 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2 `f`. Face `f` is modified, two new faces are created. If the triangulation contains periodic copies, a point is inserted in all periodic copies. \pre The point in vertex `v` lies inside face `f`. - \cgalAdvancedEnd */ Vertex_handle insert_in_face(const Point& p, Face_handle f); @@ -1002,7 +1000,6 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2 \cgalAdvancedBegin Removes a vertex of degree three. Two of the incident faces are destroyed, the third one is modified. \pre Vertex `v` is a vertex with degree three. - \cgalAdvancedEnd */ void remove_degree_3(Vertex_handle v); @@ -1026,7 +1023,6 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2 `[edge_begin, edge_end]`. Returns a handle to the new vertex. \pre The triangulation is a triangulation of 1 sheet - \cgalAdvancedEnd */ template @@ -1042,7 +1038,6 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2 and create new ones only when the sequence is exhausted. \pre The triangulation is a triangulation of 1 sheet - \cgalAdvancedEnd */ template diff --git a/Point_set_3/include/CGAL/Point_set_3.h b/Point_set_3/include/CGAL/Point_set_3.h index 752fbabaf983..df0ea714daf5 100644 --- a/Point_set_3/include/CGAL/Point_set_3.h +++ b/Point_set_3/include/CGAL/Point_set_3.h @@ -1164,7 +1164,6 @@ class Point_set_3 \return Returns a pair containing: the specified property map and a Boolean set to `true` or an empty property map and a Boolean set to `false` (if the property was not found). - \cgalAdvancedEnd */ template @@ -1190,7 +1189,6 @@ class Point_set_3 \note The normal property must have been added to the point set before calling this method (see `add_normal_map()`). - \cgalAdvancedEnd */ Vector_push_map normal_push_map () diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h index 00f59edabd01..ee82122c9d96 100644 --- a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h +++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h @@ -125,7 +125,6 @@ data structure that only changes the vertex type. It has to define a type `Rebind_vertex::%Other` which is a rebound triangulation data structure, that is, the one whose `TriangulationDSVertexBase_3` will be `Vb2`. \note It can be implemented using a nested template class. - \cgalAdvancedEnd */ template @@ -139,7 +138,6 @@ data structure that only changes the cell type. It has to define a type `Rebind_cell::%Other` which is a rebound triangulation data structure, that is, the one whose `TriangulationDSCellBase_3` will be `Cb2`. \note It can be implemented using a nested template class. - \cgalAdvancedEnd */ template diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h index 515b96f32591..409fe016c17c 100644 --- a/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h +++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h @@ -81,7 +81,6 @@ data structure that only changes the vertex type. It has to define a type `Other` which is a rebound triangulation data structure with `Vb2` as vertex type. \note It can be implemented using a nested template class. - \cgalAdvancedEnd */ template @@ -95,7 +94,6 @@ data structure that only changes the full cell type. It has to define a type `Other` which is a rebound triangulation data structure with `Fcb2` as full cell type. \note It can be implemented using a nested template class. - \cgalAdvancedEnd */ template @@ -116,7 +114,6 @@ The boundary is recognized by checking the mark of the full cells. This method is used by `Triangulation_data_structure::insert_in_hole()`. s \pre same as `TriangulationDataStructure::insert_in_hole()` - \cgalAdvancedEnd */ diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h index 61eff5931f69..cbbe03db2327 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h @@ -450,7 +450,6 @@ All vertices of cells of \f$ C\f$ are on \f$ \partial H\f$. \cgalFigureBegin{triangulationfiginserthole,insert-in-hole.png} Insertion in a hole, \f$ d=2\f$ \cgalFigureEnd - \cgalAdvancedEnd */ template< class ForwardIterator > Vertex_handle diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h index 44bd8eae2dcf..9317ccc4d174 100644 --- a/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h +++ b/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h @@ -450,7 +450,6 @@ constraints based on a cost and stop function. \pre The vertex referred by vicq is not contained in any other constraint. \pre Let `vip` and `vir` be defined as `vip = std::prev(vicq)` and `vir = std::next(vicr)`. \pre The line segment between `*vicp->point()` and `*vicr->point()` must not intersect any constraint. - \cgalAdvancedEnd */ void