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

We know that it is bidirectional, and we prefer that to using const Vertex_handle&

This commit is contained in:
Andreas Fabri 2023-06-27 13:24:27 +01:00
parent be83ab856e
commit 46b756da12
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
View File

@ -51,7 +51,7 @@ private:
: vertex_(vh), point_(vertex_->point()), input(input)
{}
const Point& point() const { return point_; }
const Vertex_handle& vertex() const { return vertex_; }
Vertex_handle vertex() const { return vertex_; }
private:
Vertex_handle vertex_;
Point point_;
@ -85,8 +85,8 @@ public:
Vertex_it
, typename Vertex_list::skip_iterator
, Vertex_handle
, boost::use_default
, const Vertex_handle&>
, std::bidirectional_iterator_tag
, Vertex_handle>
{
public:
Vertex_it() : Vertex_it::iterator_adaptor_() {}
@ -95,7 +95,7 @@ public:
bool& input() { return this->base()->input; }
private:
friend class boost::iterator_core_access;
const Vertex_handle& dereference() const { return this->base()->vertex(); }
Vertex_handle dereference() const { return this->base()->vertex(); }
};
typedef typename Constraint_list::iterator Constraint_it;