Tue, 28 Dec 2021 14:25:05 +0100
use c99 bool + add test for low level find
universe@390 | 1 | /* |
universe@390 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@390 | 3 | * |
universe@390 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
universe@390 | 5 | * |
universe@390 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@390 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@390 | 8 | * |
universe@390 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@390 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@390 | 11 | * |
universe@390 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@390 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@390 | 14 | * documentation and/or other materials provided with the distribution. |
universe@390 | 15 | * |
universe@390 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@390 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@390 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@390 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@390 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@390 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@390 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@390 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@390 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@390 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@390 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@390 | 27 | */ |
universe@390 | 28 | |
universe@398 | 29 | #include "cx/linked_list.h" |
universe@411 | 30 | #include "test_config.h" |
universe@422 | 31 | #include "util_allocator.h" |
universe@398 | 32 | |
universe@486 | 33 | int cmp_int( |
universe@486 | 34 | int const *l, |
universe@486 | 35 | int const *r |
universe@486 | 36 | ) { |
universe@412 | 37 | int left = *l, right = *r; |
universe@412 | 38 | return left == right ? 0 : (left < right ? -1 : 1); |
universe@412 | 39 | } |
universe@412 | 40 | |
universe@486 | 41 | struct node { |
universe@486 | 42 | struct node *next; |
universe@486 | 43 | struct node *prev; |
universe@486 | 44 | int data; |
universe@486 | 45 | }; |
universe@486 | 46 | |
universe@486 | 47 | #define nd(name) name = {0} |
universe@486 | 48 | |
universe@486 | 49 | const ptrdiff_t loc_prev = offsetof(struct node, prev); |
universe@486 | 50 | const ptrdiff_t loc_next = offsetof(struct node, next); |
universe@486 | 51 | const ptrdiff_t loc_data = offsetof(struct node, data); |
universe@486 | 52 | |
universe@486 | 53 | struct node *create_test_data( |
universe@486 | 54 | size_t n, |
universe@486 | 55 | const int data[] |
universe@486 | 56 | ) { |
universe@486 | 57 | if (n == 0) return NULL; |
universe@486 | 58 | struct node *begin = calloc(1, sizeof(struct node)); |
universe@486 | 59 | struct node *prev = begin; |
universe@486 | 60 | if (data) begin->data = data[0]; |
universe@486 | 61 | for (size_t i = 1; i < n; i++) { |
universe@486 | 62 | struct node *node = calloc(1, sizeof(struct node)); |
universe@486 | 63 | if (data) node->data = data[i]; |
universe@486 | 64 | cx_linked_list_link(prev, node, loc_prev, loc_next); |
universe@486 | 65 | prev = node; |
universe@486 | 66 | } |
universe@486 | 67 | return begin; |
universe@486 | 68 | } |
universe@486 | 69 | |
universe@486 | 70 | void destroy_test_data(struct node *begin) { |
universe@486 | 71 | struct node *node = begin; |
universe@486 | 72 | while (node) { |
universe@486 | 73 | struct node *next = node->next; |
universe@486 | 74 | free(node); |
universe@486 | 75 | node = next; |
universe@486 | 76 | } |
universe@486 | 77 | } |
universe@486 | 78 | |
universe@482 | 79 | void test_linked_list_link_unlink(void) { |
universe@482 | 80 | |
universe@486 | 81 | struct node nd(a), nd(b), nd(c); |
universe@482 | 82 | |
universe@482 | 83 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@482 | 84 | CU_ASSERT_PTR_NULL(a.prev) |
universe@482 | 85 | CU_ASSERT_PTR_EQUAL(a.next, &b) |
universe@482 | 86 | CU_ASSERT_PTR_EQUAL(b.prev, &a) |
universe@482 | 87 | CU_ASSERT_PTR_NULL(b.next) |
universe@482 | 88 | |
universe@482 | 89 | cx_linked_list_unlink(&a, &b, loc_prev, loc_next); |
universe@482 | 90 | CU_ASSERT_PTR_NULL(a.prev) |
universe@482 | 91 | CU_ASSERT_PTR_NULL(a.next) |
universe@482 | 92 | CU_ASSERT_PTR_NULL(b.prev) |
universe@482 | 93 | CU_ASSERT_PTR_NULL(b.next) |
universe@482 | 94 | |
universe@482 | 95 | cx_linked_list_link(&b, &c, loc_prev, loc_next); |
universe@482 | 96 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@482 | 97 | cx_linked_list_unlink(&b, &c, loc_prev, loc_next); |
universe@482 | 98 | CU_ASSERT_PTR_NULL(a.prev) |
universe@482 | 99 | CU_ASSERT_PTR_EQUAL(a.next, &b) |
universe@482 | 100 | CU_ASSERT_PTR_EQUAL(b.prev, &a) |
universe@482 | 101 | CU_ASSERT_PTR_NULL(b.next) |
universe@482 | 102 | CU_ASSERT_PTR_NULL(c.prev) |
universe@482 | 103 | CU_ASSERT_PTR_NULL(c.next) |
universe@482 | 104 | } |
universe@482 | 105 | |
universe@438 | 106 | void test_linked_list_at(void) { |
universe@486 | 107 | struct node nd(a), nd(b), nd(c), nd(d); |
universe@486 | 108 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@486 | 109 | cx_linked_list_link(&b, &c, loc_prev, loc_next); |
universe@486 | 110 | cx_linked_list_link(&c, &d, loc_prev, loc_next); |
universe@438 | 111 | |
universe@449 | 112 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&a, 0, loc_next, 0), &a) |
universe@449 | 113 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&a, 0, loc_next, 1), &b) |
universe@449 | 114 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&a, 0, loc_next, 2), &c) |
universe@449 | 115 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&a, 0, loc_next, 3), &d) |
universe@449 | 116 | CU_ASSERT_PTR_NULL(cx_linked_list_at(&a, 0, loc_next, 4)) |
universe@438 | 117 | |
universe@449 | 118 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&b, 1, loc_prev, 0), &a) |
universe@449 | 119 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&b, 1, loc_next, 1), &b) |
universe@449 | 120 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&b, 1, loc_next, 2), &c) |
universe@449 | 121 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&b, 1, loc_next, 3), &d) |
universe@449 | 122 | CU_ASSERT_PTR_NULL(cx_linked_list_at(&b, 1, loc_next, 4)) |
universe@438 | 123 | |
universe@449 | 124 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&d, 3, loc_prev, 0), &a) |
universe@449 | 125 | CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&d, 3, loc_prev, 1), &b) |
universe@438 | 126 | } |
universe@438 | 127 | |
universe@487 | 128 | void test_linked_list_find(void) { |
universe@487 | 129 | int data[] = {2, 4, 6, 8}; |
universe@487 | 130 | void *list = create_test_data(4, data); |
universe@487 | 131 | int s; |
universe@487 | 132 | |
universe@487 | 133 | s = 2; |
universe@487 | 134 | CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data, |
universe@487 | 135 | false, (CxListComparator) cmp_int, &s), 0) |
universe@487 | 136 | s = 4; |
universe@487 | 137 | CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data, |
universe@487 | 138 | false, (CxListComparator) cmp_int, &s), 1) |
universe@487 | 139 | s = 6; |
universe@487 | 140 | CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data, |
universe@487 | 141 | false, (CxListComparator) cmp_int, &s), 2) |
universe@487 | 142 | s = 8; |
universe@487 | 143 | CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data, |
universe@487 | 144 | false, (CxListComparator) cmp_int, &s), 3) |
universe@487 | 145 | s = 10; |
universe@487 | 146 | CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data, |
universe@487 | 147 | false, (CxListComparator) cmp_int, &s), 4) |
universe@487 | 148 | s = -2; |
universe@487 | 149 | CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data, |
universe@487 | 150 | false, (CxListComparator) cmp_int, &s), 4) |
universe@487 | 151 | } |
universe@487 | 152 | |
universe@486 | 153 | void test_linked_list_compare(void) { |
universe@486 | 154 | int a[] = {2, 4, 6, 8}; |
universe@486 | 155 | int b[] = {2, 4, 6}; |
universe@486 | 156 | int c[] = {2, 4, 6, 9}; |
universe@486 | 157 | |
universe@486 | 158 | void *la = create_test_data(4, a); |
universe@486 | 159 | void *lb = create_test_data(3, b); |
universe@486 | 160 | void *lc = create_test_data(4, c); |
universe@486 | 161 | |
universe@486 | 162 | CU_ASSERT_TRUE(0 < cx_linked_list_compare(la, lb, loc_next, loc_data, |
universe@487 | 163 | false, (CxListComparator) cmp_int) |
universe@486 | 164 | ) |
universe@486 | 165 | CU_ASSERT_TRUE(0 > cx_linked_list_compare(lb, la, loc_next, loc_data, |
universe@487 | 166 | false, (CxListComparator) cmp_int) |
universe@486 | 167 | ) |
universe@486 | 168 | CU_ASSERT_TRUE(0 < cx_linked_list_compare(lc, la, loc_next, loc_data, |
universe@487 | 169 | false, (CxListComparator) cmp_int) |
universe@486 | 170 | ) |
universe@486 | 171 | CU_ASSERT_TRUE(0 > cx_linked_list_compare(la, lc, loc_next, loc_data, |
universe@487 | 172 | false, (CxListComparator) cmp_int) |
universe@486 | 173 | ) |
universe@486 | 174 | CU_ASSERT_TRUE(0 == cx_linked_list_compare(la, la, loc_next, loc_data, |
universe@487 | 175 | false, (CxListComparator) cmp_int) |
universe@486 | 176 | ) |
universe@486 | 177 | |
universe@486 | 178 | destroy_test_data(la); |
universe@486 | 179 | destroy_test_data(lb); |
universe@486 | 180 | destroy_test_data(lc); |
universe@486 | 181 | } |
universe@486 | 182 | |
olaf@444 | 183 | void test_linked_list_add(void) { |
olaf@442 | 184 | struct node nodes[4]; |
universe@486 | 185 | void *begin, *end; |
universe@449 | 186 | |
olaf@442 | 187 | // test with begin, end / prev, next |
universe@449 | 188 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@486 | 189 | begin = end = NULL; |
universe@449 | 190 | |
universe@453 | 191 | cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]); |
universe@449 | 192 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@449 | 193 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 194 | CU_ASSERT_PTR_NULL(nodes[0].prev) |
universe@475 | 195 | CU_ASSERT_PTR_NULL(nodes[0].next) |
universe@449 | 196 | |
universe@453 | 197 | cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]); |
universe@449 | 198 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@449 | 199 | CU_ASSERT_PTR_EQUAL(end, &nodes[1]) |
universe@449 | 200 | CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1]) |
universe@449 | 201 | CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0]) |
universe@449 | 202 | |
olaf@442 | 203 | // test with begin only / prev, next |
universe@449 | 204 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@486 | 205 | begin = end = NULL; |
universe@449 | 206 | |
universe@453 | 207 | cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[0]); |
universe@449 | 208 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@453 | 209 | cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[1]); |
universe@449 | 210 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@449 | 211 | CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1]) |
universe@449 | 212 | CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0]) |
universe@449 | 213 | |
universe@453 | 214 | cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[2]); |
universe@449 | 215 | CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[2]) |
universe@449 | 216 | CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[1]) |
universe@449 | 217 | |
universe@475 | 218 | // test with end only / prev, next |
universe@475 | 219 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@486 | 220 | begin = end = NULL; |
universe@475 | 221 | |
universe@475 | 222 | cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[0]); |
universe@475 | 223 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 224 | cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[1]); |
universe@475 | 225 | CU_ASSERT_PTR_EQUAL(end, &nodes[1]) |
universe@475 | 226 | CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1]) |
universe@475 | 227 | CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0]) |
universe@475 | 228 | |
universe@475 | 229 | cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[2]); |
universe@475 | 230 | CU_ASSERT_PTR_EQUAL(end, &nodes[2]) |
universe@475 | 231 | CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[2]) |
universe@475 | 232 | CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[1]) |
universe@475 | 233 | |
olaf@442 | 234 | // test with begin, end / next |
universe@449 | 235 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@486 | 236 | begin = end = NULL; |
universe@449 | 237 | |
universe@453 | 238 | cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]); |
universe@449 | 239 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@449 | 240 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@453 | 241 | cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]); |
universe@449 | 242 | CU_ASSERT_PTR_EQUAL(end, &nodes[1]) |
universe@449 | 243 | CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1]) |
universe@449 | 244 | CU_ASSERT_PTR_NULL(nodes[1].prev) |
olaf@442 | 245 | } |
olaf@442 | 246 | |
universe@475 | 247 | void test_linked_list_prepend(void) { |
universe@475 | 248 | struct node nodes[4]; |
universe@486 | 249 | void *begin, *end; |
universe@475 | 250 | |
universe@475 | 251 | // test with begin, end / prev, next |
universe@475 | 252 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@486 | 253 | begin = end = NULL; |
universe@475 | 254 | |
universe@475 | 255 | cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]); |
universe@475 | 256 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@475 | 257 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 258 | CU_ASSERT_PTR_NULL(nodes[0].prev) |
universe@475 | 259 | CU_ASSERT_PTR_NULL(nodes[0].next) |
universe@475 | 260 | |
universe@475 | 261 | cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]); |
universe@475 | 262 | CU_ASSERT_PTR_EQUAL(begin, &nodes[1]) |
universe@475 | 263 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 264 | CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[0]) |
universe@475 | 265 | CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[1]) |
universe@475 | 266 | |
universe@475 | 267 | // test with begin only / prev, next |
universe@475 | 268 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@486 | 269 | begin = end = NULL; |
universe@475 | 270 | |
universe@475 | 271 | cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[0]); |
universe@475 | 272 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@475 | 273 | cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[1]); |
universe@475 | 274 | CU_ASSERT_PTR_EQUAL(begin, &nodes[1]) |
universe@475 | 275 | CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[0]) |
universe@475 | 276 | CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[1]) |
universe@475 | 277 | |
universe@475 | 278 | cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[2]); |
universe@475 | 279 | CU_ASSERT_PTR_EQUAL(begin, &nodes[2]) |
universe@475 | 280 | CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[1]) |
universe@475 | 281 | CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[2]) |
universe@475 | 282 | |
universe@475 | 283 | // test with end only / prev, next |
universe@475 | 284 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@486 | 285 | begin = end = NULL; |
universe@475 | 286 | |
universe@475 | 287 | cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[0]); |
universe@475 | 288 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 289 | cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[1]); |
universe@475 | 290 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 291 | CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[0]) |
universe@475 | 292 | CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[1]) |
universe@475 | 293 | |
universe@475 | 294 | cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[2]); |
universe@475 | 295 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 296 | CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[1]) |
universe@475 | 297 | CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[2]) |
universe@475 | 298 | |
universe@475 | 299 | // test with begin, end / next |
universe@475 | 300 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@486 | 301 | begin = end = NULL; |
universe@475 | 302 | |
universe@475 | 303 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]); |
universe@475 | 304 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@475 | 305 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 306 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]); |
universe@475 | 307 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]); |
universe@475 | 308 | CU_ASSERT_PTR_EQUAL(begin, &nodes[2]) |
universe@475 | 309 | CU_ASSERT_PTR_EQUAL(end, &nodes[0]) |
universe@475 | 310 | CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[0]) |
universe@475 | 311 | CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[1]) |
universe@475 | 312 | CU_ASSERT_PTR_NULL(nodes[1].prev) |
universe@475 | 313 | CU_ASSERT_PTR_NULL(nodes[0].prev) |
universe@475 | 314 | } |
universe@475 | 315 | |
universe@482 | 316 | void test_linked_list_insert(void) { |
universe@482 | 317 | struct node nodes[4]; |
universe@482 | 318 | void *begin, *end; |
universe@482 | 319 | |
universe@482 | 320 | // insert mid list |
universe@482 | 321 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@482 | 322 | begin = &nodes[0]; |
universe@482 | 323 | end = &nodes[2]; |
universe@482 | 324 | |
universe@482 | 325 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@482 | 326 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 327 | |
universe@482 | 328 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]); |
universe@482 | 329 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@482 | 330 | CU_ASSERT_PTR_EQUAL(end, &nodes[2]) |
universe@482 | 331 | CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[3]) |
universe@482 | 332 | CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[3]) |
universe@482 | 333 | CU_ASSERT_PTR_EQUAL(nodes[3].prev, &nodes[1]) |
universe@482 | 334 | CU_ASSERT_PTR_EQUAL(nodes[3].next, &nodes[2]) |
universe@482 | 335 | |
universe@482 | 336 | // insert end |
universe@482 | 337 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@482 | 338 | begin = &nodes[0]; |
universe@482 | 339 | end = &nodes[2]; |
universe@482 | 340 | |
universe@482 | 341 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@482 | 342 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 343 | |
universe@482 | 344 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]); |
universe@482 | 345 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@482 | 346 | CU_ASSERT_PTR_EQUAL(end, &nodes[3]) |
universe@482 | 347 | CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[3]) |
universe@482 | 348 | CU_ASSERT_PTR_EQUAL(nodes[3].prev, &nodes[2]) |
universe@482 | 349 | CU_ASSERT_PTR_NULL(nodes[3].next) |
universe@482 | 350 | |
universe@482 | 351 | // insert begin |
universe@482 | 352 | memset(nodes, 0, 4 * sizeof(struct node)); |
universe@482 | 353 | begin = &nodes[0]; |
universe@482 | 354 | end = &nodes[2]; |
universe@482 | 355 | |
universe@482 | 356 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@482 | 357 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 358 | |
universe@482 | 359 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, NULL, &nodes[3]); |
universe@482 | 360 | CU_ASSERT_PTR_EQUAL(begin, &nodes[3]) |
universe@482 | 361 | CU_ASSERT_PTR_EQUAL(end, &nodes[2]) |
universe@482 | 362 | CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[3]) |
universe@482 | 363 | CU_ASSERT_PTR_NULL(nodes[3].prev) |
universe@482 | 364 | CU_ASSERT_PTR_EQUAL(nodes[3].next, &nodes[0]) |
universe@482 | 365 | } |
universe@482 | 366 | |
universe@482 | 367 | void test_linked_list_insert_chain(void) { |
universe@482 | 368 | struct node nodes[5]; |
universe@482 | 369 | void *begin, *end; |
universe@482 | 370 | |
universe@482 | 371 | // insert mid list |
universe@482 | 372 | memset(nodes, 0, 5 * sizeof(struct node)); |
universe@482 | 373 | begin = &nodes[0]; |
universe@482 | 374 | end = &nodes[2]; |
universe@482 | 375 | |
universe@482 | 376 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@482 | 377 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 378 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@482 | 379 | |
universe@482 | 380 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], NULL); |
universe@482 | 381 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@482 | 382 | CU_ASSERT_PTR_EQUAL(end, &nodes[2]) |
universe@482 | 383 | CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[3]) |
universe@482 | 384 | CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[4]) |
universe@482 | 385 | CU_ASSERT_PTR_EQUAL(nodes[3].prev, &nodes[1]) |
universe@482 | 386 | CU_ASSERT_PTR_EQUAL(nodes[4].next, &nodes[2]) |
universe@482 | 387 | |
universe@482 | 388 | // insert end |
universe@482 | 389 | memset(nodes, 0, 5 * sizeof(struct node)); |
universe@482 | 390 | begin = &nodes[0]; |
universe@482 | 391 | end = &nodes[2]; |
universe@482 | 392 | |
universe@482 | 393 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@482 | 394 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 395 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@482 | 396 | |
universe@482 | 397 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], NULL); |
universe@482 | 398 | CU_ASSERT_PTR_EQUAL(begin, &nodes[0]) |
universe@482 | 399 | CU_ASSERT_PTR_EQUAL(end, &nodes[4]) |
universe@482 | 400 | CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[3]) |
universe@482 | 401 | CU_ASSERT_PTR_EQUAL(nodes[3].prev, &nodes[2]) |
universe@482 | 402 | CU_ASSERT_PTR_NULL(nodes[4].next) |
universe@482 | 403 | |
universe@482 | 404 | // insert begin |
universe@482 | 405 | memset(nodes, 0, 5 * sizeof(struct node)); |
universe@482 | 406 | begin = &nodes[0]; |
universe@482 | 407 | end = &nodes[2]; |
universe@482 | 408 | |
universe@482 | 409 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@482 | 410 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 411 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@482 | 412 | |
universe@482 | 413 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, NULL, &nodes[3], NULL); |
universe@482 | 414 | CU_ASSERT_PTR_EQUAL(begin, &nodes[3]) |
universe@482 | 415 | CU_ASSERT_PTR_EQUAL(end, &nodes[2]) |
universe@482 | 416 | CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[4]) |
universe@482 | 417 | CU_ASSERT_PTR_NULL(nodes[3].prev) |
universe@482 | 418 | CU_ASSERT_PTR_EQUAL(nodes[4].next, &nodes[0]) |
universe@482 | 419 | } |
universe@482 | 420 | |
universe@475 | 421 | void test_linked_list_first(void) { |
universe@486 | 422 | struct node *begin = create_test_data(3, NULL); |
universe@486 | 423 | CU_ASSERT_PTR_EQUAL(cx_linked_list_first(begin, loc_prev), begin) |
universe@486 | 424 | CU_ASSERT_PTR_EQUAL(cx_linked_list_first(begin->next, loc_prev), begin) |
universe@486 | 425 | CU_ASSERT_PTR_EQUAL(cx_linked_list_first(begin->next->next, loc_prev), begin) |
universe@486 | 426 | destroy_test_data(begin); |
universe@475 | 427 | } |
universe@475 | 428 | |
universe@456 | 429 | void test_linked_list_last(void) { |
universe@486 | 430 | struct node *begin = create_test_data(3, NULL); |
universe@486 | 431 | struct node *end = begin->next->next; |
universe@486 | 432 | CU_ASSERT_PTR_EQUAL(cx_linked_list_last(begin, loc_next), end) |
universe@486 | 433 | CU_ASSERT_PTR_EQUAL(cx_linked_list_last(begin->next, loc_next), end) |
universe@486 | 434 | CU_ASSERT_PTR_EQUAL(cx_linked_list_last(begin->next->next, loc_next), end) |
universe@486 | 435 | destroy_test_data(begin); |
universe@456 | 436 | } |
universe@456 | 437 | |
universe@473 | 438 | void test_linked_list_prev(void) { |
universe@486 | 439 | struct node *begin = create_test_data(3, NULL); |
universe@486 | 440 | CU_ASSERT_PTR_NULL(cx_linked_list_prev(begin, loc_next, begin)) |
universe@486 | 441 | CU_ASSERT_PTR_EQUAL(cx_linked_list_prev(begin, loc_next, begin->next), begin) |
universe@486 | 442 | CU_ASSERT_PTR_EQUAL(cx_linked_list_prev(begin, loc_next, begin->next->next), begin->next) |
universe@486 | 443 | destroy_test_data(begin); |
universe@473 | 444 | } |
universe@473 | 445 | |
universe@473 | 446 | void test_linked_list_remove(void) { |
universe@486 | 447 | void *begin, *end; |
universe@473 | 448 | |
universe@486 | 449 | int data[] = {2, 4, 6}; |
universe@486 | 450 | begin = create_test_data(3, data); |
universe@486 | 451 | struct node *first = begin; |
universe@486 | 452 | struct node *second = first->next; |
universe@486 | 453 | struct node *third = second->next; |
universe@486 | 454 | end = third; |
universe@473 | 455 | |
universe@486 | 456 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second); |
universe@486 | 457 | CU_ASSERT_PTR_EQUAL(begin, first) |
universe@486 | 458 | CU_ASSERT_PTR_EQUAL(end, third) |
universe@486 | 459 | CU_ASSERT_PTR_NULL(first->prev) |
universe@486 | 460 | CU_ASSERT_PTR_EQUAL(first->next, third) |
universe@486 | 461 | CU_ASSERT_PTR_EQUAL(third->prev, first) |
universe@486 | 462 | CU_ASSERT_PTR_NULL(third->next) |
universe@473 | 463 | |
universe@486 | 464 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third); |
universe@486 | 465 | CU_ASSERT_PTR_EQUAL(begin, first) |
universe@486 | 466 | CU_ASSERT_PTR_EQUAL(end, first) |
universe@486 | 467 | CU_ASSERT_PTR_NULL(first->prev) |
universe@486 | 468 | CU_ASSERT_PTR_NULL(first->next) |
universe@473 | 469 | |
universe@486 | 470 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first); |
universe@473 | 471 | CU_ASSERT_PTR_NULL(begin) |
universe@473 | 472 | CU_ASSERT_PTR_NULL(end) |
universe@486 | 473 | |
universe@486 | 474 | free(first); |
universe@486 | 475 | free(second); |
universe@486 | 476 | free(third); |
universe@473 | 477 | } |
universe@473 | 478 | |
universe@468 | 479 | void test_linked_list_size(void) { |
universe@486 | 480 | struct node *list; |
universe@468 | 481 | |
universe@486 | 482 | CU_ASSERT_PTR_EQUAL(cx_linked_list_size(NULL, loc_next), 0) |
universe@468 | 483 | |
universe@486 | 484 | list = create_test_data(5, NULL); |
universe@486 | 485 | CU_ASSERT_EQUAL(cx_linked_list_size(list, loc_next), 5) |
universe@486 | 486 | destroy_test_data(list); |
universe@486 | 487 | |
universe@486 | 488 | list = create_test_data(13, NULL); |
universe@486 | 489 | CU_ASSERT_EQUAL(cx_linked_list_size(list, loc_next), 13) |
universe@486 | 490 | destroy_test_data(list); |
universe@468 | 491 | } |
universe@468 | 492 | |
universe@468 | 493 | void test_linked_list_sort(void) { |
universe@468 | 494 | int expected[] = { |
universe@468 | 495 | 14, 30, 151, 163, 227, 300, 315, 317, 363, 398, 417, 424, 438, 446, 508, 555, 605, 713, 716, 759, 761, 880, |
universe@468 | 496 | 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 1707, 1734, 1771, 1874, 1894, |
universe@468 | 497 | 1976, 2079, 2124, 2130, 2135, 2266, 2338, 2358, 2430, 2500, 2540, 2542, 2546, 2711, 2733, 2754, 2764, 2797, |
universe@468 | 498 | 2888, 2900, 3020, 3053, 3109, 3244, 3275, 3302, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 3675, 3677, |
universe@468 | 499 | 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681, |
universe@468 | 500 | 4785, 4791, 4801, 4859, 4903, 4973 |
universe@468 | 501 | }; |
universe@468 | 502 | int scrambled[] = { |
universe@468 | 503 | 759, 716, 880, 761, 2358, 2542, 2500, 2540, 2546, 2711, 2430, 1707, 1874, 1771, 1894, 1734, 1976, 2079, |
universe@468 | 504 | 2124, 2130, 2135, 2266, 2338, 2733, 2754, 2764, 2797, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 2888, |
universe@468 | 505 | 2900, 3020, 3053, 3109, 3244, 3275, 3302, 438, 446, 508, 555, 605, 713, 14, 30, 151, 163, 227, 300, |
universe@468 | 506 | 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 315, 317, 363, 398, 417, 424, |
universe@468 | 507 | 3675, 3677, 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4785, 4791, 4801, 4859, 4903, 4973, |
universe@468 | 508 | 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681 |
universe@468 | 509 | }; |
universe@468 | 510 | |
universe@486 | 511 | void *begin = create_test_data(100, scrambled); |
universe@486 | 512 | void *end = cx_linked_list_last(begin, loc_next); |
universe@468 | 513 | |
universe@486 | 514 | cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data, |
universe@487 | 515 | false, (CxListComparator) cmp_int); |
universe@468 | 516 | |
universe@468 | 517 | struct node *check = begin; |
universe@468 | 518 | struct node *check_last = NULL; |
universe@486 | 519 | CU_ASSERT_PTR_NULL(check->prev) |
universe@486 | 520 | CU_ASSERT_EQUAL(check->data, expected[0]) |
universe@473 | 521 | for (int i = 0; i < 100; i++) { |
universe@468 | 522 | CU_ASSERT_EQUAL(check->data, expected[i]) |
universe@468 | 523 | CU_ASSERT_PTR_EQUAL(check->prev, check_last) |
universe@468 | 524 | if (i < 99) { |
universe@468 | 525 | CU_ASSERT_PTR_NOT_NULL(check->next) |
universe@468 | 526 | } |
universe@468 | 527 | check_last = check; |
universe@468 | 528 | check = check->next; |
universe@468 | 529 | } |
universe@468 | 530 | CU_ASSERT_PTR_NULL(check) |
universe@486 | 531 | CU_ASSERT_PTR_EQUAL(end, check_last) |
universe@486 | 532 | |
universe@486 | 533 | destroy_test_data(begin); |
universe@468 | 534 | } |
universe@468 | 535 | |
universe@473 | 536 | void test_linked_list_reverse(void) { |
universe@486 | 537 | void *begin, *end; |
universe@473 | 538 | |
universe@486 | 539 | int data[] = {2, 4, 6, 8}; |
universe@486 | 540 | int reversed[] = {8, 6, 4, 2}; |
universe@473 | 541 | |
universe@486 | 542 | void *list = create_test_data(4, data); |
universe@486 | 543 | void *expected = create_test_data(4, reversed); |
universe@473 | 544 | |
universe@486 | 545 | begin = list; |
universe@486 | 546 | end = cx_linked_list_last(list, loc_next); |
universe@473 | 547 | |
universe@486 | 548 | cx_linked_list_reverse(&begin, &end, loc_prev, loc_next); |
universe@486 | 549 | CU_ASSERT_PTR_EQUAL(end, list) |
universe@486 | 550 | CU_ASSERT_PTR_EQUAL(begin, cx_linked_list_first(end, loc_prev)) |
universe@486 | 551 | CU_ASSERT_TRUE(0 == cx_linked_list_compare(begin, expected, loc_next, loc_data, |
universe@486 | 552 | 0, (CxListComparator) cmp_int)) |
universe@473 | 553 | |
universe@486 | 554 | destroy_test_data(begin); |
universe@486 | 555 | destroy_test_data(expected); |
universe@473 | 556 | } |
universe@456 | 557 | |
universe@456 | 558 | void test_hl_linked_list_create(void) { |
universe@455 | 559 | cxTestingAllocatorReset(); |
universe@455 | 560 | |
universe@455 | 561 | CxList list = cxLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int, sizeof(int)); |
universe@455 | 562 | |
universe@455 | 563 | CU_ASSERT_EQUAL(list->size, 0) |
universe@455 | 564 | CU_ASSERT_EQUAL(list->capacity, (size_t) -1) |
universe@455 | 565 | CU_ASSERT_PTR_EQUAL(list->allocator, cxTestingAllocator) |
universe@455 | 566 | CU_ASSERT_EQUAL(list->itemsize, sizeof(int)) |
universe@455 | 567 | CU_ASSERT_PTR_EQUAL(list->cmpfunc, cmp_int) |
universe@455 | 568 | |
universe@455 | 569 | cxLinkedListDestroy(list); |
universe@455 | 570 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@455 | 571 | } |
universe@455 | 572 | |
universe@459 | 573 | void test_hl_linked_list_add(void) { |
universe@459 | 574 | cxTestingAllocatorReset(); |
universe@459 | 575 | |
universe@459 | 576 | int data; |
universe@459 | 577 | CxList list = cxLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int, sizeof(int)); |
universe@459 | 578 | |
universe@459 | 579 | data = 5; |
universe@460 | 580 | CU_ASSERT_EQUAL(cxListAdd(list, &data), 0) |
universe@459 | 581 | data = 47; |
universe@460 | 582 | CU_ASSERT_EQUAL(cxListAdd(list, &data), 0) |
universe@459 | 583 | data = 13; |
universe@460 | 584 | CU_ASSERT_EQUAL(cxListAdd(list, &data), 0) |
universe@459 | 585 | |
universe@459 | 586 | CU_ASSERT_EQUAL(list->size, 3) |
universe@459 | 587 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@459 | 588 | |
universe@466 | 589 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5) |
universe@466 | 590 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47) |
universe@466 | 591 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13) |
universe@459 | 592 | |
universe@459 | 593 | cxLinkedListDestroy(list); |
universe@459 | 594 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@459 | 595 | } |
universe@459 | 596 | |
universe@459 | 597 | void test_hl_linked_list_insert(void) { |
universe@459 | 598 | cxTestingAllocatorReset(); |
universe@459 | 599 | |
universe@459 | 600 | int data; |
universe@459 | 601 | CxList list = cxLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int, sizeof(int)); |
universe@459 | 602 | |
universe@459 | 603 | data = 5; |
universe@460 | 604 | CU_ASSERT_NOT_EQUAL(cxListInsert(list, 1, &data), 0) |
universe@459 | 605 | CU_ASSERT_EQUAL(list->size, 0) |
universe@460 | 606 | CU_ASSERT_EQUAL(cxListInsert(list, 0, &data), 0) |
universe@459 | 607 | CU_ASSERT_EQUAL(list->size, 1) |
universe@459 | 608 | data = 47; |
universe@460 | 609 | CU_ASSERT_EQUAL(cxListInsert(list, 0, &data), 0) |
universe@459 | 610 | CU_ASSERT_EQUAL(list->size, 2) |
universe@459 | 611 | data = 13; |
universe@460 | 612 | CU_ASSERT_EQUAL(cxListInsert(list, 1, &data), 0) |
universe@459 | 613 | CU_ASSERT_EQUAL(list->size, 3) |
universe@459 | 614 | data = 42; |
universe@460 | 615 | CU_ASSERT_EQUAL(cxListInsert(list, 3, &data), 0) |
universe@459 | 616 | |
universe@459 | 617 | CU_ASSERT_EQUAL(list->size, 4) |
universe@459 | 618 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@459 | 619 | |
universe@466 | 620 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47) |
universe@466 | 621 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13) |
universe@466 | 622 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 5) |
universe@466 | 623 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 3), 42) |
universe@459 | 624 | |
universe@459 | 625 | cxLinkedListDestroy(list); |
universe@459 | 626 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@459 | 627 | } |
universe@459 | 628 | |
universe@459 | 629 | void test_hl_linked_list_remove(void) { |
universe@459 | 630 | cxTestingAllocatorReset(); |
universe@459 | 631 | |
universe@459 | 632 | int data; |
universe@459 | 633 | CxList list = cxLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int, sizeof(int)); |
universe@459 | 634 | |
universe@459 | 635 | data = 5; |
universe@460 | 636 | cxListAdd(list, &data); |
universe@459 | 637 | data = 47; |
universe@460 | 638 | cxListAdd(list, &data); |
universe@459 | 639 | data = 42; |
universe@460 | 640 | cxListAdd(list, &data); |
universe@459 | 641 | data = 13; |
universe@460 | 642 | cxListAdd(list, &data); |
universe@459 | 643 | |
universe@459 | 644 | CU_ASSERT_EQUAL(list->size, 4) |
universe@459 | 645 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@459 | 646 | |
universe@459 | 647 | CU_ASSERT_NOT_EQUAL(cxListRemove(list, 4), 0) |
universe@459 | 648 | |
universe@459 | 649 | CU_ASSERT_EQUAL(cxListRemove(list, 2), 0) |
universe@459 | 650 | CU_ASSERT_EQUAL(list->size, 3) |
universe@459 | 651 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 652 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5) |
universe@466 | 653 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47) |
universe@466 | 654 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13) |
universe@459 | 655 | |
universe@459 | 656 | CU_ASSERT_EQUAL(cxListRemove(list, 0), 0) |
universe@459 | 657 | CU_ASSERT_EQUAL(list->size, 2) |
universe@459 | 658 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 659 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47) |
universe@466 | 660 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13) |
universe@459 | 661 | |
universe@459 | 662 | CU_ASSERT_EQUAL(cxListRemove(list, 1), 0) |
universe@459 | 663 | CU_ASSERT_EQUAL(list->size, 1) |
universe@459 | 664 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 665 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47) |
universe@459 | 666 | |
universe@459 | 667 | CU_ASSERT_EQUAL(cxListRemove(list, 0), 0) |
universe@459 | 668 | CU_ASSERT_EQUAL(list->size, 0) |
universe@459 | 669 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@459 | 670 | |
universe@459 | 671 | CU_ASSERT_NOT_EQUAL(cxListRemove(list, 0), 0) |
universe@459 | 672 | |
universe@459 | 673 | cxLinkedListDestroy(list); |
universe@459 | 674 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@459 | 675 | } |
universe@459 | 676 | |
universe@479 | 677 | void test_hl_linked_list_at(void) { |
universe@479 | 678 | cxTestingAllocatorReset(); |
universe@479 | 679 | |
universe@479 | 680 | CxList list = cxLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int, sizeof(int)); |
universe@479 | 681 | |
universe@479 | 682 | int data; |
universe@479 | 683 | data = 5; |
universe@479 | 684 | cxListAdd(list, &data); |
universe@479 | 685 | data = 47; |
universe@479 | 686 | cxListAdd(list, &data); |
universe@479 | 687 | data = 13; |
universe@479 | 688 | cxListAdd(list, &data); |
universe@479 | 689 | |
universe@479 | 690 | CU_ASSERT_EQUAL(*(int*)cxListAt(list, 0), 5) |
universe@479 | 691 | CU_ASSERT_EQUAL(*(int*)cxListAt(list, 1), 47) |
universe@479 | 692 | CU_ASSERT_EQUAL(*(int*)cxListAt(list, 2), 13) |
universe@479 | 693 | CU_ASSERT_PTR_NULL(cxListAt(list, 3)) |
universe@479 | 694 | |
universe@479 | 695 | cxLinkedListDestroy(list); |
universe@479 | 696 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@479 | 697 | } |
universe@479 | 698 | |
universe@459 | 699 | void test_hl_linked_list_find(void) { |
universe@459 | 700 | cxTestingAllocatorReset(); |
universe@459 | 701 | |
universe@459 | 702 | int data, criteria; |
universe@459 | 703 | CxList list = cxLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int, sizeof(int)); |
universe@459 | 704 | |
universe@459 | 705 | data = 5; |
universe@460 | 706 | cxListAdd(list, &data); |
universe@459 | 707 | data = 47; |
universe@460 | 708 | cxListAdd(list, &data); |
universe@459 | 709 | data = 13; |
universe@460 | 710 | cxListAdd(list, &data); |
universe@459 | 711 | |
universe@459 | 712 | CU_ASSERT_EQUAL(list->size, 3) |
universe@459 | 713 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@459 | 714 | |
universe@459 | 715 | criteria = 5; |
universe@460 | 716 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 0) |
universe@459 | 717 | criteria = 47; |
universe@460 | 718 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1) |
universe@459 | 719 | criteria = 13; |
universe@460 | 720 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 2) |
universe@459 | 721 | criteria = 9000; |
universe@460 | 722 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3) |
universe@459 | 723 | criteria = -5; |
universe@460 | 724 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3) |
universe@459 | 725 | |
universe@459 | 726 | cxLinkedListDestroy(list); |
universe@459 | 727 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@459 | 728 | } |
universe@459 | 729 | |
universe@469 | 730 | void test_hl_linked_list_sort(void) { |
universe@469 | 731 | int expected[] = { |
universe@469 | 732 | 14, 30, 151, 163, 227, 300, 315, 317, 363, 398, 417, 424, 438, 446, 508, 555, 605, 713, 716, 759, 761, 880, |
universe@469 | 733 | 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 1707, 1734, 1771, 1874, 1894, |
universe@469 | 734 | 1976, 2079, 2124, 2130, 2135, 2266, 2338, 2358, 2430, 2500, 2540, 2542, 2546, 2711, 2733, 2754, 2764, 2797, |
universe@469 | 735 | 2888, 2900, 3020, 3053, 3109, 3244, 3275, 3302, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 3675, 3677, |
universe@469 | 736 | 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681, |
universe@469 | 737 | 4785, 4791, 4801, 4859, 4903, 4973 |
universe@469 | 738 | }; |
universe@469 | 739 | int scrambled[] = { |
universe@469 | 740 | 759, 716, 880, 761, 2358, 2542, 2500, 2540, 2546, 2711, 2430, 1707, 1874, 1771, 1894, 1734, 1976, 2079, |
universe@469 | 741 | 2124, 2130, 2135, 2266, 2338, 2733, 2754, 2764, 2797, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 2888, |
universe@469 | 742 | 2900, 3020, 3053, 3109, 3244, 3275, 3302, 438, 446, 508, 555, 605, 713, 14, 30, 151, 163, 227, 300, |
universe@469 | 743 | 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 315, 317, 363, 398, 417, 424, |
universe@469 | 744 | 3675, 3677, 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4785, 4791, 4801, 4859, 4903, 4973, |
universe@469 | 745 | 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681 |
universe@469 | 746 | }; |
universe@469 | 747 | |
universe@469 | 748 | cxTestingAllocatorReset(); |
universe@469 | 749 | |
universe@469 | 750 | CxList list = cxLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int, sizeof(int)); |
universe@469 | 751 | |
universe@473 | 752 | for (int i = 0; i < 100; i++) { |
universe@469 | 753 | cxListAdd(list, &scrambled[i]); |
universe@469 | 754 | } |
universe@469 | 755 | |
universe@469 | 756 | cxListSort(list); |
universe@469 | 757 | |
universe@473 | 758 | for (int i = 0; i < 100; i++) { |
universe@473 | 759 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, i), expected[i]) |
universe@469 | 760 | } |
universe@469 | 761 | |
universe@469 | 762 | cxLinkedListDestroy(list); |
universe@469 | 763 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@469 | 764 | } |
universe@469 | 765 | |
universe@466 | 766 | void test_hl_ptr_linked_list_create(void) { |
universe@466 | 767 | cxTestingAllocatorReset(); |
universe@466 | 768 | |
universe@466 | 769 | CxList list = cxPointerLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int); |
universe@466 | 770 | |
universe@466 | 771 | CU_ASSERT_EQUAL(list->size, 0) |
universe@466 | 772 | CU_ASSERT_EQUAL(list->capacity, (size_t) -1) |
universe@466 | 773 | CU_ASSERT_PTR_EQUAL(list->allocator, cxTestingAllocator) |
universe@466 | 774 | CU_ASSERT_EQUAL(list->itemsize, sizeof(void *)) |
universe@466 | 775 | CU_ASSERT_PTR_EQUAL(list->cmpfunc, cmp_int) |
universe@466 | 776 | |
universe@466 | 777 | cxLinkedListDestroy(list); |
universe@466 | 778 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@466 | 779 | } |
universe@466 | 780 | |
universe@466 | 781 | void test_hl_ptr_linked_list_add(void) { |
universe@466 | 782 | cxTestingAllocatorReset(); |
universe@466 | 783 | |
universe@466 | 784 | CxList list = cxPointerLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int); |
universe@466 | 785 | |
universe@466 | 786 | int a = 5, b = 47, c = 13; |
universe@466 | 787 | |
universe@466 | 788 | CU_ASSERT_EQUAL(cxListAdd(list, &a), 0) |
universe@466 | 789 | CU_ASSERT_EQUAL(cxListAdd(list, &b), 0) |
universe@466 | 790 | CU_ASSERT_EQUAL(cxListAdd(list, &c), 0) |
universe@466 | 791 | |
universe@466 | 792 | CU_ASSERT_EQUAL(list->size, 3) |
universe@466 | 793 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 794 | |
universe@466 | 795 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5) |
universe@466 | 796 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47) |
universe@466 | 797 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13) |
universe@466 | 798 | |
universe@466 | 799 | a = 9; |
universe@466 | 800 | b = 10; |
universe@466 | 801 | c = 11; |
universe@466 | 802 | |
universe@466 | 803 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 9) |
universe@466 | 804 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 10) |
universe@466 | 805 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 11) |
universe@466 | 806 | |
universe@466 | 807 | cxLinkedListDestroy(list); |
universe@466 | 808 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@466 | 809 | } |
universe@466 | 810 | |
universe@466 | 811 | void test_hl_ptr_linked_list_insert(void) { |
universe@466 | 812 | cxTestingAllocatorReset(); |
universe@466 | 813 | |
universe@466 | 814 | CxList list = cxPointerLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int); |
universe@466 | 815 | |
universe@466 | 816 | int a = 5, b = 47, c = 13, d = 42; |
universe@466 | 817 | |
universe@466 | 818 | CU_ASSERT_NOT_EQUAL(cxListInsert(list, 1, &a), 0) |
universe@466 | 819 | CU_ASSERT_EQUAL(list->size, 0) |
universe@466 | 820 | CU_ASSERT_EQUAL(cxListInsert(list, 0, &a), 0) |
universe@466 | 821 | CU_ASSERT_EQUAL(list->size, 1) |
universe@466 | 822 | CU_ASSERT_EQUAL(cxListInsert(list, 0, &b), 0) |
universe@466 | 823 | CU_ASSERT_EQUAL(list->size, 2) |
universe@466 | 824 | CU_ASSERT_EQUAL(cxListInsert(list, 1, &c), 0) |
universe@466 | 825 | CU_ASSERT_EQUAL(list->size, 3) |
universe@466 | 826 | CU_ASSERT_EQUAL(cxListInsert(list, 3, &d), 0) |
universe@466 | 827 | |
universe@466 | 828 | CU_ASSERT_EQUAL(list->size, 4) |
universe@466 | 829 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 830 | |
universe@466 | 831 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47) |
universe@466 | 832 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13) |
universe@466 | 833 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 5) |
universe@466 | 834 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 3), 42) |
universe@466 | 835 | |
universe@466 | 836 | cxLinkedListDestroy(list); |
universe@466 | 837 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@466 | 838 | } |
universe@466 | 839 | |
universe@466 | 840 | void test_hl_ptr_linked_list_remove(void) { |
universe@466 | 841 | cxTestingAllocatorReset(); |
universe@466 | 842 | |
universe@466 | 843 | int a = 5, b = 47, c = 42, d = 13; |
universe@466 | 844 | CxList list = cxPointerLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int); |
universe@466 | 845 | |
universe@466 | 846 | cxListAdd(list, &a); |
universe@466 | 847 | cxListAdd(list, &b); |
universe@466 | 848 | cxListAdd(list, &c); |
universe@466 | 849 | cxListAdd(list, &d); |
universe@466 | 850 | |
universe@466 | 851 | CU_ASSERT_EQUAL(list->size, 4) |
universe@466 | 852 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 853 | |
universe@466 | 854 | CU_ASSERT_NOT_EQUAL(cxListRemove(list, 4), 0) |
universe@466 | 855 | |
universe@466 | 856 | CU_ASSERT_EQUAL(cxListRemove(list, 2), 0) |
universe@466 | 857 | CU_ASSERT_EQUAL(list->size, 3) |
universe@466 | 858 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 859 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5) |
universe@466 | 860 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47) |
universe@466 | 861 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13) |
universe@466 | 862 | |
universe@466 | 863 | CU_ASSERT_EQUAL(cxListRemove(list, 0), 0) |
universe@466 | 864 | CU_ASSERT_EQUAL(list->size, 2) |
universe@466 | 865 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 866 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47) |
universe@466 | 867 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13) |
universe@466 | 868 | |
universe@466 | 869 | CU_ASSERT_EQUAL(cxListRemove(list, 1), 0) |
universe@466 | 870 | CU_ASSERT_EQUAL(list->size, 1) |
universe@466 | 871 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 872 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47) |
universe@466 | 873 | |
universe@466 | 874 | CU_ASSERT_EQUAL(cxListRemove(list, 0), 0) |
universe@466 | 875 | CU_ASSERT_EQUAL(list->size, 0) |
universe@466 | 876 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 877 | |
universe@466 | 878 | CU_ASSERT_NOT_EQUAL(cxListRemove(list, 0), 0) |
universe@466 | 879 | |
universe@466 | 880 | cxLinkedListDestroy(list); |
universe@466 | 881 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@466 | 882 | } |
universe@466 | 883 | |
universe@479 | 884 | void test_hl_ptr_linked_list_at(void) { |
universe@479 | 885 | cxTestingAllocatorReset(); |
universe@479 | 886 | |
universe@479 | 887 | CxList list = cxPointerLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int); |
universe@479 | 888 | |
universe@479 | 889 | int a = 5, b = 47, c = 13; |
universe@479 | 890 | cxListAdd(list, &a); |
universe@479 | 891 | cxListAdd(list, &b); |
universe@479 | 892 | cxListAdd(list, &c); |
universe@479 | 893 | |
universe@479 | 894 | CU_ASSERT_EQUAL(*(int*)cxListAt(list, 0), 5) |
universe@479 | 895 | CU_ASSERT_EQUAL(*(int*)cxListAt(list, 1), 47) |
universe@479 | 896 | CU_ASSERT_EQUAL(*(int*)cxListAt(list, 2), 13) |
universe@479 | 897 | CU_ASSERT_PTR_NULL(cxListAt(list, 3)) |
universe@479 | 898 | |
universe@479 | 899 | cxLinkedListDestroy(list); |
universe@479 | 900 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@479 | 901 | } |
universe@479 | 902 | |
universe@466 | 903 | void test_hl_ptr_linked_list_find(void) { |
universe@466 | 904 | cxTestingAllocatorReset(); |
universe@466 | 905 | |
universe@466 | 906 | int a = 5, b = 47, c = 13, criteria; |
universe@466 | 907 | CxList list = cxPointerLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int); |
universe@466 | 908 | |
universe@466 | 909 | cxListAdd(list, &a); |
universe@466 | 910 | cxListAdd(list, &b); |
universe@466 | 911 | cxListAdd(list, &c); |
universe@466 | 912 | |
universe@466 | 913 | CU_ASSERT_EQUAL(list->size, 3) |
universe@466 | 914 | CU_ASSERT_TRUE(list->capacity >= list->size) |
universe@466 | 915 | |
universe@466 | 916 | criteria = 5; |
universe@466 | 917 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 0) |
universe@466 | 918 | criteria = 47; |
universe@466 | 919 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1) |
universe@466 | 920 | criteria = 13; |
universe@466 | 921 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 2) |
universe@466 | 922 | criteria = 9000; |
universe@466 | 923 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3) |
universe@466 | 924 | criteria = -5; |
universe@466 | 925 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3) |
universe@466 | 926 | b = -5; |
universe@466 | 927 | CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1) |
universe@466 | 928 | |
universe@466 | 929 | cxLinkedListDestroy(list); |
universe@466 | 930 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@466 | 931 | } |
universe@466 | 932 | |
universe@469 | 933 | void test_hl_ptr_linked_list_sort(void) { |
universe@469 | 934 | int expected[] = { |
universe@469 | 935 | 14, 30, 151, 163, 227, 300, 315, 317, 363, 398, 417, 424, 438, 446, 508, 555, 605, 713, 716, 759, 761, 880, |
universe@469 | 936 | 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 1707, 1734, 1771, 1874, 1894, |
universe@469 | 937 | 1976, 2079, 2124, 2130, 2135, 2266, 2338, 2358, 2430, 2500, 2540, 2542, 2546, 2711, 2733, 2754, 2764, 2797, |
universe@469 | 938 | 2888, 2900, 3020, 3053, 3109, 3244, 3275, 3302, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 3675, 3677, |
universe@469 | 939 | 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681, |
universe@469 | 940 | 4785, 4791, 4801, 4859, 4903, 4973 |
universe@469 | 941 | }; |
universe@469 | 942 | int scrambled[] = { |
universe@469 | 943 | 759, 716, 880, 761, 2358, 2542, 2500, 2540, 2546, 2711, 2430, 1707, 1874, 1771, 1894, 1734, 1976, 2079, |
universe@469 | 944 | 2124, 2130, 2135, 2266, 2338, 2733, 2754, 2764, 2797, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 2888, |
universe@469 | 945 | 2900, 3020, 3053, 3109, 3244, 3275, 3302, 438, 446, 508, 555, 605, 713, 14, 30, 151, 163, 227, 300, |
universe@469 | 946 | 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 315, 317, 363, 398, 417, 424, |
universe@469 | 947 | 3675, 3677, 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4785, 4791, 4801, 4859, 4903, 4973, |
universe@469 | 948 | 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681 |
universe@469 | 949 | }; |
universe@469 | 950 | |
universe@469 | 951 | cxTestingAllocatorReset(); |
universe@469 | 952 | |
universe@469 | 953 | CxList list = cxPointerLinkedListCreate(cxTestingAllocator, (CxListComparator) cmp_int); |
universe@469 | 954 | |
universe@473 | 955 | for (int i = 0; i < 100; i++) { |
universe@469 | 956 | cxListAdd(list, &scrambled[i]); |
universe@469 | 957 | } |
universe@469 | 958 | |
universe@469 | 959 | cxListSort(list); |
universe@469 | 960 | |
universe@473 | 961 | for (int i = 0; i < 100; i++) { |
universe@473 | 962 | CU_ASSERT_EQUAL(*(int *) cxListAt(list, i), expected[i]) |
universe@469 | 963 | } |
universe@469 | 964 | |
universe@469 | 965 | cxLinkedListDestroy(list); |
universe@469 | 966 | CU_ASSERT_TRUE(cxTestingAllocatorVerify()) |
universe@469 | 967 | } |
universe@469 | 968 | |
universe@390 | 969 | int main() { |
universe@411 | 970 | CU_pSuite suite = NULL; |
universe@449 | 971 | |
universe@411 | 972 | if (CUE_SUCCESS != CU_initialize_registry()) { |
universe@411 | 973 | return CU_get_error(); |
universe@411 | 974 | } |
universe@411 | 975 | |
universe@459 | 976 | suite = CU_add_suite("low level linked list", NULL, NULL); |
universe@449 | 977 | |
universe@482 | 978 | cu_add_test(suite, test_linked_list_link_unlink); |
universe@455 | 979 | cu_add_test(suite, test_linked_list_at); |
universe@487 | 980 | cu_add_test(suite, test_linked_list_find); |
universe@486 | 981 | cu_add_test(suite, test_linked_list_compare); |
universe@475 | 982 | cu_add_test(suite, test_linked_list_prepend); |
universe@455 | 983 | cu_add_test(suite, test_linked_list_add); |
universe@482 | 984 | cu_add_test(suite, test_linked_list_insert); |
universe@482 | 985 | cu_add_test(suite, test_linked_list_insert_chain); |
universe@475 | 986 | cu_add_test(suite, test_linked_list_first); |
universe@456 | 987 | cu_add_test(suite, test_linked_list_last); |
universe@473 | 988 | cu_add_test(suite, test_linked_list_prev); |
universe@473 | 989 | cu_add_test(suite, test_linked_list_remove); |
universe@468 | 990 | cu_add_test(suite, test_linked_list_size); |
universe@468 | 991 | cu_add_test(suite, test_linked_list_sort); |
universe@473 | 992 | cu_add_test(suite, test_linked_list_reverse); |
universe@455 | 993 | |
universe@459 | 994 | suite = CU_add_suite("high level linked list", NULL, NULL); |
universe@455 | 995 | |
universe@456 | 996 | cu_add_test(suite, test_hl_linked_list_create); |
universe@456 | 997 | cu_add_test(suite, test_hl_linked_list_add); |
universe@456 | 998 | cu_add_test(suite, test_hl_linked_list_insert); |
universe@456 | 999 | cu_add_test(suite, test_hl_linked_list_remove); |
universe@479 | 1000 | cu_add_test(suite, test_hl_linked_list_at); |
universe@459 | 1001 | cu_add_test(suite, test_hl_linked_list_find); |
universe@469 | 1002 | cu_add_test(suite, test_hl_linked_list_sort); |
universe@413 | 1003 | |
universe@466 | 1004 | suite = CU_add_suite("high level pointer linked list", NULL, NULL); |
universe@466 | 1005 | |
universe@466 | 1006 | cu_add_test(suite, test_hl_ptr_linked_list_create); |
universe@466 | 1007 | cu_add_test(suite, test_hl_ptr_linked_list_add); |
universe@466 | 1008 | cu_add_test(suite, test_hl_ptr_linked_list_insert); |
universe@466 | 1009 | cu_add_test(suite, test_hl_ptr_linked_list_remove); |
universe@479 | 1010 | cu_add_test(suite, test_hl_ptr_linked_list_at); |
universe@466 | 1011 | cu_add_test(suite, test_hl_ptr_linked_list_find); |
universe@469 | 1012 | cu_add_test(suite, test_hl_ptr_linked_list_sort); |
universe@466 | 1013 | |
universe@411 | 1014 | CU_basic_set_mode(UCX_CU_BRM); |
universe@411 | 1015 | |
universe@411 | 1016 | int exitcode; |
universe@411 | 1017 | if (CU_basic_run_tests()) { |
universe@411 | 1018 | exitcode = CU_get_error(); |
universe@411 | 1019 | } else { |
universe@411 | 1020 | exitcode = CU_get_number_of_failures() == 0 ? 0 : 1; |
universe@411 | 1021 | } |
universe@411 | 1022 | CU_cleanup_registry(); |
universe@411 | 1023 | return exitcode; |
universe@390 | 1024 | } |