PaStiX Handbook
6.3.2
|
Go to the source code of this file.
Functions | |
static int | pqueueItemComparison (const pastix_queue_item_t *item1, const pastix_queue_item_t *item2) |
Compare two items of the queue based on the couple (key1, key2). More... | |
int | pqueueInit (pastix_queue_t *q, pastix_int_t size) |
Initialize the queue structure with an initial space to store the elements. More... | |
void | pqueueExit (pastix_queue_t *q) |
Free the structure associated to the queue. More... | |
pastix_int_t | pqueueSize (const pastix_queue_t *q) |
Return the size of the queue. More... | |
void | pqueueClear (pastix_queue_t *q) |
Reset the number of used element to 0. More... | |
void | pqueuePush2 (pastix_queue_t *q, pastix_int_t elt, double key1, double key2) |
Insert an element into the sorted queue. More... | |
pastix_int_t | pqueueRead (const pastix_queue_t *q) |
Read the first element of the queue. More... | |
pastix_int_t | pqueuePop2 (pastix_queue_t *q, double *key1, double *key2) |
Remove the first element of the queue and return its keys if needed. More... | |
void | pqueuePrint (const pastix_queue_t *q) |
Print the queue. More... | |
PaStiX queue structure.
Definition in file queue.c.