blob: cfb5f04ea1b90de6ec720e8080faf70e20b59e53 (
plain) (
blame)
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
|
//
// 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 <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});
}
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);
}
}
|
