5 struct QueueItem * head;
6 struct QueueItem * tail;
12 struct QueueItem * next;
13 struct QueueItem * prev;
16 #define isEmpty(x) ((x)->head==NULL)
18 struct Queue * createQueue();
19 void freeQueue(struct Queue * q);
21 struct QueueItem * addNewItem(struct Queue * queue, void * ptr);
22 struct QueueItem * addNewItemBack(struct Queue * queue, void * ptr);
24 struct QueueItem * addNewItem_I(struct Queue * queue, void * ptr);
27 struct QueueItem * getTail(struct Queue * queue);
28 struct QueueItem * getHead(struct Queue * queue);
29 struct QueueItem * getNextQueueItem(struct QueueItem * qi);
31 struct QueueItem * findItem(struct Queue * queue, void * ptr);
33 void removeItem(struct Queue * queue, struct QueueItem * item);
35 void * getItem(struct Queue * queue);
36 void * getItemBack(struct Queue * queue);
38 void * peekItem(struct Queue * queue);
39 void * peekItemBack(struct Queue * queue);
42 // for debugging, only included if macro is defined
45 // returns 1 if queue's pointers are valid, 0 otherwise
46 int assertQueue(struct Queue * queue);
48 // use this to print head, tail and next, prev of each item
49 void printQueue(struct Queue * queue);