5 struct QueueItem * head;
6 struct QueueItem * tail;
12 struct QueueItem * next;
13 struct QueueItem * prev;
16 #define isEmpty(x) ((x)->head==NULL)
18 void initQueue(struct Queue *);
19 struct Queue * createQueue();
20 void freeQueue(struct Queue * q);
22 struct QueueItem * addNewItem(struct Queue * queue, void * ptr);
23 struct QueueItem * addNewItemBack(struct Queue * queue, void * ptr);
25 struct Queue * createQueue_I();
26 struct QueueItem * addNewItem_I(struct Queue * queue, void * ptr);
29 struct QueueItem * getTail(struct Queue * queue);
30 struct QueueItem * getHead(struct Queue * queue);
31 struct QueueItem * getNextQueueItem(struct QueueItem * qi);
33 struct QueueItem * findItem(struct Queue * queue, void * ptr);
35 void removeItem(struct Queue * queue, struct QueueItem * item);
37 void * getItem(struct Queue * queue);
38 void * getItemBack(struct Queue * queue);
40 void * peekItem(struct Queue * queue);
41 void * peekItemBack(struct Queue * queue);
43 void clearQueue(struct Queue * queue);
46 // for debugging, only included if macro is defined
49 // returns 1 if queue's pointers are valid, 0 otherwise
50 int assertQueue(struct Queue * queue);
52 // use this to print head, tail and next, prev of each item
53 void printQueue(struct Queue * queue);