|
| 1 | + |
| 2 | +#include <thrust/distance.h> |
| 3 | +#include <thrust/iterator/offset_iterator.h> |
| 4 | + |
| 5 | +#include <cuda/std/iterator> |
| 6 | + |
| 7 | +#include <unittest/unittest.h> |
| 8 | + |
| 9 | +// ensure that we properly support thrust::counting_iterator from cuda::std |
| 10 | +void TestOffsetIteratorTraits() |
| 11 | +{ |
| 12 | + using base_it = thrust::host_vector<int>::iterator; |
| 13 | + using it = thrust::offset_iterator<base_it>; |
| 14 | + using traits = cuda::std::iterator_traits<it>; |
| 15 | + using vec_traits = cuda::std::iterator_traits<base_it>; |
| 16 | + |
| 17 | + static_assert(cuda::std::is_same_v<traits::difference_type, vec_traits::difference_type>); |
| 18 | + static_assert(cuda::std::is_same_v<traits::value_type, vec_traits::value_type>); |
| 19 | + static_assert(cuda::std::is_same_v<traits::pointer, vec_traits::pointer>); |
| 20 | + static_assert(cuda::std::is_same_v<traits::reference, vec_traits::reference>); |
| 21 | + static_assert(cuda::std::is_same_v<traits::iterator_category, vec_traits::iterator_category>); |
| 22 | + |
| 23 | + static_assert(cuda::std::is_same_v<thrust::iterator_traversal_t<it>, thrust::random_access_traversal_tag>); |
| 24 | + |
| 25 | + static_assert(cuda::std::__is_cpp17_random_access_iterator<it>::value); |
| 26 | + |
| 27 | + static_assert(cuda::std::output_iterator<it, int>); |
| 28 | + static_assert(cuda::std::input_iterator<it>); |
| 29 | + static_assert(cuda::std::forward_iterator<it>); |
| 30 | + static_assert(cuda::std::bidirectional_iterator<it>); |
| 31 | + static_assert(cuda::std::random_access_iterator<it>); |
| 32 | + static_assert(!cuda::std::contiguous_iterator<it>); |
| 33 | +} |
| 34 | +DECLARE_UNITTEST(TestOffsetIteratorTraits); |
| 35 | + |
| 36 | +template <typename Vector> |
| 37 | +void TestOffsetConstructor() |
| 38 | +{ |
| 39 | + thrust::offset_iterator<int*> iter0; |
| 40 | + ASSERT_EQUAL(iter0.base(), static_cast<int*>(nullptr)); |
| 41 | + ASSERT_EQUAL(iter0.offset(), 0); |
| 42 | + |
| 43 | + Vector v{42, 43}; |
| 44 | + thrust::offset_iterator iter1(v.begin()); |
| 45 | + ASSERT_EQUAL_QUIET(iter1.base(), v.begin()); |
| 46 | + ASSERT_EQUAL(iter1.offset(), 0); |
| 47 | + ASSERT_EQUAL(*iter1, 42); |
| 48 | + |
| 49 | + thrust::offset_iterator iter2(v.begin(), 1); |
| 50 | + ASSERT_EQUAL_QUIET(iter2.base(), v.begin()); |
| 51 | + ASSERT_EQUAL(iter2.offset(), 1); |
| 52 | + ASSERT_EQUAL(*iter2, 43); |
| 53 | + |
| 54 | + ptrdiff_t offset = 1; |
| 55 | + thrust::offset_iterator iter3(v.begin(), &offset); |
| 56 | + ASSERT_EQUAL_QUIET(iter3.base(), v.begin()); |
| 57 | + ASSERT_EQUAL(iter3.offset(), &offset); |
| 58 | + ASSERT_EQUAL(*iter3.offset(), 1); |
| 59 | + ASSERT_EQUAL(*iter3, 43); |
| 60 | +} |
| 61 | +DECLARE_VECTOR_UNITTEST(TestOffsetConstructor); |
| 62 | + |
| 63 | +template <typename Vector> |
| 64 | +void TestOffsetIteratorCopyConstructorAndAssignment() |
| 65 | +{ |
| 66 | + Vector v{42, 43}; |
| 67 | + |
| 68 | + // value offset |
| 69 | + { |
| 70 | + thrust::offset_iterator iter0(v.begin()); |
| 71 | +#if _CCCL_COMPILER(MSVC) // MSVC cannot deduce the template arguments from the copy ctor |
| 72 | + decltype(iter0) iter1(iter0); |
| 73 | +#else // _CCCL_COMPILER(MSVC) |
| 74 | + thrust::offset_iterator iter1(iter0); |
| 75 | +#endif // _CCCL_COMPILER(MSVC) |
| 76 | + ASSERT_EQUAL(iter0 == iter1, true); |
| 77 | + ASSERT_EQUAL(*iter0 == *iter1, true); |
| 78 | + |
| 79 | + thrust::offset_iterator iter2(v.begin() + 1); |
| 80 | + ASSERT_EQUAL(iter0 != iter2, true); |
| 81 | + ASSERT_EQUAL(*iter0 != *iter2, true); |
| 82 | + |
| 83 | + iter2 = iter0; |
| 84 | + ASSERT_EQUAL(iter0 == iter2, true); |
| 85 | + ASSERT_EQUAL(*iter0 == *iter2, true); |
| 86 | + } |
| 87 | + |
| 88 | + // indirect offset |
| 89 | + { |
| 90 | + const typename Vector::iterator::difference_type offset = 0; |
| 91 | + thrust::offset_iterator iter0(v.begin(), &offset); |
| 92 | + |
| 93 | +#if _CCCL_COMPILER(MSVC) // MSVC cannot deduce the template arguments from the copy ctor |
| 94 | + decltype(iter0) iter1(iter0); |
| 95 | +#else // _CCCL_COMPILER(MSVC) |
| 96 | + thrust::offset_iterator iter1(iter0); |
| 97 | +#endif // _CCCL_COMPILER(MSVC) |
| 98 | + ASSERT_EQUAL(iter0 == iter1, true); |
| 99 | + ASSERT_EQUAL(*iter0 == *iter1, true); |
| 100 | + |
| 101 | + thrust::offset_iterator iter2(v.begin() + 1, &offset); |
| 102 | + ASSERT_EQUAL(iter0 != iter2, true); |
| 103 | + ASSERT_EQUAL(*iter0 != *iter2, true); |
| 104 | + |
| 105 | + iter2 = iter0; |
| 106 | + ASSERT_EQUAL(iter0 == iter2, true); |
| 107 | + ASSERT_EQUAL(*iter0 == *iter2, true); |
| 108 | + } |
| 109 | +} |
| 110 | +DECLARE_VECTOR_UNITTEST(TestOffsetIteratorCopyConstructorAndAssignment); |
| 111 | + |
| 112 | +template <typename Vector> |
| 113 | +void TestOffsetIteratorIncrement() |
| 114 | +{ |
| 115 | + auto test = [](auto iter) { |
| 116 | + ASSERT_EQUAL(*iter, 0); |
| 117 | + iter++; |
| 118 | + ASSERT_EQUAL(*iter, 1); |
| 119 | + iter++; |
| 120 | + iter++; |
| 121 | + ASSERT_EQUAL(*iter, 3); |
| 122 | + iter += 5; |
| 123 | + ASSERT_EQUAL(*iter, 8); |
| 124 | + iter -= 10; |
| 125 | + ASSERT_EQUAL(*iter, -2); |
| 126 | + }; |
| 127 | + |
| 128 | + const Vector v{-2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8}; |
| 129 | + test(thrust::offset_iterator(v.begin() + 1, 1)); |
| 130 | + const typename Vector::iterator::difference_type offset = 1; |
| 131 | + test(thrust::offset_iterator(v.begin() + 1, &offset)); |
| 132 | +} |
| 133 | +DECLARE_VECTOR_UNITTEST(TestOffsetIteratorIncrement); |
| 134 | + |
| 135 | +template <typename Vector> |
| 136 | +void TestOffsetIteratorMutation() |
| 137 | +{ |
| 138 | + { |
| 139 | + Vector v{-2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8}; |
| 140 | + thrust::offset_iterator it(v.begin() + 1, 1); |
| 141 | + *it = 42; |
| 142 | + ++it; |
| 143 | + *it = 43; |
| 144 | + ++it.offset(); |
| 145 | + *it = 44; |
| 146 | + ASSERT_EQUAL(v, (Vector{-2, -1, 42, 43, 44, 3, 4, 5, 6, 7, 8})); |
| 147 | + } |
| 148 | + { |
| 149 | + Vector v{-2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8}; |
| 150 | + typename Vector::iterator::difference_type offset = 1; |
| 151 | + thrust::offset_iterator it(v.begin() + 1, &offset); |
| 152 | + *it = 42; |
| 153 | + ++it; |
| 154 | + *it = 43; |
| 155 | + offset = 2; |
| 156 | + *it = 44; |
| 157 | + ASSERT_EQUAL(v, (Vector{-2, -1, 42, 43, 44, 3, 4, 5, 6, 7, 8})); |
| 158 | + } |
| 159 | +} |
| 160 | +DECLARE_VECTOR_UNITTEST(TestOffsetIteratorMutation); |
| 161 | + |
| 162 | +template <typename Vector> |
| 163 | +void TestOffsetIteratorComparisonAndDistance() |
| 164 | +{ |
| 165 | + auto test = [](auto iter1, auto iter2) { |
| 166 | + ASSERT_EQUAL(iter1 == iter2, true); |
| 167 | + ASSERT_EQUAL(iter1 - iter2, 0); |
| 168 | + ASSERT_EQUAL(thrust::distance(iter1, iter2), 0); |
| 169 | + |
| 170 | + iter1++; |
| 171 | + ASSERT_EQUAL(iter1 == iter2, false); |
| 172 | + ASSERT_EQUAL(iter1 - iter2, 1); |
| 173 | + ASSERT_EQUAL(thrust::distance(iter1, iter2), -1); |
| 174 | + |
| 175 | + iter2++; |
| 176 | + ASSERT_EQUAL(iter1 == iter2, true); |
| 177 | + ASSERT_EQUAL(iter1 - iter2, 0); |
| 178 | + ASSERT_EQUAL(thrust::distance(iter1, iter2), 0); |
| 179 | + |
| 180 | + iter1 += 100; |
| 181 | + iter2 += 100; |
| 182 | + ASSERT_EQUAL(iter1 == iter2, true); |
| 183 | + ASSERT_EQUAL(iter1 - iter2, 0); |
| 184 | + ASSERT_EQUAL(thrust::distance(iter1, iter2), 0); |
| 185 | + |
| 186 | + iter1 -= 5; |
| 187 | + ASSERT_EQUAL(iter1 == iter2, false); |
| 188 | + ASSERT_EQUAL(iter1 - iter2, -5); |
| 189 | + ASSERT_EQUAL(thrust::distance(iter1, iter2), 5); |
| 190 | + }; |
| 191 | + |
| 192 | + Vector v(101); |
| 193 | + test(thrust::offset_iterator(v.begin()), thrust::offset_iterator(v.begin())); |
| 194 | + const typename Vector::iterator::difference_type offset = 0; |
| 195 | + test(thrust::offset_iterator(v.begin(), &offset), thrust::offset_iterator(v.begin(), &offset)); |
| 196 | +} |
| 197 | +DECLARE_VECTOR_UNITTEST(TestOffsetIteratorComparisonAndDistance); |
| 198 | + |
| 199 | +template <typename Vector> |
| 200 | +void TestOffsetIteratorLateValue() |
| 201 | +{ |
| 202 | + typename Vector::difference_type offset; |
| 203 | + Vector v{0, 1, 2, 3, 4, 5, 6, 7, 8}; |
| 204 | + thrust::offset_iterator iter(v.begin(), &offset); |
| 205 | + offset = 2; // we provide the offset value **after** constructing the iterator |
| 206 | + ASSERT_EQUAL(*iter, 2); |
| 207 | +} |
| 208 | +DECLARE_VECTOR_UNITTEST(TestOffsetIteratorLateValue); |
| 209 | + |
| 210 | +template <typename Vector> |
| 211 | +void TestOffsetIteratorIndirectValueFancyIterator() |
| 212 | +{ |
| 213 | + using thrust::placeholders::_1; |
| 214 | + |
| 215 | + Vector v{0, 1, 2, 3, 4, 5, 6, 7, 8}; |
| 216 | + thrust::device_vector<typename Vector::difference_type> offsets{2}; |
| 217 | + auto it = thrust::make_transform_iterator(offsets.begin(), _1 * 3); |
| 218 | + thrust::offset_iterator iter(v.begin(), it); |
| 219 | + ASSERT_EQUAL(*iter, 6); |
| 220 | +} |
| 221 | +DECLARE_VECTOR_UNITTEST(TestOffsetIteratorIndirectValueFancyIterator); |
0 commit comments