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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
#include <u.h>
#include <base.h>
#include <base/macro/qsort.h>
// -----------------------------------------------------------------------
// ints
void
sort·ints(uintptr sz, int arr[])
{
int tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·int8s(uintptr sz, int8 arr[])
{
int8 tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·int16s(uintptr sz, int16 arr[])
{
int16 tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·int32s(uintptr sz, int32 arr[])
{
int32 tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·int64s(uintptr sz, int64 arr[])
{
int64 tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·uints(uintptr sz, uint arr[])
{
uint tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·uint8s(uintptr sz, uint8 arr[])
{
uint8 tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·uint16s(uintptr sz, uint16 arr[])
{
uint16 tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·uint32s(uintptr sz, uint32 arr[])
{
uint32 tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·uint64s(uintptr sz, uint64 arr[])
{
uint64 tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
// -----------------------------------------------------------------------
// floats
void
sort·floats(uintptr sz, float arr[])
{
float tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
void
sort·doubles(uintptr sz, double arr[])
{
double tmp;
#define LESS(i, j) (arr[i] < arr[j])
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
// -----------------------------------------------------------------------
// strings
void
sort·strings(uintptr sz, byte* arr[])
{
byte *tmp;
#define LESS(i, j) (strcmp(arr[i], arr[j]) < 0)
#define SWAP(i, j) (tmp = arr[i], arr[i] = arr[j], arr[j] = tmp)
QSORT(sz, LESS, SWAP);
#undef SWAP
#undef LESS
}
|
