40 lines
1.5 KiB
C++
40 lines
1.5 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>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, EquivalenceRelation<auto, Iter::value_type> Pred>
|
|||
|
|
// requires CopyConstructible<Pred>
|
|||
|
|
// Iter
|
|||
|
|
// adjacent_find(Iter first, Iter last, Pred pred);
|
|||
|
|
|
|||
|
|
#include <algorithm>
|
|||
|
|
#include <functional>
|
|||
|
|
#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),
|
|||
|
|
std::equal_to<int>()) ==
|
|||
|
|
forward_iterator<const int*>(ia+2));
|
|||
|
|
assert(std::adjacent_find(forward_iterator<const int*>(ia),
|
|||
|
|
forward_iterator<const int*>(ia),
|
|||
|
|
std::equal_to<int>()) ==
|
|||
|
|
forward_iterator<const int*>(ia));
|
|||
|
|
assert(std::adjacent_find(forward_iterator<const int*>(ia+3),
|
|||
|
|
forward_iterator<const int*>(ia + sa),
|
|||
|
|
std::equal_to<int>()) ==
|
|||
|
|
forward_iterator<const int*>(ia+sa));
|
|||
|
|
}
|