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

Go to the source code of this file.

Classes

struct  gft::PQueue32::_pqnode
 
struct  gft::PQueue32::_pqdoublylinkedlists
 
struct  gft::PQueue32::_pqcircularqueue
 
struct  gft::PQueue32::_priorityqueue
 Priority queue by Dial implemented as proposed by A.X. Falcao with circular and growing features. More...
 

Namespaces

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

Typedefs

typedef struct
gft::PQueue32::_pqnode 
gft::PQueue32::PQNode
 
typedef struct
gft::PQueue32::_pqdoublylinkedlists 
gft::PQueue32::PQDoublyLinkedLists
 
typedef struct
gft::PQueue32::_pqcircularqueue 
gft::PQueue32::PQCircularQueue
 
typedef struct
gft::PQueue32::_priorityqueue 
gft::PQueue32::PQueue32
 Priority queue by Dial implemented as proposed by A.X. Falcao with circular and growing features. More...
 

Functions

PQueue32 * gft::PQueue32::Create (int nbuckets, int nelems, int *value)
 
void gft::PQueue32::Destroy (PQueue32 **Q)
 
PQueue32 * gft::PQueue32::Grow (PQueue32 **Q, int nbuckets)
 
void gft::PQueue32::Reset (PQueue32 *Q)
 
bool gft::PQueue32::IsEmpty (PQueue32 *Q)
 
bool gft::PQueue32::IsFull (PQueue32 *Q)
 
void gft::PQueue32::InsertElem (PQueue32 **Q, int elem)
 
void gft::PQueue32::RemoveElem (PQueue32 *Q, int elem)
 
void gft::PQueue32::UpdateElem (PQueue32 **Q, int elem, int newvalue)
 
int gft::PQueue32::RemoveMinFIFO (PQueue32 *Q)
 
int gft::PQueue32::RemoveMinLIFO (PQueue32 *Q)
 
int gft::PQueue32::RemoveMaxFIFO (PQueue32 *Q)
 
int gft::PQueue32::RemoveMaxLIFO (PQueue32 *Q)
 
void gft::PQueue32::FastInsertElem (PQueue32 *Q, int elem)
 
void gft::PQueue32::FastRemoveElem (PQueue32 *Q, int elem)
 
void gft::PQueue32::FastUpdateElem (PQueue32 *Q, int elem, int newvalue)
 
int gft::PQueue32::FastRemoveMinFIFO (PQueue32 *Q)
 
int gft::PQueue32::FastRemoveMinLIFO (PQueue32 *Q)
 
int gft::PQueue32::FastRemoveMaxFIFO (PQueue32 *Q)
 
int gft::PQueue32::FastRemoveMaxLIFO (PQueue32 *Q)
 
void gft::PQueue32::FastInsertElemAsFirst (PQueue32 *Q, int elem)