src\Dependencies\Collections\Internal\ArraySortHelper.cs (16)
171InsertionSort(keys.Slice(0, partitionSize), comparer!);
177HeapSort(keys.Slice(0, partitionSize), comparer!);
182int p = PickPivotAndPartition(keys.Slice(0, partitionSize), comparer!);
185IntroSort(keys.Slice(p + 1, partitionSize - (p + 1)), depthLimit, comparer!);
453InsertionSort(keys.Slice(0, partitionSize));
459HeapSort(keys.Slice(0, partitionSize));
464int p = PickPivotAndPartition(keys.Slice(0, partitionSize));
467IntroSort(keys.Slice(p + 1, partitionSize - (p + 1)), depthLimit);
762InsertionSort(keys.Slice(0, partitionSize), values.Slice(0, partitionSize), comparer!);
768HeapSort(keys.Slice(0, partitionSize), values.Slice(0, partitionSize), comparer!);
773int p = PickPivotAndPartition(keys.Slice(0, partitionSize), values.Slice(0, partitionSize), comparer!);
776IntroSort(keys.Slice(p + 1, partitionSize - (p + 1)), values.Slice(p + 1, partitionSize - (p + 1)), depthLimit, comparer!);
1001InsertionSort(keys.Slice(0, partitionSize), values.Slice(0, partitionSize));
1007HeapSort(keys.Slice(0, partitionSize), values.Slice(0, partitionSize));
1012int p = PickPivotAndPartition(keys.Slice(0, partitionSize), values.Slice(0, partitionSize));
1015IntroSort(keys.Slice(p + 1, partitionSize - (p + 1)), values.Slice(p + 1, partitionSize - (p + 1)), depthLimit);