diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2021-03-18 01:35:12 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2021-03-18 01:36:44 +0300 |
| commit | bb6765f28fdde392976c38712c851d0ef8c75a2c (patch) | |
| tree | 500342ef54f60bb73b429e74355139665bff500f /source/blender/editors/mesh/editmesh_tools.c | |
| parent | 0c58ad8a34c55344262ac74fce87888beb464155 (diff) | |
Cleanup: spelling
Diffstat (limited to 'source/blender/editors/mesh/editmesh_tools.c')
| -rw-r--r-- | source/blender/editors/mesh/editmesh_tools.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/source/blender/editors/mesh/editmesh_tools.c b/source/blender/editors/mesh/editmesh_tools.c index 8bb557509e0..ade21f58232 100644 --- a/source/blender/editors/mesh/editmesh_tools.c +++ b/source/blender/editors/mesh/editmesh_tools.c @@ -853,7 +853,7 @@ static BMElem *edbm_add_edge_face_exec__tricky_extend_sel(BMesh *bm) } static void edbm_add_edge_face_exec__tricky_finalize_sel(BMesh *bm, BMElem *ele_desel, BMFace *f) { - /* now we need to find the edge that isnt connected to this element */ + /* Now we need to find the edge that isn't connected to this element. */ BM_select_history_clear(bm); /* Notes on hidden geometry: @@ -896,7 +896,7 @@ static void edbm_add_edge_face_exec__tricky_finalize_sel(BMesh *bm, BMElem *ele_ static int edbm_add_edge_face_exec(bContext *C, wmOperator *op) { - /* when this is used to dissolve we could avoid this, but checking isnt too slow */ + /* When this is used to dissolve we could avoid this, but checking isn't too slow. */ bool changed_multi = false; ViewLayer *view_layer = CTX_data_view_layer(C); uint objects_len = 0; @@ -4815,11 +4815,11 @@ static bool edbm_fill_grid_prepare(BMesh *bm, int offset, int *span_p, const boo if (span_calc) { /* calculate the span by finding the next corner in 'verts' - * we dont know what defines a corner exactly so find the 4 verts + * we don't know what defines a corner exactly so find the 4 verts * in the loop with the greatest angle. * Tag them and use the first tagged vertex to calculate the span. * - * note: we may have already checked 'edbm_fill_grid_vert_tag_angle()' on each + * NOTE: we may have already checked 'edbm_fill_grid_vert_tag_angle()' on each * vert, but advantage of de-duplicating is minimal. */ struct SortPtrByFloat *ele_sort = MEM_mallocN(sizeof(*ele_sort) * verts_len, __func__); LinkData *v_link; |