]>
Commit | Line | Data |
---|---|---|
1 | #ifndef LIST_H | |
2 | #define LIST_H | |
3 | ||
4 | #include <iostream> | |
5 | #include <cassert> | |
6 | #include "listnode.h" | |
7 | #include "aClient.h" | |
8 | #include "extern.h" | |
9 | #include "options.h" | |
10 | ||
11 | using std::cout; | |
12 | using std::endl; | |
13 | using std::flush; | |
14 | ||
15 | template <class T> | |
16 | class List { | |
17 | public: | |
18 | List(); //constructor | |
19 | ~List(); //deconstructor | |
20 | T *insertAtFront( const T & ); | |
21 | T *insertAtBack( T *&); | |
22 | T *random(); // Returns a random element in the list | |
23 | ListNode<T> *insertAtBack_RLN( T *&); | |
24 | bool removeFromFront( T & ); | |
25 | bool removeFromBack( T & ); | |
26 | bool del( T *); | |
27 | ListNode < T > *remove( T * ); | |
28 | bool isEmpty() const; | |
29 | #ifdef DEBUGMODE | |
30 | void print() const; | |
31 | #endif | |
32 | void deleteNodes(); | |
33 | ||
34 | ListNode < T > *Find( T * ); | |
35 | ListNode < T > *First() { return firstPtr; }; | |
36 | ListNode < T > *Last() { return lastPtr; }; | |
37 | int elements; // Number of elements in the list | |
38 | private: | |
39 | ListNode < T > *firstPtr; | |
40 | ListNode < T > *lastPtr; | |
41 | ||
42 | ListNode < T > *getNewNode ( const T & ); | |
43 | ListNode < T > *getNewNode ( T & ); | |
44 | }; | |
45 | ||
46 | template <class T> | |
47 | List<T>::List() : firstPtr (0), lastPtr (0) {elements = 0;} | |
48 | ||
49 | template <class T> | |
50 | void List<T>::deleteNodes() | |
51 | { | |
52 | if (isEmpty()) | |
53 | return; | |
54 | ListNode<T> *it = firstPtr, *tempPtr; | |
55 | while (it) | |
56 | { | |
57 | tempPtr = it; | |
58 | it = it->Next(); | |
59 | delete tempPtr; | |
60 | } | |
61 | firstPtr = NULL; | |
62 | lastPtr = NULL; | |
63 | elements = 0; | |
64 | } | |
65 | ||
66 | template <class T> | |
67 | List<T>::~List() | |
68 | { | |
69 | deleteNodes(); | |
70 | } | |
71 | ||
72 | template<class T> | |
73 | T *List<T>::random() | |
74 | { | |
75 | if (isEmpty()) | |
76 | return NULL; | |
77 | ||
78 | int num = rand() % elements; | |
79 | ListNode<T> *it = firstPtr; | |
80 | for (int x = 0; x < num; x++) | |
81 | { | |
82 | it = it->Next(); | |
83 | } | |
84 | return it->getData(); | |
85 | } | |
86 | ||
87 | template<class T> | |
88 | T *List<T>::insertAtFront( const T &value ) | |
89 | { | |
90 | ListNode<T> *newPtr = getNewNode ( value ); | |
91 | ||
92 | ||
93 | if (isEmpty()) | |
94 | firstPtr = lastPtr = newPtr; | |
95 | else | |
96 | { | |
97 | newPtr->Next = firstPtr; | |
98 | firstPtr->prev = newPtr; | |
99 | firstPtr = newPtr; | |
100 | } | |
101 | elements++; | |
102 | return firstPtr->getData(); | |
103 | } | |
104 | ||
105 | template<class T> | |
106 | T *List<T>::insertAtBack(T *&value ) | |
107 | { | |
108 | ListNode<T> *newPtr = getNewNode(*value); | |
109 | ||
110 | if (isEmpty()) | |
111 | { | |
112 | firstPtr = lastPtr = newPtr; | |
113 | } | |
114 | else | |
115 | { | |
116 | newPtr->prev = lastPtr; | |
117 | lastPtr->next = newPtr; | |
118 | lastPtr = newPtr; | |
119 | } | |
120 | elements++; | |
121 | return lastPtr->getData(); | |
122 | } | |
123 | ||
124 | template<class T> | |
125 | ListNode<T> *List<T>::insertAtBack_RLN(T *&value ) | |
126 | { | |
127 | ListNode<T> *newPtr = getNewNode(*value); | |
128 | ||
129 | if (isEmpty()) | |
130 | { | |
131 | firstPtr = lastPtr = newPtr; | |
132 | } | |
133 | else | |
134 | { | |
135 | newPtr->prev = lastPtr; | |
136 | lastPtr->next = newPtr; | |
137 | lastPtr = newPtr; | |
138 | } | |
139 | elements++; | |
140 | return lastPtr; | |
141 | } | |
142 | ||
143 | ||
144 | template <class T> | |
145 | bool List<T>::removeFromFront( T &value ) | |
146 | { | |
147 | if ( isEmpty()) | |
148 | return false; | |
149 | else | |
150 | { | |
151 | ListNode<T> *tempPtr = firstPtr; | |
152 | ||
153 | if ( firstPtr == lastPtr ) | |
154 | firstPtr = lastPtr = 0; | |
155 | else | |
156 | firstPtr = firstPtr->next; | |
157 | ||
158 | value = tempPtr->getData(); | |
159 | delete tempPtr; | |
160 | elements--; | |
161 | return true; | |
162 | } | |
163 | } | |
164 | ||
165 | template <class T> | |
166 | bool List<T>::removeFromBack( T &value ) | |
167 | { | |
168 | if ( isEmpty() ) | |
169 | return false; | |
170 | else | |
171 | { | |
172 | ListNode<T> *tempPtr = lastPtr; | |
173 | ||
174 | if ( firstPtr == lastPtr ) | |
175 | lastPtr = firstPtr = 0; | |
176 | else | |
177 | lastPtr = lastPtr->prev; | |
178 | ||
179 | value = tempPtr->getData(); | |
180 | delete tempPtr; | |
181 | elements--; | |
182 | return true; | |
183 | } | |
184 | } | |
185 | ||
186 | template <class T> | |
187 | bool List<T>::isEmpty() const | |
188 | { return firstPtr == 0 && lastPtr == 0; } | |
189 | ||
190 | template <class T> | |
191 | ListNode<T> *List<T>::getNewNode( const T &value) | |
192 | { | |
193 | ListNode<T> *ptr = new ListNode<T>(value); | |
194 | ||
195 | assert( ptr != 0); | |
196 | ||
197 | return ptr; | |
198 | } | |
199 | ||
200 | template <class T> | |
201 | ListNode<T> *List<T>::getNewNode( T &value) | |
202 | { | |
203 | ListNode<T> *ptr = new ListNode<T>(value); | |
204 | ||
205 | assert( ptr != 0); | |
206 | ||
207 | return ptr; | |
208 | } | |
209 | ||
210 | template<class T> | |
211 | ListNode<T> *List<T>::Find( T *value ) | |
212 | { | |
213 | if (isEmpty()) {return NULL;} | |
214 | ||
215 | ListNode<T> *currentPtr; | |
216 | currentPtr = firstPtr; | |
217 | while (currentPtr) | |
218 | { | |
219 | cout << currentPtr->getData() << endl << value << endl; | |
220 | if (currentPtr->getData() == value) | |
221 | return currentPtr; | |
222 | currentPtr = currentPtr->Next(); | |
223 | } | |
224 | return NULL; | |
225 | } | |
226 | ||
227 | #ifdef DEBUGMODE | |
228 | template <class T> | |
229 | void List<T>::print() const | |
230 | { | |
231 | if (isEmpty()) | |
232 | { | |
233 | cout << "Empty list" << endl; | |
234 | return; | |
235 | } | |
236 | ||
237 | ListNode<T> *currentPtr; | |
238 | currentPtr = firstPtr; | |
239 | while (currentPtr) | |
240 | { | |
241 | /* | |
242 | cout << "aClient: " << *currentPtr->getData() << flush; | |
243 | ||
244 | if (currentPtr->getData()->stats) | |
245 | cout << " Player Name: " << currentPtr->getData()->stats->name | |
246 | << " Password: " << currentPtr->getData()->stats->password << flush; | |
247 | cout << endl; | |
248 | */ | |
249 | /* | |
250 | cout << currentPtr->getData()->getString() << endl; | |
251 | currentPtr = currentPtr->next; | |
252 | */ | |
253 | T *dat; | |
254 | dat = currentPtr->getData(); | |
255 | log("name: %s", dat->name); | |
256 | log("weapon: %s", dat->weapon); | |
257 | log("death: %s", dat->death); | |
258 | log("strength: %d", dat->strength); | |
259 | log("exp: %ld", dat->exp); | |
260 | log("gold: %ld", dat->gold); | |
261 | log("maxhp: %d", dat->maxhp); | |
262 | log("hp: %d", dat->hp); | |
263 | currentPtr = currentPtr->next; | |
264 | } | |
265 | } | |
266 | #endif | |
267 | ||
268 | template <class T> | |
269 | bool List<T>::del(T *remPtr) | |
270 | { | |
271 | ListNode<T> *removed = remove( remPtr ); | |
272 | if (removed != NULL) | |
273 | { | |
274 | delete removed; | |
275 | return true; | |
276 | } | |
277 | return false; | |
278 | } | |
279 | ||
280 | template <class T> | |
281 | ListNode<T> *List<T>::remove(T *remPtr) | |
282 | { | |
283 | ListNode<T> *newPtr = firstPtr; | |
284 | T *testPtr; | |
285 | ||
286 | if (isEmpty()) | |
287 | return false; | |
288 | ||
289 | while (newPtr) | |
290 | { | |
291 | testPtr = newPtr->getData(); | |
292 | if (testPtr == remPtr) | |
293 | { | |
294 | if (firstPtr == lastPtr) | |
295 | { | |
296 | #ifdef DEBUGMODE | |
297 | log("One Element. Deleting it"); | |
298 | #endif | |
299 | firstPtr = lastPtr = NULL; | |
300 | return newPtr; | |
301 | } | |
302 | else if (newPtr != lastPtr && newPtr != firstPtr) | |
303 | { | |
304 | #ifdef DEBUGMODE | |
305 | log("Many elements, this one is in the middle. Deleting it, linking front to back, and back to front."); | |
306 | #endif | |
307 | newPtr->prev->next = newPtr->next; | |
308 | newPtr->next->prev = newPtr->prev; | |
309 | return newPtr; | |
310 | } | |
311 | else if (newPtr == lastPtr) | |
312 | { | |
313 | #ifdef DEBUGMODE | |
314 | log("This was the last element. Deleting it, and pointing the tail to its previous element."); | |
315 | #endif | |
316 | lastPtr = newPtr->prev; | |
317 | lastPtr->next = 0; | |
318 | return newPtr; | |
319 | } | |
320 | else if (newPtr == firstPtr) | |
321 | { | |
322 | #ifdef DEBUGMODE | |
323 | log("This was the first element. Deleting it, and pointing the head to its next element."); | |
324 | #endif | |
325 | firstPtr = newPtr->next; | |
326 | firstPtr->prev = 0; | |
327 | return newPtr; | |
328 | } | |
329 | elements--; | |
330 | } | |
331 | newPtr = newPtr->next; | |
332 | } | |
333 | return NULL; | |
334 | } | |
335 | #endif |