blob: 6ab3d6ad3ade2b9f8de56f31423c3bc921c50867 (
plain) (
blame)
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
|
#include <assert.h>
#include <stdio.h>
#include "test.h"
/* required defs */
#define SPTREE_TYPE int
#define SPTREE_CMP(a, b) ((b) - (a))
#define SPTREE_NAME ints
/* optional defs */
#define SPTREE_MALLOC mallocc
#define SPTREE_CALLOC callocc
#define SPTREE_REALLOC reallocc
#define SPTREE_FREE free
#include <conts/sptree.h>
int main()
{
#if defined(COVERAGE)
assert(!covsrv_init());
atexit(covsrv_destroy);
#endif
struct ints ints = ints_create();
for (int i = 0; i < 1000000; ++i) {
if (!ints_insert(&ints, 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);
}
int i = 0;
foreach(ints, iter, &ints) {
/* since my trees are ordered, this must hold, although you
* might consider it an implementation detail that shouldn't be
* relied on */
assert(iter && *iter == i);
i++;
}
for (int i = 0; i < 1000000; ++i) {
ints_remove(&ints, i);
}
assert(ints_len(&ints) == 0);
ints_destroy(&ints);
}
|
