diff options
Diffstat (limited to 'libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp')
-rw-r--r-- | libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp | 35 |
1 files changed, 0 insertions, 35 deletions
diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp deleted file mode 100644 index ee030925d55..00000000000 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find.pass.cpp +++ /dev/null @@ -1,35 +0,0 @@ -//===----------------------------------------------------------------------===// -// -// 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> -// requires EqualityComparable<Iter::value_type> -// Iter -// adjacent_find(Iter first, Iter last); - -#include <algorithm> -#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)) == - 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)); -} |