Yet Another eXchange Tool 0.11.2
Loading...
Searching...
No Matches
xt_sort.h
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://dkrz-sw.gitlab-pages.dkrz.de/yaxt/
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
47#ifndef XT_SORT_H
48#define XT_SORT_H
49
50#ifdef HAVE_CONFIG_H
51#include <config.h>
52#endif
53
54#include <stdlib.h>
55
56#include <xt/quicksort.h>
57#include <xt/mergesort.h>
58
61extern void (*xt_sort_int)(int *a, size_t n);
62extern void (*xt_sort_xt_int)(Xt_int *a, size_t n);
63extern void (*xt_sort_index)(Xt_int *restrict a, int n, int *restrict idx,
64 int reset_index);
65extern void (*xt_sort_idxpos)(idxpos_type *v, size_t n);
66extern void (*xt_sort_xt_int_permutation)(Xt_int *restrict a, size_t n,
67 int *restrict permutation);
68extern void (*xt_sort_int_permutation)(int *restrict a, size_t n,
69 int *restrict permutation);
70
71
78extern void
79xt_assign_id_map_int(size_t n, int *restrict a, int ofs);
80
81#endif // XT_SORT_H
82
83/*
84 * Local Variables:
85 * c-basic-offset: 2
86 * coding: utf-8
87 * indent-tabs-mode: nil
88 * show-trailing-whitespace: t
89 * require-trailing-newline: t
90 * End:
91 */
mergesort.h
merge sort declaration
quicksort.h
quicksort declaration
idxpos_type
struct idxpos_struct idxpos_type
Xt_int
XT_INT Xt_int
Definition xt_core.h:72
xt_sort_idxpos
void(* xt_sort_idxpos)(idxpos_type *v, size_t n)
Definition xt_sort.c:60
xt_sort_int
void(* xt_sort_int)(int *a, size_t n)
Definition xt_sort.c:53
xt_sort_xt_int_permutation
void(* xt_sort_xt_int_permutation)(Xt_int *restrict a, size_t n, int *restrict permutation)
xt_sort_xt_int
void(* xt_sort_xt_int)(Xt_int *a, size_t n)
Definition xt_sort.c:55
xt_sort_int_permutation
void(* xt_sort_int_permutation)(int *restrict a, size_t n, int *restrict permutation)
xt_sort_index
void(* xt_sort_index)(Xt_int *restrict a, int n, int *restrict idx, int reset_index)
Definition xt_sort.c:57
xt_assign_id_map_int
void xt_assign_id_map_int(size_t n, int *restrict a, int ofs)
Definition xt_sort.c:77
Generated by doxygen 1.13.0