5#include "testing/testing.h"
24 EXPECT_STREQ(
"",
data);
31 EXPECT_STREQ(
"0",
data);
38 EXPECT_STREQ(
"3210",
data);
43 const int data_cmp[] = {3, 2, 1, 0};
44 int data[] = {0, 1, 2, 3};
52 char data[] =
"", find =
'0';
59 char data[] =
"0", find =
'0';
66 char data[] =
"1", find =
'0';
73 char data[] =
"0123", find =
'3';
80 int data[] = {0, 1, 2, 3}, find = 3;
87 int data[] = {0, 1, 2, 0}, find = 0;
94 int data[] = {1, 0, 0, 3}, find = 0;
101 const char *
data[4] = {
nullptr};
106 const char *a =
"a", *
b =
"b", *c =
"c", *d =
"d";
108#define STACK_PUSH_AND_CHECK_FORWARD(v, i) \
110 STACK_PUSH(data, v); \
111 EXPECT_EQ(BLI_array_findindex(data, STACK_SIZE(data), &(v)), i); \
115#define STACK_PUSH_AND_CHECK_BACKWARD(v, i) \
117 STACK_PUSH(data, v); \
118 EXPECT_EQ(BLI_array_rfindindex(data, STACK_SIZE(data), &(v)), i); \
122#define STACK_PUSH_AND_CHECK_BOTH(v, i) \
124 STACK_PUSH(data, v); \
125 EXPECT_EQ(BLI_array_findindex(data, STACK_SIZE(data), &(v)), i); \
126 EXPECT_EQ(BLI_array_rfindindex(data, STACK_SIZE(data), &(v)), i); \
147#undef STACK_PUSH_AND_CHECK_FORWARD
148#undef STACK_PUSH_AND_CHECK_BACKWARD
149#undef STACK_PUSH_AND_CHECK_BOTH
153#define BINARY_AND_TEST(data_cmp, data_a, data_b, data_combine, length) \
155 BLI_array_binary_and(data_combine, data_a, data_b, length); \
156 EXPECT_EQ_ARRAY(data_cmp, data_combine, length); \
162 const int data_cmp[] = {0, 0, 0, 0};
163 int data_a[] = {0, 1, 0, 1}, data_b[] = {1, 0, 1, 0};
170 const int data_cmp[] = {1, 0, 1, 0};
171 int data_a[] = {1, 1, 1, 1}, data_b[] = {1, 0, 1, 0};
175#undef BINARY_AND_TEST
178#define BINARY_OR_TEST(data_cmp, data_a, data_b, data_combine, length) \
180 BLI_array_binary_or(data_combine, data_a, data_b, length); \
181 EXPECT_EQ_ARRAY(data_combine, data_cmp, length); \
187 int data_a[] = {0, 1, 0, 1}, data_b[] = {1, 0, 1, 0}, data_cmp[] = {1, 1, 1, 1};
194 int data_a[] = {1, 1, 0, 0}, data_b[] = {0, 0, 1, 0}, data_cmp[] = {1, 1, 1, 0};
201#define DEDUPLICATE_ORDERED_TEST(data, data_cmp) \
203 const uint data_len_new = BLI_array_deduplicate_ordered(data, ARRAY_SIZE(data)); \
204 EXPECT_EQ(data_len_new, ARRAY_SIZE(data_cmp)); \
205 EXPECT_EQ_ARRAY(data, data_cmp, data_len_new); \
207 const uint data_len_test = BLI_array_deduplicate_ordered(data, data_len_new); \
208 EXPECT_EQ(data_len_test, ARRAY_SIZE(data_cmp)); \
209 EXPECT_EQ_ARRAY(data, data_cmp, data_len_new); \
216 const int data_cmp[] = {0};
223 const int data_cmp[] = {1, 2};
230 const int data_cmp[] = {1};
236 int data[] = {1, 1, 1};
237 const int data_cmp[] = {1};
243 int data[] = {3, 3, 2, 2, 1, 1};
244 const int data_cmp[] = {3, 2, 1};
248#undef DEDUPLICATE_ORDERED_TEST
254 EXPECT_EQ_ARRAY(data_cmp.
data(), ranges.
as_span().data(), data_cmp.
size());
259 const std::array
data = {
false};
266 const std::array
data = {
true,
true,
true};
267 const std::array data_cmp = {
IndexRange(0, 3)};
273 const std::array
data = {
true,
false};
274 const std::array data_cmp = {
IndexRange(0, 1)};
280 const std::array
data = {
false,
true};
281 const std::array data_cmp = {
IndexRange(1, 1)};
287 const std::array
data = {
true,
false,
false,
true,
true,
false,
true};
293 const std::optional<int64_t> expect_index)
296 EXPECT_TRUE(result_index.has_value() == expect_index.has_value());
297 if (result_index.has_value() && expect_index.has_value()) {
298 EXPECT_EQ(result_index.value(), expect_index.value());
309 const std::array
data{1};
315 const std::array
data{1, 2, 2, 1};
331 mask.foreach_index([&](
const int i) {
332 if (expected_ids.
add(ids[i])) {
333 expected_first_indices.
append(i);
341 ids,
mask, group_indices, &first_indices);
357 const std::array ids{5, 3, 5, -2, 3, 3, 0, -2};
363 const std::array ids{1000000, 3, 1000000, -2000000, 3, 7};
369 const std::array ids{4, 1, 4, 2, 1, 2, 4, 3};
379 dense_ids[i] = (i * 7919) % 20011;
380 sparse_ids[i] = ((i * 7919) % 1009) * 1000003;
384 dense_ids.
index_range(), memory, [](
const int i) { return i % 3 != 0; });
Generic array manipulation API.
#define BLI_array_reverse(arr, arr_len)
#define BLI_array_findindex(arr, arr_len, p)
#define BLI_array_rfindindex(arr, arr_len, p)
#define BINARY_OR_TEST(data_cmp, data_a, data_b, data_combine, length)
#define STACK_PUSH_AND_CHECK_FORWARD(v, i)
#define DEDUPLICATE_ORDERED_TEST(data, data_cmp)
#define STACK_PUSH_AND_CHECK_BOTH(v, i)
#define STACK_PUSH_AND_CHECK_BACKWARD(v, i)
#define BINARY_AND_TEST(data_cmp, data_a, data_b, data_combine, length)
#define STACK_DECLARE(stack)
#define STACK_INIT(stack, stack_num)
Span< T > as_span() const
IndexRange index_range() const
static IndexMask from_predicate(const IndexMask &universe, LinearAllocator<> &memory, Fn &&predicate, exec_mode::Mode mode=exec_mode::parallel)
static IndexMask from_indices(Span< T > indices, LinearAllocator<> &memory)
constexpr IndexRange()=default
constexpr const T * data() const
constexpr int64_t size() const
static VArray from_func(const int64_t size, GetFunc get_func)
static VArray from_span(Span< T > values)
int64_t index_of(const Key &key) const
void append(const T &value)
Span< T > as_span() const
#define EXPECT_TRUE(result)
Vector< IndexRange > find_all_ranges(const Span< T > span, const T &value)
std::optional< int64_t > max_element_index(const Span< T > &span, const int64_t grain_size=8192)
int group_ids_to_indices(Span< int > ids, const IndexMask &mask, MutableSpan< int > r_group_indices, Vector< int > *r_first_indices=nullptr)
static void find_all_ranges_test(const Span< bool > data, const Span< IndexRange > data_cmp)
BMesh const char void * data
static void find_max_element_test(const VArray< int > &values, const std::optional< int64_t > expect_index)
constexpr size_t ARRAY_SIZE(const T(&arg)[N]) noexcept
EXPECT_EQ(BLI_expr_pylike_eval(expr, nullptr, 0, &result), EXPR_PYLIKE_INVALID)
static void group_ids_to_indices_test(const Span< int > ids, const IndexMask &mask)