6 #define ARRAY_LEN(a) (sizeof(a)/sizeof(*a))
8 int cmpint(const void *a, const void *b, void *aux)
11 return *(int*)a - *(int*)b;
16 int ivals[] = {0,1,2,3,4,5,6,7,8,9},
17 ivals2[] = {10,11,12,13,14,15,16,17,18,19};
19 vector *vint = v_new(NULL);
20 assert(v_length(vint) == 0);
21 assert(v_is_empty(vint));
23 for (i = 0; i < ARRAY_LEN(ivals); i++)
24 v_prepend(vint, ivals+i);
25 assert(v_length(vint) == ARRAY_LEN(ivals));
26 assert(*(int*)v_first(vint) == 9);
27 assert(*(int*)v_remove_first(vint) == 9);
28 assert(*(int*)v_remove_first(vint) == 8);
29 v_sort(vint, cmpint, NULL);
30 assert(*(int*)v_first(vint) == 0);
33 assert(v_length(vint) == 0);
34 for (i = 0; i < ARRAY_LEN(ivals); i++)
35 v_append(vint, ivals+i);
36 assert(v_length(vint) == ARRAY_LEN(ivals));
37 assert(*(int*)v_last(vint) == 9);
38 assert(*(int*)v_remove_last(vint) == 9);
39 assert(*(int*)v_remove_last(vint) == 8);
41 assert(v_find_index(vint, ivals+5, cmpint, NULL) == 5);
42 v_insert(vint, 5, ivals2+5);
43 assert(v_find_index(vint, ivals2+5, cmpint, NULL) == 5);
45 assert(v_find_index(vint, ivals2+5, cmpint, NULL) == 6);
47 assert(v_find_index(vint, ivals2+5, cmpint, NULL) == SIZE_MAX);
48 assert(v_find_last_index(vint, ivals2+5, cmpint, NULL) == SIZE_MAX);
51 int revme_even[] = {1,2};
52 for (i = 0; i < ARRAY_LEN(revme_even); i++)
53 v_append(vint, revme_even+i);
55 assert(*(int*)v_at(vint, 0) == 2);
56 assert(*(int*)v_at(vint, 1) == 1);
59 int revme_odd[] = {1,2,3};
60 for (i = 0; i < ARRAY_LEN(revme_odd); i++)
61 v_append(vint, revme_odd+i);
63 assert(*(int*)v_at(vint, 0) == 3);
64 assert(*(int*)v_at(vint, 1) == 2);
65 assert(*(int*)v_at(vint, 2) == 1);