#include <stdlib.h>
#include "xt/quicksort.h"
#include "xt/mergesort.h"
Go to the source code of this file.
|
void(* | xt_sort_int )(int *a, size_t n) |
|
void(* | xt_sort_xt_int )(Xt_int *a, size_t n) |
|
void(* | xt_sort_index )(Xt_int *restrict a, int n, int *restrict idx, int reset_index) |
|
void(* | xt_sort_idxpos )(idxpos_type *v, size_t n) |
|
void(* | xt_sort_xt_int_permutation )(Xt_int *restrict a, size_t n, int *restrict permutation) |
|
void(* | xt_sort_int_permutation )(int *restrict a, size_t n, int *restrict permutation) |
|
◆ xt_assign_id_map_int()
void xt_assign_id_map_int |
( |
size_t |
n, |
|
|
int *restrict |
a, |
|
|
int |
ofs |
|
) |
| |
|
extern |
assign
- Parameters
-
n | length of array a to assign to |
a | array to initialize |
ofs | offset of assigned values, typically 1 for Fortran style arrays |
Definition at line 77 of file xt_sort.c.
◆ xt_sort_idxpos
◆ xt_sort_index
void(* xt_sort_index) (Xt_int *restrict a, int n, int *restrict idx, int reset_index) |
( |
Xt_int *restrict |
a, |
|
|
int |
n, |
|
|
int *restrict |
idx, |
|
|
int |
reset_index |
|
) |
| |
|
extern |
◆ xt_sort_int
void(* xt_sort_int) (int *a, size_t n) |
( |
int * |
a, |
|
|
size_t |
n |
|
) |
| |
|
extern |
◆ xt_sort_int_permutation
void(* xt_sort_int_permutation) (int *restrict a, size_t n, int *restrict permutation) |
( |
int *restrict |
a, |
|
|
size_t |
n, |
|
|
int *restrict |
permutation |
|
) |
| |
|
extern |
◆ xt_sort_xt_int
void(* xt_sort_xt_int) (Xt_int *a, size_t n) |
( |
Xt_int * |
a, |
|
|
size_t |
n |
|
) |
| |
|
extern |
◆ xt_sort_xt_int_permutation
void(* xt_sort_xt_int_permutation) (Xt_int *restrict a, size_t n, int *restrict permutation) |
( |
Xt_int *restrict |
a, |
|
|
size_t |
n, |
|
|
int *restrict |
permutation |
|
) |
| |
|
extern |