mirror of https://github.com/CGAL/cgal
Use const&
This commit is contained in:
parent
7a49b48019
commit
e15dbd02aa
|
|
@ -22,7 +22,7 @@ main( )
|
|||
|
||||
assert(cdt.is_valid());
|
||||
int count = 0;
|
||||
for (Edge e : cdt.finite_edges())
|
||||
for (const Edge& e : cdt.finite_edges())
|
||||
if (cdt.is_constrained(e))
|
||||
++count;
|
||||
std::cout << "The number of resulting constrained edges is ";
|
||||
|
|
|
|||
|
|
@ -34,7 +34,7 @@ contexts(const CDTP& cdtp)
|
|||
if(cdtp.number_of_enclosing_constraints(vp, vq) == 2){
|
||||
std::cout << "subconstraint " << vp->point() << " " << vq->point()
|
||||
<< " 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;
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Reference in New Issue