diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2021-06-28 08:44:12 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2021-06-28 08:46:08 +0300 |
| commit | 1d8648b13a0667d338a4e60df004be7e41525968 (patch) | |
| tree | 763c9e0b843850f6894101c8ad02a6bff34b5497 /source/blender/bmesh/intern | |
| parent | 23c4854f45d7cafa1cfadf13556b9277d4666bd1 (diff) | |
Cleanup: repeated terms in code comments & error messages
Diffstat (limited to 'source/blender/bmesh/intern')
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_mesh_normals.c | 4 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_mods.c | 8 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_query.c | 4 |
3 files changed, 8 insertions, 8 deletions
diff --git a/source/blender/bmesh/intern/bmesh_mesh_normals.c b/source/blender/bmesh/intern/bmesh_mesh_normals.c index db09bbff97c..a8a75656c94 100644 --- a/source/blender/bmesh/intern/bmesh_mesh_normals.c +++ b/source/blender/bmesh/intern/bmesh_mesh_normals.c @@ -65,8 +65,8 @@ BLI_INLINE void bm_vert_calc_normals_accum_loop(const BMLoop *l_iter, float v_no[3]) { /* Calculate the dot product of the two edges that meet at the loop's vertex. */ - /* Edge vectors are calculated from e->v1 to e->v2, so adjust the dot product if one but not - * both loops actually runs from from e->v2 to e->v1. */ + /* Edge vectors are calculated from `e->v1` to `e->v2`, so adjust the dot product if one but not + * both loops actually runs from `e->v2` to `e->v1`. */ float dotprod = dot_v3v3(e1diff, e2diff); if ((l_iter->prev->e->v1 == l_iter->prev->v) ^ (l_iter->e->v1 == l_iter->v)) { dotprod = -dotprod; diff --git a/source/blender/bmesh/intern/bmesh_mods.c b/source/blender/bmesh/intern/bmesh_mods.c index b61ef47351a..f75497f2f19 100644 --- a/source/blender/bmesh/intern/bmesh_mods.c +++ b/source/blender/bmesh/intern/bmesh_mods.c @@ -246,8 +246,8 @@ BMFace *BM_faces_join_pair(BMesh *bm, BMLoop *l_a, BMLoop *l_b, const bool do_de * \param no_double: Use an existing edge if found * * \return Pointer to the newly created face representing one side of the split - * if the split is successful (and the original original face will be the - * other side). NULL if the split fails. + * if the split is successful (and the original face will be the other side). + * NULL if the split fails. */ BMFace *BM_face_split(BMesh *bm, BMFace *f, @@ -328,8 +328,8 @@ BMFace *BM_face_split(BMesh *bm, * \param example: Edge used for attributes of splitting edge, if non-NULL. * * \return Pointer to the newly created face representing one side of the split - * if the split is successful (and the original original face will be the - * other side). NULL if the split fails. + * if the split is successful (and the original face will be the other side). + * NULL if the split fails. */ BMFace *BM_face_split_n(BMesh *bm, BMFace *f, diff --git a/source/blender/bmesh/intern/bmesh_query.c b/source/blender/bmesh/intern/bmesh_query.c index 1449df9925f..8047b52b625 100644 --- a/source/blender/bmesh/intern/bmesh_query.c +++ b/source/blender/bmesh/intern/bmesh_query.c @@ -1824,8 +1824,8 @@ float BM_vert_calc_edge_angle_ex(const BMVert *v, const float fallback) { BMEdge *e1, *e2; - /* saves BM_vert_edge_count(v) and and edge iterator, - * get the edges and count them both at once */ + /* Saves `BM_vert_edge_count(v)` and edge iterator, + * get the edges and count them both at once. */ if ((e1 = v->e) && (e2 = bmesh_disk_edge_next(e1, v)) && (e1 != e2) && /* make sure we come full circle and only have 2 connected edges */ |