// Token: 0x06003A23 RID: 14883 RVA: 0x000DC4E4 File Offset: 0x000DA6E4
private static int PickPivotAndPartition(T[] keys, int lo, int hi, IComparer <T> comparer)
{
int num = lo + (hi - lo) / 2;
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, num);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, hi);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, num, hi);
T t = keys[num];
ArraySortHelper <T> .Swap(keys, num, hi - 1);
int i = lo;
int num2 = hi - 1;
while (i < num2)
{
while (comparer.Compare(keys[++i], t) < 0)
{
}
while (comparer.Compare(t, keys[--num2]) < 0)
{
}
if (i >= num2)
{
break;
}
ArraySortHelper <T> .Swap(keys, i, num2);
}
ArraySortHelper <T> .Swap(keys, i, hi - 1);
return(i);
}
// Token: 0x06003A22 RID: 14882 RVA: 0x000DC448 File Offset: 0x000DA648
private static void IntroSort(T[] keys, int lo, int hi, int depthLimit, IComparer <T> comparer)
{
while (hi > lo)
{
int num = hi - lo + 1;
if (num <= 16)
{
if (num == 1)
{
return;
}
if (num == 2)
{
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, hi);
return;
}
if (num == 3)
{
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, hi - 1);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, hi);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, hi - 1, hi);
return;
}
ArraySortHelper <T> .InsertionSort(keys, lo, hi, comparer);
return;
}
else
{
if (depthLimit == 0)
{
ArraySortHelper <T> .Heapsort(keys, lo, hi, comparer);
return;
}
depthLimit--;
int num2 = ArraySortHelper <T> .PickPivotAndPartition(keys, lo, hi, comparer);
ArraySortHelper <T> .IntroSort(keys, num2 + 1, hi, depthLimit, comparer);
hi = num2 - 1;
}
}
}
private static void IntroSort(T[] keys, int lo, int hi, int depthLimit, IComparer <T> comparer)
{
int num1;
for (; hi > lo; hi = num1 - 1)
{
int num2 = hi - lo + 1;
if (num2 <= 16)
{
if (num2 == 1)
{
break;
}
if (num2 == 2)
{
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, hi);
break;
}
if (num2 == 3)
{
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, hi - 1);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, hi);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, hi - 1, hi);
break;
}
ArraySortHelper <T> .InsertionSort(keys, lo, hi, comparer);
break;
}
if (depthLimit == 0)
{
ArraySortHelper <T> .Heapsort(keys, lo, hi, comparer);
break;
}
--depthLimit;
num1 = ArraySortHelper <T> .PickPivotAndPartition(keys, lo, hi, comparer);
ArraySortHelper <T> .IntroSort(keys, num1 + 1, hi, depthLimit, comparer);
}
}
private static int PickPivotAndPartition(T[] keys, int lo, int hi, IComparer <T> comparer)
{
int index = lo + (hi - lo) / 2;
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, index);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, lo, hi);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, index, hi);
T obj = keys[index];
ArraySortHelper <T> .Swap(keys, index, hi - 1);
int i = lo;
int j = hi - 1;
while (i < j)
{
do
{
;
}while (comparer.Compare(keys[++i], obj) < 0);
do
{
;
}while (comparer.Compare(obj, keys[--j]) < 0);
if (i < j)
{
ArraySortHelper <T> .Swap(keys, i, j);
}
else
{
break;
}
}
ArraySortHelper <T> .Swap(keys, i, hi - 1);
return(i);
}
// Token: 0x06003A20 RID: 14880 RVA: 0x000DC340 File Offset: 0x000DA540
internal static void DepthLimitedQuickSort(T[] keys, int left, int right, IComparer <T> comparer, int depthLimit)
{
while (depthLimit != 0)
{
int num = left;
int num2 = right;
int num3 = num + (num2 - num >> 1);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, num, num3);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, num, num2);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, num3, num2);
T t = keys[num3];
for (;;)
{
if (comparer.Compare(keys[num], t) >= 0)
{
while (comparer.Compare(t, keys[num2]) < 0)
{
num2--;
}
if (num > num2)
{
break;
}
if (num < num2)
{
T t2 = keys[num];
keys[num] = keys[num2];
keys[num2] = t2;
}
num++;
num2--;
if (num > num2)
{
break;
}
}
else
{
num++;
}
}
depthLimit--;
if (num2 - left <= right - num)
{
if (left < num2)
{
ArraySortHelper <T> .DepthLimitedQuickSort(keys, left, num2, comparer, depthLimit);
}
left = num;
}
else
{
if (num < right)
{
ArraySortHelper <T> .DepthLimitedQuickSort(keys, num, right, comparer, depthLimit);
}
right = num2;
}
if (left >= right)
{
return;
}
}
ArraySortHelper <T> .Heapsort(keys, left, right, comparer);
}
internal static void DepthLimitedQuickSort(T[] keys, int left, int right, IComparer <T> comparer, int depthLimit)
{
while (depthLimit != 0)
{
int index1 = left;
int index2 = right;
int index3 = index1 + (index2 - index1 >> 1);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, index1, index3);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, index1, index2);
ArraySortHelper <T> .SwapIfGreater(keys, comparer, index3, index2);
T obj1 = keys[index3];
do
{
while (comparer.Compare(keys[index1], obj1) < 0)
{
++index1;
}
while (comparer.Compare(obj1, keys[index2]) < 0)
{
--index2;
}
if (index1 <= index2)
{
if (index1 < index2)
{
T obj2 = keys[index1];
keys[index1] = keys[index2];
keys[index2] = obj2;
}
++index1;
--index2;
}
else
{
break;
}
}while (index1 <= index2);
--depthLimit;
if (index2 - left <= right - index1)
{
if (left < index2)
{
ArraySortHelper <T> .DepthLimitedQuickSort(keys, left, index2, comparer, depthLimit);
}
left = index1;
}
else
{
if (index1 < right)
{
ArraySortHelper <T> .DepthLimitedQuickSort(keys, index1, right, comparer, depthLimit);
}
right = index2;
}
if (left >= right)
{
return;
}
}
ArraySortHelper <T> .Heapsort(keys, left, right, comparer);
}
