Classes | Namespaces | Macros | Typedefs | Functions
gft_gpqueue_by_Falcao.h File Reference
#include "gft_common.h"

Go to the source code of this file.

Classes

struct  gft::GQueue::_gqnode
 
struct  gft::GQueue::_gdoublylinkedlists
 
struct  gft::GQueue::_gcircularqueue
 
struct  gft::GQueue::_gqueue
 

Namespaces

 gft
 Base namespace for common definitions and prototypes.
 
 gft::GQueue
 

Macros

#define MINVALUE   0 /* define queue to remove node with minimum value */
 
#define MAXVALUE   1 /* define queue to remove node with maximum value */
 
#define FIFOBREAK   0 /* define queue to solve ambiguity by FIFO */
 
#define LIFOBREAK   1 /* define queue to solve ambiguity by LIFO */
 
#define QSIZE   32768
 

Typedefs

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

Functions

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

Macro Definition Documentation

#define FIFOBREAK   0 /* define queue to solve ambiguity by FIFO */
#define LIFOBREAK   1 /* define queue to solve ambiguity by LIFO */
#define MAXVALUE   1 /* define queue to remove node with maximum value */
#define MINVALUE   0 /* define queue to remove node with minimum value */
#define QSIZE   32768