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
93
94
95
96
97
98
99
100
101
|
// { dg-do run { target c++11 } }
// Copyright (C) 2019-2022 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
#include <algorithm>
#include <vector>
#include <list>
#include <deque>
#include <testsuite_hooks.h>
void test01()
{
using namespace std;
deque<int> d;
for (int i = 0; i != _GLIBCXX_STD_C::__deque_buf_size(sizeof(int)); ++i)
d.push_back(i);
deque<int> dest(d.size(), 0);
move_backward(d.begin(), d.end(), dest.end());
VERIFY( equal(dest.begin(), dest.end(), d.begin()) );
}
void test02()
{
using namespace std;
deque<int> d;
for (int i = 0; i != 4 * _GLIBCXX_STD_C::__deque_buf_size(sizeof(int)); ++i)
d.push_back(i);
deque<int> dest(d.size(), 0);
const deque<int>& cd = d;
move_backward(cd.begin(), cd.end(), dest.end());
VERIFY( equal(dest.begin(), dest.end(), cd.begin()) );
}
void test03()
{
std::deque<int> d;
for (int i = 0; i != 1024; ++i)
d.push_back(i);
std::vector<int> dest(d.size(), 0);
std::move_backward(d.begin(), d.end(), dest.end());
VERIFY( std::equal(dest.begin(), dest.end(), d.begin()) );
}
void test04()
{
std::vector<int> v;
for (int i = 0; i != 1024; ++i)
v.push_back(i);
std::deque<int> dest(v.size() - 10, 0);
std::move_backward(v.begin() + 5, v.end() - 5, dest.end());
VERIFY( std::equal(dest.begin(), dest.end(), v.begin() + 5) );
}
void test05()
{
std::list<int> l;
for (int i = 0; i != 1024; ++i)
l.push_back(i);
std::deque<int> dest(l.size(), 0);
std::move_backward(l.begin(), l.end(), dest.end());
VERIFY( std::equal(dest.begin(), dest.end(), l.begin()) );
}
int main()
{
test01();
test02();
test03();
test04();
test05();
return 0;
}
|
