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
|
#include <assert.h>
#include <stdio.h>
#include "test.h"
/* required defs */
#define MAP_KEY int
#define MAP_TYPE int
#define MAP_HASH(a) ints_generic_hash(&(a))
#define MAP_CMP(a, b) ((a) - (b))
#define MAP_NAME ints
/* optional defs */
#define MAP_MALLOC mallocc
#define MAP_CALLOC callocc
#define MAP_REALLOC reallocc
#define MAP_FREE free
#include <conts/map.h>
int main()
{
#if defined(COVERAGE)
assert(!covsrv_init());
atexit(covsrv_destroy);
#endif
/* heuristic, but if we know how many elements we'll need, we should
* give it to the create function. */
struct ints ints = ints_create(10);
/* check that trying to search for something in an empty map doesn*t
* crash */
assert(ints_find(&ints, 0) == NULL);
/* similarly, iterating an empty map doesn't do anything */
foreach(ints, iter, &ints) {
assert(false && "iterating empty map");
}
for (int i = 0; i < 1000000; ++i) {
if (!ints_insert(&ints, i, i)) {
fprintf(stderr, "failed inserting %d\n", i);
ints_destroy(&ints);
return -1;
}
}
assert(ints_len(&ints) == 1000000);
for (int i = 0; i < 1000000; ++i) {
int *v = ints_find(&ints, i);
assert(v && *v == i);
}
/* check that trying to find something that doesn't exist doesn't crash */
assert(ints_find(&ints, 123456789) == NULL);
/* check that trying to remove something that doesn't exist is a noop */
size_t len = ints_len(&ints);
ints_remove(&ints, 123456789);
assert(ints_len(&ints) == len);
/* check that trying to insert 0 again gets us the existing 0 */
int *orig = ints_find(&ints, 0);
int *new = ints_insert(&ints, 0, 0);
assert(orig == new);
size_t count = 0;
foreach(ints, iter, &ints) {
assert(iter->key == iter->data);
count++;
}
assert(count == 1000000);
for (int i = 0; i < 1000000; ++i) {
ints_remove(&ints, i);
}
assert(ints_len(&ints) == 0);
ints_destroy(&ints);
}
|
