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