-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathtest_quadtree_node_contains.c
45 lines (35 loc) · 1.61 KB
/
test_quadtree_node_contains.c
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
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "quadtree.h"
int _quadtree_node_contains(QUADTREE_NODE *n, unsigned int x, unsigned int y);
int main(int argc, char **argv) {
QUADTREE *ref = NULL;
assert(!quadtree_init(&ref, 3, 3));
assert(_quadtree_node_contains(ref->root, 0, 0));
assert(_quadtree_node_contains(ref->root, 0, 1));
assert(_quadtree_node_contains(ref->root, 0, 2));
assert(_quadtree_node_contains(ref->root, 0, 3));
assert(!_quadtree_node_contains(ref->root, 0, 4));
assert(_quadtree_node_contains(ref->root, 1, 0));
assert(_quadtree_node_contains(ref->root, 1, 1));
assert(_quadtree_node_contains(ref->root, 1, 2));
assert(_quadtree_node_contains(ref->root, 1, 3));
assert(!_quadtree_node_contains(ref->root, 1, 4));
assert(_quadtree_node_contains(ref->root, 2, 0));
assert(_quadtree_node_contains(ref->root, 2, 1));
assert(_quadtree_node_contains(ref->root, 2, 2));
assert(_quadtree_node_contains(ref->root, 2, 3));
assert(!_quadtree_node_contains(ref->root, 2, 4));
assert(_quadtree_node_contains(ref->root, 3, 0));
assert(_quadtree_node_contains(ref->root, 3, 1));
assert(_quadtree_node_contains(ref->root, 3, 2));
assert(_quadtree_node_contains(ref->root, 3, 3));
assert(!_quadtree_node_contains(ref->root, 3, 4));
assert(!_quadtree_node_contains(ref->root, 4, 0));
assert(!_quadtree_node_contains(ref->root, 4, 1));
assert(!_quadtree_node_contains(ref->root, 4, 2));
assert(!_quadtree_node_contains(ref->root, 4, 3));
assert(!_quadtree_node_contains(ref->root, 4, 4));
return 0;
}