Wed, 07 Aug 2019 21:14:58 +0200
ucx_array_sort() uses qsort_r(), if available
olaf@9 | 1 | /* |
universe@103 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@103 | 3 | * |
universe@334 | 4 | * Copyright 2019 Mike Becker, Olaf Wintermann All rights reserved. |
universe@103 | 5 | * |
universe@103 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@103 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@103 | 8 | * |
universe@103 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@103 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@103 | 11 | * |
universe@103 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@103 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@103 | 14 | * documentation and/or other materials provided with the distribution. |
universe@103 | 15 | * |
universe@103 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@103 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@103 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@103 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@103 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@103 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@103 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@103 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@103 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@103 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@103 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
olaf@9 | 27 | */ |
olaf@9 | 28 | |
universe@334 | 29 | #include "array_tests.h" |
universe@251 | 30 | #include <ucx/utils.h> |
olaf@9 | 31 | |
universe@334 | 32 | UCX_TEST(test_ucx_array_free) { |
universe@334 | 33 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@334 | 34 | |
universe@334 | 35 | UCX_TEST_BEGIN |
universe@334 | 36 | ucx_array_free(&array); |
universe@334 | 37 | UCX_TEST_ASSERT(array.data == NULL, "data pointer not NULL after free"); |
universe@334 | 38 | UCX_TEST_ASSERT(array.size == 0, "size not zero after free"); |
universe@334 | 39 | UCX_TEST_ASSERT(array.capacity == 0, "capacity not zero after free"); |
universe@334 | 40 | UCX_TEST_ASSERT(array.allocator == ucx_default_allocator(), |
universe@334 | 41 | "allocator corrupted during free"); |
universe@334 | 42 | UCX_TEST_END |
universe@334 | 43 | } |
universe@334 | 44 | |
universe@334 | 45 | UCX_TEST(test_ucx_array_new) { |
universe@334 | 46 | UcxArray array = ucx_array_new(16, 47); |
universe@334 | 47 | |
universe@334 | 48 | UCX_TEST_BEGIN |
universe@334 | 49 | UCX_TEST_ASSERT(array.data, "no memory allocated"); |
universe@334 | 50 | UCX_TEST_ASSERT(array.size == 0, "size not initially zero"); |
universe@334 | 51 | UCX_TEST_ASSERT(array.capacity == 16, "capacity not as requested"); |
universe@334 | 52 | UCX_TEST_ASSERT(array.elemsize == 47, "element size not as requested"); |
universe@334 | 53 | UCX_TEST_ASSERT(array.allocator == ucx_default_allocator(), |
universe@334 | 54 | "array not using the default allocator"); |
universe@334 | 55 | UCX_TEST_END |
universe@334 | 56 | ucx_array_free(&array); |
universe@334 | 57 | } |
universe@334 | 58 | |
universe@334 | 59 | UCX_TEST(test_ucx_array_append) { |
universe@334 | 60 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@342 | 61 | int *elements; |
universe@334 | 62 | |
universe@334 | 63 | int x = 42; |
universe@334 | 64 | ucx_array_append(&array, &x); |
universe@33 | 65 | UCX_TEST_BEGIN |
universe@27 | 66 | |
universe@342 | 67 | elements = array.data; |
universe@342 | 68 | UCX_TEST_ASSERT(elements[0] == 42, "failed"); |
universe@27 | 69 | |
universe@334 | 70 | x = 13; |
universe@334 | 71 | ucx_array_append(&array, &x); |
universe@27 | 72 | |
universe@342 | 73 | elements = array.data; |
universe@334 | 74 | UCX_TEST_ASSERT(array.size == 2, "incorrect size after append"); |
universe@342 | 75 | UCX_TEST_ASSERT(elements[1] == 13, "failed"); |
universe@342 | 76 | UCX_TEST_ASSERT(elements[0] == 42, |
universe@334 | 77 | "append corrupted previously inserted data"); |
universe@334 | 78 | |
universe@334 | 79 | ucx_array_append(&array, NULL); |
universe@334 | 80 | |
universe@342 | 81 | elements = array.data; |
universe@334 | 82 | UCX_TEST_ASSERT(array.size == 3, "incorrect size after NULL append"); |
universe@342 | 83 | UCX_TEST_ASSERT(elements[2] == 0, "element is not zeroed"); |
universe@342 | 84 | UCX_TEST_ASSERT(elements[0] == 42, |
universe@334 | 85 | "NULL append corrupted previously inserted data"); |
universe@342 | 86 | UCX_TEST_ASSERT(elements[1] == 13, |
universe@334 | 87 | "NULL append corrupted previously inserted data"); |
universe@334 | 88 | |
universe@33 | 89 | UCX_TEST_END |
universe@27 | 90 | |
universe@334 | 91 | ucx_array_free(&array); |
universe@24 | 92 | } |
universe@24 | 93 | |
universe@334 | 94 | UCX_TEST(test_ucx_array_prepend) { |
universe@342 | 95 | int *elems; |
universe@334 | 96 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@334 | 97 | |
universe@334 | 98 | int x = 42; |
universe@334 | 99 | ucx_array_prepend(&array, &x); |
universe@33 | 100 | UCX_TEST_BEGIN |
universe@27 | 101 | |
universe@342 | 102 | elems = array.data; |
universe@342 | 103 | UCX_TEST_ASSERT(elems[0] == 42, "failed"); |
universe@334 | 104 | |
universe@334 | 105 | x = 13; |
universe@334 | 106 | ucx_array_prepend(&array, &x); |
universe@334 | 107 | |
universe@342 | 108 | elems = array.data; |
universe@334 | 109 | UCX_TEST_ASSERT(array.size == 2, "incorrect size after prepend"); |
universe@342 | 110 | UCX_TEST_ASSERT(elems[0] == 13, "failed"); |
universe@342 | 111 | UCX_TEST_ASSERT(elems[1] == 42, |
universe@334 | 112 | "prepend corrupted previously inserted data"); |
universe@334 | 113 | |
universe@334 | 114 | ucx_array_prepend(&array, NULL); |
universe@334 | 115 | |
universe@342 | 116 | elems = array.data; |
universe@334 | 117 | UCX_TEST_ASSERT(array.size == 3, "incorrect size after NULL prepend"); |
universe@342 | 118 | UCX_TEST_ASSERT(elems[0] == 0, "element is not zeroed"); |
universe@342 | 119 | UCX_TEST_ASSERT(elems[1] == 13, |
universe@334 | 120 | "NULL prepend corrupted previously inserted data"); |
universe@342 | 121 | UCX_TEST_ASSERT(elems[2] == 42, |
universe@334 | 122 | "NULL prepend corrupted previously inserted data"); |
universe@27 | 123 | |
universe@33 | 124 | UCX_TEST_END |
universe@334 | 125 | |
universe@334 | 126 | ucx_array_free(&array); |
universe@18 | 127 | } |
universe@18 | 128 | |
universe@337 | 129 | UCX_TEST(test_ucx_array_set) { |
universe@342 | 130 | int *elems; |
universe@337 | 131 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@337 | 132 | |
universe@342 | 133 | |
universe@337 | 134 | int x = 42; |
universe@337 | 135 | |
universe@337 | 136 | UCX_TEST_BEGIN |
universe@337 | 137 | |
universe@337 | 138 | ucx_array_set(&array, 7, &x); |
universe@342 | 139 | |
universe@342 | 140 | elems = array.data; |
universe@342 | 141 | UCX_TEST_ASSERT(elems[7] == 42, "failed"); |
universe@337 | 142 | UCX_TEST_ASSERT(array.size >= 8, "array not resized on set"); |
universe@337 | 143 | UCX_TEST_ASSERT(array.capacity == 16, "capacity changed unnecessarily"); |
universe@337 | 144 | |
universe@337 | 145 | x = 13; |
universe@337 | 146 | ucx_array_set(&array, 27, &x); |
universe@337 | 147 | |
universe@342 | 148 | elems = array.data; |
universe@342 | 149 | UCX_TEST_ASSERT(elems[27] == 13, "failed"); |
universe@337 | 150 | UCX_TEST_ASSERT(array.size == 28, "array not resized on set"); |
universe@337 | 151 | UCX_TEST_ASSERT(array.capacity == 28, "capacity not grown"); |
universe@337 | 152 | |
universe@337 | 153 | ucx_array_set(&array, 7, NULL); |
universe@337 | 154 | |
universe@342 | 155 | elems = array.data; |
universe@342 | 156 | UCX_TEST_ASSERT(elems[7] == 0, "not zeroed on NULL set"); |
universe@337 | 157 | |
universe@337 | 158 | UCX_TEST_END |
universe@337 | 159 | |
universe@337 | 160 | ucx_array_free(&array); |
universe@337 | 161 | } |
universe@337 | 162 | |
universe@334 | 163 | UCX_TEST(test_ucx_array_equals) { |
universe@334 | 164 | UcxArray a1 = ucx_array_new(16, sizeof(int)); |
universe@334 | 165 | UcxArray a2 = ucx_array_new(16, sizeof(int)); |
universe@334 | 166 | UcxArray a3 = ucx_array_new(16, sizeof(long int)); |
universe@334 | 167 | UcxArray a4 = ucx_array_new(16, sizeof(int)); |
universe@27 | 168 | |
universe@342 | 169 | int *intelems; |
universe@342 | 170 | long int *longintelems; |
universe@342 | 171 | |
universe@334 | 172 | a1.size = 5; |
universe@342 | 173 | intelems = a1.data; |
universe@342 | 174 | intelems[0] = 47; |
universe@342 | 175 | intelems[1] = 11; |
universe@342 | 176 | intelems[2] = 0; |
universe@342 | 177 | intelems[3] = 8; |
universe@342 | 178 | intelems[4] = 15; |
universe@334 | 179 | a2.size = 5; |
universe@342 | 180 | intelems = a2.data; |
universe@342 | 181 | intelems[0] = 47; |
universe@342 | 182 | intelems[1] = 11; |
universe@342 | 183 | intelems[2] = 0; |
universe@342 | 184 | intelems[3] = 8; |
universe@342 | 185 | intelems[4] = 15; |
universe@334 | 186 | a3.size = 5; |
universe@342 | 187 | longintelems = a3.data; |
universe@342 | 188 | longintelems[0] = 47; |
universe@342 | 189 | longintelems[1] = 11; |
universe@342 | 190 | longintelems[2] = 0; |
universe@342 | 191 | longintelems[3] = 8; |
universe@342 | 192 | longintelems[4] = 15; |
universe@334 | 193 | a4.size = 5; |
universe@342 | 194 | intelems = a4.data; |
universe@342 | 195 | intelems[0] = 47; |
universe@342 | 196 | intelems[1] = 11; |
universe@342 | 197 | intelems[2] = -6; |
universe@342 | 198 | intelems[3] = 8; |
universe@342 | 199 | intelems[4] = 15; |
universe@27 | 200 | |
universe@123 | 201 | UCX_TEST_BEGIN |
universe@123 | 202 | |
universe@336 | 203 | UCX_TEST_ASSERT(ucx_array_equals(a1, a2, ucx_cmp_int, NULL), "failed"); |
universe@336 | 204 | UCX_TEST_ASSERT(!ucx_array_equals(a1, a4, ucx_cmp_int, NULL), "failed"); |
universe@336 | 205 | UCX_TEST_ASSERT(!ucx_array_equals(a4, a1, ucx_cmp_int, NULL), "failed"); |
universe@336 | 206 | UCX_TEST_ASSERT(!ucx_array_equals(a1, a3, ucx_cmp_int, NULL), |
universe@336 | 207 | "comparing arrays of different element size shall fail"); |
universe@336 | 208 | UCX_TEST_ASSERT(!ucx_array_equals(a3, a1, ucx_cmp_int, NULL), |
universe@336 | 209 | "comparing arrays of different element size shall fail"); |
universe@334 | 210 | |
universe@336 | 211 | UCX_TEST_ASSERT(ucx_array_equals(a1, a2, NULL, NULL), |
universe@334 | 212 | "compare using memcmp() failed"); |
universe@336 | 213 | UCX_TEST_ASSERT(!ucx_array_equals(a1, a4, NULL, NULL), |
universe@334 | 214 | "compare using memcmp() failed"); |
universe@27 | 215 | |
universe@33 | 216 | UCX_TEST_END |
universe@334 | 217 | ucx_array_free(&a1); |
universe@334 | 218 | ucx_array_free(&a2); |
universe@334 | 219 | ucx_array_free(&a3); |
universe@334 | 220 | ucx_array_free(&a4); |
olaf@9 | 221 | } |
olaf@11 | 222 | |
universe@334 | 223 | UCX_TEST(test_ucx_array_concat) { |
universe@334 | 224 | UcxArray a1 = ucx_array_new(16, sizeof(int)); |
universe@334 | 225 | UcxArray a2 = ucx_array_new(16, sizeof(int)); |
universe@342 | 226 | int *elems; |
universe@334 | 227 | |
universe@334 | 228 | a1.size = 2; |
universe@342 | 229 | elems = a1.data; |
universe@342 | 230 | elems[0] = 47; |
universe@342 | 231 | elems[1] = 11; |
universe@334 | 232 | a2.size = 3; |
universe@342 | 233 | elems = a2.data; |
universe@342 | 234 | elems[0] = 0; |
universe@342 | 235 | elems[1] = 8; |
universe@342 | 236 | elems[2] = 15; |
universe@27 | 237 | |
universe@123 | 238 | UCX_TEST_BEGIN |
universe@123 | 239 | |
universe@334 | 240 | UCX_TEST_ASSERT(!ucx_array_concat(&a1, &a2), "failed"); |
universe@334 | 241 | UCX_TEST_ASSERT(a1.size == 5, "failed"); |
universe@342 | 242 | elems = a1.data; |
universe@342 | 243 | UCX_TEST_ASSERT(elems[0] == 47, "failed"); |
universe@342 | 244 | UCX_TEST_ASSERT(elems[1] == 11, "failed"); |
universe@342 | 245 | UCX_TEST_ASSERT(elems[2] == 0, "failed"); |
universe@342 | 246 | UCX_TEST_ASSERT(elems[3] == 8, "failed"); |
universe@342 | 247 | UCX_TEST_ASSERT(elems[4] == 15, "failed"); |
universe@27 | 248 | |
universe@334 | 249 | a1.elemsize *= 2; |
universe@334 | 250 | UCX_TEST_ASSERT(ucx_array_concat(&a1, &a2), |
universe@334 | 251 | "arrays of different element size must not be concatenated"); |
universe@334 | 252 | UCX_TEST_ASSERT(a1.size == 5, |
universe@334 | 253 | "arrays of different element size must not be concatenated"); |
universe@27 | 254 | |
universe@33 | 255 | UCX_TEST_END |
universe@334 | 256 | ucx_array_free(&a1); |
universe@334 | 257 | ucx_array_free(&a2); |
universe@27 | 258 | } |
universe@27 | 259 | |
universe@344 | 260 | UCX_TEST(test_ucx_array_at) { |
universe@344 | 261 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@344 | 262 | |
universe@344 | 263 | int x = 42; |
universe@344 | 264 | ucx_array_append(&array, &x); |
universe@344 | 265 | x = 13; |
universe@344 | 266 | ucx_array_append(&array, &x); |
universe@344 | 267 | x = 5; |
universe@344 | 268 | ucx_array_append(&array, &x); |
universe@344 | 269 | |
universe@344 | 270 | UCX_TEST_BEGIN |
universe@344 | 271 | |
universe@344 | 272 | UCX_TEST_ASSERT(*(int*)ucx_array_at(array, 1) == 13, "failed"); |
universe@344 | 273 | *(int*)ucx_array_at(array, 1) = 80; |
universe@344 | 274 | UCX_TEST_ASSERT(*(int*)ucx_array_at(array, 1) == 80, "assignment failed"); |
universe@344 | 275 | |
universe@344 | 276 | UCX_TEST_ASSERT(*(int*)ucx_array_at(array, 0) == 42, "corrupted data"); |
universe@344 | 277 | UCX_TEST_ASSERT(*(int*)ucx_array_at(array, 2) == 5, "corrupted data"); |
universe@344 | 278 | |
universe@344 | 279 | UCX_TEST_END |
universe@344 | 280 | |
universe@344 | 281 | ucx_array_free(&array); |
universe@344 | 282 | } |
universe@344 | 283 | |
universe@334 | 284 | UCX_TEST(test_ucx_array_find) { |
universe@334 | 285 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@342 | 286 | int *elems; |
universe@334 | 287 | |
universe@334 | 288 | array.size = 5; |
universe@342 | 289 | elems = array.data; |
universe@342 | 290 | elems[0] = 47; |
universe@342 | 291 | elems[1] = 11; |
universe@342 | 292 | elems[2] = 0; |
universe@342 | 293 | elems[3] = 8; |
universe@342 | 294 | elems[4] = 15; |
universe@334 | 295 | |
universe@334 | 296 | int x = 8; |
universe@334 | 297 | int y = 90; |
universe@27 | 298 | |
universe@123 | 299 | UCX_TEST_BEGIN |
universe@123 | 300 | |
universe@334 | 301 | UCX_TEST_ASSERT(ucx_array_find(array,(void*)&x,ucx_cmp_int,NULL) == 3, |
universe@334 | 302 | "doesn't find element"); |
universe@334 | 303 | UCX_TEST_ASSERT(ucx_array_find(array,(void*)&y,ucx_cmp_int,NULL) == 5, |
universe@334 | 304 | "finds non-existing element"); |
universe@27 | 305 | |
universe@334 | 306 | UCX_TEST_ASSERT(ucx_array_find(array,(void*)&x,NULL,NULL) == 3, |
universe@334 | 307 | "failed using memcmp()"); |
universe@334 | 308 | UCX_TEST_ASSERT(ucx_array_find(array,(void*)&y,NULL,NULL) == 5, |
universe@334 | 309 | "failed using memcmp()"); |
universe@27 | 310 | |
universe@33 | 311 | UCX_TEST_END |
universe@334 | 312 | ucx_array_free(&array); |
universe@27 | 313 | } |
universe@27 | 314 | |
universe@334 | 315 | UCX_TEST(test_ucx_array_contains) { |
universe@334 | 316 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@342 | 317 | int *elems; |
universe@334 | 318 | |
universe@334 | 319 | array.size = 5; |
universe@342 | 320 | elems = array.data; |
universe@342 | 321 | elems[0] = 47; |
universe@342 | 322 | elems[1] = 11; |
universe@342 | 323 | elems[2] = 0; |
universe@342 | 324 | elems[3] = 8; |
universe@342 | 325 | elems[4] = 15; |
universe@334 | 326 | |
universe@334 | 327 | int x = 8; |
universe@334 | 328 | int y = 90; |
universe@123 | 329 | |
universe@123 | 330 | UCX_TEST_BEGIN |
universe@123 | 331 | |
universe@334 | 332 | UCX_TEST_ASSERT(ucx_array_contains(array,(void*)&x,ucx_cmp_int,NULL), |
universe@334 | 333 | "false negative"); |
universe@334 | 334 | UCX_TEST_ASSERT(!ucx_array_contains(array,(void*)&y,ucx_cmp_int,NULL), |
universe@334 | 335 | "false positive"); |
universe@123 | 336 | |
universe@334 | 337 | UCX_TEST_ASSERT(ucx_array_contains(array,(void*)&x,NULL,NULL), |
universe@334 | 338 | "false negative using memcmp()"); |
universe@334 | 339 | UCX_TEST_ASSERT(!ucx_array_contains(array,(void*)&y,NULL,NULL), |
universe@334 | 340 | "false positive using memcmp()"); |
universe@123 | 341 | |
universe@123 | 342 | UCX_TEST_END |
universe@334 | 343 | ucx_array_free(&array); |
universe@123 | 344 | } |
universe@123 | 345 | |
universe@334 | 346 | UCX_TEST(test_ucx_array_remove) { |
universe@334 | 347 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@342 | 348 | int *elems; |
universe@334 | 349 | |
universe@334 | 350 | array.size = 5; |
universe@342 | 351 | elems = array.data; |
universe@342 | 352 | elems[0] = 47; |
universe@342 | 353 | elems[1] = 11; |
universe@342 | 354 | elems[2] = 0; |
universe@342 | 355 | elems[3] = 8; |
universe@342 | 356 | elems[4] = 15; |
universe@334 | 357 | |
universe@334 | 358 | UCX_TEST_BEGIN |
universe@334 | 359 | |
universe@334 | 360 | ucx_array_remove(&array, 2); |
universe@342 | 361 | elems = array.data; |
universe@334 | 362 | UCX_TEST_ASSERT( |
universe@342 | 363 | elems[0] == 47 && |
universe@342 | 364 | elems[1] == 11 && |
universe@342 | 365 | elems[2] == 8 && |
universe@342 | 366 | elems[3] == 15, |
universe@334 | 367 | "wrong contents after remove"); |
universe@334 | 368 | UCX_TEST_ASSERT(array.size == 4, "wrong size after remove"); |
universe@334 | 369 | |
universe@334 | 370 | ucx_array_remove_fast(&array, 1); |
universe@342 | 371 | elems = array.data; |
universe@334 | 372 | UCX_TEST_ASSERT( |
universe@342 | 373 | elems[0] == 47 && |
universe@342 | 374 | elems[1] == 15 && |
universe@342 | 375 | elems[2] == 8, |
universe@334 | 376 | "wrong contents after fast remove"); |
universe@334 | 377 | UCX_TEST_ASSERT(array.size == 3, "wrong size after fast remove"); |
universe@334 | 378 | |
universe@334 | 379 | UCX_TEST_END |
universe@334 | 380 | ucx_array_free(&array); |
universe@334 | 381 | } |
universe@334 | 382 | |
universe@334 | 383 | UCX_TEST(test_ucx_array_clone) { |
universe@334 | 384 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@342 | 385 | int *elems; |
universe@334 | 386 | |
universe@334 | 387 | array.size = 5; |
universe@342 | 388 | elems = array.data; |
universe@342 | 389 | elems[0] = 47; |
universe@342 | 390 | elems[1] = 11; |
universe@342 | 391 | elems[2] = 0; |
universe@342 | 392 | elems[3] = 8; |
universe@342 | 393 | elems[4] = 15; |
universe@334 | 394 | |
universe@334 | 395 | UcxArray copy = ucx_array_clone(array); |
universe@334 | 396 | UCX_TEST_BEGIN |
universe@334 | 397 | |
universe@334 | 398 | UCX_TEST_ASSERT(array.data != copy.data, "no true copy"); |
universe@334 | 399 | UCX_TEST_ASSERT(array.size == copy.size, "size mismatch"); |
universe@334 | 400 | UCX_TEST_ASSERT(array.capacity == copy.capacity, "capacity mismatch"); |
universe@334 | 401 | UCX_TEST_ASSERT(array.elemsize == copy.elemsize, "element size mismatch"); |
universe@334 | 402 | UCX_TEST_ASSERT(array.allocator == copy.allocator, "allocator mismatch"); |
universe@336 | 403 | UCX_TEST_ASSERT(ucx_array_equals(array, copy, ucx_cmp_int, NULL), "failed"); |
universe@334 | 404 | |
universe@334 | 405 | UCX_TEST_END |
universe@334 | 406 | |
universe@334 | 407 | ucx_array_free(&array); |
universe@334 | 408 | ucx_array_free(©); |
universe@334 | 409 | } |
universe@334 | 410 | |
universe@342 | 411 | static int ucx_cmp_int_reverse(const void* x, const void* y, void* data) { |
universe@342 | 412 | return -ucx_cmp_int(x,y,data); |
universe@342 | 413 | } |
universe@342 | 414 | |
universe@334 | 415 | UCX_TEST(test_ucx_array_sort) { |
universe@342 | 416 | int *elems; |
universe@342 | 417 | |
universe@342 | 418 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@334 | 419 | array.size = 5; |
universe@342 | 420 | elems = array.data; |
universe@342 | 421 | elems[0] = 47; |
universe@342 | 422 | elems[1] = 11; |
universe@342 | 423 | elems[2] = 0; |
universe@342 | 424 | elems[3] = 8; |
universe@342 | 425 | elems[4] = 15; |
universe@334 | 426 | |
universe@334 | 427 | UcxArray expected = ucx_array_new(16, sizeof(int)); |
universe@334 | 428 | expected.size = 5; |
universe@342 | 429 | elems = expected.data; |
universe@342 | 430 | elems[0] = 0; |
universe@342 | 431 | elems[1] = 8; |
universe@342 | 432 | elems[2] = 11; |
universe@342 | 433 | elems[3] = 15; |
universe@342 | 434 | elems[4] = 47; |
universe@342 | 435 | |
universe@342 | 436 | UcxArray expectedrev = ucx_array_new(16, sizeof(int)); |
universe@342 | 437 | expectedrev.size = 5; |
universe@342 | 438 | elems = expectedrev.data; |
universe@342 | 439 | elems[0] = 47; |
universe@342 | 440 | elems[1] = 15; |
universe@342 | 441 | elems[2] = 11; |
universe@342 | 442 | elems[3] = 8; |
universe@342 | 443 | elems[4] = 0; |
universe@334 | 444 | |
universe@334 | 445 | |
universe@334 | 446 | UCX_TEST_BEGIN |
universe@334 | 447 | void* original_ptr = array.data; |
universe@336 | 448 | ucx_array_sort(array, ucx_cmp_int, NULL); |
universe@336 | 449 | UCX_TEST_ASSERT(ucx_array_equals(array, expected, NULL, NULL), "failed"); |
universe@334 | 450 | UCX_TEST_ASSERT(array.size == 5, "size corrupted"); |
universe@334 | 451 | UCX_TEST_ASSERT(array.data == original_ptr, "shall not reallocate"); |
universe@342 | 452 | |
universe@342 | 453 | ucx_array_sort(array, ucx_cmp_int_reverse, NULL); |
universe@342 | 454 | UCX_TEST_ASSERT(ucx_array_equals(array, expectedrev, NULL, NULL), "failed"); |
universe@342 | 455 | |
universe@336 | 456 | ucx_array_reserve(&array, 32); |
universe@336 | 457 | ucx_array_reserve(&expected, 32); |
universe@336 | 458 | array.size = expected.size = 32; |
universe@336 | 459 | for (size_t i = 0 ; i < 32 ; i++) { |
universe@342 | 460 | ((int*)array.data)[i]= ((i%2==0)?-1:1) * ((int) i); |
universe@342 | 461 | ((int*)expected.data)[i] = (-30+2*i) - (i > 15 ? 1 : 0); |
universe@336 | 462 | } |
universe@336 | 463 | |
universe@342 | 464 | /* dummy third argument to trigger a possible fallback for qsort_s */ |
universe@342 | 465 | ucx_array_sort(array, ucx_cmp_int, array.data); |
universe@336 | 466 | UCX_TEST_ASSERT(ucx_array_equals(array, expected, NULL, NULL), |
universe@336 | 467 | "failed for bigger arrays"); |
universe@334 | 468 | UCX_TEST_END |
universe@334 | 469 | |
universe@334 | 470 | ucx_array_free(&expected); |
universe@334 | 471 | ucx_array_free(&array); |
universe@334 | 472 | } |
universe@334 | 473 | |
universe@334 | 474 | UCX_TEST(test_ucx_array_autogrow) { |
universe@342 | 475 | int *elems; |
universe@334 | 476 | UcxArray array = ucx_array_new(4, sizeof(int)); |
universe@334 | 477 | array.size = 3; |
universe@342 | 478 | elems = array.data; |
universe@342 | 479 | elems[0] = 47; |
universe@342 | 480 | elems[1] = 11; |
universe@334 | 481 | int x = 5; |
universe@123 | 482 | |
universe@123 | 483 | UCX_TEST_BEGIN |
universe@334 | 484 | |
universe@334 | 485 | void* oldptr = array.data; |
universe@123 | 486 | |
universe@334 | 487 | ucx_array_append(&array, &x); |
universe@334 | 488 | UCX_TEST_ASSERT(array.capacity == 4 && array.data == oldptr, |
universe@334 | 489 | "array should not grow too early"); |
universe@334 | 490 | ucx_array_append(&array, &x); |
universe@342 | 491 | elems = array.data; |
universe@334 | 492 | UCX_TEST_ASSERT(array.capacity == 8, "array did not grow"); |
universe@334 | 493 | UCX_TEST_ASSERT(array.size == 5, "incorrect size after grow"); |
universe@342 | 494 | UCX_TEST_ASSERT(elems[3] == 5 && elems[4] == 5, "corrupt data"); |
universe@172 | 495 | |
universe@123 | 496 | UCX_TEST_END |
universe@334 | 497 | ucx_array_free(&array); |
universe@123 | 498 | } |
universe@123 | 499 | |
universe@334 | 500 | UCX_TEST(test_ucx_array_shrink) { |
universe@334 | 501 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@334 | 502 | array.size = 4; |
universe@90 | 503 | |
universe@123 | 504 | UCX_TEST_BEGIN |
universe@334 | 505 | UCX_TEST_ASSERT(!ucx_array_shrink(&array), "failed"); |
universe@334 | 506 | UCX_TEST_ASSERT(array.capacity == 4, "incorrect capacity after shrink"); |
universe@334 | 507 | UCX_TEST_END |
universe@334 | 508 | ucx_array_free(&array); |
universe@334 | 509 | } |
universe@334 | 510 | |
universe@334 | 511 | UCX_TEST(test_ucx_array_resize) { |
universe@334 | 512 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@334 | 513 | array.size = 8; |
universe@123 | 514 | |
universe@334 | 515 | UCX_TEST_BEGIN |
universe@334 | 516 | |
universe@334 | 517 | UCX_TEST_ASSERT(!ucx_array_resize(&array, 32), "failed"); |
universe@334 | 518 | UCX_TEST_ASSERT(array.capacity == 32, "incorrect capacity after resize"); |
universe@334 | 519 | UCX_TEST_ASSERT(array.size == 8, "incorrect size after resize"); |
universe@334 | 520 | |
universe@334 | 521 | UCX_TEST_ASSERT(!ucx_array_resize(&array, 4), "failed"); |
universe@334 | 522 | UCX_TEST_ASSERT(array.capacity == 4, "incorrect capacity after resize"); |
universe@334 | 523 | UCX_TEST_ASSERT(array.size == 4, "incorrect size after resize"); |
universe@90 | 524 | |
universe@90 | 525 | UCX_TEST_END |
universe@334 | 526 | ucx_array_free(&array); |
universe@90 | 527 | } |
universe@90 | 528 | |
universe@334 | 529 | UCX_TEST(test_ucx_array_reserve) { |
universe@334 | 530 | UcxArray array = ucx_array_new(16, sizeof(int)); |
universe@27 | 531 | |
universe@123 | 532 | UCX_TEST_BEGIN |
universe@334 | 533 | |
universe@334 | 534 | UCX_TEST_ASSERT(!ucx_array_reserve(&array, 4), "failed"); |
universe@334 | 535 | UCX_TEST_ASSERT(array.capacity == 16, "reserve shall not shrink"); |
universe@334 | 536 | |
universe@334 | 537 | UCX_TEST_ASSERT(!ucx_array_resize(&array, 32), "failed"); |
universe@334 | 538 | UCX_TEST_ASSERT(array.capacity == 32, "incorrect capacity after reserve"); |
olaf@162 | 539 | |
universe@33 | 540 | UCX_TEST_END |
universe@334 | 541 | ucx_array_free(&array); |
universe@27 | 542 | } |