-
Notifications
You must be signed in to change notification settings - Fork 8
/
Array.hpp
264 lines (231 loc) · 5.57 KB
/
Array.hpp
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
#pragma once
#include <nstd/Memory.hpp>
template <typename T> class Array
{
public:
class Iterator
{
public:
Iterator() : item(0) {}
const T& operator*() const {return *item;}
T& operator*() {return *item;}
const T* operator->() const {return item;}
T* operator->() {return item;}
const Iterator& operator++() {++item; return *this;}
const Iterator& operator--() {--item; return *this;}
Iterator operator++() const {return item + 1;}
Iterator operator--() const {return item - 1;}
bool operator==(const Iterator& other) const {return item == other.item;}
bool operator!=(const Iterator& other) const {return item != other.item;}
private:
T* item;
Iterator(T* item) : item(item) {}
friend class Array;
};
Array() : _capacity(0) {}
explicit Array(usize capacity) : _capacity(capacity) {}
Array(const Array& other) : _capacity(0)
{
reserve(other.capacity());
T* dest = _begin.item;
for(T* src = other._begin.item, * end = other._end.item; src != end; ++src, ++dest)
{
#ifdef VERIFY
VERIFY(new(dest)T(*src) == dest);
#else
new(dest)T(*src);
#endif
}
_end.item = dest;
}
~Array()
{
if(_begin.item)
{
for(T* i = _begin.item, * end = _end.item; i != end; ++i)
i->~T();
delete[] (char*)_begin.item;
}
}
Array& operator=(const Array& other)
{
clear();
reserve(other.capacity());
T* dest = _begin.item;
for(T* src = other._begin.item, * end = other._end.item; src != end; ++src, ++dest)
{
#ifdef VERIFY
VERIFY(new(dest)T(*src) == dest);
#else
new(dest)T(*src);
#endif
}
_end.item = dest;
return *this;
}
const Iterator& begin() const {return _begin;}
const Iterator& end() const {return _end;}
const T& front() const {return *_begin.item;}
const T& back() const {return _end.item[-1];}
T& front() {return *_begin.item;}
T& back() {return _end.item[-1];}
Iterator removeFront() {return remove(_begin);}
Iterator removeBack() {return remove(_end.item - 1);}
operator const T*() const {return _begin.item;}
operator T*() {return _begin.item;}
usize size() const {return _end.item - _begin.item;}
bool isEmpty() const {return _begin.item == _end.item;}
void reserve(usize size)
{
if(size > _capacity || (!_begin.item && size > 0))
{
if (size > _capacity)
_capacity = size;
_capacity |= 0x03;
T* newData = (T*)new char[sizeof(T) * _capacity];
T* dest = newData;
if(_begin.item)
{
for (T* src = _begin.item, * end = _end.item; src != end; ++src, ++dest)
{
#ifdef VERIFY
VERIFY(new(dest)T(*src) == dest);
#else
new(dest)T(*src);
#endif
src->~T();
}
delete[] (char*)_begin.item;
}
_begin.item = newData;
_end.item = dest;
}
}
void resize(usize size, const T& value = T())
{
usize _size = _end.item - _begin.item;
if (size < _size)
{
T* newEnd = _begin.item + size;
for (T* i = newEnd, *end = _end.item; i != end; ++i)
i->~T();
_end.item = newEnd;
}
else
{
reserve(size);
T* end = _begin.item + size;
for (T* i = _begin.item + _size; i != end; ++i)
{
#ifdef VERIFY
VERIFY(new(i)T(value) == i);
#else
new(i)T(value);
#endif
}
_end.item = end;
}
}
usize capacity() const {return _capacity;}
void clear()
{
if(_begin.item)
{
for(T* i = _begin.item, * end = _end.item; i != end; ++i)
i->~T();
_end.item = _begin.item;
}
}
void swap(Array& other)
{
T* tmpFirst = _begin.item;
T* tmpEnd = _end.item;
usize tmpCapacity = _capacity;
_begin.item = other._begin.item;
_end.item = other._end.item;
_capacity = other._capacity;
other._begin.item = tmpFirst;
other._end.item = tmpEnd;
other._capacity = tmpCapacity;
}
T& append(const T& value)
{
usize size = _end.item - _begin.item;
reserve(size + 1);
T* item = _end.item;
#ifdef VERIFY
VERIFY(new(item) T(value) == item);
#else
new(item) T(value);
#endif
++_end.item;
return *item;
}
void append(const Array& values)
{
usize size = _end.item - _begin.item;
usize valuesSize = values.size();
reserve(size + valuesSize);
T* item = _end.item;
for(T* end = item + valuesSize, *src = values._begin.item; item < end; ++item, ++src)
{
#ifdef VERIFY
VERIFY(new(item) T(*src) == item);
#else
new(item) T(*src);
#endif
}
_end.item = item;
}
void append(const T* values, usize size)
{
usize oldSize = _end.item - _begin.item;
reserve(oldSize + size);
T* item = _end.item;
for(T* end = item + size; item < end; ++item, ++values)
{
#ifdef VERIFY
VERIFY(new(item) T(*values) == item);
#else
new(item) T(*values);
#endif
}
_end.item = item;
}
void remove(usize index)
{
usize size = _end.item - _begin.item;
if(index < size)
{
T* pos = _begin.item + index;
for(T* end = --_end.item, * dest; pos < end;)
{
dest = pos;
*dest = *(++pos);
}
pos->~T();
}
}
Iterator remove(const Iterator& it)
{
T* pos = it.item;
for(T* end = --_end.item, * dest; pos < end;)
{
dest = pos;
*dest = *(++pos);
}
pos->~T();
return it.item;
}
Iterator find(const T& value) const
{
for(T* pos = _begin.item, * end = _end.item; pos < end; ++pos)
if(*pos == value)
return pos;
return _end;
}
private:
Iterator _begin;
Iterator _end;
usize _capacity;
};