libstdc++-v3/testsuite/25_algorithms/partition/1.cc

   1 // Copyright (C) 2001-2013 Free Software Foundation, Inc.
   2 //
   3 // This file is part of the GNU ISO C++ Library.  This library is free
   4 // software; you can redistribute it and/or modify it under the
   5 // terms of the GNU General Public License as published by the
   6 // Free Software Foundation; either version 3, or (at your option)
   7 // any later version.
   8
   9 // This library is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU General Public License for more details.
  13
  14 // You should have received a copy of the GNU General Public License along
  15 // with this library; see the file COPYING3.  If not see
  16 // <http://www.gnu.org/licenses/>.
  17
  18 // 25.2.12 [lib.alg.partitions] Partitions.
  19
  20 #include <algorithm>
  21 #include <functional>
  22 #include <testsuite_hooks.h>
  23
  24 bool test __attribute__((unused)) = true;
  25
  26 const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
  27 const int B[] = {2, 4, 6, 8, 10, 12, 14, 16, 1, 3, 5, 7, 9, 11, 13, 15, 17};
  28 const int N = sizeof(A) / sizeof(int);
  29
  30 struct Pred
  31 {
  32     bool
  33     operator()(const int& x) const
  34     { return (x % 2) == 0; }
  35 };
  36
  37 // 25.2.12 partition()
  38 void
  39 test01()
  40 {
  41     using std::partition;
  42
  43     int s1[N];
  44     std::copy(A, A + N, s1);
  45
  46     Pred pred;
  47     int* m = partition(s1, s1 + N, pred);
  48     for (const int* i = s1; i < m; ++i) VERIFY(pred(*i));
  49     for (const int* i = m; i < s1 + N; ++i) VERIFY(!pred(*i));
  50 }
  51
  52 int
  53 main()
  54 {
  55   test01();
  56   return 0;
  57 }