-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSTLVector.cpp
More file actions
198 lines (168 loc) · 4.06 KB
/
STLVector.cpp
File metadata and controls
198 lines (168 loc) · 4.06 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
//
// Created by osher on 14/02/2022.
//
#include <cstddef>
#include <vector>
#include <iostream>
using namespace std;
template<class T>
class MyVector {
T *_arr;
size_t _size;
size_t _realSize;
public:
explicit MyVector(size_t size) {
_size = size;
_arr = new T[_size];
_realSize = 0;
}
explicit MyVector() {
_size = 1;
_arr = new T[_size];
_realSize = 0;
}
MyVector(const MyVector<T> &vec) {
_size = vec._size;
_arr = new T[_size];
for (int i = 0; i < _size; ++i) {
_arr[i] = vec._arr[i];
}
_realSize = _size;
}
MyVector(MyVector<T> &&vec) {
_size = vec._size;
_arr = new T[_size];
_arr = vec;
_realSize = _size;
vec._realSize = 0;
vec._size = 0;
vec._arr = nullptr;
}
const T &at(size_t index) const {
if (index >= _realSize)
throw std::out_of_range("");
return _arr[index];
}
void push_back(const T &t) {
if (_realSize >= _size) {
_size *= 2;
T *temp = new T[_size];
for (int i = 0; i < _realSize; i++) {
temp[i] = this->at(i);
}
delete[] _arr;
_arr = move(temp);
}
_arr[_realSize] = t;
_realSize++;
}
size_t size() {
return _realSize;
}
bool empty() {
return _realSize == 0;
}
const T &operator[](int index) {
return _arr[index];
}
virtual ~MyVector() {
delete []_arr;
}
class iterator {
T* _it;
public:
explicit iterator(T* ptr) {
_it = ptr;
}
MyVector::iterator& operator++() {
_it++;// += sizeof(T);
return *this;
}
MyVector::iterator operator++(int) {
MyVector::iterator it(_it);// = *this;
_it++;
return it;
}
bool operator==(MyVector::iterator it) {
//cout << "address: " << _it << " - " << it._it << endl;
return _it == it._it;
}
bool operator<(MyVector::iterator it) {
return _it < it._it;
}
MyVector::iterator& operator=(MyVector::iterator it) {
if (this != &it)
_it = it._it;
return *this;
}
T& operator*() {
return *_it;
}
};
iterator begin() {
return iterator(&_arr[0]);
}
iterator end() {
return iterator(&_arr[_realSize]);
}
};
template<class iterator, class func>
func forEach(iterator begin, iterator end, func f) {
while (begin < end) {
f(*begin);
begin++;
}
return f;
}
template<class iterator, class predicate>
int countIf(iterator begin, iterator end, predicate p) {
int counter = 0;
while (begin < end) {
if (p(*begin))
counter++;
begin++;
}
return counter;
}
template<class T, class iterator>
void swap(iterator it1, iterator it2) {
T object = *it1;
*it1 = *it2;
*it2 = object;
}
template<class T, class iterator>
iterator find(iterator begin, iterator end, T object) {
while (begin < end) {
if (object == *begin)
return begin;
begin++;
}
return begin;
}
int main() {
MyVector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
forEach(v.begin(), v.end(), [](int x){
cout << x << endl;
});
int count = countIf(v.begin(), v.end(), [](int x){
return x > 3;
});
cout << "number of numbers above 3: " << count << endl;
swap<int, MyVector<int>::iterator>(++(v.begin()), ++(++(v.begin())));
forEach(v.begin(), v.end(), [](int x){
cout << x << endl;
});
if(find(v.begin(), v.end(), 5) == v.end())
cout << "didn't find 5" << endl;
else
cout << "find 5!" << endl;
if(find(v.begin(), v.end(), 6) == v.end())
cout << "didn't find 6" << endl;
else
cout << "find 6!" << endl;
}