struct Queue * queue;
struct QueueItem * next;
struct QueueItem * prev;
- struct QueueItem * nextqueue;
};
+#define isEmpty(x) (x->head==NULL)
+
+void * getItem(struct Queue * queue);
+void freeQueue(struct Queue * q);
struct Queue * createQueue();
struct QueueItem * addNewItem(struct Queue * queue, void * ptr);
+#ifdef RAW
+struct QueueItem * addNewItem_I(struct Queue * queue, void * ptr);
+#endif
+struct QueueItem * findItem(struct Queue * queue, void * ptr);
void removeItem(struct Queue * queue, struct QueueItem * item);
-int isEmpty(struct Queue *queue);
struct QueueItem * getTail(struct Queue * queue);