3 #include "testing/testing.h"
14 for (
int tree_size = 30; tree_size < 500; tree_size++) {
16 KDTree_1d *
tree = BLI_kdtree_1d_new(tree_size);
17 int mask = tree_size & 31;
18 bool occupied[32] = {
false};
20 for (
int i = 0; i < tree_size; i++) {
22 occupied[index] =
true;
23 float value =
fmodf(index * 7.121f, 0.6037f);
24 float key[1] = {value};
25 BLI_kdtree_1d_insert(
tree, tree_index++, key);
28 for (
int j = 0; j < 32; j++) {
34 int dedup_count = BLI_kdtree_1d_deduplicate(
tree);
36 BLI_kdtree_1d_free(
tree);
42 for (
int tree_size = 1; tree_size < 40; tree_size++) {
44 KDTree_1d *
tree = BLI_kdtree_1d_new(tree_size);
45 for (
int i = 0; i < tree_size; i++) {
46 float key[1] = {1.0f};
47 BLI_kdtree_1d_insert(
tree, tree_index++, key);
49 int dedup_count = BLI_kdtree_1d_deduplicate(
tree);
51 BLI_kdtree_1d_free(
tree);
EXPECT_EQ(BLI_expr_pylike_eval(expr, nullptr, 0, &result), EXPR_PYLIKE_INVALID)
A KD-tree for nearest neighbor search.
static void deduplicate_test()
static void standard_test()
ccl_device_inline float4 mask(const int4 &mask, const float4 &a)