diff options
author | Campbell Barton <ideasman42@gmail.com> | 2019-09-30 10:06:28 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2019-09-30 10:07:05 +0300 |
commit | a6a0a091978d09ffa85306dcabb671370a5bb322 (patch) | |
tree | e343981ae43d5b8a590b35d8d2314ae54cc5870a /source/blender/blenlib | |
parent | 04133ee863b43d1a595ce049685c6a2347ffd3ad (diff) |
Cleanup: spelling
Diffstat (limited to 'source/blender/blenlib')
-rw-r--r-- | source/blender/blenlib/BLI_sort.h | 2 | ||||
-rw-r--r-- | source/blender/blenlib/intern/BLI_linklist.c | 2 | ||||
-rw-r--r-- | source/blender/blenlib/intern/listbase.c | 2 | ||||
-rw-r--r-- | source/blender/blenlib/intern/math_matrix.c | 4 | ||||
-rw-r--r-- | source/blender/blenlib/intern/sort.c | 2 |
5 files changed, 6 insertions, 6 deletions
diff --git a/source/blender/blenlib/BLI_sort.h b/source/blender/blenlib/BLI_sort.h index b6250afdee0..08e61915a83 100644 --- a/source/blender/blenlib/BLI_sort.h +++ b/source/blender/blenlib/BLI_sort.h @@ -31,7 +31,7 @@ # define BLI_qsort_r qsort_r #endif -/* Quick sort reentrant */ +/* Quick sort re-entrant */ typedef int (*BLI_sort_cmp_t)(const void *a, const void *b, void *ctx); void BLI_qsort_r(void *a, size_t n, size_t es, BLI_sort_cmp_t cmp, void *thunk) diff --git a/source/blender/blenlib/intern/BLI_linklist.c b/source/blender/blenlib/intern/BLI_linklist.c index ae4f5dcebcf..0fe9fd62198 100644 --- a/source/blender/blenlib/intern/BLI_linklist.c +++ b/source/blender/blenlib/intern/BLI_linklist.c @@ -325,7 +325,7 @@ void BLI_linklist_apply(LinkNode *list, LinkNodeApplyFP applyfunc, void *userdat #include "list_sort_impl.h" #undef SORT_IMPL_FUNC -/* reentrant call */ +/* re-entrant call */ #define SORT_IMPL_USE_THUNK #define SORT_IMPL_FUNC linklist_sort_fn_r #include "list_sort_impl.h" diff --git a/source/blender/blenlib/intern/listbase.c b/source/blender/blenlib/intern/listbase.c index 232dc245152..fe5f9f7673f 100644 --- a/source/blender/blenlib/intern/listbase.c +++ b/source/blender/blenlib/intern/listbase.c @@ -312,7 +312,7 @@ static void listbase_double_from_single(Link *iter, ListBase *listbase) #include "list_sort_impl.h" #undef SORT_IMPL_FUNC -/* reentrant call */ +/* re-entrant call */ #define SORT_IMPL_USE_THUNK #define SORT_IMPL_FUNC listbase_sort_fn_r #include "list_sort_impl.h" diff --git a/source/blender/blenlib/intern/math_matrix.c b/source/blender/blenlib/intern/math_matrix.c index e9d196ccdbb..33e272ed7eb 100644 --- a/source/blender/blenlib/intern/math_matrix.c +++ b/source/blender/blenlib/intern/math_matrix.c @@ -1146,8 +1146,8 @@ bool invert_m4(float m[4][4]) * \return true on success (i.e. can always find a pivot) and false on failure. * Mark Segal - 1992. * - * \note this is less performant than #EIG_invert_m4_m4 (Eigen), but e.g. - * for non-invertible scale matrices, findinging a partial solution can + * \note this has worse performance than #EIG_invert_m4_m4 (Eigen), but e.g. + * for non-invertible scale matrices, finding a partial solution can * be useful to have a valid local transform center, see T57767. */ bool invert_m4_m4_fallback(float inverse[4][4], const float mat[4][4]) diff --git a/source/blender/blenlib/intern/sort.c b/source/blender/blenlib/intern/sort.c index 225015db00d..4ae87fff535 100644 --- a/source/blender/blenlib/intern/sort.c +++ b/source/blender/blenlib/intern/sort.c @@ -90,7 +90,7 @@ BLI_INLINE char *med3(char *a, char *b, char *c, BLI_sort_cmp_t cmp, void *thunk } /** - * Quick sort reentrant. + * Quick sort re-entrant. */ void BLI_qsort_r(void *a, size_t n, size_t es, BLI_sort_cmp_t cmp, void *thunk) { |