diff options
| author | Aaron Franke <arnfranke@yahoo.com> | 2021-07-15 23:45:57 -0400 |
|---|---|---|
| committer | Aaron Franke <arnfranke@yahoo.com> | 2021-07-23 17:38:28 -0400 |
| commit | 4e6efd1b07f1c6d53d226977ddc729333b74306a (patch) | |
| tree | a52f672e7f622bb65e3b65f2a2edc9d19b1ecdcf /modules/csg/csg.cpp | |
| parent | b918c4c3ce84af1f8af2d06ef31784f48a15551a (diff) | |
Use C++ iterators for Lists in many situations
Diffstat (limited to 'modules/csg/csg.cpp')
| -rw-r--r-- | modules/csg/csg.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/modules/csg/csg.cpp b/modules/csg/csg.cpp index 57206ae18b..cb82b65307 100644 --- a/modules/csg/csg.cpp +++ b/modules/csg/csg.cpp @@ -530,8 +530,8 @@ void CSGBrushOperation::MeshMerge::_add_distance(List<real_t> &r_intersectionsA, List<real_t> &intersections = p_from_B ? r_intersectionsB : r_intersectionsA; // Check if distance exists. - for (const List<real_t>::Element *E = intersections.front(); E; E = E->next()) { - if (Math::is_equal_approx(**E, p_distance)) { + for (const real_t E : intersections) { + if (Math::is_equal_approx(E, p_distance)) { return; } } |