forked from OSchip/llvm-project
50 lines
2.1 KiB
C++
50 lines
2.1 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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 "../../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));
|
|
}
|