[Bf-blender-cvs] [27907408136] master: Cleanup: spelling

Campbell Barton noreply at git.blender.org
Fri Aug 16 17:10:23 CEST 2019


Commit: 27907408136cd3339beac5ea98318830ff837ab6
Author: Campbell Barton
Date:   Sat Aug 17 00:54:22 2019 +1000
Branches: master
https://developer.blender.org/rB27907408136cd3339beac5ea98318830ff837ab6

Cleanup: spelling

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

M	intern/cycles/bvh/bvh4.cpp
M	intern/cycles/kernel/filter/filter_transform.h
M	intern/cycles/kernel/kernel_shader.h
M	intern/cycles/render/stats.h
M	intern/cycles/util/util_vector.h
M	release/scripts/modules/bl_i18n_utils/utils.py
M	release/scripts/modules/bpy_extras/mesh_utils.py
M	release/scripts/startup/bl_operators/anim.py
M	source/blender/blenkernel/intern/armature_update.c
M	source/blender/blenkernel/intern/customdata.c
M	source/blender/blenkernel/intern/editmesh.c
M	source/blender/blenkernel/intern/library.c
M	source/blender/blenkernel/intern/mask.c
M	source/blender/blenkernel/intern/mball.c
M	source/blender/blenkernel/intern/mesh_evaluate.c
M	source/blender/blenkernel/intern/object_update.c
M	source/blender/blenkernel/intern/ocean.c
M	source/blender/blenkernel/intern/softbody.c
M	source/blender/blenlib/intern/BLI_ghash.c
M	source/blender/blenlib/intern/boxpack_2d.c
M	source/blender/blenlib/intern/math_geom.c
M	source/blender/blenloader/BLO_blend_defs.h
M	source/blender/blenloader/intern/readfile.c
M	source/blender/blenloader/intern/versioning_280.c
M	source/blender/blenloader/intern/writefile.c
M	source/blender/bmesh/intern/bmesh_mesh_conv.c
M	source/blender/bmesh/intern/bmesh_polygon.c
M	source/blender/bmesh/tools/bmesh_decimate_collapse.c
M	source/blender/bmesh/tools/bmesh_decimate_unsubdivide.c
M	source/blender/bmesh/tools/bmesh_region_match.c
M	source/blender/compositor/intern/COM_MemoryBuffer.h
M	source/blender/compositor/nodes/COM_ImageNode.cpp
M	source/blender/compositor/operations/COM_ColorBalanceLGGOperation.cpp
M	source/blender/compositor/operations/COM_MaskOperation.cpp
M	source/blender/depsgraph/intern/depsgraph_tag.cc
M	source/blender/draw/intern/draw_cache.c
M	source/blender/draw/intern/draw_cache_extract_mesh.c
M	source/blender/editors/animation/anim_motion_paths.c
M	source/blender/editors/animation/keyingsets.c
M	source/blender/editors/armature/armature_add.c
M	source/blender/editors/curve/editcurve_paint.c
M	source/blender/editors/gizmo_library/gizmo_types/arrow3d_gizmo.c
M	source/blender/editors/gizmo_library/gizmo_types/cage3d_gizmo.c
M	source/blender/editors/gpencil/gpencil_edit.c
M	source/blender/editors/interface/view2d_ops.c
M	source/blender/editors/mesh/editmesh_knife.c
M	source/blender/editors/screen/screen_edit.c
M	source/blender/editors/screen/screen_ops.c
M	source/blender/editors/sculpt_paint/paint_image_proj.c
M	source/blender/editors/space_view3d/view3d_edit.c
M	source/blender/editors/space_view3d/view3d_utils.c
M	source/blender/editors/transform/transform.c
M	source/blender/editors/transform/transform_input.c
M	source/blender/freestyle/intern/scene_graph/IndexedFaceSet.h
M	source/blender/gpu/intern/gpu_vertex_format.c
M	source/blender/imbuf/IMB_imbuf.h
M	source/blender/imbuf/intern/scaling.c
M	source/blender/makesdna/DNA_meshdata_types.h
M	source/blender/makesdna/intern/dna_genfile.c
M	source/blender/makesrna/intern/rna_object.c
M	source/blender/makesrna/intern/rna_object_force.c
M	source/blender/makesrna/intern/rna_scene.c
M	source/blender/modifiers/intern/MOD_mask.c
M	source/blender/python/bmesh/bmesh_py_types_meshdata.c
M	source/blender/python/intern/bpy_app_translations.c
M	source/blender/python/mathutils/mathutils_Quaternion.c
M	source/blender/python/mathutils/mathutils_Vector.c
M	source/blender/python/mathutils/mathutils_geometry.c
M	source/blender/render/intern/source/pipeline.c
M	source/blender/windowmanager/intern/wm_files.c
M	source/blender/windowmanager/intern/wm_window.c
M	source/creator/creator.c

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

