forks
/
dfmt
mirror of https://github.com/dlang-community/dfmt.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

adapt test cases where current behavior is ok (though not perfect)

This commit is contained in:
Andreas Zwinkau 2015-01-16 20:58:48 +01:00
parent 0f337b0a15
commit 34f01d22c4
2 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
tests/guessnumber.d.ref
View File

@ -3,8 +3,7 @@ import std.stdio, std.random, std.typecons, std.conv, std.string, std.range;
void main() void main()
{ {
immutable interval = tuple(1, 100); immutable interval = tuple(1, 100);
writefln("Guess my target number that is between " writefln("Guess my target number that is between " ~ "%d and %d (inclusive).\n",
~ "%d and %d (inclusive).\n",
interval[]); interval[]);
immutable target = uniform!"[]"(interval[]); immutable target = uniform!"[]"(interval[]);
foreach (immutable i; sequence!q{n}) foreach (immutable i; sequence!q{n})

6
tests/heronian.d.ref
View File

@ -39,9 +39,9 @@ void main() /*@safe*/
writefln("%3s %8d %3dx%dx%d", t[].hero, t[].only.sum, t[]); writefln("%3s %8d %3dx%dx%d", t[].hero, t[].only.sum, t[]);
} }
writefln("Primitive Heronian triangles with sides up to %d: %d", maxSide, writefln("Primitive Heronian triangles with sides up to %d: %d", maxSide, h.length);
h.length); "\nFirst ten when ordered by increasing area, then perimeter,then maximum sides:"
"\nFirst ten when ordered by increasing area, then perimeter,then maximum sides:".writeln; .writeln;
showTriangles(h.take(10)); showTriangles(h.take(10));
"\nAll with area 210 subject to the previous ordering:".writeln; "\nAll with area 210 subject to the previous ordering:".writeln;
showTriangles(h.filter!(t => t[].hero == 210)); showTriangles(h.filter!(t => t[].hero == 210));