diff options
author | Campbell Barton <campbell@blender.org> | 2022-09-26 07:23:52 +0300 |
---|---|---|
committer | Campbell Barton <campbell@blender.org> | 2022-09-26 07:23:52 +0300 |
commit | 34477bbfcde34d0b27f04eccdddd0a093d8be1c0 (patch) | |
tree | de6f4349f103671e0f1f9b459c0064cd0ce7a344 /source/blender/bmesh | |
parent | 6275541df7e02c40e8c8650bba3104b5df8d34ef (diff) |
Cleanup: remove redundant parenthesis
Diffstat (limited to 'source/blender/bmesh')
-rw-r--r-- | source/blender/bmesh/intern/bmesh_polygon_edgenet.c | 2 | ||||
-rw-r--r-- | source/blender/bmesh/tools/bmesh_bevel.c | 2 | ||||
-rw-r--r-- | source/blender/bmesh/tools/bmesh_decimate_dissolve.c | 2 | ||||
-rw-r--r-- | source/blender/bmesh/tools/bmesh_intersect.c | 2 | ||||
-rw-r--r-- | source/blender/bmesh/tools/bmesh_path_region.c | 2 |
5 files changed, 5 insertions, 5 deletions
diff --git a/source/blender/bmesh/intern/bmesh_polygon_edgenet.c b/source/blender/bmesh/intern/bmesh_polygon_edgenet.c index 29bd066f33c..81793ee9995 100644 --- a/source/blender/bmesh/intern/bmesh_polygon_edgenet.c +++ b/source/blender/bmesh/intern/bmesh_polygon_edgenet.c @@ -1273,7 +1273,7 @@ bool BM_face_split_edgenet_connect_islands(BMesh *bm, BMVert *v_other; /* NOTE: remapping will _never_ map a vertex to an already mapped vertex. */ - while (UNLIKELY((v_other = bm_face_split_edgenet_partial_connect(bm, v_delimit, f)))) { + while (UNLIKELY(v_other = bm_face_split_edgenet_partial_connect(bm, v_delimit, f))) { struct TempVertPair *tvp = BLI_memarena_alloc(mem_arena, sizeof(*tvp)); tvp->next = temp_vert_pairs.list; tvp->v_orig = v_delimit; diff --git a/source/blender/bmesh/tools/bmesh_bevel.c b/source/blender/bmesh/tools/bmesh_bevel.c index b08051341be..a141a9a1dda 100644 --- a/source/blender/bmesh/tools/bmesh_bevel.c +++ b/source/blender/bmesh/tools/bmesh_bevel.c @@ -6285,7 +6285,7 @@ static void find_bevel_edge_order(BMesh *bm, BevVert *bv, BMEdge *first_bme) BMLoop *l; BM_ITER_ELEM (l, &iter, bme, BM_LOOPS_OF_EDGE) { BMFace *f = l->f; - if ((l->prev->e == bme2 || l->next->e == bme2)) { + if (l->prev->e == bme2 || l->next->e == bme2) { if (!bestf || l->v == bv->v) { bestf = f; } diff --git a/source/blender/bmesh/tools/bmesh_decimate_dissolve.c b/source/blender/bmesh/tools/bmesh_decimate_dissolve.c index e209918d6e3..8a11815bd4c 100644 --- a/source/blender/bmesh/tools/bmesh_decimate_dissolve.c +++ b/source/blender/bmesh/tools/bmesh_decimate_dissolve.c @@ -451,7 +451,7 @@ void BM_mesh_decimate_dissolve_ex(BMesh *bm, } while ((BLI_heap_is_empty(vheap) == false) && - (BLI_heap_node_value((vnode_top = BLI_heap_top(vheap))) < angle_limit)) { + (BLI_heap_node_value(vnode_top = BLI_heap_top(vheap)) < angle_limit)) { BMEdge *e_new = NULL; BMVert *v; diff --git a/source/blender/bmesh/tools/bmesh_intersect.c b/source/blender/bmesh/tools/bmesh_intersect.c index 8e1dfbebe47..dd2915e6616 100644 --- a/source/blender/bmesh/tools/bmesh_intersect.c +++ b/source/blender/bmesh/tools/bmesh_intersect.c @@ -1490,7 +1490,7 @@ bool BM_mesh_intersect(BMesh *bm, (void)use_separate; #endif /* USE_SEPARATE */ - if ((boolean_mode != BMESH_ISECT_BOOLEAN_NONE)) { + if (boolean_mode != BMESH_ISECT_BOOLEAN_NONE) { BVHTree *tree_pair[2] = {tree_a, tree_b}; /* group vars */ diff --git a/source/blender/bmesh/tools/bmesh_path_region.c b/source/blender/bmesh/tools/bmesh_path_region.c index 1e464108b84..a90bf87ebb0 100644 --- a/source/blender/bmesh/tools/bmesh_path_region.c +++ b/source/blender/bmesh/tools/bmesh_path_region.c @@ -228,7 +228,7 @@ static LinkNode *mesh_calc_path_region_elem(BMesh *bm, /* Walk along the chain, fill in values until we reach a vertex with 3+ edges. */ { BMEdge *e_chain = e; - while (BM_vert_is_edge_pair_manifold(v_b) && ((depths[side][v_b_index] == -1))) { + while (BM_vert_is_edge_pair_manifold(v_b) && (depths[side][v_b_index] == -1)) { depths[side][v_b_index] = pass; BMEdge *e_chain_next = BM_DISK_EDGE_NEXT(e_chain, v_b); |