blob: f8675ef332d3f41916a3afa393c98d4391ed74d5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
/* SPDX-License-Identifier: Apache-2.0 */
#include "testing/testing.h"
#include "BLI_kdtree.h"
#include <math.h>
/* -------------------------------------------------------------------- */
/* Tests */
static void standard_test()
{
for (int tree_size = 30; tree_size < 500; tree_size++) {
int tree_index = 0;
KDTree_1d *tree = BLI_kdtree_1d_new(tree_size);
int mask = tree_size & 31;
bool occupied[32] = {false};
for (int i = 0; i < tree_size; i++) {
int index = i & mask;
occupied[index] = true;
float value = fmodf(index * 7.121f, 0.6037f); /* Co-prime. */
float key[1] = {value};
BLI_kdtree_1d_insert(tree, tree_index++, key);
}
int expected = 0;
for (int j = 0; j < 32; j++) {
if (occupied[j]) {
expected++;
}
}
int dedup_count = BLI_kdtree_1d_deduplicate(tree);
EXPECT_EQ(dedup_count, expected);
BLI_kdtree_1d_free(tree);
}
}
static void deduplicate_test()
{
for (int tree_size = 1; tree_size < 40; tree_size++) {
int tree_index = 0;
KDTree_1d *tree = BLI_kdtree_1d_new(tree_size);
for (int i = 0; i < tree_size; i++) {
float key[1] = {1.0f};
BLI_kdtree_1d_insert(tree, tree_index++, key);
}
int dedup_count = BLI_kdtree_1d_deduplicate(tree);
EXPECT_EQ(dedup_count, 1);
BLI_kdtree_1d_free(tree);
}
}
TEST(kdtree, Standard)
{
standard_test();
}
TEST(kdtree, Deduplicate)
{
deduplicate_test();
}
|
