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
|
#!/bin/sh
. ../../dttools/test/test_runner_common.sh
exe="data_struct_set.test"
prepare()
{
${CC} -g $CCTOOLS_TEST_CCFLAGS -o "$exe" -I ../src/ -x c - -x none ../src/libdttools.a -lm <<EOF
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "set.h"
#define SET_INS(s, f, n) set_insert(s, (void *) n ); f[n] = 1;
int main(int argc, char **argv)
{
uintptr_t N = 11;
int set_membership[N];
struct set *s = set_create(0);
bzero(set_membership, sizeof(int) * N);
SET_INS(s, set_membership, 1);
assert( set_size(s) == 1 );
SET_INS(s, set_membership, 1);
assert( set_size(s) == 1 );
SET_INS(s, set_membership, 2);
assert( set_size(s) == 2 );
set_remove(s, (void *) 3);
assert( set_size(s) == 2 );
set_remove(s, (void *) 1);
assert( set_size(s) == 1 );
set_remove(s, (void *) 1);
assert( set_size(s) == 1 );
/* Check that the remaining element is 2 */
assert( set_pop(s) == (void *) 2 );
uintptr_t i;
for(i = 1; i < N; i++)
SET_INS(s, set_membership, i);
uintptr_t sum = 0;
uintptr_t sum_z = set_size(s);
set_first_element(s);
while( (i = (uintptr_t) set_pop(s)) )
{
sum += i;
sum_z += set_size(s);
}
assert( sum == ((N * (N - 1)) / 2) );
assert( sum_z == ((N * (N - 1)) / 2) );
return 0;
}
EOF
return $?
}
run()
{
./"$exe"
return $?
}
clean()
{
rm -f "$exe"
return 0
}
dispatch "$@"
# vim: set noexpandtab tabstop=4:
|
