Classes | Typedefs | Functions
gft::GQueue Namespace Reference

Classes

struct  _gqnode
 
struct  _gdoublylinkedlists
 
struct  _gcircularqueue
 
struct  _gqueue
 

Typedefs

typedef struct gft::GQueue::_gqnode GQNode
 
typedef struct
gft::GQueue::_gdoublylinkedlists 
GDoublyLinkedLists
 
typedef struct
gft::GQueue::_gcircularqueue 
GCircularQueue
 
typedef struct gft::GQueue::_gqueue GQueue
 

Functions

GQueueCreate (int nbuckets, int nelems, int *value)
 
void Reset (GQueue *Q)
 
void Destroy (GQueue **Q)
 
GQueueGrow (GQueue **Q, int nbuckets)
 
void Insert (GQueue **Q, int elem)
 
int Remove (GQueue *Q)
 
void RemoveElem (GQueue *Q, int elem)
 
void Update (GQueue **Q, int elem, int newvalue)
 
int IsEmpty (GQueue *Q)
 
void SetTieBreak (GQueue *Q, char tiebreak)
 
void SetRemovalPolicy (GQueue *Q, char policy)
 

Typedef Documentation

Function Documentation

GQueue * gft::GQueue::Create ( int  nbuckets,
int  nelems,
int *  value 
)
void gft::GQueue::Destroy ( GQueue **  Q)
GQueue * gft::GQueue::Grow ( GQueue **  Q,
int  nbuckets 
)
void gft::GQueue::Insert ( GQueue **  Q,
int  elem 
)
int gft::GQueue::IsEmpty ( GQueue *  Q)
int gft::GQueue::Remove ( GQueue *  Q)

moves to next element

void gft::GQueue::RemoveElem ( GQueue *  Q,
int  elem 
)
void gft::GQueue::Reset ( GQueue *  Q)
void gft::GQueue::SetRemovalPolicy ( GQueue *  Q,
char  policy 
)
inline
void gft::GQueue::SetTieBreak ( GQueue *  Q,
char  tiebreak 
)
inline
void gft::GQueue::Update ( GQueue **  Q,
int  elem,
int  newvalue 
)