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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
//
// immer: immutable data structures for C++
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
//
// This software is distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
//
#ifndef BOX_T
#error "define the box template to use in BOX_T"
#endif
#include <catch2/catch.hpp>
TEST_CASE("construction and copy")
{
auto x = BOX_T<int>{};
CHECK(x == 0);
auto y = x;
CHECK(&x.get() == &y.get());
auto z = std::move(x);
CHECK(&z.get() == &y.get());
}
TEST_CASE("equality")
{
auto x = BOX_T<int>{};
auto y = x;
CHECK(x == 0.0f);
CHECK(x == y);
CHECK(x == BOX_T<int>{});
CHECK(x != BOX_T<int>{42});
}
struct counters
{
unsigned construct = 0;
unsigned copy = 0;
unsigned compare = 0;
static counters* p_;
struct scope
{
scope(counters* p)
{
assert(p == p_ || !p_);
p_ = p;
}
~scope() { p_ = nullptr; }
};
scope use() { return {this}; }
};
counters* counters::p_ = nullptr;
template <typename T>
struct spionage
{
T value = {};
spionage()
: value{}
{
++counters::p_->construct;
}
spionage(T v)
: value{v}
{
++counters::p_->construct;
}
spionage(const spionage& v)
: value{v.value}
{
++counters::p_->copy;
}
spionage(spionage&& v)
: value{std::move(v.value)}
{
++counters::p_->copy;
}
bool operator==(const spionage& b) const
{
++counters::p_->compare;
return value == b.value;
}
bool operator!=(const spionage& b) const
{
++counters::p_->compare;
return value != b.value;
}
bool operator==(const T& b) const
{
++counters::p_->compare;
return value == b;
}
bool operator!=(const T& b) const
{
++counters::p_->compare;
return value != b;
}
};
TEST_CASE("equality not too much construction")
{
auto c = counters{};
auto s = c.use();
auto x = BOX_T<spionage<int>>{};
auto y = x;
CHECK(x == 0.0f);
CHECK(x == y);
CHECK(c.copy == 0);
CHECK(c.construct == 1);
CHECK(x == BOX_T<spionage<int>>{});
CHECK(x != BOX_T<spionage<int>>{42});
CHECK(c.copy == 0);
CHECK(c.construct == 3);
}
TEST_CASE("update")
{
auto x = BOX_T<int>{};
auto y = x.update([](auto v) { return v + 1; });
CHECK(x == 0);
CHECK(y == 1);
}
TEST_CASE("update move")
{
auto x = BOX_T<int>{};
auto addr = &x.get();
auto y = std::move(x).update(
[](auto&& v) { return std::forward<decltype(v)>(v) + 1; });
CHECK(y == 1);
if (std::is_empty<typename BOX_T<int>::memory_policy::refcount>::value) {
CHECK(&y.get() != addr);
} else {
CHECK(&y.get() == addr);
}
}
|
