5 #include "derp/common.h"
6 #include "derp/vector.h"
9 #include <gc/leak_detector.h>
12 #define ARRAY_LEN(a) (sizeof(a)/sizeof(*a))
14 int cmpint(const void *a, const void *b, void *aux)
17 return *(int*)a - *(int*)b;
24 derp_use_alloc_funcs(GC_malloc, GC_realloc, GC_free);
27 int ivals[] = {0,1,2,3,4,5,6,7,8,9},
28 ivals2[] = {10,11,12,13,14,15,16,17,18,19};
30 vector *vint = v_new();
31 assert(v_length(vint) == 0);
32 assert(v_capacity(vint) > 0);
33 assert(v_is_empty(vint));
34 assert(!v_at(vint, 0));
35 assert(!v_at(vint, 1337));
37 size_t too_big = SIZE_MAX;
38 /* too large a number for our address space */
39 assert(v_reserve_capacity(vint, too_big) < too_big);
40 /* still too large for address space */
41 too_big = 1 + SIZE_MAX/sizeof(void*);
42 /* technically possible, but not on today's machines */
44 assert(v_reserve_capacity(vint, too_big) < too_big);
46 v_set_length(vint, 2);
47 assert(v_length(vint) == 2);
48 assert(v_at(vint, 0) == NULL);
49 assert(v_at(vint, 1) == NULL);
52 for (i = 0; i < ARRAY_LEN(ivals); i++)
53 v_prepend(vint, ivals+i);
54 assert(v_length(vint) == ARRAY_LEN(ivals));
55 assert(*(int*)v_first(vint) == 9);
56 assert(*(int*)v_remove_first(vint) == 9);
57 assert(*(int*)v_remove_first(vint) == 8);
58 v_sort(vint, cmpint, NULL);
59 assert(*(int*)v_first(vint) == 0);
62 assert(v_length(vint) == 0);
63 for (i = 0; i < ARRAY_LEN(ivals); i++)
64 v_append(vint, ivals+i);
65 assert(v_length(vint) == ARRAY_LEN(ivals));
66 assert(*(int*)v_last(vint) == 9);
67 assert(*(int*)v_remove_last(vint) == 9);
68 assert(*(int*)v_remove_last(vint) == 8);
70 assert(v_find_index(vint, ivals+5, cmpint, NULL) == 5);
71 v_insert(vint, 5, ivals2+5);
72 assert(v_find_index(vint, ivals2+5, cmpint, NULL) == 5);
74 assert(v_find_index(vint, ivals2+5, cmpint, NULL) == 6);
75 assert(v_find_last_index(vint, ivals2+5, cmpint, NULL) == 6);
77 assert(v_find_index(vint, ivals2+5, cmpint, NULL) == SIZE_MAX);
78 assert(v_find_last_index(vint, ivals2+5, cmpint, NULL) == SIZE_MAX);
80 assert(v_find_last_index(vint, v_last(vint), cmpint, NULL)
84 int revme_even[] = {1,2};
85 for (i = 0; i < ARRAY_LEN(revme_even); i++)
86 v_append(vint, revme_even+i);
88 assert(*(int*)v_at(vint, 0) == 2);
89 assert(*(int*)v_at(vint, 1) == 1);
92 int revme_odd[] = {1,2,3};
93 for (i = 0; i < ARRAY_LEN(revme_odd); i++)
94 v_append(vint, revme_odd+i);
96 assert(*(int*)v_at(vint, 0) == 3);
97 assert(*(int*)v_at(vint, 1) == 2);
98 assert(*(int*)v_at(vint, 2) == 1);
100 v_set_length(vint, 1024);
101 assert(v_at(vint, 1023) == NULL);
102 v_append(vint, ivals);
103 assert(*(int*)v_at(vint, 1024) == 0);
106 /* test for memory leak */
107 v_dtor(vint, derp_free, NULL);
108 int *life = malloc(sizeof *life);
110 v_append(vint, life);