2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
|
//
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
|
|
// <algorithm>
|
|
|
|
|
|
|
|
|
|
// template<InputIterator Iter, class T>
|
|
|
|
|
// requires HasEqualTo<Iter::value_type, T>
|
|
|
|
|
// Iter
|
|
|
|
|
// find(Iter first, Iter last, const T& value);
|
|
|
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
|
|
#include "../../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(input_iterator<const int*>(ia),
|
|
|
|
|
input_iterator<const int*>(ia+s), 3);
|
|
|
|
|
assert(*r == 3);
|
|
|
|
|
r = std::find(input_iterator<const int*>(ia), input_iterator<const int*>(ia+s), 10);
|
|
|
|
|
assert(r == input_iterator<const int*>(ia+s));
|
|
|
|
|
}
|
