blob: 16a19e0e8e16b2e5c7a6255661caa06ffbe70b53 (
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
210
211
212
213
214
215
216
217
218
219
220
221
|
#ifndef NULLSOFT_VECTOR_H
#define NULLSOFT_VECTOR_H
#include <assert.h>
#include <bfc/platform/types.h>
template <class Type, int INCREMENT = 32, int MULTIPLIER=1>
class Vector
{
public:
typedef Type *iterator;
typedef const Type *const_iterator;
public:
Vector() {}
virtual ~Vector()
{
delete [] values;
}
Vector(const Vector<Type, INCREMENT, MULTIPLIER> ©)
{
if (copy.numPtrs)
{
values = new Type[copy.numPtrs];
allocSize = copy.numPtrs;
numPtrs = copy.numPtrs;
for (size_t i = 0;i != numPtrs;i++)
{
values[i] = copy.values[i];
}
}
}
void operator=(const Vector<Type, INCREMENT, MULTIPLIER> ©)
{
Reset();
if (copy.numPtrs)
{
values = new Type[copy.numPtrs];
allocSize = copy.numPtrs;
numPtrs = copy.numPtrs;
for (size_t i = 0;i != numPtrs;i++)
{
values[i] = copy.values[i];
}
}
}
Type &operator[](size_t index)
{
return values[index];
}
Type *data()
{
return values;
}
Type *begin() const
{
return values;
}
Type *end() const
{
if (values) return values + numPtrs; else return 0;
}
void Reset()
{
delete [] values; values = 0; numPtrs = 0; allocSize=0;
}
void clear()
{
numPtrs = 0;
}
size_t size() const
{
return numPtrs;
}
size_t capacity()
{
return allocSize;
}
Type &back()
{
return values[numPtrs-1];
}
Type &at(size_t index) const
{
return values[index];
}
void reserve(size_t size)
{
if (size <= numPtrs)
return;
Type *newTable = new Type[size];
for (size_t i = 0;i != numPtrs;i++)
{
newTable[i] = values[i];
}
allocSize = size;
delete[] values;
values = newTable;
}
void push_back(Type t)
{
if (numPtrs == allocSize)
reserve(allocSize*MULTIPLIER + INCREMENT);
values[numPtrs++] = t;
}
void insert(size_t index, const Type &value)
{
if (numPtrs == allocSize)
reserve(allocSize*MULTIPLIER + INCREMENT);
for (size_t i = numPtrs;i != index;i--)
{
values[i] = values[i-1];
}
values[index] = value;
numPtrs++;
}
void append(size_t size, Type *t)
{
reserve(numPtrs + size + INCREMENT);
for (size_t i = 0;i != size;i++)
{
push_back(t[i]);
}
}
void pop_back()
{
if (numPtrs)
{
numPtrs--;
// next line removed to allow structs and classes
// values[numPtrs] = 0; // TODO: an inplace delete might be better?
}
}
void erase(iterator itr)
{
size_t index = itr - values;
eraseAt(index);
}
void eraseAt(size_t index)
{
if (numPtrs > index)
{
for (size_t k = index + 1; k < numPtrs; k++)
values[k-1] = values[k];
--numPtrs;
}
}
/* Removes an item by swapping it with the last item in the list. faster but can ruin order */
void eraseAtFast(size_t index)
{
if (index < numPtrs)
{
values[index] = values[--numPtrs];
// if (numPtrs != index)
// values[numPtrs]=0;
}
}
bool empty() const
{
return numPtrs == 0;
}
void resize(size_t newSize, Type val)
{
if (newSize < numPtrs)
{
numPtrs = newSize;
}
else if (newSize > numPtrs)
{
reserve(allocSize + (newSize - numPtrs) + INCREMENT);
while(numPtrs < newSize)
{
values[numPtrs] = val;
numPtrs++;
}
}
}
void resize(size_t newSize)
{
if (newSize < numPtrs)
{
numPtrs = newSize;
}
else if (newSize > numPtrs)
{
reserve(allocSize + (newSize - numPtrs) + INCREMENT);
numPtrs = newSize;
}
}
void set(Type *ptr, size_t num)
{
delete [] values;
values=ptr;
numPtrs=num;
}
private:
size_t numPtrs = 0;
size_t allocSize = 0;
Type *values = 0;
};
#endif
|
