Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCampbell Barton <ideasman42@gmail.com>2020-11-20 03:39:03 +0300
committerCampbell Barton <ideasman42@gmail.com>2020-11-20 03:39:22 +0300
commit25266caa454324b3394c09920913fb419b5abf2b (patch)
treed3280dfb512accb74a7e06fc9841d1228e96dd59 /source/blender/blenkernel/intern/mesh_mapping.c
parent5f1bb8da96c47e3feea9853eb479fb565aeaa2fa (diff)
Cleanup: spelling
Diffstat (limited to 'source/blender/blenkernel/intern/mesh_mapping.c')
-rw-r--r--source/blender/blenkernel/intern/mesh_mapping.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/source/blender/blenkernel/intern/mesh_mapping.c b/source/blender/blenkernel/intern/mesh_mapping.c
index 3572939f78c..81642b156d5 100644
--- a/source/blender/blenkernel/intern/mesh_mapping.c
+++ b/source/blender/blenkernel/intern/mesh_mapping.c
@@ -777,7 +777,7 @@ static void poly_edge_loop_islands_calc(const MEdge *medge,
if (UNLIKELY(gid_bit > 31)) {
/* All bits used in contiguous smooth groups, we can't do much!
* Note: this is *very* unlikely - theoretically, four groups are enough,
- * I don't think we can reach this goal with such a simple algo,
+ * I don't think we can reach this goal with such a simple algorithm,
* but I don't think either we'll never need all 32 groups!
*/
printf(