bool IsEmpty(Queue *Q)
Definition: gft_queue.cpp:60
struct gft::Queue::_queue Queue
FIFO Queue with circular and growing features.
bool IsFull(Queue *Q)
Definition: gft_queue.cpp:65
int Pop(Queue *Q)
Definition: gft_queue.cpp:44
int * data
Definition: gft_queue.h:14
void Reset(Queue *Q)
Definition: gft_queue.cpp:54
int nbuckets
Definition: gft_queue.h:16
void Push(Queue *Q, int p)
Definition: gft_queue.cpp:34
Header file for common definitions and function prototypes.
Queue * Create(int nbuckets)
Definition: gft_queue.cpp:8
void Destroy(Queue **Q)
Definition: gft_queue.cpp:22
int nadded
Number of elements added.
Definition: gft_queue.h:17
FIFO Queue with circular and growing features.
Definition: gft_queue.h:13
int put
Definition: gft_queue.h:15