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

refactor the definition of vertex_below_handle

This commit is contained in:
Laurent Rineau 2025-09-19 16:40:58 +02:00
parent 9d08d4087d
commit 7267b3a347
1 changed files with 10 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
View File

@ -2268,15 +2268,17 @@ private:
CGAL_assume(vertex_above != Vertex_handle{});
const auto vertex_above_handle = vertices_of_cavity_handles[vertex_above];
auto it = vertices_of_cavity_union_find.begin();
while(it != vertices_of_cavity_union_find.end() &&
vertices_of_cavity_union_find.same_set(it, vertex_above_handle))
{
++it;
}
CGAL_assertion((it == vertices_of_cavity_union_find.end()) ==
const auto vertex_below_handle = std::invoke([&] {
auto [b, e] = make_prevent_deref_range(vertices_of_cavity_union_find);
return *std::find_if_not(
b, e, [&](auto handle) { return vertices_of_cavity_union_find.same_set(handle, vertex_above_handle); });
});
CGAL_assertion(vertex_below_handle == vertices_of_cavity_union_find.end() ||
!vertices_of_cavity_union_find.same_set(vertex_below_handle, vertex_above_handle));
CGAL_assertion((vertex_below_handle == vertices_of_cavity_union_find.end()) ==
(vertices_of_cavity_union_find.number_of_sets() == 1));
const auto vertex_below_handle = it;
for(auto handle = vertices_of_cavity_union_find.begin(), end = vertices_of_cavity_union_find.end();
handle != end; ++handle)
{