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

add missing const

This commit is contained in:
Sébastien Loriot 2019-10-11 08:07:02 +02:00
parent acec5469fe
commit 9221290bef
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h
View File

@ -47,7 +47,7 @@ namespace CGAL {
*\tparam FaceGraph is a model of the face graph concept. *\tparam FaceGraph is a model of the face graph concept.
*\tparam VertexPointPMap is a property map with `boost::graph_traits<FaceGraph>::%vertex_descriptor` *\tparam VertexPointPMap is a property map with `boost::graph_traits<FaceGraph>::%vertex_descriptor`
* as key type and a \cgal Kernel `Point_3` as value type. * as key type and a \cgal Kernel `Point_3` as value type.
* The default is `typename boost::property_map< FaceGraph,vertex_point_t>::%type`. * The default is `typename boost::property_map< FaceGraph,vertex_point_t>::%const_type`.
*\tparam OneFaceGraphPerTree is either `CGAL::Tag_true` or `CGAL::Tag_false`. *\tparam OneFaceGraphPerTree is either `CGAL::Tag_true` or `CGAL::Tag_false`.
* In the former case, we guarantee that all the primitives will be from a * In the former case, we guarantee that all the primitives will be from a
* common `FaceGraph` and some data will be factorized so that the size of * common `FaceGraph` and some data will be factorized so that the size of

10
AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
View File

@ -58,7 +58,7 @@ namespace CGAL {
* \tparam HalfedgeGraph is a model of the halfedge graph concept. * \tparam HalfedgeGraph is a model of the halfedge graph concept.
* as key type and a \cgal Kernel `Point_3` as value type. * as key type and a \cgal Kernel `Point_3` as value type.
* \tparam VertexPointPMap is a property map with `boost::graph_traits<HalfedgeGraph>::%vertex_descriptor`. * \tparam VertexPointPMap is a property map with `boost::graph_traits<HalfedgeGraph>::%vertex_descriptor`.
* The default is `typename boost::property_map< HalfedgeGraph,vertex_point_t>::%type`. * The default is `typename boost::property_map< HalfedgeGraph,vertex_point_t>::%const_type`.
* \tparam OneHalfedgeGraphPerTree is either `CGAL::Tag_true` or `CGAL::Tag_false`. * \tparam OneHalfedgeGraphPerTree is either `CGAL::Tag_true` or `CGAL::Tag_false`.
* In the former case, we guarantee that all the primitives will be from a * In the former case, we guarantee that all the primitives will be from a
* common `HalfedgeGraph` and some data will be factorized so that the size of * common `HalfedgeGraph` and some data will be factorized so that the size of
@ -86,17 +86,17 @@ class AABB_halfedge_graph_segment_primitive
HalfedgeGraph, HalfedgeGraph,
typename Default::Get<VertexPointPMap, typename Default::Get<VertexPointPMap,
typename boost::property_map< HalfedgeGraph, typename boost::property_map< HalfedgeGraph,
vertex_point_t>::type >::type >, vertex_point_t>::const_type >::type >,
Source_point_from_edge_descriptor_map< Source_point_from_edge_descriptor_map<
HalfedgeGraph, HalfedgeGraph,
typename Default::Get<VertexPointPMap, typename Default::Get<VertexPointPMap,
typename boost::property_map< HalfedgeGraph, typename boost::property_map< HalfedgeGraph,
vertex_point_t>::type >::type >, vertex_point_t>::const_type >::type >,
OneHalfedgeGraphPerTree, OneHalfedgeGraphPerTree,
CacheDatum > CacheDatum >
#endif #endif
{ {
typedef typename Default::Get<VertexPointPMap,typename boost::property_map< HalfedgeGraph,vertex_point_t>::type >::type VertexPointPMap_; typedef typename Default::Get<VertexPointPMap,typename boost::property_map< HalfedgeGraph,vertex_point_t>::const_type >::type VertexPointPMap_;
typedef typename boost::graph_traits<HalfedgeGraph>::edge_descriptor ED; typedef typename boost::graph_traits<HalfedgeGraph>::edge_descriptor ED;
typedef typename boost::mpl::if_<OneHalfedgeGraphPerTree, ED, std::pair<ED, const HalfedgeGraph*> >::type Id_; typedef typename boost::mpl::if_<OneHalfedgeGraphPerTree, ED, std::pair<ED, const HalfedgeGraph*> >::type Id_;
@ -127,7 +127,7 @@ public:
/*! /*!
The point type. The point type.
*/ */
typedef boost::property_traits< boost::property_map< HalfedgeGraph, vertex_point_t>::type >::value_type Point; typedef boost::property_traits< boost::property_map< HalfedgeGraph, vertex_point_t>::const_type >::value_type Point;
/*! /*!
Geometric data type. Geometric data type.
*/ */