| 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
| 3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | // See https://llvm.org/LICENSE.txt for license information. |
| 5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | // |
| 7 | //===----------------------------------------------------------------------===// |
| 8 | |
| 9 | // UNSUPPORTED: c++03, c++11, c++14, c++17 |
| 10 | |
| 11 | // ranges::next(it, bound) |
| 12 | |
| 13 | #include <iterator> |
| 14 | |
| 15 | #include <cassert> |
| 16 | #include <concepts> |
| 17 | #include <utility> |
| 18 | |
| 19 | #include "../types.h" |
| 20 | #include "test_iterators.h" |
| 21 | |
| 22 | template <typename It> |
| 23 | constexpr void check_assignable(int* first, int* last, int* expected) { |
| 24 | It it(first); |
| 25 | auto sent = assignable_sentinel(It(last)); |
| 26 | It result = std::ranges::next(std::move(it), sent); |
| 27 | assert(base(result) == expected); |
| 28 | } |
| 29 | |
| 30 | template <typename It> |
| 31 | constexpr void check_sized_sentinel(int* first, int* last, int* expected) { |
| 32 | auto size = (last - first); |
| 33 | |
| 34 | It it(first); |
| 35 | auto sent = distance_apriori_sentinel(size); |
| 36 | std::same_as<It> auto result = std::ranges::next(std::move(it), sent); |
| 37 | assert(base(result) == expected); |
| 38 | } |
| 39 | |
| 40 | template <typename It> |
| 41 | constexpr void check_sentinel(int* first, int* last, int* expected) { |
| 42 | It it(first); |
| 43 | auto sent = sentinel_wrapper(It(last)); |
| 44 | std::same_as<It> auto result = std::ranges::next(std::move(it), sent); |
| 45 | assert(base(result) == expected); |
| 46 | } |
| 47 | |
| 48 | constexpr bool test() { |
| 49 | int range[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; |
| 50 | |
| 51 | for (int n = 0; n != 10; ++n) { |
| 52 | check_assignable<cpp17_input_iterator<int*>>( range, range+n, range+n); |
| 53 | check_assignable<cpp20_input_iterator<int*>>( range, range+n, range+n); |
| 54 | check_assignable<forward_iterator<int*>>( range, range+n, range+n); |
| 55 | check_assignable<bidirectional_iterator<int*>>(range, range+n, range+n); |
| 56 | check_assignable<random_access_iterator<int*>>(range, range+n, range+n); |
| 57 | check_assignable<contiguous_iterator<int*>>( range, range+n, range+n); |
| 58 | check_assignable<int*>( first: range, last: range+n, expected: range+n); |
| 59 | |
| 60 | check_sized_sentinel<cpp17_input_iterator<int*>>( range, range+n, range+n); |
| 61 | check_sized_sentinel<cpp20_input_iterator<int*>>( range, range+n, range+n); |
| 62 | check_sized_sentinel<forward_iterator<int*>>( range, range+n, range+n); |
| 63 | check_sized_sentinel<bidirectional_iterator<int*>>(range, range+n, range+n); |
| 64 | check_sized_sentinel<random_access_iterator<int*>>(range, range+n, range+n); |
| 65 | check_sized_sentinel<contiguous_iterator<int*>>( range, range+n, range+n); |
| 66 | check_sized_sentinel<int*>( first: range, last: range+n, expected: range+n); |
| 67 | |
| 68 | check_sentinel<cpp17_input_iterator<int*>>( range, range+n, range+n); |
| 69 | check_sentinel<cpp20_input_iterator<int*>>( range, range+n, range+n); |
| 70 | check_sentinel<forward_iterator<int*>>( range, range+n, range+n); |
| 71 | check_sentinel<bidirectional_iterator<int*>>(range, range+n, range+n); |
| 72 | check_sentinel<random_access_iterator<int*>>(range, range+n, range+n); |
| 73 | check_sentinel<contiguous_iterator<int*>>( range, range+n, range+n); |
| 74 | check_sentinel<int*>( first: range, last: range+n, expected: range+n); |
| 75 | } |
| 76 | |
| 77 | return true; |
| 78 | } |
| 79 | |
| 80 | int main(int, char**) { |
| 81 | test(); |
| 82 | static_assert(test()); |
| 83 | return 0; |
| 84 | } |
| 85 | |