-
Notifications
You must be signed in to change notification settings - Fork 68
/
equal.cpp
74 lines (60 loc) · 2.4 KB
/
equal.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
// Range v3 library
//
// Copyright Eric Niebler 2014
//
// Use, modification and distribution is subject to the
// Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Project home: https://github.com/ericniebler/range-v3
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
#include <stl2/detail/algorithm/equal.hpp>
#include "../simple_test.hpp"
#include "../test_iterators.hpp"
namespace ranges = __stl2;
int comparison_count = 0;
template<typename T>
bool counting_equals(const T &a, const T &b) {
++comparison_count;
return a == b;
}
int main() {
using ranges::equal, ranges::distance, ranges::subrange;
auto test_case = [](const bool result, const int count,
const auto first1, const auto last1, const auto first2, const auto last2)
{
CHECK(equal(first1, last1, first2, last2) == result);
comparison_count = 0;
CHECK(equal(first1, last1, first2, last2, counting_equals<int>) == result);
CHECK(comparison_count == count);
CHECK(equal(subrange{first1, last1}, subrange{first2, last2}) == result);
comparison_count = 0;
CHECK(equal(subrange{first1, last1}, subrange{first2, last2}, counting_equals<int>) == result);
CHECK(comparison_count == count);
};
using I = input_iterator<const int*>;
using S = sentinel<const int*>;
using R = random_access_iterator<const int*>;
static const int ia[] = {0, 1, 2, 3, 4, 5};
constexpr auto s = distance(ia);
static const int ib[] = {0, 1, 2, 5, 4, 5};
static_assert(distance(ib) == s);
test_case(true, s, I(ia), S(ia + s), I(ia), S(ia + s));
test_case(true, s, R(ia), R(ia + s), R(ia), R(ia + s));
test_case(true, s, R(ia), S(ia + s), R(ia), S(ia + s));
test_case(false, 4, I(ia), S(ia + s), I(ib), S(ib + s));
test_case(false, 4, R(ia), R(ia + s), R(ib), R(ib + s));
test_case(false, 4, R(ia), S(ia + s), R(ib), S(ib + s));
test_case(false, s - 1, I(ia), S(ia + s), I(ia), S(ia + s - 1));
test_case(false, 0, R(ia), R(ia + s), R(ia), R(ia + s - 1));
test_case(false, s - 1, R(ia), S(ia + s), R(ia), S(ia + s - 1));
return ::test_result();
}