| // { dg-options "-std=gnu++0x" } |
| |
| // Copyright (C) 2008, 2009 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; |
| } |