mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-05-05 01:20:40 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Tighter loop for insertion sorting

Browse source
This commit is contained in:
Andrei Alexandrescu 2016-09-25 18:13:58 +02:00
parent 97f58eac9d
commit a4393248ba
1 changed files with 7 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

13
std/algorithm/sorting.d
View file

@ -1326,16 +1326,17 @@ private void shortSort(alias less, Range)(Range r)
auto t = r[0]; if (pred(t, r[0])) r[0] = r[0];
}))) // Can we afford to temporarily invalidate the array?
{
size_t j = i;
if (pred(r[j + 1], r[j]))
size_t j = i + 1;
auto temp = r[i];
if (pred(r[j], temp))
{
auto temp = r[j];
do
{
r[j] = r[j + 1];
r[j - 1] = r[j];
++j;
}
while (++j + 1 < r.length && pred(r[j + 1], temp));
r[j] = temp;
while (j < r.length && pred(r[j], temp));
r[j - 1] = temp;
}
}
else