File: constrained.cc

package info (click to toggle)
gcc-arm-none-eabi 15%3A14.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,099,328 kB
  • sloc: cpp: 3,627,108; ansic: 2,571,498; ada: 834,230; f90: 235,082; makefile: 79,231; asm: 74,984; xml: 51,692; exp: 39,736; sh: 33,298; objc: 15,629; python: 15,069; fortran: 14,429; pascal: 7,003; awk: 5,070; perl: 3,106; ml: 285; lisp: 253; lex: 204; haskell: 135
file content (75 lines) | stat: -rw-r--r-- 2,416 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
// Copyright (C) 2020-2024 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3.  If not see
// <http://www.gnu.org/licenses/>.

// { dg-do run { target c++20 } }

#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>

using __gnu_test::test_container;
using __gnu_test::test_range;
using __gnu_test::input_iterator_wrapper;
using __gnu_test::forward_iterator_wrapper;

namespace ranges = std::ranges;

struct X { int i; };

void
test01()
{
  X xa[] = { {1}, {2}, {3}, {4}, {5}, {6} };
  X xb[] = { {1}, {2}, {3}, {3}, {5}, {6} };
  auto res = ranges::mismatch(xa, xa+6, xb, xb+6, {}, &X::i, &X::i);
  VERIFY( res.in1 == xa+3 && res.in2 == xb+3 );

  test_container<X, forward_iterator_wrapper> ca(xa);
  test_container<X, forward_iterator_wrapper> cb(xb);
  auto res2 = ranges::mismatch(ca, cb, {}, &X::i, &X::i);
  VERIFY( res2.in1->i == 4 && res2.in2->i == 3 );
  res2 = ranges::mismatch(ca, ca, {}, &X::i, &X::i);
  VERIFY( res2.in1 == ranges::end(ca) && res2.in2 == ranges::end(ca) );

  test_range<X, input_iterator_wrapper> ra(xa);
  test_range<X, input_iterator_wrapper> rb(xb);
  auto res3 = ranges::mismatch(ra, rb, {}, &X::i, &X::i);
  VERIFY( res3.in1->i == 4 && res3.in2->i == 3 );

  test_range<X, input_iterator_wrapper> ra2(xa);
  ra.bounds.first = xa;
  res3 = ranges::mismatch(ra, ra2, {}, &X::i, &X::i);
  VERIFY( res3.in1 == ranges::end(ra) && res3.in2 == ranges::end(ra2) );
}

struct Y { int i; int j; };

void
test02()
{
  static constexpr Y ya[] = { {1,2}, {2,4}, {3,6}, {1,6} };
  static constexpr Y yb[] = { {2,1}, {4,2}, {4,2}, {7,1} };
  static_assert(ranges::mismatch(ya, yb, {}, &Y::i, &Y::j).in1 == ya+2);
  static_assert(ranges::mismatch(ya, yb, {}, &Y::i, &Y::j).in2 == yb+2);
}

int
main()
{
  test01();
  test02();
}