diff options
author | Sybren A. Stüvel <sybren@blender.org> | 2020-08-07 12:23:02 +0300 |
---|---|---|
committer | Sybren A. Stüvel <sybren@blender.org> | 2020-08-07 12:23:02 +0300 |
commit | a29686eeb3af051a00fbb8a8b9be06bcd050ec8c (patch) | |
tree | 9da60e7257e3e2dafda3e9b565b77c9c6f37675b /source/blender/blenlib/intern/convexhull_2d.c | |
parent | e0c51b466f3b23a1fc114690be2b008e19637ea6 (diff) |
Cleanup: Blenlib, Clang-Tidy else-after-return fixes (incomplete)
This addresses warnings from Clang-Tidy's `readability-else-after-return`
rule in the `source/blender/blenlib` module. Not all warnings are
addressed in this commit.
No functional changes.
Diffstat (limited to 'source/blender/blenlib/intern/convexhull_2d.c')
-rw-r--r-- | source/blender/blenlib/intern/convexhull_2d.c | 17 |
1 files changed, 5 insertions, 12 deletions
diff --git a/source/blender/blenlib/intern/convexhull_2d.c b/source/blender/blenlib/intern/convexhull_2d.c index b37dc73db29..6e4a8623077 100644 --- a/source/blender/blenlib/intern/convexhull_2d.c +++ b/source/blender/blenlib/intern/convexhull_2d.c @@ -115,9 +115,7 @@ int BLI_convexhull_2d_sorted(const float (*points)[2], const int n, int r_points if (is_left(points[r_points[top - 1]], points[r_points[top]], points[i]) > 0.0f) { break; /* points[i] is a new hull vertex */ } - else { - top--; /* pop top point off stack */ - } + top--; /* pop top point off stack */ } r_points[++top] = i; /* push points[i] onto stack */ @@ -141,9 +139,7 @@ int BLI_convexhull_2d_sorted(const float (*points)[2], const int n, int r_points if (is_left(points[r_points[top - 1]], points[r_points[top]], points[i]) > 0.0f) { break; /* points[i] is a new hull vertex */ } - else { - top--; /* pop top point off stack */ - } + top--; /* pop top point off stack */ } if (points[i][0] == points[r_points[0]][0] && points[i][1] == points[r_points[0]][1]) { @@ -172,20 +168,17 @@ static int pointref_cmp_yx(const void *a_, const void *b_) if (a->pt[1] > b->pt[1]) { return 1; } - else if (a->pt[1] < b->pt[1]) { + if (a->pt[1] < b->pt[1]) { return -1; } if (a->pt[0] > b->pt[0]) { return 1; } - else if (a->pt[0] < b->pt[0]) { + if (a->pt[0] < b->pt[0]) { return -1; } - - else { - return 0; - } + return 0; } /** |