#include "priorityq-heap.h"
#include "geom.h"
Go to the source code of this file.
◆ FALSE
◆ INIT_SIZE
◆ LEQ
◆ TRUE
◆ FloatDown()
◆ FloatUp()
Definition at line 126 of file priorityq-heap.c.
133 hCurr =
n[curr].handle;
138 n[curr].handle = hCurr;
139 h[hCurr].node = curr;
142 n[curr].handle = hParent;
143 h[hParent].node = curr;
GLfloat GLfloat GLfloat GLfloat h
Referenced by pqDelete(), and pqInsert().
◆ pqDelete()
Definition at line 234 of file priorityq-heap.c.
242 curr =
h[hCurr].node;
243 n[curr].handle =
n[pq->
size].handle;
244 h[
n[curr].handle].node = curr;
246 if( curr <= -- pq->
size ) {
static void FloatUp(PriorityQ *pq, long curr)
GLfloat GLfloat GLfloat GLfloat h
static void FloatDown(PriorityQ *pq, long curr)
◆ pqDeletePriorityQ()
◆ pqExtractMin()
Definition at line 211 of file priorityq-heap.c.
219 n[1].handle =
n[pq->
size].handle;
220 h[
n[1].handle].node = 1;
226 if( -- pq->
size > 0 ) {
GLfloat GLfloat GLfloat GLfloat h
static void FloatDown(PriorityQ *pq, long curr)
◆ pqInit()
Definition at line 149 of file priorityq-heap.c.
155 for(
i = pq->
size;
i >= 1; --
i ) {
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
static void FloatDown(PriorityQ *pq, long curr)
◆ pqInsert()
Definition at line 163 of file priorityq-heap.c.
169 if( (curr*2) > pq->
max ) {
177 ((pq->
max + 1) *
sizeof( pq->
nodes[0] )));
179 pq->
nodes = saveNodes;
static void FloatUp(PriorityQ *pq, long curr)
BOOL free_handle(HINTERNET hinternet)
◆ pqNewPriorityQ()