diff options
| author | Hans Goudey <h.goudey@me.com> | 2022-02-16 19:53:40 +0300 |
|---|---|---|
| committer | Hans Goudey <h.goudey@me.com> | 2022-02-16 19:53:58 +0300 |
| commit | 5b73017ddb679bb050fe13e4d9e3e5b04ea559b9 (patch) | |
| tree | 4afcb238a3cb27e67a9b8abbccad124702298630 /source/blender/blenlib/CMakeLists.txt | |
| parent | 399168f3c13fadb41c9fbec8a1b5c56cb6609343 (diff) | |
BLI: Generalize short algorithm for finding bounds
Finding the greatest and/or smallest element in an array is a common
need. This commit refactors the point cloud bounds code added in
6d7dbdbb44f379682 to a more general header in blenlib.
This will allow reusing the algorithm for curves without duplicating it.
Differential Revision: https://developer.blender.org/D14053
Diffstat (limited to 'source/blender/blenlib/CMakeLists.txt')
| -rw-r--r-- | source/blender/blenlib/CMakeLists.txt | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/source/blender/blenlib/CMakeLists.txt b/source/blender/blenlib/CMakeLists.txt index e67d673eb73..e1b6e218ff5 100644 --- a/source/blender/blenlib/CMakeLists.txt +++ b/source/blender/blenlib/CMakeLists.txt @@ -162,6 +162,7 @@ set(SRC BLI_bitmap_draw_2d.h BLI_blenlib.h BLI_boxpack_2d.h + BLI_bounds.hh BLI_buffer.h BLI_color.hh BLI_compiler_attrs.h @@ -395,6 +396,7 @@ if(WITH_GTESTS) tests/BLI_array_store_test.cc tests/BLI_array_test.cc tests/BLI_array_utils_test.cc + tests/BLI_bounds_test.cc tests/BLI_color_test.cc tests/BLI_delaunay_2d_test.cc tests/BLI_disjoint_set_test.cc |