EECS678: Project 2: Scheduler
|
Priority Queue Structure. More...
#include <libpriqueue.h>
Data Fields | |
node_t * | root |
unsigned int | size |
int(* | comparer )(const void *, const void *) |
Priority Queue Structure.
priqueue_t::comparer |
Member 'comparer' contains a function to compare two node_t::data values. See Compare Function
priqueue_t::root |
Member 'root' contains a pointer to the root node of the priority queue.
priqueue_t::size |
Member 'size' contains the size of the priority queue.