SORTS(3dxml) — Subroutines
Name
sorts − A library of sort routines
Description
Four basic sort routines comprise the Digital Extended Math Library (DXML) sort functionality. These routines perform basic sorting operations on vectors of data or their associated index vectors.
The following routines are included in SORTS. The Subprogram Name is the name of the manual page containing documentation on the subprogram.
| Subprogram Name | Operation |
| isortq | Sorts the elements of an integer vector using an in-place quicksort method. The input vector is overwritten with sorted data. |
| ssortq | Sorts the elements of a single precision floating point vector using an in-place quicksort method. The input vector is overwritten with sorted data. |
| dsortq | Sorts the elements of a double precision floating point vector using an in-place quicksort method. The input vector is overwritten with sorted data. |
| isortqx | Sorts the elements of an indexed integer vector using an in-place quicksort method. The input data vector remains unchanged. An index vector is written with permuted indices that may be used to access data in the sorted sequence. |
| ssortqx | Sorts the elements of an indexed single precision floating point vector using an in-place quicksort method. The input data vector remains unchanged. An index vector is written with permuted indices that may be used to access data in the sorted sequence. |
| dsortqx | Sorts the elements of an indexed double precision floating point vector using an in-place quicksort method. The input data vector remains unchanged. An index vector is written with permuted indices that may be used to access data in the sorted sequence. |
| gen_sort | A general purpose sort routine that sorts the elements of a data vector using a radix sort method. Sorted data is written to a vector which may or may not overlap, partially or wholly, the input vector. The input vector is unchanged unless it overlaps, partially or wholly, the output vector. |
| gen_sortx | A general purpose sort routine that sorts the elements of a data vector using an indexed radix sort method. The data vector remains unchanged. An index vector is overwritten with permuted indices that may be used to access data in sorted sequence. The index vector may also be used during input to specify the original order of the incoming data. The gen_sortx routine uses a stable sorting algorithm and is suitable for use in multi-key sorting methods. |