diff --git a/intern/cycles/bvh/bvh4.cpp b/intern/cycles/bvh/bvh4.cpp
index 850bdf5b8b4..b6df9024ffa 100644
--- a/intern/cycles/bvh/bvh4.cpp
+++ b/intern/cycles/bvh/bvh4.cpp
@@ -43,8 +43,7 @@ BVHNode *bvh_node_merge_children_recursively(const BVHNode *node)
   if (node->is_leaf()) {
     return new LeafNode(*reinterpret_cast<const LeafNode *>(node));
   }
-  /* Collect nodes of one layer deeper, allowing us to have more childrem in
-   * an inner layer. */
+  /* Collect nodes of one layer deeper, allowing us to have more children in an inner layer. */
   assert(node->num_children() <= 2);
   const BVHNode *children[4];
   const BVHNode *child0 = node->get_child(0);
diff --git a/intern/cycles/kernel/filter/filter_transform.h b/intern/cycles/kernel/filter/filter_transform.h
index 585c4b33787..880a661214e 100644
--- a/intern/cycles/kernel/filter/filter_transform.h
+++ b/intern/cycles/kernel/filter/filter_transform.h
@@ -70,9 +70,9 @@ ccl_device void kernel_filter_construct_transform(const float *ccl_restrict buff
   filter_calculate_scale(feature_scale, use_time);
 
   /* === Generate the feature transformation. ===
-   * This transformation maps the num_features-dimentional feature space to a reduced feature
-   * (r-feature) space which generally has fewer dimensions. This mainly helps to prevent
-   * overfitting. */
+   * This transformation maps the num_features-dimensional feature space to a reduced feature
+   * (r-feature) space which generally has fewer dimensions.
+   * This mainly helps to prevent over-fitting. */
   float feature_matrix[DENOISE_FEATURES * DENOISE_FEATURES];
   math_matrix_zero(feature_matrix, num_features);
   FOR_PIXEL_WINDOW
@@ -85,7 +85,7 @@ ccl_device void kernel_filter_construct_transform(const float *ccl_restrict buff
 
   math_matrix_jacobi_eigendecomposition(feature_matrix, transform, num_features, 1);
   *rank = 0;
-  /* Prevent overfitting when a small window is used. */
+  /* Prevent over-fitting when a small window is used. */
   int max_rank = min(num_features, num_pixels / 3);
   if (pca_threshold < 0.0f) {
     float threshold_energy = 0.0f;
diff --git a/intern/cycles/kernel/kernel_shader.h b/intern/cycles/kernel/kernel_shader.h
index 4963e012e15..ed1a60a664f 100644
--- a/intern/cycles/kernel/kernel_shader.h
+++ b/intern/cycles/kernel/kernel_shader.h
@@ -686,8 +686,7 @@ ccl_device_inline const ShaderClosure *shader_bsdf_pick(ShaderData *sd, float *r
         if (r < next_sum) {
           sampled = i;
 
-          /* Rescale to reuse for direction sample, to better
-           * preserve stratification. */
+          /* Rescale to reuse for direction sample, to better preserve stratification. */
           *randu = (r - partial_sum) / sc->sample_weight;
           break;
         }
@@ -743,8 +742,7 @@ ccl_device_inline const ShaderClosure *shader_bssrdf_pick(ShaderData *sd,
             *throughput *= (sum_bsdf + sum_bssrdf) / sum_bssrdf;
             sampled = i;
 
-            /* Rescale to reuse for direction sample, to better
-             * preserve stratifaction. */
+            /* Rescale to reuse for direction sample, to better preserve stratification. */
             *randu = (r - partial_sum) / sc->sample_weight;
             break;
           }
diff --git a/intern/cycles/render/stats.h b/intern/cycles/render/stats.h
index f1bf1903483..e45403a3754 100644
--- a/intern/cycles/render/stats.h
+++ b/intern/cycles/render/stats.h
@@ -29,7 +29,7 @@ CCL_NAMESPACE_BEGIN
  * semantic around the units of size, it just should be the same for all
  * entries.
  *
- * This is a generic entry foi all size-related statistics, which helps
+ * This is a generic entry for all size-related statistics, which helps
  * avoiding duplicating code for things like sorting.
  */
 class NamedSizeEntry {
diff --git a/intern/cycles/util/util_vector.h b/intern/cycles/util/util_vector.h
index 437478d64d3..04fb33368d9 100644
--- a/intern/cycles/util/util_vector.h
+++ b/intern/cycles/util/util_vector.h
@@ -27,7 +27,7 @@
 
 CCL_NAMESPACE_BEGIN
 
-/* Own subclass-ed vestion of std::vector. Subclass is needed because:
+/* Own subclass-ed version of std::vector. Subclass is needed because:
  *
  * - Use own allocator which keeps track of used/peak memory.
  * - Have method to ensure capacity is re-set to 0.
diff --git a/release/scripts/modules/bl_i18n_utils/utils.py b/release/scripts/modules/bl_i18n_utils/utils.py
index bbc0c5c8405..2cca4171193 100644
--- a/release/scripts/modules/bl_i18n_utils/utils.py
+++ b/release/scripts/modules/bl_i18n_utils/utils.py
@@ -834,7 +834,7 @@ class I18nMessages:
     def parse_messages_from_po(self, src, key=None):
         """
         Parse a po file.
-        Note: This function will silently "arrange" mis-formated entries, thus using afterward write_messages() should
+        Note: This function will silently "arrange" mis-formatted entries, thus using afterward write_messages() should
               always produce a po-valid file, though not correct!
         """
         reading_msgid = False
diff --git a/release/scripts/modules/bpy_extras/mesh_utils.py b/release/scripts/modules/bpy_extras/mesh_utils.py
index 41727565cfa..1576947b8b4 100644
--- a/release/scripts/modules/bpy_extras/mesh_utils.py
+++ b/release/scripts/modules/bpy_extras/mesh_utils.py
@@ -241,9 +241,9 @@ def edge_loops_from_edges(mesh, edges=None):
 
 def ngon_tessellate(from_data, indices, fix_loops=True, debug_print=True):
     """
-    Takes a polyline of indices (fgon) and returns a list of face
+    Takes a polyline of indices (ngon) and returns a list of face
     index lists. Designed to be used for importers that need indices for an
-    fgon to create from existing verts.
+    ngon to create from existing verts.
 
     :arg from_data: either a mesh, or a list/tuple of vectors.
     :type from_data: list or :class:`bpy.types.Mesh`
diff --git a/release/scripts/startup/bl_operators/anim.py b/release/scripts/startup/bl_operators/anim.py
index 1470aed4d55..d55644f19c7 100644
--- a/release/scripts/startup/bl_operators/anim.py
+++ b/release/scripts/startup/bl_operators/anim.py
@@ -105,7 +105,7 @@ class ANIM_OT_keying_set_export(Operator):
             # - idtype_list is used to get the list of id-datablocks from
             #   bpy.data.* since this info isn't available elsewhere
             # - id.bl_rna.name gives a name suitable for UI,
-            #   with a capitalised first letter, but we need
+            #   with a capitalized first letter, but we need
             #   the plural form that's all lower case
             # - special handling is needed for "nested" ID-blocks
             #   (e.g. nodetree in Material)
diff --git a/source/blender/blenkernel/intern/armature_update.c b/source/blender/blenkernel/intern/armature_update.c
index bf7d81e5d63..cd1cdce91e0 100644
--- a/source/blender/blenkernel/intern/armature_update.c
+++ b/source/blender/blenkernel/intern/armature_update.c
@@ -889,7 +889,7 @@ void BKE_pose_eval_proxy_copy_bone(struct Depsgraph *depsgraph, Object *object,
   bPoseChannel *pchan = pose_pchan_get_indexed(object, pchan_index);
   DEG_debug_print_eval_subdata(
       depsgraph, __func__, object->id.name, object, "pchan", pchan->name, pchan);
-  /* TODO(sergey): Use indexec lookup, once it's guaranteed to be kept
+  /* TODO(sergey): Use indexed lookup, once it's guaranteed to be kept
    * around for the time while proxies are evaluating.
    */
 #if 0
diff --git a/source/blender/blenkernel/intern/customdata.c b/source/blender/blenkernel/intern/customdata.c
index 3c7ac5d8d2e..db0ed0dc0fb 100644
--- a/source/blender/blenkernel/intern/customdata.c
+++ b/source/blender/blenkernel/intern/customdata.c
@@ -294,7 +294,7 @@ static void layerInterp_mdeformvert(const void **sources,
     }
   }
 
-  /* delay writing to the destination incase dest is in sources */
+  /* Delay writing to the destination in case dest is in sources. */
 
   /* now we know how many unique deform weights there are, so realloc */
   if (dvert->dw && (dvert->totweight == totweight)) {
@@ -441,7 +441,7 @@ static void layerInterp_tface(
     }
   }
 
-  /* delay writing to the destination incase dest is in sources */
+  /* Delay writing to the destination in case dest is in sources. */
   *tf = *(MTFace *)(*sources);
   memcpy(tf->uv, uv, sizeof(tf->uv));
 }
@@ -548,7 +548,7 @@ static void layerInterp_origspace_face(
     }
   }
 
-  /* delay writing to the destination in case dest is in sources */
+  /* Delay writing to the destination in case dest is in sources. */
   memcpy(osf->uv, uv, sizeof(osf->uv));
 }
 
@@ -908,7 +908,7 @@ static void layerInterp_mloopcol(
   /* Subdivide smooth or fractal can cause problems without clamping
    * although weights should also not cause this situation */
 
-  /* also delay writing to the destination incase dest is in sources */
+  /* Also delay writing to the destination in case dest is in sources. */
   mc->r = round_fl_to_uchar_clamp(col.r);
   mc->g = round_fl_to_uchar_clamp(col.g);
   mc->b = round_fl_to_uchar_clamp(col.b);
@@ -1008,7 +1008,7 @@ static void layerInterp_mloopuv(
     }
   }
 
-  /* delay writing to the destination incase dest is in sources */
+  /* Delay writing to the destination in case dest is in sources. */
   copy_v2_v2(((MLoopUV *)dest)->uv, uv);
   ((MLoopUV *)dest)->flag = flag;
 }
@@ -1104,7 +1104,7 @@ static void layerInterp_mloop_origspace(
     }
   }
 
-  /* delay writing to the destination incase dest is in sources */
+  /* Delay writing to the destination in case dest is in sources. */
   copy_v2_v2(((OrigSpaceLoop *)dest)->uv, uv);
 }
 /* --- end copy */
@@ -1152,7 +1152,7 @@ static void layerInterp_mcol(
     }
   }
 
-  /* delay writing to the destination incase dest is in sources */
+  /* Delay writing to the destination in case dest is in sources. */
   for (j = 0; j < 4; ++j) {
 
     /* Subdivide smooth or fractal can cause problems without clamping
@@ -1220,7 +1220,7 @@ static void layerInterp_bweight(const void **sources,
     }
   }
 
-  /* delay writing to the destination incase dest is in sources */
+  /* Delay writing to the destination in case dest is in sources. */
   *((float *)dest) = f;
 }
 
@@ -1251,7 +1251,7 @@ static void layerInterp_shapeke

@@ Diff output truncated at 10240 characters. @@



More information about the Bf-blender-cvs mailing list