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:
authorHarley Acheson <harley.acheson@gmail.com>2020-10-19 18:12:33 +0300
committerHarley Acheson <harley.acheson@gmail.com>2020-10-19 18:12:33 +0300
commit3a7fd309fce89213b0224b3c6807adb2d1fe7ca8 (patch)
tree20e6064201939368650509d758c7187df74416a6 /source/blender/bmesh
parentd2bf71b412233160a52775f29799a2c1331c92f4 (diff)
Spelling: It's Versus Its
Corrects incorrect usage of contraction for 'it is', when possessive 'its' was required. Differential Revision: https://developer.blender.org/D9250 Reviewed by Campbell Barton
Diffstat (limited to 'source/blender/bmesh')
-rw-r--r--source/blender/bmesh/bmesh.h2
-rw-r--r--source/blender/bmesh/intern/bmesh_construct.c2
-rw-r--r--source/blender/bmesh/intern/bmesh_log.c2
-rw-r--r--source/blender/bmesh/intern/bmesh_operators.c2
-rw-r--r--source/blender/bmesh/intern/bmesh_polygon.c4
-rw-r--r--source/blender/bmesh/intern/bmesh_polygon_edgenet.c2
-rw-r--r--source/blender/bmesh/intern/bmesh_walkers.c2
-rw-r--r--source/blender/bmesh/operators/bmo_edgenet.c2
-rw-r--r--source/blender/bmesh/operators/bmo_rotate_edges.c2
-rw-r--r--source/blender/bmesh/tools/bmesh_decimate_collapse.c2
10 files changed, 11 insertions, 11 deletions
diff --git a/source/blender/bmesh/bmesh.h b/source/blender/bmesh/bmesh.h
index 22f7d50c144..5d2f739651b 100644
--- a/source/blender/bmesh/bmesh.h
+++ b/source/blender/bmesh/bmesh.h
@@ -120,7 +120,7 @@
* which are private to an operator.
* These flags may be used by the client operator code as needed
* (a common example is flagging elements for use in another operator).
- * Each call to an operator allocates it's own set of tool flags when it's executed,
+ * Each call to an operator allocates its own set of tool flags when it's executed,
* avoiding flag conflicts between operators.
*
* These flags should not be confused with header flags, which are used to store persistent flags
diff --git a/source/blender/bmesh/intern/bmesh_construct.c b/source/blender/bmesh/intern/bmesh_construct.c
index 4c70be65bef..2e69c48708c 100644
--- a/source/blender/bmesh/intern/bmesh_construct.c
+++ b/source/blender/bmesh/intern/bmesh_construct.c
@@ -99,7 +99,7 @@ static void bm_loop_attrs_copy(
* If \a no_double is true, then a check is done to see if a face
* with these vertices already exists and returns it instead.
*
- * If a pointer to an example face is provided, it's custom data
+ * If a pointer to an example face is provided, its custom data
* and properties will be copied to the new face.
*
* \note The winding of the face is determined by the order
diff --git a/source/blender/bmesh/intern/bmesh_log.c b/source/blender/bmesh/intern/bmesh_log.c
index 69d73f3d647..40eed6238ca 100644
--- a/source/blender/bmesh/intern/bmesh_log.c
+++ b/source/blender/bmesh/intern/bmesh_log.c
@@ -815,7 +815,7 @@ void BM_log_redo(BMesh *bm, BMLog *log)
/* Log a vertex before it is modified
*
* Before modifying vertex coordinates, masks, or hflags, call this
- * function to log it's current values. This is better than logging
+ * function to log its current values. This is better than logging
* after the coordinates have been modified, because only those
* vertices that are modified need to have their original values
* stored.
diff --git a/source/blender/bmesh/intern/bmesh_operators.c b/source/blender/bmesh/intern/bmesh_operators.c
index 746e9668671..c5e030c436a 100644
--- a/source/blender/bmesh/intern/bmesh_operators.c
+++ b/source/blender/bmesh/intern/bmesh_operators.c
@@ -368,7 +368,7 @@ void _bmo_slot_copy(BMOpSlot slot_args_src[BMO_OP_MAX_SLOTS],
/*
* BMESH OPSTACK SET XXX
*
- * Sets the value of a slot depending on it's type
+ * Sets the value of a slot depending on its type
*/
void BMO_slot_float_set(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name, const float f)
diff --git a/source/blender/bmesh/intern/bmesh_polygon.c b/source/blender/bmesh/intern/bmesh_polygon.c
index 06bab8c8cc1..4ae2cc67140 100644
--- a/source/blender/bmesh/intern/bmesh_polygon.c
+++ b/source/blender/bmesh/intern/bmesh_polygon.c
@@ -667,7 +667,7 @@ void BM_face_calc_center_median_weighted(const BMFace *f, float r_cent[3])
/**
* \brief POLY ROTATE PLANE
*
- * Rotates a polygon so that it's
+ * Rotates a polygon so that its
* normal is pointing towards the mesh Z axis
*/
void poly_rotate_plane(const float normal[3], float (*verts)[3], const uint nverts)
@@ -889,7 +889,7 @@ float BM_face_calc_normal_vcos(const BMesh *bm,
* Calculate a normal from a vertex cloud.
*
* \note We could make a higher quality version that takes all vertices into account.
- * Currently it finds 4 outer most points returning it's normal.
+ * Currently it finds 4 outer most points returning its normal.
*/
void BM_verts_calc_normal_from_cloud_ex(
BMVert **varr, int varr_len, float r_normal[3], float r_center[3], int *r_index_tangent)
diff --git a/source/blender/bmesh/intern/bmesh_polygon_edgenet.c b/source/blender/bmesh/intern/bmesh_polygon_edgenet.c
index b92e431c86c..54dc25ebeba 100644
--- a/source/blender/bmesh/intern/bmesh_polygon_edgenet.c
+++ b/source/blender/bmesh/intern/bmesh_polygon_edgenet.c
@@ -521,7 +521,7 @@ bool BM_face_split_edgenet(BMesh *bm,
/* Note: 'VERT_IN_QUEUE' is often not needed at all,
* however in rare cases verts are added multiple times to the queue,
- * that on it's own is harmless but in _very_ rare cases,
+ * that on its own is harmless but in _very_ rare cases,
* the queue will overflow its maximum size,
* so we better be strict about this! see: T51539 */
diff --git a/source/blender/bmesh/intern/bmesh_walkers.c b/source/blender/bmesh/intern/bmesh_walkers.c
index 860c83ec1e5..da1d3df2046 100644
--- a/source/blender/bmesh/intern/bmesh_walkers.c
+++ b/source/blender/bmesh/intern/bmesh_walkers.c
@@ -39,7 +39,7 @@
* to implement recursive or looping behavior. generally only one
* state push per call with a specific state is desired.
*
- * basic design pattern: the walker step function goes through it's
+ * basic design pattern: the walker step function goes through its
* list of possible choices for recursion, and recurses (by pushing a new state)
* using the first non-visited one. This choice is the flagged as visited using
* the ghash. each step may push multiple new states onto the worklist at once.
diff --git a/source/blender/bmesh/operators/bmo_edgenet.c b/source/blender/bmesh/operators/bmo_edgenet.c
index 0f6ef1cb019..53a2a3b2bba 100644
--- a/source/blender/bmesh/operators/bmo_edgenet.c
+++ b/source/blender/bmesh/operators/bmo_edgenet.c
@@ -117,7 +117,7 @@ void bmo_edgenet_prepare_exec(BMesh *bm, BMOperator *op)
BMO_slot_buffer_flag_enable(bm, op->slots_in, "edges", BM_EDGE, EDGE_MARK);
/* validate that each edge has at most one other tagged edge in the
- * disk cycle around each of it's vertices */
+ * disk cycle around each of its vertices */
BMO_ITER (e, &siter, op->slots_in, "edges", BM_EDGE) {
for (i = 0; i < 2; i++) {
count = BMO_iter_elem_count_flag(bm, BM_EDGES_OF_VERT, (i ? e->v2 : e->v1), EDGE_MARK, true);
diff --git a/source/blender/bmesh/operators/bmo_rotate_edges.c b/source/blender/bmesh/operators/bmo_rotate_edges.c
index 0c7c13610e6..b684aa390cf 100644
--- a/source/blender/bmesh/operators/bmo_rotate_edges.c
+++ b/source/blender/bmesh/operators/bmo_rotate_edges.c
@@ -33,7 +33,7 @@
#define FACE_MARK 1
/**
- * Rotate edges where every edge has it's own faces (we can rotate in any order).
+ * Rotate edges where every edge has its own faces (we can rotate in any order).
*/
static void bm_rotate_edges_simple(BMesh *bm,
BMOperator *op,
diff --git a/source/blender/bmesh/tools/bmesh_decimate_collapse.c b/source/blender/bmesh/tools/bmesh_decimate_collapse.c
index 7900aba0086..3ef5b42b2cd 100644
--- a/source/blender/bmesh/tools/bmesh_decimate_collapse.c
+++ b/source/blender/bmesh/tools/bmesh_decimate_collapse.c
@@ -137,7 +137,7 @@ static void bm_decim_build_quadrics(BMesh *bm, Quadric *vquadrics)
static void bm_decim_calc_target_co_db(BMEdge *e, double optimize_co[3], const Quadric *vquadrics)
{
/* compute an edge contraction target for edge 'e'
- * this is computed by summing it's vertices quadrics and
+ * this is computed by summing its vertices quadrics and
* optimizing the result. */
Quadric q;