/var/www2/hermes2d/hermes2d/src/qsort.cpp File Reference

#include <limits.h>
#include <stdlib.h>

Classes
struct	stack_node
Defines
#define	SWAP(a, b) { int c = (a); (a) = (b); (b) = c; }
#define	MAX_THRESH 4
#define	STACK_SIZE (CHAR_BIT * sizeof(size_t))
#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))
Functions
void	qsort_int (int *pbase, size_t total_elems)

Define Documentation

#define MAX_THRESH 4

#define min	(	x,
		y		)	((x) < (y) ? (x) : (y))

#define POP	(	low,
		high		)	((void) (--top, (low = top->lo), (high = top->hi)))

#define PUSH	(	low,
		high		)	((void) ((top->lo = (low)), (top->hi = (high)), ++top))

#define STACK_NOT_EMPTY (stack < top)

#define STACK_SIZE (CHAR_BIT * sizeof(size_t))

#define SWAP	(	a,
		b		)	{ int c = (a); (a) = (b); (b) = c; }