-
Notifications
You must be signed in to change notification settings - Fork 0
/
rurarray.h
238 lines (207 loc) · 3.86 KB
/
rurarray.h
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
#ifndef __rurarray_h
#define __rurarray_h
class RurTemplateBaseArray {
protected:
void** data; // pointre
private:
int delta; // prirastok
int poc; // pocet poloziek
int max; // maximum alokovaneho priestoru
bool has_objects; // ci vlastni vsetky objekty
public:
RurTemplateBaseArray(int beg, int delt);
~RurTemplateBaseArray();
int GetItemsInContainer() {
return poc;
}
bool HasObjects() {
return has_objects;
}
void Zero() {
poc = 0;
}
void* operator[](int i) {
return data[i];
}
void Add(void* o);
void AddAt(void* o, int n);
void* Detach(int n);
bool Destroy(int n);
bool Destroy(void*);
void Flush();
void Resize(int n);
void OwnsElements(bool o) {
has_objects = o;
}
int FindPosition(void* o);
bool HasMember(void* o);
};
// pole pointrov na objekty
template<class T>
class RurTemplateArray :
public RurTemplateBaseArray {
public:
RurTemplateArray(int beg, int delt) :
RurTemplateBaseArray(beg, delt) {
}
~RurTemplateArray() {
Flush();
}
void Flush();
void DelObj(T* o) {
delete o;
}
T* operator[](int i) {
return (T*)data[i];
}
T* Detach(int n) {
return (T*)RurTemplateBaseArray::Detach(n);
}
bool Destroy(int n);
};
template<class T>
void RurTemplateArray<T>::Flush() {
if (HasObjects()) {
int poc = GetItemsInContainer();
for (int i = 0; i < poc; i++) {
DelObj((T*)data[i]);
}
}
Zero();
}
template<class T>
bool RurTemplateArray<T>::Destroy(int n) {
T* o = Detach(n);
if (!o) {
return false;
}
if (o && HasObjects()) {
delete o;
}
return true;
}
// obycajne pole objektov
template<class T>
class RArray {
protected:
T* data;
int delta; // prirastok
int poc; // pocet poloziek
int max; // maximum alokovaneho priestoru
public:
RArray(int beg, int delt) {
data = new T[beg];
delta = delt;
poc = 0;
max = beg;
}
virtual ~RArray() {
delete[]data;
}
void Flush() {
poc = 0;
}
void Add(T& o);
void AddAt(T& o, int n);
void Resize(int n);
int GetItemsInContainer() {
return poc;
}
T& operator[](int i) {
return data[i];
}
int Detach(int n);
bool Destroy(int n) {
return Detach(n);
}
};
template<class T>
void RArray<T>::Add(T& o) {
if (poc >= max) {
Resize(poc + 1);
}
data[poc++] = o;
}
template<class T>
void RArray<T>::AddAt(T& o, int n) {
if (poc >= max) {
Resize(poc + 1);
}
for (int i = poc; i > n; i--) {
data[i] = data[i - 1];
}
data[n] = o;
poc++;
}
template<class T>
int RArray<T>::Detach(int n) {
if (n >= poc) {
return 0;
}
poc--;
for (int i = n; i < poc; i++) {
data[i] = data[i + 1];
}
return 1;
}
template<class T>
void RArray<T>::Resize(int n) {
if (n < max) { // dost priestoru
return;
}
int newmax = max;
while (newmax < n) {
newmax += delta;
}
T* tmp = new T[newmax];
for (int i = 0; i < poc; i++) {
tmp[i] = data[i];
}
delete[]data;
data = tmp;
max = newmax;
}
// obycajne triedene pole objektov
template<class T>
class RSArray :
public RArray<T> {
public:
RSArray(int beg, int delt) :
RArray<T>(beg, delt) {
}
void Add(T& o);
};
template<class T>
void RSArray<T>::Add(T& o) {
if (this->poc >= this->max) {
Resize(this->poc + 1);
}
int po = this->poc;
while (po > 0 && o < this->data[po - 1]) {
this->data[po] = this->data[po - 1];
po--;
}
this->data[po] = o;
this->poc++;
}
// obycajne pole objektov s hladanim
// objekt musi mat definovany == operator
template<class T>
class RHArray :
public RArray<T> {
public:
RHArray(int beg, int delt) :
RArray<T>(beg, delt) {
}
int Find(T& o);
};
template<class T>
int RHArray<T>::Find(T& o) {
for (int i = 0; i < this->poc; i++) {
if (this->data[i] == o) {
return i;
}
}
return -1;
}
#endif