ReactOS  0.4.15-dev-1377-ga59cecd
priorityq.h File Reference
#include "priorityq-heap.h"
Include dependency graph for priorityq.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  PriorityQ
 

Macros

#define PQkey   PQSortKey
 
#define PQhandle   PQSortHandle
 
#define PriorityQ   PriorityQSort
 
#define pqNewPriorityQ(leq)   __gl_pqSortNewPriorityQ(leq)
 
#define pqDeletePriorityQ(pq)   __gl_pqSortDeletePriorityQ(pq)
 
#define pqInit(pq)   __gl_pqSortInit(pq)
 
#define pqInsert(pq, key)   __gl_pqSortInsert(pq,key)
 
#define pqMinimum(pq)   __gl_pqSortMinimum(pq)
 
#define pqExtractMin(pq)   __gl_pqSortExtractMin(pq)
 
#define pqDelete(pq, handle)   __gl_pqSortDelete(pq,handle)
 
#define pqIsEmpty(pq)   __gl_pqSortIsEmpty(pq)
 

Typedefs

typedef PQHeapKey PQkey
 
typedef PQHeapHandle PQhandle
 
typedef struct PriorityQ PriorityQ
 

Functions

PriorityQpqNewPriorityQ (int(*leq)(PQkey key1, PQkey key2))
 
void pqDeletePriorityQ (PriorityQ *pq)
 
int pqInit (PriorityQ *pq)
 
PQhandle pqInsert (PriorityQ *pq, PQkey key)
 
PQkey pqExtractMin (PriorityQ *pq)
 
void pqDelete (PriorityQ *pq, PQhandle handle)
 
PQkey pqMinimum (PriorityQ *pq)
 
int pqIsEmpty (PriorityQ *pq)
 

Macro Definition Documentation

◆ pqDelete

#define pqDelete (   pq,
  handle 
)    __gl_pqSortDelete(pq,handle)

Definition at line 78 of file priorityq.h.

◆ pqDeletePriorityQ

#define pqDeletePriorityQ (   pq)    __gl_pqSortDeletePriorityQ(pq)

Definition at line 59 of file priorityq.h.

◆ pqExtractMin

#define pqExtractMin (   pq)    __gl_pqSortExtractMin(pq)

Definition at line 77 of file priorityq.h.

◆ PQhandle

#define PQhandle   PQSortHandle

Definition at line 55 of file priorityq.h.

◆ pqInit

#define pqInit (   pq)    __gl_pqSortInit(pq)

Definition at line 74 of file priorityq.h.

◆ pqInsert

#define pqInsert (   pq,
  key 
)    __gl_pqSortInsert(pq,key)

Definition at line 75 of file priorityq.h.

◆ pqIsEmpty

#define pqIsEmpty (   pq)    __gl_pqSortIsEmpty(pq)

Definition at line 79 of file priorityq.h.

◆ PQkey

#define PQkey   PQSortKey

Definition at line 54 of file priorityq.h.

◆ pqMinimum

#define pqMinimum (   pq)    __gl_pqSortMinimum(pq)

Definition at line 76 of file priorityq.h.

◆ pqNewPriorityQ

#define pqNewPriorityQ (   leq)    __gl_pqSortNewPriorityQ(leq)

Definition at line 58 of file priorityq.h.

◆ PriorityQ

#define PriorityQ   PriorityQSort

Definition at line 56 of file priorityq.h.

Typedef Documentation

◆ PQhandle

typedef PQHeapHandle PQhandle

Definition at line 94 of file priorityq.h.

◆ PQkey

typedef PQHeapKey PQkey

Definition at line 93 of file priorityq.h.

◆ PriorityQ

Definition at line 95 of file priorityq.h.

Function Documentation

◆ pqDelete()

void pqDelete ( PriorityQ pq,
PQhandle  handle 
)

Definition at line 234 of file priorityq-heap.c.

