-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvector.hpp
140 lines (119 loc) · 3.43 KB
/
vector.hpp
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
#ifndef DBSTD_VECTOR
#define DBSTD_VECTOR
#include <memory>
namespace dbstd {
template <typename T, class Allocator=std::allocator<T>>
class Vector {
private:
Allocator alloc;
size_t capacity;
size_t size;
T* backing;
T* createBacking(size_t capacity) {
return alloc.allocate(capacity);
}
void freeBacking(T* toFree, size_t size) {
for (T* location = toFree; location < (toFree+size); ++location)
location->~T();
alloc.deallocate(toFree, capacity);
}
void copyBacking(T* inputStart, T* inputEnd, T* outputStart) {
for (; inputStart < inputEnd; ++inputStart, ++outputStart)
new (outputStart) T(*inputStart);
}
public:
Vector(const Allocator& alloc = Allocator())
: alloc(alloc)
, capacity(0)
, size(0)
, backing(createBacking(capacity))
{}
Vector(size_t capacity, const Allocator& alloc = Allocator())
: alloc(alloc)
, capacity(capacity)
, size(0)
, backing(createBacking(capacity))
{}
Vector(const Vector& other, const Allocator& alloc = Allocator())
: alloc(alloc)
, capacity(other.capacity)
, size(other.size)
, backing(createBacking(capacity))
{
copyBacking(other.backing, other.backing+size, backing);
}
Vector(Vector&& other) noexcept
: alloc(other.alloc)
, capacity(other.capacity)
, size(other.size)
, backing(other.backing)
{
other.backing = nullptr;
}
// Copy swap example
// friend void swap(Vector first, Vector second) {
// std::swap(first.capacity, second.capacity);
// std::swap(first.size, second.size);
// std::swap(first.backing, second.backing);
// }
// Vector& operator=(Vector other) noexcept {
// swap(*this, other);
// return *this;
// }
Vector& operator=(const Vector& other) {
if (this != &other) {
freeBacking(backing, size);
capacity = other.capacity;
size = other.size;
backing = createBacking(capacity);
copyBacking(other.backing, other.backing + other.size, backing);
}
return *this;
}
Vector& operator=(Vector&& other) noexcept {
if (this != &other) {
freeBacking(backing, size);
alloc = other.alloc;
capacity = other.capacity;
size = other.size;
backing = other.backing;
other.backing = nullptr;
}
return *this;
}
~Vector() {
if (backing != nullptr) freeBacking(backing, size);
}
void reserve(size_t newCapacity) {
capacity = newCapacity;
T* newBacking = createBacking(capacity);
copyBacking(backing, backing+size, newBacking);
freeBacking(backing, size);
backing = newBacking;
}
template <typename U>
void push_back(U&& item) {
if (size == capacity) {
capacity == 0
? reserve(1)
: reserve(capacity*2);
}
new (backing+size) T(std::forward<U>(item));
++size;
}
template <typename ...Args>
void emplace_back(Args&&... args) {
if (size == capacity) {
capacity == 0
? reserve(1)
: reserve(capacity*2);
}
new (backing+size) T(std::forward<Args>(args)...);
++size;
}
T& operator[](size_t index) {
return *(backing + index);
}
};
}
#endif