Fix addvdi3 and subvdi3 patterns
[official-gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / fill_n / dr426.cc
blob8a97398e89eca6ecb0a39bb088b5b57af10bef9b
1 // Copyright (C) 2019-2022 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.
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.
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/>.
18 // { dg-do run }
20 #include <algorithm>
21 #include <testsuite_hooks.h>
23 // DR 426. search_n(), fill_n(), and generate_n() with negative n
25 void
26 test01()
28 int i = 99;
29 std::fill_n(&i, 0, 13);
30 VERIFY( i == 99 );
31 std::fill_n(&i, -1, 13);
32 VERIFY( i == 99 );
33 std::fill_n(&i, -100, 13);
34 VERIFY( i == 99 );
37 struct X
39 X() { }
40 X(const X&) { throw 1; }
41 X& operator=(const X&) { throw 1u; }
44 void
45 test02()
47 X x;
48 std::fill_n(&x, 0, x);
49 std::fill_n(&x, -1, x);
50 std::fill_n(&x, -100, x);
53 int
54 main()
56 test01();
57 test02();