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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
// Range v3 library
//
// Copyright Eric Niebler 2014-present
//
// 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
#include <cstring>
#include <algorithm>
#include <utility>
#include <vector>
#include <range/v3/core.hpp>
#include <range/v3/algorithm/copy_backward.hpp>
#include "../array.hpp"
#include "../simple_test.hpp"
#include "../test_iterators.hpp"
#include "../test_utils.hpp"
constexpr bool test_constexpr()
{
using IL = std::initializer_list<int>;
constexpr test::array<int, 4> input{{0, 1, 2, 3}};
test::array<int, 4> a1{{0, 0, 0, 0}};
auto res = ranges::copy_backward(input, ranges::end(a1));
STATIC_CHECK_RETURN(res.in == ranges::end(input));
STATIC_CHECK_RETURN(res.out == ranges::begin(a1));
STATIC_CHECK_RETURN(ranges::equal(a1, IL{0, 1, 2, 3}));
return true;
}
int main()
{
using ranges::begin;
using ranges::end;
using ranges::size;
std::pair<int, int> const a[] = {{0, 0}, {0, 1}, {1, 2}, {1, 3}, {3, 4}, {3, 5}};
static_assert(size(a) == 6, "");
std::pair<int, int> out[size(a)] = {};
{
auto res = ranges::copy_backward(begin(a), end(a), end(out));
CHECK(res.in == end(a));
CHECK(res.out == begin(out));
CHECK(std::equal(a, a + size(a), out));
}
{
std::fill_n(out, size(out), std::make_pair(0, 0));
auto res = ranges::copy_backward(a, end(out));
CHECK(res.in == end(a));
CHECK(res.out == begin(out));
CHECK(std::equal(a, a + size(a), out));
}
#ifndef RANGES_WORKAROUND_MSVC_573728
{
std::fill_n(out, size(out), std::make_pair(0, 0));
auto res = ranges::copy_backward(std::move(a), end(out));
CHECK(::is_dangling(res.in));
CHECK(res.out == begin(out));
CHECK(std::equal(a, a + size(a), out));
}
#endif
{
std::fill_n(out, size(out), std::make_pair(0, 0));
std::vector<std::pair<int, int>> vec(begin(a), end(a));
auto res = ranges::copy_backward(std::move(vec), end(out));
CHECK(::is_dangling(res.in));
CHECK(res.out == begin(out));
CHECK(std::equal(a, a + size(a), out));
}
{
std::fill_n(out, size(out), std::make_pair(0, 0));
auto res = ranges::copy_backward(ranges::views::all(a), end(out));
CHECK(res.in == end(a));
CHECK(res.out == begin(out));
CHECK(std::equal(a, a + size(a), out));
}
{
STATIC_CHECK(test_constexpr());
}
return test_result();
}
|
