diff options
Diffstat (limited to 'src/old/queue.h')
| -rw-r--r-- | src/old/queue.h | 45 |
1 files changed, 0 insertions, 45 deletions
diff --git a/src/old/queue.h b/src/old/queue.h deleted file mode 100644 index 692f5d8..0000000 --- a/src/old/queue.h +++ /dev/null | |||
| @@ -1,45 +0,0 @@ | |||
| 1 | #ifndef QUEUE_H | ||
| 2 | #define QUEUE_H | ||
| 3 | #include "linkedlist.h" | ||
| 4 | |||
| 5 | /** | ||
| 6 | * An ultra-simple queue implementation. It just uses a linked list as it's | ||
| 7 | * container so we don't have to worry about anything! | ||
| 8 | *@author Mike Buland | ||
| 9 | */ | ||
| 10 | class Queue | ||
| 11 | { | ||
| 12 | public: | ||
| 13 | /** | ||
| 14 | * Puts a new item at the end of the queue. | ||
| 15 | *@param data A new value to put at the end of the queue. | ||
| 16 | */ | ||
| 17 | void enqueue( void *data ); | ||
| 18 | |||
| 19 | /** | ||
| 20 | * Gets the begining item of the queue off and returns it. | ||
| 21 | *@returns The value at the front of the queue. | ||
| 22 | */ | ||
| 23 | void *dequeue(); | ||
| 24 | |||
| 25 | /** | ||
| 26 | * Checks if the queueu is empty. | ||
| 27 | *@returns True if the queueu is empty, and false if it has things in it. | ||
| 28 | */ | ||
| 29 | bool isEmpty(); | ||
| 30 | |||
| 31 | /** | ||
| 32 | * Empty the queue. | ||
| 33 | */ | ||
| 34 | void empty(); | ||
| 35 | |||
| 36 | /** | ||
| 37 | * Get a pointer to the internal list object. | ||
| 38 | *@returns A pointer to the internal list object. | ||
| 39 | */ | ||
| 40 | LinkedList *getList() { return &lQueueData; }; | ||
| 41 | |||
| 42 | private: | ||
| 43 | LinkedList lQueueData; /**< Where all of the real data is stored. */ | ||
| 44 | }; | ||
| 45 | #endif | ||
