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
76
77
78
79
80
81
82
83
84
85
86
87
|
// Copyright (C) 2019-2021 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 }
#include <algorithm>
#include <testsuite_hooks.h>
int a[4] = { 0, 1, 2, 3 };
int g;
enum E { e2 = 2 };
struct Num
{
char val;
operator char() const { return val; }
private:
void operator+() const;
void operator+(int) const;
void operator+(Num) const;
void operator<(int) const;
void operator>(int) const;
void operator<=(int) const;
void operator>=(int) const;
void operator==(int) const;
void operator!=(int) const;
};
void
test01()
{
int* p;
g = -1;
p = std::fill_n(a, true, g); // bool as Size
VERIFY( p == a+1 );
VERIFY( a[0] == g );
VERIFY( a[1] == 1 );
VERIFY( a[2] == 2 );
VERIFY( a[3] == 3 );
g = -2;
p = std::fill_n(a, e2, g); // enumeration type as Size
VERIFY( p == a+2 );
VERIFY( a[0] == g );
VERIFY( a[1] == g );
VERIFY( a[2] == 2 );
VERIFY( a[3] == 3 );
g = -3;
p = std::fill_n(a, 3.5, g); // floating point type as Size
VERIFY( p == a+3 );
VERIFY( a[0] == g );
VERIFY( a[1] == g );
VERIFY( a[2] == g );
VERIFY( a[3] == 3 );
g = -4;
Num n = { 3 };
p = std::fill_n(a, n, g); // non-scalar type as Size
VERIFY( p == a+3 );
VERIFY( a[0] == g );
VERIFY( a[1] == g );
VERIFY( a[2] == g );
VERIFY( a[3] == 3 );
}
int main()
{
test01();
}
|
