-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvector.hpp
More file actions
215 lines (175 loc) · 4.91 KB
/
Copy pathvector.hpp
File metadata and controls
215 lines (175 loc) · 4.91 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
#ifndef vector_HPP
#define vector_HPP
#include <new>
#include <cstdlib>
template <typename value_t>
class vector{
private:
int cap;
int _size;
value_t* arr;
void resize(){
int n_cap = cap*2;
// value_t* new_arr = new value_t[n_cap];
void* raw_mem = std::malloc(n_cap * sizeof(value_t));
if(!raw_mem){
throw std::bad_alloc();
}
value_t* new_arr = static_cast<value_t*>(raw_mem);
for(int i=0;i<_size;i++){
// new_arr[i] = arr[i];
new (&new_arr[i]) value_t(std::move(arr[i])); // can throw tho
arr[i].~value_t();
}
std::free(arr);
// delete[] arr;
arr = new_arr;
cap = n_cap;
}
public:
vector(){
cap = 2;
_size = 0;
// arr = new value_t[cap];
void* raw_mem = std::malloc(cap * sizeof(value_t));
if(!raw_mem){
throw std::bad_alloc();
}
arr = static_cast<value_t*>(raw_mem);
}
vector(int size){
cap = size + 2;
this->_size = size;
// arr = new value_t[cap];
void* raw_mem = std::malloc(cap * sizeof(value_t));
if(!raw_mem){
throw std::bad_alloc();
}
arr = static_cast<value_t*>(raw_mem);
for(int i=0;i<this->_size;i++){
new (&arr[i]) value_t();
}
}
vector(const vector& other_vector){
cap = other_vector.cap;
this->_size = other_vector._size;
// arr = new value_t[cap];
void* raw_mem = std::malloc(cap * sizeof(value_t));
if(!raw_mem){
throw std::bad_alloc();
}
arr = static_cast<value_t*>(raw_mem);
for(int i=0;i<this->_size;i++){
// arr[i] = other_vector.arr[i];
new (&arr[i]) value_t(other_vector.arr[i]);
}
}
vector(vector&& other_vector) noexcept {
this->_size = other_vector._size;
this->arr = other_vector.arr;
this->cap = other_vector.cap;
other_vector.arr = nullptr;
other_vector._size = 0;
other_vector.cap = 0;
}
vector& operator=(const vector& other_vector){
if(this != &other_vector){
// delete[] arr;
for(int i=0;i<this->_size;i++){
arr[i].~value_t();
}
std::free(arr);
cap = other_vector.cap;
this->_size = other_vector._size;
// arr = new value_t[cap];
void* raw_mem = std::malloc(cap * sizeof(value_t));
if(!raw_mem){
throw std::bad_alloc();
}
arr = static_cast<value_t*>(raw_mem);
for(int i=0;i<this->_size;i++){
// arr[i] = other_vector.arr[i];
new (&arr[i]) value_t(other_vector.arr[i]);
}
}
return *this;
}
vector& operator=(vector&& other_vector) noexcept {
if(this != &other_vector){
// delete[] arr;
for(int i=0;i<this->_size;i++){
arr[i].~value_t();
}
std::free(arr);
this->_size = other_vector._size;
this->cap = other_vector.cap;
this->arr = other_vector.arr;
other_vector.arr = nullptr;
other_vector._size = 0;
other_vector.cap = 0;
}
return *this;
}
~vector() {
// delete[] arr;
for(int i=0;i<this->_size;i++){
arr[i].~value_t();
}
std::free(arr);
}
void push_back(value_t& val){
if(_size==cap){
resize();
}
new (&arr[_size]) value_t(val);
_size++;
}
void push_back(value_t&& val){
if(_size==cap){
resize();
}
new (&arr[_size]) value_t(std::move(val));
_size++;
}
value_t back(){
if(_size==0){
throw std::runtime_error("Tried an empty vector: vector.hpp\n");
}
value_t back_element = arr[_size-1];
return back_element;
}
void pop_back(){
if(_size==0){
throw std::runtime_error("Tried to pop an empty vector : vector.hpp\n");
}
_size--;
arr[_size].~value_t();
}
const value_t& operator[](int ind) const {
if(ind<0 || ind>=_size){
throw std::runtime_error("Out of bounds access: vector.hpp\n");
}
return arr[ind];
}
value_t& operator[](int ind) {
if(ind<0 || ind>=_size){
throw std::runtime_error("Out of bounds access: vector.hpp\n");
}
return arr[ind];
}
void clear(){
for(int i=0;i<this->_size;i++){
arr[i].~value_t();
}
std::free(arr);
_size = 0;
cap = 2;
}
int size() const {
return _size;
}
bool empty() const {
return (_size==0) ? true : false;
}
};
#endif