diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2012-03-01 16:20:18 +0400 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2012-03-01 16:20:18 +0400 |
| commit | ea13ec1699bcf59960daa57fd2cd9d24e195a71b (patch) | |
| tree | 8f3b48f2b535426b425388181ed0b9a598ca2d06 /source/blender/bmesh/intern/bmesh_structure.c | |
| parent | 6a36b6249b8dc5bd0f60572fdbc2e42e79c14981 (diff) | |
Spelling Cleanup
Diffstat (limited to 'source/blender/bmesh/intern/bmesh_structure.c')
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_structure.c | 4 |
1 files changed, 2 insertions, 2 deletions
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) |