(* $Id$)
Header for qsort.
More...
Go to the source code of this file.
Defines |
#define | _QSORT_MAX_THRESH 4 |
#define | _QSORT_POP(low, high, top) ((--top, (low = top->_lo), (high = top->_hi))) |
#define | _QSORT_POP2(low, high, top) ((--top, (low = top->_lo2), (high = top->_hi2))) |
#define | _QSORT_PUSH(top, low, high) (((top->_lo = (low)), (top->_hi = (high)), ++top)) |
#define | _QSORT_PUSH2(top, low, high) (((top->_lo2 = (low)), (top->_hi2 = (high)), ++top)) |
#define | _QSORT_STACK_NOT_EMPTY (_stack < _top) |
#define | _QSORT_STACK_SIZE (8 * sizeof(unsigned)) |
#define | _QSORT_SWAP(a, b, t) ((void)((t = *a), (*a = *b), (*b = t))) |
#define | QSORT(QSORT_TYPE, QSORT_BASE, QSORT_NELT, QSORT_LT) |
#define | QSORT2(QSORT_TYPE, QSORT_TYPE2, QSORT_BASE, QSORT_BASE2, QSORT_NELT, QSORT_LT) |
Detailed Description
Header for qsort.
Definition in file qsort.h.
Define Documentation
#define _QSORT_POP |
( |
|
low, |
|
|
|
high, |
|
|
|
top |
|
) |
| ((--top, (low = top->_lo), (high = top->_hi))) |
#define _QSORT_POP2 |
( |
|
low, |
|
|
|
high, |
|
|
|
top |
|
) |
| ((--top, (low = top->_lo2), (high = top->_hi2))) |
#define _QSORT_PUSH |
( |
|
top, |
|
|
|
low, |
|
|
|
high |
|
) |
| (((top->_lo = (low)), (top->_hi = (high)), ++top)) |
#define _QSORT_PUSH2 |
( |
|
top, |
|
|
|
low, |
|
|
|
high |
|
) |
| (((top->_lo2 = (low)), (top->_hi2 = (high)), ++top)) |
#define _QSORT_SWAP |
( |
|
a, |
|
|
|
b, |
|
|
|
t |
|
) |
| ((void)((t = *a), (*a = *b), (*b = t))) |
#define QSORT |
( |
|
QSORT_TYPE, |
|
|
|
QSORT_BASE, |
|
|
|
QSORT_NELT, |
|
|
|
QSORT_LT |
|
) |
| |
#define QSORT2 |
( |
|
QSORT_TYPE, |
|
|
|
QSORT_TYPE2, |
|
|
|
QSORT_BASE, |
|
|
|
QSORT_BASE2, |
|
|
|
QSORT_NELT, |
|
|
|
QSORT_LT |
|
) |
| |