diff options
| author | Rémi Verschelde <remi@verschelde.fr> | 2021-07-24 14:21:06 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-07-24 14:21:06 +0200 |
| commit | 96d7bc62af25b85b8b9cc091eeea1e7a784ba624 (patch) | |
| tree | 83d8a70c911fe7f8d20080a1395d195eb8370d05 /modules/csg/csg.cpp | |
| parent | 9ac27b58c53b50b5c7085a8fdee653e9eff159d1 (diff) | |
| parent | 4e6efd1b07f1c6d53d226977ddc729333b74306a (diff) | |
| download | redot-engine-96d7bc62af25b85b8b9cc091eeea1e7a784ba624.tar.gz | |
Merge pull request #50511 from aaronfranke/iterators
Use C++ range 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; } } |