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
|
// 2004-06-25 Paolo Carlini <pcarlini@suse.de>
// Copyright (C) 2004, 2005, 2009 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/>.
// 25.2.5 [lib.alg.fill] Fill
#include <list>
#include <algorithm>
#include <testsuite_hooks.h>
class num
{
int stored;
public:
num(int init = 0)
: stored(init)
{ }
operator int() const
{ return stored; }
};
// fill_n
void test01()
{
bool test __attribute__((unused)) = true;
using namespace std;
const int val = 3;
const int V[] = { val, val, val, val, val, val, val, val, val };
const list<int>::size_type N = sizeof(V) / sizeof(int);
list<int> coll(N);
fill_n(coll.begin(), coll.size(), val);
VERIFY( equal(coll.begin(), coll.end(), V) );
list<num> coll2(N);
fill_n(coll2.begin(), coll2.size(), val);
VERIFY( equal(coll2.begin(), coll2.end(), V) );
}
int main()
{
test01();
return 0;
}
|
