src\Dependencies\Collections\Internal\ArraySortHelper.cs (16)
169InsertionSort(keys.Slice(0, partitionSize), comparer!);
175HeapSort(keys.Slice(0, partitionSize), comparer!);
180int p = PickPivotAndPartition(keys.Slice(0, partitionSize), comparer!);
183IntroSort(keys.Slice(p + 1, partitionSize - (p + 1)), depthLimit, comparer!);
451InsertionSort(keys.Slice(0, partitionSize));
457HeapSort(keys.Slice(0, partitionSize));
462int p = PickPivotAndPartition(keys.Slice(0, partitionSize));
465IntroSort(keys.Slice(p + 1, partitionSize - (p + 1)), depthLimit);
760InsertionSort(keys.Slice(0, partitionSize), values.Slice(0, partitionSize), comparer!);
766HeapSort(keys.Slice(0, partitionSize), values.Slice(0, partitionSize), comparer!);
771int p = PickPivotAndPartition(keys.Slice(0, partitionSize), values.Slice(0, partitionSize), comparer!);
774IntroSort(keys.Slice(p + 1, partitionSize - (p + 1)), values.Slice(p + 1, partitionSize - (p + 1)), depthLimit, comparer!);
999InsertionSort(keys.Slice(0, partitionSize), values.Slice(0, partitionSize));
1005HeapSort(keys.Slice(0, partitionSize), values.Slice(0, partitionSize));
1010int p = PickPivotAndPartition(keys.Slice(0, partitionSize), values.Slice(0, partitionSize));
1013IntroSort(keys.Slice(p + 1, partitionSize - (p + 1)), values.Slice(p + 1, partitionSize - (p + 1)), depthLimit);