diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2019-08-01 06:53:25 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2019-08-01 07:02:41 +0300 |
| commit | 760dbd1cbf56e13b0a827afb6f7784fa46fff9b4 (patch) | |
| tree | 09d4f8ddc29c475377c155532c89a8cb6fb0315e /source/blender/bmesh/intern/bmesh_polygon_edgenet.c | |
| parent | 135413e324b8f3f14307dc47aeadf97e6fd446ad (diff) | |
Cleanup: misc spelling fixes
T68035 by @luzpaz
Diffstat (limited to 'source/blender/bmesh/intern/bmesh_polygon_edgenet.c')
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_polygon_edgenet.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/source/blender/bmesh/intern/bmesh_polygon_edgenet.c b/source/blender/bmesh/intern/bmesh_polygon_edgenet.c index e04cf7d5cf8..83ac7df058a 100644 --- a/source/blender/bmesh/intern/bmesh_polygon_edgenet.c +++ b/source/blender/bmesh/intern/bmesh_polygon_edgenet.c @@ -496,7 +496,7 @@ bool BM_face_split_edgenet(BMesh *bm, } /* These arrays used to be stack memory, however they can be - * large for singe faces with complex edgenets, see: T65980. */ + * large for single faces with complex edgenets, see: T65980. */ /* over-alloc (probably 2-4 is only used in most cases), for the biggest-fan */ edge_order = MEM_mallocN(sizeof(*edge_order) * edge_order_len, __func__); @@ -766,7 +766,7 @@ struct EdgeGroupIsland { /* Set the following vars once we have >1 groups */ /* when an edge in a previous group connects to this one, - * so theres no need to create one pointing back. */ + * so there's no need to create one pointing back. */ uint has_prev_edge : 1; /* verts in the group which has the lowest & highest values, @@ -1000,7 +1000,7 @@ static int bm_face_split_edgenet_find_connection(const struct EdgeGroup_FindConn * until a vertex is found which isn't blocked by an edge. * * \note It's possible none of the verts can be accessed (with self-intersecting lines). - * In that case theres no right answer (without subdividing edges), + * In that case there's no right answer (without subdividing edges), * so return a fall-back vertex in that case. */ |