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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <memory>
// template <class ForwardIterator, class T>
// void
// uninitialized_fill(ForwardIterator first, ForwardIterator last,
// const T& x);
#include <memory>
#include <cassert>
#include "test_macros.h"
struct B
{
static int count_;
static int population_;
int data_;
explicit B() : data_(1) { ++population_; }
B(const B &b) {
++count_;
if (count_ == 3)
TEST_THROW(1);
data_ = b.data_;
++population_;
}
~B() {data_ = 0; --population_; }
};
int B::count_ = 0;
int B::population_ = 0;
struct Nasty
{
Nasty() : i_ ( counter_++ ) {}
Nasty * operator &() const { return NULL; }
int i_;
static int counter_;
};
int Nasty::counter_ = 0;
int main()
{
{
const int N = 5;
char pool[sizeof(B)*N] = {0};
B* bp = (B*)pool;
assert(B::population_ == 0);
#ifndef TEST_HAS_NO_EXCEPTIONS
try
{
std::uninitialized_fill(bp, bp+N, B());
assert(false);
}
catch (...)
{
assert(B::population_ == 0);
}
#endif
B::count_ = 0;
std::uninitialized_fill(bp, bp+2, B());
for (int i = 0; i < 2; ++i)
assert(bp[i].data_ == 1);
assert(B::population_ == 2);
}
{
const int N = 5;
char pool[N*sizeof(Nasty)] = {0};
Nasty* bp = (Nasty*)pool;
Nasty::counter_ = 23;
std::uninitialized_fill(bp, bp+N, Nasty());
for (int i = 0; i < N; ++i)
assert(bp[i].i_ == 23);
}
}
|
