diff options
author | Campbell Barton <ideasman42@gmail.com> | 2019-09-19 06:18:52 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2019-09-19 06:19:53 +0300 |
commit | d8a7e5ee324ef4648a317ef232aae5b5a8ed991f (patch) | |
tree | 8e9a231e2fd37a811df904df4437eed863121582 /source/blender/blenlib | |
parent | 741d7d60ed90707f3f20b86372669ca5287a74da (diff) |
Cleanup: spelling
Diffstat (limited to 'source/blender/blenlib')
-rw-r--r-- | source/blender/blenlib/BLI_array_ref.h | 12 | ||||
-rw-r--r-- | source/blender/blenlib/intern/fileops.c | 2 |
2 files changed, 7 insertions, 7 deletions
diff --git a/source/blender/blenlib/BLI_array_ref.h b/source/blender/blenlib/BLI_array_ref.h index 1373a0da355..e34647676d8 100644 --- a/source/blender/blenlib/BLI_array_ref.h +++ b/source/blender/blenlib/BLI_array_ref.h @@ -21,17 +21,17 @@ * \ingroup bli * * These classes offer a convenient way to work with continuous chunks of memory of a certain type. - * We differentiate ArrayRef and MutableArrayRef. The elements in the former are const while the + * We differentiate #ArrayRef and #MutableArrayRef. The elements in the former are const while the * elements in the other are not. * * Passing array references as parameters has multiple benefits: * - Less templates are used because the function does not have to work with different * container types. - * - It encourages an Struct-of-Arrays data layout which is often benefitial when + * - It encourages an Struct-of-Arrays data layout which is often beneficial when * writing high performance code. Also it makes it easier to reuse code. * - Array references offer convenient ways of slicing and other operations. * - * The instances of ArrayRef and MutableArrayRef are very small and should be passed by value. + * The instances of #ArrayRef and #MutableArrayRef are very small and should be passed by value. * Since array references do not own any memory, it is generally not save to store them. */ @@ -202,7 +202,7 @@ template<typename T> class ArrayRef { /** * Does a linear search to count how often the value is in the array. - * Returns the number of occurences. + * Returns the number of occurrences. */ uint count(const T &value) const { @@ -226,7 +226,7 @@ template<typename T> class ArrayRef { } /** - * Return a reference to the last elemeent in the array. + * Return a reference to the last element in the array. * Asserts that the array is not empty. */ const T &last() const @@ -363,7 +363,7 @@ template<typename T> class MutableArrayRef { /** * Return a continuous part of the array. - * Aserts that the slice stays in the array bounds. + * Asserts that the slice stays in the array bounds. */ MutableArrayRef slice(uint start, uint length) const { diff --git a/source/blender/blenlib/intern/fileops.c b/source/blender/blenlib/intern/fileops.c index 1de8744a6a6..99149f5ea42 100644 --- a/source/blender/blenlib/intern/fileops.c +++ b/source/blender/blenlib/intern/fileops.c @@ -770,7 +770,7 @@ int BLI_delete(const char *file, bool dir, bool recursive) } /** - * Do the two paths denote the same filesystem object? + * Do the two paths denote the same file-system object? */ static bool check_the_same(const char *path_a, const char *path_b) { |