IntroSort() [2/2]

static void System.Collections.Generic.GenericArraySortHelper< TKey, TValue >.IntroSort ( Span< TKey > keys, Span< TValue > values, int depthLimit )

inlinestaticprivate

Definition at line 556 of file GenericArraySortHelper.cs.

    {
        int num = keys.Length;
        while (num > 1)
        {
            if (num <= 16)
            {
                switch (num)
                {
                case 2:
                    SwapIfGreaterWithValues(keys, values, 0, 1);
                    break;
                case 3:
                    SwapIfGreaterWithValues(keys, values, 0, 1);
                    SwapIfGreaterWithValues(keys, values, 0, 2);
                    SwapIfGreaterWithValues(keys, values, 1, 2);
                    break;
                default:
                    InsertionSort(keys.Slice(0, num), values.Slice(0, num));
                    break;
                }
                break;
            }
            if (depthLimit == 0)
            {
                HeapSort(keys.Slice(0, num), values.Slice(0, num));
                break;
            }
            depthLimit--;
            int num2 = PickPivotAndPartition(keys.Slice(0, num), values.Slice(0, num));
            Span<TKey> span = keys;
            Span<TKey> keys2 = span[(num2 + 1)..num];
            Span<TValue> span2 = values;
            IntroSort(keys2, span2[(num2 + 1)..num], depthLimit);
            num = num2;
        }
    }

References System.Collections.Generic.GenericArraySortHelper< TKey, TValue >.HeapSort(), System.Collections.Generic.GenericArraySortHelper< TKey, TValue >.InsertionSort(), System.Collections.Generic.GenericArraySortHelper< TKey, TValue >.IntroSort(), System.keys, System.Collections.Generic.GenericArraySortHelper< TKey, TValue >.PickPivotAndPartition(), System.Collections.Generic.GenericArraySortHelper< TKey, TValue >.SwapIfGreaterWithValues(), and System.values.