forked from AliceO2Group/AliceO2
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_observer_ptr.cxx
More file actions
133 lines (117 loc) · 2.87 KB
/
test_observer_ptr.cxx
File metadata and controls
133 lines (117 loc) · 2.87 KB
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
// Copyright CERN and copyright holders of ALICE O2. This software is
// distributed under the terms of the GNU General Public License v3 (GPL
// Version 3), copied verbatim in the file "COPYING".
//
// See http://alice-o2.web.cern.ch/license for full licensing information.
//
// In applying this license CERN does not waive the privileges and immunities
// granted to it by virtue of its status as an Intergovernmental Organization
// or submit itself to any jurisdiction.
#define BOOST_TEST_MODULE Test observer_ptr
#define BOOST_TEST_MAIN
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include <functional>
#include "MemoryResources/observer_ptr.h"
/// exclude from doxygen, TODO: we might want to do this on a higher level
/// because of doxygen's autolinking of references, all 'A' are displayed as
/// reference to this struct.
/// @cond
struct A {
int i{2};
int get() const { return i; }
};
BOOST_AUTO_TEST_CASE(observer_ptr_A)
{
using namespace o2;
A t;
int i{1};
{
observer_ptr<int> p{nullptr};
BOOST_CHECK(p == nullptr);
}
{
observer_ptr<int> p;
BOOST_CHECK(p == nullptr);
}
{
observer_ptr<int> b{&i};
observer_ptr<void> a(b);
BOOST_CHECK(a == b);
}
{
observer_ptr<int> b{&i};
observer_ptr<int> a(b);
BOOST_CHECK(a == b);
}
{
const observer_ptr<int> b{&i};
observer_ptr<int> a(b);
BOOST_CHECK(a == b);
}
{
observer_ptr<A> pt{&t};
A* ptt = pt.release();
BOOST_CHECK(ptt == &t);
BOOST_CHECK(pt == nullptr);
}
{
observer_ptr<A> p{&t};
p.reset();
BOOST_CHECK(p == nullptr);
p.reset(&t);
BOOST_CHECK(p.get() == &t);
}
{
A tt{4};
observer_ptr<A> pp{&tt};
observer_ptr<A> p{&t};
p.swap(pp);
BOOST_CHECK(p->get() == 4 && pp->get() == 2);
p.swap(nullptr);
BOOST_CHECK(p == nullptr);
std::swap(p, pp);
BOOST_CHECK(pp == nullptr);
BOOST_CHECK(p->get() == 2);
}
{
observer_ptr<A> p{&t};
BOOST_CHECK(p.get() == &t);
}
{
observer_ptr<A> p{&t};
BOOST_CHECK((*p).i == 2);
}
{
observer_ptr<A> p;
p = &t;
BOOST_CHECK(p.get() == &t);
observer_ptr<A> pp;
pp = p;
BOOST_CHECK(pp.get() == &t);
}
//comparisons
{
A tt{4};
observer_ptr<A> pp{&tt};
observer_ptr<A> p{&t};
observer_ptr<A> p_{&t};
observer_ptr<A> n{nullptr};
BOOST_CHECK(p != pp);
BOOST_CHECK(p == p_);
BOOST_CHECK(p != nullptr);
BOOST_CHECK(n == nullptr);
BOOST_CHECK((&tt > &t) ? pp > p : p > pp);
BOOST_CHECK((&tt < &t) ? pp < p : p < pp);
BOOST_CHECK((&tt >= &t) ? pp >= p : p >= pp);
BOOST_CHECK((&tt <= &t) ? pp <= p : p <= pp);
BOOST_CHECK((&t >= &t) ? p >= p : p >= p);
BOOST_CHECK((&t <= &t) ? p <= p : p <= p);
}
//hash
{
observer_ptr<int> p{&i};
BOOST_CHECK(std::hash<o2::observer_ptr<int>>()(p) == std::hash<int*>()(p.get()));
}
}
// @endcond