From d8ec8b89861c3eebb167600affd5180b81ea2c88 Mon Sep 17 00:00:00 2001
From: Simon Giraudot <simon.giraudot@geometryfactory.com>
Date: Tue, 23 Apr 2019 10:20:16 +0200
Subject: [PATCH] Fix warning/error

---
 .../CGAL/Point_set_processing_3/internal/neighbor_query.h       | 2 +-
 Point_set_processing_3/include/CGAL/mst_orient_normals.h        | 1 -
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/neighbor_query.h b/Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/neighbor_query.h
index 1fdb0245c66..85921d2f2eb 100644
--- a/Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/neighbor_query.h
+++ b/Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/neighbor_query.h
@@ -58,7 +58,7 @@ void neighbor_query (const Point& query,
 
     // if k=0, no limit on the number of neighbors returned
     if (k == 0)
-      k = std::numeric_limits<unsigned int>::max();
+      k = (std::numeric_limits<unsigned int>::max)();
     
     try
     {
diff --git a/Point_set_processing_3/include/CGAL/mst_orient_normals.h b/Point_set_processing_3/include/CGAL/mst_orient_normals.h
index 90db8f3fffc..4ed8e68d7e7 100644
--- a/Point_set_processing_3/include/CGAL/mst_orient_normals.h
+++ b/Point_set_processing_3/include/CGAL/mst_orient_normals.h
@@ -333,7 +333,6 @@ create_riemannian_graph(
     typedef Euclidean_distance_vertex_handle_3<ForwardIterator> KDistance;
     typedef Orthogonal_k_neighbor_search<Traits,KDistance> Neighbor_search;
     typedef typename Neighbor_search::Tree Tree;
-    typedef typename Neighbor_search::iterator Search_iterator;
 
     // Riemannian_graph types
     typedef internal::Riemannian_graph<ForwardIterator> Riemannian_graph;