Cleanup: spelling

5 files changed, 12 insertions, 10 deletions

diff --git a/source/blender/editors/mesh/editmesh_select.c b/source/blender/editors/mesh/editmesh_select.c
index c04fe58c12e..155c91ec037 100644
--- a/source/blender/editors/mesh/editmesh_select.c
+++ b/source/blender/editors/mesh/editmesh_select.c
@@ -454,8 +454,8 @@ static void findnearestvert__doClosest(void *userData, BMVert *eve, const float
  *
  * \param r_dist: (in/out), minimal distance to the nearest and at the end, actual distance
  * \param use_select_bias:
- * - When true, selected vertice are given a 5 pixel bias to make them further than unselect verts.
- * - When false, unselected vertice are given the bias.
+ * - When true, selected vertices are given a 5 pixel bias to make them further than unselect verts.
+ * - When false, unselected vertices are given the bias.
  * \param use_cycle: Cycle over elements within #FIND_NEAR_CYCLE_THRESHOLD_MIN in order of index.
  */
 BMVert *EDBM_vert_find_nearest_ex(
@@ -1757,7 +1757,7 @@ static bool mouse_mesh_loop(bContext *C, const int mval[2], bool extend, bool de
 	if (select) {
 		if (em->selectmode & SCE_SELECT_VERTEX) {
 			/* Find nearest vert from mouse
-			 * (initialize to large values incase only one vertex can be projected) */
+			 * (initialize to large values in case only one vertex can be projected) */
 			float v1_co[2], v2_co[2];
 			float length_1 = FLT_MAX;
 			float length_2 = FLT_MAX;
diff --git a/source/blender/editors/mesh/editmesh_select_similar.c b/source/blender/editors/mesh/editmesh_select_similar.c
index c9365e8d0fd..67e455375df 100644
--- a/source/blender/editors/mesh/editmesh_select_similar.c
+++ b/source/blender/editors/mesh/editmesh_select_similar.c
@@ -1150,7 +1150,7 @@ static int similar_vert_select_exec(bContext *C, wmOperator *op)
 				continue;
 			}
 
-			/* We map back the names of the vertex groups to their corresponsing indices
+			/* We map back the names of the vertex groups to their corresponding indices
 			 * for this object. This is fast, and keep the logic for each vertex very simple. */
 			GSetIterator gs_iter;
 			GSET_ITER(gs_iter, gset) {
diff --git a/source/blender/editors/mesh/editmesh_tools.c b/source/blender/editors/mesh/editmesh_tools.c
index 5d653ffe00b..9fb200951ca 100644
--- a/source/blender/editors/mesh/editmesh_tools.c
+++ b/source/blender/editors/mesh/editmesh_tools.c
@@ -4943,7 +4943,7 @@ static int edbm_decimate_exec(bContext *C, wmOperator *op)
 		}
 		else {
 			/**
-			 * Calculate a new ratio based on faces that could be remoevd during decimation.
+			 * Calculate a new ratio based on faces that could be removed during decimation.
 			 * needed so 0..1 has a meaningful range when operating on the selection.
 			 *
 			 * This doesn't have to be totally accurate,
diff --git a/source/blender/editors/mesh/editmesh_utils.c b/source/blender/editors/mesh/editmesh_utils.c
index 3a4f9d461ec..f86a2388f87 100644
--- a/source/blender/editors/mesh/editmesh_utils.c
+++ b/source/blender/editors/mesh/editmesh_utils.c
@@ -919,8 +919,10 @@ UvElement *BM_uv_element_get(UvElementMap *map, BMFace *efa, BMLoop *l)
 /** \name Data Layer Checks
  * \{ */
 
-/* last_sel, use em->act_face otherwise get the last selected face in the editselections
- * at the moment, last_sel is mainly useful for making sure the space image dosnt flicker */
+/**
+ * last_sel, use em->act_face otherwise get the last selected face in the editselections
+ * at the moment, last_sel is mainly useful for making sure the space image doesn't flicker.
+ */
 BMFace *EDBM_uv_active_face_get(BMEditMesh *em, const bool sloppy, const bool selected)
 {
 	BMFace *efa = NULL;
diff --git a/source/blender/editors/mesh/mesh_mirror.c b/source/blender/editors/mesh/mesh_mirror.c
index a1859bf70b0..8bfe51d09fa 100644
--- a/source/blender/editors/mesh/mesh_mirror.c
+++ b/source/blender/editors/mesh/mesh_mirror.c
@@ -267,15 +267,15 @@ void ED_mesh_mirrtopo_init(
 		}
 
 		if ((tot_unique <= tot_unique_prev) && (tot_unique_edges <= tot_unique_edges_prev)) {
-			/* Finish searching for unique values when 1 loop dosnt give a
-			 * higher number of unique values compared to the previous loop */
+			/* Finish searching for unique values when 1 loop dosn't give a
+			 * higher number of unique values compared to the previous loop. */
 			break;
 		}
 		else {
 			tot_unique_prev = tot_unique;
 			tot_unique_edges_prev = tot_unique_edges;
 		}
-		/* Copy the hash calculated this iter, so we can use them next time */
+		/* Copy the hash calculated this iteration, so we can use them next time */
 		memcpy(topo_hash_prev, topo_hash, sizeof(MirrTopoHash_t) * totvert);
 
 		topo_pass++;