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