Home | History | Annotate | Download | only in include

Lines Matching refs:queue

6  * priority queue implementation used by the discrete event simulator.
19 /* Structures for storing a priority queue
33 typedef struct Queue {
37 } queue;
43 /* Define a function to create a FIFO queue */
46 void destroy_queue(queue *my_queue);
49 int empty(queue *my_queue);
50 void *queue_head(queue *my_queue);
51 queue *enqueue(queue *my_queue, void *my_node);
52 void append_queue(queue *q1, queue *q2);
53 void *dequeue(queue *my_queue);
54 int get_no_of_elements(queue *my_queue);
69 queue *debug_create_priority_queue(