1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
//===--- sort.h -------------------------------------------------------------===
//
// satoko: Satisfiability solver
//
// This file is distributed under the BSD 2-Clause License.
// See LICENSE for details.
//
//===------------------------------------------------------------------------===
#ifndef satoko__utils__sort_h
#define satoko__utils__sort_h
#include "misc/util/abc_global.h"
ABC_NAMESPACE_HEADER_START
static inline void select_sort(void **data, unsigned size,
int (*comp_fn)(const void *, const void *))
{
unsigned i, j, i_best;
void *temp;
for (i = 0; i < (size - 1); i++) {
i_best = i;
for (j = i + 1; j < size; j++) {
if (comp_fn(data[j], data[i_best]))
i_best = j;
}
temp = data[i];
data[i] = data[i_best];
data[i_best] = temp;
}
}
static void satoko_sort(void **data, unsigned size,
int (*comp_fn)(const void *, const void *))
{
if (size <= 15)
select_sort(data, size, comp_fn);
else {
void *pivot = data[size / 2];
void *temp;
unsigned j = size;
int i = -1;
for (;;) {
do {
i++;
} while (comp_fn(data[i], pivot));
do {
j--;
} while (comp_fn(pivot, data[j]));
if ((unsigned) i >= j)
break;
temp = data[i];
data[i] = data[j];
data[j] = temp;
}
satoko_sort(data, (unsigned) i, comp_fn);
satoko_sort(data + i, (size - (unsigned) i), comp_fn);
}
}
ABC_NAMESPACE_HEADER_END
#endif /* satoko__utils__sort_h */
|
