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
43
44
45
46
47
48
49
50
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template<ForwardIterator Iter>
// requires EqualityComparable<Iter::value_type>
// constexpr Iter // constexpr after C++17
// adjacent_find(Iter first, Iter last);
#include <algorithm>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
#if TEST_STD_VER > 17
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 1, 2, 2, 0, 1, 2, 3};
int ib[] = {0, 1, 2, 7, 0, 1, 2, 3};
return (std::adjacent_find(std::begin(ia), std::end(ia)) == ia+2)
&& (std::adjacent_find(std::begin(ib), std::end(ib)) == std::end(ib))
;
}
#endif
int main()
{
int ia[] = {0, 1, 2, 2, 0, 1, 2, 3};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
assert(std::adjacent_find(forward_iterator<const int*>(ia),
forward_iterator<const int*>(ia + sa)) ==
forward_iterator<const int*>(ia+2));
assert(std::adjacent_find(forward_iterator<const int*>(ia),
forward_iterator<const int*>(ia)) ==
forward_iterator<const int*>(ia));
assert(std::adjacent_find(forward_iterator<const int*>(ia+3),
forward_iterator<const int*>(ia + sa)) ==
forward_iterator<const int*>(ia+sa));
#if TEST_STD_VER > 17
static_assert(test_constexpr());
#endif
}
|
