diff options
| author | Campbell Barton <campbell@blender.org> | 2022-08-12 05:38:54 +0300 |
|---|---|---|
| committer | Campbell Barton <campbell@blender.org> | 2022-08-12 05:38:54 +0300 |
| commit | 996cb4008ddc990acd7f4fff9875ed39268d621a (patch) | |
| tree | e5a614cadcf19016ef825e5d910367906c472a74 /source/blender/blenlib/intern | |
| parent | 266a125b11c664256c3674f3393894e039c806b6 (diff) | |
Cleanup: repeated words in comments
Diffstat (limited to 'source/blender/blenlib/intern')
| -rw-r--r-- | source/blender/blenlib/intern/mesh_boolean.cc | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/source/blender/blenlib/intern/mesh_boolean.cc b/source/blender/blenlib/intern/mesh_boolean.cc index 357dba154af..0d8ad1da582 100644 --- a/source/blender/blenlib/intern/mesh_boolean.cc +++ b/source/blender/blenlib/intern/mesh_boolean.cc @@ -1675,7 +1675,7 @@ static Edge find_good_sorting_edge(const Vert *testp, * The algorithm is similar to the one for find_ambient_cell, except that * instead of an arbitrary point known to be outside the whole mesh, we * have a particular point (v) and we just want to determine the patches - * that that point is between in sorting-around-an-edge order. + * that point is between in sorting-around-an-edge order. */ static int find_containing_cell(const Vert *v, int t, |