From f4c20290509d7ed3a8fd5304577e7a4cc0b9d974 Mon Sep 17 00:00:00 2001
From: Mike Buland <eichlan@xagasoft.com>
Date: Tue, 3 Apr 2007 03:49:53 +0000
Subject: Ok, no code is left in src, it's all in src/old.  We'll gradually
 move code back into src as it's fixed and re-org'd.  This includes tests,
 which, I may write a unit test system into libbu++ just to make my life
 easier.

---
 src/old/queue.h | 45 +++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 src/old/queue.h

(limited to 'src/old/queue.h')

diff --git a/src/old/queue.h b/src/old/queue.h
new file mode 100644
index 0000000..692f5d8
--- /dev/null
+++ b/src/old/queue.h
@@ -0,0 +1,45 @@
+#ifndef QUEUE_H
+#define QUEUE_H
+#include "linkedlist.h"
+
+/**
+ * An ultra-simple queue implementation.  It just uses a linked list as it's
+ * container so we don't have to worry about anything!
+ *@author Mike Buland
+ */
+class Queue
+{
+public:
+	/**
+	 * Puts a new item at the end of the queue.
+	 *@param data A new value to put at the end of the queue.
+	 */
+	void enqueue( void *data );
+
+	/**
+	 * Gets the begining item of the queue off and returns it.
+	 *@returns The value at the front of the queue.
+	 */
+	void *dequeue();
+
+	/**
+	 * Checks if the queueu is empty.
+	 *@returns True if the queueu is empty, and false if it has things in it.
+	 */
+	bool isEmpty();
+
+	/**
+	 * Empty the queue.
+	 */
+	void empty();
+	
+	/**
+	 * Get a pointer to the internal list object.
+	 *@returns A pointer to the internal list object.
+	 */
+	LinkedList *getList() { return &lQueueData; };
+
+private:
+	LinkedList lQueueData;	/**< Where all of the real data is stored. */
+};
+#endif
-- 
cgit v1.2.3