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
|
// { dg-do run { target c++11 } }
// 2009-12-24 Paolo Carlini <paolo.carlini@oracle.com>
//
// 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 <deque>
#include <testsuite_hooks.h>
void test01()
{
using namespace std;
deque<long> data(200);
for (unsigned i = 0; i < data.size(); ++i)
data[i] = i;
const deque<long> data_1(data.size(), -1);
for (unsigned i = 0; i < data.size(); i += 2)
for (unsigned j = i; j <= data.size(); j += 3)
for (unsigned k = 0; k + (j - i) <= data.size(); k += 5)
{
deque<long> d(data.size(), -1);
move_backward(data.begin() + i, data.begin() + j,
d.begin() + k + (j - i));
VERIFY( equal(data.begin() + i, data.begin() + j,
d.begin() + k) );
VERIFY( equal(d.begin(), d.begin() + k, data_1.begin()) );
VERIFY( equal(d.begin() + k + (j - i), d.end(), data_1.begin()) );
}
}
int main()
{
test01();
return 0;
}
|
