Sat, 13 Jan 2024 17:51:42 +0100
add CX_DISABLE_ARRAY_LIST_SWAP_SBO flag
universe@798 | 1 | /* |
universe@798 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@798 | 3 | * |
universe@798 | 4 | * Copyright 2023 Mike Becker, Olaf Wintermann All rights reserved. |
universe@798 | 5 | * |
universe@798 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@798 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@798 | 8 | * |
universe@798 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@798 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@798 | 11 | * |
universe@798 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@798 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@798 | 14 | * documentation and/or other materials provided with the distribution. |
universe@798 | 15 | * |
universe@798 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@798 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@798 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@798 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@798 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@798 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@798 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@798 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@798 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@798 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@798 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@798 | 27 | */ |
universe@798 | 28 | |
universe@798 | 29 | #include "cx/test.h" |
universe@798 | 30 | #include "util_allocator.h" |
universe@798 | 31 | #include "cx/compare.h" |
universe@803 | 32 | #include "cx/utils.h" |
universe@798 | 33 | |
universe@798 | 34 | #include "cx/array_list.h" |
universe@798 | 35 | #include "cx/linked_list.h" |
universe@798 | 36 | |
universe@798 | 37 | #include <stdarg.h> |
universe@798 | 38 | |
universe@798 | 39 | typedef struct node { |
universe@798 | 40 | struct node *next; |
universe@798 | 41 | struct node *prev; |
universe@798 | 42 | int data; |
universe@798 | 43 | } node; |
universe@798 | 44 | |
universe@798 | 45 | const ptrdiff_t loc_prev = offsetof(struct node, prev); |
universe@798 | 46 | const ptrdiff_t loc_next = offsetof(struct node, next); |
universe@798 | 47 | const ptrdiff_t loc_data = offsetof(struct node, data); |
universe@798 | 48 | |
universe@798 | 49 | static node *create_nodes_test_data(size_t len) { |
universe@798 | 50 | node *begin = calloc(1, sizeof(node)); |
universe@798 | 51 | void *prev = begin; |
universe@798 | 52 | for (size_t i = 1; i < len; i++) { |
universe@798 | 53 | node *n = calloc(1, sizeof(node)); |
universe@798 | 54 | cx_linked_list_link(prev, n, loc_prev, loc_next); |
universe@798 | 55 | prev = n; |
universe@798 | 56 | } |
universe@798 | 57 | return begin; |
universe@798 | 58 | } |
universe@798 | 59 | |
universe@798 | 60 | void assign_nodes_test_data(node *n, ...) { |
universe@798 | 61 | va_list ap; |
universe@798 | 62 | va_start(ap, n); |
universe@798 | 63 | while (n != NULL) { |
universe@798 | 64 | n->data = va_arg(ap, int); |
universe@798 | 65 | n = n->next; |
universe@798 | 66 | } |
universe@798 | 67 | va_end(ap); |
universe@798 | 68 | } |
universe@798 | 69 | |
universe@798 | 70 | static void destroy_nodes_test_data(node *n) { |
universe@798 | 71 | while (n != NULL) { |
universe@798 | 72 | void *next = n->next; |
universe@798 | 73 | free(n); |
universe@798 | 74 | n = next; |
universe@798 | 75 | } |
universe@798 | 76 | } |
universe@798 | 77 | |
universe@798 | 78 | static int *int_test_data(size_t len) { |
universe@798 | 79 | int *data = malloc(len*sizeof(int)); |
universe@798 | 80 | for (size_t i = 0 ; i < len ; i++) { |
universe@798 | 81 | data[i] = rand(); // NOLINT(*-msc50-cpp) |
universe@798 | 82 | } |
universe@798 | 83 | return data; |
universe@798 | 84 | } |
universe@798 | 85 | |
universe@798 | 86 | CX_TEST(test_linked_list_link_unlink) { |
universe@798 | 87 | node a = {0}, b = {0}, c = {0}; |
universe@798 | 88 | |
universe@798 | 89 | CX_TEST_DO { |
universe@798 | 90 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@798 | 91 | CX_TEST_ASSERT(a.prev == NULL); |
universe@798 | 92 | CX_TEST_ASSERT(a.next == &b); |
universe@798 | 93 | CX_TEST_ASSERT(b.prev == &a); |
universe@798 | 94 | CX_TEST_ASSERT(b.next == NULL); |
universe@798 | 95 | |
universe@798 | 96 | cx_linked_list_unlink(&a, &b, loc_prev, loc_next); |
universe@798 | 97 | CX_TEST_ASSERT(a.prev == NULL); |
universe@798 | 98 | CX_TEST_ASSERT(a.next == NULL); |
universe@798 | 99 | CX_TEST_ASSERT(b.prev == NULL); |
universe@798 | 100 | CX_TEST_ASSERT(b.next == NULL); |
universe@798 | 101 | |
universe@798 | 102 | cx_linked_list_link(&b, &c, loc_prev, loc_next); |
universe@798 | 103 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@798 | 104 | cx_linked_list_unlink(&b, &c, loc_prev, loc_next); |
universe@798 | 105 | CX_TEST_ASSERT(a.prev == NULL); |
universe@798 | 106 | CX_TEST_ASSERT(a.next == &b); |
universe@798 | 107 | CX_TEST_ASSERT(b.prev == &a); |
universe@798 | 108 | CX_TEST_ASSERT(b.next == NULL); |
universe@798 | 109 | CX_TEST_ASSERT(c.prev == NULL); |
universe@798 | 110 | CX_TEST_ASSERT(c.next == NULL); |
universe@798 | 111 | } |
universe@798 | 112 | } |
universe@798 | 113 | |
universe@798 | 114 | CX_TEST(test_linked_list_at) { |
universe@798 | 115 | node a = {0}, b = {0}, c = {0}, d = {0}; |
universe@798 | 116 | |
universe@798 | 117 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@798 | 118 | cx_linked_list_link(&b, &c, loc_prev, loc_next); |
universe@798 | 119 | cx_linked_list_link(&c, &d, loc_prev, loc_next); |
universe@798 | 120 | |
universe@798 | 121 | CX_TEST_DO { |
universe@798 | 122 | CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 0) == &a); |
universe@798 | 123 | CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 1) == &b); |
universe@798 | 124 | CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 2) == &c); |
universe@798 | 125 | CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 3) == &d); |
universe@798 | 126 | CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 4) == NULL); |
universe@798 | 127 | CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_prev, 0) == &a); |
universe@798 | 128 | CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_next, 1) == &b); |
universe@798 | 129 | CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_next, 2) == &c); |
universe@798 | 130 | CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_next, 3) == &d); |
universe@798 | 131 | CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_next, 4) == NULL); |
universe@798 | 132 | CX_TEST_ASSERT(cx_linked_list_at(&d, 3, loc_prev, 0) == &a); |
universe@798 | 133 | CX_TEST_ASSERT(cx_linked_list_at(&d, 3, loc_prev, 1) == &b); |
universe@798 | 134 | } |
universe@798 | 135 | } |
universe@798 | 136 | |
universe@798 | 137 | CX_TEST(test_linked_list_find) { |
universe@798 | 138 | void *list = create_nodes_test_data(4); |
universe@798 | 139 | assign_nodes_test_data(list, 2, 4, 6, 8); |
universe@798 | 140 | CX_TEST_DO { |
universe@798 | 141 | int s; |
universe@798 | 142 | s = 2; |
universe@798 | 143 | CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) == 0); |
universe@798 | 144 | s = 4; |
universe@798 | 145 | CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) == 1); |
universe@798 | 146 | s = 6; |
universe@798 | 147 | CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) == 2); |
universe@798 | 148 | s = 8; |
universe@798 | 149 | CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) == 3); |
universe@798 | 150 | s = 10; |
universe@798 | 151 | CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) < 0); |
universe@798 | 152 | s = -2; |
universe@798 | 153 | CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) < 0); |
universe@798 | 154 | } |
universe@798 | 155 | destroy_nodes_test_data(list); |
universe@798 | 156 | } |
universe@798 | 157 | |
universe@798 | 158 | CX_TEST(test_linked_list_compare) { |
universe@798 | 159 | void *la = create_nodes_test_data(4); |
universe@798 | 160 | void *lb = create_nodes_test_data(3); |
universe@798 | 161 | void *lc = create_nodes_test_data(4); |
universe@798 | 162 | assign_nodes_test_data(la, 2, 4, 6, 8); |
universe@798 | 163 | assign_nodes_test_data(lb, 2, 4, 6); |
universe@798 | 164 | assign_nodes_test_data(lc, 2, 4, 6, 9); |
universe@798 | 165 | CX_TEST_DO { |
universe@798 | 166 | CX_TEST_ASSERT(cx_linked_list_compare(la, lb, loc_next, loc_data, cx_cmp_int) > 0); |
universe@798 | 167 | CX_TEST_ASSERT(cx_linked_list_compare(lb, la, loc_next, loc_data, cx_cmp_int) < 0); |
universe@798 | 168 | CX_TEST_ASSERT(cx_linked_list_compare(lc, la, loc_next, loc_data, cx_cmp_int) > 0); |
universe@798 | 169 | CX_TEST_ASSERT(cx_linked_list_compare(la, lc, loc_next, loc_data, cx_cmp_int) < 0); |
universe@798 | 170 | CX_TEST_ASSERT(cx_linked_list_compare(la, la, loc_next, loc_data, cx_cmp_int) == 0); |
universe@798 | 171 | } |
universe@798 | 172 | destroy_nodes_test_data(la); |
universe@798 | 173 | destroy_nodes_test_data(lb); |
universe@798 | 174 | destroy_nodes_test_data(lc); |
universe@798 | 175 | } |
universe@798 | 176 | |
universe@798 | 177 | CX_TEST(test_linked_list_add) { |
universe@798 | 178 | node nodes[4]; |
universe@798 | 179 | void *begin, *end; |
universe@798 | 180 | CX_TEST_DO { |
universe@798 | 181 | // test with begin, end / prev, next |
universe@798 | 182 | memset(nodes, 0, sizeof(node)*4); |
universe@798 | 183 | end = begin = NULL; |
universe@798 | 184 | |
universe@798 | 185 | cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]); |
universe@798 | 186 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 187 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 188 | CX_TEST_ASSERT(nodes[0].prev == NULL); |
universe@798 | 189 | CX_TEST_ASSERT(nodes[0].next == NULL); |
universe@798 | 190 | |
universe@798 | 191 | cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]); |
universe@798 | 192 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 193 | CX_TEST_ASSERT(end == &nodes[1]); |
universe@798 | 194 | CX_TEST_ASSERT(nodes[0].next == &nodes[1]); |
universe@798 | 195 | CX_TEST_ASSERT(nodes[1].prev == &nodes[0]); |
universe@798 | 196 | |
universe@798 | 197 | // test with begin only / prev, next |
universe@798 | 198 | memset(nodes, 0, sizeof(node)*4); |
universe@798 | 199 | end = begin = NULL; |
universe@798 | 200 | |
universe@798 | 201 | cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[0]); |
universe@798 | 202 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 203 | cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[1]); |
universe@798 | 204 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 205 | CX_TEST_ASSERT(nodes[0].next == &nodes[1]); |
universe@798 | 206 | CX_TEST_ASSERT(nodes[1].prev == &nodes[0]); |
universe@798 | 207 | |
universe@798 | 208 | cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[2]); |
universe@798 | 209 | CX_TEST_ASSERT(nodes[1].next == &nodes[2]); |
universe@798 | 210 | CX_TEST_ASSERT(nodes[2].prev == &nodes[1]); |
universe@798 | 211 | |
universe@798 | 212 | // test with end only / prev, next |
universe@798 | 213 | memset(nodes, 0, sizeof(node)*4); |
universe@798 | 214 | end = begin = NULL; |
universe@798 | 215 | |
universe@798 | 216 | cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[0]); |
universe@798 | 217 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 218 | cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[1]); |
universe@798 | 219 | CX_TEST_ASSERT(end == &nodes[1]); |
universe@798 | 220 | CX_TEST_ASSERT(nodes[0].next == &nodes[1]); |
universe@798 | 221 | CX_TEST_ASSERT(nodes[1].prev == &nodes[0]); |
universe@798 | 222 | |
universe@798 | 223 | cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[2]); |
universe@798 | 224 | CX_TEST_ASSERT(end == &nodes[2]); |
universe@798 | 225 | CX_TEST_ASSERT(nodes[1].next == &nodes[2]); |
universe@798 | 226 | CX_TEST_ASSERT(nodes[2].prev == &nodes[1]); |
universe@798 | 227 | |
universe@798 | 228 | // test with begin, end / next |
universe@798 | 229 | memset(nodes, 0, sizeof(node)*4); |
universe@798 | 230 | end = begin = NULL; |
universe@798 | 231 | |
universe@798 | 232 | cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]); |
universe@798 | 233 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 234 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 235 | cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]); |
universe@798 | 236 | CX_TEST_ASSERT(end == &nodes[1]); |
universe@798 | 237 | CX_TEST_ASSERT(nodes[0].next == &nodes[1]); |
universe@798 | 238 | CX_TEST_ASSERT(nodes[1].prev == NULL); |
universe@798 | 239 | } |
universe@798 | 240 | } |
universe@798 | 241 | |
universe@798 | 242 | CX_TEST(test_linked_list_prepend) { |
universe@798 | 243 | node nodes[4]; |
universe@798 | 244 | void *begin, *end; |
universe@798 | 245 | CX_TEST_DO { |
universe@798 | 246 | // test with begin, end / prev, next |
universe@798 | 247 | memset(nodes, 0, sizeof(node) * 4); |
universe@798 | 248 | end = begin = NULL; |
universe@798 | 249 | |
universe@798 | 250 | cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]); |
universe@798 | 251 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 252 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 253 | CX_TEST_ASSERT(nodes[0].prev == NULL); |
universe@798 | 254 | CX_TEST_ASSERT(nodes[0].next == NULL); |
universe@798 | 255 | |
universe@798 | 256 | cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]); |
universe@798 | 257 | CX_TEST_ASSERT(begin == &nodes[1]); |
universe@798 | 258 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 259 | CX_TEST_ASSERT(nodes[1].next == &nodes[0]); |
universe@798 | 260 | CX_TEST_ASSERT(nodes[0].prev == &nodes[1]); |
universe@798 | 261 | |
universe@798 | 262 | // test with begin only / prev, next |
universe@798 | 263 | memset(nodes, 0, sizeof(node) * 4); |
universe@798 | 264 | end = begin = NULL; |
universe@798 | 265 | |
universe@798 | 266 | cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[0]); |
universe@798 | 267 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 268 | cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[1]); |
universe@798 | 269 | CX_TEST_ASSERT(begin == &nodes[1]); |
universe@798 | 270 | CX_TEST_ASSERT(nodes[1].next == &nodes[0]); |
universe@798 | 271 | CX_TEST_ASSERT(nodes[0].prev == &nodes[1]); |
universe@798 | 272 | |
universe@798 | 273 | cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[2]); |
universe@798 | 274 | CX_TEST_ASSERT(begin == &nodes[2]); |
universe@798 | 275 | CX_TEST_ASSERT(nodes[2].next == &nodes[1]); |
universe@798 | 276 | CX_TEST_ASSERT(nodes[1].prev == &nodes[2]); |
universe@798 | 277 | |
universe@798 | 278 | // test with end only / prev, next |
universe@798 | 279 | memset(nodes, 0, sizeof(node) * 4); |
universe@798 | 280 | end = begin = NULL; |
universe@798 | 281 | |
universe@798 | 282 | cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[0]); |
universe@798 | 283 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 284 | cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[1]); |
universe@798 | 285 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 286 | CX_TEST_ASSERT(nodes[1].next == &nodes[0]); |
universe@798 | 287 | CX_TEST_ASSERT(nodes[0].prev == &nodes[1]); |
universe@798 | 288 | |
universe@798 | 289 | cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[2]); |
universe@798 | 290 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 291 | CX_TEST_ASSERT(nodes[2].next == &nodes[1]); |
universe@798 | 292 | CX_TEST_ASSERT(nodes[1].prev == &nodes[2]); |
universe@798 | 293 | |
universe@798 | 294 | // test with begin, end / next |
universe@798 | 295 | memset(nodes, 0, sizeof(node) * 4); |
universe@798 | 296 | end = begin = NULL; |
universe@798 | 297 | |
universe@798 | 298 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]); |
universe@798 | 299 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 300 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 301 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]); |
universe@798 | 302 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]); |
universe@798 | 303 | CX_TEST_ASSERT(begin == &nodes[2]); |
universe@798 | 304 | CX_TEST_ASSERT(end == &nodes[0]); |
universe@798 | 305 | CX_TEST_ASSERT(nodes[1].next == &nodes[0]); |
universe@798 | 306 | CX_TEST_ASSERT(nodes[2].next == &nodes[1]); |
universe@798 | 307 | CX_TEST_ASSERT(nodes[1].prev == NULL); |
universe@798 | 308 | CX_TEST_ASSERT(nodes[0].prev == NULL); |
universe@798 | 309 | } |
universe@798 | 310 | } |
universe@798 | 311 | |
universe@798 | 312 | CX_TEST(test_linked_list_insert) { |
universe@798 | 313 | node nodes[4]; |
universe@798 | 314 | void *begin, *end; |
universe@798 | 315 | CX_TEST_DO { |
universe@798 | 316 | // insert mid list |
universe@798 | 317 | memset(nodes, 0, sizeof(node) * 4); |
universe@798 | 318 | begin = &nodes[0]; |
universe@798 | 319 | end = &nodes[2]; |
universe@798 | 320 | |
universe@798 | 321 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@798 | 322 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@798 | 323 | |
universe@798 | 324 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]); |
universe@798 | 325 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 326 | CX_TEST_ASSERT(end == &nodes[2]); |
universe@798 | 327 | CX_TEST_ASSERT(nodes[1].next == &nodes[3]); |
universe@798 | 328 | CX_TEST_ASSERT(nodes[2].prev == &nodes[3]); |
universe@798 | 329 | CX_TEST_ASSERT(nodes[3].prev == &nodes[1]); |
universe@798 | 330 | CX_TEST_ASSERT(nodes[3].next == &nodes[2]); |
universe@798 | 331 | |
universe@798 | 332 | // insert end |
universe@798 | 333 | memset(nodes, 0, sizeof(node) * 4); |
universe@798 | 334 | begin = &nodes[0]; |
universe@798 | 335 | end = &nodes[2]; |
universe@798 | 336 | |
universe@798 | 337 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@798 | 338 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@798 | 339 | |
universe@798 | 340 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]); |
universe@798 | 341 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 342 | CX_TEST_ASSERT(end == &nodes[3]); |
universe@798 | 343 | CX_TEST_ASSERT(nodes[2].next == &nodes[3]); |
universe@798 | 344 | CX_TEST_ASSERT(nodes[3].prev == &nodes[2]); |
universe@798 | 345 | CX_TEST_ASSERT(nodes[3].next == NULL); |
universe@798 | 346 | |
universe@798 | 347 | // insert begin |
universe@798 | 348 | memset(nodes, 0, sizeof(node) * 4); |
universe@798 | 349 | begin = &nodes[0]; |
universe@798 | 350 | end = &nodes[2]; |
universe@798 | 351 | |
universe@798 | 352 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@798 | 353 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@798 | 354 | |
universe@798 | 355 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, NULL, &nodes[3]); |
universe@798 | 356 | CX_TEST_ASSERT(begin == &nodes[3]); |
universe@798 | 357 | CX_TEST_ASSERT(end == &nodes[2]); |
universe@798 | 358 | CX_TEST_ASSERT(nodes[0].prev == &nodes[3]); |
universe@798 | 359 | CX_TEST_ASSERT(nodes[3].prev == NULL); |
universe@798 | 360 | CX_TEST_ASSERT(nodes[3].next == &nodes[0]); |
universe@798 | 361 | } |
universe@798 | 362 | } |
universe@798 | 363 | |
universe@798 | 364 | CX_TEST(test_linked_list_insert_chain) { |
universe@798 | 365 | node nodes[5]; |
universe@798 | 366 | void *begin, *end; |
universe@798 | 367 | CX_TEST_DO { |
universe@798 | 368 | // insert mid list |
universe@798 | 369 | memset(nodes, 0, sizeof(node) * 5); |
universe@798 | 370 | begin = &nodes[0]; end = &nodes[2]; |
universe@798 | 371 | |
universe@798 | 372 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@798 | 373 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@798 | 374 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@798 | 375 | |
universe@798 | 376 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], NULL); |
universe@798 | 377 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 378 | CX_TEST_ASSERT(end == &nodes[2]); |
universe@798 | 379 | CX_TEST_ASSERT(nodes[1].next == &nodes[3]); |
universe@798 | 380 | CX_TEST_ASSERT(nodes[2].prev == &nodes[4]); |
universe@798 | 381 | CX_TEST_ASSERT(nodes[3].prev == &nodes[1]); |
universe@798 | 382 | CX_TEST_ASSERT(nodes[4].next == &nodes[2]); |
universe@798 | 383 | |
universe@798 | 384 | // insert end |
universe@798 | 385 | memset(nodes, 0, sizeof(node) * 5); |
universe@798 | 386 | begin = &nodes[0]; end = &nodes[2]; |
universe@798 | 387 | |
universe@798 | 388 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@798 | 389 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@798 | 390 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@798 | 391 | |
universe@798 | 392 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], NULL); |
universe@798 | 393 | CX_TEST_ASSERT(begin == &nodes[0]); |
universe@798 | 394 | CX_TEST_ASSERT(end == &nodes[4]); |
universe@798 | 395 | CX_TEST_ASSERT(nodes[2].next == &nodes[3]); |
universe@798 | 396 | CX_TEST_ASSERT(nodes[3].prev == &nodes[2]); |
universe@798 | 397 | CX_TEST_ASSERT(nodes[4].next == NULL); |
universe@798 | 398 | |
universe@798 | 399 | // insert begin |
universe@798 | 400 | memset(nodes, 0, sizeof(node) * 5); |
universe@798 | 401 | begin = &nodes[0]; end = &nodes[2]; |
universe@798 | 402 | |
universe@798 | 403 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@798 | 404 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@798 | 405 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@798 | 406 | |
universe@798 | 407 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, NULL, &nodes[3], NULL); |
universe@798 | 408 | CX_TEST_ASSERT(begin == &nodes[3]); |
universe@798 | 409 | CX_TEST_ASSERT(end == &nodes[2]); |
universe@798 | 410 | CX_TEST_ASSERT(nodes[0].prev == &nodes[4]); |
universe@798 | 411 | CX_TEST_ASSERT(nodes[3].prev == NULL); |
universe@798 | 412 | CX_TEST_ASSERT(nodes[4].next == &nodes[0]); |
universe@798 | 413 | } |
universe@798 | 414 | } |
universe@798 | 415 | |
universe@798 | 416 | CX_TEST(test_linked_list_first) { |
universe@798 | 417 | node *testdata = create_nodes_test_data(3); |
universe@798 | 418 | void *begin = testdata; |
universe@798 | 419 | CX_TEST_DO { |
universe@798 | 420 | CX_TEST_ASSERT(begin == cx_linked_list_first(testdata, loc_prev)); |
universe@798 | 421 | CX_TEST_ASSERT(begin == cx_linked_list_first(testdata->next, loc_prev)); |
universe@798 | 422 | CX_TEST_ASSERT(begin == cx_linked_list_first(testdata->next->next, loc_prev)); |
universe@798 | 423 | } |
universe@798 | 424 | destroy_nodes_test_data(testdata); |
universe@798 | 425 | } |
universe@798 | 426 | |
universe@798 | 427 | CX_TEST(test_linked_list_last) { |
universe@798 | 428 | node *testdata = create_nodes_test_data(3); |
universe@798 | 429 | void *end = testdata->next->next; |
universe@798 | 430 | CX_TEST_DO { |
universe@798 | 431 | CX_TEST_ASSERT(end == cx_linked_list_last(testdata, loc_next)); |
universe@798 | 432 | CX_TEST_ASSERT(end == cx_linked_list_last(testdata->next, loc_next)); |
universe@798 | 433 | CX_TEST_ASSERT(end == cx_linked_list_last(testdata->next->next, loc_next)); |
universe@798 | 434 | } |
universe@798 | 435 | destroy_nodes_test_data(testdata); |
universe@798 | 436 | } |
universe@798 | 437 | |
universe@798 | 438 | CX_TEST(test_linked_list_prev) { |
universe@798 | 439 | node *testdata = create_nodes_test_data(3); |
universe@798 | 440 | CX_TEST_DO { |
universe@798 | 441 | CX_TEST_ASSERT(cx_linked_list_prev(testdata, loc_next, testdata) == NULL); |
universe@798 | 442 | CX_TEST_ASSERT(cx_linked_list_prev(testdata, loc_next, testdata->next) == testdata); |
universe@798 | 443 | CX_TEST_ASSERT(cx_linked_list_prev(testdata, loc_next, testdata->next->next) == testdata->next); |
universe@798 | 444 | } |
universe@798 | 445 | destroy_nodes_test_data(testdata); |
universe@798 | 446 | } |
universe@798 | 447 | |
universe@798 | 448 | CX_TEST(test_linked_list_remove) { |
universe@798 | 449 | node *testdata = create_nodes_test_data(3); |
universe@798 | 450 | assign_nodes_test_data(testdata, 2, 4, 6); |
universe@798 | 451 | node *first = testdata; |
universe@798 | 452 | node *second = first->next; |
universe@798 | 453 | node *third = second->next; |
universe@798 | 454 | void *begin = testdata; |
universe@798 | 455 | void *end = third; |
universe@798 | 456 | |
universe@798 | 457 | CX_TEST_DO { |
universe@798 | 458 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second); |
universe@798 | 459 | CX_TEST_ASSERT(begin == first); |
universe@798 | 460 | CX_TEST_ASSERT(end == third); |
universe@798 | 461 | CX_TEST_ASSERT(first->prev == NULL); |
universe@798 | 462 | CX_TEST_ASSERT(first->next == third); |
universe@798 | 463 | CX_TEST_ASSERT(third->prev == first); |
universe@798 | 464 | CX_TEST_ASSERT(third->next == NULL); |
universe@798 | 465 | |
universe@798 | 466 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third); |
universe@798 | 467 | CX_TEST_ASSERT(begin == first); |
universe@798 | 468 | CX_TEST_ASSERT(end == first); |
universe@798 | 469 | CX_TEST_ASSERT(first->prev == NULL); |
universe@798 | 470 | CX_TEST_ASSERT(first->next == NULL); |
universe@798 | 471 | |
universe@798 | 472 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first); |
universe@798 | 473 | CX_TEST_ASSERT(begin == NULL); |
universe@798 | 474 | CX_TEST_ASSERT(end == NULL); |
universe@798 | 475 | } |
universe@798 | 476 | // list is not intact anymore, we have to free nodes individually |
universe@798 | 477 | free(first); |
universe@798 | 478 | free(second); |
universe@798 | 479 | free(third); |
universe@798 | 480 | } |
universe@798 | 481 | |
universe@798 | 482 | CX_TEST(test_linked_list_size) { |
universe@798 | 483 | node *td5 = create_nodes_test_data(5); |
universe@798 | 484 | node *td13 = create_nodes_test_data(13); |
universe@798 | 485 | CX_TEST_DO { |
universe@798 | 486 | CX_TEST_ASSERT(cx_linked_list_size(NULL, loc_next) == 0); |
universe@798 | 487 | CX_TEST_ASSERT(cx_linked_list_size(td5, loc_next) == 5); |
universe@798 | 488 | CX_TEST_ASSERT(cx_linked_list_size(td13, loc_next) == 13); |
universe@798 | 489 | } |
universe@798 | 490 | destroy_nodes_test_data(td5); |
universe@798 | 491 | destroy_nodes_test_data(td13); |
universe@798 | 492 | } |
universe@798 | 493 | |
universe@798 | 494 | CX_TEST(test_linked_list_sort_empty) { |
universe@798 | 495 | void *begin = NULL; |
universe@799 | 496 | CX_TEST_DO { |
universe@799 | 497 | // cannot assert something, we can just test that it does not crash |
universe@799 | 498 | cx_linked_list_sort(&begin, NULL, loc_prev, loc_next, loc_data, cx_cmp_int); |
universe@799 | 499 | CX_TEST_ASSERT(true); |
universe@799 | 500 | } |
universe@798 | 501 | } |
universe@798 | 502 | |
universe@798 | 503 | CX_TEST(test_linked_list_sort) { |
universe@798 | 504 | const size_t len = 1500; |
universe@798 | 505 | int *testdata = int_test_data(len); |
universe@798 | 506 | void *scrambled = create_nodes_test_data(len); |
universe@798 | 507 | node *n = scrambled; |
universe@798 | 508 | for (size_t i = 0; i < len; i++) { |
universe@798 | 509 | n->data = testdata[i]; |
universe@798 | 510 | n = n->next; |
universe@798 | 511 | } |
universe@798 | 512 | int *sorted = malloc(len*sizeof(int)); |
universe@798 | 513 | memcpy(sorted, testdata, len*sizeof(int)); |
universe@798 | 514 | qsort(sorted, len, sizeof(int), cx_cmp_int); |
universe@798 | 515 | |
universe@798 | 516 | void *begin = scrambled; |
universe@798 | 517 | void *end = cx_linked_list_last(begin, loc_next); |
universe@798 | 518 | |
universe@798 | 519 | CX_TEST_DO { |
universe@798 | 520 | cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data, cx_cmp_int); |
universe@798 | 521 | node *check = begin; |
universe@798 | 522 | node *check_last = NULL; |
universe@798 | 523 | for (size_t i = 0; i < len; i++) { |
universe@798 | 524 | CX_TEST_ASSERT(check->data == sorted[i]); |
universe@798 | 525 | CX_TEST_ASSERT(check->prev == check_last); |
universe@798 | 526 | if (i < len - 1) { |
universe@798 | 527 | CX_TEST_ASSERT(check->next != NULL); |
universe@798 | 528 | } |
universe@798 | 529 | check_last = check; |
universe@798 | 530 | check = check->next; |
universe@798 | 531 | } |
universe@798 | 532 | CX_TEST_ASSERT(check == NULL); |
universe@798 | 533 | CX_TEST_ASSERT(end == check_last); |
universe@798 | 534 | } |
universe@799 | 535 | destroy_nodes_test_data(begin); |
universe@799 | 536 | free(sorted); |
universe@798 | 537 | free(testdata); |
universe@798 | 538 | } |
universe@798 | 539 | |
universe@798 | 540 | CX_TEST(test_linked_list_reverse) { |
universe@798 | 541 | void *testdata = create_nodes_test_data(4); |
universe@798 | 542 | void *expected = create_nodes_test_data(4); |
universe@798 | 543 | assign_nodes_test_data(testdata, 2, 4, 6, 8); |
universe@798 | 544 | assign_nodes_test_data(expected, 8, 6, 4, 2); |
universe@799 | 545 | void *begin = testdata; |
universe@798 | 546 | CX_TEST_DO { |
universe@798 | 547 | void *end = cx_linked_list_last(begin, loc_next); |
universe@798 | 548 | void *orig_begin = begin, *orig_end = end; |
universe@798 | 549 | |
universe@798 | 550 | cx_linked_list_reverse(&begin, &end, loc_prev, loc_next); |
universe@798 | 551 | CX_TEST_ASSERT(end == orig_begin); |
universe@798 | 552 | CX_TEST_ASSERT(begin == orig_end); |
universe@798 | 553 | CX_TEST_ASSERT(0 == cx_linked_list_compare(begin, expected, loc_next, loc_data, cx_cmp_int)); |
universe@798 | 554 | } |
universe@799 | 555 | destroy_nodes_test_data(begin); |
universe@798 | 556 | destroy_nodes_test_data(expected); |
universe@798 | 557 | } |
universe@798 | 558 | |
universe@800 | 559 | |
universe@800 | 560 | CX_TEST(test_empty_list_size) { |
universe@800 | 561 | CX_TEST_DO { |
universe@800 | 562 | CX_TEST_ASSERT(cxEmptyList->size == 0); |
universe@800 | 563 | CX_TEST_ASSERT(cxListSize(cxEmptyList) == 0); |
universe@800 | 564 | } |
universe@800 | 565 | } |
universe@800 | 566 | |
universe@800 | 567 | CX_TEST(test_empty_list_iterator) { |
universe@800 | 568 | CxList *list = cxEmptyList; |
universe@800 | 569 | |
universe@800 | 570 | CxIterator it1 = cxListIterator(list); |
universe@800 | 571 | CxIterator it2 = cxListBackwardsIterator(list); |
universe@800 | 572 | CxMutIterator it3 = cxListMutIterator(list); |
universe@800 | 573 | CxMutIterator it4 = cxListMutBackwardsIterator(list); |
universe@800 | 574 | |
universe@800 | 575 | CX_TEST_DO { |
universe@800 | 576 | CX_TEST_ASSERT(!cxIteratorValid(it1)); |
universe@800 | 577 | CX_TEST_ASSERT(!cxIteratorValid(it2)); |
universe@800 | 578 | CX_TEST_ASSERT(!cxIteratorValid(it3)); |
universe@800 | 579 | CX_TEST_ASSERT(!cxIteratorValid(it4)); |
universe@800 | 580 | |
universe@800 | 581 | int c = 0; |
universe@800 | 582 | cx_foreach(void*, data, it1) c++; |
universe@800 | 583 | cx_foreach(void*, data, it2) c++; |
universe@800 | 584 | cx_foreach(void*, data, it3) c++; |
universe@800 | 585 | cx_foreach(void*, data, it4) c++; |
universe@800 | 586 | CX_TEST_ASSERT(c == 0); |
universe@800 | 587 | } |
universe@800 | 588 | } |
universe@800 | 589 | |
universe@800 | 590 | CX_TEST(test_empty_list_noops) { |
universe@800 | 591 | CX_TEST_DO { |
universe@800 | 592 | CxList copy = *cxEmptyList; |
universe@800 | 593 | cxListSort(cxEmptyList); |
universe@800 | 594 | cxListClear(cxEmptyList); |
universe@800 | 595 | cxListDestroy(cxEmptyList); |
universe@800 | 596 | CX_TEST_ASSERT(0 == memcmp(©, cxEmptyList, sizeof(CxList))); // NOLINT(*-suspicious-memory-comparison) |
universe@800 | 597 | } |
universe@800 | 598 | } |
universe@800 | 599 | |
universe@800 | 600 | CX_TEST(test_empty_list_at) { |
universe@800 | 601 | CX_TEST_DO { |
universe@800 | 602 | CX_TEST_ASSERT(cxListAt(cxEmptyList, 0) == NULL); |
universe@800 | 603 | CX_TEST_ASSERT(cxListAt(cxEmptyList, 1) == NULL); |
universe@800 | 604 | } |
universe@800 | 605 | } |
universe@800 | 606 | |
universe@800 | 607 | CX_TEST(test_empty_list_find) { |
universe@800 | 608 | int x = 42, y = 1337; |
universe@800 | 609 | CX_TEST_DO { |
universe@800 | 610 | CX_TEST_ASSERT(cxListFind(cxEmptyList, &x) < 0); |
universe@800 | 611 | CX_TEST_ASSERT(cxListFind(cxEmptyList, &y) < 0); |
universe@800 | 612 | } |
universe@800 | 613 | } |
universe@800 | 614 | |
universe@800 | 615 | CX_TEST(test_empty_list_compare) { |
universe@800 | 616 | CxList *empty = cxEmptyList; |
universe@800 | 617 | CxList *ll = cxLinkedListCreateSimple(sizeof(int)); |
universe@800 | 618 | CxList *al = cxArrayListCreateSimple(sizeof(int), 8); |
universe@800 | 619 | int x = 5; |
universe@800 | 620 | CX_TEST_DO { |
universe@800 | 621 | CX_TEST_ASSERT(0 == cxListCompare(empty, cxEmptyList)); |
universe@800 | 622 | CX_TEST_ASSERT(0 == cxListCompare(ll, cxEmptyList)); |
universe@800 | 623 | CX_TEST_ASSERT(0 == cxListCompare(al, cxEmptyList)); |
universe@800 | 624 | CX_TEST_ASSERT(0 == cxListCompare(cxEmptyList, ll)); |
universe@800 | 625 | CX_TEST_ASSERT(0 == cxListCompare(cxEmptyList, al)); |
universe@800 | 626 | |
universe@800 | 627 | cxListAdd(ll, &x); |
universe@800 | 628 | cxListAdd(al, &x); |
universe@800 | 629 | |
universe@800 | 630 | CX_TEST_ASSERT(0 < cxListCompare(ll, cxEmptyList)); |
universe@800 | 631 | CX_TEST_ASSERT(0 < cxListCompare(al, cxEmptyList)); |
universe@800 | 632 | CX_TEST_ASSERT(0 > cxListCompare(cxEmptyList, ll)); |
universe@800 | 633 | CX_TEST_ASSERT(0 > cxListCompare(cxEmptyList, al)); |
universe@800 | 634 | } |
universe@800 | 635 | cxListDestroy(ll); |
universe@800 | 636 | cxListDestroy(al); |
universe@800 | 637 | } |
universe@800 | 638 | |
universe@801 | 639 | CX_TEST(test_list_ll_create) { |
universe@801 | 640 | CxTestingAllocator talloc; |
universe@801 | 641 | cx_testing_allocator_init(&talloc); |
universe@801 | 642 | CxAllocator *alloc = &talloc.base; |
universe@801 | 643 | CX_TEST_DO { |
universe@801 | 644 | CxList *list = cxLinkedListCreate(alloc, cx_cmp_int, sizeof(int)); |
universe@801 | 645 | CX_TEST_ASSERT(list != NULL); |
universe@801 | 646 | CX_TEST_ASSERT(list->item_size == sizeof(int)); |
universe@801 | 647 | CX_TEST_ASSERT(list->simple_destructor == NULL); |
universe@801 | 648 | CX_TEST_ASSERT(list->advanced_destructor == NULL); |
universe@801 | 649 | CX_TEST_ASSERT(list->destructor_data == NULL); |
universe@801 | 650 | CX_TEST_ASSERT(cxListSize(list) == 0); |
universe@801 | 651 | CX_TEST_ASSERT(list->allocator == alloc); |
universe@801 | 652 | CX_TEST_ASSERT(list->cmpfunc == cx_cmp_int); |
universe@801 | 653 | CX_TEST_ASSERT(!cxListIsStoringPointers(list)); |
universe@801 | 654 | cxListDestroy(list); |
universe@801 | 655 | CX_TEST_ASSERT(cx_testing_allocator_verify(&talloc)); |
universe@801 | 656 | } |
universe@801 | 657 | cx_testing_allocator_destroy(&talloc); |
universe@801 | 658 | } |
universe@801 | 659 | |
universe@801 | 660 | CX_TEST(test_list_ll_create_simple) { |
universe@801 | 661 | CxList *list = cxLinkedListCreateSimple(sizeof(int)); |
universe@801 | 662 | CX_TEST_DO { |
universe@801 | 663 | CX_TEST_ASSERT(list != NULL); |
universe@801 | 664 | CX_TEST_ASSERT(list->item_size == sizeof(int)); |
universe@801 | 665 | CX_TEST_ASSERT(list->simple_destructor == NULL); |
universe@801 | 666 | CX_TEST_ASSERT(list->advanced_destructor == NULL); |
universe@801 | 667 | CX_TEST_ASSERT(list->destructor_data == NULL); |
universe@801 | 668 | CX_TEST_ASSERT(cxListSize(list) == 0); |
universe@801 | 669 | CX_TEST_ASSERT(list->allocator == cxDefaultAllocator); |
universe@801 | 670 | CX_TEST_ASSERT(list->cmpfunc == NULL); |
universe@801 | 671 | CX_TEST_ASSERT(!cxListIsStoringPointers(list)); |
universe@801 | 672 | } |
universe@801 | 673 | cxListDestroy(list); |
universe@801 | 674 | } |
universe@801 | 675 | |
universe@801 | 676 | CX_TEST(test_list_ll_store_pointers) { |
universe@801 | 677 | CxList *list = cxLinkedListCreateSimple(47); |
universe@801 | 678 | CX_TEST_DO { |
universe@801 | 679 | CX_TEST_ASSERT(!cxListIsStoringPointers(list)); |
universe@801 | 680 | cxListStorePointers(list); |
universe@801 | 681 | CX_TEST_ASSERT(list->item_size == sizeof(void *)); |
universe@801 | 682 | CX_TEST_ASSERT(list->cl != NULL); |
universe@801 | 683 | CX_TEST_ASSERT(list->climpl != NULL); |
universe@801 | 684 | CX_TEST_ASSERT(cxListIsStoringPointers(list)); |
universe@801 | 685 | cxListStoreObjects(list); |
universe@801 | 686 | CX_TEST_ASSERT(list->cl != NULL); |
universe@801 | 687 | CX_TEST_ASSERT(list->climpl == NULL); |
universe@801 | 688 | CX_TEST_ASSERT(!cxListIsStoringPointers(list)); |
universe@801 | 689 | } |
universe@801 | 690 | cxListDestroy(list); |
universe@801 | 691 | } |
universe@801 | 692 | |
universe@801 | 693 | CX_TEST(test_list_ll_create_simple_for_pointers) { |
universe@801 | 694 | CxList *list = cxLinkedListCreateSimple(CX_STORE_POINTERS); |
universe@801 | 695 | CX_TEST_DO { |
universe@801 | 696 | CX_TEST_ASSERT(list != NULL); |
universe@801 | 697 | CX_TEST_ASSERT(list->item_size == sizeof(void*)); |
universe@801 | 698 | CX_TEST_ASSERT(list->simple_destructor == NULL); |
universe@801 | 699 | CX_TEST_ASSERT(list->advanced_destructor == NULL); |
universe@801 | 700 | CX_TEST_ASSERT(list->destructor_data == NULL); |
universe@801 | 701 | CX_TEST_ASSERT(cxListSize(list) == 0); |
universe@801 | 702 | CX_TEST_ASSERT(list->allocator == cxDefaultAllocator); |
universe@801 | 703 | CX_TEST_ASSERT(list->cmpfunc == cx_cmp_ptr); |
universe@801 | 704 | CX_TEST_ASSERT(cxListIsStoringPointers(list)); |
universe@801 | 705 | } |
universe@801 | 706 | cxListDestroy(list); |
universe@801 | 707 | } |
universe@801 | 708 | |
universe@801 | 709 | CX_TEST(test_list_arl_create) { |
universe@801 | 710 | CxTestingAllocator talloc; |
universe@801 | 711 | cx_testing_allocator_init(&talloc); |
universe@801 | 712 | CxAllocator *alloc = &talloc.base; |
universe@801 | 713 | CX_TEST_DO { |
universe@801 | 714 | CxList *list = cxArrayListCreate(alloc, cx_cmp_int, sizeof(int), 8); |
universe@801 | 715 | CX_TEST_ASSERT(list != NULL); |
universe@801 | 716 | CX_TEST_ASSERT(list->item_size == sizeof(int)); |
universe@801 | 717 | CX_TEST_ASSERT(list->simple_destructor == NULL); |
universe@801 | 718 | CX_TEST_ASSERT(list->advanced_destructor == NULL); |
universe@801 | 719 | CX_TEST_ASSERT(list->destructor_data == NULL); |
universe@801 | 720 | CX_TEST_ASSERT(cxListSize(list) == 0); |
universe@801 | 721 | CX_TEST_ASSERT(list->allocator == alloc); |
universe@801 | 722 | CX_TEST_ASSERT(list->cmpfunc == cx_cmp_int); |
universe@801 | 723 | CX_TEST_ASSERT(!cxListIsStoringPointers(list)); |
universe@801 | 724 | cxListDestroy(list); |
universe@801 | 725 | CX_TEST_ASSERT(cx_testing_allocator_verify(&talloc)); |
universe@801 | 726 | } |
universe@801 | 727 | cx_testing_allocator_destroy(&talloc); |
universe@801 | 728 | } |
universe@801 | 729 | |
universe@801 | 730 | CX_TEST(test_list_arl_create_simple) { |
universe@801 | 731 | CxList *list = cxArrayListCreateSimple(sizeof(int), 8); |
universe@801 | 732 | CX_TEST_DO { |
universe@801 | 733 | CX_TEST_ASSERT(list != NULL); |
universe@801 | 734 | CX_TEST_ASSERT(list->item_size == sizeof(int)); |
universe@801 | 735 | CX_TEST_ASSERT(list->simple_destructor == NULL); |
universe@801 | 736 | CX_TEST_ASSERT(list->advanced_destructor == NULL); |
universe@801 | 737 | CX_TEST_ASSERT(list->destructor_data == NULL); |
universe@801 | 738 | CX_TEST_ASSERT(cxListSize(list) == 0); |
universe@801 | 739 | CX_TEST_ASSERT(list->allocator == cxDefaultAllocator); |
universe@801 | 740 | CX_TEST_ASSERT(list->cmpfunc == NULL); |
universe@801 | 741 | CX_TEST_ASSERT(!cxListIsStoringPointers(list)); |
universe@801 | 742 | } |
universe@801 | 743 | cxListDestroy(list); |
universe@801 | 744 | } |
universe@801 | 745 | |
universe@801 | 746 | CX_TEST(test_list_arl_create_simple_for_pointers) { |
universe@801 | 747 | CxList *list = cxArrayListCreateSimple(CX_STORE_POINTERS, 8); |
universe@801 | 748 | CX_TEST_DO { |
universe@801 | 749 | CX_TEST_ASSERT(list != NULL); |
universe@801 | 750 | CX_TEST_ASSERT(list->item_size == sizeof(void*)); |
universe@801 | 751 | CX_TEST_ASSERT(list->simple_destructor == NULL); |
universe@801 | 752 | CX_TEST_ASSERT(list->advanced_destructor == NULL); |
universe@801 | 753 | CX_TEST_ASSERT(list->destructor_data == NULL); |
universe@801 | 754 | CX_TEST_ASSERT(cxListSize(list) == 0); |
universe@801 | 755 | CX_TEST_ASSERT(list->allocator == cxDefaultAllocator); |
universe@801 | 756 | CX_TEST_ASSERT(list->cmpfunc == cx_cmp_ptr); |
universe@801 | 757 | CX_TEST_ASSERT(cxListIsStoringPointers(list)); |
universe@801 | 758 | } |
universe@801 | 759 | cxListDestroy(list); |
universe@801 | 760 | } |
universe@801 | 761 | |
universe@801 | 762 | static void test_fake_simple_int_destr(void *elem) { |
universe@801 | 763 | *(int *) elem = 42; |
universe@801 | 764 | } |
universe@801 | 765 | |
universe@801 | 766 | CX_TEST(test_list_pll_destroy_no_destr) { |
universe@801 | 767 | CxTestingAllocator talloc; |
universe@801 | 768 | cx_testing_allocator_init(&talloc); |
universe@801 | 769 | CxAllocator *alloc = &talloc.base; |
universe@801 | 770 | CX_TEST_DO { |
universe@801 | 771 | void *item = cxMalloc(alloc, sizeof(int)); |
universe@801 | 772 | CxList *list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS); |
universe@801 | 773 | cxListAdd(list, item); |
universe@801 | 774 | CX_TEST_ASSERT(!cx_testing_allocator_verify(&talloc)); |
universe@801 | 775 | cxListDestroy(list); |
universe@801 | 776 | // item is not yet freed |
universe@801 | 777 | CX_TEST_ASSERT(!cx_testing_allocator_verify(&talloc)); |
universe@801 | 778 | cxFree(alloc, item); |
universe@801 | 779 | CX_TEST_ASSERT(cx_testing_allocator_verify(&talloc)); |
universe@801 | 780 | } |
universe@801 | 781 | cx_testing_allocator_destroy(&talloc); |
universe@801 | 782 | } |
universe@801 | 783 | |
universe@801 | 784 | CX_TEST(test_list_pll_destroy_simple_destr) { |
universe@801 | 785 | CX_TEST_DO { |
universe@801 | 786 | int item = 0; |
universe@801 | 787 | CxList *list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS); |
universe@801 | 788 | list->simple_destructor = test_fake_simple_int_destr; |
universe@801 | 789 | cxListAdd(list, &item); |
universe@801 | 790 | cxListDestroy(list); |
universe@801 | 791 | CX_TEST_ASSERT(item == 42); |
universe@801 | 792 | } |
universe@801 | 793 | } |
universe@801 | 794 | |
universe@801 | 795 | CX_TEST(test_list_pll_destroy_adv_destr) { |
universe@801 | 796 | CxTestingAllocator talloc; |
universe@801 | 797 | cx_testing_allocator_init(&talloc); |
universe@801 | 798 | CxAllocator *alloc = &talloc.base; |
universe@801 | 799 | CX_TEST_DO { |
universe@801 | 800 | void *item = cxMalloc(alloc, sizeof(int)); |
universe@801 | 801 | CxList *list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS); |
universe@801 | 802 | list->destructor_data = alloc; |
universe@801 | 803 | list->advanced_destructor = (cx_destructor_func2) cxFree; |
universe@801 | 804 | cxListAdd(list, item); |
universe@801 | 805 | CX_TEST_ASSERT(!cx_testing_allocator_verify(&talloc)); |
universe@801 | 806 | cxListDestroy(list); |
universe@801 | 807 | CX_TEST_ASSERT(cx_testing_allocator_verify(&talloc)); |
universe@801 | 808 | } |
universe@801 | 809 | cx_testing_allocator_destroy(&talloc); |
universe@801 | 810 | } |
universe@801 | 811 | |
universe@801 | 812 | CX_TEST(test_list_parl_destroy_no_destr) { |
universe@801 | 813 | CxTestingAllocator talloc; |
universe@801 | 814 | cx_testing_allocator_init(&talloc); |
universe@801 | 815 | CxAllocator *alloc = &talloc.base; |
universe@801 | 816 | CX_TEST_DO { |
universe@801 | 817 | void *item = cxMalloc(alloc, sizeof(int)); |
universe@801 | 818 | CxList *list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4); |
universe@801 | 819 | cxListAdd(list, item); |
universe@801 | 820 | CX_TEST_ASSERT(!cx_testing_allocator_verify(&talloc)); |
universe@801 | 821 | cxListDestroy(list); |
universe@801 | 822 | // item is not yet freed |
universe@801 | 823 | CX_TEST_ASSERT(!cx_testing_allocator_verify(&talloc)); |
universe@801 | 824 | cxFree(alloc, item); |
universe@801 | 825 | CX_TEST_ASSERT(cx_testing_allocator_verify(&talloc)); |
universe@801 | 826 | } |
universe@801 | 827 | cx_testing_allocator_destroy(&talloc); |
universe@801 | 828 | } |
universe@801 | 829 | |
universe@801 | 830 | CX_TEST(test_list_parl_destroy_simple_destr) { |
universe@801 | 831 | CX_TEST_DO { |
universe@801 | 832 | int item = 0; |
universe@801 | 833 | CxList *list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4); |
universe@801 | 834 | list->simple_destructor = test_fake_simple_int_destr; |
universe@801 | 835 | cxListAdd(list, &item); |
universe@801 | 836 | cxListDestroy(list); |
universe@801 | 837 | CX_TEST_ASSERT(item == 42); |
universe@801 | 838 | } |
universe@801 | 839 | } |
universe@801 | 840 | |
universe@801 | 841 | CX_TEST(test_list_parl_destroy_adv_destr) { |
universe@801 | 842 | CxTestingAllocator talloc; |
universe@801 | 843 | cx_testing_allocator_init(&talloc); |
universe@801 | 844 | CxAllocator *alloc = &talloc.base; |
universe@801 | 845 | CX_TEST_DO { |
universe@801 | 846 | void *item = cxMalloc(alloc, sizeof(int)); |
universe@801 | 847 | CxList *list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4); |
universe@801 | 848 | list->destructor_data = alloc; |
universe@801 | 849 | list->advanced_destructor = (cx_destructor_func2) cxFree; |
universe@801 | 850 | cxListAdd(list, item); |
universe@801 | 851 | CX_TEST_ASSERT(!cx_testing_allocator_verify(&talloc)); |
universe@801 | 852 | cxListDestroy(list); |
universe@801 | 853 | CX_TEST_ASSERT(cx_testing_allocator_verify(&talloc)); |
universe@801 | 854 | } |
universe@801 | 855 | cx_testing_allocator_destroy(&talloc); |
universe@801 | 856 | } |
universe@801 | 857 | |
universe@803 | 858 | #define set_up_combo \ |
universe@803 | 859 | CxTestingAllocator talloc; \ |
universe@803 | 860 | cx_testing_allocator_init(&talloc); \ |
universe@803 | 861 | CxAllocator *alloc = &talloc.base; \ |
universe@803 | 862 | CX_TEST_DO { |
universe@803 | 863 | #define tear_down_combo \ |
universe@803 | 864 | cxListDestroy(list); \ |
universe@803 | 865 | CX_TEST_ASSERT(cx_testing_allocator_verify(&talloc));\ |
universe@803 | 866 | } \ |
universe@803 | 867 | cx_testing_allocator_destroy(&talloc); |
universe@803 | 868 | #define roll_out_test_combos(name, body) \ |
universe@803 | 869 | static CX_TEST_SUBROUTINE(test_list_verify_##name, CxList *list, \ |
universe@803 | 870 | __attribute__((__unused__)) bool isptrlist, \ |
universe@803 | 871 | __attribute__((__unused__)) bool islinkedlist) body \ |
universe@803 | 872 | CX_TEST(test_list_ll_##name) { \ |
universe@803 | 873 | set_up_combo \ |
universe@803 | 874 | CxList *list = cxLinkedListCreate(alloc, cx_cmp_int, sizeof(int)); \ |
universe@803 | 875 | CX_TEST_CALL_SUBROUTINE(test_list_verify_##name, list, false, true); \ |
universe@803 | 876 | tear_down_combo \ |
universe@803 | 877 | } \ |
universe@803 | 878 | CX_TEST(test_list_arl_##name) { \ |
universe@803 | 879 | set_up_combo \ |
universe@803 | 880 | CxList *list = cxArrayListCreate(alloc, cx_cmp_int, sizeof(int), 8); \ |
universe@803 | 881 | CX_TEST_CALL_SUBROUTINE(test_list_verify_##name, list, false, false); \ |
universe@803 | 882 | tear_down_combo \ |
universe@803 | 883 | } \ |
universe@803 | 884 | CX_TEST(test_list_pll_##name) { \ |
universe@803 | 885 | set_up_combo \ |
universe@803 | 886 | CxList *list = cxLinkedListCreate(alloc, cx_cmp_int, CX_STORE_POINTERS); \ |
universe@803 | 887 | CX_TEST_CALL_SUBROUTINE(test_list_verify_##name, list, true, true); \ |
universe@803 | 888 | tear_down_combo \ |
universe@803 | 889 | } \ |
universe@803 | 890 | CX_TEST(test_list_parl_##name) { \ |
universe@803 | 891 | set_up_combo \ |
universe@803 | 892 | CxList *list = cxArrayListCreate(alloc, cx_cmp_int, CX_STORE_POINTERS, 8); \ |
universe@803 | 893 | CX_TEST_CALL_SUBROUTINE(test_list_verify_##name, list, true, false); \ |
universe@803 | 894 | tear_down_combo \ |
universe@803 | 895 | } |
universe@803 | 896 | #define array_init(...) {__VA_ARGS__} |
universe@803 | 897 | |
universe@803 | 898 | static inline int *int_test_data_added_to_list(CxList *list, bool isptrlist, size_t len) { |
universe@803 | 899 | int *testdata = int_test_data(len); |
universe@803 | 900 | if (isptrlist) { |
universe@803 | 901 | cx_for_n(i, len) { |
universe@803 | 902 | cxListAdd(list, &testdata[i]); |
universe@803 | 903 | } |
universe@803 | 904 | } else { |
universe@803 | 905 | cxListAddArray(list, testdata, len); |
universe@803 | 906 | } |
universe@803 | 907 | return testdata; |
universe@803 | 908 | } |
universe@803 | 909 | |
universe@803 | 910 | roll_out_test_combos(add, { |
universe@803 | 911 | const size_t len = 250; |
universe@803 | 912 | int *testdata = int_test_data(len); |
universe@803 | 913 | cx_for_n (i, len) CX_TEST_ASSERT(cxListAdd(list, &testdata[i]) == 0); |
universe@803 | 914 | CX_TEST_ASSERT(cxListSize(list) == len); |
universe@803 | 915 | cx_for_n (i, len) CX_TEST_ASSERT(*(int *) cxListAt(list, i) == testdata[i]); |
universe@803 | 916 | cx_for_n (i, len) ++testdata[i]; |
universe@803 | 917 | if (isptrlist) { |
universe@803 | 918 | cx_for_n (i, len) CX_TEST_ASSERT(*(int *) cxListAt(list, i) == testdata[i]); |
universe@803 | 919 | } else { |
universe@803 | 920 | cx_for_n (i, len) CX_TEST_ASSERT(*(int *) cxListAt(list, i) == testdata[i] - 1); |
universe@803 | 921 | } |
universe@803 | 922 | free(testdata); |
universe@803 | 923 | }) |
universe@803 | 924 | |
universe@803 | 925 | roll_out_test_combos(insert, { |
universe@803 | 926 | int a = 5; |
universe@803 | 927 | int b = 47; |
universe@803 | 928 | int c = 13; |
universe@803 | 929 | int d = 42; |
universe@803 | 930 | CX_TEST_ASSERT(cxListInsert(list, 1, &a) != 0); |
universe@803 | 931 | CX_TEST_ASSERT(cxListSize(list) == 0); |
universe@803 | 932 | CX_TEST_ASSERT(cxListInsert(list, 0, &a) == 0); |
universe@803 | 933 | CX_TEST_ASSERT(cxListSize(list) == 1); |
universe@803 | 934 | CX_TEST_ASSERT(cxListInsert(list, 0, &b) == 0); |
universe@803 | 935 | CX_TEST_ASSERT(cxListSize(list) == 2); |
universe@803 | 936 | CX_TEST_ASSERT(cxListInsert(list, 1, &c) == 0); |
universe@803 | 937 | CX_TEST_ASSERT(cxListSize(list) == 3); |
universe@803 | 938 | CX_TEST_ASSERT(cxListInsert(list, 3, &d) == 0); |
universe@803 | 939 | CX_TEST_ASSERT(cxListSize(list) == 4); |
universe@803 | 940 | CX_TEST_ASSERT(*(int *) cxListAt(list, 0) == 47); |
universe@803 | 941 | CX_TEST_ASSERT(*(int *) cxListAt(list, 1) == 13); |
universe@803 | 942 | CX_TEST_ASSERT(*(int *) cxListAt(list, 2) == 5); |
universe@803 | 943 | CX_TEST_ASSERT(*(int *) cxListAt(list, 3) == 42); |
universe@803 | 944 | }) |
universe@803 | 945 | |
universe@803 | 946 | roll_out_test_combos(insert_array, { |
universe@803 | 947 | int a[5] = array_init(5, 47, 11, 13, 42); |
universe@803 | 948 | int b[5] = array_init(9, 18, 72, 50, 7); |
universe@803 | 949 | int *aptr[5]; |
universe@803 | 950 | int *bptr[5]; |
universe@803 | 951 | cx_for_n(i, 5) { |
universe@803 | 952 | aptr[i] = &a[i]; |
universe@803 | 953 | bptr[i] = &b[i]; |
universe@803 | 954 | } |
universe@803 | 955 | |
universe@803 | 956 | size_t inserted; |
universe@803 | 957 | |
universe@803 | 958 | if (isptrlist) { |
universe@803 | 959 | inserted = cxListInsertArray(list, 0, aptr, 5); |
universe@803 | 960 | } else { |
universe@803 | 961 | inserted = cxListInsertArray(list, 0, a, 5); |
universe@803 | 962 | } |
universe@803 | 963 | CX_TEST_ASSERT(inserted == 5); |
universe@803 | 964 | CX_TEST_ASSERT(*(int *) cxListAt(list, 0) == 5); |
universe@803 | 965 | CX_TEST_ASSERT(*(int *) cxListAt(list, 1) == 47); |
universe@803 | 966 | CX_TEST_ASSERT(*(int *) cxListAt(list, 2) == 11); |
universe@803 | 967 | CX_TEST_ASSERT(*(int *) cxListAt(list, 3) == 13); |
universe@803 | 968 | CX_TEST_ASSERT(*(int *) cxListAt(list, 4) == 42); |
universe@803 | 969 | if (isptrlist) { |
universe@803 | 970 | inserted = cxListInsertArray(list, 3, bptr, 5); |
universe@803 | 971 | } else { |
universe@803 | 972 | inserted = cxListInsertArray(list, 3, b, 5); |
universe@803 | 973 | } |
universe@803 | 974 | CX_TEST_ASSERT(inserted == 5); |
universe@803 | 975 | CX_TEST_ASSERT(*(int *) cxListAt(list, 0) == 5); |
universe@803 | 976 | CX_TEST_ASSERT(*(int *) cxListAt(list, 1) == 47); |
universe@803 | 977 | CX_TEST_ASSERT(*(int *) cxListAt(list, 2) == 11); |
universe@803 | 978 | CX_TEST_ASSERT(*(int *) cxListAt(list, 3) == 9); |
universe@803 | 979 | CX_TEST_ASSERT(*(int *) cxListAt(list, 4) == 18); |
universe@803 | 980 | CX_TEST_ASSERT(*(int *) cxListAt(list, 5) == 72); |
universe@803 | 981 | CX_TEST_ASSERT(*(int *) cxListAt(list, 6) == 50); |
universe@803 | 982 | CX_TEST_ASSERT(*(int *) cxListAt(list, 7) == 7); |
universe@803 | 983 | CX_TEST_ASSERT(*(int *) cxListAt(list, 8) == 13); |
universe@803 | 984 | CX_TEST_ASSERT(*(int *) cxListAt(list, 9) == 42); |
universe@803 | 985 | }) |
universe@803 | 986 | |
universe@803 | 987 | roll_out_test_combos(remove, { |
universe@803 | 988 | const size_t testdata_len = 32; |
universe@803 | 989 | int *testdata = int_test_data_added_to_list(list, isptrlist, testdata_len); |
universe@803 | 990 | |
universe@803 | 991 | CX_TEST_ASSERT(cxListRemove(list, 2) == 0); |
universe@803 | 992 | CX_TEST_ASSERT(cxListRemove(list, 4) == 0); |
universe@803 | 993 | CX_TEST_ASSERT(cxListSize(list) == testdata_len - 2); |
universe@803 | 994 | CX_TEST_ASSERT(*(int *) cxListAt(list, 0) == testdata[0]); |
universe@803 | 995 | CX_TEST_ASSERT(*(int *) cxListAt(list, 1) == testdata[1]); |
universe@803 | 996 | CX_TEST_ASSERT(*(int *) cxListAt(list, 2) == testdata[3]); |
universe@803 | 997 | CX_TEST_ASSERT(*(int *) cxListAt(list, 3) == testdata[4]); |
universe@803 | 998 | CX_TEST_ASSERT(*(int *) cxListAt(list, 4) == testdata[6]); |
universe@803 | 999 | CX_TEST_ASSERT(cxListRemove(list, 0) == 0); |
universe@803 | 1000 | CX_TEST_ASSERT(cxListSize(list) == testdata_len - 3); |
universe@803 | 1001 | CX_TEST_ASSERT(*(int *) cxListAt(list, 0) == testdata[1]); |
universe@803 | 1002 | CX_TEST_ASSERT(*(int *) cxListAt(list, 1) == testdata[3]); |
universe@803 | 1003 | CX_TEST_ASSERT(cxListRemove(list, testdata_len) != 0); |
universe@803 | 1004 | free(testdata); |
universe@803 | 1005 | }) |
universe@803 | 1006 | |
universe@803 | 1007 | roll_out_test_combos(find_remove, { |
universe@803 | 1008 | const size_t testdata_len = 250; |
universe@803 | 1009 | int *testdata = int_test_data_added_to_list(list, isptrlist, testdata_len); |
universe@803 | 1010 | |
universe@803 | 1011 | int exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp) |
universe@803 | 1012 | int val = testdata[exp]; |
universe@803 | 1013 | // randomly picked number could occur earlier in list - find first position |
universe@803 | 1014 | for (int i = 0 ; i < exp ; i++) { |
universe@803 | 1015 | if (testdata[i] == val) { |
universe@803 | 1016 | exp = i; |
universe@803 | 1017 | break; |
universe@803 | 1018 | } |
universe@803 | 1019 | } |
universe@803 | 1020 | CX_TEST_ASSERT(cxListSize(list) == testdata_len); |
universe@803 | 1021 | CX_TEST_ASSERT(cxListFind(list, &val) == exp); |
universe@803 | 1022 | CX_TEST_ASSERT(cxListFindRemove(list, &val) == exp); |
universe@803 | 1023 | CX_TEST_ASSERT(cxListSize(list) == testdata_len - 1); |
universe@803 | 1024 | CX_TEST_ASSERT(cxListFind(list, &val) != exp); |
universe@803 | 1025 | |
universe@803 | 1026 | int notinlist = -1; |
universe@803 | 1027 | CX_TEST_ASSERT(cxListFindRemove(list, ¬inlist) < 0); |
universe@803 | 1028 | CX_TEST_ASSERT(cxListSize(list) == testdata_len - 1); |
universe@803 | 1029 | |
universe@803 | 1030 | free(testdata); |
universe@803 | 1031 | }) |
universe@803 | 1032 | |
universe@803 | 1033 | roll_out_test_combos(clear, { |
universe@803 | 1034 | int *testdata = int_test_data_added_to_list(list, isptrlist, 8); |
universe@803 | 1035 | CX_TEST_ASSERT(cxListSize(list) > 0); |
universe@803 | 1036 | cxListClear(list); |
universe@803 | 1037 | CX_TEST_ASSERT(cxListSize(list) == 0); |
universe@803 | 1038 | free(testdata); |
universe@803 | 1039 | }) |
universe@803 | 1040 | |
universe@803 | 1041 | roll_out_test_combos(at, { |
universe@803 | 1042 | size_t len = 128; |
universe@803 | 1043 | int *testdata = int_test_data_added_to_list(list, isptrlist, 128); |
universe@803 | 1044 | CX_TEST_ASSERT(cxListSize(list) == len); |
universe@803 | 1045 | cx_for_n (i, len) { |
universe@803 | 1046 | CX_TEST_ASSERT(*(int *) cxListAt(list, i) == testdata[i]); |
universe@803 | 1047 | } |
universe@803 | 1048 | CX_TEST_ASSERT(cxListAt(list, cxListSize(list)) == NULL); |
universe@803 | 1049 | free(testdata); |
universe@803 | 1050 | }) |
universe@803 | 1051 | |
universe@803 | 1052 | roll_out_test_combos(swap, { |
universe@803 | 1053 | int original[16] = array_init(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15); |
universe@803 | 1054 | int swapped[16] = array_init(8, 4, 14, 3, 1, 5, 9, 12, 0, 6, 11, 10, 7, 15, 2, 13); |
universe@803 | 1055 | |
universe@803 | 1056 | cx_for_n(i, 16) { |
universe@803 | 1057 | cxListAdd(list, &original[i]); |
universe@803 | 1058 | } |
universe@803 | 1059 | |
universe@803 | 1060 | CX_TEST_ASSERT(0 == cxListSwap(list, 1, 4)); |
universe@803 | 1061 | CX_TEST_ASSERT(0 == cxListSwap(list, 2, 14)); |
universe@803 | 1062 | CX_TEST_ASSERT(0 == cxListSwap(list, 9, 6)); |
universe@803 | 1063 | CX_TEST_ASSERT(0 == cxListSwap(list, 3, 3)); |
universe@803 | 1064 | CX_TEST_ASSERT(0 == cxListSwap(list, 10, 11)); |
universe@803 | 1065 | CX_TEST_ASSERT(0 == cxListSwap(list, 8, 0)); |
universe@803 | 1066 | CX_TEST_ASSERT(0 == cxListSwap(list, 7, 12)); |
universe@803 | 1067 | CX_TEST_ASSERT(0 == cxListSwap(list, 13, 15)); |
universe@803 | 1068 | |
universe@803 | 1069 | CX_TEST_ASSERT(0 != cxListSwap(list, 5, 16)); |
universe@803 | 1070 | CX_TEST_ASSERT(0 != cxListSwap(list, 16, 6)); |
universe@803 | 1071 | CX_TEST_ASSERT(0 != cxListSwap(list, 16, 17)); |
universe@803 | 1072 | |
universe@803 | 1073 | CxIterator iter = cxListIterator(list); |
universe@803 | 1074 | cx_foreach(int*, e, iter) { |
universe@803 | 1075 | CX_TEST_ASSERT(*e == swapped[iter.index]); |
universe@803 | 1076 | } |
universe@803 | 1077 | iter = cxListBackwardsIterator(list); |
universe@803 | 1078 | cx_foreach(int*, e, iter) { |
universe@803 | 1079 | CX_TEST_ASSERT(*e == swapped[iter.index]); |
universe@803 | 1080 | } |
universe@803 | 1081 | }) |
universe@803 | 1082 | |
universe@803 | 1083 | roll_out_test_combos(swap_no_sbo, { |
universe@803 | 1084 | if (islinkedlist) { |
universe@803 | 1085 | CX_DISABLE_LINKED_LIST_SWAP_SBO = true; |
universe@803 | 1086 | CX_TEST_CALL_SUBROUTINE(test_list_verify_swap, list, isptrlist, true); |
universe@803 | 1087 | CX_DISABLE_LINKED_LIST_SWAP_SBO = false; |
universe@803 | 1088 | } else { |
universe@804 | 1089 | CX_DISABLE_ARRAY_LIST_SWAP_SBO = true; |
universe@804 | 1090 | CX_TEST_CALL_SUBROUTINE(test_list_verify_swap, list, isptrlist, false); |
universe@804 | 1091 | CX_DISABLE_ARRAY_LIST_SWAP_SBO = false; |
universe@803 | 1092 | } |
universe@803 | 1093 | }) |
universe@803 | 1094 | |
universe@803 | 1095 | roll_out_test_combos(find, { |
universe@803 | 1096 | const size_t testdata_len = 500; |
universe@803 | 1097 | int *testdata = int_test_data_added_to_list(list, isptrlist, testdata_len); |
universe@803 | 1098 | |
universe@803 | 1099 | cx_for_n (attempt, 25) { |
universe@803 | 1100 | int exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp) |
universe@803 | 1101 | int val = testdata[exp]; |
universe@803 | 1102 | // randomly picked number could occur earlier in list - find first position |
universe@803 | 1103 | for (int i = 0 ; i < exp ; i++) { |
universe@803 | 1104 | if (testdata[i] == val) { |
universe@803 | 1105 | exp = i; |
universe@803 | 1106 | break; |
universe@803 | 1107 | } |
universe@803 | 1108 | } |
universe@803 | 1109 | CX_TEST_ASSERT(cxListFind(list, &val) == exp); |
universe@803 | 1110 | } |
universe@803 | 1111 | |
universe@803 | 1112 | int notinlist = -1; |
universe@803 | 1113 | CX_TEST_ASSERT(cxListFind(list, ¬inlist) < 0); |
universe@803 | 1114 | |
universe@803 | 1115 | free(testdata); |
universe@803 | 1116 | }) |
universe@803 | 1117 | |
universe@803 | 1118 | roll_out_test_combos(sort, { |
universe@803 | 1119 | const size_t testdata_len = 250; |
universe@803 | 1120 | int *testdata = int_test_data_added_to_list(list, isptrlist, testdata_len); |
universe@803 | 1121 | int *expected = malloc(testdata_len*sizeof(int)); |
universe@803 | 1122 | memcpy(expected, testdata, testdata_len*sizeof(int)); |
universe@803 | 1123 | qsort(expected, testdata_len, sizeof(int), cx_cmp_int); |
universe@803 | 1124 | |
universe@803 | 1125 | cxListSort(list); |
universe@803 | 1126 | cx_for_n (i, testdata_len) CX_TEST_ASSERT(*(int *) cxListAt(list, i) == expected[i]); |
universe@803 | 1127 | |
universe@803 | 1128 | free(expected); |
universe@803 | 1129 | free(testdata); |
universe@803 | 1130 | }) |
universe@803 | 1131 | |
universe@803 | 1132 | roll_out_test_combos(reverse, { |
universe@803 | 1133 | const size_t testdata_len = 50; |
universe@803 | 1134 | int *testdata = int_test_data_added_to_list(list, isptrlist, testdata_len); |
universe@803 | 1135 | cxListReverse(list); |
universe@803 | 1136 | cx_for_n(i, testdata_len) { |
universe@803 | 1137 | CX_TEST_ASSERT(*(int *) cxListAt(list, i) == testdata[testdata_len - 1 - i]); |
universe@803 | 1138 | } |
universe@803 | 1139 | free(testdata); |
universe@803 | 1140 | }) |
universe@803 | 1141 | |
universe@803 | 1142 | roll_out_test_combos(iterator, { |
universe@803 | 1143 | const size_t len = 50; |
universe@803 | 1144 | int *testdata = int_test_data_added_to_list(list, isptrlist, len); |
universe@803 | 1145 | |
universe@803 | 1146 | CxIterator iter = cxListIterator(list); |
universe@803 | 1147 | size_t i = 0; |
universe@803 | 1148 | cx_foreach(int*, x, iter) { |
universe@803 | 1149 | CX_TEST_ASSERT(i == iter.index); |
universe@803 | 1150 | CX_TEST_ASSERT(*x == testdata[iter.index]); |
universe@803 | 1151 | i++; |
universe@803 | 1152 | } |
universe@803 | 1153 | CX_TEST_ASSERT(i == cxListSize(list)); |
universe@803 | 1154 | iter = cxListBackwardsIterator(list); |
universe@803 | 1155 | cx_foreach(int*, x, iter) { |
universe@803 | 1156 | CX_TEST_ASSERT(i - 1 == iter.index); |
universe@803 | 1157 | CX_TEST_ASSERT(*x == testdata[iter.index]); |
universe@803 | 1158 | i--; |
universe@803 | 1159 | } |
universe@803 | 1160 | CX_TEST_ASSERT(i == 0); |
universe@803 | 1161 | i = len / 2; |
universe@803 | 1162 | CxMutIterator mut_iter = cxListMutIteratorAt(list, i); |
universe@803 | 1163 | size_t j = 0; |
universe@803 | 1164 | cx_foreach(int*, x, mut_iter) { |
universe@803 | 1165 | CX_TEST_ASSERT(mut_iter.index == len / 2 + j / 2); |
universe@803 | 1166 | CX_TEST_ASSERT(*x == testdata[i]); |
universe@803 | 1167 | if (i % 2 == 1) cxIteratorFlagRemoval(mut_iter); |
universe@803 | 1168 | i++; |
universe@803 | 1169 | j++; |
universe@803 | 1170 | } |
universe@803 | 1171 | CX_TEST_ASSERT(i == len); |
universe@803 | 1172 | i = len / 2; |
universe@803 | 1173 | j = 0; |
universe@803 | 1174 | mut_iter = cxListMutBackwardsIteratorAt(list, i - 1); |
universe@803 | 1175 | cx_foreach(int*, x, mut_iter) { |
universe@803 | 1176 | CX_TEST_ASSERT(mut_iter.index == len / 2 - 1 - j); |
universe@803 | 1177 | CX_TEST_ASSERT(*x == testdata[i - 1]); |
universe@803 | 1178 | if (i % 2 == 0) cxIteratorFlagRemoval(mut_iter); |
universe@803 | 1179 | i--; |
universe@803 | 1180 | j++; |
universe@803 | 1181 | } |
universe@803 | 1182 | CX_TEST_ASSERT(i == 0); |
universe@803 | 1183 | CX_TEST_ASSERT(cxListSize(list) == len / 2); |
universe@803 | 1184 | cx_for_n(k, len / 2) CX_TEST_ASSERT(*(int *) cxListAt(list, k) == testdata[k * 2]); |
universe@803 | 1185 | |
universe@803 | 1186 | free(testdata); |
universe@803 | 1187 | }) |
universe@803 | 1188 | |
universe@803 | 1189 | roll_out_test_combos(insert_with_iterator, { |
universe@803 | 1190 | int fivenums[] = array_init(0, 1, 2, 3, 4); |
universe@803 | 1191 | cx_for_n(i, 5) cxListAdd(list, &fivenums[i]); |
universe@803 | 1192 | int newdata[] = array_init(10, 20, 30, 40, 50); |
universe@803 | 1193 | |
universe@803 | 1194 | CxMutIterator iter = cxListMutIteratorAt(list, 2); |
universe@803 | 1195 | CX_TEST_ASSERT(cxIteratorValid(iter)); |
universe@803 | 1196 | CX_TEST_ASSERT(iter.index == 2); |
universe@803 | 1197 | CX_TEST_ASSERT(*(int *) cxIteratorCurrent(iter) == 2); |
universe@803 | 1198 | cxListInsertAfter(&iter, &newdata[0]); |
universe@803 | 1199 | CX_TEST_ASSERT(cxIteratorValid(iter)); |
universe@803 | 1200 | CX_TEST_ASSERT(iter.index == 2); |
universe@803 | 1201 | CX_TEST_ASSERT(*(int *) cxIteratorCurrent(iter) == 2); |
universe@803 | 1202 | cxListInsertBefore(&iter, &newdata[1]); |
universe@803 | 1203 | CX_TEST_ASSERT(cxIteratorValid(iter)); |
universe@803 | 1204 | CX_TEST_ASSERT(iter.index == 3); |
universe@803 | 1205 | CX_TEST_ASSERT(*(int *) cxIteratorCurrent(iter) == 2); |
universe@803 | 1206 | |
universe@803 | 1207 | iter = cxListMutIterator(list); |
universe@803 | 1208 | cxListInsertBefore(&iter, &newdata[2]); |
universe@803 | 1209 | CX_TEST_ASSERT(cxIteratorValid(iter)); |
universe@803 | 1210 | CX_TEST_ASSERT(iter.index == 1); |
universe@803 | 1211 | CX_TEST_ASSERT(*(int *) cxIteratorCurrent(iter) == 0); |
universe@803 | 1212 | iter = cxListMutIteratorAt(list, cxListSize(list)); |
universe@803 | 1213 | cxListInsertBefore(&iter, &newdata[3]); |
universe@803 | 1214 | CX_TEST_ASSERT(!cxIteratorValid(iter)); |
universe@803 | 1215 | CX_TEST_ASSERT(iter.index == 9); |
universe@803 | 1216 | iter = cxListMutIteratorAt(list, cxListSize(list)); |
universe@803 | 1217 | cxListInsertAfter(&iter, &newdata[4]); |
universe@803 | 1218 | CX_TEST_ASSERT(!cxIteratorValid(iter)); |
universe@803 | 1219 | CX_TEST_ASSERT(iter.index == 10); |
universe@803 | 1220 | |
universe@803 | 1221 | int expdata[] = array_init(30, 0, 1, 20, 2, 10, 3, 4, 40, 50); |
universe@803 | 1222 | cx_for_n (j, 10) CX_TEST_ASSERT(*(int *) cxListAt(list, j) == expdata[j]); |
universe@803 | 1223 | }) |
universe@803 | 1224 | |
universe@803 | 1225 | static CX_TEST_SUBROUTINE(test_list_verify_compare, CxList *left, CxList *right) { |
universe@803 | 1226 | CX_TEST_ASSERTM(cxListCompare(left, right) == 0, "lists don't start identical"); |
universe@803 | 1227 | int x = 42; |
universe@803 | 1228 | cxListAdd(left, &x); |
universe@803 | 1229 | CX_TEST_ASSERT(cxListSize(left) > cxListSize(right)); |
universe@803 | 1230 | CX_TEST_ASSERT(cxListCompare(left, right) > 0); |
universe@803 | 1231 | CX_TEST_ASSERT(cxListCompare(right, left) < 0); |
universe@803 | 1232 | cxListAdd(right, &x); |
universe@803 | 1233 | CX_TEST_ASSERT(cxListSize(left) == cxListSize(right)); |
universe@803 | 1234 | CX_TEST_ASSERT(cxListCompare(left, right) == 0); |
universe@803 | 1235 | int a = 5, b = 10; |
universe@803 | 1236 | cxListInsert(left, 15, &a); |
universe@803 | 1237 | cxListInsert(right, 15, &b); |
universe@803 | 1238 | CX_TEST_ASSERT(cxListSize(left) == cxListSize(right)); |
universe@803 | 1239 | CX_TEST_ASSERT(cxListCompare(left, right) < 0); |
universe@803 | 1240 | CX_TEST_ASSERT(cxListCompare(right, left) > 0); |
universe@803 | 1241 | *(int *) cxListAt(left, 15) = 10; |
universe@803 | 1242 | CX_TEST_ASSERT(cxListCompare(left, right) == 0); |
universe@803 | 1243 | } |
universe@803 | 1244 | |
universe@803 | 1245 | #define roll_out_compare_tests(suffix, otherctr) \ |
universe@803 | 1246 | roll_out_test_combos(compare_##suffix, { \ |
universe@803 | 1247 | const size_t len = 47; \ |
universe@803 | 1248 | int *testdata = int_test_data_added_to_list(list, isptrlist, len); \ |
universe@803 | 1249 | CxList *other = otherctr; \ |
universe@803 | 1250 | cx_for_n(i, len) cxListAdd(other, &testdata[i]); \ |
universe@803 | 1251 | CX_TEST_CALL_SUBROUTINE(test_list_verify_compare, list, other); \ |
universe@803 | 1252 | cxListDestroy(other); \ |
universe@803 | 1253 | free(testdata); \ |
universe@803 | 1254 | }) |
universe@803 | 1255 | |
universe@803 | 1256 | roll_out_compare_tests( |
universe@803 | 1257 | ll, cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, sizeof(int)) |
universe@803 | 1258 | ) |
universe@803 | 1259 | |
universe@803 | 1260 | roll_out_compare_tests( |
universe@803 | 1261 | pll, cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS) |
universe@803 | 1262 | ) |
universe@803 | 1263 | |
universe@803 | 1264 | roll_out_compare_tests( |
universe@803 | 1265 | arl, cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, sizeof(int), 50) |
universe@803 | 1266 | ) |
universe@803 | 1267 | |
universe@803 | 1268 | roll_out_compare_tests( |
universe@803 | 1269 | parl, cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 50) |
universe@803 | 1270 | ) |
universe@803 | 1271 | |
universe@803 | 1272 | static unsigned destr_test_ctr; |
universe@803 | 1273 | static int destr_last_value; |
universe@803 | 1274 | |
universe@803 | 1275 | static void simple_destr_test_fun(void *data) { |
universe@803 | 1276 | int *ptr = data; |
universe@803 | 1277 | destr_last_value = *ptr; |
universe@803 | 1278 | *ptr = destr_last_value + 1; |
universe@803 | 1279 | destr_test_ctr++; |
universe@803 | 1280 | } |
universe@803 | 1281 | |
universe@803 | 1282 | static void advanced_destr_test_fun(__attribute__((__unused__)) void *u, void *data) { |
universe@803 | 1283 | simple_destr_test_fun(data); |
universe@803 | 1284 | } |
universe@803 | 1285 | |
universe@803 | 1286 | static CX_TEST_SUBROUTINE(test_list_verify_destructor, CxList *list, |
universe@803 | 1287 | int const *testdata, size_t testdata_len) { |
universe@803 | 1288 | destr_test_ctr = 0; |
universe@803 | 1289 | |
universe@803 | 1290 | int off = cxListIsStoringPointers(list) ? 1 : 0; |
universe@803 | 1291 | |
universe@803 | 1292 | cxListRemove(list, 15); |
universe@803 | 1293 | CX_TEST_ASSERT(1 == destr_test_ctr); |
universe@803 | 1294 | CX_TEST_ASSERT(testdata[15] == destr_last_value + off); |
universe@803 | 1295 | CX_TEST_ASSERT(testdata_len - destr_test_ctr == cxListSize(list)); |
universe@803 | 1296 | cxListRemove(list, 47); |
universe@803 | 1297 | CX_TEST_ASSERT(2 == destr_test_ctr); |
universe@803 | 1298 | CX_TEST_ASSERT(testdata[48] == destr_last_value + off); |
universe@803 | 1299 | CX_TEST_ASSERT(testdata_len - destr_test_ctr == cxListSize(list)); |
universe@803 | 1300 | |
universe@803 | 1301 | CxMutIterator iter = cxListMutIteratorAt(list, 7); |
universe@803 | 1302 | cxIteratorNext(iter); |
universe@803 | 1303 | CX_TEST_ASSERT(2 == destr_test_ctr); |
universe@803 | 1304 | CX_TEST_ASSERT(testdata[48] == destr_last_value + off); |
universe@803 | 1305 | CX_TEST_ASSERT(testdata_len - destr_test_ctr == cxListSize(list)); |
universe@803 | 1306 | cxIteratorFlagRemoval(iter); |
universe@803 | 1307 | cxIteratorNext(iter); |
universe@803 | 1308 | CX_TEST_ASSERT(3 == destr_test_ctr); |
universe@803 | 1309 | CX_TEST_ASSERT(testdata[8] == destr_last_value + off); |
universe@803 | 1310 | CX_TEST_ASSERT(testdata_len - destr_test_ctr == cxListSize(list)); |
universe@803 | 1311 | |
universe@803 | 1312 | iter = cxListMutBackwardsIteratorAt(list, 5); |
universe@803 | 1313 | cxIteratorNext(iter); |
universe@803 | 1314 | CX_TEST_ASSERT(3 == destr_test_ctr); |
universe@803 | 1315 | CX_TEST_ASSERT(testdata[8] == destr_last_value + off); |
universe@803 | 1316 | CX_TEST_ASSERT(testdata_len - destr_test_ctr == cxListSize(list)); |
universe@803 | 1317 | cxIteratorFlagRemoval(iter); |
universe@803 | 1318 | cxIteratorNext(iter); |
universe@803 | 1319 | CX_TEST_ASSERT(4 == destr_test_ctr); |
universe@803 | 1320 | CX_TEST_ASSERT(testdata[4] == destr_last_value + off); |
universe@803 | 1321 | CX_TEST_ASSERT(testdata_len - destr_test_ctr == cxListSize(list)); |
universe@803 | 1322 | |
universe@803 | 1323 | cxListClear(list); |
universe@803 | 1324 | CX_TEST_ASSERT(testdata_len == destr_test_ctr); |
universe@803 | 1325 | CX_TEST_ASSERT(testdata[testdata_len - 1] == destr_last_value + off); |
universe@803 | 1326 | } |
universe@803 | 1327 | |
universe@803 | 1328 | roll_out_test_combos(simple_destr, { |
universe@803 | 1329 | const size_t len = 60; |
universe@803 | 1330 | int *testdata = int_test_data_added_to_list(list, isptrlist, len); |
universe@803 | 1331 | list->simple_destructor = simple_destr_test_fun; |
universe@803 | 1332 | CX_TEST_CALL_SUBROUTINE(test_list_verify_destructor, list, testdata, len); |
universe@803 | 1333 | free(testdata); |
universe@803 | 1334 | }) |
universe@803 | 1335 | |
universe@803 | 1336 | roll_out_test_combos(advanced_destr, { |
universe@803 | 1337 | const size_t len = 75; |
universe@803 | 1338 | int *testdata = int_test_data_added_to_list(list, isptrlist, len); |
universe@803 | 1339 | list->advanced_destructor = advanced_destr_test_fun; |
universe@803 | 1340 | CX_TEST_CALL_SUBROUTINE(test_list_verify_destructor, list, testdata, len); |
universe@803 | 1341 | free(testdata); |
universe@803 | 1342 | }) |
universe@803 | 1343 | |
universe@798 | 1344 | CxTestSuite *cx_test_suite_array_list(void) { |
universe@798 | 1345 | CxTestSuite *suite = cx_test_suite_new("array_list"); |
universe@798 | 1346 | |
universe@801 | 1347 | cx_test_register(suite, test_list_arl_create); |
universe@801 | 1348 | cx_test_register(suite, test_list_arl_create_simple); |
universe@801 | 1349 | cx_test_register(suite, test_list_arl_create_simple_for_pointers); |
universe@801 | 1350 | cx_test_register(suite, test_list_parl_destroy_no_destr); |
universe@801 | 1351 | cx_test_register(suite, test_list_parl_destroy_simple_destr); |
universe@801 | 1352 | cx_test_register(suite, test_list_parl_destroy_adv_destr); |
universe@801 | 1353 | |
universe@803 | 1354 | cx_test_register(suite, test_list_arl_add); |
universe@803 | 1355 | cx_test_register(suite, test_list_parl_add); |
universe@803 | 1356 | cx_test_register(suite, test_list_arl_insert); |
universe@803 | 1357 | cx_test_register(suite, test_list_parl_insert); |
universe@803 | 1358 | cx_test_register(suite, test_list_arl_insert_array); |
universe@803 | 1359 | cx_test_register(suite, test_list_parl_insert_array); |
universe@803 | 1360 | cx_test_register(suite, test_list_arl_remove); |
universe@803 | 1361 | cx_test_register(suite, test_list_parl_remove); |
universe@803 | 1362 | cx_test_register(suite, test_list_arl_find_remove); |
universe@803 | 1363 | cx_test_register(suite, test_list_parl_find_remove); |
universe@803 | 1364 | cx_test_register(suite, test_list_arl_clear); |
universe@803 | 1365 | cx_test_register(suite, test_list_parl_clear); |
universe@803 | 1366 | cx_test_register(suite, test_list_arl_at); |
universe@803 | 1367 | cx_test_register(suite, test_list_parl_at); |
universe@803 | 1368 | cx_test_register(suite, test_list_arl_swap); |
universe@803 | 1369 | cx_test_register(suite, test_list_parl_swap); |
universe@803 | 1370 | cx_test_register(suite, test_list_arl_swap_no_sbo); |
universe@803 | 1371 | cx_test_register(suite, test_list_parl_swap_no_sbo); |
universe@803 | 1372 | cx_test_register(suite, test_list_arl_find); |
universe@803 | 1373 | cx_test_register(suite, test_list_parl_find); |
universe@803 | 1374 | cx_test_register(suite, test_list_arl_sort); |
universe@803 | 1375 | cx_test_register(suite, test_list_parl_sort); |
universe@803 | 1376 | cx_test_register(suite, test_list_arl_reverse); |
universe@803 | 1377 | cx_test_register(suite, test_list_parl_reverse); |
universe@803 | 1378 | cx_test_register(suite, test_list_arl_iterator); |
universe@803 | 1379 | cx_test_register(suite, test_list_parl_iterator); |
universe@803 | 1380 | cx_test_register(suite, test_list_arl_insert_with_iterator); |
universe@803 | 1381 | cx_test_register(suite, test_list_parl_insert_with_iterator); |
universe@803 | 1382 | cx_test_register(suite, test_list_arl_compare_ll); |
universe@803 | 1383 | cx_test_register(suite, test_list_arl_compare_arl); |
universe@803 | 1384 | cx_test_register(suite, test_list_arl_compare_pll); |
universe@803 | 1385 | cx_test_register(suite, test_list_arl_compare_parl); |
universe@803 | 1386 | cx_test_register(suite, test_list_parl_compare_ll); |
universe@803 | 1387 | cx_test_register(suite, test_list_parl_compare_arl); |
universe@803 | 1388 | cx_test_register(suite, test_list_parl_compare_pll); |
universe@803 | 1389 | cx_test_register(suite, test_list_parl_compare_parl); |
universe@803 | 1390 | cx_test_register(suite, test_list_arl_simple_destr); |
universe@803 | 1391 | cx_test_register(suite, test_list_parl_simple_destr); |
universe@803 | 1392 | cx_test_register(suite, test_list_arl_advanced_destr); |
universe@803 | 1393 | cx_test_register(suite, test_list_parl_advanced_destr); |
universe@803 | 1394 | |
universe@798 | 1395 | return suite; |
universe@798 | 1396 | } |
universe@798 | 1397 | |
universe@798 | 1398 | CxTestSuite *cx_test_suite_linked_list(void) { |
universe@798 | 1399 | CxTestSuite *suite = cx_test_suite_new("linked_list"); |
universe@798 | 1400 | |
universe@798 | 1401 | cx_test_register(suite, test_linked_list_link_unlink); |
universe@798 | 1402 | cx_test_register(suite, test_linked_list_at); |
universe@798 | 1403 | cx_test_register(suite, test_linked_list_find); |
universe@798 | 1404 | cx_test_register(suite, test_linked_list_compare); |
universe@798 | 1405 | cx_test_register(suite, test_linked_list_add); |
universe@798 | 1406 | cx_test_register(suite, test_linked_list_prepend); |
universe@798 | 1407 | cx_test_register(suite, test_linked_list_insert); |
universe@798 | 1408 | cx_test_register(suite, test_linked_list_insert_chain); |
universe@798 | 1409 | cx_test_register(suite, test_linked_list_first); |
universe@798 | 1410 | cx_test_register(suite, test_linked_list_last); |
universe@798 | 1411 | cx_test_register(suite, test_linked_list_prev); |
universe@798 | 1412 | cx_test_register(suite, test_linked_list_remove); |
universe@798 | 1413 | cx_test_register(suite, test_linked_list_size); |
universe@798 | 1414 | cx_test_register(suite, test_linked_list_sort_empty); |
universe@798 | 1415 | cx_test_register(suite, test_linked_list_sort); |
universe@798 | 1416 | cx_test_register(suite, test_linked_list_reverse); |
universe@798 | 1417 | |
universe@801 | 1418 | cx_test_register(suite, test_list_ll_create); |
universe@801 | 1419 | cx_test_register(suite, test_list_ll_create_simple); |
universe@801 | 1420 | cx_test_register(suite, test_list_ll_store_pointers); |
universe@801 | 1421 | cx_test_register(suite, test_list_ll_create_simple_for_pointers); |
universe@801 | 1422 | cx_test_register(suite, test_list_pll_destroy_no_destr); |
universe@801 | 1423 | cx_test_register(suite, test_list_pll_destroy_simple_destr); |
universe@801 | 1424 | cx_test_register(suite, test_list_pll_destroy_adv_destr); |
universe@801 | 1425 | |
universe@803 | 1426 | cx_test_register(suite, test_list_ll_add); |
universe@803 | 1427 | cx_test_register(suite, test_list_pll_add); |
universe@803 | 1428 | cx_test_register(suite, test_list_ll_insert); |
universe@803 | 1429 | cx_test_register(suite, test_list_pll_insert); |
universe@803 | 1430 | cx_test_register(suite, test_list_ll_insert_array); |
universe@803 | 1431 | cx_test_register(suite, test_list_pll_insert_array); |
universe@803 | 1432 | cx_test_register(suite, test_list_ll_remove); |
universe@803 | 1433 | cx_test_register(suite, test_list_pll_remove); |
universe@803 | 1434 | cx_test_register(suite, test_list_ll_find_remove); |
universe@803 | 1435 | cx_test_register(suite, test_list_pll_find_remove); |
universe@803 | 1436 | cx_test_register(suite, test_list_ll_clear); |
universe@803 | 1437 | cx_test_register(suite, test_list_pll_clear); |
universe@803 | 1438 | cx_test_register(suite, test_list_ll_at); |
universe@803 | 1439 | cx_test_register(suite, test_list_pll_at); |
universe@803 | 1440 | cx_test_register(suite, test_list_ll_swap); |
universe@803 | 1441 | cx_test_register(suite, test_list_pll_swap); |
universe@803 | 1442 | cx_test_register(suite, test_list_ll_swap_no_sbo); |
universe@803 | 1443 | cx_test_register(suite, test_list_pll_swap_no_sbo); |
universe@803 | 1444 | cx_test_register(suite, test_list_ll_find); |
universe@803 | 1445 | cx_test_register(suite, test_list_pll_find); |
universe@803 | 1446 | cx_test_register(suite, test_list_ll_sort); |
universe@803 | 1447 | cx_test_register(suite, test_list_pll_sort); |
universe@803 | 1448 | cx_test_register(suite, test_list_ll_reverse); |
universe@803 | 1449 | cx_test_register(suite, test_list_pll_reverse); |
universe@803 | 1450 | cx_test_register(suite, test_list_ll_iterator); |
universe@803 | 1451 | cx_test_register(suite, test_list_pll_iterator); |
universe@803 | 1452 | cx_test_register(suite, test_list_ll_insert_with_iterator); |
universe@803 | 1453 | cx_test_register(suite, test_list_pll_insert_with_iterator); |
universe@803 | 1454 | cx_test_register(suite, test_list_ll_compare_ll); |
universe@803 | 1455 | cx_test_register(suite, test_list_ll_compare_arl); |
universe@803 | 1456 | cx_test_register(suite, test_list_ll_compare_pll); |
universe@803 | 1457 | cx_test_register(suite, test_list_ll_compare_parl); |
universe@803 | 1458 | cx_test_register(suite, test_list_pll_compare_ll); |
universe@803 | 1459 | cx_test_register(suite, test_list_pll_compare_arl); |
universe@803 | 1460 | cx_test_register(suite, test_list_pll_compare_pll); |
universe@803 | 1461 | cx_test_register(suite, test_list_pll_compare_parl); |
universe@803 | 1462 | cx_test_register(suite, test_list_ll_simple_destr); |
universe@803 | 1463 | cx_test_register(suite, test_list_pll_simple_destr); |
universe@803 | 1464 | cx_test_register(suite, test_list_ll_advanced_destr); |
universe@803 | 1465 | cx_test_register(suite, test_list_pll_advanced_destr); |
universe@803 | 1466 | |
universe@798 | 1467 | return suite; |
universe@798 | 1468 | } |
universe@798 | 1469 | |
universe@800 | 1470 | CxTestSuite *cx_test_suite_empty_list(void) { |
universe@800 | 1471 | CxTestSuite *suite = cx_test_suite_new("empty list dummy"); |
universe@800 | 1472 | |
universe@800 | 1473 | cx_test_register(suite, test_empty_list_size); |
universe@800 | 1474 | cx_test_register(suite, test_empty_list_iterator); |
universe@800 | 1475 | cx_test_register(suite, test_empty_list_noops); |
universe@800 | 1476 | cx_test_register(suite, test_empty_list_at); |
universe@800 | 1477 | cx_test_register(suite, test_empty_list_find); |
universe@800 | 1478 | cx_test_register(suite, test_empty_list_compare); |
universe@800 | 1479 | |
universe@800 | 1480 | return suite; |
universe@800 | 1481 | } |