]>
jfr.im git - irc/gameservirc.git/blob - gameserv/list.h
19 ~List(); //deconstructor
20 void insertAtFront( const T
& );
21 void insertAtBack( T
*&);
22 bool removeFromFront( T
& );
23 bool removeFromBack( T
& );
25 ListNode
< T
> *remove( T
* );
28 ListNode
< T
> *Find( T
* );
29 ListNode
< T
> *First() { return firstPtr
; };
30 ListNode
< T
> *Last() { return lastPtr
; };
32 ListNode
< T
> *firstPtr
;
33 ListNode
< T
> *lastPtr
;
35 ListNode
< T
> *getNewNode ( const T
& );
39 List
<T
>::List() : firstPtr (0), lastPtr (0) {}
47 log("Destroying Nodes");
50 ListNode
<T
> *currentPtr
= firstPtr
, *tempPtr
;
55 currentPtr
= currentPtr
->Next();
58 log("Deleting Memory address: %s", tempPtr
->getData());
64 log("All Nodes destroyed");
70 void List
<T
>::insertAtFront( const T
&value
)
72 ListNode
<T
> *newPtr
= getNewNode ( value
);
76 firstPtr
= lastPtr
= newPtr
;
79 newPtr
->Next
= firstPtr
;
80 firstPtr
->prev
= newPtr
;
86 void List
<T
>::insertAtBack(T
*&value
)
88 ListNode
<T
> *newPtr
= getNewNode(*value
);
92 firstPtr
= lastPtr
= newPtr
;
96 newPtr
->prev
= lastPtr
;
97 lastPtr
->next
= newPtr
;
104 bool List
<T
>::removeFromFront( T
&value
)
110 ListNode
<T
> *tempPtr
= firstPtr
;
112 if ( firstPtr
== lastPtr
)
113 firstPtr
= lastPtr
= 0;
115 firstPtr
= firstPtr
->next
;
117 value
= tempPtr
->getData();
124 bool List
<T
>::removeFromBack( T
&value
)
130 ListNode
<T
> *tempPtr
= lastPtr
;
132 if ( firstPtr
== lastPtr
)
133 lastPtr
= firstPtr
= 0;
135 lastPtr
= lastPtr
->prev
;
137 value
= tempPtr
->getData();
145 bool List
<T
>::isEmpty() const
146 { return firstPtr
== 0 && lastPtr
== 0; }
149 ListNode
<T
> *List
<T
>::getNewNode( const T
&value
)
151 ListNode
<T
> *ptr
= new ListNode
<T
>(value
);
158 ListNode
<T
> *List
<T
>::Find( T
*value
)
160 if (isEmpty()) {return NULL
;}
162 ListNode
<T
> *currentPtr
;
163 currentPtr
= firstPtr
;
166 if (currentPtr
->getData() == value
)
168 currentPtr
= currentPtr
->Next();
175 void List
<T
>::print() const
179 cout
<< "Empty list" << endl
;
183 ListNode
<T
> *currentPtr
;
184 currentPtr
= firstPtr
;
187 cout
<< "aClient: " << *currentPtr
->getData() << flush
;
189 if (currentPtr
->getData()->stats
)
190 cout
<< " Player Name: " << currentPtr
->getData()->stats
->name
191 << " Password: " << currentPtr
->getData()->stats
->password
<< flush
;
193 currentPtr
= currentPtr
->next
;
199 bool List
<T
>::del(T
*remPtr
)
201 ListNode
<T
> *removed
= remove( remPtr
);
211 ListNode
<T
> *List
<T
>::remove(T
*remPtr
)
213 ListNode
<T
> *newPtr
= firstPtr
;
221 testPtr
= newPtr
->getData();
222 if (testPtr
== remPtr
)
224 if (firstPtr
== lastPtr
)
227 log("One Element. Deleting it");
229 firstPtr
= lastPtr
= NULL
;
232 else if (newPtr
!= lastPtr
&& newPtr
!= firstPtr
)
235 log("Many elements, this one is in the middle. Deleting it, linking front to back, and back to front.");
237 newPtr
->prev
->next
= newPtr
->next
;
238 newPtr
->next
->prev
= newPtr
->prev
;
241 else if (newPtr
== lastPtr
)
244 log("This was the last element. Deleting it, and pointing the tail to its previous element.");
246 lastPtr
= newPtr
->prev
;
250 else if (newPtr
== firstPtr
)
253 log("This was the first element. Deleting it, and pointing the head to its next element.");
255 firstPtr
= newPtr
->next
;
260 newPtr
= newPtr
->next
;