1 // { dg-options "-std=gnu++0x" }
3 // Copyright (C) 2008, 2009 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without Pred the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING3. If not see
18 // <http://www.gnu.org/licenses/>.
20 // 23.2.3.n forward_list xxx [lib.forward_list.xxx]
22 #include <forward_list>
23 #include <testsuite_hooks.h>
25 bool test __attribute__((unused)) = true;
27 // Comparison functor.
28 template<typename Num>
36 bool operator()(const Num i, const Num j)
38 return (n * i) < (n * j);
44 // This test verifies the following:
49 const unsigned int n = 13;
51 { 0,1,2,3,4,5,6,7,8,9,10,11,12 },
52 { 6,2,8,4,11,1,12,7,3,9,5,0,10 },
53 { 12,11,10,9,8,7,6,5,4,3,2,1,0 },
55 std::forward_list<int> sorted(order[0], order[0] + n);
57 for (unsigned int i = 0; i < sizeof(order)/sizeof(*order); ++i)
59 std::forward_list<int> head(order[i], order[i] + n);
63 VERIFY(head == sorted);
66 std::forward_list<int> reversed(order[2], order[2] + n);
67 for (unsigned int i = 0; i < sizeof(order)/sizeof(*order); ++i)
69 std::forward_list<int> head(order[i], order[i] + n);
74 VERIFY(head == reversed);