-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSimpleList.h
More file actions
217 lines (168 loc) · 3.96 KB
/
SimpleList.h
File metadata and controls
217 lines (168 loc) · 3.96 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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
// SimpleList.h
#ifndef _SIMPLELIST_h
#define _SIMPLELIST_h
#if defined(ARDUINO) && ARDUINO >= 100
#include "Arduino.h"
#else
#include "WProgram.h"
#endif
#ifndef NULL
#define NULL 0
#endif
template<typename T>
class SimpleList
{
public:
SimpleList()
{
_list = NULL;
_size = 0;
_preAlloc = 0;
}
~SimpleList()
{
delete[] _list;
_list = NULL;
_size = 0;
_preAlloc = 0;
}
void push_back(T obj)
{
++_size;
bool alloc = (_preAlloc < _size);
T* newBuffer = alloc ? new T[_size] : _list;
if (alloc)
{
for (unsigned int i = 0; i < _size - 1; ++i)
newBuffer[i] = _list[i];
}
newBuffer[_size - 1] = obj;
if (alloc)
{
delete[] _list;
_list = newBuffer;
}
}
void push_front(T obj)
{
++_size;
bool alloc = (_preAlloc < _size);
T* newBuffer = alloc ? new T[_size] : _list;
for (unsigned int i = _size - 1; i > 0; --i)
newBuffer[i] = _list[i - 1];
newBuffer[0] = obj;
if (alloc)
{
delete[] _list;
_list = newBuffer;
}
}
void pop_back()
{
if (empty())
return;
--_size;
if (empty())
{
if (!_preAlloc)
delete[] _list;
return;
}
bool alloc = (!_preAlloc || _preAlloc < _size + 1);
T* newBuffer = alloc ? new T[_size] : _list;
if (alloc)
{
for (unsigned int i = 0; i < _size; ++i)
newBuffer[i] = _list[i];
delete[] _list;
_list = newBuffer;
}
}
void pop_front()
{
if (empty())
return;
--_size;
if (empty())
{
if (!_preAlloc)
delete[] _list;
return;
}
bool alloc = (!_preAlloc || _preAlloc < _size + 1);
T* newBuffer = alloc ? new T[_size] : _list;
for (unsigned int i = 0; i < _size; ++i)
newBuffer[i] = _list[i + 1];
if (alloc)
{
delete[] _list;
_list = newBuffer;
}
}
void reserve(unsigned int size)
{
if (size <= _size)
return;
_preAlloc = size;
T* newBuffer = new T[_preAlloc];
for (unsigned int i = 0; i < _size; ++i)
newBuffer[i] = _list[i];
delete[] _list;
_list = newBuffer;
}
typedef T* iterator;
iterator erase(iterator &itr)
{
if (empty())
return NULL;
--_size;
if (empty())
{
if (!_preAlloc)
delete[] _list;
return NULL;
}
bool alloc = (!_preAlloc || _preAlloc < _size + 1);
T* newBuffer = alloc ? new T[_size] : _list;
bool sum = false;
unsigned int pos = 0;
for (unsigned int i = 0; i < _size; ++i)
{
if (_list + i == itr)
{
sum = true;
pos = i;
}
if (sum)
newBuffer[i] = _list[i + 1];
else
newBuffer[i] = _list[i];
}
if (alloc)
{
delete[] _list;
_list = newBuffer;
}
itr = _list + pos;
return itr;
}
inline iterator begin() { return (empty() ? NULL : _list); }
inline iterator end() { return (empty() ? NULL : _list + _size); }
void clear()
{
if (_list && !_preAlloc)
{
delete[] _list;
_list = NULL;
}
_size = 0;
}
inline bool empty() { return !_size; }
inline unsigned int size() { return _size; }
inline unsigned int capacity() { return (_size > _preAlloc ? _size : _preAlloc); }
private:
T* _list;
unsigned int _size;
unsigned int _preAlloc;
};
#endif