diff options
author | Jacques Lucke <jacques@blender.org> | 2020-06-08 18:37:43 +0300 |
---|---|---|
committer | Jacques Lucke <jacques@blender.org> | 2020-06-08 18:37:43 +0300 |
commit | 0a907657d4d525d320e0c8518f583b7210736214 (patch) | |
tree | 10ca57cfaa0af568686ed309af163e32442a87e5 /tests/gtests/blenlib/BLI_index_mask_test.cc | |
parent | b5846ebce7863a59f6bbd00cf676486a7b4e0b76 (diff) |
Functions: Run-time type system and index mask
This adds a new `CPPType` that encapsulates information about how to handle
instances of a specific data type. This is necessary for the function evaluation
system, which will be used to evaluate most of the particle node trees.
Furthermore, this adds an `IndexMask` class which offers a surprisingly useful
abstraction over an array containing unsigned integers. It makes two assumptions
about the underlying integer array:
* The integers are in ascending order.
* There are no duplicates.
`IndexMask` will be used to "select" certain particles that will be
processed in a data-oriented way. Sometimes, operations don't have to
be applied to all particles, but only some, those that are in the indexed by
the `IndexMask`. The two limitations imposed by an `IndexMask` allow for
better performance.
Reviewers: brecht
Differential Revision: https://developer.blender.org/D7957
Diffstat (limited to 'tests/gtests/blenlib/BLI_index_mask_test.cc')
-rw-r--r-- | tests/gtests/blenlib/BLI_index_mask_test.cc | 39 |
1 files changed, 39 insertions, 0 deletions
diff --git a/tests/gtests/blenlib/BLI_index_mask_test.cc b/tests/gtests/blenlib/BLI_index_mask_test.cc new file mode 100644 index 00000000000..057aed091a1 --- /dev/null +++ b/tests/gtests/blenlib/BLI_index_mask_test.cc @@ -0,0 +1,39 @@ +#include "BLI_index_mask.hh" +#include "testing/testing.h" + +using namespace BLI; + +TEST(index_mask, DefaultConstructor) +{ + IndexMask mask; + EXPECT_EQ(mask.min_array_size(), 0); + EXPECT_EQ(mask.size(), 0); +} + +TEST(index_mask, ArrayConstructor) +{ + [](IndexMask mask) { + EXPECT_EQ(mask.size(), 4); + EXPECT_EQ(mask.min_array_size(), 8); + EXPECT_FALSE(mask.is_range()); + EXPECT_EQ(mask[0], 3); + EXPECT_EQ(mask[1], 5); + EXPECT_EQ(mask[2], 6); + EXPECT_EQ(mask[3], 7); + }({3, 5, 6, 7}); +} + +TEST(index_mask, RangeConstructor) +{ + IndexMask mask = IndexRange(3, 5); + EXPECT_EQ(mask.size(), 5); + EXPECT_EQ(mask.min_array_size(), 8); + EXPECT_EQ(mask.last(), 7); + EXPECT_TRUE(mask.is_range()); + EXPECT_EQ(mask.as_range().first(), 3); + EXPECT_EQ(mask.as_range().last(), 7); + ArrayRef<uint> indices = mask.indices(); + EXPECT_EQ(indices[0], 3); + EXPECT_EQ(indices[1], 4); + EXPECT_EQ(indices[2], 5); +} |