1 // Copyright (C) 2020 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
Start()16 // <http://www.gnu.org/licenses/>.
17 
18 // { dg-options "-std=gnu++2a" }
19 // { dg-do run { target c++2a } }
20 
21 #include <algorithm>
22 #include <testsuite_hooks.h>
23 #include <testsuite_iterators.h>
24 
25 using __gnu_test::test_container;
26 using __gnu_test::test_range;
27 using __gnu_test::forward_iterator_wrapper;
28 using __gnu_test::bidirectional_iterator_wrapper;
29 
30 namespace ranges = std::ranges;
31 
32 template<template<typename> typename wrapper>
33 void
34 test01()
35 {
36     {
37       int x[] = {1,2,3,4,5,6,7,8,9,10};
38       test_container<int, wrapper> cx(x);
39       auto range = ranges::partition(cx, [] (int a) { return a%2==0; });
40       VERIFY( range.begin().ptr == x+5 );
41       VERIFY( range.end().ptr == x+10 );
42       VERIFY( ranges::is_partitioned(cx, [] (int a) { return a%2==0; }) );
43     }
44 
45     {
46       int x[] = {1,2,3,4,5,6,7,8};
47       test_range<int, wrapper> rx(x);
48       auto range = ranges::partition(rx,
49 				     [] (int a) { return a%2==0; },
50 				     [] (int a) { return a+1; });
51       VERIFY( range.begin().ptr == x+4 );
52       VERIFY( range.end().ptr == x+8 );
53       VERIFY( ranges::is_partitioned(rx, [] (int a) { return a%2==1; }) );
54     }
55 }
56 
57 constexpr bool
58 test02()
59 {
60   int x[] = {1,2,3,4,5,6,7,8,9,10};
61   auto range = ranges::partition(x, x+9, [] (int a) { return a < 100; });
62   return (range.begin() == x+9 && range.end() == x+9);
63 }
64 
65 int
66 main()
67 {
68   test01<forward_iterator_wrapper>();
69   test01<bidirectional_iterator_wrapper>();
70   static_assert(test02());
71 }
72