Has routines for sorting a dvector. More...
Go to the source code of this file.
Defines | |
| #define | double_lt(a, b) ((*a)<(*b)) |
| #define | double_lt(a, b) ((*a)<(*b)) |
Functions | |
| void | double_qsort (double *arr, unsigned n) |
| A subroutine used in Quicksort. | |
| void | double_qsort2 (double *arr, int *arr2, unsigned n) |
| A subroutine used in Quicksort. | |
| dvector | sort (const dvector &v, int NSTACK) |
| Quicksort. | |
| dvector | sort (const dvector &_v, const ivector &_index, int NSTACK) |
| Quicksort. | |
Has routines for sorting a dvector.
Definition in file dvsort.cpp.
| #define double_lt | ( | a, | |
| b | |||
| ) | ((*a)<(*b)) |
Referenced by double_qsort(), and double_qsort2().
| #define double_lt | ( | a, | |
| b | |||
| ) | ((*a)<(*b)) |
| void double_qsort | ( | double * | arr, |
| unsigned | n | ||
| ) |
| void double_qsort2 | ( | double * | arr, |
| int * | arr2, | ||
| unsigned | n | ||
| ) |
Quicksort.
| v | A dvector to be sorted. |
| NSTACK | Not used. |
Adopted from the GNU C Library. http://www.corpit.ru/mjt/qsort.html
Definition at line 40 of file dvsort.cpp.
Quicksort.
| _v | A dvector to be sorted. |
| _index | ivector on return containing the input order of the original vector. |
| NSTACK | Not used. |
Adopted from the GNU C Library. http://www.corpit.ru/mjt/qsort.html
Definition at line 77 of file dvsort.cpp.
|
|
Generated on Tue Mar 8 2016 19:51:36 for ADMB Documentation by 1.8.0
|