From df43e3e9501edc5ed4ca35c39a7a1bdb4c26e4e0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 11 Feb 2020 08:57:02 +0100
Subject: [PATCH] Fix warning about discarding return values of nodiscarding
 functions

---
 Convex_hull_d/test/Convex_hull_d/chull_d-test.cpp | 12 +++++++++---
 Hash_map/test/Hash_map/Hash.cpp                   | 11 ++++++++---
 2 files changed, 17 insertions(+), 6 deletions(-)

diff --git a/Convex_hull_d/test/Convex_hull_d/chull_d-test.cpp b/Convex_hull_d/test/Convex_hull_d/chull_d-test.cpp
index 1b88e25ab76..cff7617e743 100644
--- a/Convex_hull_d/test/Convex_hull_d/chull_d-test.cpp
+++ b/Convex_hull_d/test/Convex_hull_d/chull_d-test.cpp
@@ -79,9 +79,15 @@ int main()
     Convex_hull_d::Point_const_iterator   pit;
     Convex_hull_d::Vertex_iterator  vit;
     Convex_hull_d::Simplex_iterator sit;
-    for (pit = T1.points_begin(); pit != T1.points_end(); pit++) *pit;
-    for (vit = T1.vertices_begin(); vit != T1.vertices_end(); vit++) *vit;
-    for (sit = T1.simplices_begin(); sit != T1.simplices_end(); sit++) *sit;
+    for (pit = T1.points_begin(); pit != T1.points_end(); pit++) {
+      const Point& p = *pit;
+      CGAL_USE(p);
+    }
+    for (vit = T1.vertices_begin(); vit != T1.vertices_end(); vit++)
+      *vit;
+    for (sit = T1.simplices_begin(); sit != T1.simplices_end(); sit++)
+      *sit;
+
     T1.is_valid();
     T1.clear(2);
     CGAL_TEST(T1.number_of_vertices()==0);
diff --git a/Hash_map/test/Hash_map/Hash.cpp b/Hash_map/test/Hash_map/Hash.cpp
index beb15ce87f0..11c54cfcb0a 100644
--- a/Hash_map/test/Hash_map/Hash.cpp
+++ b/Hash_map/test/Hash_map/Hash.cpp
@@ -41,7 +41,8 @@ fct(const P& )
 {
   std::map<Descriptor,int> M;
   Descriptor d;
-  M.find(d);
+  typename std::map<Descriptor,int>::const_iterator it = M.find(d);
+  CGAL_USE(it);
 
   boost::unordered_map<Descriptor, int> U;
   U[d] = 12;
@@ -56,7 +57,9 @@ void fct2()
   { // For dart handle
   std::map<dh, int> M;
   dh e;
-  M.find(e);
+  typename std::map<dh, int>::const_iterator it = M.find(e);
+  CGAL_USE(it);
+
   boost::unordered_map<dh, int> U;
   U[e] = 12;
   }
@@ -64,7 +67,9 @@ void fct2()
   { // For vertex attribute handle
   std::map<vh, int> M;
   vh e;
-  M.find(e);
+  typename std::map<vh, int>::const_iterator it = M.find(e);
+  CGAL_USE(it);
+
   boost::unordered_map<vh, int> U;
   U[e] = 12;
   }