Yet Another eXchange Tool 0.11.3
Loading...
Searching...
No Matches
quicksort.h File Reference

quicksort declaration More...

#include <stdlib.h>
#include <xt/sort_common.h>
Include dependency graph for quicksort.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

void xt_quicksort_int (int a[], size_t n)
 
void xt_quicksort_xt_int (Xt_int a[], size_t n)
 
void xt_quicksort_idxpos (idxpos_type v[], size_t n)
 
void xt_quicksort_index (Xt_int *restrict a, int n, int *restrict idx, int reset_index)
 
void xt_quicksort_xt_int_permutation (Xt_int *restrict a, size_t n, int *restrict permutation)
 
void xt_quicksort_int_permutation (int *restrict a, size_t n, int *restrict permutation)
 

Detailed Description

quicksort declaration

Author
Jörg Behrens behre.nosp@m.ns@d.nosp@m.krz.d.nosp@m.e Moritz Hanke hanke.nosp@m.@dkr.nosp@m.z.de Thomas Jahns jahns.nosp@m.@dkr.nosp@m.z.de

Definition in file quicksort.h.

Function Documentation

◆ xt_quicksort_idxpos()

void xt_quicksort_idxpos ( idxpos_type v[],
size_t n )

quicksort changing structured values

Parameters
[in,out]varray to be sorted
[in]nlength of data

◆ xt_quicksort_index()

void xt_quicksort_index ( Xt_int *restrict a,
int n,
int *restrict idx,
int reset_index )

quicksort changing values and indices

Parameters
[in,out]aarray to be sorted
[in]nnumber of elements in a and idx
[in,out]idxold index of sorted returned a
[in]reset_indexoverride given idx by identity idx

Definition at line 71 of file quicksort.c.

Here is the call graph for this function:

◆ xt_quicksort_int()

void xt_quicksort_int ( int a[],
size_t n )

quicksort changing structured values

Parameters
[in,out]aarray of ints to be sorted
[in]nlength of data
Examples
test_sort.c.

◆ xt_quicksort_int_permutation()

void xt_quicksort_int_permutation ( int *restrict a,
size_t n,
int *restrict permutation )

quicksort sorting values and indices

Parameters
[in,out]aarray of n ints to be sorted
[in]nlength of data
[in,out]permutationcontents permuted exactly as a and used to resolve ordering if two elements of a have the same value
Examples
test_xmap_intersection_parallel.c.

◆ xt_quicksort_xt_int()

void xt_quicksort_xt_int ( Xt_int a[],
size_t n )

quicksort changing structured values

Parameters
[in,out]aarray of ints to be sorted
[in]nlength of data

◆ xt_quicksort_xt_int_permutation()

void xt_quicksort_xt_int_permutation ( Xt_int *restrict a,
size_t n,
int *restrict permutation )

quicksort changing values and indices

Parameters
[in,out]aarray to be sorted
[in]nnumber of elements in a and idx
[in,out]permutationcontents permuted exactly as a and used to resolve ordering if two elements of a have the same value