libFirm 1.20
libfirm/adt/pqueue.h File Reference

Implementation of a priority queue. This is the ported version of the original Java implementation by Matthias Braun. More...

#include "../begin.h"
#include "../end.h"

Go to the source code of this file.

Typedefs

typedef struct pqueue_t pqueue_t
 priority queue

Functions

pqueue_tnew_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.

Detailed Description

Implementation of a priority queue. This is the ported version of the original Java implementation by Matthias Braun.

Date:
18.04.2007
Author:
Christian Wuerdig

Definition in file pqueue.h.