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

Go to the source code of this file.

Classes

struct  gft::PQueue16::_pqnode
 
struct  gft::PQueue16::_pqdoublylinkedlists
 
struct  gft::PQueue16::_pqcircularqueue
 
struct  gft::PQueue16::_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::PQueue16
 

Typedefs

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

Functions

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