RUNFREE(q);
}
-int isEmpty(struct Queue *queue) {
- return queue->head==NULL;
-}
-
struct QueueItem * addNewItem(struct Queue * queue, void * ptr) {
struct QueueItem * item=RUNMALLOC(sizeof(struct QueueItem));
item->objectptr=ptr;
return queue->tail;
}
-struct QueueItem * getNext(struct QueueItem * qi) {
+struct QueueItem * getNextQueueItem(struct QueueItem * qi) {
return qi->next;
}
+
+void * getItem(struct Queue * queue) {
+ struct QueueItem * q=queue->head;
+ void * ptr=q->objectptr;
+ queue->head=q->next;
+ RUNFREE(q);
+ return ptr;
+}