forked from EA31337/EA31337-classes
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Collection.mqh
213 lines (191 loc) · 4.87 KB
/
Collection.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
//+------------------------------------------------------------------+
//| EA31337 framework |
//| Copyright 2016-2020, 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 COLLECTION_MQH
#define COLLECTION_MQH
// Includes.
#include "Object.mqh"
/**
* Class to deal with collection of objects.
*/
template<typename X>
class Collection {
protected:
// Variables.
string name;
int index;
Ref<X> data[];
public:
/**
* Class constructor.
*/
Collection() {}
Collection(string _name) : name(_name) {}
Collection(void *_obj) { Add(_obj); }
~Collection() {
}
/* Setters */
/**
* Add the object into the collection.
*/
X *Add(X *_object) {
int _size = ArraySize(data);
int _count = ArrayResize(data, _size + 1, 100);
if (_count > 0) {
data[_size] = _object;
} else {
PrintFormat("ERROR at %s(): Cannot resize array!", __FUNCTION__);
}
return _count > 0 ? _object : NULL;
}
/* Getters */
/**
* Returns pointer to the collection item.
*/
X *Get(X *_object) {
if (_object != NULL) {
int i;
for (i = 0; i < ArraySize(data); i++) {
if (_object == data[i].Ptr()) {
return data[i].Ptr();
}
}
return Add(_object);
}
return NULL;
}
/**
* Returns pointer to the first valid object.
*/
void *GetFirstItem() {
int i;
for (i = 0; i < ArraySize(data); i++) {
if (data[i].Ptr() != NULL) {
index = i;
return data[i].Ptr();
}
}
return NULL;
}
/**
* Returns pointer to the current object.
*/
X* GetCurrentItem() { return data[index].Ptr() != NULL ? data[index].Ptr() : NULL; }
/**
* Returns ID of the current object.
*/
int GetCurrentIndex() { return index; }
/**
* Returns pointer to the next valid object.
*/
X *GetNextItem() {
int i;
for (i = ++index; i < ArraySize(data); i++) {
if (data[i].Ptr() != NULL) {
index = i;
return data[i].Ptr();
}
}
return NULL;
}
/**
* Returns pointer to the last valid object.
*/
X *GetLastItem() {
int i;
for (i = ArraySize(data) - 1; i >= 0; i--) {
if (data[i].Ptr() != NULL) {
return data[i].Ptr();
}
}
return NULL;
}
/**
* Returns object item by array index.
*/
X *GetByIndex(int _index) { return data[_index].Ptr(); }
/**
* Returns object item by object id.
*/
X *GetById(long _id) {
int i;
X *_object = GetSize() > 0 ? data[0].Ptr() : NULL;
for (i = 0; i < ArraySize(data); i++) {
if (data[i].Ptr().GetId() == _id) {
_object = data[i].Ptr();
}
}
return _object;
}
/**
* Returns pointer to the collection item with the lowest weight.
*/
X *GetLowest() {
int i;
X *_object = GetSize() > 0 ? data[0].Ptr() : NULL;
for (i = 0; i < ArraySize(data); i++) {
double _weight = data[i].Ptr().GetWeight();
if (_weight < _object.GetWeight()) {
_object = data[i].Ptr();
}
}
return _object;
}
/**
* Returns pointer to the collection item with the highest weight.
*/
X *GetHighest() {
int i;
X *_object = GetSize() > 0 ? data[0].Ptr() : NULL;
for (i = 0; i < ArraySize(data); i++) {
double _weight = data[i].Ptr().GetWeight();
if (_weight > _object.GetWeight()) {
_object = data[i].Ptr();
}
}
return _object;
}
/**
* Returns name of the collection.
*/
string GetName() { return name; }
/**
* Returns size of the collection.
*/
int GetSize() { return ArraySize(data); }
/* Printers */
/**
* Fetch object textual data by calling each ToString() method.
*/
string ToString(double _min_weight = 0, string _dlm = ";") {
int i;
string _out = name + ": ";
for (i = 0; i < ArraySize(data); i++) {
if (data[i].Ptr() != NULL) {
if (data[i].Ptr().GetWeight() >= _min_weight) {
_out += data[i].Ptr().ToString() + _dlm;
}
}
}
return _out;
}
};
#endif // COLLECTION_MQH