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
|
// Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/memory/ptr_util.h"
#include <stddef.h>
#include "testing/gtest/include/gtest/gtest.h"
namespace base {
namespace {
class DeleteCounter {
public:
DeleteCounter() { ++count_; }
~DeleteCounter() { --count_; }
static size_t count() { return count_; }
private:
static size_t count_;
};
size_t DeleteCounter::count_ = 0;
} // namespace
TEST(PtrUtilTest, WrapUnique) {
EXPECT_EQ(0u, DeleteCounter::count());
DeleteCounter* counter = new DeleteCounter;
EXPECT_EQ(1u, DeleteCounter::count());
std::unique_ptr<DeleteCounter> owned_counter = WrapUnique(counter);
EXPECT_EQ(1u, DeleteCounter::count());
owned_counter.reset();
EXPECT_EQ(0u, DeleteCounter::count());
}
TEST(PtrUtilTest, MakeUniqueScalar) {
auto s = MakeUnique<std::string>();
EXPECT_EQ("", *s);
auto s2 = MakeUnique<std::string>("test");
EXPECT_EQ("test", *s2);
}
TEST(PtrUtilTest, MakeUniqueScalarWithMoveOnlyType) {
using MoveOnly = std::unique_ptr<std::string>;
auto p = MakeUnique<MoveOnly>(MakeUnique<std::string>("test"));
EXPECT_EQ("test", **p);
}
TEST(PtrUtilTest, MakeUniqueArray) {
EXPECT_EQ(0u, DeleteCounter::count());
auto a = MakeUnique<DeleteCounter[]>(5);
EXPECT_EQ(5u, DeleteCounter::count());
a.reset();
EXPECT_EQ(0u, DeleteCounter::count());
}
#if 0
// TODO(dcheng): Move this into a nocompile test.
TEST(PtrUtilTest, MakeUniqueArrayWithKnownBounds) {
auto a = MakeUnique<DeleteCounter[1]>();
auto b = MakeUnique<DeleteCounter[1]>(1);
}
#endif
} // namespace base
|
