[Bf-blender-cvs] [7996b49cb05] blender-v3.0-release: Cleanup: spelling

[Campbell Barton]

Commit: 7996b49cb050eb22fcc4305952d6c972c6c16f24
Author: Campbell Barton
Date:   Wed Nov 3 11:42:07 2021 +1100
Branches: blender-v3.0-release
https://developer.blender.org/rB7996b49cb050eb22fcc4305952d6c972c6c16f24

Cleanup: spelling

===================================================================

M	source/blender/blenkernel/intern/spline_base.cc
M	source/blender/draw/engines/overlay/overlay_engine.c
M	source/blender/nodes/NOD_node_tree_ref.hh

===================================================================

diff --git a/source/blender/blenkernel/intern/spline_base.cc b/source/blender/blenkernel/intern/spline_base.cc
index bbe4e0aab7b..c2c9d178171 100644
--- a/source/blender/blenkernel/intern/spline_base.cc
+++ b/source/blender/blenkernel/intern/spline_base.cc
@@ -486,7 +486,7 @@ Array<float> Spline::sample_uniform_index_factors(const int samples_size) const
     prev_length = length;
   }
 
-  /* Zero lengths or float innacuracies can cause invalid values, or simply
+  /* Zero lengths or float inaccuracies can cause invalid values, or simply
    * skip some, so set the values that weren't completed in the main loop. */
   for (const int i : IndexRange(i_sample, samples_size - i_sample)) {
     samples[i] = float(samples_size);
diff --git a/source/blender/draw/engines/overlay/overlay_engine.c b/source/blender/draw/engines/overlay/overlay_engine.c
index 7f9e37f58d5..2bdceb5f3db 100644
--- a/source/blender/draw/engines/overlay/overlay_engine.c
+++ b/source/blender/draw/engines/overlay/overlay_engine.c
@@ -56,7 +56,7 @@ static void OVERLAY_engine_init(void *vedata)
   OVERLAY_shader_library_ensure();
 
   if (!stl->pd) {
-    /* Alloc transient pointers */
+    /* Allocate transient pointers. */
     stl->pd = MEM_callocN(sizeof(*stl->pd), __func__);
   }
 
@@ -235,7 +235,7 @@ BLI_INLINE OVERLAY_DupliData *OVERLAY_duplidata_get(Object *ob, void *vedata, bo
       *do_init = true;
     }
     else if ((*dupli_data)->base_flag != ob->base_flag) {
-      /* Select state might have change, reinit. */
+      /* Select state might have change, reinitialize. */
       *do_init = true;
     }
     return *dupli_data;
@@ -465,7 +465,7 @@ static void OVERLAY_cache_populate(void *vedata, Object *ob)
         break;
       case OB_LATTICE: {
         /* Unlike the other types above, lattices actually have a bounding box defined, so hide the
-         * lattice wires if only the boundingbox is requested. */
+         * lattice wires if only the bounding-box is requested. */
         if (ob->dt > OB_BOUNDBOX) {
           OVERLAY_lattice_cache_populate(vedata, ob);
         }
@@ -478,7 +478,7 @@ static void OVERLAY_cache_populate(void *vedata, Object *ob)
     OVERLAY_particle_cache_populate(vedata, ob);
   }
 
-  /* Relationship, object center, bounbox ... */
+  /* Relationship, object center, bounding-box... etc. */
   if (!pd->hide_overlays) {
     OVERLAY_extra_cache_populate(vedata, ob);
   }
@@ -581,7 +581,7 @@ static void OVERLAY_draw_scene(void *vedata)
   OVERLAY_extra_blend_draw(vedata);
   OVERLAY_volume_draw(vedata);
 
-  /* These overlays are drawn here to avoid artifacts with wireframe opacity. */
+  /* These overlays are drawn here to avoid artifacts with wire-frame opacity. */
   switch (pd->ctx_mode) {
     case CTX_MODE_SCULPT:
       OVERLAY_sculpt_draw(vedata);
diff --git a/source/blender/nodes/NOD_node_tree_ref.hh b/source/blender/nodes/NOD_node_tree_ref.hh
index e04dd7f41bd..26a5dc9d60f 100644
--- a/source/blender/nodes/NOD_node_tree_ref.hh
+++ b/source/blender/nodes/NOD_node_tree_ref.hh
@@ -290,7 +290,7 @@ class NodeTreeRef : NonCopyable, NonMovable {
   struct ToposortResult {
     Vector<const NodeRef *> sorted_nodes;
     /**
-     * There can't be a correct topologycal sort of the nodes when there is a cycle. The nodes will
+     * There can't be a correct topological sort of the nodes when there is a cycle. The nodes will
      * still be sorted to some degree. The caller has to decide whether it can handle non-perfect
      * sorts or not.
      */