-
Notifications
You must be signed in to change notification settings - Fork 0
/
Vector.h
210 lines (176 loc) · 4.21 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
#include <cstddef>
#include <utility>
#include <memory>
template<typename T>
class TData {
private:
static T* Alloc(size_t n) {
return static_cast<T*>(operator new(n * sizeof(T)));
}
static void Dealloc(T* buf) {
operator delete(buf);
}
void Swap_with(TData& r) {
std::swap(Ptr, r.Ptr);
std::swap(Capacity, r.Capacity);
}
public:
T* Ptr = nullptr;
size_t Capacity = 0;
TData() = default;
TData(size_t n) {
Ptr = Alloc(n);
Capacity = n;
}
TData(const TData& other) = delete;
TData(TData&& other) {
Swap_With(other);
}
~TData() {
Dealloc(Ptr);
}
TData& operator=(const TData& other) = delete;
TData& operator=(TData&& other) {
Swap_With(other);
return *this;
}
const T& operator[](size_t i) const {
return Ptr[i];
}
T& operator[](size_t i) {
return Ptr[i];
}
};
namespace NData {
template<typename T>
void Swap(TData<T>& l, TData<T>& r) {
std::swap(l.Ptr, r.Ptr);
std::swap(l.Capacity, r.Capacity);
}
}
template<typename T>
class Vector {
private:
TData<T> Data;
size_t Size = 0;
public:
Vector() = default;
explicit Vector(size_t n)
: Data(n)
, Size(n) {
std::uninitialized_value_construct_n(
Data.Ptr, Size);
}
Vector(const Vector& other)
: Data(other.Size)
, Size(other.Size) {
std::uninitialized_copy_n(
other.Data.Ptr, Size, Data.Ptr);
}
/*Vector(Vector&& other)
: Data((other.Data))
, Size((other.Size)) {}*/
~Vector() {
std::destroy_n(Data.Ptr, Size);
}
/*Vector& operator=(Vector&& other) {
Swap(Data, other.Data);
std::swap(Size, other.Size);
}*/
void swap(Vector& other) {
NData::Swap(Data, other.Data);
std::swap(Size, other.Size);
}
Vector& operator=(Vector& other) {
if (other.Size > Data.Capacity) {
Vector tmp(other);
swap(tmp);
} else {
for (size_t i = 0; i != Size && i != other.Size; ++i) {
Data[i] = other[i];
}
if (Size > other.Size) {
std::destroy_n(
Data.Ptr + other.Size,
Size - other.Size);
}
if (Size < other.Size) {
std::uninitialized_copy_n(
other.Data.Ptr + Size,
other.Size - Size,
Data.Ptr + Size);
}
Size = other.Size;
}
return *this;
}
void reserve(size_t n) {
if (n > Data.Capacity) {
TData<T> data(n);
std::uninitialized_move_n(
Data.Ptr, Size, data.Ptr);
NData::Swap(Data, data);
std::destroy_n(data.Ptr, Size);
}
}
void resize(size_t n) {
reserve(n);
if (Size < n) {
std::uninitialized_value_construct_n(
Data.Ptr + Size,
n - Size);
} else if (Size > n) {
std::destroy_n(
Data.Ptr + n,
Size - n);
}
Size = n;
}
void push_back(const T& elem) {
if (Size == Data.Capacity) {
reserve(Size ? 2 * Size : 1);
}
new (Data.Ptr + Size) T(elem);
++Size;
}
void push_back(T&& elem) {
if (Size == Data.Capacity) {
reserve(Size ? 2 * Size : 1);
}
new (Data.Ptr + Size) T(std::move(elem));
++Size;
}
void pop_back() {
std::destroy_at(Data.Ptr + Size - 1);
--Size;
}
void clear() {
if (Size == 0)
return;
resize(0);
}
T* begin() {
return Data.Ptr;
}
T* end() {
return Data.Ptr + Size;
}
const T* begin() const {
return Data.Ptr;
}
const T* end() const {
return Data.Ptr + Size;
}
size_t size() const {
return Size;
}
size_t capacity() const {
return Data.Capacity;
}
const T& operator[](size_t i) const {
return Data[i];
}
T& operator[](size_t i) {
return Data[i];
}
};