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
|
// { dg-options "-std=gnu++11" }
// Copyright (C) 2008-2016 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/>.
// 23.2.3.n forward_list xxx [lib.forward_list.xxx]
#include <forward_list>
#include <testsuite_hooks.h>
#include <algorithm>
bool test __attribute__((unused)) = true;
// This test verifies the following:
//
void
test01()
{
const unsigned int n = 13;
int order[n] = {0,1,2,3,4,5,6,7,8,9,10,11,12};
std::forward_list<int> fl(order, order + n);
std::forward_list<int> fl2;
for (std::size_t i = 0; i < n; ++i)
fl2.push_front(order[i]);
fl.reverse();
VERIFY(std::lexicographical_compare(fl.begin(), fl.end(),
fl2.begin(), fl2.end()) == false);
}
int
main()
{
test01();
return 0;
}
|
