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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template<InputIterator Iter1, ForwardIterator Iter2>
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
// Iter1
// find_first_of(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
#include <algorithm>
#include <cassert>
#include "test_iterators.h"
int main()
{
int ia[] = {0, 1, 2, 3, 0, 1, 2, 3};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
int ib[] = {1, 3, 5, 7};
const unsigned sb = sizeof(ib)/sizeof(ib[0]);
assert(std::find_first_of(input_iterator<const int*>(ia),
input_iterator<const int*>(ia + sa),
forward_iterator<const int*>(ib),
forward_iterator<const int*>(ib + sb)) ==
input_iterator<const int*>(ia+1));
int ic[] = {7};
assert(std::find_first_of(input_iterator<const int*>(ia),
input_iterator<const int*>(ia + sa),
forward_iterator<const int*>(ic),
forward_iterator<const int*>(ic + 1)) ==
input_iterator<const int*>(ia+sa));
assert(std::find_first_of(input_iterator<const int*>(ia),
input_iterator<const int*>(ia + sa),
forward_iterator<const int*>(ic),
forward_iterator<const int*>(ic)) ==
input_iterator<const int*>(ia+sa));
assert(std::find_first_of(input_iterator<const int*>(ia),
input_iterator<const int*>(ia),
forward_iterator<const int*>(ic),
forward_iterator<const int*>(ic+1)) ==
input_iterator<const int*>(ia));
}
|
