2017-11-29 Vladimir Makarov <vmakarov@redhat.com>
[official-gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / stable_sort / moveable.cc
blob805c32cfe0203644da4da66ce5fd1c417dd71462
1 // { dg-do run { target c++11 } }
3 // Copyright (C) 2009-2017 Free Software Foundation, Inc.
4 //
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)
9 // any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even 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 // 25.3.1.2 [lib.stable.sort]
22 #undef _GLIBCXX_CONCEPT_CHECKS
24 // XXX FIXME: parallel-mode should deal correctly with moveable-only types
25 // per C++0x, at minimum smoothly fall back to serial.
26 #undef _GLIBCXX_PARALLEL
28 #include <algorithm>
29 #include <testsuite_hooks.h>
30 #include <testsuite_iterators.h>
31 #include <testsuite_rvalref.h>
33 using __gnu_test::test_container;
34 using __gnu_test::random_access_iterator_wrapper;
35 using __gnu_test::rvalstruct;
37 typedef test_container<rvalstruct, random_access_iterator_wrapper> Container;
39 const int A[] = { 10, 20, 1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7,
40 17, 8, 18, 9, 19 };
41 const int N = sizeof(A) / sizeof(int);
43 // 25.3.1.2 stable_sort()
44 void
45 test01()
47 rvalstruct s1[N];
48 std::copy(A, A + N, s1);
49 Container con(s1, s1 + N);
50 std::stable_sort(con.begin(), con.end());
51 VERIFY( s1[0].valid );
52 for(int i = 1; i < N; ++i)
53 VERIFY( s1[i].val>s1[i-1].val && s1[i].valid );
56 int
57 main()
59 test01();
60 return 0;