#include #include #include #include #include #include #include #include template void TestMergeSimple() { const Vector a{0, 2, 4}, b{0, 3, 3, 4}; const Vector ref{0, 0, 2, 3, 3, 4, 4}; Vector result(7); const auto end = thrust::merge(a.begin(), a.end(), b.begin(), b.end(), result.begin()); ASSERT_EQUAL_QUIET(result.end(), end); ASSERT_EQUAL(ref, result); } DECLARE_VECTOR_UNITTEST(TestMergeSimple); template OutputIterator merge(my_system& system, InputIterator1, InputIterator1, InputIterator2, InputIterator2, OutputIterator result) { system.validate_dispatch(); return result; } void TestMergeDispatchExplicit() { thrust::device_vector vec(1); my_system sys(0); thrust::merge(sys, vec.begin(), vec.begin(), vec.begin(), vec.begin(), vec.begin()); ASSERT_EQUAL(true, sys.is_valid()); } DECLARE_UNITTEST(TestMergeDispatchExplicit); template OutputIterator merge(my_tag, InputIterator1, InputIterator1, InputIterator2, InputIterator2, OutputIterator result) { *result = 13; return result; } void TestMergeDispatchImplicit() { thrust::device_vector vec(1); thrust::merge(thrust::retag(vec.begin()), thrust::retag(vec.begin()), thrust::retag(vec.begin()), thrust::retag(vec.begin()), thrust::retag(vec.begin())); ASSERT_EQUAL(13, vec.front()); } DECLARE_UNITTEST(TestMergeDispatchImplicit); template void TestMerge(size_t n) { const size_t sizes[] = {0, 1, n / 2, n, n + 1, 2 * n}; const size_t num_sizes = sizeof(sizes) / sizeof(size_t); const thrust::host_vector random = unittest::random_integers(n + *thrust::max_element(sizes, sizes + num_sizes)); thrust::host_vector h_a(random.begin(), random.begin() + n); thrust::host_vector h_b(random.begin() + n, random.end()); thrust::stable_sort(h_a.begin(), h_a.end()); thrust::stable_sort(h_b.begin(), h_b.end()); const thrust::device_vector d_a = h_a; const thrust::device_vector d_b = h_b; for (const auto size : sizes) { thrust::host_vector h_result(n + size); thrust::device_vector d_result(n + size); const auto h_end = thrust::merge(h_a.begin(), h_a.end(), h_b.begin(), h_b.begin() + size, h_result.begin()); const auto d_end = thrust::merge(d_a.begin(), d_a.end(), d_b.begin(), d_b.begin() + size, d_result.begin()); h_result.resize(h_end - h_result.begin()); d_result.resize(d_end - d_result.begin()); ASSERT_EQUAL(h_result, d_result); } } DECLARE_VARIABLE_UNITTEST(TestMerge); template void TestMergeToDiscardIterator(size_t n) { thrust::host_vector h_a = unittest::random_integers(n); thrust::host_vector h_b = unittest::random_integers(n); thrust::stable_sort(h_a.begin(), h_a.end()); thrust::stable_sort(h_b.begin(), h_b.end()); const thrust::device_vector d_a = h_a; const thrust::device_vector d_b = h_b; const auto h_result = thrust::merge(h_a.begin(), h_a.end(), h_b.begin(), h_b.end(), thrust::make_discard_iterator()); const auto d_result = thrust::merge(d_a.begin(), d_a.end(), d_b.begin(), d_b.end(), thrust::make_discard_iterator()); thrust::discard_iterator<> reference(static_cast(2 * n)); ASSERT_EQUAL_QUIET(reference, h_result); ASSERT_EQUAL_QUIET(reference, d_result); } DECLARE_VARIABLE_UNITTEST(TestMergeToDiscardIterator); template void TestMergeDescending(size_t n) { thrust::host_vector h_a = unittest::random_integers(n); thrust::host_vector h_b = unittest::random_integers(n); thrust::stable_sort(h_a.begin(), h_a.end(), ::cuda::std::greater()); thrust::stable_sort(h_b.begin(), h_b.end(), ::cuda::std::greater()); const thrust::device_vector d_a = h_a; const thrust::device_vector d_b = h_b; thrust::host_vector h_result(h_a.size() + h_b.size()); thrust::device_vector d_result(d_a.size() + d_b.size()); const auto h_end = thrust::merge(h_a.begin(), h_a.end(), h_b.begin(), h_b.end(), h_result.begin(), ::cuda::std::greater()); const auto d_end = thrust::merge(d_a.begin(), d_a.end(), d_b.begin(), d_b.end(), d_result.begin(), ::cuda::std::greater()); ASSERT_EQUAL(h_result, d_result); ASSERT_EQUAL(h_end == h_result.end(), true); ASSERT_EQUAL(d_end == d_result.end(), true); } DECLARE_VARIABLE_UNITTEST(TestMergeDescending);