]>
jfr.im git - irc/gameservirc.git/blob - gameserv/list.h
19 ~List(); //deconstructor
20 T
*insertAtFront( const T
& );
21 T
*insertAtBack( T
*&);
22 ListNode
<T
> *insertAtBack_RLN( T
*&);
23 bool removeFromFront( T
& );
24 bool removeFromBack( T
& );
26 ListNode
< T
> *remove( T
* );
33 ListNode
< T
> *Find( T
* );
34 ListNode
< T
> *First() { return firstPtr
; };
35 ListNode
< T
> *Last() { return lastPtr
; };
37 ListNode
< T
> *firstPtr
;
38 ListNode
< T
> *lastPtr
;
40 ListNode
< T
> *getNewNode ( const T
& );
44 List
<T
>::List() : firstPtr (0), lastPtr (0) {}
47 void List
<T
>::deleteNodes()
51 ListNode
<T
> *it
= firstPtr
, *tempPtr
;
69 T
*List
<T
>::insertAtFront( const T
&value
)
71 ListNode
<T
> *newPtr
= getNewNode ( value
);
75 firstPtr
= lastPtr
= newPtr
;
78 newPtr
->Next
= firstPtr
;
79 firstPtr
->prev
= newPtr
;
82 return firstPtr
->getData();
86 T
*List
<T
>::insertAtBack(T
*&value
)
88 ListNode
<T
> *newPtr
= getNewNode(*value
);
92 firstPtr
= lastPtr
= newPtr
;
96 newPtr
->prev
= lastPtr
;
97 lastPtr
->next
= newPtr
;
100 return lastPtr
->getData();
104 ListNode
<T
> *List
<T
>::insertAtBack_RLN(T
*&value
)
106 ListNode
<T
> *newPtr
= getNewNode(*value
);
110 firstPtr
= lastPtr
= newPtr
;
114 newPtr
->prev
= lastPtr
;
115 lastPtr
->next
= newPtr
;
123 bool List
<T
>::removeFromFront( T
&value
)
129 ListNode
<T
> *tempPtr
= firstPtr
;
131 if ( firstPtr
== lastPtr
)
132 firstPtr
= lastPtr
= 0;
134 firstPtr
= firstPtr
->next
;
136 value
= tempPtr
->getData();
143 bool List
<T
>::removeFromBack( T
&value
)
149 ListNode
<T
> *tempPtr
= lastPtr
;
151 if ( firstPtr
== lastPtr
)
152 lastPtr
= firstPtr
= 0;
154 lastPtr
= lastPtr
->prev
;
156 value
= tempPtr
->getData();
164 bool List
<T
>::isEmpty() const
165 { return firstPtr
== 0 && lastPtr
== 0; }
168 ListNode
<T
> *List
<T
>::getNewNode( const T
&value
)
170 ListNode
<T
> *ptr
= new ListNode
<T
>(value
);
177 ListNode
<T
> *List
<T
>::Find( T
*value
)
179 if (isEmpty()) {return NULL
;}
181 ListNode
<T
> *currentPtr
;
182 currentPtr
= firstPtr
;
185 cout
<< currentPtr
->getData() << endl
<< value
<< endl
;
186 if (currentPtr
->getData() == value
)
188 currentPtr
= currentPtr
->Next();
195 void List
<T
>::print() const
199 cout
<< "Empty list" << endl
;
203 ListNode
<T
> *currentPtr
;
204 currentPtr
= firstPtr
;
208 cout << "aClient: " << *currentPtr->getData() << flush;
210 if (currentPtr->getData()->stats)
211 cout << " Player Name: " << currentPtr->getData()->stats->name
212 << " Password: " << currentPtr->getData()->stats->password << flush;
215 cout
<< currentPtr
->getData()->getString() << endl
;
216 currentPtr
= currentPtr
->next
;
222 bool List
<T
>::del(T
*remPtr
)
224 ListNode
<T
> *removed
= remove( remPtr
);
234 ListNode
<T
> *List
<T
>::remove(T
*remPtr
)
236 ListNode
<T
> *newPtr
= firstPtr
;
244 testPtr
= newPtr
->getData();
245 if (testPtr
== remPtr
)
247 if (firstPtr
== lastPtr
)
250 log("One Element. Deleting it");
252 firstPtr
= lastPtr
= NULL
;
255 else if (newPtr
!= lastPtr
&& newPtr
!= firstPtr
)
258 log("Many elements, this one is in the middle. Deleting it, linking front to back, and back to front.");
260 newPtr
->prev
->next
= newPtr
->next
;
261 newPtr
->next
->prev
= newPtr
->prev
;
264 else if (newPtr
== lastPtr
)
267 log("This was the last element. Deleting it, and pointing the tail to its previous element.");
269 lastPtr
= newPtr
->prev
;
273 else if (newPtr
== firstPtr
)
276 log("This was the first element. Deleting it, and pointing the head to its next element.");
278 firstPtr
= newPtr
->next
;
283 newPtr
= newPtr
->next
;