test/que.h

   1 #define MAIN_(x) A_CAST_2(x, _que)
   2 #include "test.h"
   3 #include "a/que.h"
   4
   5 static void dtor(void *ptr)
   6 {
   7     a_u32 *obj = a_u32_(*, ptr);
   8     printf("%" PRIu32 " ", *obj);
   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         (void)(a_que_pull_fore(a_u64, ctx));
  43     }
  44     a_que_edit(ctx, sizeof(a_u32), 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     (void)(a_que_remove(a_u32, ctx, 0));
  64     (void)(a_que_remove(a_u32, 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_(ctx, 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         (void)(a_que_pull_back(a_u32, ctx));
  86     }
  87     for (a_u32 i = 0; i != 5; ++i)
  88     {
  89         (void)(a_que_pull_fore(a_u32, ctx));
  90     }
  91     a_que_die(ctx, dtor);
  92     putchar('\n');
  93 }
  94
  95 #include <time.h>
  96
  97 static int cmp(void const *lhs, void const *rhs)
  98 {
  99     return *a_int_(const *, lhs) - *a_int_(const *, rhs);
 100 }
 101
 102 static int cmpr(void const *lhs, void const *rhs)
 103 {
 104     return *a_int_(const *, rhs) - *a_int_(const *, lhs);
 105 }
 106
 107 static void test_sort(void)
 108 {
 109     unsigned int t = a_cast_s(unsigned int, time(A_NULL));
 110     a_que *ctx = a_que_new(sizeof(int));
 111
 112     srand(t);
 113     a_que_drop(ctx, A_NULL);
 114     for (int i = 0; i != 10; ++i)
 115     {
 116         int *obj = a_que_push_fore(int, ctx);
 117         if (obj)
 118         {
 119             *obj = rand() % 10; // NOLINT
 120             printf("%i ", *obj);
 121             a_que_sort_fore(ctx, cmp);
 122         }
 123     }
 124     printf("-> ");
 125     a_que_foreach(int, it, ctx)
 126     {
 127         printf("%i ", *it);
 128     }
 129
 130     srand(t);
 131     printf("-> ");
 132     a_que_drop(ctx, dtor);
 133     putchar('\n');
 134     for (int i = 0; i != 10; ++i)
 135     {
 136         int *obj = a_que_push_back(int, ctx);
 137         if (obj)
 138         {
 139             *obj = rand() % 10; // NOLINT
 140             printf("%i ", *obj);
 141             a_que_sort_back(ctx, cmpr);
 142         }
 143     }
 144     printf("-> ");
 145     a_que_foreach(int, it, ctx)
 146     {
 147         printf("%i ", *it);
 148     }
 149
 150     printf("-> ");
 151     a_que_die(ctx, dtor);
 152     putchar('\n');
 153 }
 154
 155 int MAIN(int argc, char *argv[]) // NOLINT(misc-definitions-in-headers)
 156 {
 157     (void)(argc);
 158     (void)(argv);
 159     printf("%s\n", A_FUNC);
 160     test();
 161     test_sort();
 162     return 0;
 163 }