235 {
236  PQnode *n = pq->nodes;
237  PQhandleElem *h = pq->handles;
238  long curr;
239 
240  assert( hCurr >= 1 && hCurr <= pq->max && h[hCurr].key != NULL );
241 
242  curr = h[hCurr].node;
243  n[curr].handle = n[pq->size].handle;
244  h[n[curr].handle].node = curr;
245 
246  if( curr <= -- pq->size ) {
247  if( curr <= 1 || LEQ( h[n[curr>>1].handle].key, h[n[curr].handle].key )) {
248  FloatDown( pq, curr );
249  } else {
250  FloatUp( pq, curr );
251  }
252  }
253  h[hCurr].key = NULL;
254  h[hCurr].node = pq->freeList;
255  pq->freeList = hCurr;
256 }
#define max(a, b)
Definition: svc.c:63
PQhandleElem * handles
GLdouble n
Definition: glext.h:7729
static void FloatUp(PriorityQ *pq, long curr)
#define assert(x)
Definition: debug.h:53
GLfloat GLfloat GLfloat GLfloat h
Definition: glext.h:7723
#define LEQ(x, y)
PQnode * nodes
GLsizeiptr size
Definition: glext.h:5919
PQhandle freeList
#define NULL
Definition: types.h:112
Definition: path.c:41
static void FloatDown(PriorityQ *pq, long curr)

◆ pqDeletePriorityQ()

void pqDeletePriorityQ ( PriorityQ pq)

Definition at line 88 of file priorityq-heap.c.

89 {
90  memFree( pq->handles );
91  memFree( pq->nodes );
92  memFree( pq );
93 }
PQhandleElem * handles
PQnode * nodes
#define memFree
Definition: memalloc.h:41

◆ pqExtractMin()

PQkey pqExtractMin ( PriorityQ pq)

Definition at line 211 of file priorityq-heap.c.

212 {
213  PQnode *n = pq->nodes;
214  PQhandleElem *h = pq->handles;
215  PQhandle hMin = n[1].handle;
216  PQkey min = h[hMin].key;
217 
218  if( pq->size > 0 ) {
219  n[1].handle = n[pq->size].handle;
220  h[n[1].handle].node = 1;
221 
222  h[hMin].key = NULL;
223  h[hMin].node = pq->freeList;
224  pq->freeList = hMin;
225 
226  if( -- pq->size > 0 ) {
227  FloatDown( pq, 1 );
228  }
229  }
230  return min;
231 }
PQhandleElem * handles
GLdouble n
Definition: glext.h:7729
GLfloat GLfloat GLfloat GLfloat h
Definition: glext.h:7723
PQnode * nodes
long PQhandle
PQhandle freeList
#define min(a, b)
Definition: monoChain.cc:55
#define NULL
Definition: types.h:112
static void FloatDown(PriorityQ *pq, long curr)

◆ pqInit()

int pqInit ( PriorityQ pq)

Definition at line 149 of file priorityq-heap.c.

150 {
151  long i;
152 
153  /* This method of building a heap is O(n), rather than O(n lg n). */
154 
155  for( i = pq->size; i >= 1; --i ) {
156  FloatDown( pq, i );
157  }
158  pq->initialized = TRUE;
159 }
#define TRUE
GLsizei GLenum const GLvoid GLsizei GLenum GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLint GLint GLint GLshort GLshort GLshort GLubyte GLubyte GLubyte GLuint GLuint GLuint GLushort GLushort GLushort GLbyte GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLfloat GLint GLint GLint GLint GLshort GLshort GLshort GLshort GLubyte GLubyte GLubyte GLubyte GLuint GLuint GLuint GLuint GLushort GLushort GLushort GLushort GLboolean const GLdouble const GLfloat const GLint const GLshort const GLbyte const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLdouble const GLfloat const GLfloat const GLint const GLint const GLshort const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort GLenum GLenum GLenum GLfloat GLenum GLint GLenum GLenum GLenum GLfloat GLenum GLenum GLint GLenum GLfloat GLenum GLint GLint GLushort GLenum GLenum GLfloat GLenum GLenum GLint GLfloat const GLubyte GLenum GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLint GLint GLsizei GLsizei GLint GLenum GLenum const GLvoid GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLenum const GLdouble GLenum GLenum const GLfloat GLenum GLenum const GLint GLsizei GLuint GLfloat GLuint GLbitfield GLfloat GLint GLuint GLboolean GLenum GLfloat GLenum GLbitfield GLenum GLfloat GLfloat GLint GLint const GLfloat GLenum GLfloat GLfloat GLint GLint GLfloat GLfloat GLint GLint const GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat const GLdouble const GLfloat const GLdouble const GLfloat GLint i
Definition: glfuncs.h:248
static void FloatDown(PriorityQ *pq, long curr)

◆ pqInsert()

PQhandle pqInsert ( PriorityQ pq,
PQkey  key 
)

Definition at line 163 of file priorityq-heap.c.

