#include "gluos.h"
#include <stddef.h>
#include <assert.h>
#include <limits.h>
#include "memalloc.h"
#include "priorityq-heap.c"
#include "priorityq-sort.h"
Macros | |
#define | GT(x, y) (! LEQ(x,y)) |
#define | LT(x, y) (! LEQ(y,x)) |
#define | Swap(a, b) do{PQkey *tmp = *a; *a = *b; *b = tmp;}while(0) |
Functions | |
void | __gl_pqSortDelete (PriorityQSort *pq, PQSortHandle curr) |
void | __gl_pqSortDeletePriorityQ (PriorityQSort *pq) |
PQSortKey | __gl_pqSortExtractMin (PriorityQSort *pq) |
int | __gl_pqSortInit (PriorityQSort *pq) |
PQSortHandle | __gl_pqSortInsert (PriorityQSort *pq, PQSortKey keyNew) |
int | __gl_pqSortIsEmpty (PriorityQSort *pq) |
PQSortKey | __gl_pqSortMinimum (PriorityQSort *pq) |
PriorityQSort * | __gl_pqSortNewPriorityQ (int(*leq)(PQSortKey key1, PQSortKey key2)) |
Definition at line 89 of file priorityq.c.
void __gl_pqSortDelete | ( | PriorityQSort * | pq, |
PQSortHandle | curr | ||
) |
Definition at line 248 of file priorityq.c.
void __gl_pqSortDeletePriorityQ | ( | PriorityQSort * | pq | ) |
Definition at line 77 of file priorityq.c.
PQSortKey __gl_pqSortExtractMin | ( | PriorityQSort * | pq | ) |
Definition at line 203 of file priorityq.c.
int __gl_pqSortInit | ( | PriorityQSort * | pq | ) |
Definition at line 92 of file priorityq.c.
PQSortHandle __gl_pqSortInsert | ( | PriorityQSort * | pq, |
PQSortKey | keyNew | ||
) |
Definition at line 174 of file priorityq.c.
int __gl_pqSortIsEmpty | ( | PriorityQSort * | pq | ) |
Definition at line 242 of file priorityq.c.
PQSortKey __gl_pqSortMinimum | ( | PriorityQSort * | pq | ) |
Definition at line 224 of file priorityq.c.
PriorityQSort * __gl_pqSortNewPriorityQ | ( | int(*)(PQSortKey key1, PQSortKey key2) | leq | ) |
Definition at line 50 of file priorityq.c.