diff options
| author | Campbell Barton <campbell@blender.org> | 2022-05-05 03:55:51 +0300 |
|---|---|---|
| committer | Campbell Barton <campbell@blender.org> | 2022-05-05 03:55:51 +0300 |
| commit | e33c15951b8870423990f531f752e24e1294ace6 (patch) | |
| tree | bd6d33f1899ba30afd3d38772517c2860a7fb4ae /source/blender/gpencil_modifiers | |
| parent | d0c2fd05701056d545cce0e6b44260c4fe071bcb (diff) | |
Cleanup: spelling in comments
Diffstat (limited to 'source/blender/gpencil_modifiers')
| -rw-r--r-- | source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c b/source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c index f67499c833c..dbe2ae0b890 100644 --- a/source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c +++ b/source/blender/gpencil_modifiers/intern/lineart/lineart_cpu.c @@ -1523,7 +1523,7 @@ static void lineart_identify_mlooptri_feature_edges(void *__restrict userdata, uint16_t edge_flag_result = 0; - /* Because the Edge Neighbour array contains loop edge pairs, we only need to process the first + /* Because the edge neighbor array contains loop edge pairs, we only need to process the first * edge in the pair. Otherwise we would add the same edge that the loops represent twice. */ if (i < edge_nabr[i].e) { return; @@ -1544,7 +1544,7 @@ static void lineart_identify_mlooptri_feature_edges(void *__restrict userdata, else { /* Handle mesh boundary cases: We want mesh boundaries to respect * `filter_face_mark_boundaries` option the same way as face mark boundaries, and the code - * path is simper when it's assuming both ff1 and ff2 not NULL. */ + * path is simper when it's assuming both ff1 and ff2 not NULL. */ ff2 = ff1; } if (e_feat_data->rb->filter_face_mark_boundaries ^ e_feat_data->rb->filter_face_mark_invert) { @@ -1933,7 +1933,7 @@ static void lineart_edge_neighbor_init_task(void *__restrict userdata, static LineartEdgeNeighbor *lineart_build_edge_neighbor(Mesh *me, int total_edges) { - /* Because the mesh is traingulated, so me->totedge should be reliable? */ + /* Because the mesh is triangulated, so `me->totedge` should be reliable? */ LineartAdjacentEdge *adj_e = MEM_mallocN(sizeof(LineartAdjacentEdge) * total_edges, "LineartAdjacentEdge arr"); LineartEdgeNeighbor *edge_nabr = MEM_mallocN(sizeof(LineartEdgeNeighbor) * total_edges, |