Yet Another eXchange Tool  0.9.0
xt_sort.c
Go to the documentation of this file.
1 
12 /*
13  * Keywords:
14  * Maintainer: Jörg Behrens <behrens@dkrz.de>
15  * Moritz Hanke <hanke@dkrz.de>
16  * Thomas Jahns <jahns@dkrz.de>
17  * URL: https://doc.redmine.dkrz.de/yaxt/html/
18  *
19  * Redistribution and use in source and binary forms, with or without
20  * modification, are permitted provided that the following conditions are
21  * met:
22  *
23  * Redistributions of source code must retain the above copyright notice,
24  * this list of conditions and the following disclaimer.
25  *
26  * Redistributions in binary form must reproduce the above copyright
27  * notice, this list of conditions and the following disclaimer in the
28  * documentation and/or other materials provided with the distribution.
29  *
30  * Neither the name of the DKRZ GmbH nor the names of its contributors
31  * may be used to endorse or promote products derived from this software
32  * without specific prior written permission.
33  *
34  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
35  * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
36  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
37  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
38  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
39  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
40  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
41  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
42  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
43  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
44  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
45  */
46 #ifdef HAVE_CONFIG_H
47 #include <config.h>
48 #endif
49 
50 #include "xt/xt_sort.h"
51 #include "xt_sort_internal.h"
52 
53 void (*xt_sort_int)(int *a, size_t n)
55 void (*xt_sort_index)(Xt_int * a, int n, int * idx, int reset_index)
58 void (*xt_sort_int_permutation)(int a[], size_t n, int permutation[])
60 
61 /*
62  * void xt_sort_init(void) {
63  *
64  * //! \todo getenv: key = XT_SORT_METHOD, possible values: { QUICKSORT, MERGESORT }; we might accept uppercase and lowercase values
65  *
66  * /\* xt_sort_index = ; *\/
67  * /\* xt_sort_idxpos = ; *\/
68  * }
69  */
70 
71 /*
72  * Local Variables:
73  * c-basic-offset: 2
74  * coding: utf-8
75  * indent-tabs-mode: nil
76  * show-trailing-whitespace: t
77  * require-trailing-newline: t
78  * End:
79  */
void xt_quicksort_index(Xt_int *v_idx, int n, int *v_pos, int reset_pos)
Definition: quicksort.c:80
void xt_quicksort_int(int a[], size_t n)
void xt_quicksort_int_permutation(int a[], size_t n, int permutation[])
void xt_quicksort_idxpos(idxpos_type v[], size_t n)
XT_INT Xt_int
Definition: xt_core.h:68
void(* xt_sort_int_permutation)(int a[], size_t n, int permutation[])
Definition: xt_sort.c:58
void(* xt_sort_index)(Xt_int *a, int n, int *idx, int reset_index)
Definition: xt_sort.c:55
void(* xt_sort_idxpos)(idxpos_type *v, size_t n)
Definition: xt_sort.c:57
void(* xt_sort_int)(int *a, size_t n)
Definition: xt_sort.c:53