diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2021-10-03 04:06:06 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2021-10-03 04:13:29 +0300 |
| commit | 74f45ed9c55aaecf6fd90a8076f486ad4302515d (patch) | |
| tree | 09d0a8216139d44c80801fc4e1ae9fa655097294 /source/blender/blenlib/intern/list_sort_impl.h | |
| parent | c5c94e3eae74a7023c84cf0906cfa814c39f84dd (diff) | |
Cleanup: spelling in comments
Diffstat (limited to 'source/blender/blenlib/intern/list_sort_impl.h')
| -rw-r--r-- | source/blender/blenlib/intern/list_sort_impl.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/source/blender/blenlib/intern/list_sort_impl.h b/source/blender/blenlib/intern/list_sort_impl.h index 680044f9ccb..71f7f0e29a8 100644 --- a/source/blender/blenlib/intern/list_sort_impl.h +++ b/source/blender/blenlib/intern/list_sort_impl.h @@ -202,7 +202,7 @@ BLI_INLINE list_node *sweep_up(struct SortInfo *si, list_node *list, unsigned in } /** - * The 'ranks' array essentially captures the recursion stack of a mergesort. + * The 'ranks' array essentially captures the recursion stack of a merge-sort. * The merge tree is built in a bottom-up manner. The control loop for * updating the 'ranks' array is analogous to incrementing a binary integer, * and the `O(n)` time for counting `upto` n translates to `O(n)` merges when |