test/vec.h

   1 #define MAIN(x) vec##x
   2 #include "test.h"
   3 #include "a/vec.h"
   4
   5 static void dtor(void *ptr)
   6 {
   7     a_u32 *obj = a_u32_(*, ptr);
   8     printf("%" PRIu32 " ", *obj);
   9 }
  10
  11 static int u32dup(void *dst, void const *src)
  12 {
  13     *a_u32_(*, dst) = *a_u32_(const *, src);
  14     printf("%" PRIu32 " ", *a_u32_(const *, src));
  15     return 0;
  16 }
  17
  18 static void test(void)
  19 {
  20     a_u32 i, *it, *at;
  21     a_vec *ctx = a_vec_new(sizeof(a_u64));
  22
  23     for (i = 0; i != 10; ++i)
  24     {
  25         a_u64 *obj = A_VEC_PUSH(a_u64, ctx);
  26         if (obj) { *obj = i; }
  27     }
  28     a_vec_edit(ctx, sizeof(a_u32), A_NULL);
  29     for (i = 0; i != 20; ++i)
  30     {
  31         a_u32 *obj = A_VEC_PUSH(a_u32, ctx);
  32         if (obj) { *obj = i; }
  33     }
  34     for (i = 0; i != 10; ++i)
  35     {
  36         a_vec_pull(ctx);
  37     }
  38
  39     {
  40         a_u8 *end = A_VEC_END(a_u8, ctx);
  41         a_u8 *top = A_VEC_TOP(a_u8, ctx);
  42         TEST_BUG(a_vec_siz(ctx) == a_size_c(end - top));
  43     }
  44
  45     a_vec_swap(ctx, 0, 0);
  46     a_vec_swap(ctx, 0, ~0U);
  47     a_vec_swap(ctx, ~0U, 0);
  48     a_vec_swap(ctx, 4, 6);
  49     a_vec_swap(ctx, 6, 4);
  50
  51     A_VEC_FORENUM(a_u32, i, ctx)
  52     {
  53         it = A_VEC_AT(a_u32, ctx, i);
  54         TEST_BUG(a_vec_siz(ctx) == sizeof(*it));
  55         if (it) { printf("%" PRIu32 " ", *it); }
  56     }
  57     (void)putchar('\n');
  58     A_VEC_FORENUM_REVERSE(a_u32, i, ctx)
  59     {
  60         it = A_VEC_AT(a_u32, ctx, i);
  61         TEST_BUG(a_vec_siz(ctx) == sizeof(*it));
  62         if (it) { printf("%" PRIu32 " ", *it); }
  63     }
  64     (void)putchar('\n');
  65
  66     A_VEC_FOREACH(a_u32 *, it, at, ctx)
  67     {
  68         TEST_BUG(a_vec_siz(ctx) == sizeof(*it));
  69         TEST_BUG(sizeof(a_u32) == sizeof(*it));
  70         printf("%" PRIu32 " ", *it);
  71     }
  72     (void)putchar('\n');
  73     A_VEC_FOREACH_REVERSE(a_u32 *, it, at, ctx)
  74     {
  75         TEST_BUG(a_vec_siz(ctx) == sizeof(*it));
  76         TEST_BUG(sizeof(a_u32) == sizeof(*it));
  77         printf("%" PRIu32 " ", *it);
  78     }
  79     (void)putchar('\n');
  80
  81     {
  82         a_vec obj;
  83         a_vec_copy(&obj, ctx, u32dup);
  84         (void)putchar('\n');
  85         a_vec_dtor(ctx, A_NULL);
  86         a_vec_move(ctx, &obj);
  87     }
  88
  89     a_vec_die(ctx, dtor);
  90     (void)putchar('\n');
  91
  92     {
  93         ctx = a_vec_new(sizeof(a_u32));
  94         for (i = 5; i != 10; ++i)
  95         {
  96             a_u32 *obj = A_VEC_INSERT(a_u32, ctx, i);
  97             if (obj) { *obj = i; }
  98         }
  99         for (i = 0; i != 5; ++i)
 100         {
 101             a_u32 *obj = A_VEC_INSERT(a_u32, ctx, i);
 102             if (obj) { *obj = i; }
 103         }
 104         A_VEC_FOREACH(a_u32 *, it, at, ctx)
 105         {
 106             printf("%" PRIu32 " ", *it);
 107         }
 108         (void)putchar('\n');
 109         for (i = 0; i != 5; ++i)
 110         {
 111             a_u32 *obj = A_VEC_REMOVE(a_u32, ctx, i);
 112             if (obj) { printf("%" PRIu32 " ", *obj); }
 113         }
 114         for (i = 0; i != 5; ++i)
 115         {
 116             a_u32 *obj = A_VEC_REMOVE(a_u32, ctx, 0);
 117             if (obj) { printf("%" PRIu32 " ", *obj); }
 118         }
 119         (void)putchar('\n');
 120         a_vec_die(ctx, A_NULL);
 121     }
 122     {
 123         ctx = a_vec_new(sizeof(a_u32));
 124         for (i = 5; i != 10; ++i)
 125         {
 126             a_u32 *obj = A_VEC_PUSH_BACK(a_u32, ctx);
 127             if (obj) { *obj = i; }
 128         }
 129         for (i = 5; i != 10; ++i)
 130         {
 131             a_u32 *obj = A_VEC_PULL_BACK(a_u32, ctx);
 132             if (obj) { printf("%" PRIu32 " ", *obj); }
 133         }
 134         for (i = 0; i != 5; ++i)
 135         {
 136             a_u32 *obj = A_VEC_PUSH_FORE(a_u32, ctx);
 137             if (obj) { *obj = i; }
 138         }
 139         for (i = 0; i != 5; ++i)
 140         {
 141             a_u32 *obj = A_VEC_PULL_FORE(a_u32, ctx);
 142             if (obj) { printf("%" PRIu32 " ", *obj); }
 143         }
 144         (void)putchar('\n');
 145         a_vec_die(ctx, A_NULL);
 146     }
 147 }
 148
 149 #include "a/str.h"
 150 #include <time.h>
 151
 152 static int small(void const *lhs, void const *rhs)
 153 {
 154     int a = *a_int_(const *, lhs);
 155     int b = *a_int_(const *, rhs);
 156     return (a > b) - (a < b);
 157 }
 158
 159 static int large(void const *lhs, void const *rhs)
 160 {
 161     int a = *a_int_(const *, lhs);
 162     int b = *a_int_(const *, rhs);
 163     return (a < b) - (a > b);
 164 }
 165
 166 static int rand10(void)
 167 {
 168     return a_cast_s(int, rand() / a_cast_s(double, RAND_MAX) * 10); /* NOLINT */
 169 }
 170
 171 static void test_sort(void)
 172 {
 173     unsigned int t = a_cast_s(unsigned int, time(A_NULL));
 174     a_vec *ctx = a_vec_new(sizeof(int));
 175     int i, x, *it, *at;
 176
 177     a_vec_make(ctx, 10, A_NULL);
 178
 179     x = -1;
 180     srand(t);
 181     A_VEC_FOREACH(int *, it, at, ctx)
 182     {
 183         *it = rand10();
 184         printf("%i ", *it);
 185     }
 186     printf("-> ");
 187     a_vec_sort(ctx, large);
 188     A_VEC_FOREACH(int *, it, at, ctx)
 189     {
 190         if (x >= 0) { TEST_BUG(x >= *it); }
 191         printf("%i ", *it);
 192         x = *it;
 193     }
 194     (void)putchar('\n');
 195
 196     x = -1;
 197     srand(t);
 198     A_VEC_FOREACH(int *, it, at, ctx)
 199     {
 200         *it = rand10();
 201         printf("%i ", *it);
 202     }
 203     printf("-> ");
 204     a_vec_sort(ctx, small);
 205     A_VEC_FOREACH(int *, it, at, ctx)
 206     {
 207         if (x >= 0) { TEST_BUG(x <= *it); }
 208         printf("%i ", *it);
 209         x = *it;
 210     }
 211     (void)putchar('\n');
 212
 213     x = -1;
 214     srand(t);
 215     a_vec_drop(ctx, A_NULL);
 216     for (i = 0; i != 10; ++i)
 217     {
 218         int *obj = A_VEC_PUSH_FORE(int, ctx);
 219         if (obj)
 220         {
 221             *obj = rand10();
 222             printf("%i ", *obj);
 223             a_vec_sort_fore(ctx, small);
 224         }
 225     }
 226     printf("-> ");
 227     A_VEC_FOREACH(int *, it, at, ctx)
 228     {
 229         if (x >= 0) { TEST_BUG(x <= *it); }
 230         printf("%i ", *it);
 231         x = *it;
 232     }
 233     (void)putchar('\n');
 234
 235     x = -1;
 236     srand(t);
 237     a_vec_drop(ctx, A_NULL);
 238     for (i = 0; i != 10; ++i)
 239     {
 240         int *obj = A_VEC_PUSH_BACK(int, ctx);
 241         if (obj)
 242         {
 243             *obj = rand10();
 244             printf("%i ", *obj);
 245             a_vec_sort_back(ctx, small);
 246         }
 247     }
 248     printf("-> ");
 249     A_VEC_FOREACH(int *, it, at, ctx)
 250     {
 251         if (x >= 0) { TEST_BUG(x <= *it); }
 252         printf("%i ", *it);
 253         x = *it;
 254     }
 255     (void)putchar('\n');
 256
 257     x = -1;
 258     srand(t);
 259     a_vec_drop(ctx, A_NULL);
 260     for (i = 0; i != 10; ++i)
 261     {
 262         int key = rand10();
 263         int *obj = A_VEC_PUSH_SORT(int, ctx, &key, small);
 264         if (obj)
 265         {
 266             printf("%i ", key);
 267             *obj = key;
 268         }
 269     }
 270     printf("-> ");
 271     A_VEC_FOREACH(int *, it, at, ctx)
 272     {
 273         if (x >= 0) { TEST_BUG(x <= *it); }
 274         printf("%i ", *it);
 275         x = *it;
 276     }
 277     (void)putchar('\n');
 278
 279     {
 280         a_str *ok = a_str_new();
 281         a_str *no = a_str_new();
 282         a_str_puts(ok, "finding ");
 283         a_str_puts(no, "missing ");
 284         for (i = 0; i != 10; ++i)
 285         {
 286             int *obj = A_VEC_SEARCH(int, ctx, &i, small);
 287             if (obj)
 288             {
 289                 a_str_putf(ok, "%i ", *obj);
 290             }
 291             else
 292             {
 293                 a_str_putf(no, "%i ", i);
 294             }
 295         }
 296         printf("%s\n%s\n", a_str_ptr(ok), a_str_ptr(no));
 297         a_str_die(ok);
 298         a_str_die(no);
 299     }
 300
 301     a_vec_die(ctx, A_NULL);
 302 }
 303
 304 int main(int argc, char *argv[]) /* NOLINT(misc-definitions-in-headers) */
 305 {
 306     puts(A_FUNC);
 307     test();
 308     test_sort();
 309     (void)argc;
 310     (void)argv;
 311     return 0;
 312 }