-
Notifications
You must be signed in to change notification settings - Fork 43
/
Copy pathArrayList_macros.mqh
463 lines (460 loc) · 45.8 KB
/
ArrayList_macros.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
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
/*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* https://github.com/Roffild/RoffildLibrary
*/
// Для сравнения этот файл проще разделить на два ;)
#define CArrayListInit(Type) \
class CArrayList_##Type \
{ \
protected: \
Type elements[]; \
int reserve; \
\
bool removeList(const Type &list[], bool saveOnlyList = false) \
{ \
int ltcount = ArraySize(list); \
if (ltcount == 0) { \
return false; \
} \
int elcount = ArraySize(elements); \
int last = 0; \
for (int x = 0; x < elcount && last < elcount; x++) { \
bool found = false; \
for (int y = ltcount-1; y > -1; y--) { \
if (elements[x] == list[y]) { \
found = true; \
break; \
} \
} \
if (found != saveOnlyList) { \
continue; \
} \
if (x > last) { \
elements[last] = elements[x]; \
} \
last++; \
} \
if (last < elcount) { \
ArrayResize(elements, last, reserve); \
return true; \
} \
return false; \
} \
\
public: \
CArrayList_##Type(int _reserve = 0) \
{ \
reserve = _reserve; \
} \
\
int getReserve() \
{ \
return reserve; \
} \
void setReserve(int _reserve) \
{ \
reserve = _reserve; \
} \
\
\ /// Appends the specified element to the end of this list.
bool add(const Type element) \
{ \
return add(ArraySize(elements), element); \
} \
\
\ /// Inserts the specified element at the specified position in this list.
bool add(int index, const Type element) \
{ \
if (index < 0) { \
return false; \
} \
\
int start = ArraySize(elements); \
if (ArrayResize(elements, start+1, reserve) > -1) { \
if (index < start) { \
for (int x = ArraySize(elements)-1; start > index; x--, start--) { \
elements[x] = elements[start-1]; \
} \
} \
elements[start] = element; \
return true; \
} \
return false; \
} \
\
\ /// Appends all of the elements in the specified collection to the end of this list.
bool addAll(const Type &list[]) \
{ \
return addAll(ArraySize(elements), list); \
} \
bool addAll(const CArrayList_##Type &list) \
{ \
return addAll(ArraySize(elements), list.elements); \
} \
\
\ /// Inserts all of the elements in the specified collection into this list,
\ /// starting at the specified position.
bool addAll(int index, const Type &list[]) \
{ \
if (index < 0) { \
return false; \
} \
\
int start = ArraySize(elements); \
int count = ArraySize(list); \
if (ArrayResize(elements, start + count, reserve) > -1) { \
if (index < start) { \
for (int x = ArraySize(elements)-1; start > index; x--, start--) { \
elements[x] = elements[start-1]; \
} \
} \
return ArrayCopy(elements, list, start) > 0; \
} \
return false; \
} \
bool addAll(int index, const CArrayList_##Type &list) \
{ \
return addAll(index, list.elements); \
} \
\
\ /// Removes all of the elements from this list.
void clear() \
{ \
ArrayResize(elements, 0, reserve); \
} \
\
\ /// Returns a shallow copy of this ArrayList instance.
\ //Object clone()
\
\ /// Returns true if this list contains the specified element.
bool contains(const Type o) \
{ \
return indexOf(o) > -1; \
} \
\
\ /// Increases the capacity of this ArrayList instance, if necessary,
\ /// to ensure that it can hold at least the number of elements
\ /// specified by the minimum capacity argument.
\ //void ensureCapacity(int minCapacity)
\
\ /// Performs the given action for each element of the Iterable until all elements
\ /// have been processed or the action throws an exception.
\ //void forEach(Consumer<? super E> action)
\
\ /// Returns the element at the specified position in this list.
Type get(int index) \
{ \
return elements[index]; \
} \
Type operator[](int index) \
{ \
return get(index); \
} \
\
\ /// Replaces the element at the specified position in this list with the specified element.
Type set(int index, const Type element) \
{ \
Type oldvalue = get(index); \
elements[index] = element; \
return oldvalue; \
} \
\
\ /// Returns the index of the first occurrence of the specified element in this list,
\ /// or -1 if this list does not contain the element.
int indexOf(const Type o) \
{ \
int count = ArraySize(elements); \
for (int x = 0; x < count; x++) { \
if (elements[x] == o) { \
return x; \
} \
} \
return -1; \
} \
\
\ /// Returns the index of the last occurrence of the specified element in this list,
\ /// or -1 if this list does not contain the element.
int lastIndexOf(const Type o) \
{ \
int count = ArraySize(elements); \
for (int x = count-1; x > -1; x--) { \
if (elements[x] == o) { \
return x; \
} \
} \
return -1; \
} \
\
\ /// Returns true if this list contains no elements.
bool isEmpty() \
{ \
return ArraySize(elements) == 0; \
} \
\
\ /// Removes the element at the specified position in this list.
Type remove(int index) \
{ \
int count = ArraySize(elements); \
if (index < 0) { \
return NULL; \
} \
Type oldvalue = set(index, NULL); \
if (index < count-1) { \
ArrayCopy(elements, elements, index, index+1); \
} \
ArrayResize(elements, count-1, reserve); \
return oldvalue; \
} \
\
\ /// Removes the first occurrence of the specified element from this list, if it is present.
bool removeFirst(const Type o) \
{ \
int index = indexOf(o); \
if (index == -1) { \
return false; \
} \
remove(index); \
return true; \
} \
\
\ /// Removes from this list all of its elements that are contained in the specified collection.
bool removeAll(const Type &list[]) \
{ \
return removeList(list, false); \
} \
\
\ /// Retains only the elements in this list that are contained in the specified collection.
bool retainAll(const Type &list[]) \
{ \
return removeList(list, true); \
} \
\
\ /// Removes all of the elements of this collection that satisfy the given predicate.
\ //bool removeIf(Predicate<? super E> filter)
\
\ /// Removes from this list all of the elements whose index is between fromIndex,
\ /// inclusive, and toIndex, exclusive.
\ //protected void removeRange(int fromIndex, int toIndex)
\
\ /// Replaces each element of this list with the result of applying the operator to that element.
\ //void replaceAll(UnaryOperator<E> operator)
\
\ /// Returns the number of elements in this list.
int size() \
{ \
return ArraySize(elements); \
} \
\
\ /// Sorts this list according to the order induced by the specified Comparator.
\ //void sort(Comparator<? super E> c)
\
int subList(Type &dst_array[], int dst_start = 0, int src_start = 0, int count = WHOLE_ARRAY) \
{ \
return ArrayCopy(dst_array, elements, dst_start, src_start, count); \
} \
\
\ /// Returns an array containing all of the elements in this list in proper sequence
\ /// (from first to last element).
void toArray(Type &dst_array[]) \
{ \
ArrayCopy(dst_array, elements); \
} \
};
#define CArrayListClassInit(Type) \
class CArrayListClass_##Type \
{ \
protected: \
Type *elements[]; \
int reserve; \
bool use_delete; \
\
\ // Всё, что требует сравнение классов мне сейчас не нужно...
\ //bool removeList(const Type *&list[], bool saveOnlyList = false)
\ //{
\ // if (elements[x].compare(list[y])) {
\ //}
\
public: \
CArrayListClass_##Type(bool _use_delete = true, int _reserve = 0) \
{ \
reserve = _reserve; \
use_delete = _use_delete; \
} \
\
~CArrayListClass_##Type() \
{ \
clear(); \
} \
\
int getReserve() \
{ \
return reserve; \
} \
void setReserve(int _reserve) \
{ \
reserve = _reserve; \
} \
\
bool getUseDelete() \
{ \
return use_delete; \
} \
void setUseDelete(bool _use_delete) \
{ \
use_delete = _use_delete; \
} \
\
\ /// Appends the specified element to the end of this list.
bool add(Type *element) \
{ \
return add(ArraySize(elements), element); \
} \
\
\ /// Inserts the specified element at the specified position in this list.
bool add(int index, Type *element) \
{ \
if (index < 0) { \
return false; \
} \
\
int start = ArraySize(elements); \
if (ArrayResize(elements, start+1, reserve) > -1) { \
if (index < start) { \
for (int x = ArraySize(elements)-1; start > index; x--, start--) { \
elements[x] = elements[start-1]; \
} \
} \
elements[start] = element; \
return true; \
} \
return false; \
} \
\
\ /// Appends all of the elements in the specified collection to the end of this list.
bool addAll(const Type *&list[]) \
{ \
return addAll(ArraySize(elements), list); \
} \
bool addAll(const CArrayListClass_##Type &list) \
{ \
return addAll(ArraySize(elements), list); \
} \
\
\ /// Inserts all of the elements in the specified collection into this list,
\ /// starting at the specified position.
bool addAll(int index, const Type *&list[]) \
{ \
if (index < 0) { \
return false; \
} \
\
int start = ArraySize(elements); \
int count = ArraySize(list); \
if (ArrayResize(elements, start + count, reserve) > -1) { \
if (index < start) { \
for (int x = ArraySize(elements)-1; start > index; x--, start--) { \
elements[x] = elements[start-1]; \
} \
} \
return ArrayCopy(elements, list, start) > 0; \
} \
return false; \
} \
bool addAll(int index, const CArrayListClass_##Type &list) \
{ \
return addAll(index, list); \
} \
\
\ /// Removes all of the elements from this list.
void clear() \
{ \
if (use_delete) { \
for (int x = ArraySize(elements) - 1; x > -1; x--) { \
delete(elements[x]); \
} \
} \
ArrayResize(elements, 0, reserve); \
} \
\
\ /// Returns a shallow copy of this ArrayList instance.
\ //Object clone()
\
\ /// Increases the capacity of this ArrayList instance, if necessary,
\ /// to ensure that it can hold at least the number of elements
\ /// specified by the minimum capacity argument.
\ //void ensureCapacity(int minCapacity)
\
\ /// Performs the given action for each element of the Iterable until all elements
\ /// have been processed or the action throws an exception.
\ //void forEach(Consumer<? super E> action)
\
\ /// Returns the element at the specified position in this list.
Type* get(int index) \
{ \
return elements[index]; \
} \
Type* operator[](int index) \
{ \
return get(index); \
} \
\
\ /// Replaces the element at the specified position in this list with the specified element.
void set(int index, Type *element) \
{ \
if (use_delete) { \
delete(get(index)); \
} \
elements[index] = element; \
} \
\
\ /// Returns true if this list contains no elements.
bool isEmpty() \
{ \
return ArraySize(elements) == 0; \
} \
\
\ /// Removes the element at the specified position in this list.
void remove(int index) \
{ \
int count = ArraySize(elements); \
if (index < 0) { \
return; \
} \
if (use_delete) { \
delete(get(index)); \
} \
if (index < count-1) { \
ArrayCopy(elements, elements, index, index+1); \
} \
ArrayResize(elements, count-1, reserve); \
} \
\
\ /// Returns the number of elements in this list.
int size() \
{ \
return ArraySize(elements); \
} \
\
int subList(Type *&dst_array[], int dst_start = 0, int src_start = 0, int count = WHOLE_ARRAY) \
{ \
return ArrayCopy(dst_array, elements, dst_start, src_start, count); \
} \
\
\ /// Returns an array containing all of the elements in this list in proper sequence
\ /// (from first to last element).
void toArray(Type *&dst_array[]) \
{ \
ArrayCopy(dst_array, elements); \
} \
};