| // Copyright (C) 2005 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 2, 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 COPYING. If not, write to the Free |
| // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, |
| // USA. |
| |
| // 25.3.1.1 [lib.stable.sort] |
| |
| // { dg-do compile } |
| |
| #include <algorithm> |
| #include <testsuite_iterators.h> |
| |
| using __gnu_test::random_access_iterator_wrapper; |
| |
| struct S { }; |
| |
| bool |
| operator<(const S&, const S&) {return true;} |
| |
| struct X { }; |
| |
| bool |
| predicate(const X&, const X&) {return true;} |
| |
| void |
| test1(random_access_iterator_wrapper<S>& s) |
| { |
| std::stable_sort(s, s); |
| } |
| |
| void |
| test2(random_access_iterator_wrapper<X>& x) |
| { |
| std::stable_sort(x, x, predicate); |
| } |
| |
