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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
// Copyright (C) 2016 Jochen Becher
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#pragma once
#include "handle.h"
#include "qmt/infrastructure/qmtassert.h"
#include <QList>
#include <QHash>
namespace qmt {
template<typename T>
class Handles
{
public:
typedef QList<Handle<T>> value_type;
typedef typename value_type::iterator iterator;
typedef typename value_type::const_iterator const_iterator;
explicit Handles(bool takeOwnership = false) : m_takesOwnership(takeOwnership) { }
Handles(const Handles<T> &rhs)
: m_handleList(rhs.m_handleList)
{
}
Handles(const Handles<T> &rhs, bool takeOwnership)
: m_handleList(rhs.m_handleList),
m_takesOwnership(takeOwnership)
{
if (m_takesOwnership && rhs.m_takesOwnership)
const_cast<Handles<T> &>(rhs).m_handleList.clear();
}
~Handles()
{
reset();
}
Handles<T> operator=(const Handles<T> &rhs)
{
if (this != &rhs) {
m_handleList = rhs.m_handleList;
if (m_takesOwnership && rhs.m_takesOwnership)
const_cast<Handles<T> &>(rhs).m_handleList.clear();
}
return *this;
}
bool takesOwnership() const { return m_takesOwnership; }
bool isEmpty() const { return m_handleList.empty(); }
int size() const { return m_handleList.size(); }
bool contains(const Uid &uid) const
{
for (const Handle<T> &handle : std::as_const(m_handleList)) {
if (handle.uid() == uid)
return true;
}
return false;
}
bool contains(const T *t) const
{
QMT_ASSERT(t, return false);
return contains(t->uid());
}
T *find(const Uid &uid) const
{
for (const Handle<T> &handle : std::as_const(m_handleList)) {
if (handle.uid() == uid)
return handle.target();
}
return nullptr;
}
T *at(int index) const
{
QMT_ASSERT(index >= 0 && index < m_handleList.size(), return nullptr);
return m_handleList.at(index).target();
}
T *at(int index)
{
QMT_ASSERT(index >= 0 && index < m_handleList.size(), return nullptr);
return m_handleList.at(index);
}
int indexOf(const Uid &uid) const
{
int index = 0;
for (const Handle<T> &handle : std::as_const(m_handleList)) {
if (handle.uid() == uid)
return index;
++index;
}
return -1;
}
int indexOf(const T *t) const
{
QMT_ASSERT(t, return -1);
return indexOf(t->uid());
}
const value_type &get() const { return m_handleList; }
value_type take()
{
value_type handles = m_handleList;
m_handleList.clear();
return handles;
}
void set(const value_type &handles) {
reset();
m_handleList = handles;
}
void reset()
{
if (m_takesOwnership) {
for (const Handle<T> &handle : std::as_const(m_handleList))
delete handle.target();
}
m_handleList.clear();
}
iterator begin() { return m_handleList.begin(); }
iterator end() { return m_handleList.end(); }
const_iterator begin() const { return m_handleList.begin(); }
const_iterator end() const { return m_handleList.end(); }
void add(const Uid &uid)
{
QMT_CHECK(uid.isValid());
m_handleList.append(Handle<T>(uid));
}
void add(T *t)
{
QMT_ASSERT(t, return);
m_handleList.append(Handle<T>(t));
}
void insert(int beforeIndex, const Uid &uid)
{
QMT_ASSERT(beforeIndex >= 0 && beforeIndex <= m_handleList.size(), return);
QMT_ASSERT(uid.isValid(), return);
m_handleList.insert(beforeIndex, Handle<T>(uid));
}
void insert(int beforeIndex, T *t)
{
QMT_ASSERT(beforeIndex >= 0 && beforeIndex <= m_handleList.size(), return);
QMT_ASSERT(t, return);
m_handleList.insert(beforeIndex, Handle<T>(t));
}
void remove(int index)
{
QMT_ASSERT(index >= 0 && index < size(), return);
if (m_takesOwnership) {
T *t = m_handleList.at(index).target();
m_handleList.removeAt(index);
delete t;
} else {
m_handleList.removeAt(index);
}
}
void remove(const Uid &uid)
{
remove(indexOf(uid));
}
void remove(T *t)
{
QMT_ASSERT(t, return);
remove(indexOf(t));
}
T * take(int index)
{
QMT_ASSERT(index >= 0 && index < size(), return nullptr);
T *t = m_handleList.at(index).target();
m_handleList.removeAt(index);
return t;
}
T *take(const Uid &uid)
{
return take(indexOf(uid));
}
T *take(T *t)
{
QMT_ASSERT(t, return nullptr);
return take(indexOf(t));
}
friend bool operator==(const Handles<T> &lhs, const Handles<T> &rhs)
{
return lhs.get() == rhs.get();
}
friend bool operator!=(const Handles &lhs, const Handles &rhs) { return !(lhs == rhs); }
private:
value_type m_handleList;
bool m_takesOwnership = false;
};
} // namespace qmt
|
