-
Notifications
You must be signed in to change notification settings - Fork 0
/
vector.h
421 lines (381 loc) · 8.66 KB
/
vector.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
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
418
419
420
421
/**
@file vector.h
@brief This file contains the implementation of the myVector class, a custom vector implementation.
*/
#ifndef VECTOR_H_
#define VECTOR_H_
#include <iostream>
#include <initializer_list>
#include <cstdlib>
#include <limits>
#include <vector>
/**
* @brief Templated vector class implementation.
*
* Full vector implementation, except for operator invalidation.
*/
template <class T, class... Args>
class myVector
{
private:
T* arr; /**< Pointer to the underlying array. */
int size; /**< Current size of the vector. */
int capacity; /**< Current capacity of the vector. */
public:
int myVecCount = 0;
/**
* @brief Default constructor.
*/
myVector() : arr(new T[1]), size(0), capacity(1) {};
/**
* @brief Constructor with size parameter.
* @param size The initial size of the vector.
*/
myVector(int size) : arr(new T[size]), size(size), capacity(size) {};
/**
* @brief Constructor with initializer list.
* @param init The initializer list containing initial elements.
*/
template <typename U>
myVector(std::initializer_list<U> init) : size(init.size()), capacity(init.size())
{
arr = new T[capacity];
int i = 0;
for (auto it = init.begin(); it != init.end(); ++it)
{
arr[i++] = *it;
}
}
/**
* @brief Constructor with iterators.
* @param first Iterator pointing to the first element.
* @param last Iterator pointing to one past the last element.
*/
template<typename InputIt>
myVector(InputIt first, InputIt last) : myVector(std::distance(first, last))
{
std::copy(first, last, arr);
}
/**
* @brief Copy constructor.
* @param other The vector to be copied.
*/
myVector(const myVector<T>& other) : myVector(other.size)
{
std::copy(other.arr, other.arr + other.size, arr);
}
/**
* @brief Destructor that deallocates the underlying array.
*/
~myVector()
{
delete[] arr;
}
/**
* @brief Clears the vector.
*
*/
void clear()
{
size = 0;
capacity = 1;
delete[] arr;
arr = new T[1];
}
/**
* @brief Prints the vector size, capacity and elements.
*
*/
void print()
{
std::cout << "Size: " << size << std::endl;
std::cout << "Capacity: " << capacity << std::endl;
for (int i = 0; i < size; i++)
{
std::cout << arr[i] << " ";
}
std::cout << "\n" << std::endl;
}
/**
* @brief resizes vector to newSize, fills new elements with default value
* @param newSize The new size of the vector.
*/
void resize(int newSize)
{
if (newSize < 0)
{
throw std::out_of_range("New size cannot be negative");
}
if(newSize > capacity)
{
reserve(newSize);
}
if(newSize > size)
{
for (int i = size; i < newSize; i++)
{
arr[i] = T();
}
}
size = newSize;
}
/**
* @brief pushes data to the back of the vector
*
* @param data The data to be pushed to the back of the vector.
*/
void push_back(T data)
{
(size == capacity) ? reserve(2 * capacity) : void();
arr[size] = data;
size++;
}
/**
* @brief checks if vector is empty
*
* @return true if vector is empty
* @return false if vector is not empty
*/
bool empty()
{
return size == 0;
}
/**
* @brief removes last element from vector
*
*/
void pop_back() // removes last element
{
if(size > 0)
{
size--;
}
}
/**
* @brief reserves memory for vector
*
* @param newCapacity The new capacity of the vector.
*/
void reserve(int newCapacity)
{
myVecCount++;
T* temp = new T[newCapacity];
for (int i = 0; i < size; i++)
{
temp[i] = arr[i];
}
delete[] arr;
arr = temp;
capacity = newCapacity;
}
/**
* @brief shrinks capacity to size, to save memory
*
*/
void shrink_to_fit()
{
if(size < capacity)
{
T* temp = new T[size];
for (int i = 0; i < size; i++)
{
temp[i] = arr[i];
}
delete[] arr;
arr = temp;
capacity = size;
}
}
/**
* @brief inserts element at position
*
* @param position The position to insert the element at.
* @param data The data to be inserted.
*/
void insert(T* position, const T& val)
{
// std::cout << "Inserting value " << val << " at position " << (position - arr) << std::endl;
if (position < arr || position > arr + size)
{
throw std::out_of_range("Position out of range");
}
if (size == capacity)
{
T* old_arr = arr; // save pointer to old array
reserve(2 * capacity);
position = arr + (position - old_arr); // adjust position relative to new array
}
for (T* i = arr + size; i > position; i--)
{
*i = *(i - 1);
}
*position = val;
size++;
}
/**
* @brief constructs element at the end of vector, forwards arguments to constructor
*
* @tparam TArgs
* @param args
*/
template <typename... TArgs>
void emplace_back(TArgs&&... args)
{
if (size == capacity)
{
reserve(2 * capacity);
}
new (arr + size) T(std::forward<TArgs>(args)...);
size++;
}
/**
* @brief erases element at position
*
* @param position The position of the element to be erased.
*/
void erase(T* position)
{
if (position < arr || position >= arr + size)
{
throw std::out_of_range("Position out of range");
}
for (T* i = position; i < arr + size - 1; i++)
{
*i = *(i + 1);
}
size--;
}
/**
* @brief swaps contents of two vectors
*
* @param other
*/
void swap(myVector<T>& other)
{
std::swap(this->arr, other.arr);
std::swap(this->size, other.size);
std::swap(this->capacity, other.capacity);
}
/**
* @brief returns element at index, throws out_of_range exception if index is out of range
*
* @param index
* @return T&
*/
T& at(int index)
{
if(index < 0 || index >= size)
{
throw std::out_of_range("Index out of range");
}
return arr[index];
}
/**
* @brief returns element at index, checks if index is out of range
*
* @param index
* @return T&
*/
T& operator[](int index)
{
if(index < 0 || index >= size)
{
throw std::out_of_range("Index out of range");
}
return arr[index];
}
/**
* @brief returns element in front of vector
*
* @return T&
*/
T& front()
{
if (size == 0)
{
throw std::out_of_range("Vector is empty");
}
return arr[0];
}
/**
* @brief returns element at the back of vector
*
* @return T&
*/
T& back()
{
if (size == 0)
{
throw std::out_of_range("Vector is empty");
}
return arr[size - 1];
}
/**
* @brief returns pointer to array
*
* @return T*
*/
T* data()
{
return arr;
}
/**
* @brief returns pointer to first element
*
* @return T*
*/
T* begin()
{
return arr;
}
/**
* @brief returns pointer to one past last element
*
* @return T*
*/
T* end()
{
return arr + size;
}
/**
* @brief returns pointer to last element minus one
*
* @return T*
*/
T* rbegin()
{
return arr + size - 1;
}
/**
* @brief returns pointer to first element minus one
*
* @return T*
*/
T* rend()
{
return arr - 1;
}
/**
* @brief Gets the Size of object
*
* @return int
*/
int getSize()
{
return size;
}
/**
* @brief Gets the Capacity of object
*
* @return int
*/
int getCapacity()
{
return capacity;
}
size_t max_size()
{
return std::numeric_limits<size_t>::max();
}
};
#endif