diff options
Diffstat (limited to 'test/std/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp')
-rw-r--r-- | test/std/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp | 39 |
1 files changed, 39 insertions, 0 deletions
diff --git a/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp b/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp new file mode 100644 index 000000000000..4d172ff81397 --- /dev/null +++ b/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred.pass.cpp @@ -0,0 +1,39 @@ +//===----------------------------------------------------------------------===// +// +// 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<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 "test_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)); +} |