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
|
//===----------------------------------------------------------------------===//
//
// 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++98, c++03, c++11
// <algorithm>
// template<class ForwardIterator, class Searcher>
// ForwardIterator search(ForwardIterator first, ForwardIterator last,
// const Searcher& searcher);
//
// returns searcher.operator(first, last).first
//
#include <experimental/algorithm>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
int searcher_called = 0;
struct MySearcher {
template <typename Iterator>
std::pair<Iterator, Iterator>
operator() (Iterator b, Iterator e) const
{
++searcher_called;
return std::make_pair(b, e);
}
};
int main(int, char**) {
typedef int * RI;
static_assert((std::is_same<RI, decltype(std::experimental::search(RI(), RI(), MySearcher()))>::value), "" );
RI it(nullptr);
assert(it == std::experimental::search(it, it, MySearcher()));
assert(searcher_called == 1);
return 0;
}
|
