]>
Commit | Line | Data |
---|---|---|
7adcbafe | 1 | // Copyright (C) 2020-2022 Free Software Foundation, Inc. |
bc464641 PP |
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 | // { 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::input_iterator_wrapper; | |
28 | using __gnu_test::forward_iterator_wrapper; | |
29 | ||
30 | namespace ranges = std::ranges; | |
31 | ||
32 | struct X { int i; }; | |
33 | ||
34 | void | |
35 | test01() | |
36 | { | |
37 | X xa[] = { {1}, {2}, {3}, {4}, {5}, {6} }; | |
38 | X xb[] = { {1}, {2}, {3}, {3}, {5}, {6} }; | |
39 | auto res = ranges::mismatch(xa, xa+6, xb, xb+6, {}, &X::i, &X::i); | |
40 | VERIFY( res.in1 == xa+3 && res.in2 == xb+3 ); | |
41 | ||
42 | test_container<X, forward_iterator_wrapper> ca(xa); | |
43 | test_container<X, forward_iterator_wrapper> cb(xb); | |
44 | auto res2 = ranges::mismatch(ca, cb, {}, &X::i, &X::i); | |
45 | VERIFY( res2.in1->i == 4 && res2.in2->i == 3 ); | |
46 | res2 = ranges::mismatch(ca, ca, {}, &X::i, &X::i); | |
47 | VERIFY( res2.in1 == ranges::end(ca) && res2.in2 == ranges::end(ca) ); | |
48 | ||
49 | test_range<X, input_iterator_wrapper> ra(xa); | |
50 | test_range<X, input_iterator_wrapper> rb(xb); | |
51 | auto res3 = ranges::mismatch(ra, rb, {}, &X::i, &X::i); | |
52 | VERIFY( res3.in1->i == 4 && res3.in2->i == 3 ); | |
53 | ||
54 | test_range<X, input_iterator_wrapper> ra2(xa); | |
55 | ra.bounds.first = xa; | |
56 | res3 = ranges::mismatch(ra, ra2, {}, &X::i, &X::i); | |
57 | VERIFY( res3.in1 == ranges::end(ra) && res3.in2 == ranges::end(ra2) ); | |
58 | } | |
59 | ||
60 | struct Y { int i; int j; }; | |
61 | ||
62 | void | |
63 | test02() | |
64 | { | |
65 | static constexpr Y ya[] = { {1,2}, {2,4}, {3,6}, {1,6} }; | |
66 | static constexpr Y yb[] = { {2,1}, {4,2}, {4,2}, {7,1} }; | |
67 | static_assert(ranges::mismatch(ya, yb, {}, &Y::i, &Y::j).in1 == ya+2); | |
68 | static_assert(ranges::mismatch(ya, yb, {}, &Y::i, &Y::j).in2 == yb+2); | |
69 | } | |
70 | ||
71 | int | |
72 | main() | |
73 | { | |
74 | test01(); | |
75 | test02(); | |
76 | } |