forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
121 lines
3.6 KiB
C++
121 lines
3.6 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UNSUPPORTED: c++98, c++03
|
|
|
|
// <memory>
|
|
|
|
// unique_ptr
|
|
|
|
// Test unique_ptr move assignment
|
|
|
|
// test move assignment. Should only require a MoveConstructible deleter, or if
|
|
// deleter is a reference, not even that.
|
|
|
|
#include <memory>
|
|
#include <utility>
|
|
#include <cassert>
|
|
|
|
#include "deleter_types.h"
|
|
#include "unique_ptr_test_helper.h"
|
|
|
|
struct GenericDeleter {
|
|
void operator()(void*) const;
|
|
};
|
|
|
|
template <bool IsArray>
|
|
void test_basic() {
|
|
typedef typename std::conditional<IsArray, A[], A>::type VT;
|
|
const int expect_alive = IsArray ? 5 : 1;
|
|
{
|
|
std::unique_ptr<VT> s1(newValue<VT>(expect_alive));
|
|
A* p = s1.get();
|
|
std::unique_ptr<VT> s2(newValue<VT>(expect_alive));
|
|
assert(A::count == (expect_alive * 2));
|
|
s2 = std::move(s1);
|
|
assert(A::count == expect_alive);
|
|
assert(s2.get() == p);
|
|
assert(s1.get() == 0);
|
|
}
|
|
assert(A::count == 0);
|
|
{
|
|
std::unique_ptr<VT, Deleter<VT> > s1(newValue<VT>(expect_alive),
|
|
Deleter<VT>(5));
|
|
A* p = s1.get();
|
|
std::unique_ptr<VT, Deleter<VT> > s2(newValue<VT>(expect_alive));
|
|
assert(A::count == (expect_alive * 2));
|
|
s2 = std::move(s1);
|
|
assert(s2.get() == p);
|
|
assert(s1.get() == 0);
|
|
assert(A::count == expect_alive);
|
|
assert(s2.get_deleter().state() == 5);
|
|
assert(s1.get_deleter().state() == 0);
|
|
}
|
|
assert(A::count == 0);
|
|
{
|
|
CDeleter<VT> d1(5);
|
|
std::unique_ptr<VT, CDeleter<VT>&> s1(newValue<VT>(expect_alive), d1);
|
|
A* p = s1.get();
|
|
CDeleter<VT> d2(6);
|
|
std::unique_ptr<VT, CDeleter<VT>&> s2(newValue<VT>(expect_alive), d2);
|
|
s2 = std::move(s1);
|
|
assert(s2.get() == p);
|
|
assert(s1.get() == 0);
|
|
assert(A::count == expect_alive);
|
|
assert(d1.state() == 5);
|
|
assert(d2.state() == 5);
|
|
}
|
|
assert(A::count == 0);
|
|
}
|
|
|
|
template <bool IsArray>
|
|
void test_sfinae() {
|
|
typedef typename std::conditional<IsArray, int[], int>::type VT;
|
|
{
|
|
typedef std::unique_ptr<VT> U;
|
|
static_assert(!std::is_assignable<U, U&>::value, "");
|
|
static_assert(!std::is_assignable<U, const U&>::value, "");
|
|
static_assert(!std::is_assignable<U, const U&&>::value, "");
|
|
static_assert(std::is_nothrow_assignable<U, U&&>::value, "");
|
|
}
|
|
{
|
|
typedef std::unique_ptr<VT, GenericDeleter> U;
|
|
static_assert(!std::is_assignable<U, U&>::value, "");
|
|
static_assert(!std::is_assignable<U, const U&>::value, "");
|
|
static_assert(!std::is_assignable<U, const U&&>::value, "");
|
|
static_assert(std::is_nothrow_assignable<U, U&&>::value, "");
|
|
}
|
|
{
|
|
typedef std::unique_ptr<VT, NCDeleter<VT>&> U;
|
|
static_assert(!std::is_assignable<U, U&>::value, "");
|
|
static_assert(!std::is_assignable<U, const U&>::value, "");
|
|
static_assert(!std::is_assignable<U, const U&&>::value, "");
|
|
static_assert(std::is_nothrow_assignable<U, U&&>::value, "");
|
|
}
|
|
{
|
|
typedef std::unique_ptr<VT, const NCDeleter<VT>&> U;
|
|
static_assert(!std::is_assignable<U, U&>::value, "");
|
|
static_assert(!std::is_assignable<U, const U&>::value, "");
|
|
static_assert(!std::is_assignable<U, const U&&>::value, "");
|
|
static_assert(std::is_nothrow_assignable<U, U&&>::value, "");
|
|
}
|
|
}
|
|
|
|
|
|
int main() {
|
|
{
|
|
test_basic</*IsArray*/ false>();
|
|
test_sfinae<false>();
|
|
}
|
|
{
|
|
test_basic</*IsArray*/ true>();
|
|
test_sfinae<true>();
|
|
}
|
|
}
|