generic-library/cxx
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Implement LWG2433: uninitialized_copy()/etc. should tolerate overloaded operator&

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@237699 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Marshall Clow
2015-05-19 15:01:48 +00:00
parent 02be74588a
commit 5dce73dd6e
6 changed files with 102 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
test/std/utilities/memory/specialized.algorithms/uninitialized.copy/uninitialized_copy.pass.cpp
View File

@@ -28,8 +28,19 @@ struct B
int B::count_ = 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;
@@ -48,4 +59,17 @@ int main()
std::uninitialized_copy(b, b+2, bp);
for (int i = 0; i < 2; ++i)
assert(bp[i].data_ == 1);
}
{
const int N = 5;
char pool[sizeof(Nasty)*N] = {0};
Nasty * p = (Nasty *) pool;
Nasty arr[N];
std::uninitialized_copy(arr, arr+N, p);
for (int i = 0; i < N; ++i) {
assert(arr[i].i_ == i);
assert( p[i].i_ == i);
}
}
}

23
test/std/utilities/memory/specialized.algorithms/uninitialized.copy/uninitialized_copy_n.pass.cpp
View File

@@ -28,8 +28,19 @@ struct B
int B::count_ = 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;
@@ -48,4 +59,16 @@ int main()
std::uninitialized_copy_n(b, 2, bp);
for (int i = 0; i < 2; ++i)
assert(bp[i].data_ == 1);
}
{
const int N = 5;
char pool[sizeof(Nasty)*N] = {0};
Nasty * p = (Nasty *) pool;
Nasty arr[N];
std::uninitialized_copy_n(arr, N, p);
for (int i = 0; i < N; ++i) {
assert(arr[i].i_ == i);
assert( p[i].i_ == i);
}
}
}

25
test/std/utilities/memory/specialized.algorithms/uninitialized.fill.n/uninitialized_fill_n.pass.cpp
View File

@@ -27,8 +27,19 @@ struct B
int B::count_ = 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;
@@ -47,4 +58,18 @@ int main()
assert(r == bp + 2);
for (int i = 0; i < 2; ++i)
assert(bp[i].data_ == 1);
}
{
{
const int N = 5;
char pool[N*sizeof(Nasty)] = {0};
Nasty* bp = (Nasty*)pool;
Nasty::counter_ = 23;
std::uninitialized_fill_n(bp, N, Nasty());
for (int i = 0; i < N; ++i)
assert(bp[i].i_ == 23);
}
}
}

22
test/std/utilities/memory/specialized.algorithms/uninitialized.fill/uninitialized_fill.pass.cpp
View File

@@ -28,8 +28,19 @@ struct B
int B::count_ = 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;
@@ -47,4 +58,15 @@ int main()
std::uninitialized_fill(bp, bp+2, B());
for (int i = 0; i < 2; ++i)
assert(bp[i].data_ == 1);
}
{
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);
}
}