30typedef struct priorityQueueElement_s {
39typedef struct priorityQueue_s {
48#define PQueueIsEmpty(pq) ((pq)->currentSize == 0)
void PQueuePush(priorityQueue_t *pq, const pos4_t item, priorityQueueRating_t rating)
void PQueueFree(priorityQueue_t *pq)
free up memory for pqueue
void PQueueInitialise(priorityQueue_t *pq, uint32_t maxElements)
initialise the priority queue with a maximum size of maxelements.
int priorityQueueRating_t
void PQueuePop(priorityQueue_t *pq, pos4_t item)
remove the first node from the pqueue and provide a pointer to it
the priority queue struct the actual data is stored in priorityQueueElement_t
priorityQueueElement_t * elements
priorityQueueRating_t rating