libFirm
|
Implementation of a priority queue. This is the ported version of the original Java implementation by Matthias Braun. More...
Go to the source code of this file.
Typedefs | |
typedef struct pqueue_t | pqueue_t |
priority queue |
Functions | |
pqueue_t * | new_pqueue (void) |
Creates a new priority queue. | |
void | del_pqueue (pqueue_t *q) |
Frees all memory allocated by the priority queue. | |
void | pqueue_put (pqueue_t *q, void *data, int priority) |
Inserts a new element into a priority queue. | |
void * | pqueue_pop_front (pqueue_t *q) |
Returns and removes the first element, ie. | |
size_t | pqueue_length (const pqueue_t *q) |
Get the length of the priority queue. | |
int | pqueue_empty (const pqueue_t *q) |
Returns true if queue is empty. |
Implementation of a priority queue. This is the ported version of the original Java implementation by Matthias Braun.
Definition in file pqueue.h.