X-Git-Url: https://jfr.im/git/irc/gameservirc.git/blobdiff_plain/59dc3990c7a62a9c3ad35142d5ef8a3d2cd02d8e..183a166f401ecd8bb3667ebb6a3ea6fdf0c6e391:/gameserv/list.h

diff --git a/gameserv/list.h b/gameserv/list.h
index d19e556..fc7c3b1 100644
--- a/gameserv/list.h
+++ b/gameserv/list.h
@@ -5,69 +5,88 @@
 #include <cassert>
 #include "listnode.h"
 #include "aClient.h"
-#include "extern.h"
 #include "options.h"
 
 using std::cout;
 using std::endl;
 using std::flush;
 
+void log(const char *fmt, ...);
+
 template <class T>
 class List {
     public:
 	List();		//constructor
 	~List();	//deconstructor
-	void insertAtFront( const T & );
-	void insertAtBack( T *&);
+	T *insertAtFront( const T & );
+	T *insertAtBack( T *&);
+	T *random(); // Returns a random element in the list
+	ListNode<T> *insertAtBack_RLN( T *&);
 	bool removeFromFront( T & );
 	bool removeFromBack( T & );
 	bool del( T *);
 	ListNode < T > *remove( T * );
 	bool isEmpty() const;
+	#ifdef DEBUGMODE
 	void print() const;
+	#endif
+        void deleteNodes();
+
 	ListNode < T > *Find( T * );
         ListNode < T > *First() { return firstPtr; };
 	ListNode < T > *Last() { return lastPtr; };
+	int elements; // Number of elements in the list
     private:
 	ListNode < T > *firstPtr;
 	ListNode < T > *lastPtr;
 
 	ListNode < T > *getNewNode ( const T &  );
+	ListNode < T > *getNewNode ( T &  );
 };
 
 template <class T>
-List<T>::List() : firstPtr (0), lastPtr (0) {}
+List<T>::List() : firstPtr (0), lastPtr (0) {elements = 0;}
 
 template <class T>
-List<T>::~List()
+void List<T>::deleteNodes()
 {
-    if (!isEmpty())
+    if (isEmpty())
+	return;
+    ListNode<T> *it = firstPtr, *tempPtr;
+    while (it)
     {
-	#ifdef DEBUGMODE
-	    log("Destroying Nodes");
-	#endif
+	tempPtr = it;
+	it = it->Next();
+	delete tempPtr;
+    }
+    firstPtr = NULL;
+    lastPtr = NULL;
+    elements = 0;
+}
 
-	ListNode<T> *currentPtr = firstPtr, *tempPtr;
+template <class T>
+List<T>::~List()
+{
+    deleteNodes();
+}
 
-	while (currentPtr) 
-	{
-	    tempPtr = currentPtr;
-	    currentPtr = currentPtr->Next();
-
-	    #ifdef DEBUGMODE
-		log("Deleting Memory address: %s", tempPtr->getData());
-	    #endif
-	    
-		delete tempPtr;
-	}
-	#ifdef DEBUGMODE
-	    log("All Nodes destroyed");
-	#endif
+template<class T>
+T *List<T>::random()
+{
+    if (isEmpty())
+	return NULL;
+
+    int num = rand() % elements;
+    ListNode<T> *it = firstPtr;
+    for (int x = 0; x < num; x++)
+    {
+	it = it->Next();
     }
+    return it->getData();
 }
 
 template<class T>
-void List<T>::insertAtFront( const T &value )
+T *List<T>::insertAtFront( const T &value )
 {
     ListNode<T> *newPtr = getNewNode ( value );
 
@@ -80,10 +99,12 @@ void List<T>::insertAtFront( const T &value )
 	firstPtr->prev = newPtr;
 	firstPtr = newPtr;
     }
+    elements++;
+    return firstPtr->getData();
 }
 
 template<class T>
-void List<T>::insertAtBack(T *&value )
+T *List<T>::insertAtBack(T *&value )
 {
     ListNode<T> *newPtr = getNewNode(*value);
 
@@ -97,6 +118,27 @@ void List<T>::insertAtBack(T *&value )
 	lastPtr->next = newPtr;
 	lastPtr = newPtr;
     }
+    elements++;
+    return lastPtr->getData();
+}
+
+template<class T>
+ListNode<T> *List<T>::insertAtBack_RLN(T *&value )
+{
+    ListNode<T> *newPtr = getNewNode(*value);
+
+    if (isEmpty())
+    {
+	firstPtr = lastPtr = newPtr;
+    }
+    else
+    {
+	newPtr->prev = lastPtr;
+	lastPtr->next = newPtr;
+	lastPtr = newPtr;
+    }
+    elements++;
+    return lastPtr;
 }
 
 
@@ -116,6 +158,7 @@ bool List<T>::removeFromFront( T &value )
 
 	value = tempPtr->getData();
 	delete tempPtr;
+	elements--;
 	return true;
     }
 }
@@ -136,8 +179,8 @@ bool List<T>::removeFromBack( T &value )
 
 	value = tempPtr->getData();
 	delete tempPtr;
+	elements--;
 	return true;
-
     }
 }
 
@@ -154,6 +197,17 @@ ListNode<T> *List<T>::getNewNode( const T &value)
 
     return ptr;
 }
+
+template <class T>
+ListNode<T> *List<T>::getNewNode( T &value)
+{
+    ListNode<T> *ptr = new ListNode<T>(value);
+
+    assert( ptr != 0);
+
+    return ptr;
+}
+
 template<class T>
 ListNode<T> *List<T>::Find( T *value )
 {
@@ -163,6 +217,7 @@ ListNode<T> *List<T>::Find( T *value )
     currentPtr = firstPtr;
     while (currentPtr)
     {
+	cout << currentPtr->getData() << endl << value << endl;
 	if (currentPtr->getData() == value)
 	    return currentPtr;
 	currentPtr = currentPtr->Next();
@@ -184,12 +239,28 @@ void List<T>::print() const
     currentPtr = firstPtr;
     while (currentPtr)
     {
+	/*
 	cout << "aClient: " << *currentPtr->getData() << flush;
 
         if (currentPtr->getData()->stats)
 	    cout << "  Player Name: " << currentPtr->getData()->stats->name 
 		 << "   Password: " << currentPtr->getData()->stats->password << flush;
 	cout << endl;
+	*/
+	/*
+	cout << currentPtr->getData()->getString() << endl;
+	currentPtr = currentPtr->next;
+	*/
+	T *dat;
+	dat = currentPtr->getData();
+	log("name: %s", dat->name);
+	log("weapon: %s", dat->weapon);
+	log("death: %s", dat->death);
+	log("strength: %d", dat->strength);
+	log("exp: %ld", dat->exp);
+	log("gold: %ld", dat->gold);
+	log("maxhp: %d", dat->maxhp);
+	log("hp: %d", dat->hp);
 	currentPtr = currentPtr->next;
     }
 }
@@ -256,6 +327,7 @@ ListNode<T> *List<T>::remove(T *remPtr)
 		firstPtr->prev = 0;
 		return newPtr;
 	    }
+	    elements--;
 	}
 	newPtr = newPtr->next;
     }