164 {
165  long curr;
167 
168  curr = ++ pq->size;
169  if( (curr*2) > pq->max ) {
170  PQnode *saveNodes= pq->nodes;
171  PQhandleElem *saveHandles= pq->handles;
172 
173  /* If the heap overflows, double its size. */
174  pq->max <<= 1;
175  pq->nodes = (PQnode *)memRealloc( pq->nodes,
176  (size_t)
177  ((pq->max + 1) * sizeof( pq->nodes[0] )));
178  if (pq->nodes == NULL) {
179  pq->nodes = saveNodes; /* restore ptr to free upon return */
180  return LONG_MAX;
181  }
182  pq->handles = (PQhandleElem *)memRealloc( pq->handles,
183  (size_t)
184  ((pq->max + 1) *
185  sizeof( pq->handles[0] )));
186  if (pq->handles == NULL) {
187  pq->handles = saveHandles; /* restore ptr to free upon return */
188  return LONG_MAX;
189  }
190  }
191 
192  if( pq->freeList == 0 ) {
193  free_handle = curr;
194  } else {
195  free_handle = pq->freeList;
196  pq->freeList = pq->handles[free_handle].node;
197  }
198 
199  pq->nodes[curr].handle = free_handle;
200  pq->handles[free_handle].node = curr;
201  pq->handles[free_handle].key = keyNew;
202 
203  if( pq->initialized ) {
204  FloatUp( pq, curr );
205  }
207  return free_handle;
208 }
PQhandleElem * handles
static void FloatUp(PriorityQ *pq, long curr)
#define assert(x)
Definition: debug.h:53
#define memRealloc
Definition: memalloc.h:40
PQnode * nodes
long PQhandle
#define LONG_MAX
Definition: limits.h:43
PQhandle freeList
BOOL free_handle(HINTERNET hinternet)
Definition: handle.c:123
PQhandle node
#define NULL
Definition: types.h:112
PQhandle handle

◆ pqIsEmpty()

int pqIsEmpty ( PriorityQ pq)

Definition at line 242 of file priorityq.c.

243 {
244  return (pq->size == 0) && __gl_pqHeapIsEmpty( pq->heap );
245 }
#define __gl_pqHeapIsEmpty(pq)
PriorityQHeap * heap

◆ pqMinimum()

PQkey pqMinimum ( PriorityQ pq)

Definition at line 224 of file priorityq.c.

225 {
226  PQkey sortMin, heapMin;
227 
228  if( pq->size == 0 ) {
229  return __gl_pqHeapMinimum( pq->heap );
230  }
231  sortMin = *(pq->order[pq->size-1]);
232  if( ! __gl_pqHeapIsEmpty( pq->heap )) {
233  heapMin = __gl_pqHeapMinimum( pq->heap );
234  if( LEQ( heapMin, sortMin )) {
235  return heapMin;
236  }
237  }
238  return sortMin;
239 }
#define LEQ(x, y)
#define __gl_pqHeapIsEmpty(pq)
#define __gl_pqHeapMinimum(pq)
PQkey ** order
PriorityQHeap * heap

◆ pqNewPriorityQ()

PriorityQ* pqNewPriorityQ ( int(*)(PQkey key1, PQkey key2)  leq)

Definition at line 58 of file priorityq-heap.c.

59 {
60  PriorityQ *pq = (PriorityQ *)memAlloc( sizeof( PriorityQ ));
61  if (pq == NULL) return NULL;
62 
63  pq->size = 0;
64  pq->max = INIT_SIZE;
65  pq->nodes = (PQnode *)memAlloc( (INIT_SIZE + 1) * sizeof(pq->nodes[0]) );
66  if (pq->nodes == NULL) {
67  memFree(pq);
68  return NULL;
69  }
70 
71  pq->handles = (PQhandleElem *)memAlloc( (INIT_SIZE + 1) * sizeof(pq->handles[0]) );
72  if (pq->handles == NULL) {
73  memFree(pq->nodes);
74  memFree(pq);
75  return NULL;
76  }
77 
78  pq->initialized = FALSE;
79  pq->freeList = 0;
80  pq->leq = leq;
81 
82  pq->nodes[1].handle = 1; /* so that Minimum() returns NULL */
83  pq->handles[1].key = NULL;
84  return pq;
85 }
PQhandleElem * handles
#define INIT_SIZE
#define FALSE
PQnode * nodes
PQhandle freeList
int(* leq)(PQkey key1, PQkey key2)
#define memFree
Definition: memalloc.h:41
#define NULL
Definition: types.h:112
PQhandle handle
#define memAlloc
Definition: memalloc.h:48