forked from EA31337/EA31337-classes
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Refs.mqh
329 lines (280 loc) · 7.1 KB
/
Refs.mqh
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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
//+------------------------------------------------------------------+
//| EA31337 framework |
//| Copyright 2016-2019, 31337 Investments Ltd |
//| https://github.com/EA31337 |
//+------------------------------------------------------------------+
/*
* This file is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
// Prevents processing this includes file for the second time.
#ifndef REFS_MQH
#define REFS_MQH
/**
* For explanation about difference between strong(Ref) and weak(WeakRef) references please look at:
* @see https://medium.com/@elliotchance/strong-vs-weak-references-70356d37dfd2
*
*
*
* Usage:
*
* class Node : public Dynamic {
*
* protected:
*
* WeakRef<Node> parentNode;
* Dict<Ref<Node>> childNodes;
*
* public:
*
* void AddChild(Node* _node) {
* _node.parentNode = this;
*
* Ref<Node> ref = _node;
* childNodes.Push(ref);
* }
* };
*
*
* Ref<Node> root = new Node();
*
* Ref<Node> child1 = new Node();
* Ref<Node> child2 = new Node();
*
* root.childNodes.Push(child1);
* root.childNodes.Push(child2);
*/
class Dynamic;
class ReferenceCounter {
public:
/**
* Number of weak references to target object.
*/
unsigned int num_weak_refs;
/**
* Number of strong references to target object.
*/
unsigned int num_strong_refs;
/**
* Target object pointer.
*/
Dynamic* ptr_object;
/**
* Whether object has been deleted (but still have weak references).
*/
bool deleted;
/**
* Constructor.
*/
ReferenceCounter() {
num_weak_refs = 0;
num_strong_refs = 0;
ptr_object = NULL;
deleted = false;
}
/**
* ReferenceCounter class allocator.
*/
static ReferenceCounter* alloc() {
// @todo Enhance with linked-list object reuse.
return new ReferenceCounter();
}
};
/**
* Class used to hold strong reference to reference-counted object.
*/
template <typename X>
struct Ref {
/**
* Pointer to target object.
*/
X* ptr_object;
public:
/**
* Constructor.
*/
Ref(X* _ptr) { this = _ptr; }
/**
* Constructor.
*/
Ref(Ref<X>& ref) { this = ref.Ptr(); }
/**
* Constructor.
*/
Ref(WeakRef<X>& ref) { this = ref.Ptr(); }
/**
* Destructor.
*/
Ref() { ptr_object = NULL; }
/**
* Destructor.
*/
~Ref() { Unset(); }
/**
* Returns pointer to target object.
*/
X* Ptr() { return ptr_object; }
/**
* Unbinds holding reference.
*/
void Unset() {
if (ptr_object != NULL) {
// Dropping strong reference.
if (!--ptr_object.ptr_ref_counter.num_strong_refs) {
// No more strong references.
if (!ptr_object.ptr_ref_counter.num_weak_refs) {
// Also no more weak references.
delete ptr_object.ptr_ref_counter;
} else {
// Object becomes deleted, but there are some weak references.
ptr_object.ptr_ref_counter.deleted = true;
}
// Avoiding delete loop for cyclic references.
X* ptr_to_delete = ptr_object;
// Avoiding double deletion in Dynamic's destructor.
ptr_object.ptr_ref_counter = NULL;
ptr_object = NULL;
delete ptr_to_delete;
}
ptr_object = NULL;
}
}
/**
* Makes a strong reference to the given object.
*/
void operator=(X* _ptr) {
if (ptr_object == _ptr) {
// Assigning the same object.
return;
}
Unset();
ptr_object = _ptr;
if (ptr_object != NULL) ++ptr_object.ptr_ref_counter.num_strong_refs;
}
/**
* Makes a strong reference to the given weakly-referenced object.
*/
void operator=(WeakRef<X>& right) { this = right.Ptr(); }
/**
* Makes a strong reference to the strongly-referenced object.
*/
void operator=(Ref<X>& right) { this = right.Ptr(); }
};
/**
* Class used to hold weak reference to reference-counted object.
*/
template <typename X>
struct WeakRef {
/**
* Pointer to object holding reference counts.
*/
ReferenceCounter* ptr_ref_counter;
public:
/**
* Constructor.
*/
WeakRef(X* _ptr = NULL) { this = _ptr; }
/**
* Constructor.
*/
WeakRef(WeakRef<X>& ref) { this = ref.Ptr(); }
/**
* Constructor.
*/
WeakRef(Ref<X>& ref) { this = ref.Ptr(); }
/**
* Destructor.
*/
~WeakRef() { Unset(); }
bool ObjectExists() { return ptr_ref_counter != NULL && !ptr_ref_counter.deleted; }
X* Ptr() { return ObjectExists() ? (X*)ptr_ref_counter.ptr_object : NULL; }
/**
* Makes a strong reference to the given object.
*/
void operator=(X* _ptr) {
if (ptr_ref_counter == (_ptr == NULL ? NULL : _ptr.ptr_ref_counter)) {
// Assigning the same object or the same NULL.
return;
}
Unset();
if (_ptr == NULL) {
// Assigning NULL.
return;
}
if (_ptr.ptr_ref_counter.deleted) {
// Assigning already deleted object.
ptr_ref_counter = NULL;
return;
}
ptr_ref_counter = _ptr.ptr_ref_counter;
++ptr_ref_counter.num_weak_refs;
}
/**
* Makes a weak reference to the given weakly-referenced object.
*/
void operator=(WeakRef<X>& right) { this = right.Ptr(); }
/**
* Makes a weak reference to the strongly-referenced object.
*/
void operator=(Ref<X>& right) { this = right.Ptr(); }
/**
* Unbinds holding reference.
*/
void Unset() {
if (ptr_ref_counter != NULL) {
// Dropping weak reference.
if (!--ptr_ref_counter.num_weak_refs) {
// No more weak references.
if (!ptr_ref_counter.num_strong_refs) {
// There are also no strong references.
if (!ptr_ref_counter.deleted) {
// It is safe to delete object and reference counter object.
// Avoiding double deletion in Dynamic's destructor.
ptr_ref_counter.ptr_object.ptr_ref_counter = NULL;
delete ptr_ref_counter.ptr_object;
}
delete ptr_ref_counter;
}
}
}
ptr_ref_counter = NULL;
}
};
/**
* Base class for reference-counted objects.
*/
class Dynamic {
public:
/**
* Pointer to object holding reference counts.
*/
ReferenceCounter* ptr_ref_counter;
/**
* Constructor.
*/
Dynamic() {
ptr_ref_counter = ReferenceCounter::alloc();
ptr_ref_counter.ptr_object = &this;
}
/**
* Destructor.
*/
~Dynamic() {
if (ptr_ref_counter != NULL && ptr_ref_counter.num_strong_refs == 0 && ptr_ref_counter.num_weak_refs == 0) {
// Object never been referenced.
delete ptr_ref_counter;
}
}
};
#endif