diff options
Diffstat (limited to 'source/blender/bmesh/intern')
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_core.c | 2 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_marking.c | 4 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_mesh.c | 2 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_mods.c | 2 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_opdefines.c | 6 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_operator_api_inline.c | 2 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_structure.c | 4 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_structure.h | 2 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_walkers.c | 6 | ||||
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_walkers_impl.c | 2 |
10 files changed, 16 insertions, 16 deletions
diff --git a/source/blender/bmesh/intern/bmesh_core.c b/source/blender/bmesh/intern/bmesh_core.c index 2e5b95dc4db..c423226ba0b 100644 --- a/source/blender/bmesh/intern/bmesh_core.c +++ b/source/blender/bmesh/intern/bmesh_core.c @@ -1791,7 +1791,7 @@ static int bm_vert_cut(BMesh *bm, BMVert *v, BMVert ***vout, int *len) continue; } - /* Loops here should alway refer to an edge that has v as an + /* Loops here should always refer to an edge that has v as an * endpoint. For each appearance of this vert in a face, there * will actually be two iterations: one for the loop heading * towards vertex v, and another for the loop heading out from diff --git a/source/blender/bmesh/intern/bmesh_marking.c b/source/blender/bmesh/intern/bmesh_marking.c index 7d64d00e26e..ab1b57a5999 100644 --- a/source/blender/bmesh/intern/bmesh_marking.c +++ b/source/blender/bmesh/intern/bmesh_marking.c @@ -619,7 +619,7 @@ void BM_editselection_plane(BMesh *bm, float r_plane[3], BMEditSelection *ese) * however selecting different edges can swap the direction of the y axis. * this makes it less likely for the y axis of the manipulator * (running along the edge).. to flip less often. - * at least its more pradictable */ + * at least its more predictable */ if (eed->v2->co[1] > eed->v1->co[1]) { /* check which to do first */ sub_v3_v3v3(r_plane, eed->v2->co, eed->v1->co); } @@ -854,7 +854,7 @@ void BM_edge_hide_set(BMesh *bm, BMEdge *e, int hide) BM_elem_flag_set(e, BM_ELEM_HIDDEN, hide); - /* hide vertices if necassary */ + /* hide vertices if necessary */ vert_flush_hide_set(bm, e->v1); vert_flush_hide_set(bm, e->v2); } diff --git a/source/blender/bmesh/intern/bmesh_mesh.c b/source/blender/bmesh/intern/bmesh_mesh.c index c791b392a82..98436640b11 100644 --- a/source/blender/bmesh/intern/bmesh_mesh.c +++ b/source/blender/bmesh/intern/bmesh_mesh.c @@ -145,7 +145,7 @@ void BM_mesh_data_free(BMesh *bm) BLI_mempool_destroy(bm->looplistpool); #endif - /* These tables aren't used yet, so it's not stricly necessary + /* These tables aren't used yet, so it's not strictly necessary * to 'end' them (with 'e' param) but if someone tries to start * using them, having these in place will save a lot of pain */ mesh_octree_table(NULL, NULL, NULL, 'e'); diff --git a/source/blender/bmesh/intern/bmesh_mods.c b/source/blender/bmesh/intern/bmesh_mods.c index 59c12e2d9f2..ae53d5f83e4 100644 --- a/source/blender/bmesh/intern/bmesh_mods.c +++ b/source/blender/bmesh/intern/bmesh_mods.c @@ -206,7 +206,7 @@ int BM_disk_dissolve(BMesh *bm, BMVert *v) /** * \brief Faces Join Pair * - * Joins two adjacenct faces togather. + * Joins two adjacent faces togather. * * Because this method calls to #BM_faces_join to do its work, if a pair * of faces share multiple edges, the pair of faces will be joined at diff --git a/source/blender/bmesh/intern/bmesh_opdefines.c b/source/blender/bmesh/intern/bmesh_opdefines.c index f6b066ca763..11236e5a082 100644 --- a/source/blender/bmesh/intern/bmesh_opdefines.c +++ b/source/blender/bmesh/intern/bmesh_opdefines.c @@ -353,7 +353,7 @@ static BMOpDefine bmo_weldverts_def = { /* * Make Vertex * - * Creates a single vertex; this bmop was necassary + * Creates a single vertex; this bmop was necessary * for click-create-vertex. */ static BMOpDefine bmo_makevert_def = { @@ -454,7 +454,7 @@ static BMOpDefine bmo_edgenet_prepare_def = { * Rotate * * Rotate vertices around a center, using a 3x3 rotation - * matrix. Equivilent of the old rotateflag function. + * matrix. Equivalent of the old rotateflag function. */ static BMOpDefine bmo_rotate_def = { "rotate", @@ -469,7 +469,7 @@ static BMOpDefine bmo_rotate_def = { /* * Translate * - * Translate vertices by an offset. Equivelent of the + * Translate vertices by an offset. Equivalent of the * old translateflag function. */ static BMOpDefine bmo_translate_def = { diff --git a/source/blender/bmesh/intern/bmesh_operator_api_inline.c b/source/blender/bmesh/intern/bmesh_operator_api_inline.c index 88789fc24b0..29d85790010 100644 --- a/source/blender/bmesh/intern/bmesh_operator_api_inline.c +++ b/source/blender/bmesh/intern/bmesh_operator_api_inline.c @@ -80,7 +80,7 @@ BM_INLINE void BMO_slot_map_float_insert(BMesh *bm, BMOperator *op, const char * } -/* pointer versoins of BMO_slot_map_float_get and BMO_slot_map_float_insert. +/* pointer versions of BMO_slot_map_float_get and BMO_slot_map_float_insert. * * do NOT use these for non-operator-api-allocated memory! instead * use BMO_slot_map_data_get and BMO_slot_map_insert, which copies the data. */ diff --git a/source/blender/bmesh/intern/bmesh_structure.c b/source/blender/bmesh/intern/bmesh_structure.c index 191b9c29f01..97b10fab49f 100644 --- a/source/blender/bmesh/intern/bmesh_structure.c +++ b/source/blender/bmesh/intern/bmesh_structure.c @@ -107,7 +107,7 @@ int bmesh_edge_swapverts(BMEdge *e, BMVert *orig, BMVert *newv) * some nice utilities for navigating disk cycles in a way that hides this detail from the * tool writer. * - * Note that the disk cycle is completley independent from face data. One advantage of this + * Note that the disk cycle is completely independent from face data. One advantage of this * is that wire edges are fully integrated into the topology database. Another is that the * the disk cycle has no problems dealing with non-manifold conditions involving faces. * @@ -152,7 +152,7 @@ int bmesh_edge_swapverts(BMEdge *e, BMVert *orig, BMVert *newv) * * \note the order of elements in all cycles except the loop cycle is undefined. This * leads to slightly increased seek time for deriving some adjacency relations, however the - * advantage is that no intrinsic properties of the data structures are dependant upon the + * advantage is that no intrinsic properties of the data structures are dependent upon the * cycle order and all non-manifold conditions are represented trivially. */ int bmesh_disk_edge_append(BMEdge *e, BMVert *v) diff --git a/source/blender/bmesh/intern/bmesh_structure.h b/source/blender/bmesh/intern/bmesh_structure.h index 8e82f3cd2d7..863c2064e14 100644 --- a/source/blender/bmesh/intern/bmesh_structure.h +++ b/source/blender/bmesh/intern/bmesh_structure.h @@ -35,7 +35,7 @@ * None of these functions should ever be exported to the rest of Blender. * * in the vast majority of cases thes should not be used directly. - * if absolutely necassary, see function defitions in code for + * if absolutely necessary, see function definitions in code for * descriptive comments. but seriously, don't use this stuff. */ diff --git a/source/blender/bmesh/intern/bmesh_walkers.c b/source/blender/bmesh/intern/bmesh_walkers.c index 2e2c0406b9c..3116de3922b 100644 --- a/source/blender/bmesh/intern/bmesh_walkers.c +++ b/source/blender/bmesh/intern/bmesh_walkers.c @@ -42,7 +42,7 @@ * * original desing: walkers directly emulation recursive functions. * functions save their state onto a worklist, and also add new states - * to implement recursive or looping behaviour. generally only one + * 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 @@ -53,8 +53,8 @@ * - Walkers use tool flags, not header flags. * - Walkers now use ghash for storing visited elements, * rather then stealing flags. ghash can be rewritten - * to be faster if necassary, in the far future :) . - * - tools should ALWAYS have necassary error handling + * to be faster if necessary, in the far future :) . + * - tools should ALWAYS have necessary error handling * for if walkers fail. */ diff --git a/source/blender/bmesh/intern/bmesh_walkers_impl.c b/source/blender/bmesh/intern/bmesh_walkers_impl.c index 73aa42dbbdc..4f4b3553f87 100644 --- a/source/blender/bmesh/intern/bmesh_walkers_impl.c +++ b/source/blender/bmesh/intern/bmesh_walkers_impl.c @@ -787,7 +787,7 @@ static void *uvedgeWalker_step(BMWalker *walker) return l; /* go over loops around l->v and nl->v and see which ones share l and nl's - * mloopuv's coordinates. in addition, push on l->next if necassary */ + * mloopuv's coordinates. in addition, push on l->next if necessary */ for (i = 0; i < 2; i++) { cl = i ? nl : l; BM_ITER(l2, &liter, walker->bm, BM_LOOPS_OF_VERT, cl->v) { |