4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
35 lines
1.2 KiB
C++
35 lines
1.2 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 Iter, Predicate<auto, Iter::value_type> Pred>
|
|
// requires CopyConstructible<Pred>
|
|
// Iter
|
|
// find_if(Iter first, Iter last, Pred pred);
|
|
|
|
#include <algorithm>
|
|
#include <functional>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
int main()
|
|
{
|
|
int ia[] = {0, 1, 2, 3, 4, 5};
|
|
const unsigned s = sizeof(ia)/sizeof(ia[0]);
|
|
input_iterator<const int*> r = std::find_if(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia+s),
|
|
std::bind2nd(std::equal_to<int>(), 3));
|
|
assert(*r == 3);
|
|
r = std::find_if(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia+s),
|
|
std::bind2nd(std::equal_to<int>(), 10));
|
|
assert(r == input_iterator<const int*>(ia+s));
|
|
}
|