diff options
author | Campbell Barton <ideasman42@gmail.com> | 2013-06-26 02:58:23 +0400 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2013-06-26 02:58:23 +0400 |
commit | fad1da062d9e37b44c45b9c205c24f960aaaba62 (patch) | |
tree | 71fa4f3045e8803002f69612e16903346b3f7fdd /source/blender/bmesh | |
parent | b52d01dea60361e30d046d198e34ee99db3feea8 (diff) |
correct typos in comments.
Diffstat (limited to 'source/blender/bmesh')
-rw-r--r-- | source/blender/bmesh/intern/bmesh_edgeloop.c | 4 | ||||
-rw-r--r-- | source/blender/bmesh/intern/bmesh_iterators.h | 2 | ||||
-rw-r--r-- | source/blender/bmesh/intern/bmesh_walkers.c | 2 | ||||
-rw-r--r-- | source/blender/bmesh/operators/bmo_beautify.c | 4 | ||||
-rw-r--r-- | source/blender/bmesh/operators/bmo_bridge.c | 2 | ||||
-rw-r--r-- | source/blender/bmesh/operators/bmo_dupe.c | 2 | ||||
-rw-r--r-- | source/blender/bmesh/operators/bmo_poke.c | 2 | ||||
-rw-r--r-- | source/blender/bmesh/tools/bmesh_bevel.c | 4 | ||||
-rw-r--r-- | source/blender/bmesh/tools/bmesh_decimate_collapse.c | 4 | ||||
-rw-r--r-- | source/blender/bmesh/tools/bmesh_decimate_unsubdivide.c | 2 |
10 files changed, 14 insertions, 14 deletions
diff --git a/source/blender/bmesh/intern/bmesh_edgeloop.c b/source/blender/bmesh/intern/bmesh_edgeloop.c index dc3a223ae5d..8b5b95c5cae 100644 --- a/source/blender/bmesh/intern/bmesh_edgeloop.c +++ b/source/blender/bmesh/intern/bmesh_edgeloop.c @@ -520,7 +520,7 @@ const float *BM_edgeloop_center_get(struct BMEdgeLoopStore *el_store) #define NODE_AS_CO(n) ((BMVert *)((LinkData *)n)->data)->co /** - * edges are assined to one vert -> the next. + * edges are assigned to one vert -> the next. */ void BM_edgeloop_edges_get(struct BMEdgeLoopStore *el_store, BMEdge **e_arr) { @@ -612,7 +612,7 @@ bool BM_edgeloop_calc_normal(BMesh *UNUSED(bm), BMEdgeLoopStore *el_store) } /** - * For open loops that are stright lines, + * For open loops that are straight lines, * calculating the normal as if it were a polygon is meaningless. * * Instead use an alignment vector and calculate the normal based on that. diff --git a/source/blender/bmesh/intern/bmesh_iterators.h b/source/blender/bmesh/intern/bmesh_iterators.h index e4d7a88dc83..b5535b59321 100644 --- a/source/blender/bmesh/intern/bmesh_iterators.h +++ b/source/blender/bmesh/intern/bmesh_iterators.h @@ -154,7 +154,7 @@ typedef void *(*BMIter__step_cb) (void *); /* Iterator Structure */ /* note: some of these vars are not used, - * so they have beem commented to save stack space since this struct is used all over */ + * so they have been commented to save stack space since this struct is used all over */ typedef struct BMIter { /* keep union first */ union { diff --git a/source/blender/bmesh/intern/bmesh_walkers.c b/source/blender/bmesh/intern/bmesh_walkers.c index 79e097a7a7c..04edec01a5c 100644 --- a/source/blender/bmesh/intern/bmesh_walkers.c +++ b/source/blender/bmesh/intern/bmesh_walkers.c @@ -40,7 +40,7 @@ * - joeedh - * design notes: * - * original desing: walkers directly emulation recursive functions. + * original design: walkers directly emulation recursive functions. * functions save their state onto a worklist, and also add new states * to implement recursive or looping behavior. generally only one * state push per call with a specific state is desired. diff --git a/source/blender/bmesh/operators/bmo_beautify.c b/source/blender/bmesh/operators/bmo_beautify.c index f1c400574f5..2c0bc7f95d9 100644 --- a/source/blender/bmesh/operators/bmo_beautify.c +++ b/source/blender/bmesh/operators/bmo_beautify.c @@ -23,10 +23,10 @@ /** \file blender/bmesh/operators/bmo_beautify.c * \ingroup bmesh * - * Beautify the mesh by rotating edes between triangles + * Beautify the mesh by rotating edges between triangles * to more attractive positions until no more rotations can be made. * - * In princible this is very simple however there is the possability of + * In principle this is very simple however there is the possibility of * going into an eternal loop where edges keep rotating. * To avoid this - each edge stores a hash of it previous * states so as not to rotate back. diff --git a/source/blender/bmesh/operators/bmo_bridge.c b/source/blender/bmesh/operators/bmo_bridge.c index 116fe46ee53..a517b7af502 100644 --- a/source/blender/bmesh/operators/bmo_bridge.c +++ b/source/blender/bmesh/operators/bmo_bridge.c @@ -363,7 +363,7 @@ static void bridge_loop_pair(BMesh *bm, int i; BMOperator op_sub; - /* when we have to bridge betweeen different sized edge-loops, + /* when we have to bridge between different sized edge-loops, * be clever and post-process for best results */ diff --git a/source/blender/bmesh/operators/bmo_dupe.c b/source/blender/bmesh/operators/bmo_dupe.c index 2d78a02f709..e41fbd69616 100644 --- a/source/blender/bmesh/operators/bmo_dupe.c +++ b/source/blender/bmesh/operators/bmo_dupe.c @@ -23,7 +23,7 @@ /** \file blender/bmesh/operators/bmo_dupe.c * \ingroup bmesh * - * Duplicate, Split, Spint operators. + * Duplicate, Split, Split operators. */ #include "MEM_guardedalloc.h" diff --git a/source/blender/bmesh/operators/bmo_poke.c b/source/blender/bmesh/operators/bmo_poke.c index 7105210da04..03084ebb1b6 100644 --- a/source/blender/bmesh/operators/bmo_poke.c +++ b/source/blender/bmesh/operators/bmo_poke.c @@ -73,7 +73,7 @@ void bmo_poke_exec(BMesh *bm, BMOperator *op) float f_center[3]; BMVert *v_center = NULL; BMLoop *l_iter, *l_first; - /* only interpolate the centeral loop from the face once, + /* only interpolate the central loop from the face once, * then copy to all others in the fan */ BMLoop *l_center_example; diff --git a/source/blender/bmesh/tools/bmesh_bevel.c b/source/blender/bmesh/tools/bmesh_bevel.c index 6b5e18ceb61..a2cbb0fe44c 100644 --- a/source/blender/bmesh/tools/bmesh_bevel.c +++ b/source/blender/bmesh/tools/bmesh_bevel.c @@ -223,7 +223,7 @@ static BevVert *find_bevvert(BevelParams *bp, BMVert *bmv) return BLI_ghash_lookup(bp->vert_hash, bmv); } -/* Return a good respresentative face (for materials, etc.) for faces +/* Return a good representative face (for materials, etc.) for faces * created around/near BoundVert v */ static BMFace *boundvert_rep_face(BoundVert *v) { @@ -531,7 +531,7 @@ static int bev_ccw_test(BMEdge *a, BMEdge *b, BMFace *f) * Also find vd, which is in direction normal to parallelogram and 1 unit away * from the origin. * The quarter circle in first quadrant of unit square will be mapped to the - * quadrant of a sheared ellipse in the parallelgram, using a matrix. + * quadrant of a sheared ellipse in the parallelogram, using a matrix. * The matrix mat is calculated to map: * (0,1,0) -> va * (1,1,0) -> vmid diff --git a/source/blender/bmesh/tools/bmesh_decimate_collapse.c b/source/blender/bmesh/tools/bmesh_decimate_collapse.c index f47abc8891c..d3ffc348539 100644 --- a/source/blender/bmesh/tools/bmesh_decimate_collapse.c +++ b/source/blender/bmesh/tools/bmesh_decimate_collapse.c @@ -116,7 +116,7 @@ static void bm_decim_build_quadrics(BMesh *bm, Quadric *vquadrics) static void bm_decim_calc_target_co(BMEdge *e, float optimize_co[3], const Quadric *vquadrics) { - /* compute an edge contration target for edge 'e' + /* compute an edge contraction target for edge 'e' * this is computed by summing it's vertices quadrics and * optimizing the result. */ Quadric q; @@ -682,7 +682,7 @@ static bool bm_edge_collapse_is_degenerate_topology(BMEdge *e_first) /** * special, highly limited edge collapse function - * intended for speed over flexibiliy. + * intended for speed over flexibility. * can only collapse edges connected to (1, 2) tris. * * Important - dont add vert/edge/face data on collapsing! diff --git a/source/blender/bmesh/tools/bmesh_decimate_unsubdivide.c b/source/blender/bmesh/tools/bmesh_decimate_unsubdivide.c index c48e83686b5..0667d560615 100644 --- a/source/blender/bmesh/tools/bmesh_decimate_unsubdivide.c +++ b/source/blender/bmesh/tools/bmesh_decimate_unsubdivide.c @@ -79,7 +79,7 @@ static bool bm_vert_dissolve_fan(BMesh *bm, BMVert *v) { /* collapse under 2 conditions. * - vert connects to 4 manifold edges (and 4 faces). - * - vert connecrs to 1 manifold edge, 2 boundary edges (and 2 faces). + * - vert connects to 1 manifold edge, 2 boundary edges (and 2 faces). * * This covers boundary verts of a quad grid and center verts. * note that surrounding faces dont have to be quads. |