songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix warnings

This commit is contained in:
Sébastien Loriot 2020-10-26 17:00:21 +01:00
parent 8375ef1c11
commit 1e6bf0c2f3
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
BGL/doc/BGL/Concepts/FaceGraph.h
View File

@ -25,7 +25,7 @@ A face descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompara
\sa \link PkgBGLConcepts Graph Concepts \endlink \sa \link PkgBGLConcepts Graph Concepts \endlink
*/ */
class FaceGraph { class FaceGraph {
/// Returns a special `boost::graph_traits<HalfedgeGraph>::face_descriptor` object which /// Returns a special `boost::graph_traits<HalfedgeGraph>::%face_descriptor` object which
/// does not refer to any face of graph object which type is `FaceGraph`. /// does not refer to any face of graph object which type is `FaceGraph`.
static boost::graph_traits<HalfedgeGraph>::halfedge_descriptor null_face(); static boost::graph_traits<HalfedgeGraph>::halfedge_descriptor null_face();
}; };

2
BGL/doc/BGL/Concepts/HalfedgeGraph.h
View File

@ -44,7 +44,7 @@ A model of `HalfedgeGraph` must have the interior property `vertex_point` attach
\sa \link PkgBGLConcepts Graph Concepts \endlink \sa \link PkgBGLConcepts Graph Concepts \endlink
*/ */
class HalfedgeGraph { class HalfedgeGraph {
/// Returns a special `boost::graph_traits<HalfedgeGraph>::halfedge_descriptor` object which /// Returns a special `boost::graph_traits<HalfedgeGraph>::%halfedge_descriptor` object which
/// does not refer to any halfedge of graph object which type is `HalfedgeGraph`. /// does not refer to any halfedge of graph object which type is `HalfedgeGraph`.
static boost::graph_traits<HalfedgeGraph>::halfedge_descriptor null_halfedge(); static boost::graph_traits<HalfedgeGraph>::halfedge_descriptor null_halfedge();
}; };

4
Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
View File

@ -1579,7 +1579,7 @@ private:
/*! /*!
* @brief runs the pseudo Constrained Delaunay Triangulation at each proxy region, * @brief runs the pseudo Constrained Delaunay Triangulation at each proxy region,
* and stores the extracted indexed triangles in @a tris. * and stores the extracted indexed triangles in `tris`.
* @pre all anchors are found, i.e. all boundary cycles have been visited * @pre all anchors are found, i.e. all boundary cycles have been visited
* and attached with at least 3 anchors. * and attached with at least 3 anchors.
*/ */
@ -1778,7 +1778,7 @@ private:
} }
/*! /*!
* @brief subdivides a chord recursively in range `[@a chord_begin, @a chord_end).` * @brief subdivides a chord recursively in range `[chord_begin, chord_end).`
* @param chord_begin begin iterator of the chord * @param chord_begin begin iterator of the chord
* @param chord_end end iterator of the chord * @param chord_end end iterator of the chord
* @param subdivision_ratio the chord recursive split error threshold * @param subdivision_ratio the chord recursive split error threshold