Mon, 20 Mar 2023 19:09:08 +0100
add unit test for cxListClear + fix destructor functions not always invoked with the correct pointer
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@606 | 30 | #include "cx/array_list.h" |
universe@509 | 31 | #include "cx/utils.h" |
universe@602 | 32 | #include "cx/compare.h" |
universe@422 | 33 | #include "util_allocator.h" |
universe@398 | 34 | |
universe@517 | 35 | #include <gtest/gtest.h> |
universe@517 | 36 | #include <array> |
universe@517 | 37 | #include <vector> |
universe@517 | 38 | #include <unordered_set> |
universe@517 | 39 | #include <algorithm> |
universe@517 | 40 | |
universe@666 | 41 | struct testdatastruct { |
universe@666 | 42 | int x; |
universe@666 | 43 | void *ptr; |
universe@666 | 44 | }; |
universe@666 | 45 | |
universe@666 | 46 | static void free_testdatastruct( |
universe@666 | 47 | void *a, |
universe@666 | 48 | void *s |
universe@666 | 49 | ) { |
universe@666 | 50 | auto al = reinterpret_cast<CxTestingAllocator *>(a); |
universe@666 | 51 | cxFree(al, reinterpret_cast<testdatastruct *>(s)->ptr); |
universe@666 | 52 | } |
universe@666 | 53 | |
universe@486 | 54 | struct node { |
universe@517 | 55 | node *next = nullptr; |
universe@517 | 56 | node *prev = nullptr; |
universe@517 | 57 | int data = 0; |
universe@486 | 58 | }; |
universe@486 | 59 | |
universe@486 | 60 | const ptrdiff_t loc_prev = offsetof(struct node, prev); |
universe@486 | 61 | const ptrdiff_t loc_next = offsetof(struct node, next); |
universe@486 | 62 | const ptrdiff_t loc_data = offsetof(struct node, data); |
universe@486 | 63 | |
universe@517 | 64 | struct node_test_data { |
universe@520 | 65 | node *begin = nullptr; |
universe@517 | 66 | |
universe@520 | 67 | explicit node_test_data(node *begin) : begin(begin) { |
universe@520 | 68 | auto n = begin; |
universe@520 | 69 | while (n != nullptr) { |
universe@520 | 70 | nodes.push_back(n); |
universe@520 | 71 | n = n->next; |
universe@520 | 72 | } |
universe@520 | 73 | } |
universe@520 | 74 | |
universe@520 | 75 | node_test_data(node_test_data &) = delete; |
universe@520 | 76 | |
universe@520 | 77 | node_test_data(node_test_data &&) = default; |
universe@517 | 78 | |
universe@517 | 79 | ~node_test_data() { |
universe@520 | 80 | for (auto &&n: nodes) delete n; |
universe@486 | 81 | } |
universe@520 | 82 | |
universe@520 | 83 | private: |
universe@520 | 84 | std::vector<node *> nodes; |
universe@517 | 85 | }; |
universe@517 | 86 | |
universe@517 | 87 | static node_test_data create_nodes_test_data(size_t len) { |
universe@517 | 88 | if (len == 0) return node_test_data{nullptr}; |
universe@517 | 89 | auto begin = new node; |
universe@517 | 90 | auto prev = begin; |
universe@517 | 91 | for (size_t i = 1; i < len; i++) { |
universe@517 | 92 | auto n = new node; |
universe@517 | 93 | cx_linked_list_link(prev, n, loc_prev, loc_next); |
universe@517 | 94 | prev = n; |
universe@517 | 95 | } |
universe@517 | 96 | return node_test_data{begin}; |
universe@486 | 97 | } |
universe@486 | 98 | |
universe@517 | 99 | template<typename InputIter> |
universe@528 | 100 | static node_test_data create_nodes_test_data( |
universe@528 | 101 | InputIter begin, |
universe@528 | 102 | InputIter end |
universe@528 | 103 | ) { |
universe@517 | 104 | if (begin == end) return node_test_data{nullptr}; |
universe@517 | 105 | node *first = new node; |
universe@517 | 106 | first->data = *begin; |
universe@517 | 107 | node *prev = first; |
universe@517 | 108 | begin++; |
universe@517 | 109 | for (; begin != end; begin++) { |
universe@517 | 110 | auto n = new node; |
universe@517 | 111 | n->data = *begin; |
universe@517 | 112 | cx_linked_list_link(prev, n, loc_prev, loc_next); |
universe@517 | 113 | prev = n; |
universe@486 | 114 | } |
universe@517 | 115 | return node_test_data{first}; |
universe@486 | 116 | } |
universe@486 | 117 | |
universe@517 | 118 | static node_test_data create_nodes_test_data(std::initializer_list<int> data) { |
universe@517 | 119 | return create_nodes_test_data(data.begin(), data.end()); |
universe@509 | 120 | } |
universe@509 | 121 | |
universe@517 | 122 | template<size_t N> |
universe@517 | 123 | struct int_test_data { |
universe@517 | 124 | std::array<int, N> data; |
universe@482 | 125 | |
universe@517 | 126 | int_test_data() { |
universe@517 | 127 | cx_for_n (i, N) data[i] = ::rand(); // NOLINT(cert-msc50-cpp) |
universe@517 | 128 | } |
universe@517 | 129 | }; |
universe@517 | 130 | |
universe@517 | 131 | TEST(LinkedList_LowLevel, link_unlink) { |
universe@517 | 132 | node a, b, c; |
universe@482 | 133 | |
universe@482 | 134 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@517 | 135 | EXPECT_EQ(a.prev, nullptr); |
universe@517 | 136 | EXPECT_EQ(a.next, &b); |
universe@517 | 137 | EXPECT_EQ(b.prev, &a); |
universe@517 | 138 | EXPECT_EQ(b.next, nullptr); |
universe@482 | 139 | |
universe@482 | 140 | cx_linked_list_unlink(&a, &b, loc_prev, loc_next); |
universe@517 | 141 | EXPECT_EQ(a.prev, nullptr); |
universe@517 | 142 | EXPECT_EQ(a.next, nullptr); |
universe@517 | 143 | EXPECT_EQ(b.prev, nullptr); |
universe@517 | 144 | EXPECT_EQ(b.next, nullptr); |
universe@482 | 145 | |
universe@482 | 146 | cx_linked_list_link(&b, &c, loc_prev, loc_next); |
universe@482 | 147 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@482 | 148 | cx_linked_list_unlink(&b, &c, loc_prev, loc_next); |
universe@517 | 149 | EXPECT_EQ(a.prev, nullptr); |
universe@517 | 150 | EXPECT_EQ(a.next, &b); |
universe@517 | 151 | EXPECT_EQ(b.prev, &a); |
universe@517 | 152 | EXPECT_EQ(b.next, nullptr); |
universe@517 | 153 | EXPECT_EQ(c.prev, nullptr); |
universe@517 | 154 | EXPECT_EQ(c.next, nullptr); |
universe@482 | 155 | } |
universe@482 | 156 | |
universe@517 | 157 | TEST(LinkedList_LowLevel, cx_linked_list_at) { |
universe@517 | 158 | node a, b, c, d; |
universe@486 | 159 | cx_linked_list_link(&a, &b, loc_prev, loc_next); |
universe@486 | 160 | cx_linked_list_link(&b, &c, loc_prev, loc_next); |
universe@486 | 161 | cx_linked_list_link(&c, &d, loc_prev, loc_next); |
universe@438 | 162 | |
universe@517 | 163 | EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 0), &a); |
universe@517 | 164 | EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 1), &b); |
universe@517 | 165 | EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 2), &c); |
universe@517 | 166 | EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 3), &d); |
universe@517 | 167 | EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 4), nullptr); |
universe@438 | 168 | |
universe@517 | 169 | EXPECT_EQ(cx_linked_list_at(&b, 1, loc_prev, 0), &a); |
universe@517 | 170 | EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 1), &b); |
universe@517 | 171 | EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 2), &c); |
universe@517 | 172 | EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 3), &d); |
universe@517 | 173 | EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 4), nullptr); |
universe@438 | 174 | |
universe@517 | 175 | EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 0), &a); |
universe@517 | 176 | EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 1), &b); |
universe@438 | 177 | } |
universe@438 | 178 | |
universe@517 | 179 | TEST(LinkedList_LowLevel, cx_linked_list_find) { |
universe@517 | 180 | auto testdata = create_nodes_test_data({2, 4, 6, 8}); |
universe@517 | 181 | auto list = testdata.begin; |
universe@487 | 182 | int s; |
universe@487 | 183 | |
universe@487 | 184 | s = 2; |
universe@639 | 185 | EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 0); |
universe@487 | 186 | s = 4; |
universe@639 | 187 | EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 1); |
universe@487 | 188 | s = 6; |
universe@639 | 189 | EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 2); |
universe@487 | 190 | s = 8; |
universe@639 | 191 | EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 3); |
universe@487 | 192 | s = 10; |
universe@639 | 193 | EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 4); |
universe@487 | 194 | s = -2; |
universe@639 | 195 | EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 4); |
universe@487 | 196 | } |
universe@487 | 197 | |
universe@517 | 198 | TEST(LinkedList_LowLevel, cx_linked_list_compare) { |
universe@517 | 199 | auto ta = create_nodes_test_data({2, 4, 6, 8}); |
universe@517 | 200 | auto tb = create_nodes_test_data({2, 4, 6}); |
universe@517 | 201 | auto tc = create_nodes_test_data({2, 4, 6, 9}); |
universe@517 | 202 | auto la = ta.begin, lb = tb.begin, lc = tc.begin; |
universe@486 | 203 | |
universe@639 | 204 | EXPECT_GT(cx_linked_list_compare(la, lb, loc_next, loc_data, cx_cmp_int), 0); |
universe@639 | 205 | EXPECT_LT(cx_linked_list_compare(lb, la, loc_next, loc_data, cx_cmp_int), 0); |
universe@639 | 206 | EXPECT_GT(cx_linked_list_compare(lc, la, loc_next, loc_data, cx_cmp_int), 0); |
universe@639 | 207 | EXPECT_LT(cx_linked_list_compare(la, lc, loc_next, loc_data, cx_cmp_int), 0); |
universe@639 | 208 | EXPECT_EQ(cx_linked_list_compare(la, la, loc_next, loc_data, cx_cmp_int), 0); |
universe@486 | 209 | } |
universe@486 | 210 | |
universe@517 | 211 | TEST(LinkedList_LowLevel, cx_linked_list_add) { |
universe@517 | 212 | // test with begin, end / prev, next |
universe@517 | 213 | { |
universe@517 | 214 | node nodes[4]; |
universe@517 | 215 | void *begin = nullptr, *end = nullptr; |
universe@449 | 216 | |
universe@517 | 217 | cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]); |
universe@517 | 218 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 219 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 220 | EXPECT_EQ(nodes[0].prev, nullptr); |
universe@517 | 221 | EXPECT_EQ(nodes[0].next, nullptr); |
universe@449 | 222 | |
universe@517 | 223 | cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]); |
universe@517 | 224 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 225 | EXPECT_EQ(end, &nodes[1]); |
universe@517 | 226 | EXPECT_EQ(nodes[0].next, &nodes[1]); |
universe@517 | 227 | EXPECT_EQ(nodes[1].prev, &nodes[0]); |
universe@517 | 228 | } |
universe@449 | 229 | |
olaf@442 | 230 | // test with begin only / prev, next |
universe@517 | 231 | { |
universe@517 | 232 | node nodes[4]; |
universe@517 | 233 | void *begin = nullptr; |
universe@449 | 234 | |
universe@517 | 235 | cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[0]); |
universe@517 | 236 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 237 | cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[1]); |
universe@517 | 238 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 239 | EXPECT_EQ(nodes[0].next, &nodes[1]); |
universe@517 | 240 | EXPECT_EQ(nodes[1].prev, &nodes[0]); |
universe@449 | 241 | |
universe@517 | 242 | cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[2]); |
universe@517 | 243 | EXPECT_EQ(nodes[1].next, &nodes[2]); |
universe@517 | 244 | EXPECT_EQ(nodes[2].prev, &nodes[1]); |
universe@517 | 245 | } |
universe@449 | 246 | |
universe@475 | 247 | // test with end only / prev, next |
universe@517 | 248 | { |
universe@517 | 249 | node nodes[4]; |
universe@517 | 250 | void *end = nullptr; |
universe@475 | 251 | |
universe@517 | 252 | cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[0]); |
universe@517 | 253 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 254 | cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[1]); |
universe@517 | 255 | EXPECT_EQ(end, &nodes[1]); |
universe@517 | 256 | EXPECT_EQ(nodes[0].next, &nodes[1]); |
universe@517 | 257 | EXPECT_EQ(nodes[1].prev, &nodes[0]); |
universe@475 | 258 | |
universe@517 | 259 | cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[2]); |
universe@517 | 260 | EXPECT_EQ(end, &nodes[2]); |
universe@517 | 261 | EXPECT_EQ(nodes[1].next, &nodes[2]); |
universe@517 | 262 | EXPECT_EQ(nodes[2].prev, &nodes[1]); |
universe@517 | 263 | } |
universe@475 | 264 | |
olaf@442 | 265 | // test with begin, end / next |
universe@517 | 266 | { |
universe@517 | 267 | node nodes[4]; |
universe@517 | 268 | void *begin = nullptr, *end = nullptr; |
universe@449 | 269 | |
universe@517 | 270 | cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]); |
universe@517 | 271 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 272 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 273 | cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]); |
universe@517 | 274 | EXPECT_EQ(end, &nodes[1]); |
universe@517 | 275 | EXPECT_EQ(nodes[0].next, &nodes[1]); |
universe@517 | 276 | EXPECT_EQ(nodes[1].prev, nullptr); |
universe@517 | 277 | } |
olaf@442 | 278 | } |
olaf@442 | 279 | |
universe@517 | 280 | TEST(LinkedList_LowLevel, cx_linked_list_prepend) { |
universe@517 | 281 | // test with begin, end / prev, next |
universe@517 | 282 | { |
universe@517 | 283 | node nodes[4]; |
universe@517 | 284 | void *begin = nullptr, *end = nullptr; |
universe@475 | 285 | |
universe@517 | 286 | cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]); |
universe@517 | 287 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 288 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 289 | EXPECT_EQ(nodes[0].prev, nullptr); |
universe@517 | 290 | EXPECT_EQ(nodes[0].next, nullptr); |
universe@475 | 291 | |
universe@517 | 292 | cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]); |
universe@517 | 293 | EXPECT_EQ(begin, &nodes[1]); |
universe@517 | 294 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 295 | EXPECT_EQ(nodes[1].next, &nodes[0]); |
universe@517 | 296 | EXPECT_EQ(nodes[0].prev, &nodes[1]); |
universe@517 | 297 | } |
universe@475 | 298 | |
universe@475 | 299 | // test with begin only / prev, next |
universe@517 | 300 | { |
universe@517 | 301 | node nodes[4]; |
universe@517 | 302 | void *begin = nullptr; |
universe@475 | 303 | |
universe@517 | 304 | cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[0]); |
universe@517 | 305 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 306 | cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[1]); |
universe@517 | 307 | EXPECT_EQ(begin, &nodes[1]); |
universe@517 | 308 | EXPECT_EQ(nodes[1].next, &nodes[0]); |
universe@517 | 309 | EXPECT_EQ(nodes[0].prev, &nodes[1]); |
universe@475 | 310 | |
universe@517 | 311 | cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[2]); |
universe@517 | 312 | EXPECT_EQ(begin, &nodes[2]); |
universe@517 | 313 | EXPECT_EQ(nodes[2].next, &nodes[1]); |
universe@517 | 314 | EXPECT_EQ(nodes[1].prev, &nodes[2]); |
universe@517 | 315 | } |
universe@475 | 316 | |
universe@475 | 317 | // test with end only / prev, next |
universe@517 | 318 | { |
universe@517 | 319 | node nodes[4]; |
universe@517 | 320 | void *end = nullptr; |
universe@475 | 321 | |
universe@517 | 322 | cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[0]); |
universe@517 | 323 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 324 | cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[1]); |
universe@517 | 325 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 326 | EXPECT_EQ(nodes[1].next, &nodes[0]); |
universe@517 | 327 | EXPECT_EQ(nodes[0].prev, &nodes[1]); |
universe@475 | 328 | |
universe@517 | 329 | cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[2]); |
universe@517 | 330 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 331 | EXPECT_EQ(nodes[2].next, &nodes[1]); |
universe@517 | 332 | EXPECT_EQ(nodes[1].prev, &nodes[2]); |
universe@517 | 333 | } |
universe@475 | 334 | |
universe@475 | 335 | // test with begin, end / next |
universe@517 | 336 | { |
universe@517 | 337 | node nodes[4]; |
universe@517 | 338 | void *begin = nullptr, *end = nullptr; |
universe@475 | 339 | |
universe@517 | 340 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]); |
universe@517 | 341 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 342 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 343 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]); |
universe@517 | 344 | cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]); |
universe@517 | 345 | EXPECT_EQ(begin, &nodes[2]); |
universe@517 | 346 | EXPECT_EQ(end, &nodes[0]); |
universe@517 | 347 | EXPECT_EQ(nodes[1].next, &nodes[0]); |
universe@517 | 348 | EXPECT_EQ(nodes[2].next, &nodes[1]); |
universe@517 | 349 | EXPECT_EQ(nodes[1].prev, nullptr); |
universe@517 | 350 | EXPECT_EQ(nodes[0].prev, nullptr); |
universe@517 | 351 | } |
universe@475 | 352 | } |
universe@475 | 353 | |
universe@517 | 354 | TEST(LinkedList_LowLevel, cx_linked_list_insert) { |
universe@517 | 355 | // insert mid list |
universe@517 | 356 | { |
universe@517 | 357 | node nodes[4]; |
universe@517 | 358 | void *begin = &nodes[0], *end = &nodes[2]; |
universe@482 | 359 | |
universe@517 | 360 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@517 | 361 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 362 | |
universe@517 | 363 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]); |
universe@517 | 364 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 365 | EXPECT_EQ(end, &nodes[2]); |
universe@517 | 366 | EXPECT_EQ(nodes[1].next, &nodes[3]); |
universe@517 | 367 | EXPECT_EQ(nodes[2].prev, &nodes[3]); |
universe@517 | 368 | EXPECT_EQ(nodes[3].prev, &nodes[1]); |
universe@517 | 369 | EXPECT_EQ(nodes[3].next, &nodes[2]); |
universe@517 | 370 | } |
universe@482 | 371 | |
universe@482 | 372 | // insert end |
universe@517 | 373 | { |
universe@517 | 374 | node nodes[4]; |
universe@517 | 375 | void *begin = &nodes[0], *end = &nodes[2]; |
universe@482 | 376 | |
universe@517 | 377 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@517 | 378 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 379 | |
universe@517 | 380 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]); |
universe@517 | 381 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 382 | EXPECT_EQ(end, &nodes[3]); |
universe@517 | 383 | EXPECT_EQ(nodes[2].next, &nodes[3]); |
universe@517 | 384 | EXPECT_EQ(nodes[3].prev, &nodes[2]); |
universe@517 | 385 | EXPECT_EQ(nodes[3].next, nullptr); |
universe@517 | 386 | } |
universe@482 | 387 | |
universe@482 | 388 | // insert begin |
universe@517 | 389 | { |
universe@517 | 390 | node nodes[4]; |
universe@517 | 391 | void *begin = &nodes[0], *end = &nodes[2]; |
universe@482 | 392 | |
universe@517 | 393 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@517 | 394 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@482 | 395 | |
universe@517 | 396 | cx_linked_list_insert(&begin, &end, loc_prev, loc_next, nullptr, &nodes[3]); |
universe@517 | 397 | EXPECT_EQ(begin, &nodes[3]); |
universe@517 | 398 | EXPECT_EQ(end, &nodes[2]); |
universe@517 | 399 | EXPECT_EQ(nodes[0].prev, &nodes[3]); |
universe@517 | 400 | EXPECT_EQ(nodes[3].prev, nullptr); |
universe@517 | 401 | EXPECT_EQ(nodes[3].next, &nodes[0]); |
universe@517 | 402 | } |
universe@482 | 403 | } |
universe@482 | 404 | |
universe@517 | 405 | TEST(LinkedList_LowLevel, cx_linked_list_insert_chain) { |
universe@517 | 406 | // insert mid list |
universe@517 | 407 | { |
universe@517 | 408 | node nodes[5]; |
universe@517 | 409 | void *begin = &nodes[0], *end = &nodes[2]; |
universe@482 | 410 | |
universe@517 | 411 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@517 | 412 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@517 | 413 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@482 | 414 | |
universe@517 | 415 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], nullptr); |
universe@517 | 416 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 417 | EXPECT_EQ(end, &nodes[2]); |
universe@517 | 418 | EXPECT_EQ(nodes[1].next, &nodes[3]); |
universe@517 | 419 | EXPECT_EQ(nodes[2].prev, &nodes[4]); |
universe@517 | 420 | EXPECT_EQ(nodes[3].prev, &nodes[1]); |
universe@517 | 421 | EXPECT_EQ(nodes[4].next, &nodes[2]); |
universe@517 | 422 | } |
universe@482 | 423 | |
universe@482 | 424 | // insert end |
universe@517 | 425 | { |
universe@517 | 426 | node nodes[5]; |
universe@517 | 427 | void *begin = &nodes[0], *end = &nodes[2]; |
universe@482 | 428 | |
universe@517 | 429 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@517 | 430 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@517 | 431 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@482 | 432 | |
universe@517 | 433 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], nullptr); |
universe@517 | 434 | EXPECT_EQ(begin, &nodes[0]); |
universe@517 | 435 | EXPECT_EQ(end, &nodes[4]); |
universe@517 | 436 | EXPECT_EQ(nodes[2].next, &nodes[3]); |
universe@517 | 437 | EXPECT_EQ(nodes[3].prev, &nodes[2]); |
universe@517 | 438 | EXPECT_EQ(nodes[4].next, nullptr); |
universe@517 | 439 | } |
universe@482 | 440 | |
universe@482 | 441 | // insert begin |
universe@517 | 442 | { |
universe@517 | 443 | node nodes[5]; |
universe@517 | 444 | void *begin = &nodes[0], *end = &nodes[2]; |
universe@482 | 445 | |
universe@517 | 446 | cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next); |
universe@517 | 447 | cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next); |
universe@517 | 448 | cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next); |
universe@482 | 449 | |
universe@517 | 450 | cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, nullptr, &nodes[3], nullptr); |
universe@517 | 451 | EXPECT_EQ(begin, &nodes[3]); |
universe@517 | 452 | EXPECT_EQ(end, &nodes[2]); |
universe@517 | 453 | EXPECT_EQ(nodes[0].prev, &nodes[4]); |
universe@517 | 454 | EXPECT_EQ(nodes[3].prev, nullptr); |
universe@517 | 455 | EXPECT_EQ(nodes[4].next, &nodes[0]); |
universe@517 | 456 | } |
universe@482 | 457 | } |
universe@482 | 458 | |
universe@517 | 459 | TEST(LinkedList_LowLevel, cx_linked_list_first) { |
universe@517 | 460 | auto testdata = create_nodes_test_data(3); |
universe@517 | 461 | auto begin = testdata.begin; |
universe@517 | 462 | EXPECT_EQ(cx_linked_list_first(begin, loc_prev), begin); |
universe@517 | 463 | EXPECT_EQ(cx_linked_list_first(begin->next, loc_prev), begin); |
universe@517 | 464 | EXPECT_EQ(cx_linked_list_first(begin->next->next, loc_prev), begin); |
universe@475 | 465 | } |
universe@475 | 466 | |
universe@517 | 467 | TEST(LinkedList_LowLevel, cx_linked_list_last) { |
universe@517 | 468 | auto testdata = create_nodes_test_data(3); |
universe@517 | 469 | auto begin = testdata.begin; |
universe@517 | 470 | auto end = begin->next->next; |
universe@517 | 471 | EXPECT_EQ(cx_linked_list_last(begin, loc_next), end); |
universe@517 | 472 | EXPECT_EQ(cx_linked_list_last(begin->next, loc_next), end); |
universe@517 | 473 | EXPECT_EQ(cx_linked_list_last(begin->next->next, loc_next), end); |
universe@456 | 474 | } |
universe@456 | 475 | |
universe@517 | 476 | TEST(LinkedList_LowLevel, cx_linked_list_prev) { |
universe@517 | 477 | auto testdata = create_nodes_test_data(3); |
universe@517 | 478 | auto begin = testdata.begin; |
universe@517 | 479 | EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin), nullptr); |
universe@517 | 480 | EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next), begin); |
universe@517 | 481 | EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next->next), begin->next); |
universe@473 | 482 | } |
universe@473 | 483 | |
universe@517 | 484 | TEST(LinkedList_LowLevel, cx_linked_list_remove) { |
universe@517 | 485 | auto testdata = create_nodes_test_data({2, 4, 6}); |
universe@517 | 486 | auto begin = reinterpret_cast<void *>(testdata.begin); |
universe@517 | 487 | auto first = testdata.begin; |
universe@517 | 488 | auto second = first->next; |
universe@517 | 489 | auto third = second->next; |
universe@517 | 490 | auto end = reinterpret_cast<void *>(third); |
universe@473 | 491 | |
universe@486 | 492 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second); |
universe@517 | 493 | EXPECT_EQ(begin, first); |
universe@517 | 494 | EXPECT_EQ(end, third); |
universe@517 | 495 | EXPECT_EQ(first->prev, nullptr); |
universe@517 | 496 | EXPECT_EQ(first->next, third); |
universe@517 | 497 | EXPECT_EQ(third->prev, first); |
universe@517 | 498 | EXPECT_EQ(third->next, nullptr); |
universe@473 | 499 | |
universe@486 | 500 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third); |
universe@517 | 501 | EXPECT_EQ(begin, first); |
universe@517 | 502 | EXPECT_EQ(end, first); |
universe@517 | 503 | EXPECT_EQ(first->prev, nullptr); |
universe@517 | 504 | EXPECT_EQ(first->next, nullptr); |
universe@473 | 505 | |
universe@486 | 506 | cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first); |
universe@517 | 507 | EXPECT_EQ(begin, nullptr); |
universe@517 | 508 | EXPECT_EQ(end, nullptr); |
universe@473 | 509 | } |
universe@473 | 510 | |
universe@517 | 511 | TEST(LinkedList_LowLevel, cx_linked_list_size) { |
universe@517 | 512 | EXPECT_EQ(cx_linked_list_size(nullptr, loc_next), 0); |
universe@468 | 513 | |
universe@517 | 514 | { |
universe@517 | 515 | auto testdata = create_nodes_test_data(5); |
universe@517 | 516 | EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 5); |
universe@517 | 517 | } |
universe@468 | 518 | |
universe@517 | 519 | { |
universe@517 | 520 | auto testdata = create_nodes_test_data(13); |
universe@517 | 521 | EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 13); |
universe@517 | 522 | } |
universe@468 | 523 | } |
universe@468 | 524 | |
universe@517 | 525 | TEST(LinkedList_LowLevel, cx_linked_list_sort) { |
universe@521 | 526 | int_test_data<1500> testdata; |
universe@521 | 527 | std::array<int, 1500> sorted{}; |
universe@517 | 528 | std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), sorted.begin(), sorted.end()); |
universe@468 | 529 | |
universe@517 | 530 | auto scrambled = create_nodes_test_data(testdata.data.begin(), testdata.data.end()); |
universe@517 | 531 | void *begin = scrambled.begin; |
universe@486 | 532 | void *end = cx_linked_list_last(begin, loc_next); |
universe@468 | 533 | |
universe@639 | 534 | cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data, cx_cmp_int); |
universe@468 | 535 | |
universe@517 | 536 | node *check = reinterpret_cast<node *>(begin); |
universe@517 | 537 | node *check_last = nullptr; |
universe@517 | 538 | cx_for_n (i, sorted.size()) { |
universe@517 | 539 | EXPECT_EQ(check->data, sorted[i]); |
universe@517 | 540 | EXPECT_EQ(check->prev, check_last); |
universe@517 | 541 | if (i < sorted.size() - 1) { |
universe@517 | 542 | ASSERT_NE(check->next, nullptr); |
universe@468 | 543 | } |
universe@468 | 544 | check_last = check; |
universe@468 | 545 | check = check->next; |
universe@468 | 546 | } |
universe@517 | 547 | EXPECT_EQ(check, nullptr); |
universe@517 | 548 | EXPECT_EQ(end, check_last); |
universe@468 | 549 | } |
universe@468 | 550 | |
universe@517 | 551 | TEST(LinkedList_LowLevel, cx_linked_list_reverse) { |
universe@517 | 552 | auto testdata = create_nodes_test_data({2, 4, 6, 8}); |
universe@517 | 553 | auto expected = create_nodes_test_data({8, 6, 4, 2}); |
universe@473 | 554 | |
universe@517 | 555 | auto begin = reinterpret_cast<void *>(testdata.begin); |
universe@517 | 556 | auto end = cx_linked_list_last(begin, loc_next); |
universe@517 | 557 | auto orig_begin = begin, orig_end = end; |
universe@473 | 558 | |
universe@486 | 559 | cx_linked_list_reverse(&begin, &end, loc_prev, loc_next); |
universe@517 | 560 | EXPECT_EQ(end, orig_begin); |
universe@517 | 561 | EXPECT_EQ(begin, orig_end); |
universe@639 | 562 | EXPECT_EQ(cx_linked_list_compare(begin, expected.begin, loc_next, loc_data, cx_cmp_int), 0); |
universe@473 | 563 | } |
universe@456 | 564 | |
universe@517 | 565 | class HighLevelTest : public ::testing::Test { |
universe@517 | 566 | mutable std::unordered_set<CxList *> lists; |
universe@517 | 567 | protected: |
universe@518 | 568 | CxTestingAllocator testingAllocator; |
universe@455 | 569 | |
universe@517 | 570 | void TearDown() override { |
universe@517 | 571 | for (auto &&l: lists) cxListDestroy(l); |
universe@518 | 572 | EXPECT_TRUE(testingAllocator.verify()); |
universe@517 | 573 | } |
universe@517 | 574 | |
universe@517 | 575 | static constexpr size_t testdata_len = 250; |
universe@517 | 576 | int_test_data<testdata_len> testdata; |
universe@517 | 577 | |
universe@517 | 578 | auto autofree(CxList *list) const -> CxList * { |
universe@606 | 579 | if (list != nullptr) lists.insert(list); |
universe@517 | 580 | return list; |
universe@517 | 581 | } |
universe@517 | 582 | |
universe@517 | 583 | auto linkedListFromTestData() const -> CxList * { |
universe@629 | 584 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))); |
universe@629 | 585 | cxListAddArray(list, testdata.data.data(), testdata_len); |
universe@629 | 586 | return list; |
universe@517 | 587 | } |
universe@517 | 588 | |
universe@641 | 589 | auto pointerLinkedListFromTestData() const -> CxList * { |
universe@641 | 590 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int *))); |
universe@641 | 591 | cxListStorePointers(list); |
universe@641 | 592 | // note: cannot use cxListAddArray() because we don't have a list of pointers |
universe@641 | 593 | cx_for_n(i, testdata_len) cxListAdd(list, &testdata.data[i]); |
universe@641 | 594 | return list; |
universe@641 | 595 | } |
universe@641 | 596 | |
universe@606 | 597 | auto arrayListFromTestData() const -> CxList * { |
universe@606 | 598 | auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), testdata_len)); |
universe@629 | 599 | cxListAddArray(list, testdata.data.data(), testdata_len); |
universe@606 | 600 | return list; |
universe@606 | 601 | } |
universe@606 | 602 | |
universe@518 | 603 | void verifyCreate(CxList *list) const { |
universe@528 | 604 | EXPECT_EQ(list->content_destructor_type, CX_DESTRUCTOR_NONE); |
universe@517 | 605 | EXPECT_EQ(list->size, 0); |
universe@518 | 606 | EXPECT_EQ(list->allocator, &testingAllocator); |
universe@602 | 607 | EXPECT_EQ(list->cmpfunc, cx_cmp_int); |
universe@517 | 608 | } |
universe@517 | 609 | |
universe@528 | 610 | void verifyAdd( |
universe@528 | 611 | CxList *list, |
universe@606 | 612 | bool as_pointer |
universe@528 | 613 | ) { |
universe@517 | 614 | auto len = testdata_len; |
universe@517 | 615 | cx_for_n (i, len) EXPECT_EQ(cxListAdd(list, &testdata.data[i]), 0); |
universe@517 | 616 | EXPECT_EQ(list->size, len); |
universe@517 | 617 | EXPECT_GE(list->capacity, list->size); |
universe@517 | 618 | cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]); |
universe@517 | 619 | cx_for_n (i, len) ++testdata.data[i]; |
universe@606 | 620 | if (as_pointer) { |
universe@517 | 621 | cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]); |
universe@517 | 622 | } else { |
universe@517 | 623 | cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i] - 1); |
universe@517 | 624 | } |
universe@517 | 625 | } |
universe@517 | 626 | |
universe@517 | 627 | static void verifyInsert(CxList *list) { |
universe@517 | 628 | int a = 5, b = 47, c = 13, d = 42; |
universe@517 | 629 | |
universe@517 | 630 | EXPECT_NE(cxListInsert(list, 1, &a), 0); |
universe@517 | 631 | EXPECT_EQ(list->size, 0); |
universe@517 | 632 | EXPECT_EQ(cxListInsert(list, 0, &a), 0); |
universe@517 | 633 | EXPECT_EQ(list->size, 1); |
universe@517 | 634 | EXPECT_EQ(cxListInsert(list, 0, &b), 0); |
universe@517 | 635 | EXPECT_EQ(list->size, 2); |
universe@517 | 636 | EXPECT_EQ(cxListInsert(list, 1, &c), 0); |
universe@517 | 637 | EXPECT_EQ(list->size, 3); |
universe@517 | 638 | EXPECT_EQ(cxListInsert(list, 3, &d), 0); |
universe@517 | 639 | |
universe@611 | 640 | ASSERT_EQ(list->size, 4); |
universe@517 | 641 | EXPECT_GE(list->capacity, list->size); |
universe@517 | 642 | |
universe@517 | 643 | EXPECT_EQ(*(int *) cxListAt(list, 0), 47); |
universe@517 | 644 | EXPECT_EQ(*(int *) cxListAt(list, 1), 13); |
universe@517 | 645 | EXPECT_EQ(*(int *) cxListAt(list, 2), 5); |
universe@517 | 646 | EXPECT_EQ(*(int *) cxListAt(list, 3), 42); |
universe@517 | 647 | } |
universe@517 | 648 | |
universe@641 | 649 | static void verifyInsertArray( |
universe@641 | 650 | CxList *list, |
universe@641 | 651 | bool pointers = false |
universe@641 | 652 | ) { |
universe@638 | 653 | int a[5] = {5, 47, 11, 13, 42}; |
universe@638 | 654 | int b[5] = {9, 18, 72, 50, 7}; |
universe@641 | 655 | int *aptr[5]; |
universe@641 | 656 | int *bptr[5]; |
universe@641 | 657 | cx_for_n(i, 5) { |
universe@641 | 658 | aptr[i] = &a[i]; |
universe@641 | 659 | bptr[i] = &b[i]; |
universe@641 | 660 | } |
universe@638 | 661 | |
universe@638 | 662 | size_t inserted; |
universe@638 | 663 | |
universe@641 | 664 | if (pointers) { |
universe@641 | 665 | inserted = cxListInsertArray(list, 0, aptr, 5); |
universe@641 | 666 | } else { |
universe@641 | 667 | inserted = cxListInsertArray(list, 0, a, 5); |
universe@641 | 668 | } |
universe@638 | 669 | EXPECT_EQ(inserted, 5); |
universe@638 | 670 | EXPECT_EQ(*(int *) cxListAt(list, 0), 5); |
universe@638 | 671 | EXPECT_EQ(*(int *) cxListAt(list, 1), 47); |
universe@638 | 672 | EXPECT_EQ(*(int *) cxListAt(list, 2), 11); |
universe@638 | 673 | EXPECT_EQ(*(int *) cxListAt(list, 3), 13); |
universe@638 | 674 | EXPECT_EQ(*(int *) cxListAt(list, 4), 42); |
universe@641 | 675 | if (pointers) { |
universe@641 | 676 | inserted = cxListInsertArray(list, 3, bptr, 5); |
universe@641 | 677 | } else { |
universe@641 | 678 | inserted = cxListInsertArray(list, 3, b, 5); |
universe@641 | 679 | } |
universe@638 | 680 | EXPECT_EQ(inserted, 5); |
universe@638 | 681 | EXPECT_EQ(*(int *) cxListAt(list, 0), 5); |
universe@638 | 682 | EXPECT_EQ(*(int *) cxListAt(list, 1), 47); |
universe@638 | 683 | EXPECT_EQ(*(int *) cxListAt(list, 2), 11); |
universe@638 | 684 | EXPECT_EQ(*(int *) cxListAt(list, 3), 9); |
universe@638 | 685 | EXPECT_EQ(*(int *) cxListAt(list, 4), 18); |
universe@638 | 686 | EXPECT_EQ(*(int *) cxListAt(list, 5), 72); |
universe@638 | 687 | EXPECT_EQ(*(int *) cxListAt(list, 6), 50); |
universe@638 | 688 | EXPECT_EQ(*(int *) cxListAt(list, 7), 7); |
universe@638 | 689 | EXPECT_EQ(*(int *) cxListAt(list, 8), 13); |
universe@638 | 690 | EXPECT_EQ(*(int *) cxListAt(list, 9), 42); |
universe@638 | 691 | } |
universe@638 | 692 | |
universe@517 | 693 | void verifyRemove(CxList *list) const { |
universe@517 | 694 | EXPECT_EQ(cxListRemove(list, 2), 0); |
universe@517 | 695 | EXPECT_EQ(cxListRemove(list, 4), 0); |
universe@517 | 696 | EXPECT_EQ(list->size, testdata_len - 2); |
universe@517 | 697 | EXPECT_GE(list->capacity, list->size); |
universe@517 | 698 | EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[0]); |
universe@517 | 699 | EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[1]); |
universe@517 | 700 | EXPECT_EQ(*(int *) cxListAt(list, 2), testdata.data[3]); |
universe@517 | 701 | EXPECT_EQ(*(int *) cxListAt(list, 3), testdata.data[4]); |
universe@517 | 702 | EXPECT_EQ(*(int *) cxListAt(list, 4), testdata.data[6]); |
universe@517 | 703 | |
universe@517 | 704 | EXPECT_EQ(cxListRemove(list, 0), 0); |
universe@517 | 705 | EXPECT_EQ(list->size, testdata_len - 3); |
universe@517 | 706 | EXPECT_GE(list->capacity, list->size); |
universe@517 | 707 | EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[1]); |
universe@517 | 708 | EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[3]); |
universe@517 | 709 | |
universe@517 | 710 | EXPECT_NE(cxListRemove(list, testdata_len), 0); |
universe@517 | 711 | } |
universe@517 | 712 | |
universe@666 | 713 | void verifyClear(CxList *list) { |
universe@666 | 714 | // use the testing allocator for testing the destructor function |
universe@666 | 715 | list->content_destructor_type = CX_DESTRUCTOR_ADVANCED; |
universe@666 | 716 | list->advanced_destructor.func = free_testdatastruct; |
universe@666 | 717 | list->advanced_destructor.data = &testingAllocator; |
universe@666 | 718 | |
universe@666 | 719 | testdatastruct s[10]; |
universe@666 | 720 | for (auto &t: s) { |
universe@666 | 721 | t.ptr = cxMalloc(&testingAllocator, 16); |
universe@666 | 722 | cxListAdd(list, &t); |
universe@666 | 723 | } |
universe@666 | 724 | |
universe@666 | 725 | cxListClear(list); |
universe@666 | 726 | } |
universe@666 | 727 | |
universe@647 | 728 | static void verifySwap(CxList *list) { |
universe@647 | 729 | ASSERT_EQ(list->size, 0); |
universe@647 | 730 | |
universe@647 | 731 | int original[16] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}; |
universe@647 | 732 | int swapped[16] = {8, 4, 14, 3, 1, 5, 9, 12, 0, 6, 11, 10, 7, 15, 2, 13}; |
universe@647 | 733 | |
universe@647 | 734 | // we have to add the items one by one, because it could be a pointer list |
universe@647 | 735 | cx_for_n(i, 16) { |
universe@647 | 736 | cxListAdd(list, &original[i]); |
universe@647 | 737 | } |
universe@647 | 738 | |
universe@647 | 739 | int result; |
universe@647 | 740 | |
universe@647 | 741 | // execute the test two times with different item sizes |
universe@647 | 742 | result = cxListSwap(list, 1, 4); |
universe@647 | 743 | EXPECT_EQ(0, result); |
universe@647 | 744 | result = cxListSwap(list, 2, 14); |
universe@647 | 745 | EXPECT_EQ(0, result); |
universe@647 | 746 | result = cxListSwap(list, 9, 6); |
universe@647 | 747 | EXPECT_EQ(0, result); |
universe@647 | 748 | result = cxListSwap(list, 3, 3); |
universe@647 | 749 | EXPECT_EQ(0, result); |
universe@647 | 750 | result = cxListSwap(list, 10, 11); |
universe@647 | 751 | EXPECT_EQ(0, result); |
universe@647 | 752 | result = cxListSwap(list, 8, 0); |
universe@647 | 753 | EXPECT_EQ(0, result); |
universe@647 | 754 | result = cxListSwap(list, 7, 12); |
universe@647 | 755 | EXPECT_EQ(0, result); |
universe@647 | 756 | result = cxListSwap(list, 13, 15); |
universe@647 | 757 | EXPECT_EQ(0, result); |
universe@647 | 758 | |
universe@647 | 759 | result = cxListSwap(list, 5, 16); |
universe@647 | 760 | EXPECT_NE(0, result); |
universe@647 | 761 | result = cxListSwap(list, 16, 6); |
universe@647 | 762 | EXPECT_NE(0, result); |
universe@647 | 763 | result = cxListSwap(list, 16, 17); |
universe@647 | 764 | EXPECT_NE(0, result); |
universe@647 | 765 | |
universe@655 | 766 | auto iter = cxListIterator(list); |
universe@647 | 767 | cx_foreach(int*, e, iter) { |
universe@647 | 768 | EXPECT_EQ(*e, swapped[iter.index]); |
universe@647 | 769 | } |
universe@655 | 770 | iter = cxListBackwardsIterator(list); |
universe@655 | 771 | cx_foreach(int*, e, iter) { |
universe@655 | 772 | EXPECT_EQ(*e, swapped[iter.index]); |
universe@647 | 773 | } |
universe@647 | 774 | } |
universe@647 | 775 | |
universe@517 | 776 | void verifyAt(CxList *list) const { |
universe@517 | 777 | auto len = testdata_len; |
universe@517 | 778 | EXPECT_EQ(list->size, len); |
universe@521 | 779 | cx_for_n (i, len) { |
universe@521 | 780 | EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]); |
universe@521 | 781 | } |
universe@517 | 782 | EXPECT_EQ(cxListAt(list, list->size), nullptr); |
universe@517 | 783 | } |
universe@517 | 784 | |
universe@517 | 785 | void verifyFind(CxList *list) const { |
universe@517 | 786 | cx_for_n (attempt, 25) { |
universe@517 | 787 | size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp) |
universe@517 | 788 | int val = testdata.data[exp]; |
universe@517 | 789 | // randomly picked number could occur earlier in list - find first position |
universe@517 | 790 | cx_for_n (i, exp) { |
universe@517 | 791 | if (testdata.data[i] == val) { |
universe@517 | 792 | exp = i; |
universe@517 | 793 | break; |
universe@517 | 794 | } |
universe@517 | 795 | } |
universe@517 | 796 | EXPECT_EQ(cxListFind(list, &val), exp); |
universe@517 | 797 | } |
universe@517 | 798 | } |
universe@517 | 799 | |
universe@517 | 800 | void verifySort(CxList *list) const { |
universe@517 | 801 | std::array<int, testdata_len> expected{}; |
universe@517 | 802 | std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), expected.begin(), expected.end()); |
universe@517 | 803 | cxListSort(list); |
universe@517 | 804 | cx_for_n (i, testdata_len) ASSERT_EQ(*(int *) cxListAt(list, i), expected[i]); |
universe@517 | 805 | } |
universe@517 | 806 | |
universe@517 | 807 | void verifyIterator(CxList *list) const { |
universe@655 | 808 | auto iter = cxListIterator(list); |
universe@655 | 809 | size_t i = 0; |
universe@517 | 810 | cx_foreach(int*, x, iter) { |
universe@655 | 811 | ASSERT_EQ(i, iter.index); |
universe@655 | 812 | EXPECT_EQ(*x, testdata.data[iter.index]); |
universe@517 | 813 | i++; |
universe@517 | 814 | } |
universe@655 | 815 | ASSERT_EQ(i, list->size); |
universe@655 | 816 | iter = cxListBackwardsIterator(list); |
universe@655 | 817 | cx_foreach(int*, x, iter) { |
universe@655 | 818 | ASSERT_EQ(i - 1, iter.index); |
universe@655 | 819 | EXPECT_EQ(*x, testdata.data[iter.index]); |
universe@655 | 820 | i--; |
universe@655 | 821 | } |
universe@655 | 822 | ASSERT_EQ(i, 0); |
universe@517 | 823 | auto len = testdata_len; |
universe@655 | 824 | i = len / 2; |
universe@655 | 825 | auto mut_iter = cxListMutIteratorAt(list, i); |
universe@655 | 826 | size_t j = 0; |
universe@655 | 827 | cx_foreach(int*, x, mut_iter) { |
universe@655 | 828 | ASSERT_EQ(mut_iter.index, len / 2 + j / 2); |
universe@655 | 829 | ASSERT_EQ(*x, testdata.data[i]); |
universe@655 | 830 | if (i % 2 == 1) cxIteratorFlagRemoval(mut_iter); |
universe@655 | 831 | i++; |
universe@655 | 832 | j++; |
universe@655 | 833 | } |
universe@655 | 834 | ASSERT_EQ(i, len); |
universe@655 | 835 | i = len / 2; |
universe@655 | 836 | j = 0; |
universe@655 | 837 | mut_iter = cxListMutBackwardsIteratorAt(list, i - 1); |
universe@655 | 838 | cx_foreach(int*, x, mut_iter) { |
universe@655 | 839 | ASSERT_EQ(mut_iter.index, len / 2 - 1 - j); |
universe@655 | 840 | ASSERT_EQ(*x, testdata.data[i - 1]); |
universe@655 | 841 | if (i % 2 == 0) cxIteratorFlagRemoval(mut_iter); |
universe@655 | 842 | i--; |
universe@655 | 843 | j++; |
universe@655 | 844 | } |
universe@655 | 845 | ASSERT_EQ(i, 0); |
universe@517 | 846 | ASSERT_EQ(list->size, len / 2); |
universe@517 | 847 | cx_for_n(j, len / 2) ASSERT_EQ(*(int *) cxListAt(list, j), testdata.data[j * 2]); |
universe@517 | 848 | } |
universe@517 | 849 | |
universe@517 | 850 | static void verifyInsertViaIterator(CxList *list) { |
universe@517 | 851 | int newdata[] = {10, 20, 30, 40, 50}; |
universe@517 | 852 | |
universe@655 | 853 | auto iter = cxListMutIteratorAt(list, 2); |
universe@630 | 854 | EXPECT_TRUE(cxIteratorValid(iter)); |
universe@517 | 855 | EXPECT_EQ(iter.index, 2); |
universe@630 | 856 | EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2); |
universe@517 | 857 | cxListInsertAfter(&iter, &newdata[0]); |
universe@630 | 858 | EXPECT_TRUE(cxIteratorValid(iter)); |
universe@517 | 859 | EXPECT_EQ(iter.index, 2); |
universe@630 | 860 | EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2); |
universe@517 | 861 | cxListInsertBefore(&iter, &newdata[1]); |
universe@630 | 862 | EXPECT_TRUE(cxIteratorValid(iter)); |
universe@517 | 863 | EXPECT_EQ(iter.index, 3); |
universe@630 | 864 | EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2); |
universe@517 | 865 | |
universe@655 | 866 | iter = cxListMutIterator(list); |
universe@517 | 867 | cxListInsertBefore(&iter, &newdata[2]); |
universe@630 | 868 | EXPECT_TRUE(cxIteratorValid(iter)); |
universe@517 | 869 | EXPECT_EQ(iter.index, 1); |
universe@630 | 870 | EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 0); |
universe@655 | 871 | iter = cxListMutIteratorAt(list, list->size); |
universe@517 | 872 | cxListInsertBefore(&iter, &newdata[3]); |
universe@630 | 873 | EXPECT_FALSE(cxIteratorValid(iter)); |
universe@517 | 874 | EXPECT_EQ(iter.index, 9); |
universe@655 | 875 | iter = cxListMutIteratorAt(list, list->size); |
universe@517 | 876 | cxListInsertAfter(&iter, &newdata[4]); |
universe@630 | 877 | EXPECT_FALSE(cxIteratorValid(iter)); |
universe@517 | 878 | EXPECT_EQ(iter.index, 10); |
universe@517 | 879 | |
universe@517 | 880 | int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50}; |
universe@517 | 881 | cx_for_n (j, 10) EXPECT_EQ(*(int *) cxListAt(list, j), expdata[j]); |
universe@517 | 882 | } |
universe@521 | 883 | |
universe@521 | 884 | void verifyReverse(CxList *list) const { |
universe@521 | 885 | cxListReverse(list); |
universe@521 | 886 | cx_for_n(i, testdata_len) { |
universe@521 | 887 | ASSERT_EQ(*(int *) cxListAt(list, i), testdata.data[testdata_len - 1 - i]); |
universe@521 | 888 | } |
universe@521 | 889 | } |
universe@521 | 890 | |
universe@528 | 891 | static void verifyCompare( |
universe@528 | 892 | CxList *left, |
universe@528 | 893 | CxList *right |
universe@528 | 894 | ) { |
universe@521 | 895 | EXPECT_EQ(cxListCompare(left, right), 0); |
universe@521 | 896 | int x = 42; |
universe@521 | 897 | cxListAdd(left, &x); |
universe@521 | 898 | ASSERT_GT(left->size, right->size); |
universe@521 | 899 | EXPECT_GT(cxListCompare(left, right), 0); |
universe@521 | 900 | EXPECT_LT(cxListCompare(right, left), 0); |
universe@521 | 901 | cxListAdd(right, &x); |
universe@521 | 902 | ASSERT_EQ(left->size, right->size); |
universe@521 | 903 | EXPECT_EQ(cxListCompare(left, right), 0); |
universe@521 | 904 | int a = 5, b = 10; |
universe@521 | 905 | cxListInsert(left, 15, &a); |
universe@521 | 906 | cxListInsert(right, 15, &b); |
universe@521 | 907 | ASSERT_EQ(left->size, right->size); |
universe@521 | 908 | EXPECT_LT(cxListCompare(left, right), 0); |
universe@521 | 909 | EXPECT_GT(cxListCompare(right, left), 0); |
universe@528 | 910 | *(int *) cxListAt(left, 15) = 10; |
universe@521 | 911 | EXPECT_EQ(cxListCompare(left, right), 0); |
universe@521 | 912 | } |
universe@517 | 913 | }; |
universe@517 | 914 | |
universe@517 | 915 | class LinkedList : public HighLevelTest { |
universe@517 | 916 | }; |
universe@517 | 917 | |
universe@641 | 918 | class PointerLinkedList : public HighLevelTest { |
universe@641 | 919 | }; |
universe@641 | 920 | |
universe@606 | 921 | class ArrayList : public HighLevelTest { |
universe@606 | 922 | }; |
universe@606 | 923 | |
universe@641 | 924 | TEST_F(PointerLinkedList, cxListStorePointers) { |
universe@641 | 925 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, 47)); |
universe@641 | 926 | EXPECT_FALSE(cxListIsStoringPointers(list)); |
universe@641 | 927 | cxListStorePointers(list); |
universe@641 | 928 | EXPECT_EQ(list->itemsize, sizeof(void *)); |
universe@641 | 929 | EXPECT_NE(list->cl, nullptr); |
universe@641 | 930 | EXPECT_NE(list->climpl, nullptr); |
universe@641 | 931 | EXPECT_TRUE(cxListIsStoringPointers(list)); |
universe@641 | 932 | cxListStoreObjects(list); |
universe@641 | 933 | EXPECT_NE(list->cl, nullptr); |
universe@641 | 934 | EXPECT_EQ(list->climpl, nullptr); |
universe@641 | 935 | EXPECT_FALSE(cxListIsStoringPointers(list)); |
universe@641 | 936 | } |
universe@641 | 937 | |
universe@517 | 938 | TEST_F(LinkedList, cxLinkedListCreate) { |
universe@602 | 939 | CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))); |
universe@606 | 940 | ASSERT_NE(list, nullptr); |
universe@517 | 941 | EXPECT_EQ(list->itemsize, sizeof(int)); |
universe@606 | 942 | EXPECT_EQ(list->capacity, (size_t) -1); |
universe@517 | 943 | verifyCreate(list); |
universe@506 | 944 | } |
universe@506 | 945 | |
universe@662 | 946 | TEST_F(LinkedList, cxLinkedListCreateSimple) { |
universe@662 | 947 | CxList *list = autofree(cxLinkedListCreateSimple(sizeof(int))); |
universe@662 | 948 | ASSERT_NE(list, nullptr); |
universe@662 | 949 | EXPECT_EQ(list->itemsize, sizeof(int)); |
universe@662 | 950 | EXPECT_EQ(list->capacity, (size_t) -1); |
universe@662 | 951 | EXPECT_EQ(list->cmpfunc, nullptr); |
universe@662 | 952 | EXPECT_EQ(list->allocator, cxDefaultAllocator); |
universe@662 | 953 | } |
universe@662 | 954 | |
universe@606 | 955 | TEST_F(ArrayList, cxArrayListCreate) { |
universe@606 | 956 | CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8)); |
universe@606 | 957 | ASSERT_NE(list, nullptr); |
universe@606 | 958 | EXPECT_EQ(list->itemsize, sizeof(int)); |
universe@606 | 959 | EXPECT_EQ(list->capacity, 8); |
universe@606 | 960 | verifyCreate(list); |
universe@606 | 961 | } |
universe@606 | 962 | |
universe@662 | 963 | TEST_F(ArrayList, cxArrayListCreateSimple) { |
universe@662 | 964 | CxList *list = autofree(cxArrayListCreateSimple(sizeof(int), 8)); |
universe@662 | 965 | ASSERT_NE(list, nullptr); |
universe@662 | 966 | EXPECT_EQ(list->cmpfunc, nullptr); |
universe@662 | 967 | EXPECT_EQ(list->allocator, cxDefaultAllocator); |
universe@662 | 968 | EXPECT_EQ(list->itemsize, sizeof(int)); |
universe@662 | 969 | EXPECT_EQ(list->capacity, 8); |
universe@662 | 970 | } |
universe@662 | 971 | |
universe@517 | 972 | TEST_F(LinkedList, cxListAdd) { |
universe@641 | 973 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))); |
universe@517 | 974 | verifyAdd(list, false); |
universe@488 | 975 | } |
universe@488 | 976 | |
universe@641 | 977 | TEST_F(PointerLinkedList, cxListAdd) { |
universe@641 | 978 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int *))); |
universe@641 | 979 | cxListStorePointers(list); |
universe@641 | 980 | verifyAdd(list, true); |
universe@641 | 981 | } |
universe@641 | 982 | |
universe@606 | 983 | TEST_F(ArrayList, cxListAdd) { |
universe@641 | 984 | auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8)); |
universe@606 | 985 | verifyAdd(list, false); |
universe@606 | 986 | } |
universe@606 | 987 | |
universe@517 | 988 | TEST_F(LinkedList, cxListInsert) { |
universe@602 | 989 | verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)))); |
universe@459 | 990 | } |
universe@459 | 991 | |
universe@641 | 992 | TEST_F(PointerLinkedList, cxListInsert) { |
universe@641 | 993 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int *))); |
universe@641 | 994 | cxListStorePointers(list); |
universe@641 | 995 | verifyInsert(list); |
universe@641 | 996 | } |
universe@641 | 997 | |
universe@606 | 998 | TEST_F(ArrayList, cxListInsert) { |
universe@606 | 999 | verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 2))); |
universe@606 | 1000 | } |
universe@606 | 1001 | |
universe@638 | 1002 | TEST_F(LinkedList, cxListInsertArray) { |
universe@638 | 1003 | verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)))); |
universe@638 | 1004 | } |
universe@638 | 1005 | |
universe@641 | 1006 | TEST_F(PointerLinkedList, cxListInsertArray) { |
universe@641 | 1007 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int *))); |
universe@641 | 1008 | cxListStorePointers(list); |
universe@641 | 1009 | verifyInsertArray(list, true); |
universe@641 | 1010 | } |
universe@641 | 1011 | |
universe@638 | 1012 | TEST_F(ArrayList, cxListInsertArray) { |
universe@638 | 1013 | verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4))); |
universe@638 | 1014 | } |
universe@638 | 1015 | |
universe@517 | 1016 | TEST_F(LinkedList, cxListRemove) { |
universe@517 | 1017 | verifyRemove(linkedListFromTestData()); |
universe@498 | 1018 | } |
universe@498 | 1019 | |
universe@641 | 1020 | TEST_F(PointerLinkedList, cxListRemove) { |
universe@641 | 1021 | verifyRemove(pointerLinkedListFromTestData()); |
universe@641 | 1022 | } |
universe@641 | 1023 | |
universe@606 | 1024 | TEST_F(ArrayList, cxListRemove) { |
universe@606 | 1025 | verifyRemove(arrayListFromTestData()); |
universe@606 | 1026 | } |
universe@606 | 1027 | |
universe@666 | 1028 | TEST_F(LinkedList, cxListClear) { |
universe@666 | 1029 | verifyClear(autofree(cxLinkedListCreateSimple(sizeof(testdatastruct)))); |
universe@666 | 1030 | } |
universe@666 | 1031 | |
universe@666 | 1032 | TEST_F(PointerLinkedList, cxListClear) { |
universe@666 | 1033 | auto l = cxLinkedListCreateSimple(sizeof(testdatastruct)); |
universe@666 | 1034 | cxListStorePointers(l); |
universe@666 | 1035 | verifyClear(autofree(l)); |
universe@666 | 1036 | } |
universe@666 | 1037 | |
universe@666 | 1038 | TEST_F(ArrayList, cxListClear) { |
universe@666 | 1039 | verifyClear(autofree(cxArrayListCreateSimple(sizeof(testdatastruct), 8))); |
universe@666 | 1040 | } |
universe@666 | 1041 | |
universe@647 | 1042 | TEST_F(LinkedList, cxListSwap) { |
universe@647 | 1043 | verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)))); |
universe@647 | 1044 | } |
universe@647 | 1045 | |
universe@647 | 1046 | TEST_F(PointerLinkedList, cxListSwap) { |
universe@647 | 1047 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int *))); |
universe@647 | 1048 | cxListStorePointers(list); |
universe@647 | 1049 | verifySwap(list); |
universe@647 | 1050 | } |
universe@647 | 1051 | |
universe@647 | 1052 | TEST_F(ArrayList, cxListSwap) { |
universe@647 | 1053 | verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16))); |
universe@647 | 1054 | } |
universe@647 | 1055 | |
universe@647 | 1056 | TEST_F(LinkedList, cxListSwapNoSBO) { |
universe@647 | 1057 | CX_DISABLE_LINKED_LIST_SWAP_SBO = true; |
universe@647 | 1058 | verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)))); |
universe@647 | 1059 | CX_DISABLE_LINKED_LIST_SWAP_SBO = false; |
universe@647 | 1060 | } |
universe@647 | 1061 | |
universe@647 | 1062 | TEST_F(PointerLinkedList, cxListSwapNoSBO) { |
universe@647 | 1063 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int *))); |
universe@647 | 1064 | cxListStorePointers(list); |
universe@647 | 1065 | CX_DISABLE_LINKED_LIST_SWAP_SBO = true; |
universe@647 | 1066 | verifySwap(list); |
universe@647 | 1067 | CX_DISABLE_LINKED_LIST_SWAP_SBO = false; |
universe@647 | 1068 | } |
universe@647 | 1069 | |
universe@647 | 1070 | TEST_F(ArrayList, cxListSwapNoSBO) { |
universe@647 | 1071 | CX_DISABLE_LINKED_LIST_SWAP_SBO = true; |
universe@647 | 1072 | verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16))); |
universe@647 | 1073 | CX_DISABLE_LINKED_LIST_SWAP_SBO = false; |
universe@647 | 1074 | } |
universe@647 | 1075 | |
universe@517 | 1076 | TEST_F(LinkedList, cxListAt) { |
universe@517 | 1077 | verifyAt(linkedListFromTestData()); |
universe@509 | 1078 | } |
universe@509 | 1079 | |
universe@641 | 1080 | TEST_F(PointerLinkedList, cxListAt) { |
universe@641 | 1081 | verifyAt(pointerLinkedListFromTestData()); |
universe@641 | 1082 | } |
universe@641 | 1083 | |
universe@606 | 1084 | TEST_F(ArrayList, cxListAt) { |
universe@606 | 1085 | verifyAt(arrayListFromTestData()); |
universe@606 | 1086 | } |
universe@606 | 1087 | |
universe@517 | 1088 | TEST_F(LinkedList, cxListFind) { |
universe@517 | 1089 | verifyFind(linkedListFromTestData()); |
universe@509 | 1090 | } |
universe@509 | 1091 | |
universe@641 | 1092 | TEST_F(PointerLinkedList, cxListFind) { |
universe@641 | 1093 | verifyFind(pointerLinkedListFromTestData()); |
universe@641 | 1094 | } |
universe@641 | 1095 | |
universe@606 | 1096 | TEST_F(ArrayList, cxListFind) { |
universe@606 | 1097 | verifyFind(arrayListFromTestData()); |
universe@606 | 1098 | } |
universe@606 | 1099 | |
universe@517 | 1100 | TEST_F(LinkedList, cxListSort) { |
universe@517 | 1101 | verifySort(linkedListFromTestData()); |
universe@498 | 1102 | } |
universe@498 | 1103 | |
universe@641 | 1104 | TEST_F(PointerLinkedList, cxListSort) { |
universe@641 | 1105 | verifySort(pointerLinkedListFromTestData()); |
universe@641 | 1106 | } |
universe@641 | 1107 | |
universe@606 | 1108 | TEST_F(ArrayList, cxListSort) { |
universe@606 | 1109 | verifySort(arrayListFromTestData()); |
universe@606 | 1110 | } |
universe@606 | 1111 | |
universe@517 | 1112 | TEST_F(LinkedList, Iterator) { |
universe@517 | 1113 | verifyIterator(linkedListFromTestData()); |
universe@509 | 1114 | } |
universe@498 | 1115 | |
universe@641 | 1116 | TEST_F(PointerLinkedList, Iterator) { |
universe@641 | 1117 | verifyIterator(pointerLinkedListFromTestData()); |
universe@641 | 1118 | } |
universe@641 | 1119 | |
universe@606 | 1120 | TEST_F(ArrayList, Iterator) { |
universe@606 | 1121 | verifyIterator(arrayListFromTestData()); |
universe@606 | 1122 | } |
universe@606 | 1123 | |
universe@517 | 1124 | TEST_F(LinkedList, InsertViaIterator) { |
universe@517 | 1125 | int fivenums[] = {0, 1, 2, 3, 4, 5}; |
universe@629 | 1126 | CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))); |
universe@629 | 1127 | cxListAddArray(list, fivenums, 5); |
universe@517 | 1128 | verifyInsertViaIterator(list); |
universe@459 | 1129 | } |
universe@459 | 1130 | |
universe@641 | 1131 | TEST_F(PointerLinkedList, InsertViaIterator) { |
universe@641 | 1132 | int fivenums[] = {0, 1, 2, 3, 4, 5}; |
universe@641 | 1133 | auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int *))); |
universe@641 | 1134 | cxListStorePointers(list); |
universe@641 | 1135 | // note: cannot use cxListAddArray() because we don't have a list of pointers |
universe@641 | 1136 | cx_for_n(i, 5) cxListAdd(list, &fivenums[i]); |
universe@641 | 1137 | verifyInsertViaIterator(list); |
universe@641 | 1138 | } |
universe@641 | 1139 | |
universe@606 | 1140 | TEST_F(ArrayList, InsertViaIterator) { |
universe@606 | 1141 | int fivenums[] = {0, 1, 2, 3, 4, 5}; |
universe@606 | 1142 | CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4)); |
universe@629 | 1143 | cxListAddArray(list, fivenums, 5); |
universe@606 | 1144 | verifyInsertViaIterator(list); |
universe@606 | 1145 | } |
universe@606 | 1146 | |
universe@521 | 1147 | TEST_F(LinkedList, cxListReverse) { |
universe@521 | 1148 | verifyReverse(linkedListFromTestData()); |
universe@521 | 1149 | } |
universe@521 | 1150 | |
universe@641 | 1151 | TEST_F(PointerLinkedList, cxListReverse) { |
universe@641 | 1152 | verifyReverse(pointerLinkedListFromTestData()); |
universe@641 | 1153 | } |
universe@641 | 1154 | |
universe@606 | 1155 | TEST_F(ArrayList, cxListReverse) { |
universe@606 | 1156 | verifyReverse(arrayListFromTestData()); |
universe@606 | 1157 | } |
universe@606 | 1158 | |
universe@521 | 1159 | TEST_F(LinkedList, cxListCompare) { |
universe@521 | 1160 | auto left = linkedListFromTestData(); |
universe@521 | 1161 | auto right = linkedListFromTestData(); |
universe@521 | 1162 | verifyCompare(left, right); |
universe@521 | 1163 | } |
universe@521 | 1164 | |
universe@641 | 1165 | TEST_F(LinkedList, cxListCompareWithPtrList) { |
universe@641 | 1166 | auto left = linkedListFromTestData(); |
universe@641 | 1167 | auto right = pointerLinkedListFromTestData(); |
universe@641 | 1168 | verifyCompare(left, right); |
universe@641 | 1169 | } |
universe@641 | 1170 | |
universe@606 | 1171 | TEST_F(LinkedList, cxListCompareWithArrayList) { |
universe@606 | 1172 | auto left = linkedListFromTestData(); |
universe@606 | 1173 | auto right = arrayListFromTestData(); |
universe@606 | 1174 | verifyCompare(left, right); |
universe@606 | 1175 | } |
universe@606 | 1176 | |
universe@641 | 1177 | TEST_F(PointerLinkedList, cxListCompare) { |
universe@641 | 1178 | auto left = pointerLinkedListFromTestData(); |
universe@641 | 1179 | auto right = pointerLinkedListFromTestData(); |
universe@641 | 1180 | verifyCompare(left, right); |
universe@641 | 1181 | } |
universe@641 | 1182 | |
universe@641 | 1183 | TEST_F(PointerLinkedList, cxListCompareWithNormalList) { |
universe@641 | 1184 | auto left = pointerLinkedListFromTestData(); |
universe@641 | 1185 | auto right = linkedListFromTestData(); |
universe@641 | 1186 | verifyCompare(left, right); |
universe@641 | 1187 | } |
universe@641 | 1188 | |
universe@641 | 1189 | TEST_F(PointerLinkedList, cxListCompareWithArrayList) { |
universe@641 | 1190 | auto left = pointerLinkedListFromTestData(); |
universe@641 | 1191 | auto right = arrayListFromTestData(); |
universe@641 | 1192 | verifyCompare(left, right); |
universe@641 | 1193 | } |
universe@641 | 1194 | |
universe@606 | 1195 | TEST_F(ArrayList, cxListCompare) { |
universe@606 | 1196 | auto left = arrayListFromTestData(); |
universe@606 | 1197 | auto right = arrayListFromTestData(); |
universe@606 | 1198 | verifyCompare(left, right); |
universe@606 | 1199 | } |
universe@606 | 1200 | |
universe@641 | 1201 | TEST_F(ArrayList, cxListCompareWithPtrList) { |
universe@641 | 1202 | auto left = arrayListFromTestData(); |
universe@641 | 1203 | auto right = pointerLinkedListFromTestData(); |
universe@641 | 1204 | verifyCompare(left, right); |
universe@641 | 1205 | } |
universe@641 | 1206 | |
universe@641 | 1207 | TEST_F(ArrayList, cxListCompareWithNormalList) { |
universe@606 | 1208 | auto left = arrayListFromTestData(); |
universe@606 | 1209 | auto right = linkedListFromTestData(); |
universe@606 | 1210 | verifyCompare(left, right); |
universe@606 | 1211 | } |
universe@641 | 1212 | |
universe@641 | 1213 | TEST_F(PointerLinkedList, NoDestructor) { |
universe@641 | 1214 | void *item = cxMalloc(&testingAllocator, sizeof(int)); |
universe@641 | 1215 | auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, sizeof(int *)); |
universe@641 | 1216 | cxListStorePointers(list); |
universe@641 | 1217 | cxListAdd(list, item); |
universe@641 | 1218 | ASSERT_FALSE(testingAllocator.verify()); |
universe@641 | 1219 | cxListDestroy(list); |
universe@641 | 1220 | EXPECT_FALSE(testingAllocator.verify()); |
universe@641 | 1221 | cxFree(&testingAllocator, item); |
universe@641 | 1222 | EXPECT_TRUE(testingAllocator.verify()); |
universe@641 | 1223 | } |
universe@641 | 1224 | |
universe@641 | 1225 | TEST_F(PointerLinkedList, SimpleDestructor) { |
universe@641 | 1226 | int item = 0; |
universe@641 | 1227 | auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, sizeof(int *)); |
universe@641 | 1228 | cxListStorePointers(list); |
universe@641 | 1229 | list->content_destructor_type = CX_DESTRUCTOR_SIMPLE; |
universe@641 | 1230 | list->simple_destructor = [](void *elem) { *(int *) elem = 42; }; |
universe@641 | 1231 | cxListAdd(list, &item); |
universe@641 | 1232 | cxListDestroy(list); |
universe@641 | 1233 | EXPECT_EQ(item, 42); |
universe@641 | 1234 | } |
universe@641 | 1235 | |
universe@641 | 1236 | TEST_F(PointerLinkedList, AdvancedDestructor) { |
universe@641 | 1237 | void *item = cxMalloc(&testingAllocator, sizeof(int)); |
universe@641 | 1238 | auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, sizeof(int *)); |
universe@641 | 1239 | cxListStorePointers(list); |
universe@641 | 1240 | list->content_destructor_type = CX_DESTRUCTOR_ADVANCED; |
universe@641 | 1241 | list->advanced_destructor.data = &testingAllocator; |
universe@641 | 1242 | list->advanced_destructor.func = (cx_destructor_func2) cxFree; |
universe@641 | 1243 | cxListAdd(list, item); |
universe@641 | 1244 | ASSERT_FALSE(testingAllocator.verify()); |
universe@641 | 1245 | cxListDestroy(list); |
universe@641 | 1246 | EXPECT_TRUE(testingAllocator.verify()); |
universe@641 | 1247 | } |