Lines Matching refs:left
13 static T* QSort_Partition(T* left, T* right, T* pivot) in QSort_Partition() argument
17 T* newPivot = left; in QSort_Partition()
18 while (left < right) { in QSort_Partition()
19 if (*left < pivotValue) { in QSort_Partition()
20 SkTSwap(*left, *newPivot); in QSort_Partition()
23 left += 1; in QSort_Partition()
30 void QSort(T* left, T* right) in QSort() argument
32 if (left >= right) { in QSort()
35 T* pivot = left + (right - left >> 1); in QSort()
36 pivot = QSort_Partition(left, right, pivot); in QSort()
37 QSort(left, pivot - 1); in QSort()
42 static T** QSort_Partition(T** left, T** right, T** pivot) in QSort_Partition() argument
46 T** newPivot = left; in QSort_Partition()
47 while (left < right) { in QSort_Partition()
48 if (**left < *pivotValue) { in QSort_Partition()
49 SkTSwap(*left, *newPivot); in QSort_Partition()
52 left += 1; in QSort_Partition()
59 void QSort(T** left, T** right) in QSort() argument
61 if (left >= right) { in QSort()
64 T** pivot = left + (right - left >> 1); in QSort()
65 pivot = QSort_Partition(left, right, pivot); in QSort()
66 QSort(left, pivot - 1); in QSort()
71 static T* QSort_Partition(S& context, T* left, T* right, T* pivot, in QSort_Partition() argument
76 T* newPivot = left; in QSort_Partition()
77 while (left < right) { in QSort_Partition()
78 if (lessThan(context, *left, pivotValue)) { in QSort_Partition()
79 SkTSwap(*left, *newPivot); in QSort_Partition()
82 left += 1; in QSort_Partition()
89 void QSort(S& context, T* left, T* right, in QSort() argument
92 if (left >= right) { in QSort()
95 T* pivot = left + (right - left >> 1); in QSort()
96 pivot = QSort_Partition(context, left, right, pivot, lessThan); in QSort()
97 QSort(context, left, pivot - 1, lessThan); in QSort()