X-Git-Url: http://shamusworld.gotdns.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=src%2Flist.h;h=cc430d055b5ad56d364c8994a6faf96ed42749ad;hb=1881acb17ed405cdb5aa2cb333a7af77f644a86d;hp=da0501f6e863cb1d75fe0914c0b0cf8067a0c1a3;hpb=20195737e60552ca35c3212db45ece6c4db6bb1d;p=ttedit

diff --git a/src/list.h b/src/list.h
old mode 100755
new mode 100644
index da0501f..cc430d0
--- a/src/list.h
+++ b/src/list.h
@@ -1,279 +1,279 @@
-//
-// A generic list class using a circular singly linked list
-// by James L. Hammons
-// (C) 2004 Underground Software
-//
-// Based upon work I did for CS240 Project 5 at Cal Poly Pomona for Dr. Bruce Hillam.
-// Hello Dr. Hillam! :-)
-//
-// JLH = James L. Hammons <jlhamm@acm.org>
-//
-// Who  When        What
-// ---  ----------  -------------------------------------------------------------
-// JLH  08/30/1999  Created this file
-// JLH  05/11/2004  Cleaned up a few things in the implementation
-//
-
-
-// Some exception constants
-
-#define LIST_EMPTY		1
-#define OUT_OF_RANGE	2
-
-template <class T> class List;					// Forward declaration...
-template <class T> class Node
-{
-	friend class List<T>;
-
-	public:
-		Node(void): next(NULL) {}
-		Node(const T d, Node * ptr = NULL): data(d), next(ptr) {}
-
-	private:
-		T data;
-		Node * next;
-};
-
-template <class T> class List      
-{
-	// This class implements the following exceptions:
-	// LIST_EMPTY is thrown if you attempt to remove an object from an empty list.
-	// OUT_OF_RANGE is thrown if you attempt to Add or Get from a position that
-	// does not exist for the list.
-
-	private:
-		Node<T> * last;
-		int length;
-
-	public:
-		List(void);
-		~List();
-		bool operator==(List &l);
-		void AddAtFront(T data);
-		void AddAtRear(T data);
-		void AddAtPosition(int pos, T data);
-		T GetFront(void);
-		T GetRear(void);
-		T GetPosition(int pos);
-		T PeekFront(void);
-		T PeekRear(void);
-		T PeekPosition(int pos);
-		bool IsEmpty(void);
-		int Length(void);
-};
-
-//
-// List class implementation
-//
-template <class T> List<T>::List(void)
-{
-	last = NULL;
-	length = 0;
-}
-
-template <class T> List<T>::~List()
-{
-	while (length)								// Destroy all nodes that were created...
-	{
-		Node<T> * tmp = last;
-		last = last->next;
-		delete tmp;
-		length--;
-	}
-}
-
-template <class T> bool List<T>::operator==(List &l)
-{
-	if (Length() != l.Length())
-		return false;
-
-	Node<T> * ptr1 = last->next, * ptr2 = l.last->next;
-
-	do
-	{
-		if (ptr1->data != ptr2->data)
-			return false;
-
-		ptr1 = ptr1->next, ptr2 = ptr2->next;
-	}
-	while (ptr1 != last);
-
-	return true;
-}
-
-template <class T> void List<T>::AddAtFront(T data)
-{
-	Node<T> * newNode = new Node<T>(data);
-
-	if (last == NULL)							// i.e., the list is empty...
-		last = newNode->next = newNode;
-	else
-	{
-		newNode->next = last->next;
-		last->next = newNode;
-	}
-
-	length++;
-}
-
-template <class T> void List<T>::AddAtRear(T data)
-{
-	Node<T> * newNode = new Node<T>(data);
-
-	if (last == NULL)							// i.e., the list is empty...
-		last = newNode->next = newNode;
-	else
-	{
-		newNode->next = last->next;
-		last->next = newNode;
-		last = newNode;
-	}
-
-	length++;
-}
-
-template <class T> void List<T>::AddAtPosition(int pos, T data)
-{
-	if ((pos < 1) || (pos > length))
-		throw OUT_OF_RANGE;
-
-	if (pos == 1)
-		AddAtFront(data);						// Why reinvent the wheel?
-
-	if (pos == length)
-		AddAtRear(data);
-
-	Node<T> * newNode = new Node<T>(data), * tmp = last;
-
-	for(int i=1; i!=pos; i++)					// Make tmp point to node ahead of add position
-		tmp = tmp->next;
-
-	newNode->next = tmp->next;
-	tmp->next = newNode;
-
-	length++;
-}
-
-template <class T> T List<T>::GetFront(void)
-{
-	if (IsEmpty())
-		throw LIST_EMPTY;
-
-	T retVal = last->next->data;
-	Node<T> * ptr = last->next;
-
-	if (length == 1)
-		last = NULL;
-	else
-		last->next = last->next->next;
-
-	delete ptr;
-	length--;
-
-	return retVal;
-}
-
-template <class T> T List<T>::GetRear(void)
-{
-	if (IsEmpty())
-		throw LIST_EMPTY;
-
-	T retVal = last->data;
-	Node<T> * ptr = last;
-
-	if (length == 1)
-	{
-		delete last;
-		last = NULL;
-	}
-	else
-	{
-		while (ptr->next != last)
-			ptr = ptr->next;
-
-		ptr->next = ptr->next->next;
-		delete last;
-		last = ptr;  
-	}
-
-	length--;
-
-	return retVal;
-}
-
-template <class T> T List<T>::GetPosition(int pos)
-{
-	if (IsEmpty())
-		throw LIST_EMPTY;
-
-	if ((pos < 1) || (pos > length))
-		throw OUT_OF_RANGE;
-
-	if (pos == 1)
-		return GetFront();						// Why reinvent the wheel?
-
-	if (pos == length)
-		return GetRear();
-
-	Node<T> * tmp = last;
-
-	for(int i=1; i!=pos; i++)					// Make tmp point to node ahead of del position
-		tmp = tmp->next;
-
-	Node<T> * nodeToDelete = tmp->next;
-		T retVal = nodeToDelete->data;
-
-	tmp->next = tmp->next->next;
-	delete nodeToDelete;
-
-	length--;
-	return retVal;
-}
-
-template <class T> T List<T>::PeekFront(void)
-{
-	if (IsEmpty())
-		throw LIST_EMPTY;
-
-	return last->next->data;
-}
-
-template <class T> T List<T>::PeekRear(void)
-{
-	if (IsEmpty())
-		throw LIST_EMPTY;
-
-	return last->data;
-}
-
-template <class T> T List<T>::PeekPosition(int pos)
-{
-	if (IsEmpty())
-		throw LIST_EMPTY;
-
-	if ((pos < 1) || (pos > length))
-		throw OUT_OF_RANGE;
-
-	if (pos == 1)
-		return PeekFront();						// Why reinvent the wheel?
-
-	if (pos == length)
-		return PeekRear();
-
-	Node<T> * tmp = last;
-
-	for(int i=1; i!=pos; i++)
-		tmp = tmp->next;
-
-	return tmp->next->data;
-}
-
-template <class T> inline bool List<T>::IsEmpty(void)
-{
-	return (bool)(length == 0);
-}
-
-template <class T> inline int List<T>::Length(void)
-{
-	return length;
-}
+//
+// A generic list class using a circular singly linked list
+// by James Hammons
+// (C) 2016 Underground Software
+//
+// Based upon work I did for CS240 Project 5 at Cal Poly Pomona for Dr. Bruce
+// Hillam. Hello Dr. Hillam! :-)
+//
+// JLH = James L. Hammons <jlhamm@acm.org>
+//
+// Who  When        What
+// ---  ----------  -----------------------------------------------------------
+// JLH  08/30/1999  Created this file
+// JLH  05/11/2004  Cleaned up a few things in the implementation
+//
+
+
+// Some exception constants
+
+#define LIST_EMPTY		1
+#define OUT_OF_RANGE	2
+
+template <class T> class List;					// Forward declaration...
+template <class T> class Node
+{
+	friend class List<T>;
+
+	public:
+		Node(void): next(NULL) {}
+		Node(const T d, Node * ptr = NULL): data(d), next(ptr) {}
+
+	private:
+		T data;
+		Node * next;
+};
+
+template <class T> class List      
+{
+	// This class implements the following exceptions:
+	// LIST_EMPTY is thrown if you attempt to remove an object from an empty list.
+	// OUT_OF_RANGE is thrown if you attempt to Add or Get from a position that
+	// does not exist for the list.
+
+	private:
+		Node<T> * last;
+		int length;
+
+	public:
+		List(void);
+		~List();
+		bool operator==(List &l);
+		void AddAtFront(T data);
+		void AddAtRear(T data);
+		void AddAtPosition(int pos, T data);
+		T GetFront(void);
+		T GetRear(void);
+		T GetPosition(int pos);
+		T PeekFront(void);
+		T PeekRear(void);
+		T PeekPosition(int pos);
+		bool IsEmpty(void);
+		int Length(void);
+};
+
+//
+// List class implementation
+//
+template <class T> List<T>::List(void)
+{
+	last = NULL;
+	length = 0;
+}
+
+template <class T> List<T>::~List()
+{
+	while (length)								// Destroy all nodes that were created...
+	{
+		Node<T> * tmp = last;
+		last = last->next;
+		delete tmp;
+		length--;
+	}
+}
+
+template <class T> bool List<T>::operator==(List &l)
+{
+	if (Length() != l.Length())
+		return false;
+
+	Node<T> * ptr1 = last->next, * ptr2 = l.last->next;
+
+	do
+	{
+		if (ptr1->data != ptr2->data)
+			return false;
+
+		ptr1 = ptr1->next, ptr2 = ptr2->next;
+	}
+	while (ptr1 != last);
+
+	return true;
+}
+
+template <class T> void List<T>::AddAtFront(T data)
+{
+	Node<T> * newNode = new Node<T>(data);
+
+	if (last == NULL)							// i.e., the list is empty...
+		last = newNode->next = newNode;
+	else
+	{
+		newNode->next = last->next;
+		last->next = newNode;
+	}
+
+	length++;
+}
+
+template <class T> void List<T>::AddAtRear(T data)
+{
+	Node<T> * newNode = new Node<T>(data);
+
+	if (last == NULL)							// i.e., the list is empty...
+		last = newNode->next = newNode;
+	else
+	{
+		newNode->next = last->next;
+		last->next = newNode;
+		last = newNode;
+	}
+
+	length++;
+}
+
+template <class T> void List<T>::AddAtPosition(int pos, T data)
+{
+	if ((pos < 1) || (pos > length))
+		throw OUT_OF_RANGE;
+
+	if (pos == 1)
+		AddAtFront(data);						// Why reinvent the wheel?
+
+	if (pos == length)
+		AddAtRear(data);
+
+	Node<T> * newNode = new Node<T>(data), * tmp = last;
+
+	for(int i=1; i!=pos; i++)					// Make tmp point to node ahead of add position
+		tmp = tmp->next;
+
+	newNode->next = tmp->next;
+	tmp->next = newNode;
+
+	length++;
+}
+
+template <class T> T List<T>::GetFront(void)
+{
+	if (IsEmpty())
+		throw LIST_EMPTY;
+
+	T retVal = last->next->data;
+	Node<T> * ptr = last->next;
+
+	if (length == 1)
+		last = NULL;
+	else
+		last->next = last->next->next;
+
+	delete ptr;
+	length--;
+
+	return retVal;
+}
+
+template <class T> T List<T>::GetRear(void)
+{
+	if (IsEmpty())
+		throw LIST_EMPTY;
+
+	T retVal = last->data;
+	Node<T> * ptr = last;
+
+	if (length == 1)
+	{
+		delete last;
+		last = NULL;
+	}
+	else
+	{
+		while (ptr->next != last)
+			ptr = ptr->next;
+
+		ptr->next = ptr->next->next;
+		delete last;
+		last = ptr;  
+	}
+
+	length--;
+
+	return retVal;
+}
+
+template <class T> T List<T>::GetPosition(int pos)
+{
+	if (IsEmpty())
+		throw LIST_EMPTY;
+
+	if ((pos < 1) || (pos > length))
+		throw OUT_OF_RANGE;
+
+	if (pos == 1)
+		return GetFront();						// Why reinvent the wheel?
+
+	if (pos == length)
+		return GetRear();
+
+	Node<T> * tmp = last;
+
+	for(int i=1; i!=pos; i++)					// Make tmp point to node ahead of del position
+		tmp = tmp->next;
+
+	Node<T> * nodeToDelete = tmp->next;
+		T retVal = nodeToDelete->data;
+
+	tmp->next = tmp->next->next;
+	delete nodeToDelete;
+
+	length--;
+	return retVal;
+}
+
+template <class T> T List<T>::PeekFront(void)
+{
+	if (IsEmpty())
+		throw LIST_EMPTY;
+
+	return last->next->data;
+}
+
+template <class T> T List<T>::PeekRear(void)
+{
+	if (IsEmpty())
+		throw LIST_EMPTY;
+
+	return last->data;
+}
+
+template <class T> T List<T>::PeekPosition(int pos)
+{
+	if (IsEmpty())
+		throw LIST_EMPTY;
+
+	if ((pos < 1) || (pos > length))
+		throw OUT_OF_RANGE;
+
+	if (pos == 1)
+		return PeekFront();						// Why reinvent the wheel?
+
+	if (pos == length)
+		return PeekRear();
+
+	Node<T> * tmp = last;
+
+	for(int i=1; i!=pos; i++)
+		tmp = tmp->next;
+
+	return tmp->next->data;
+}
+
+template <class T> inline bool List<T>::IsEmpty(void)
+{
+	return (bool)(length == 0);
+}
+
+template <class T> inline int List<T>::Length(void)
+{
+	return length;
+}