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