pptp/vector_test.c at master · quozl/pptp · GitHub

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
/* vector_test.c .... Test the vector package.
 *                    C. Scott Ananian <cananian@alumni.princeton.edu>
 *
 * $Id: vector_test.c,v 1.2 2003/06/17 17:25:47 reink Exp $
 */

#include <stdlib.h>
#include <assert.h>
#include "vector.h"

#define MAX 25

void main(void) {
    int i, j, *d, retval;

    VECTOR *v = vector_create();
    assert(v != NULL);
    assert(vector_size(v)==0);
    for (i=0; i<=MAX; i++) {
        assert(!vector_contains(v, i));
        assert(!vector_remove(v, i));
        assert(!vector_search(v, i, (PPTP_CALL **)&j));
        retval = vector_scan(v, i, MAX*2, &j);
        assert(retval);
        assert(j==i);
    }

    for (i=1; i<=MAX; i++) {
        d = malloc(sizeof(int));
        *d = i;
        retval = vector_insert(v, i, (PPTP_CALL *)d);
        assert(retval);
        assert(vector_size(v)==i);
    }
    for (i=1; i<MAX; i++) {
        retval = vector_search(v, i, (PPTP_CALL **)&d);
        assert(retval);
        assert(*d==i);
        retval = vector_contains(v, i);
        assert(retval);
    }
    assert(vector_size(v)==MAX);
    retval = vector_contains(v, MAX+1);
    assert(!retval);
    retval = vector_search(v, MAX+1, (PPTP_CALL **)&j);
    assert(!retval);

    retval = vector_scan(v, 0, MAX, &j);
    assert(retval);
    assert(j==0);
    retval = vector_scan(v, 1, MAX, &j);
    assert(!retval);
    retval = vector_scan(v, 1, MAX+1, &j);
    assert(retval);
    assert(j==MAX+1);
    retval = vector_scan(v, 1, MAX+MAX, &j);
    assert(retval);
    assert(j==MAX+1);

    for (i=0; i<(MAX*10); i++) {
        int k = (random() % MAX) + 1;
        assert(vector_contains(v, k));
        assert(!vector_scan(v, 1, k, &j));
        assert(!vector_scan(v, k, MAX, &j));
        retval = vector_remove(v, k);
        assert(retval);
        assert(vector_size(v)==MAX-1);
        assert(!vector_contains(v, k));
        assert(!vector_search(v, k, (PPTP_CALL **) &j));
        retval = vector_scan(v, 1, MAX, &j);
        assert(retval);
        assert(j==k);
        d = malloc(sizeof(int));
        *d = k;
        retval = vector_insert(v, k, (PPTP_CALL *) d);
        assert(retval);
        assert(vector_size(v)==MAX);
        assert(vector_contains(v, k));
        assert(!vector_scan(v, 1, MAX, &j));
        retval = vector_search(v, k, (PPTP_CALL **) &d);
        assert(retval);
        assert(*d==k);
    }

    for (i=1; i<=MAX; i++) {
        assert(vector_size(v)==MAX-(i-1));
        vector_remove(v, i);
        assert(vector_size(v)==MAX-i);
        assert(!vector_contains(v, i));
        retval = vector_search(v, i, (PPTP_CALL **) &j);
        assert(!retval);
        retval = vector_scan(v, 1, MAX, &j);
        assert(retval);
        assert(j==1);
    }
    assert(vector_size(v)==0);
    vector_destroy(v);
    exit(0);
}