#include "pch.h"

#ifdef __cpp_lib_ranges

#include <algorithm>

#include <ranges>

TEST_CASE("ranges")

{

{

// random-access range algorithms

auto v = winrt::single_threaded_vector<int>({ 9, 8, 9, 6, 5, 8, 9, 3, 5, 3, 5, 3, 4, 7, 2, 1, 2, 3, 1 });

const bool result = std::ranges::is_heap(v);

REQUIRE((result == true));

}

{

// bidirectional range views

auto v = winrt::single_threaded_vector<int>({ 1, 2, 3 });

std::vector<int> result;

for (const int i : v | std::views::reverse)

{

result.push_back(i);

}

REQUIRE((result == std::vector{ 3, 2, 1 }));

}

{

// input range algorithms

// decay to IIterable is important, we want to test the non-fast iterators.

winrt::Windows::Foundation::Collections::IIterable<int> iterable = winrt::single_threaded_vector<int>({ 2, 3, 1 });

const int result = (std::ranges::max)(iterable);

REQUIRE((result == 3));

}

{

// input range views

// decay to IIterable is important, we want to test the non-fast iterators.

winrt::Windows::Foundation::Collections::IIterable<int> iterable = winrt::single_threaded_vector<int>({ 1, 2, 3 });

std::vector<int> result;

for (const int i : iterable | std::views::transform([](int i) { return i * 2; }))

{

result.push_back(i);

}

REQUIRE((result == std::vector{ 2, 4, 6 }));

}

}

#endif