|
| 1 | +/* |
| 2 | + * Copyright (c) 2024 Morwenn. |
| 3 | + * SPDX-License-Identifier: MIT |
| 4 | + */ |
| 5 | +#include <array> |
| 6 | +#include <deque> |
| 7 | +#include <iterator> |
| 8 | +#include <numeric> |
| 9 | +#include <ranges> |
| 10 | +#include <vector> |
| 11 | +#include <catch2/catch_test_macros.hpp> |
| 12 | +#include <gfx/timsort.hpp> |
| 13 | +#include "test_helpers.hpp" |
| 14 | + |
| 15 | +TEST_CASE( "support for std::ranges::views::zip" ) |
| 16 | +{ |
| 17 | + SECTION( "zip two small collections" ) { |
| 18 | + // issue #40 |
| 19 | + std::vector<int> vec = {4, 2, 3, 1}; |
| 20 | + std::array<char, 4> arr = {'A', 'C', 'B', 'D'}; |
| 21 | + auto zipped = std::views::zip(vec, arr); |
| 22 | + |
| 23 | + gfx::timsort( |
| 24 | + zipped, {}, |
| 25 | + [](std::tuple<int&, char&> const& pair) { |
| 26 | + return std::get<0>(pair); |
| 27 | + } |
| 28 | + ); |
| 29 | + CHECK( std::ranges::is_sorted(vec) ); |
| 30 | + CHECK( std::ranges::is_sorted(arr, std::ranges::greater{}) ); |
| 31 | + } |
| 32 | + |
| 33 | + SECTION( "zip two big collections" ) { |
| 34 | + std::vector<int> vec(3000); |
| 35 | + std::deque<long long int> deq(3000); |
| 36 | + std::iota(vec.begin(), vec.end(), -500); |
| 37 | + std::ranges::reverse(vec); |
| 38 | + std::iota(deq.begin(), deq.end(), -500); |
| 39 | + |
| 40 | + auto zipped = std::views::zip(vec, deq); |
| 41 | + test_helpers::shuffle(zipped); |
| 42 | + |
| 43 | + gfx::timsort(zipped); |
| 44 | + CHECK( std::ranges::is_sorted(vec) ); |
| 45 | + CHECK( std::ranges::is_sorted(deq, std::ranges::greater{}) ); |
| 46 | + } |
| 47 | +} |
0 commit comments