2012-02-03 22:07:47 +00:00
|
|
|
#include "SkTypes.h"
|
|
|
|
|
|
|
|
// FIXME: Move this templated version into SKTSearch.h
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
static void QSort_Partition(T** first, T** last)
|
|
|
|
{
|
|
|
|
T** left = first;
|
|
|
|
T** rite = last;
|
|
|
|
T** pivot = left;
|
|
|
|
|
|
|
|
while (left <= rite) {
|
|
|
|
while (left < last && **left < **pivot)
|
|
|
|
left += 1;
|
|
|
|
while (first < rite && **pivot < **rite)
|
|
|
|
rite -= 1;
|
|
|
|
if (left <= rite) {
|
|
|
|
if (left < rite) {
|
|
|
|
SkTSwap(*left, *rite);
|
|
|
|
}
|
|
|
|
left += 1;
|
|
|
|
rite -= 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (first < rite)
|
|
|
|
QSort_Partition(first, rite);
|
|
|
|
if (left < last)
|
|
|
|
QSort_Partition(left, last);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
void QSort(T** base, size_t count)
|
|
|
|
{
|
|
|
|
SkASSERT(base);
|
|
|
|
|
|
|
|
if (count <= 1) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
QSort_Partition(base, base + (count - 1));
|
|
|
|
}
|
|
|
|
|
2012-02-09 22:04:27 +00:00
|
|
|
template <typename S, typename T>
|
2012-02-15 22:01:16 +00:00
|
|
|
static void QSort_Partition(S& context, T* first, T* last,
|
|
|
|
bool (*lessThan)(S&, const T*, const T*))
|
2012-02-03 22:07:47 +00:00
|
|
|
{
|
|
|
|
T* left = first;
|
|
|
|
T* rite = last;
|
|
|
|
T* pivot = left;
|
|
|
|
|
|
|
|
while (left <= rite) {
|
2012-02-15 22:01:16 +00:00
|
|
|
while (left < last && lessThan(context, left, pivot))
|
2012-02-03 22:07:47 +00:00
|
|
|
left += 1;
|
2012-02-15 22:01:16 +00:00
|
|
|
while (first < rite && lessThan(context, pivot, rite))
|
2012-02-03 22:07:47 +00:00
|
|
|
rite -= 1;
|
|
|
|
if (left <= rite) {
|
|
|
|
if (left < rite) {
|
|
|
|
SkTSwap(*left, *rite);
|
|
|
|
}
|
|
|
|
left += 1;
|
|
|
|
rite -= 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (first < rite)
|
2012-02-09 22:04:27 +00:00
|
|
|
QSort_Partition(context, first, rite, lessThan);
|
2012-02-03 22:07:47 +00:00
|
|
|
if (left < last)
|
2012-02-09 22:04:27 +00:00
|
|
|
QSort_Partition(context, left, last, lessThan);
|
2012-02-03 22:07:47 +00:00
|
|
|
}
|
|
|
|
|
2012-02-09 22:04:27 +00:00
|
|
|
template <typename S, typename T>
|
2012-02-15 22:01:16 +00:00
|
|
|
void QSort(S& context, T* base, size_t count,
|
|
|
|
bool (*lessThan)(S& , const T*, const T*))
|
2012-02-03 22:07:47 +00:00
|
|
|
{
|
|
|
|
SkASSERT(base);
|
|
|
|
SkASSERT(lessThan);
|
|
|
|
|
|
|
|
if (count <= 1) {
|
|
|
|
return;
|
|
|
|
}
|
2012-02-09 22:04:27 +00:00
|
|
|
QSort_Partition(context, base, base + (count - 1), lessThan);
|
2012-02-03 22:07:47 +00:00
|
|
|
}
|