/
iterator.pass.cpp
42 lines (35 loc) · 1.19 KB
/
iterator.pass.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11, c++14, c++17
// UNSUPPORTED: libcpp-no-concepts
// UNSUPPORTED: gcc-10
// ranges::prev(it)
#include <iterator>
#include <cassert>
#include "test_iterators.h"
template <class It>
constexpr void check() {
int range[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
assert(std::ranges::prev(It(&range[1])) == It(&range[0]));
assert(std::ranges::prev(It(&range[4])) == It(&range[3]));
assert(std::ranges::prev(It(&range[5])) == It(&range[4]));
assert(std::ranges::prev(It(&range[6])) == It(&range[5]));
assert(std::ranges::prev(It(&range[10])) == It(&range[9]));
}
constexpr bool test() {
check<bidirectional_iterator<int*>>();
check<random_access_iterator<int*>>();
check<contiguous_iterator<int*>>();
check<int*>();
return true;
}
int main(int, char**) {
test();
static_assert(test());
return 0;
}