mirror of
https://github.com/Gericom/teak-llvm.git
synced 2025-06-25 14:28:54 -04:00
85 lines
3.2 KiB
C++
85 lines
3.2 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,
|
|
// 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_macros.h"
|
|
#include "test_iterators.h"
|
|
|
|
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>()));
|
|
#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),
|
|
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>()));
|
|
#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),
|
|
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
|
|
}
|