Ifpack Package Browser (Single Doxygen Collection) Development
Classes | Defines | Functions
icrout_quicksort.c File Reference
#include "Ifpack_config.h"
#include <string.h>
Include dependency graph for icrout_quicksort.c:

Go to the source code of this file.

Classes

struct  stack_node

Defines

#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))

Functions

IFPACK_DEPRECATED void ifpack_quicksort (int *const pbase, double *const daux, size_t total_elems)

Define Documentation

#define SWAP (   a,
 
)
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 90 of file icrout_quicksort.c.

#define MAX_THRESH   4

Definition at line 102 of file icrout_quicksort.c.

#define STACK_SIZE   (8 * sizeof(unsigned long int))

Definition at line 112 of file icrout_quicksort.c.

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

Definition at line 113 of file icrout_quicksort.c.

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

Definition at line 114 of file icrout_quicksort.c.

#define STACK_NOT_EMPTY   (stack < top)

Definition at line 115 of file icrout_quicksort.c.

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

Function Documentation

IFPACK_DEPRECATED void ifpack_quicksort ( int *const  pbase,
double *const  daux,
size_t  total_elems 
)

Definition at line 141 of file icrout_quicksort.c.

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines