-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmy_vector.cpp
More file actions
417 lines (370 loc) · 7.68 KB
/
Copy pathmy_vector.cpp
File metadata and controls
417 lines (370 loc) · 7.68 KB
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
#include <bits/stdc++.h>
#include "my_vector.h"
my_vector::my_vector():
_size(0)
{}
my_vector::short_number::short_number()
{
for (size_t i = 0; i < amount_short; i++)
{
data[i] = 0;
}
}
void my_vector::for_copy(size_t new_cap)
{
lng.properties = static_cast <for_long_number*> (operator new (sizeof(for_long_number) + new_cap * sizeof(my_type)));
lng.data = lng.properties->data;
lng.properties->capacity = new_cap;
lng.properties->ref_counter = 1;
}
void my_vector::copy_lng_srt(size_t new_cap)
{
short_number tmp = srt;
for_copy(new_cap);
for (size_t i = 0; i < _size; i++)
lng.data[i] = tmp.data[i];
}
void my_vector::copy_lng_lng(size_t new_cap)
{
for_long_number* tmp = lng.properties;
for_copy(new_cap);
memcpy(lng.data, tmp->data, sizeof(my_type) * _size);
--tmp->ref_counter;
if (!tmp->ref_counter)
operator delete (static_cast <void*> (tmp));
}
void my_vector::push_back(const my_type& src)
{
if (_size < amount_short)
{
srt.data[_size++] = src;
}
else
{
if (_size == amount_short)
{
copy_lng_srt(2 * _size);
}
else
{
if (lng.properties->capacity == _size || lng.properties->ref_counter > 1)
{
size_t multiplier = (lng.properties->capacity == _size);
copy_lng_lng(lng.properties->capacity << multiplier);
}
}
lng.data[_size++] = src;
}
}
void my_vector::pop_back()
{
if (_size == amount_short + 1)
{
my_type tmp[amount_short];
for (size_t i = 0; i < amount_short; i++)
tmp[i] = lng.data[i];
operator delete (static_cast <void*> (lng.properties));
for (size_t i = 0; i < amount_short; i++)
srt.data[i] = tmp[i];
}
else if (_size > amount_short)
{
if ((_size - 1) == lng.properties->capacity / 4 || lng.properties->ref_counter > 1)
{
size_t deleter = ((_size - 1) == lng.properties->capacity / 4);
copy_lng_lng(lng.properties->capacity >> deleter);
}
}
--_size;
}
my_vector::my_type const& my_vector::operator[](size_t ind) const
{
if (_size <= amount_short)
{
//std::cout << "Hey" << std::endl;
return srt.data[ind];
}
else
{
//std::cout << "Huy" << std::endl;
return lng.data[ind];
}
}
my_vector::my_type& my_vector::operator[](size_t ind)
{
if (_size > amount_short)
{
if (lng.properties->ref_counter > 1)
{
copy_lng_lng(lng.properties->capacity);
}
return lng.data[ind];
}
return srt.data[ind];
}
bool my_vector::operator==(const my_vector& src)
{
if (src._size != _size)
return false;
if (_size <= amount_short)
{
for (size_t i = 0; i < _size; i++)
if (srt.data[i] != src.srt.data[i])
return false;
return true;
}
else
{
for (size_t i = 0; i < _size; i++)
{
if (lng.data[i] != src.lng.data[i])
return false;
}
return true;
}
}
my_vector& my_vector::operator=(const my_vector& src)
{
if (_size > amount_short)
{
--lng.properties->ref_counter;
if (!lng.properties->ref_counter)
operator delete(static_cast <void*> (lng.properties));
}
_size = src._size;
for (size_t i = 0; i < amount_short; i++)
{
srt.data[i] = src.srt.data[i];
}
if (_size > amount_short)
{
++lng.properties->ref_counter;
}
return *this;
}
my_vector::my_vector(const my_vector& src):
_size(src._size)
{
for (size_t i = 0; i < amount_short; i++)
srt.data[i] = src.srt.data[i];
if (_size > amount_short)
{
++lng.properties->ref_counter;
}
}
void my_vector::resize(size_t amount, my_type src)
{
if (_size <= amount_short)
{
if (amount > amount_short)
copy_lng_srt(amount);
}
else
{
if (amount <= amount_short)
{
--lng.properties->ref_counter;
if (!lng.properties->ref_counter)
operator delete(static_cast <void*> (lng.properties));
}
else
{
copy_lng_lng(amount);
}
}
if (amount <= amount_short)
{
for (size_t i = _size; i < amount; i++)
{
srt.data[i] = src;
}
}
else
{
//for (size_t i = _size; i < amount; i++)
//{
//lng.data[i] = src;
//}
if (amount > _size)
memset(lng.data + _size, src, sizeof(my_type) * (amount - _size));
}
_size = amount;
}
void my_vector::clear()
{
if (_size > amount_short)
{
--lng.properties->ref_counter;
if (!lng.properties->ref_counter)
operator delete(static_cast <void*> (lng.properties));
}
for (size_t i = 0; i < amount_short; i++)
{
srt.data[i] = 0;
}
_size = 0;
}
void my_vector::resize(size_t amount)
{
resize(amount, 0);
}
my_vector::~my_vector()
{
//std::cout << "Hay " << size << std::endl;
if (_size > amount_short)
{
--lng.properties->ref_counter;
//std::cout << "Here!" << std::endl;
if (!lng.properties->ref_counter)
{
//std::cout << "Hello!" << std::endl;
operator delete(static_cast <void*> (lng.properties));
}
}
}
my_vector::iterator my_vector::begin()
{
return iterator(0, this);
}
my_vector::iterator my_vector::end()
{
return iterator(_size, this);
}
my_vector::iterator::iterator(const iterator& it):
ind(it.ind), par(it.par)
{}
my_vector::iterator& my_vector::iterator::operator++()
{
//std::cout << ind << ' ' << par->_size << std::endl;
assert(ind < par->_size);
++ind;
return *this;
}
my_vector::iterator my_vector::iterator::operator++(int)
{
assert(ind < par->_size);
iterator tmp = *this;
++ind;
return tmp;
}
my_vector::iterator& my_vector::iterator::operator--()
{
assert(ind > 0);
--ind;
return *this;
}
my_vector::iterator my_vector::iterator::operator--(int)
{
assert(ind > 0);
iterator tmp = *this;
--ind;
return tmp;
}
my_vector::iterator& my_vector::iterator::operator+=(size_t rhs)
{
assert(ind + rhs <= par->_size);
ind += rhs;
return *this;
}
my_vector::iterator& my_vector::iterator::operator-=(size_t rhs)
{
assert((int)ind - (int)rhs >= 0);
ind -= rhs;
return *this;
}
my_vector::iterator::iterator(size_t _ind, my_vector* _another):
ind(_ind), par(_another)
{}
my_vector::iterator my_vector::iterator::operator+(size_t rhs)
{
assert(ind + rhs <= par->_size);
return iterator(ind + rhs, par);
}
my_vector::iterator my_vector::iterator::operator-(size_t rhs)
{
assert((int)ind - (int)rhs >= 0);
return iterator(ind - rhs, par);
}
my_vector::my_type& my_vector::iterator::operator*() const
{
return (*par)[ind];
}
bool operator==(my_vector::iterator const& a, my_vector::iterator const& b)
{
assert(a.par == b.par);
return (a.ind == b.ind);
}
bool operator!=(my_vector::iterator const& a, my_vector::iterator const& b)
{
assert(a.par == b.par);
return (a.ind != b.ind);
}
bool operator<(my_vector::iterator const& a, my_vector::iterator const& b)
{
assert(a.par == b.par);
return a.ind < b.ind;
}
bool operator<=(my_vector::iterator const& a, my_vector::iterator const& b)
{
assert(a.par == b.par);
return a.ind <= b.ind;
}
bool operator>(my_vector::iterator const& a, my_vector::iterator const& b)
{
assert(a.par == b.par);
return a.ind > b.ind;
}
bool operator>=(my_vector::iterator const& a, my_vector::iterator const& b)
{
assert(a.par == b.par);
return a.ind >= b.ind;
}
size_t operator-(my_vector::iterator const& a, my_vector::iterator const& b)
{
assert(a.par == b.par);
return a.ind - b.ind;
}
size_t my_vector::size() const
{
return _size;
}
//using namespace std;
//void print(my_vector& tmp)
//{
////cout << "Begin" << endl;
//for (size_t i = 0; i < tmp.size(); i++)
//{
//cout << tmp[i] << ' ';
//}
//cout << endl;
////cout << "End" << endl;
//}
//int main()
//{
//my_vector vt;
//for (size_t i = 0; i < 4; i++)
//{
//vt.push_back(i);
//}
//cout << "Start" << endl;
//my_vector vt1(vt);
//vt.resize(100);
//print(vt);
//print(vt1);
//for (size_t i = 0; i < 4; i++)
//{
//vt1[i] = rand() % 100;
//}
////cout << "Hay " << (vt1.begin() + vt1.size() != vt1.end()) << endl;
//sort(vt1.begin(), vt1.end());
//cout << "Finish" << endl;
//for (size_t i = 0; i < 4; i++)
//{
////print(vt);
//vt.pop_back();
////print(vt);
//}
//print(vt1);
////cout << "Stop" << endl;
//return 0;
//}