cxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp
Howard Hinnant bc8d3f97eb libcxx initial import
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103490 91177308-0d34-0410-b5e6-96231b3b80d8
2010-05-11 19:42:16 +00:00

36 lines
1.3 KiB
C++

//===----------------------------------------------------------------------===//
//
// ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊThe LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template<ForwardIterator Iter>
// requires EqualityComparable<Iter::value_type>
// Iter
// adjacent_find(Iter first, Iter last);
#include <algorithm>
#include <cassert>
#include "../../iterators.h"
int main()
{
int ia[] = {0, 1, 2, 2, 0, 1, 2, 3};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
assert(std::adjacent_find(forward_iterator<const int*>(ia),
forward_iterator<const int*>(ia + sa)) ==
forward_iterator<const int*>(ia+2));
assert(std::adjacent_find(forward_iterator<const int*>(ia),
forward_iterator<const int*>(ia)) ==
forward_iterator<const int*>(ia));
assert(std::adjacent_find(forward_iterator<const int*>(ia+3),
forward_iterator<const int*>(ia + sa)) ==
forward_iterator<const int*>(ia+sa));
}