Lines Matching full:priority

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
48 /* Define a function to "destroy" a priority queue, freeing-up
145 /* Define a function to add an element to the priority queue.
146  * The element is added according to its priority - 
147  * relative priority is given by the get_order function
177 /* Define a function to dequeue the first element from the priority
196  * priority queue
209  * that for priority queues. (Given the current representation)
228  * Use the priority queue to create a traditional FIFO queue.