blob: 6df372fd1fede04cb78137cc003563bbfe57a328 (
plain)
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
|
// Copyright (C) 2014-2018 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/>.
#include <memory>
#include <testsuite_hooks.h>
// test specialization for trivial types
void
test01()
{
const int N = 10;
int arr[N] = { };
const int n = 5;
const int over9000 = 9001;
int* end = std::uninitialized_fill_n(arr, n, over9000);
VERIFY( end = arr + n );
for (int i = 0; i < n; ++i)
VERIFY( arr[i] == over9000 );
for (int i = n; i < N; ++i)
VERIFY( arr[i] == 0 );
}
struct T
{
T() { }
T(const T&) { ++counter; }
static int counter;
};
int T::counter;
// test non-trivial
void
test02()
{
const int n = 5;
char* mem = new char[sizeof(T)*n];
T* p = reinterpret_cast<T*>(mem);
T* end = std::uninitialized_fill_n(p, n, T());
VERIFY( end = p + n );
VERIFY( T::counter == n );
delete[] mem;
}
int
main()
{
test01();
test02();
}
|
