test/que.h

   1 #define MAIN(x) que##x
   2 #include "test.h"
   3 #include "a/que.h"
   4
   5 static void dtor(void *ptr)
   6 {
   7     a_u32 *u = a_u32_(*, ptr);
   8     printf("%" PRIu32 " ", *u);
   9 }
  10
  11 static void test(void)
  12 {
  13     a_que *ctx = a_que_new(sizeof(a_u64));
  14     for (a_u64 i = 0; i != 10; ++i)
  15     {
  16         a_u64 *obj = A_QUE_PUSH_BACK(a_u64, ctx);
  17         if (obj) { *obj = i; }
  18     }
  19     {
  20         a_u64 *fore = A_QUE_FORE_(a_u64, ctx);
  21         a_u64 *back = A_QUE_BACK_(a_u64, ctx);
  22         printf("%" PRIu64 " %" PRIu64 " ", *fore, *back);
  23     }
  24     {
  25         a_u64 *fore = A_QUE_FORE(a_u64, ctx);
  26         a_u64 *back = A_QUE_BACK(a_u64, ctx);
  27         if (fore && back)
  28         {
  29             printf("%" PRIu64 " %" PRIu64 " ", *fore, *back);
  30         }
  31     }
  32     {
  33         a_u64 *fore = A_QUE_AT(a_u64, ctx, 0);
  34         a_u64 *back = A_QUE_AT(a_u64, ctx, ~0);
  35         if (fore && back)
  36         {
  37             printf("%" PRIu64 " %" PRIu64 "\n", *fore, *back);
  38         }
  39     }
  40     for (a_u64 i = 0; i != 5; ++i)
  41     {
  42         a_que_pull_fore(ctx);
  43     }
  44     a_que_edit(ctx, sizeof(a_u32) + 8, A_NULL);
  45     for (a_u32 i = 5; i--;)
  46     {
  47         a_u32 *obj = A_QUE_PUSH_FORE(a_u32, ctx);
  48         if (obj) { *obj = i; }
  49     }
  50     for (a_u32 i = 5; i != 10; ++i)
  51     {
  52         a_u32 *obj = A_QUE_PUSH_BACK(a_u32, ctx);
  53         if (obj) { *obj = i; }
  54     }
  55     {
  56         a_u32 *obj = A_QUE_INSERT(a_u32, ctx, 0);
  57         if (obj) { *obj = A_U32_MAX; }
  58     }
  59     {
  60         a_u32 *obj = A_QUE_INSERT(a_u32, ctx, A_SIZE_MAX);
  61         if (obj) { *obj = A_U32_MAX; }
  62     }
  63     a_que_remove(ctx, 0);
  64     a_que_remove(ctx, A_SIZE_MAX);
  65     a_que_swap(ctx, 0, A_SIZE_MAX);
  66     {
  67         a_u32 *lhs = A_QUE_FORE_(a_u32, ctx);
  68         a_u32 *rhs = A_QUE_BACK_(a_u32, ctx);
  69         a_que_swap_(lhs, rhs);
  70     }
  71     a_que_foreach(a_u32, *, it, ctx)
  72     {
  73         TEST_BUG(a_que_siz(ctx) >= sizeof(*it));
  74         printf("%" PRIu32 " ", *it);
  75     }
  76     putchar('\n');
  77     a_que_foreach_reverse(a_u32, *, it, ctx)
  78     {
  79         TEST_BUG(a_que_siz(ctx) >= sizeof(*it));
  80         printf("%" PRIu32 " ", *it);
  81     }
  82     putchar('\n');
  83     for (a_u32 i = 0; i != 5; ++i)
  84     {
  85         a_que_push_back(ctx);
  86     }
  87     for (a_u32 i = 0; i != 5; ++i)
  88     {
  89         a_que_push_fore(ctx);
  90     }
  91     a_que_die(ctx, dtor);
  92     putchar('\n');
  93 }
  94
  95 #include <time.h>
  96
  97 static int small(void const *lhs, void const *rhs)
  98 {
  99     int a = *a_int_(const *, lhs);
 100     int b = *a_int_(const *, rhs);
 101     return (a > b) - (a < b);
 102 }
 103
 104 static int large(void const *lhs, void const *rhs)
 105 {
 106     int a = *a_int_(const *, lhs);
 107     int b = *a_int_(const *, rhs);
 108     return (a < b) - (a > b);
 109 }
 110
 111 static int rand10(void)
 112 {
 113     return a_cast_s(int, rand() / a_cast_s(double, RAND_MAX) * 10); // NOLINT
 114 }
 115
 116 static void test_sort(void)
 117 {
 118     unsigned int t = a_cast_s(unsigned int, time(A_NULL));
 119     a_que *ctx = a_que_new(sizeof(int));
 120     int x;
 121
 122     x = -1;
 123     srand(t);
 124     a_que_drop(ctx, A_NULL);
 125     for (int i = 0; i != 10; ++i)
 126     {
 127         int *obj = A_QUE_PUSH_FORE(int, ctx);
 128         if (obj)
 129         {
 130             *obj = rand10();
 131             printf("%i ", *obj);
 132             a_que_sort_fore(ctx, small);
 133         }
 134     }
 135     printf("-> ");
 136     a_que_foreach(int, *, it, ctx)
 137     {
 138         if (x >= 0) { TEST_BUG(x <= *it); }
 139         printf("%i ", *it);
 140         x = *it;
 141     }
 142
 143     x = -1;
 144     srand(t);
 145     printf("-> ");
 146     a_que_drop(ctx, dtor);
 147     putchar('\n');
 148     for (int i = 0; i != 10; ++i)
 149     {
 150         int *obj = A_QUE_PUSH_BACK(int, ctx);
 151         if (obj)
 152         {
 153             *obj = rand10();
 154             printf("%i ", *obj);
 155             a_que_sort_back(ctx, large);
 156         }
 157     }
 158     printf("-> ");
 159     a_que_foreach(int, *, it, ctx)
 160     {
 161         if (x >= 0) { TEST_BUG(x >= *it); }
 162         printf("%i ", *it);
 163         x = *it;
 164     }
 165
 166     x = -1;
 167     srand(t);
 168     printf("-> ");
 169     a_que_drop(ctx, dtor);
 170     putchar('\n');
 171     for (int i = 0; i != 10; ++i)
 172     {
 173         int key = rand10();
 174         int *obj = A_QUE_PUSH_SORT(int, ctx, &key, small);
 175         if (obj)
 176         {
 177             printf("%i ", key);
 178             *obj = key;
 179         }
 180     }
 181     printf("-> ");
 182     a_que_foreach(int, *, it, ctx)
 183     {
 184         if (x >= 0) { TEST_BUG(x <= *it); }
 185         printf("%i ", *it);
 186         x = *it;
 187     }
 188
 189     printf("-> ");
 190     a_que_die(ctx, dtor);
 191     putchar('\n');
 192 }
 193
 194 int main(int argc, char *argv[]) // NOLINT(misc-definitions-in-headers)
 195 {
 196     (void)argc;
 197     (void)argv;
 198     printf("%s\n", A_FUNC);
 199     test();
 200     test_sort();
 201     return 0;
 202 }