-
Notifications
You must be signed in to change notification settings - Fork 3
/
SimpleMap.h
302 lines (242 loc) · 6.81 KB
/
SimpleMap.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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
// SimpleMap adapted by JeroenSt:
// - Removed map sorting on put
#ifndef SimpleMap_h
#define SimpleMap_h
#include <stddef.h>
#include <functional>
template<class T, class U>
struct SimpleMapNode {
T key;
U data;
SimpleMapNode<T, U>* next;
};
template<typename T, typename U>
class SimpleMap {
public:
int (*compare)(T & a, T & b);
SimpleMap(int (*compare)(T & a, T & b));
virtual ~SimpleMap();
virtual int size();
virtual void clear();
virtual void removekey(T key);
virtual void removeindex(int i);
virtual void put(T key, U obj);
virtual U get(T key);
virtual T getKey(int i);
virtual U getData(int i);
virtual int getIndex(T key);
virtual bool has(T key);
virtual void lock();
virtual void unlock();
virtual bool isLocked();
protected:
int listSize;
SimpleMapNode<T, U>* listBegin;
SimpleMapNode<T, U>* listEnd;
bool locked = false;
// Helps get() method by saving last position
SimpleMapNode<T, U>* lastNodeGot = NULL;
int lastIndexGot = -1;
bool isCached = false;
virtual SimpleMapNode<T, U>* getNode(T key);
virtual SimpleMapNode<T, U>* getNodeIndex(int index);
};
template<typename T, typename U>
SimpleMap<T, U>::SimpleMap(int (*compare)(T & a, T & b)) {
SimpleMap<T, U>::compare = compare;
listBegin = NULL;
listEnd = NULL;
listSize = 0;
isCached = false;
lastIndexGot = -1;
lastNodeGot = NULL;
}
// Clear Nodes and free Memory
template<typename T, typename U>
SimpleMap<T, U>::~SimpleMap() {
clear();
}
template<typename T, typename U>
U SimpleMap<T, U>::get(T key) {
SimpleMapNode<T, U>* h = getNode(key);
return h ? h->data : U();
}
template<typename T, typename U>
SimpleMapNode<T, U>* SimpleMap<T, U>::getNode(T key) {
if (listSize > 0) {
int lowerEnd = 0;
int upperEnd = listSize - 1;
while (lowerEnd <= upperEnd) {
int res = compare(key, getNodeIndex(lowerEnd)->key);
if (res == 0) {
return lastNodeGot;
}
lowerEnd++;
}
}
return NULL;
}
template<typename T, typename U>
SimpleMapNode<T, U>* SimpleMap<T, U>::getNodeIndex(int index) {
if ((index < 0) || (index >= listSize)) {
return NULL;
}
SimpleMapNode<T, U>* hNode = listBegin;
int c = 0;
if (isCached && (index >= lastIndexGot)) {
c = lastIndexGot;
hNode = lastNodeGot;
}
while (hNode != NULL && c < index) {
hNode = hNode->next;
c++;
}
if (hNode) {
isCached = true;
lastIndexGot = c;
lastNodeGot = hNode;
}
return hNode;
}
template<typename T, typename U>
void SimpleMap<T, U>::clear() {
unlock();
SimpleMapNode<T, U>* h = listBegin;
SimpleMapNode<T, U>* toDelete;
while (h != NULL) {
toDelete = h;
h = h->next;
delete toDelete;
}
listBegin = NULL;
listEnd = NULL;
listSize = 0;
isCached = false;
lastIndexGot = -1;
lastNodeGot = NULL;
}
template<typename T, typename U>
int SimpleMap<T, U>::size() {
return listSize;
}
template<typename T, typename U>
void SimpleMap<T, U>::put(T key, U obj) {
// create new node
SimpleMapNode<T, U>* newNode = new SimpleMapNode<T, U>();
newNode->next = NULL;
newNode->data = obj;
newNode->key = key;
// look if already in list
SimpleMapNode<T, U>* h = listBegin;
SimpleMapNode<T, U>* p = NULL;
bool found = false;
int c = 0;
if (listSize > 0) {
while (h != NULL && !found) {
if (compare(h->key, key) == 0) {
found = true;
} else {
p = h;
h = h->next;
c++;
}
}
}
// replace old node with new one
if (found) {
if (h == listBegin) listBegin = newNode;
if (h == listEnd) listEnd = newNode;
if (p) p->next = newNode;
newNode->next = h->next;
delete h;
lastIndexGot = c;
lastNodeGot = newNode;
isCached = true;
}
// create new node
else if (!locked) {
if (listSize == 0) {
// add at start (first node)
listBegin = newNode;
listEnd = newNode;
lastIndexGot = 0;
} else {
// add node at end
listEnd->next = newNode;
listEnd = newNode;
lastIndexGot = listSize;
}
listSize++;
isCached = true;
lastNodeGot = newNode;
}
}
template<typename T, typename U>
void SimpleMap<T, U>::removekey(T key) {
if ((listSize > 0) && !locked) {
if ((compare(key, listBegin->key) < 0) || (compare(key, listEnd->key) > 0)) return;
SimpleMapNode<T, U>* h = listBegin;
SimpleMapNode<T, U>* p = NULL;
bool found = false;
while (h != NULL && !found) {
if (h->key == key) {
found = true;
} else {
p = h;
h = h->next;
}
}
if (found) {
if (p) p->next = h->next;
else listBegin = h->next;
if (listEnd == h) listEnd = p;
listSize--;
delete h;
}
}
}
template<typename T, typename U>
void SimpleMap<T, U>::removeindex(int i) {
if (listSize > 0) {
SimpleMapNode<T, U>* h = getNodeIndex(i);
if (h != NULL) {
SimpleMapNode<T, U>* p = getNodeIndex(i - 1);
if (p != NULL) p->next = h->next;
if (h == listBegin) listBegin = h->next;
if (h == listEnd) listEnd = p;
listSize--;
delete h;
}
}
}
template<typename T, typename U>
bool SimpleMap<T, U>::has(T key) {
return getNode(key) != NULL;
}
template<typename T, typename U>
T SimpleMap<T, U>::getKey(int i) {
SimpleMapNode<T, U>* h = getNodeIndex(i);
return h ? h->key : T();
}
template<typename T, typename U>
U SimpleMap<T, U>::getData(int i) {
SimpleMapNode<T, U>* h = getNodeIndex(i);
return h ? h->data : U();
}
template<typename T, typename U>
int SimpleMap<T, U>::getIndex(T key) {
return getNode(key) ? lastIndexGot : -1;
}
template<typename T, typename U>
void SimpleMap<T, U>::lock() {
locked = true;
}
template<typename T, typename U>
void SimpleMap<T, U>::unlock() {
locked = false;
}
template<typename T, typename U>
bool SimpleMap<T, U>::isLocked() {
return locked;
}
#endif // ifndef SimpleMap_h