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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
#include "Config.h"
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <stdarg.h>
#include "Bootstrap.h"
#include "Str.h"
#include "Array.h"
/**
* Array.c unit tests.
*/
typedef struct value_t {
int key;
char value[STRLEN];
} *value_t;
static void _apply(int key, void **value, void *ap) {
*(int *)ap += 1;
value_t v = *value;
assert(key == v->key);
assert(Str_parseInt(v->value) == key);
}
static bool _predicate(void *value, void *needle) {
value_t v = value;
int term = *(int*)needle;
return v->key == term;
}
static void _release(__attribute__ ((unused))int key, void **value, void *ap) {
*(int *)ap -= 1;
FREE(*value);
}
int main(void) {
Array_T T = NULL;
Bootstrap(); // Need to initialize library
printf("============> Start Array Tests\n\n");
printf("=> Test0: create\n");
{
T = Array_new(1024);
assert(T);
assert(Array_length(T) == 0);
}
printf("=> Test0: OK\n\n");
printf("=> Test1: Array_put() & Array_length()\n");
{
for (int i = 0; i < 20; i++) {
value_t v = ALLOC(sizeof *(v));
v->key = i;
snprintf(v->value, STRLEN, "%d", i);
assert(Array_put(T, i, v) == NULL); // Check that the entry was not present already
assert(Array_put(T, i, v) != NULL); // Try to put duplicate
}
assert(Array_length(T) == 20);
}
printf("=> Test1: OK\n\n");
printf("=> Test2: Array_get()\n");
{
assert(Array_get(T, 20) == NULL);
assert(Array_get(T, 10));
}
printf("=> Test2: OK\n\n");
printf("=> Test3: Array_remove()\n");
{
value_t save;
assert((save = Array_remove(T, 10)) != 0);
assert(save->key == 10);
assert(Array_get(T, 10) == NULL);
assert(Array_length(T) == 19);
// Put it back for reuse below
Array_put(T, 10, save);
assert(Array_get(T, 10));
assert(Array_length(T) == 20);
}
printf("=> Test3: OK\n\n");
printf("=> Test4: Array_map()\n");
{
int i = 0;
Array_map(T, _apply, &i);
assert(i == 20);
}
printf("=> Test4: OK\n\n");
printf("=> Test5: Array_find()\n");
{
int needle = 12;
value_t v = Array_find(T, _predicate, &needle);
assert(v);
assert(v->key == needle);
needle = 123;
v = Array_find(T, _predicate, &needle);
assert(v == NULL);
}
printf("=> Test5: OK\n\n");
printf("=> Test6: Array_free\n");
{
int i = Array_length(T);
assert(i == 20);
Array_map(T, _release, &i);
assert(i == 0);
assert(Array_length(T) == 20);
Array_free(&T);
assert(T == NULL);
}
printf("=> Test6: OK\n\n");
printf("=> Test7: sparseness()\n");
{
T = Array_new(4);
int numbers[] = {0, 509, 1021, 2053, 4093, 8191, 16381, 32771, 65521, -INT_MAX, INT_MAX};
int numbers_length = (int)(sizeof(numbers)/sizeof(numbers[0]));
for (int i = 0; i < numbers_length; i++)
assert(Array_put(T, numbers[i], &numbers[i]) == NULL);
assert(Array_length(T) == numbers_length);
for (int i = 0; i < numbers_length; i++) {
int *n = Array_get(T, numbers[i]);
assert(*n == numbers[i]);
}
Array_free(&T);
}
printf("=> Test7: OK\n\n");
printf("============> Array Tests: OK\n\n");
}
|
