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

Fix warning about discarding return values of nodiscarding functions

This commit is contained in:
Mael Rouxel-Labbé 2020-02-11 08:57:02 +01:00
parent 48bf4c3f52
commit df43e3e950
2 changed files with 17 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Convex_hull_d/test/Convex_hull_d/chull_d-test.cpp
View File

@ -79,9 +79,15 @@ int main()
Convex_hull_d::Point_const_iterator pit; Convex_hull_d::Point_const_iterator pit;
Convex_hull_d::Vertex_iterator vit; Convex_hull_d::Vertex_iterator vit;
Convex_hull_d::Simplex_iterator sit; Convex_hull_d::Simplex_iterator sit;
for (pit = T1.points_begin(); pit != T1.points_end(); pit++) *pit; for (pit = T1.points_begin(); pit != T1.points_end(); pit++) {
for (vit = T1.vertices_begin(); vit != T1.vertices_end(); vit++) *vit; const Point& p = *pit;
for (sit = T1.simplices_begin(); sit != T1.simplices_end(); sit++) *sit; 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.is_valid();
T1.clear(2); T1.clear(2);
CGAL_TEST(T1.number_of_vertices()==0); CGAL_TEST(T1.number_of_vertices()==0);

11
Hash_map/test/Hash_map/Hash.cpp
View File

@ -41,7 +41,8 @@ fct(const P& )
{ {
std::map<Descriptor,int> M; std::map<Descriptor,int> M;
Descriptor d; 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; boost::unordered_map<Descriptor, int> U;
U[d] = 12; U[d] = 12;
@ -56,7 +57,9 @@ void fct2()
{ // For dart handle { // For dart handle
std::map<dh, int> M; std::map<dh, int> M;
dh e; 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; boost::unordered_map<dh, int> U;
U[e] = 12; U[e] = 12;
} }
@ -64,7 +67,9 @@ void fct2()
{ // For vertex attribute handle { // For vertex attribute handle
std::map<vh, int> M; std::map<vh, int> M;
vh e; 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; boost::unordered_map<vh, int> U;
U[e] = 12; U[e] = 12;
} }