libstdc++-v3/testsuite/25_algorithms/sort/moveable.cc

   1 // { dg-options "-std=gnu++11" }
   2
   3 // Copyright (C) 2005-2015 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.
  10
  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.
  15
  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/>.
  19
  20 // 25.3.1 algorithms, sort()
  21
  22 #undef _GLIBCXX_CONCEPT_CHECKS
  23
  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
  27
  28 #include <algorithm>
  29 #include <testsuite_hooks.h>
  30 #include <testsuite_iterators.h>
  31 #include <testsuite_rvalref.h>
  32
  33 using __gnu_test::test_container;
  34 using __gnu_test::random_access_iterator_wrapper;
  35 using __gnu_test::rvalstruct;
  36 using std::partial_sort;
  37
  38 typedef test_container<rvalstruct, random_access_iterator_wrapper> Container;
  39
  40 const int A[] = {10, 20, 1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7,
  41                  17, 8, 18, 9, 19};
  42 const int N = sizeof(A) / sizeof(int);
  43
  44 // 25.3.1.1 sort()
  45 void
  46 test01()
  47 {
  48   bool test __attribute__((unused)) = true;
  49
  50   rvalstruct s1[N];
  51   std::copy(A, A + N, s1);
  52   Container con(s1, s1 + N);
  53   std::sort(con.begin(), con.end());
  54   VERIFY( s1[0].valid );
  55   for(int i = 1; i < N; ++i)
  56     VERIFY( s1[i].val>s1[i-1].val && s1[i].valid );
  57 }
  58
  59 bool order(const rvalstruct& lhs, const rvalstruct& rhs)
  60 { return lhs < rhs; }
  61
  62 // 25.3.1.1 sort()
  63 void
  64 test02()
  65 {
  66   bool test __attribute__((unused)) = true;
  67
  68   rvalstruct s1[N];
  69   std::copy(A, A + N, s1);
  70   Container con(s1, s1 + N);
  71   std::sort(con.begin(), con.end(), order);
  72   VERIFY( s1[0].valid );
  73   for(int i = 1; i < N; ++i)
  74     VERIFY( s1[i].val>s1[i-1].val && s1[i].valid );
  75 }
  76
  77 int
  78 main()
  79 {
  80   test01();
  81   test02();
  82   return 0;
  83 }