-
Notifications
You must be signed in to change notification settings - Fork 1.2k
/
QuickSort.h
282 lines (257 loc) · 7.32 KB
/
QuickSort.h
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
//-------------------------------------------------------------------------------------------------------
// Copyright (C) Microsoft. All rights reserved.
// Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.
//-------------------------------------------------------------------------------------------------------
#pragma once
namespace JsUtil
{
// Sorting Networks - BEGIN
#define CCQ_SORT2(a, b) \
if (comparer(context, \
base + (b * size), \
base + (a * size)) < 0) \
{ \
CCQ_SWAP(base + (a * size), \
base + (b * size), size); \
}
#define CCQ_SORT3() \
CCQ_SORT2(0, 1) \
CCQ_SORT2(1, 2) \
CCQ_SORT2(0, 1)
#define CCQ_SORT4() \
CCQ_SORT2(0, 1) \
CCQ_SORT2(2, 3) \
CCQ_SORT2(0, 2) \
CCQ_SORT2(1, 3) \
CCQ_SORT2(1, 2)
#define CCQ_SORT5(a, b, c, d, e) \
CCQ_SORT2(a, b) \
CCQ_SORT2(d, e) \
CCQ_SORT2(c, e) \
CCQ_SORT2(c, d) \
CCQ_SORT2(a, d) \
CCQ_SORT2(a, c) \
CCQ_SORT2(b, e) \
CCQ_SORT2(b, d) \
CCQ_SORT2(b, c)
#define CCQ_SORT6() \
CCQ_SORT2(1, 2) \
CCQ_SORT2(0, 2) \
CCQ_SORT2(0, 1) \
CCQ_SORT2(4, 5) \
CCQ_SORT2(3, 5) \
CCQ_SORT2(3, 4) \
CCQ_SORT2(0, 3) \
CCQ_SORT2(1, 4) \
CCQ_SORT2(2, 5) \
CCQ_SORT2(2, 4) \
CCQ_SORT2(1, 3) \
CCQ_SORT2(2, 3)
#define CCQ_SORT7() \
CCQ_SORT2(1, 2) \
CCQ_SORT2(0, 2) \
CCQ_SORT2(0, 1) \
CCQ_SORT2(3, 4) \
CCQ_SORT2(5, 6) \
CCQ_SORT2(3, 5) \
CCQ_SORT2(4, 6) \
CCQ_SORT2(4, 5) \
CCQ_SORT2(0, 4) \
CCQ_SORT2(0, 3) \
CCQ_SORT2(1, 5) \
CCQ_SORT2(2, 6) \
CCQ_SORT2(2, 5) \
CCQ_SORT2(1, 3) \
CCQ_SORT2(2, 4) \
CCQ_SORT2(2, 3)
#define CCQ_SORT8() \
CCQ_SORT2(0, 1) \
CCQ_SORT2(2, 3) \
CCQ_SORT2(0, 2) \
CCQ_SORT2(1, 3) \
CCQ_SORT2(1, 2) \
CCQ_SORT2(4, 5) \
CCQ_SORT2(6, 7) \
CCQ_SORT2(4, 6) \
CCQ_SORT2(5, 7) \
CCQ_SORT2(5, 6) \
CCQ_SORT2(0, 4) \
CCQ_SORT2(1, 5) \
CCQ_SORT2(1, 4) \
CCQ_SORT2(2, 6) \
CCQ_SORT2(3, 7) \
CCQ_SORT2(3, 6) \
CCQ_SORT2(2, 4) \
CCQ_SORT2(3, 5) \
CCQ_SORT2(3, 4)
#define CCQ_SORT9() \
CCQ_SORT2(0, 1) \
CCQ_SORT2(3, 4) \
CCQ_SORT2(6, 7) \
CCQ_SORT2(1, 2) \
CCQ_SORT2(4, 5) \
CCQ_SORT2(7, 8) \
CCQ_SORT2(0, 1) \
CCQ_SORT2(3, 4) \
CCQ_SORT2(6, 7) \
CCQ_SORT2(0, 3) \
CCQ_SORT2(3, 6) \
CCQ_SORT2(0, 3) \
CCQ_SORT2(1, 4) \
CCQ_SORT2(4, 7) \
CCQ_SORT2(1, 4) \
CCQ_SORT2(2, 5) \
CCQ_SORT2(5, 8) \
CCQ_SORT2(2, 5) \
CCQ_SORT2(1, 3) \
CCQ_SORT2(5, 7) \
CCQ_SORT2(2, 6) \
CCQ_SORT2(4, 6) \
CCQ_SORT2(2, 4) \
CCQ_SORT2(2, 3) \
CCQ_SORT2(5, 6)
// Sorting Networks - END
union CC_QSORT_SWAP8
{
char chr[8]; // optimized for Js::Var
};
union CC_QSORT_SWAP4
{
char chr[4]; // optimized for TypedArray
};
union CC_QSORT_SWAP2
{
char chr[2]; // others
};
#define CC_QSORT_SWAP_LOOP(T, a, b, nsize) \
{ \
for (size_t i = 0; i < nsize; i++) \
{ \
T c = (a)[i]; \
(a)[i] = (b)[i]; \
(b)[i] = c; \
} \
}
template <class Policy, class T>
class QuickSortSwap
{
public:
static inline void swap(T* a, T* b, size_t size)
{
if (a == b) return;
size_t tsize;
if (size >= 8)
{
tsize = 8;
size_t nsize = size / tsize;
CC_QSORT_SWAP_LOOP(CC_QSORT_SWAP8, (CC_QSORT_SWAP8*) a, (CC_QSORT_SWAP8*) b, nsize)
}
else if (size >= 4)
{
tsize = 4;
size_t nsize = size / tsize;
CC_QSORT_SWAP_LOOP(CC_QSORT_SWAP4, (CC_QSORT_SWAP4*) a, (CC_QSORT_SWAP4*) b, nsize)
}
else
{
tsize = 2;
size_t nsize = size / tsize;
CC_QSORT_SWAP_LOOP(CC_QSORT_SWAP2, (CC_QSORT_SWAP2*) a, (CC_QSORT_SWAP2*) b, nsize)
}
CC_QSORT_SWAP_LOOP(char, (char*) a, (char*) b, size % tsize);
}
};
#ifdef RECYCLER_WRITE_BARRIER
template <class T>
class QuickSortSwap<_write_barrier_policy, T>
{
public:
static inline void swap(T* a, T* b, size_t _)
{
AssertMsg(_ == 1, "No byte to byte copies when a type has SWB is enabled. size should be 1!");
T temp = *a;
*a = *b;
*b = temp;
}
};
#endif
template <class Policy, class T, class Comparer>
class QuickSort
{
public:
#define CCQ_SWAP QuickSortSwap<Policy, T>::swap
static void Sort(T* base, size_t nmemb, size_t size, Comparer comparer, void* context)
{
if (!base)
{
return;
}
if (nmemb <= 9) // use sorting networks for members <= 2^3
{
switch(nmemb)
{
case 9:
CCQ_SORT9()
break;
case 8:
CCQ_SORT8()
break;
case 7:
CCQ_SORT7()
break;
case 6:
CCQ_SORT6()
break;
case 5:
CCQ_SORT5(0, 1, 2, 3, 4)
break;
case 4:
CCQ_SORT4()
break;
case 3:
CCQ_SORT3()
break;
case 2:
CCQ_SORT2(0, 1)
break;
default:
break; // nothing to sort
}
return;
}
CCQ_SORT5(0, (nmemb / 4), (nmemb / 2), ((3 * nmemb) / 4), (nmemb - 1));
// guess the median is in the middle now.
size_t pos = 0;
const size_t pivot = (nmemb - 1) * size;
// make last element the median(pivot)
CCQ_SWAP(base + pivot, base + ((nmemb / 2) * size), size);
// standard qsort pt. below
for (size_t i = 0; i < pivot; i+= size)
{
if (comparer(context, base + i, base + pivot) <= 0)
{
CCQ_SWAP(base + i, base + (pos * size), size);
pos++;
}
}
// issue the last change
CCQ_SWAP(base + (pos * size), base + pivot, size);
if (pos >= nmemb - 1)
{
return; // looks like it was either all sorted OR nothing to sort
}
Sort(base, pos++, size, comparer, context);
Sort(base + (pos * size), nmemb - pos, size, comparer, context);
}
#undef CCQ_SWAP
};
#undef CCQ_SORT2
#undef CCQ_SORT3
#undef CCQ_SORT4
#undef CCQ_SORT5
#undef CCQ_SORT6
#undef CCQ_SORT7
#undef CCQ_SORT8
#undef CCQ_SORT9
#undef CC_QSORT_SWAP_LOOP
}