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

Use const&

This commit is contained in:
Andreas Fabri 2019-06-14 15:47:43 +02:00
parent 7a49b48019
commit e15dbd02aa
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Triangulation_2/examples/Triangulation_2/constrained.cpp
View File

@ -22,7 +22,7 @@ main( )
assert(cdt.is_valid()); assert(cdt.is_valid());
int count = 0; int count = 0;
for (Edge e : cdt.finite_edges()) for (const Edge& e : cdt.finite_edges())
if (cdt.is_constrained(e)) if (cdt.is_constrained(e))
++count; ++count;
std::cout << "The number of resulting constrained edges is "; std::cout << "The number of resulting constrained edges is ";

2
Triangulation_2/examples/Triangulation_2/polylines_triangulation.cpp
View File

@ -34,7 +34,7 @@ contexts(const CDTP& cdtp)
if(cdtp.number_of_enclosing_constraints(vp, vq) == 2){ if(cdtp.number_of_enclosing_constraints(vp, vq) == 2){
std::cout << "subconstraint " << vp->point() << " " << vq->point() std::cout << "subconstraint " << vp->point() << " " << vq->point()
<< " is on constraints starting at:\n"; << " is on constraints starting at:\n";
for(CDTP::Context c : cdtp.contexts(vp,vq)){ for(const CDTP::Context& c : cdtp.contexts(vp,vq)){
std::cout << (*(c.vertices_begin()))->point() << std::endl; std::cout << (*(c.vertices_begin()))->point() << std::endl;
} }
} }