diff options
author | Eric Fiselier <eric@efcs.ca> | 2014-12-20 01:40:03 +0000 |
---|---|---|
committer | Eric Fiselier <eric@efcs.ca> | 2014-12-20 01:40:03 +0000 |
commit | 5a83710e371fe68a06e6e3876c6a2c8b820a8976 (patch) | |
tree | afde4c82ad6704681781c5cd49baa3fbd05c85db /libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp | |
parent | f11e8eab527fba316c64112f6e05de1a79693a3e (diff) | |
download | bcm5719-llvm-5a83710e371fe68a06e6e3876c6a2c8b820a8976.tar.gz bcm5719-llvm-5a83710e371fe68a06e6e3876c6a2c8b820a8976.zip |
Move test into test/std subdirectory.
llvm-svn: 224658
Diffstat (limited to 'libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp')
-rw-r--r-- | libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp | 87 |
1 files changed, 0 insertions, 87 deletions
diff --git a/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp b/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp deleted file mode 100644 index 047f72062eb..00000000000 --- a/libcxx/test/algorithms/alg.nonmodifying/alg.equal/equal_pred.pass.cpp +++ /dev/null @@ -1,87 +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<InputIterator Iter1, InputIterator Iter2, -// Predicate<auto, Iter1::value_type, Iter2::value_type> Pred> -// requires CopyConstructible<Pred> -// bool -// equal(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred); - -#include <algorithm> -#include <functional> -#include <cassert> - -#include "test_iterators.h" - -#if _LIBCPP_STD_VER > 11 -#define HAS_FOUR_ITERATOR_VERSION -#endif - -int comparison_count = 0; -template <typename T> -bool counting_equals ( const T &a, const T &b ) { - ++comparison_count; - return a == b; -} - -int main() -{ - int ia[] = {0, 1, 2, 3, 4, 5}; - const unsigned s = sizeof(ia)/sizeof(ia[0]); - int ib[s] = {0, 1, 2, 5, 4, 5}; - assert(std::equal(input_iterator<const int*>(ia), - input_iterator<const int*>(ia+s), - input_iterator<const int*>(ia), - std::equal_to<int>())); -#ifdef HAS_FOUR_ITERATOR_VERSION - assert(std::equal(input_iterator<const int*>(ia), - input_iterator<const int*>(ia+s), - input_iterator<const int*>(ia), - input_iterator<const int*>(ia+s), - std::equal_to<int>())); - assert(std::equal(random_access_iterator<const int*>(ia), - random_access_iterator<const int*>(ia+s), - random_access_iterator<const int*>(ia), - random_access_iterator<const int*>(ia+s), - std::equal_to<int>())); - - comparison_count = 0; - assert(!std::equal(input_iterator<const int*>(ia), - input_iterator<const int*>(ia+s), - input_iterator<const int*>(ia), - input_iterator<const int*>(ia+s-1), - counting_equals<int>)); - assert(comparison_count > 0); - comparison_count = 0; - assert(!std::equal(random_access_iterator<const int*>(ia), - random_access_iterator<const int*>(ia+s), - random_access_iterator<const int*>(ia), - random_access_iterator<const int*>(ia+s-1), - counting_equals<int>)); - assert(comparison_count == 0); -#endif - assert(!std::equal(input_iterator<const int*>(ia), - input_iterator<const int*>(ia+s), - input_iterator<const int*>(ib), - std::equal_to<int>())); -#ifdef HAS_FOUR_ITERATOR_VERSION - assert(!std::equal(input_iterator<const int*>(ia), - input_iterator<const int*>(ia+s), - input_iterator<const int*>(ib), - input_iterator<const int*>(ib+s), - std::equal_to<int>())); - assert(!std::equal(random_access_iterator<const int*>(ia), - random_access_iterator<const int*>(ia+s), - random_access_iterator<const int*>(ib), - random_access_iterator<const int*>(ib+s), - std::equal_to<int>())); -#endif -} |