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
|
/*
* Copyright 2012 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef TSearch_DEFINED
#define TSearch_DEFINED
#include "SkTypes.h"
// FIXME: Move this templated version into SKTSearch.h
template <typename T>
static T** QSort_Partition(T** left, T** right, T** pivot)
{
T* pivotValue = *pivot;
SkTSwap(*pivot, *right);
T** newPivot = left;
while (left < right) {
if (**left < *pivotValue) {
SkTSwap(*left, *newPivot);
newPivot += 1;
}
left += 1;
}
SkTSwap(*newPivot, *right);
return newPivot;
}
template <typename T>
void QSort(T** left, T** right)
{
if (left >= right) {
return;
}
T** pivot = left + (right - left >> 1);
pivot = QSort_Partition(left, right, pivot);
QSort(left, pivot - 1);
QSort(pivot + 1, right);
}
template <typename S, typename T>
static T* QSort_Partition(S& context, T* left, T* right, T* pivot,
bool (*lessThan)(S&, const T, const T))
{
T pivotValue = *pivot;
SkTSwap(*pivot, *right);
T* newPivot = left;
while (left < right) {
if (lessThan(context, *left, pivotValue)) {
SkTSwap(*left, *newPivot);
newPivot += 1;
}
left += 1;
}
SkTSwap(*newPivot, *right);
return newPivot;
}
template <typename S, typename T>
void QSort(S& context, T* left, T* right,
bool (*lessThan)(S& , const T, const T))
{
if (left >= right) {
return;
}
T* pivot = left + (right - left >> 1);
pivot = QSort_Partition(context, left, right, pivot, lessThan);
QSort(context, left, pivot - 1, lessThan);
QSort(context, pivot + 1, right, lessThan);
}
#endif
|
