/**
* Frees the priority queue's memory from heap.
*
* <B>Note:</B> The memory of the elements themselves is not freed.
*
* This function has a time complexity of O(N),
* with N being the number of elements in the priority queue.
*
* @return void
*/
void pblPriorityQueueFree( /* */
PblPriorityQueue * queue /** The queue to free */
)
{
pblPriorityQueueClear(queue);
pblHeapFree((PblHeap *) queue);
}
void ami_schedule_free(void)
{
schedule_remove_all();
pblHeapFree(schedule_list); // this should be empty at this point
schedule_list = NULL;
}
