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
|
#ifndef USU_VECTOR_HPP
#define USU_VECTOR_HPP
#include <algorithm>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <functional>
#include <iostream>
#include <memory>
#include <stdexcept>
#include <tuple>
namespace usu {
template <typename T> class vector {
public:
using size_type = std::size_t;
using reference = T &;
using pointer = std::shared_ptr<T[]>;
using value_type = T;
using resize_type = std::function<size_type(size_type)>;
static resize_type DEFAULT_RESIZER;
static size_type DEFAULT_CAPACITY;
vector();
vector(size_type size);
vector(resize_type resize);
vector(std::initializer_list<T> list);
vector(size_type size, resize_type resize);
vector(std::initializer_list<T> list, resize_type resize);
class iterator {
public:
using iterator_category = std::forward_iterator_tag;
iterator();
iterator(pointer data);
iterator(size_type pos, pointer data);
iterator(const iterator &obj);
iterator(iterator &&obj) noexcept;
iterator &operator=(const iterator &rhs);
iterator &operator=(iterator &&rhs);
bool operator==(const iterator &rhs) const;
bool operator!=(const iterator &rhs) const;
iterator operator++();
iterator operator--();
iterator operator++(int);
iterator operator--(int);
value_type operator*();
std::shared_ptr<T> operator->();
private:
pointer m_data;
size_type m_pos;
};
reference operator[](size_type index);
void add(T value);
void insert(size_type index, T value);
void remove(size_type index);
void clear();
size_type size();
size_type capacity();
iterator begin();
iterator end();
protected:
pointer m_data;
size_type m_capacity;
size_type m_size;
resize_type m_resize;
void maybe_resize();
};
template <> class vector<bool> : public vector<std::uint8_t> {
public:
using size_type = std::size_t;
using pointer = std::shared_ptr<std::uint8_t[]>;
using resize_type = std::function<size_type(size_type)>;
vector();
vector(size_type size);
vector(resize_type resize);
vector(std::initializer_list<bool> list);
vector(size_type size, resize_type resize);
vector(std::initializer_list<bool> list, resize_type resize);
class reference {
public:
reference();
reference(size_type pos, pointer data);
reference &operator=(bool value);
operator bool();
bool operator==(const reference &rhs) const;
bool operator!=(const reference &rhs) const;
bool get() const;
void add();
void sub();
private:
size_type m_pos;
pointer m_data;
};
class iterator {
public:
using iterator_category = std::forward_iterator_tag;
iterator();
iterator(pointer data);
iterator(size_type pos, pointer data);
iterator(const iterator &obj);
iterator(iterator &&obj) noexcept;
iterator &operator=(const iterator &rhs);
iterator &operator=(iterator &&rhs);
bool operator==(const iterator &rhs) const;
bool operator!=(const iterator &rhs) const;
iterator operator++();
iterator operator--();
iterator operator++(int);
iterator operator--(int);
reference operator*();
private:
reference m_ref;
};
reference operator[](size_type index);
void add(bool value);
void insert(size_type index, bool value);
void remove(size_type index);
iterator begin();
iterator end();
private:
void maybe_resize();
};
template <typename T>
vector<T>::iterator::iterator() : vector<T>::iterator::iterator(nullptr) {}
template <typename T>
vector<T>::iterator::iterator(pointer data) : m_data(data), m_pos(0) {}
template <typename T>
vector<T>::iterator::iterator(size_type pos, pointer data)
: m_data(data), m_pos(pos) {}
template <typename T> vector<T>::iterator::iterator(const iterator &obj) {
m_pos = obj.m_pos;
m_data = obj.m_data;
}
template <typename T> vector<T>::iterator::iterator(iterator &&obj) noexcept {
m_pos = obj.m_pos;
m_data = obj.m_data;
obj.m_pos = 0;
obj.m_data = nullptr;
}
template <typename T>
bool vector<T>::iterator::operator!=(const iterator &rhs) const {
return m_pos != rhs.m_pos;
}
template <typename T>
bool vector<T>::iterator::operator==(const iterator &rhs) const {
return m_pos == rhs.m_pos;
}
template <typename T>
typename vector<T>::iterator vector<T>::iterator::operator++() {
m_pos++;
return *this;
}
template <typename T>
typename vector<T>::iterator vector<T>::iterator::operator--() {
m_pos--;
return *this;
}
template <typename T>
typename vector<T>::iterator vector<T>::iterator::operator++(int) {
iterator it = *this;
m_pos++;
return it;
}
template <typename T>
typename vector<T>::iterator vector<T>::iterator::operator--(int) {
iterator it = *this;
m_pos--;
return it;
}
template <typename T>
typename vector<T>::value_type vector<T>::iterator::operator*() {
return m_data[m_pos];
}
template <typename T> std::shared_ptr<T> vector<T>::iterator::operator->() {
return std::make_shared<T>(m_data[m_pos]);
}
template <typename T>
typename vector<T>::resize_type vector<T>::DEFAULT_RESIZER =
[](size_type currentCapacity) -> size_type { return currentCapacity * 2; };
template <typename T>
typename vector<T>::size_type vector<T>::DEFAULT_CAPACITY = 10;
template <typename T>
vector<T>::vector() : usu::vector<T>(0, DEFAULT_RESIZER) {}
template <typename T>
usu::vector<T>::vector(size_type size)
: usu::vector<T>(size, DEFAULT_RESIZER) {}
template <typename T>
vector<T>::vector(resize_type resize) : usu::vector<T>(0, resize) {}
template <typename T>
vector<T>::vector(std::initializer_list<T> list)
: usu::vector<T>(list, DEFAULT_RESIZER) {}
template <typename T>
vector<T>::vector(std::initializer_list<T> list, resize_type resize)
: usu::vector<T>(0, resize) {
for (auto i = list.begin(); i < list.end(); ++i)
add(*i);
}
template <typename T>
vector<T>::vector(size_type size, resize_type resize)
: m_data(nullptr),
m_capacity(DEFAULT_CAPACITY > size ? DEFAULT_CAPACITY
: DEFAULT_RESIZER(size)),
m_size(size), m_resize(resize) {
maybe_resize();
}
template <typename T> void vector<T>::maybe_resize() {
if (m_data == nullptr)
m_data = std::make_shared<T[]>(m_capacity);
if (m_size >= m_capacity) {
m_capacity = std::max(m_capacity == 0 ? 1 : m_resize(m_capacity), m_size);
pointer newData = std::make_shared<T[]>(m_capacity);
for (size_type i = 0; i < m_size; ++i)
newData[i] = m_data[i];
m_data = newData;
}
}
template <typename T> void vector<T>::add(T value) {
maybe_resize();
m_data[m_size++] = value;
}
template <typename T>
typename vector<T>::reference vector<T>::operator[](size_type index) {
return m_data[index];
}
template <typename T> void vector<T>::insert(size_type index, T value) {
maybe_resize();
for (size_type i = m_size; i > index; --i)
m_data[i] = m_data[i - 1];
m_data[index] = value;
m_size++;
}
template <typename T> void vector<T>::remove(size_type index) {
for (size_type i = index; i < m_size; ++i)
m_data[i] = m_data[i + 1];
m_size--;
}
template <typename T> typename vector<T>::iterator vector<T>::begin() {
vector<T>::iterator begin(m_data);
return begin;
}
template <typename T> typename vector<T>::iterator vector<T>::end() {
vector<T>::iterator end(m_size, m_data);
return end;
}
template <typename T> void vector<T>::clear() { m_size = 0; }
template <typename T> typename vector<T>::size_type vector<T>::size() {
return m_size;
}
template <typename T> typename vector<T>::size_type vector<T>::capacity() {
return m_capacity;
}
} // namespace usu
#endif
|