blob: dbe7473f0cc169ade3984e62c9ce217875129030 (
plain) (
blame)
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
|
#pragma once
#include <util/generic/yexception.h>
#include <util/generic/utility.h>
#include <util/memory/alloc.h>
#include <util/stream/output.h>
#include <util/system/yassert.h>
#include <cstdlib>
// vector that is 8 bytes when empty (TVector is 24 bytes)
template <typename T>
class TCompactVector {
private:
typedef TCompactVector<T> TThis;
// XXX: make header independent on T and introduce nullptr
struct THeader {
size_t Size;
size_t Capacity;
};
T* Ptr;
THeader* Header() {
return ((THeader*)Ptr) - 1;
}
const THeader* Header() const {
return ((THeader*)Ptr) - 1;
}
public:
typedef T* TIterator;
typedef const T* TConstIterator;
typedef TIterator iterator;
typedef TConstIterator const_iterator;
TCompactVector()
: Ptr(nullptr)
{
}
TCompactVector(const TThis& that)
: Ptr(nullptr)
{
Reserve(that.Size());
for (TConstIterator i = that.Begin(); i != that.End(); ++i) {
PushBack(*i);
}
}
~TCompactVector() {
for (size_t i = 0; i < Size(); ++i) {
try {
(*this)[i].~T();
} catch (...) {
}
}
if (Ptr)
free(Header());
}
TIterator Begin() {
return Ptr;
}
TIterator End() {
return Ptr + Size();
}
TConstIterator Begin() const {
return Ptr;
}
TConstIterator End() const {
return Ptr + Size();
}
iterator begin() {
return Begin();
}
const_iterator begin() const {
return Begin();
}
iterator end() {
return End();
}
const_iterator end() const {
return End();
}
void Swap(TThis& that) {
DoSwap(Ptr, that.Ptr);
}
void Reserve(size_t newCapacity) {
if (newCapacity <= Capacity()) {
} else if (Ptr == nullptr) {
void* mem = ::malloc(sizeof(THeader) + newCapacity * sizeof(T));
if (mem == nullptr)
ythrow yexception() << "out of memory";
Ptr = (T*)(((THeader*)mem) + 1);
Header()->Size = 0;
Header()->Capacity = newCapacity;
} else {
TThis copy;
size_t realNewCapacity = Max(Capacity() * 2, newCapacity);
copy.Reserve(realNewCapacity);
for (TConstIterator it = Begin(); it != End(); ++it) {
copy.PushBack(*it);
}
Swap(copy);
}
}
size_t Size() const {
return Ptr ? Header()->Size : 0;
}
size_t size() const {
return Size();
}
bool Empty() const {
return Size() == 0;
}
bool empty() const {
return Empty();
}
size_t Capacity() const {
return Ptr ? Header()->Capacity : 0;
}
void PushBack(const T& elem) {
Reserve(Size() + 1);
new (Ptr + Size()) T(elem);
++(Header()->Size);
}
T& Back() {
return *(End() - 1);
}
const T& Back() const {
return *(End() - 1);
}
T& back() {
return Back();
}
const T& back() const {
return Back();
}
TIterator Insert(TIterator pos, const T& elem) {
Y_ASSERT(pos >= Begin());
Y_ASSERT(pos <= End());
size_t posn = pos - Begin();
if (pos == End()) {
PushBack(elem);
} else {
Y_ASSERT(Size() > 0);
Reserve(Size() + 1);
PushBack(*(End() - 1));
for (size_t i = Size() - 2; i + 1 > posn; --i) {
(*this)[i + 1] = (*this)[i];
}
(*this)[posn] = elem;
}
return Begin() + posn;
}
iterator insert(iterator pos, const T& elem) {
return Insert(pos, elem);
}
void Clear() {
TThis clean;
Swap(clean);
}
void clear() {
Clear();
}
T& operator[](size_t index) {
Y_ASSERT(index < Size());
return Ptr[index];
}
const T& operator[](size_t index) const {
Y_ASSERT(index < Size());
return Ptr[index];
}
};
|
