diff options
author | Campbell Barton <ideasman42@gmail.com> | 2020-03-24 02:27:12 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2020-03-24 02:36:42 +0300 |
commit | d0d251b53b7114a52d1253b022acb04d84e39507 (patch) | |
tree | 7cc5f718adfffe9158cd4cfbe20e2aa6ae3a341d /source/blender/blenkernel | |
parent | 9c280630c96e3fa7194166350bd7197d28c5428f (diff) |
Cleanup: spelling
Diffstat (limited to 'source/blender/blenkernel')
-rw-r--r-- | source/blender/blenkernel/intern/curveprofile.c | 4 | ||||
-rw-r--r-- | source/blender/blenkernel/intern/pbvh_bmesh.c | 10 |
2 files changed, 7 insertions, 7 deletions
diff --git a/source/blender/blenkernel/intern/curveprofile.c b/source/blender/blenkernel/intern/curveprofile.c index 0ab45921c56..a748dfbab3e 100644 --- a/source/blender/blenkernel/intern/curveprofile.c +++ b/source/blender/blenkernel/intern/curveprofile.c @@ -932,8 +932,8 @@ void BKE_curveprofile_initialize(CurveProfile *profile, short segments_len) } /** - * Gives the distance to the next point in the widget's sampled table, in other words the length - * of the ith edge of the table. + * Gives the distance to the next point in the widgets sampled table, in other words the length + * of the \a 'i' edge of the table. * * \note Requires curveprofile_initialize or #BKE_curveprofile_update call before to fill table. */ diff --git a/source/blender/blenkernel/intern/pbvh_bmesh.c b/source/blender/blenkernel/intern/pbvh_bmesh.c index 65820566fd5..73042222436 100644 --- a/source/blender/blenkernel/intern/pbvh_bmesh.c +++ b/source/blender/blenkernel/intern/pbvh_bmesh.c @@ -895,11 +895,11 @@ static void long_edge_queue_edge_add_recursive( } if ((l_edge->radial_next != l_edge)) { - /* how much longer we need to be to consider for subdividing + /* How much longer we need to be to consider for subdividing * (avoids subdividing faces which are only *slightly* skinny) */ # define EVEN_EDGELEN_THRESHOLD 1.2f - /* how much the limit increases per recursion - * (avoids performing subdvisions too far away) */ + /* How much the limit increases per recursion + * (avoids performing subdivisions too far away). */ # define EVEN_GENERATION_SCALE 1.6f const float len_sq_cmp = len_sq * EVEN_EDGELEN_THRESHOLD; @@ -1687,7 +1687,7 @@ struct FastNodeBuildInfo { /** * Recursively split the node if it exceeds the leaf_limit. - * This function is multi-threadabe since each invocation applies + * This function is multi-thread-able since each invocation applies * to a sub part of the arrays. */ static void pbvh_bmesh_node_limit_ensure_fast( @@ -1811,7 +1811,7 @@ static void pbvh_bmesh_create_nodes_fast_recursive( } else { /* node does not have children so it's a leaf node, populate with faces and tag accordingly - * this is an expensive part but it's not so easily threadable due to vertex node indices */ + * this is an expensive part but it's not so easily thread-able due to vertex node indices */ const int cd_vert_node_offset = bvh->cd_vert_node_offset; const int cd_face_node_offset = bvh->cd_face_node_offset; |