Skip to content

Commit c1d1c0e

Browse files
n8shn8sh
committed
Issue 18715 - Non-documented unittests should not use unpredictableSeed or default Random alias
1 parent 861e65a commit c1d1c0e

File tree

5 files changed

+40
-37
lines changed

5 files changed

+40
-37
lines changed

‎std/algorithm/internal.d

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -21,13 +21,13 @@ version(unittest)
2121

2222
package string[] rndstuff(T : string)()
2323
{
24-
import std.random : Random, unpredictableSeed, uniform;
24+
import std.random : Random = Xorshift, uniform;
2525

2626
static Random rnd;
2727
static bool first = true;
2828
if (first)
2929
{
30-
rnd = Random(unpredictableSeed);
30+
rnd.seed(234_567_891);
3131
first = false;
3232
}
3333
string[] result =
@@ -46,13 +46,13 @@ version(unittest)
4646

4747
package int[] rndstuff(T : int)()
4848
{
49-
import std.random : Random, unpredictableSeed, uniform;
49+
import std.random : Random = Xorshift, uniform;
5050

5151
static Random rnd;
5252
static bool first = true;
5353
if (first)
5454
{
55-
rnd = Random(unpredictableSeed);
55+
rnd = Random(345_678_912);
5656
first = false;
5757
}
5858
int[] result = new int[uniform(minArraySize, maxArraySize, rnd)];

‎std/algorithm/iteration.d

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -691,7 +691,7 @@ private struct MapResult(alias fun, Range)
691691
import std.internal.test.dummyrange;
692692
import std.range;
693693
import std.typecons : tuple;
694-
import std.random : unpredictableSeed, uniform, Random;
694+
import std.random : uniform, Random = Xorshift;
695695

696696
int[] arr1 = [ 1, 2, 3, 4 ];
697697
const int[] arr1Const = arr1;
@@ -749,7 +749,7 @@ private struct MapResult(alias fun, Range)
749749
assert(fibsSquares.front == 9);
750750

751751
auto repeatMap = map!"a"(repeat(1));
752-
auto gen = Random(unpredictableSeed);
752+
auto gen = Random(123_456_789);
753753
auto index = uniform(0, 1024, gen);
754754
static assert(isInfinite!(typeof(repeatMap)));
755755
assert(repeatMap[index] == 1);

‎std/algorithm/mutation.d

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -278,11 +278,11 @@ if (isInputRange!InputRange && isForwardRange!ForwardRange)
278278
{
279279
import std.algorithm.comparison : equal;
280280
import std.conv : text;
281-
import std.random : Random, unpredictableSeed, uniform;
281+
import std.random : Random = Xorshift, uniform;
282282

283283
// a more elaborate test
284284
{
285-
auto rnd = Random(unpredictableSeed);
285+
auto rnd = Random(123_456_789);
286286
int[] a = new int[uniform(100, 200, rnd)];
287287
int[] b = new int[uniform(100, 200, rnd)];
288288
foreach (ref e; a) e = uniform(-100, 100, rnd);

‎std/algorithm/sorting.d

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -746,8 +746,8 @@ if (isRandomAccessRange!Range && hasLength!Range && hasSlicing!Range && hasAssig
746746
import std.algorithm.iteration : map;
747747
import std.random;
748748
import std.stdio;
749-
auto s = unpredictableSeed;
750-
auto g = Random(s);
749+
auto s = 123_456_789;
750+
auto g = Xorshift(s);
751751
a = iota(0, uniform(1, 1000, g))
752752
.map!(_ => uniform(-1000, 1000, g))
753753
.array;
@@ -883,9 +883,9 @@ if (ss == SwapStrategy.unstable && isRandomAccessRange!Range
883883

884884
@safe unittest
885885
{
886-
import std.random : Random, uniform, unpredictableSeed;
886+
import std.random : Random = Xorshift, uniform;
887887

888-
immutable uint[] seeds = [3923355730, 1927035882, unpredictableSeed];
888+
immutable uint[] seeds = [3923355730, 1927035882];
889889
foreach (s; seeds)
890890
{
891891
auto r = Random(s);
@@ -1710,7 +1710,7 @@ private void shortSort(alias less, Range)(Range r)
17101710

17111711
@safe unittest
17121712
{
1713-
import std.random : Random, uniform;
1713+
import std.random : Random = Xorshift, uniform;
17141714

17151715
auto rnd = Random(1);
17161716
auto a = new int[uniform(100, 200, rnd)];
@@ -1949,12 +1949,12 @@ if (((ss == SwapStrategy.unstable && (hasSwappableElements!Range ||
19491949
{
19501950
import std.algorithm.internal : rndstuff;
19511951
import std.algorithm.mutation : swapRanges;
1952-
import std.random : Random, unpredictableSeed, uniform;
1952+
import std.random : Random = Xorshift, uniform;
19531953
import std.uni : toUpper;
19541954

19551955
// sort using delegate
19561956
auto a = new int[100];
1957-
auto rnd = Random(unpredictableSeed);
1957+
auto rnd = Random(123_456_789);
19581958
foreach (ref e; a)
19591959
{
19601960
e = uniform(-100, 100, rnd);
@@ -3457,7 +3457,7 @@ private T[] randomArray(Flag!"exactSize" flag = No.exactSize, T = int)(
34573457
T minValue = 0, T maxValue = 255)
34583458
{
34593459
import std.algorithm.iteration : map;
3460-
import std.random : unpredictableSeed, Random, uniform;
3460+
import std.random : uniform;
34613461
auto size = flag == Yes.exactSize ? maxSize : uniform(1, maxSize);
34623462
return iota(0, size).map!(_ => uniform(minValue, maxValue)).array;
34633463
}
@@ -3513,9 +3513,9 @@ private T[] randomArray(Flag!"exactSize" flag = No.exactSize, T = int)(
35133513
{
35143514
import std.algorithm.comparison : max, min;
35153515
import std.algorithm.iteration : reduce;
3516-
import std.random : Random, uniform, unpredictableSeed;
3516+
import std.random : Random = Xorshift, uniform;
35173517

3518-
immutable uint[] seeds = [90027751, 2709791795, 1374631933, 995751648, 3541495258, 984840953, unpredictableSeed];
3518+
immutable uint[] seeds = [90027751, 2709791795, 1374631933, 995751648, 3541495258, 984840953];
35193519
foreach (s; seeds)
35203520
{
35213521
auto r = Random(s);
@@ -3718,10 +3718,10 @@ if (isInputRange!(SRange) && isRandomAccessRange!(TRange)
37183718

37193719
@system unittest
37203720
{
3721-
import std.random : Random, unpredictableSeed, uniform, randomShuffle;
3721+
import std.random : Random = Xorshift, uniform, randomShuffle;
37223722
import std.typecons : Yes;
37233723

3724-
auto r = Random(unpredictableSeed);
3724+
auto r = Random(123_456_789);
37253725
ptrdiff_t[] a = new ptrdiff_t[uniform(1, 1000, r)];
37263726
foreach (i, ref e; a) e = i;
37273727
randomShuffle(a, r);

‎std/random.d

Lines changed: 20 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -583,7 +583,8 @@ alias MinstdRand = LinearCongruentialEngine!(uint, 48_271, 0, 2_147_483_647);
583583
// Check .save works
584584
static foreach (Type; std.meta.AliasSeq!(MinstdRand0, MinstdRand))
585585
{{
586-
auto rnd1 = Type(unpredictableSeed);
586+
auto rnd1 = Type(123_456_789);
587+
rnd1.popFront();
587588
auto rnd2 = rnd1.save;
588589
assert(rnd1 == rnd2);
589590
// Enable next test when RNGs are reference types
@@ -991,11 +992,11 @@ alias Mt19937_64 = MersenneTwisterEngine!(ulong, 64, 312, 156, 31,
991992

992993
Mt19937 gen;
993994

994-
assertThrown(gen.seed(map!((a) => unpredictableSeed)(repeat(0, 623))));
995+
assertThrown(gen.seed(map!((a) => 123_456_789U)(repeat(0, 623))));
995996

996-
gen.seed(map!((a) => unpredictableSeed)(repeat(0, 624)));
997+
gen.seed(123_456_789U.repeat(624));
997998
//infinite Range
998-
gen.seed(map!((a) => unpredictableSeed)(repeat(0)));
999+
gen.seed(123_456_789U.repeat);
9991000
}
10001001

10011002
@safe pure nothrow unittest
@@ -1020,7 +1021,8 @@ alias Mt19937_64 = MersenneTwisterEngine!(ulong, 64, 312, 156, 31,
10201021
// Check .save works
10211022
static foreach (Type; std.meta.AliasSeq!(Mt19937, Mt19937_64))
10221023
{{
1023-
auto gen1 = Type(unpredictableSeed);
1024+
auto gen1 = Type(123_456_789);
1025+
gen1.popFront();
10241026
auto gen2 = gen1.save;
10251027
assert(gen1 == gen2); // Danger, Will Robinson -- no opEquals for MT
10261028
// Enable next test when RNGs are reference types
@@ -1323,7 +1325,8 @@ alias Xorshift = Xorshift128; /// ditto
13231325
// Check .save works
13241326
foreach (Type; XorshiftTypes)
13251327
{
1326-
auto rnd1 = Type(unpredictableSeed);
1328+
auto rnd1 = Type(123_456_789);
1329+
rnd1.popFront();
13271330
auto rnd2 = rnd1.save;
13281331
assert(rnd1 == rnd2);
13291332
// Enable next test when RNGs are reference types
@@ -1343,7 +1346,7 @@ alias Xorshift = Xorshift128; /// ditto
13431346
foreach (Rng; PseudoRngTypes)
13441347
{
13451348
static assert(isUniformRNG!Rng);
1346-
auto rng = Rng(unpredictableSeed);
1349+
auto rng = Rng(123_456_789);
13471350
}
13481351
}
13491352

@@ -1720,7 +1723,7 @@ if ((isIntegral!(CommonType!(T1, T2)) || isSomeChar!(CommonType!(T1, T2))) &&
17201723
@safe unittest
17211724
{
17221725
import std.conv : to;
1723-
auto gen = Mt19937(unpredictableSeed);
1726+
auto gen = Mt19937(123_456_789);
17241727
static assert(isForwardRange!(typeof(gen)));
17251728

17261729
auto a = uniform(0, 1024, gen);
@@ -2056,7 +2059,7 @@ do
20562059

20572060
static foreach (T; std.meta.AliasSeq!(float, double, real))
20582061
{{
2059-
UniformRNG rng = UniformRNG(unpredictableSeed);
2062+
UniformRNG rng = UniformRNG(123_456_789);
20602063

20612064
auto a = uniform01();
20622065
assert(is(typeof(a) == double));
@@ -2240,7 +2243,7 @@ if (isRandomAccessRange!Range)
22402243
// Also tests partialShuffle indirectly.
22412244
auto a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
22422245
auto b = a.dup;
2243-
auto gen = RandomGen(unpredictableSeed);
2246+
auto gen = RandomGen(123_456_789);
22442247
randomShuffle(a, gen);
22452248
sort(a);
22462249
assert(a == b);
@@ -2421,7 +2424,7 @@ do
24212424

24222425
@safe unittest
24232426
{
2424-
auto rnd = Random(unpredictableSeed);
2427+
auto rnd = Xorshift(123_456_789);
24252428
auto i = dice(rnd, 0.0, 100.0);
24262429
assert(i == 1);
24272430
i = dice(rnd, 100.0, 0.0);
@@ -2628,11 +2631,11 @@ if (isRandomAccessRange!Range)
26282631
}
26292632
else
26302633
{
2631-
auto rng = UniformRNG(unpredictableSeed);
2634+
auto rng = UniformRNG(123_456_789);
26322635
auto rc = randomCover(a, rng);
26332636
static assert(isForwardRange!(typeof(rc)));
26342637
// check for constructor passed a value-type RNG
2635-
auto rc2 = RandomCover!(int[], UniformRNG)(a, UniformRNG(unpredictableSeed));
2638+
auto rc2 = RandomCover!(int[], UniformRNG)(a, UniformRNG(987_654_321));
26362639
static assert(isForwardRange!(typeof(rc2)));
26372640
auto rcEmpty = randomCover(c, rng);
26382641
assert(rcEmpty.length == 0);
@@ -3199,7 +3202,7 @@ if (isInputRange!Range && hasLength!Range && isUniformRNG!UniformRNG)
31993202
{
32003203
auto sample =
32013204
RandomSample!(TestInputRange, UniformRNG)
3202-
(TestInputRange(), 5, 10, UniformRNG(unpredictableSeed));
3205+
(TestInputRange(), 5, 10, UniformRNG(987_654_321));
32033206
static assert(isInputRange!(typeof(sample)));
32043207
static assert(!isForwardRange!(typeof(sample)));
32053208
}
@@ -3215,7 +3218,7 @@ if (isInputRange!Range && hasLength!Range && isUniformRNG!UniformRNG)
32153218
{
32163219
auto sample =
32173220
RandomSample!(typeof(TestInputRange().takeExactly(10)), UniformRNG)
3218-
(TestInputRange().takeExactly(10), 5, 10, UniformRNG(unpredictableSeed));
3221+
(TestInputRange().takeExactly(10), 5, 10, UniformRNG(654_321_987));
32193222
static assert(isInputRange!(typeof(sample)));
32203223
static assert(!isForwardRange!(typeof(sample)));
32213224
}
@@ -3229,7 +3232,7 @@ if (isInputRange!Range && hasLength!Range && isUniformRNG!UniformRNG)
32293232
{
32303233
auto sample =
32313234
RandomSample!(int[], UniformRNG)
3232-
(a, 5, UniformRNG(unpredictableSeed));
3235+
(a, 5, UniformRNG(321_987_654));
32333236
static assert(isForwardRange!(typeof(sample)));
32343237
}
32353238
}
@@ -3241,7 +3244,7 @@ if (isInputRange!Range && hasLength!Range && isUniformRNG!UniformRNG)
32413244
{
32423245
auto sample =
32433246
RandomSample!(int[], UniformRNG)
3244-
(a, 5, UniformRNG(unpredictableSeed));
3247+
(a, 5, UniformRNG(789_123_456));
32453248
static assert(isInputRange!(typeof(sample)));
32463249
static assert(!isForwardRange!(typeof(sample)));
32473250
}

0 commit comments

Comments
 (0)