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

Fix ToS_2

This commit is contained in:
Andreas Fabri 2023-06-28 11:42:55 +01:00
parent 33969b7929
commit 74b8ddf1ec
2 changed files with 8 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Triangulation_on_sphere_2/include/CGAL/Triangulation_on_sphere_2.h
View File

@ -275,7 +275,7 @@ public:
// solid edges: both incident faces are solid // solid edges: both incident faces are solid
typedef Filter_iterator<All_edges_iterator, Ghost_tester> Solid_edges_iterator; typedef Filter_iterator<All_edges_iterator, Ghost_tester> Solid_edges_iterator;
typedef Iterator_range<Solid_edges_iterator> Solid_edges; typedef Iterator_range<Solid_edges_iterator> Solid_edges;
typedef Iterator_range<Prevent_deref<Solid_faces_iterator> > Solid_face_handles; typedef Iterator_range<Prevent_deref<Solid_faces_iterator, Face_handle> > Solid_face_handles;
typedef Project_point<Vertex> Pt_proj; typedef Project_point<Vertex> Pt_proj;
typedef boost::transform_iterator<Pt_proj, Vertices_iterator> Point_iterator; typedef boost::transform_iterator<Pt_proj, Vertices_iterator> Point_iterator;
@ -321,7 +321,7 @@ public:
Solid_face_handles solid_faces() const Solid_face_handles solid_faces() const
{ {
return make_prevent_deref_range(solid_faces_begin(), solid_faces_end()); return { solid_faces_begin(), solid_faces_end() };
} }
Solid_edges_iterator solid_edges_begin() const Solid_edges_iterator solid_edges_begin() const

6
Triangulation_on_sphere_2/test/Triangulation_on_sphere_2/test_dtos.cpp
View File

@ -98,6 +98,12 @@ int main(int, char**)
assert(sfs.size() == 4); assert(sfs.size() == 4);
assert(tr.number_of_solid_faces() + tr.number_of_ghost_faces() == tr.number_of_faces()); assert(tr.number_of_solid_faces() + tr.number_of_ghost_faces() == tr.number_of_faces());
Tr::Face_handle fh = *tr.solid_faces().begin();
for(auto f: tr.solid_faces()) {
assert(f == fh);
break;
}
Tr::Points pts = tr.points(); Tr::Points pts = tr.points();
assert(pts.size() == tr.number_of_vertices() && pts.size() == 5); assert(pts.size() == tr.number_of_vertices() && pts.size() == 5);