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

Fix warning/error

This commit is contained in:
Simon Giraudot 2019-04-23 10:20:16 +02:00
parent aee8735193
commit d8ec8b8986
2 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/neighbor_query.h
View File

@ -58,7 +58,7 @@ void neighbor_query (const Point& query,
// if k=0, no limit on the number of neighbors returned // if k=0, no limit on the number of neighbors returned
if (k == 0) if (k == 0)
k = std::numeric_limits<unsigned int>::max(); k = (std::numeric_limits<unsigned int>::max)();
try try
{ {

1
Point_set_processing_3/include/CGAL/mst_orient_normals.h
View File

@ -333,7 +333,6 @@ create_riemannian_graph(
typedef Euclidean_distance_vertex_handle_3<ForwardIterator> KDistance; typedef Euclidean_distance_vertex_handle_3<ForwardIterator> KDistance;
typedef Orthogonal_k_neighbor_search<Traits,KDistance> Neighbor_search; typedef Orthogonal_k_neighbor_search<Traits,KDistance> Neighbor_search;
typedef typename Neighbor_search::Tree Tree; typedef typename Neighbor_search::Tree Tree;
typedef typename Neighbor_search::iterator Search_iterator;
// Riemannian_graph types // Riemannian_graph types
typedef internal::Riemannian_graph<ForwardIterator> Riemannian_graph; typedef internal::Riemannian_graph<ForwardIterator> Riemannian_graph;