#include "Ifpack_config.h"
#include <string.h>
Go to the source code of this file.
|
#define | SWAP(a, b) |
|
#define | MAX_THRESH 4 |
|
#define | STACK_SIZE (8 * sizeof(unsigned long int)) |
|
#define | PUSH(low, high) ((void) ((top->lo = (low)), (top->hi = (high)), ++top)) |
|
#define | POP(low, high) ((void) (--top, (low = top->lo), (high = top->hi))) |
|
#define | STACK_NOT_EMPTY (stack < top) |
|
#define | min(x, y) ((x) < (y) ? (x) : (y)) |
|
Value:do { \
itemp = *a; \
*a = *b; \
*b = itemp; \
dtemp = daux[a-pbase]; \
daux[a-pbase] = daux[b-pbase]; \
daux[b-pbase] = dtemp; \
} while (0)
Definition at line 103 of file Ifpack_MultiListSort.c.
#define STACK_SIZE (8 * sizeof(unsigned long int)) |
#define PUSH |
( |
|
low, |
|
|
|
high |
|
) |
| ((void) ((top->lo = (low)), (top->hi = (high)), ++top)) |
#define POP |
( |
|
low, |
|
|
|
high |
|
) |
| ((void) (--top, (low = top->lo), (high = top->hi))) |
#define STACK_NOT_EMPTY (stack < top) |
#define min |
( |
|
x, |
|
|
|
y |
|
) |
| ((x) < (y) ? (x) : (y)) |
void ifpack_multilist_sort |
( |
int *const |
pbase, |
|
|
double *const |
daux, |
|
|
size_t |
total_elems |
|
) |
| |