Fix random coverage in std.algorithm.sorting

This commit is contained in:
Sebastian Wilzbach 2017-07-07 21:40:59 +02:00
parent 4f0e28b54a
commit e3c91711a1

View file

@ -895,7 +895,7 @@ if (ss == SwapStrategy.unstable && isRandomAccessRange!Range
auto a = new int[](uniform(0, 100, r));
foreach (ref e; a)
{
e = uniform(0, 50);
e = uniform(0, 50, r);
}
auto pieces = partition3(a, 25);
assert(pieces[0].length + pieces[1].length + pieces[2].length == a.length);