diff options
| author | Campbell Barton <campbell@blender.org> | 2022-10-10 03:21:53 +0300 |
|---|---|---|
| committer | Campbell Barton <campbell@blender.org> | 2022-10-10 03:22:41 +0300 |
| commit | 210f4db81c8d5501b27e75f7e9718fb1c52a5d8a (patch) | |
| tree | 92ca2c8eeb1a7ea82fffa97d5e6b717cd5a577da /intern/mikktspace | |
| parent | e0ad4712f6aadf42fe56c58311c542f0edad3e9a (diff) | |
Cleanup: spelling in comments
Diffstat (limited to 'intern/mikktspace')
| -rw-r--r-- | intern/mikktspace/mikktspace.hh | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/intern/mikktspace/mikktspace.hh b/intern/mikktspace/mikktspace.hh index e2c7084566f..9bfa6881f0d 100644 --- a/intern/mikktspace/mikktspace.hh +++ b/intern/mikktspace/mikktspace.hh @@ -723,12 +723,11 @@ template<typename Mesh> class Mikktspace { void build4RuleGroups() { - /* Note: This could be parallelized by grouping all [t, i] pairs into + /* NOTE: This could be parallelized by grouping all [t, i] pairs into * shards by hash(triangles[t].vertices[i]). This way, each shard can be processed * independently and in parallel. - * However, the groupWithAny logic needs special handling (e.g. lock a mutex when - * encountering a groupWithAny triangle, then sort it out, then unlock and proceed). - */ + * However, the `groupWithAny` logic needs special handling (e.g. lock a mutex when + * encountering a `groupWithAny` triangle, then sort it out, then unlock and proceed). */ for (uint t = 0; t < nrTriangles; t++) { Triangle &triangle = triangles[t]; for (uint i = 0; i < 3; i++) { |