Thu, 23 May 2024 20:31:37 +0200
fix inconsistent use of item_size and elem_size
universe@850 | 1 | /* |
universe@850 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@850 | 3 | * |
universe@850 | 4 | * Copyright 2024 Mike Becker, Olaf Wintermann All rights reserved. |
universe@850 | 5 | * |
universe@850 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@850 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@850 | 8 | * |
universe@850 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@850 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@850 | 11 | * |
universe@850 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@850 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@850 | 14 | * documentation and/or other materials provided with the distribution. |
universe@850 | 15 | * |
universe@850 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@850 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@850 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@850 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@850 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@850 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@850 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@850 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@850 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@850 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@850 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@850 | 27 | */ |
universe@850 | 28 | |
universe@850 | 29 | #include "cx/test.h" |
universe@850 | 30 | |
universe@850 | 31 | #include "cx/iterator.h" |
universe@850 | 32 | |
universe@850 | 33 | CX_TEST(test_iterator_create) { |
universe@850 | 34 | size_t size = 20; |
universe@850 | 35 | unsigned array[size]; |
universe@850 | 36 | for (unsigned i = 0 ; i < size ; i++) array[i] = i; |
universe@850 | 37 | |
universe@851 | 38 | CxIterator iter = cxIterator(array, sizeof(unsigned), size); |
universe@850 | 39 | CX_TEST_DO { |
universe@850 | 40 | CX_TEST_ASSERT(iter.index == 0); |
universe@850 | 41 | CX_TEST_ASSERT(iter.elem_size == sizeof(unsigned)); |
universe@850 | 42 | CX_TEST_ASSERT(iter.elem_count == size); |
universe@853 | 43 | CX_TEST_ASSERT(iter.src_handle.c == array); |
universe@850 | 44 | CX_TEST_ASSERT(iter.elem_handle == &array[0]); |
universe@850 | 45 | CX_TEST_ASSERT(cxIteratorValid(iter)); |
universe@850 | 46 | } |
universe@850 | 47 | } |
universe@850 | 48 | |
universe@850 | 49 | CX_TEST(test_iterator_create_null) { |
universe@851 | 50 | CxIterator iter = cxIterator(NULL, sizeof(unsigned), 47); |
universe@850 | 51 | CX_TEST_DO { |
universe@850 | 52 | CX_TEST_ASSERT(iter.index == 0); |
universe@850 | 53 | CX_TEST_ASSERT(iter.elem_size == sizeof(unsigned)); |
universe@850 | 54 | CX_TEST_ASSERT(iter.elem_count == 0); |
universe@853 | 55 | CX_TEST_ASSERT(iter.src_handle.c == NULL); |
universe@850 | 56 | CX_TEST_ASSERT(iter.elem_handle == NULL); |
universe@850 | 57 | CX_TEST_ASSERT(!cxIteratorValid(iter)); |
universe@850 | 58 | } |
universe@850 | 59 | } |
universe@850 | 60 | |
universe@850 | 61 | CX_TEST(test_iterator_iterate) { |
universe@850 | 62 | size_t size = 20; |
universe@850 | 63 | unsigned array[size]; |
universe@850 | 64 | for (unsigned i = 0 ; i < size ; i++) array[i] = i; |
universe@850 | 65 | |
universe@851 | 66 | CxIterator iter = cxIterator(array, sizeof(unsigned), size); |
universe@850 | 67 | CX_TEST_DO { |
universe@850 | 68 | unsigned expected = 0; |
universe@850 | 69 | cx_foreach(unsigned *, e, iter) { |
universe@850 | 70 | CX_TEST_ASSERT(iter.index == expected); |
universe@850 | 71 | CX_TEST_ASSERT(*e == expected); |
universe@850 | 72 | CX_TEST_ASSERT(iter.elem_size == sizeof(unsigned)); |
universe@850 | 73 | CX_TEST_ASSERT(iter.elem_count == size); |
universe@853 | 74 | CX_TEST_ASSERT(iter.src_handle.c == array); |
universe@850 | 75 | CX_TEST_ASSERT(iter.elem_handle == &array[expected]); |
universe@850 | 76 | expected++; |
universe@850 | 77 | } |
universe@850 | 78 | CX_TEST_ASSERT(expected == size); |
universe@850 | 79 | } |
universe@850 | 80 | } |
universe@850 | 81 | |
universe@850 | 82 | CX_TEST(test_iterator_with_slow_remove) { |
universe@850 | 83 | size_t size = 20; |
universe@850 | 84 | unsigned array[size]; |
universe@850 | 85 | for (unsigned i = 0 ; i < size ; i++) array[i] = i; |
universe@850 | 86 | |
universe@850 | 87 | size_t elem_counts[] = { |
universe@850 | 88 | 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, |
universe@850 | 89 | 15, 15, 14, 14, 13, 13, 12, 12, 11, 11 |
universe@850 | 90 | }; |
universe@850 | 91 | size_t indices[] = { |
universe@850 | 92 | 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, |
universe@850 | 93 | 6, 6, 7, 7, 8, 8, 9, 9, 10 |
universe@850 | 94 | }; |
universe@850 | 95 | unsigned expected_result[] = { |
universe@850 | 96 | 0, 2, 4, 6, 8, 10, 12, 14, 16, 18 |
universe@850 | 97 | }; |
universe@850 | 98 | |
universe@853 | 99 | CxIterator iter = cxMutIterator(array, sizeof(unsigned), size, true); |
universe@850 | 100 | CX_TEST_DO { |
universe@850 | 101 | unsigned expected = 0; |
universe@850 | 102 | cx_foreach(unsigned *, e, iter) { |
universe@850 | 103 | CX_TEST_ASSERT(*e == expected); |
universe@850 | 104 | CX_TEST_ASSERT(iter.index == indices[expected]); |
universe@850 | 105 | CX_TEST_ASSERT(iter.elem_size == sizeof(unsigned)); |
universe@850 | 106 | CX_TEST_ASSERT(iter.elem_count == elem_counts[expected]); |
universe@853 | 107 | CX_TEST_ASSERT(iter.src_handle.m == array); |
universe@850 | 108 | CX_TEST_ASSERT(iter.elem_handle == &array[indices[expected]]); |
universe@850 | 109 | expected++; |
universe@850 | 110 | if (expected % 2 == 0) { |
universe@850 | 111 | cxIteratorFlagRemoval(iter); |
universe@850 | 112 | } |
universe@850 | 113 | } |
universe@850 | 114 | CX_TEST_ASSERT(expected == 20); |
universe@850 | 115 | CX_TEST_ASSERT(iter.index == 10); |
universe@850 | 116 | CX_TEST_ASSERT(iter.elem_count == 10); |
universe@850 | 117 | for (unsigned i = 0 ; i < 9 ; i++) { |
universe@850 | 118 | CX_TEST_ASSERT(array[i] == expected_result[i]); |
universe@850 | 119 | } |
universe@850 | 120 | } |
universe@850 | 121 | } |
universe@850 | 122 | |
universe@850 | 123 | CX_TEST(test_iterator_with_fast_remove) { |
universe@850 | 124 | size_t size = 20; |
universe@850 | 125 | unsigned array[size]; |
universe@850 | 126 | for (unsigned i = 0 ; i < size ; i++) array[i] = i; |
universe@850 | 127 | |
universe@850 | 128 | size_t elem_counts[] = { |
universe@850 | 129 | 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, |
universe@850 | 130 | 15, 15, 14, 14, 13, 13, 12, 12, 11, 11 |
universe@850 | 131 | }; |
universe@850 | 132 | size_t indices[] = { |
universe@850 | 133 | 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, |
universe@850 | 134 | 6, 6, 7, 7, 8, 8, 9, 9, 10 |
universe@850 | 135 | }; |
universe@850 | 136 | unsigned expected_result[] = { |
universe@850 | 137 | 0, 19, 18, 17, 16, 15, 14, 13, 12, 11 |
universe@850 | 138 | }; |
universe@850 | 139 | unsigned expected_visits[] = { |
universe@850 | 140 | 0, 1, 19, 2, 18, 3, 17, 4, 16, 5, |
universe@850 | 141 | 15, 6, 14, 7, 13, 8, 12, 9, 11, 10 |
universe@850 | 142 | }; |
universe@850 | 143 | |
universe@853 | 144 | CxIterator iter = cxMutIterator(array, sizeof(unsigned), size, false); |
universe@850 | 145 | CX_TEST_DO { |
universe@850 | 146 | unsigned expected = 0; |
universe@850 | 147 | cx_foreach(unsigned *, e, iter) { |
universe@850 | 148 | CX_TEST_ASSERT(*e == expected_visits[expected]); |
universe@850 | 149 | CX_TEST_ASSERT(iter.index == indices[expected]); |
universe@850 | 150 | CX_TEST_ASSERT(iter.elem_size == sizeof(unsigned)); |
universe@850 | 151 | CX_TEST_ASSERT(iter.elem_count == elem_counts[expected]); |
universe@853 | 152 | CX_TEST_ASSERT(iter.src_handle.m == array); |
universe@850 | 153 | CX_TEST_ASSERT(iter.elem_handle == &array[indices[expected]]); |
universe@850 | 154 | expected++; |
universe@850 | 155 | if (expected % 2 == 0) { |
universe@850 | 156 | cxIteratorFlagRemoval(iter); |
universe@850 | 157 | } |
universe@850 | 158 | } |
universe@850 | 159 | CX_TEST_ASSERT(expected == 20); |
universe@850 | 160 | CX_TEST_ASSERT(iter.index == 10); |
universe@850 | 161 | CX_TEST_ASSERT(iter.elem_count == 10); |
universe@850 | 162 | for (unsigned i = 0 ; i < 9 ; i++) { |
universe@850 | 163 | CX_TEST_ASSERT(array[i] == expected_result[i]); |
universe@850 | 164 | } |
universe@850 | 165 | } |
universe@850 | 166 | } |
universe@850 | 167 | |
universe@850 | 168 | CxTestSuite *cx_test_suite_iterator(void) { |
universe@850 | 169 | CxTestSuite *suite = cx_test_suite_new("iterator"); |
universe@850 | 170 | |
universe@850 | 171 | cx_test_register(suite, test_iterator_create); |
universe@850 | 172 | cx_test_register(suite, test_iterator_iterate); |
universe@850 | 173 | cx_test_register(suite, test_iterator_with_slow_remove); |
universe@850 | 174 | cx_test_register(suite, test_iterator_with_fast_remove); |
universe@850 | 175 | |
universe@850 | 176 | return suite; |
universe@850 | 177 | } |
universe@850 | 178 |