2010-08-22 02:59:46 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2010-11-16 23:09:02 +01:00
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
2010-08-22 02:59:46 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <memory>
|
|
|
|
|
|
|
|
// unique_ptr
|
|
|
|
|
|
|
|
// Test unique_ptr converting move assignment
|
|
|
|
|
|
|
|
#include <memory>
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
#include "../deleter.h"
|
|
|
|
|
|
|
|
struct A
|
|
|
|
{
|
|
|
|
static int count;
|
|
|
|
A() {++count;}
|
|
|
|
A(const A&) {++count;}
|
|
|
|
virtual ~A() {--count;}
|
|
|
|
};
|
|
|
|
|
|
|
|
int A::count = 0;
|
|
|
|
|
|
|
|
struct B
|
|
|
|
: public A
|
|
|
|
{
|
|
|
|
static int count;
|
|
|
|
B() {++count;}
|
|
|
|
B(const B&) {++count;}
|
|
|
|
virtual ~B() {--count;}
|
|
|
|
};
|
|
|
|
|
|
|
|
int B::count = 0;
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
boost::unique_ptr<B[], Deleter<B> > s(new B);
|
|
|
|
A* p = s.get();
|
|
|
|
boost::unique_ptr<A[], Deleter<A> > s2(new A);
|
|
|
|
assert(A::count == 2);
|
|
|
|
s2 = (boost::move(s));
|
|
|
|
assert(s2.get() == p);
|
|
|
|
assert(s.get() == 0);
|
|
|
|
assert(A::count == 1);
|
|
|
|
assert(B::count == 1);
|
|
|
|
assert(s2.get_deleter().state() == 5);
|
|
|
|
assert(s.get_deleter().state() == 0);
|
|
|
|
}
|
|
|
|
assert(A::count == 0);
|
|
|
|
assert(B::count == 0);
|
|
|
|
}
|