3  * This file contains the priority queue implementation used by the
18 /* Priority Queue
20  * Define a priority queue in which the relative priority of the elements
24 queue *debug_create_priority_queue(  in debug_create_priority_queue()
32 	queue *my_queue;  in debug_create_priority_queue()
35 	my_queue = emalloc(sizeof(queue));  in debug_create_priority_queue()
38 	my_queue = debug_erealloc(NULL, sizeof(queue), sourcefile, line_num);  in debug_create_priority_queue()
48 /* Define a function to "destroy" a priority queue, freeing-up
53 	queue *my_queue  in destroy_queue()
58     /* Empty out the queue elements if they are not already empty */  in destroy_queue()
65     /* Now free the queue */  in destroy_queue()
71  * of the queue. The allocated memory consists of size
96 /* Define a function to free the allocated memory for a queue node */
124 /* Define a function to check if the queue is empty. */
126 	queue *my_queue  in empty()
135 	queue *q  in queue_head()
145 /* Define a function to add an element to the priority queue.
149 queue *enqueue(  in enqueue()
150 	queue *	my_queue,  in enqueue()
164 	if (i == NULL) {	/* Insert at beginning of the queue */  in enqueue()
178  * queue and return it
181 	queue *my_queue  in dequeue()
196  * priority queue
199 	queue *my_queue  in get_no_of_elements()
206 /* Define a function to append a queue onto another.
216 	queue *q1,  in append_queue()
217 	queue *q2  in append_queue()
226 /* FIFO Queue
228  * Use the priority queue to create a traditional FIFO queue.