93 lines
3.6 KiB
C++
93 lines
3.6 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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>
|
|
// requires HasEqualTo<Iter1::value_type, Iter2::value_type>
|
|
// constexpr bool // constexpr after c++17
|
|
// equal(Iter1 first1, Iter1 last1, Iter2 first2);
|
|
//
|
|
// Introduced in C++14:
|
|
// template<InputIterator Iter1, InputIterator Iter2>
|
|
// constexpr bool // constexpr after c++17
|
|
// equal(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2);
|
|
|
|
#include <algorithm>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "test_iterators.h"
|
|
|
|
#if TEST_STD_VER > 17
|
|
TEST_CONSTEXPR bool test_constexpr() {
|
|
int ia[] = {1, 3, 6, 7};
|
|
int ib[] = {1, 3};
|
|
int ic[] = {1, 3, 5, 7};
|
|
typedef input_iterator<int*> II;
|
|
typedef bidirectional_iterator<int*> BI;
|
|
|
|
return !std::equal(std::begin(ia), std::end(ia), std::begin(ic))
|
|
&& !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic))
|
|
&& std::equal(std::begin(ib), std::end(ib), std::begin(ic))
|
|
&& !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic))
|
|
|
|
&& std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)))
|
|
&& !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)))
|
|
;
|
|
}
|
|
#endif
|
|
|
|
|
|
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)));
|
|
#if TEST_STD_VER >= 14
|
|
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)));
|
|
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)));
|
|
#endif
|
|
assert(!std::equal(input_iterator<const int*>(ia),
|
|
input_iterator<const int*>(ia+s),
|
|
input_iterator<const int*>(ib)));
|
|
#if TEST_STD_VER >= 14
|
|
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)));
|
|
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)));
|
|
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)));
|
|
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)));
|
|
|
|
#endif
|
|
|
|
#if TEST_STD_VER > 17
|
|
static_assert(test_constexpr());
|
|
#endif
|
|
}
|