aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Just another update

Browse source
This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
Download patch file Download diff file Expand all files Collapse all files

16
Task/Tic-tac-toe/D/tic-tac-toe.d
View file

@ -6,7 +6,7 @@ struct GameBoard {
enum : dchar { human = 'X', computer = 'O' }
enum Game { going, humanWins, computerWins, draw }
const pure nothrow invariant() {
const pure nothrow @safe @nogc invariant() {
int nHuman = 0, nComputer = 0;
foreach (immutable i, immutable c; board)
if (c.isDigit)
@ -22,15 +22,15 @@ struct GameBoard {
return format("%(%-(%s|%)\n-+-+-\n%)", board[].chunks(3));
}
bool isAvailable(in int i) const pure nothrow {
bool isAvailable(in int i) const pure nothrow @safe @nogc {
return i >= 0 && i < 9 && board[i].isDigit;
}
int[] availablePositions() const pure nothrow {
return 9.iota.filter!(i => isAvailable(i)).array;
auto availablePositions() const pure nothrow @safe /*@nogc*/ {
return 9.iota.filter!(i => isAvailable(i));
}
Game winner() const pure nothrow {
Game winner() const pure nothrow @safe /*@nogc*/ {
static immutable wins = [[0, 1, 2], [3, 4, 5], [6, 7, 8],
[0, 3, 6], [1, 4, 7], [2, 5, 8],
[0, 4, 8], [2, 4, 6]];
@ -49,7 +49,7 @@ struct GameBoard {
return availablePositions.empty ? Game.draw: Game.going;
}
bool isFinished() const pure nothrow {
bool isFinished() const pure nothrow @safe /*@nogc*/ {
return winner != Game.going;
}
@ -57,8 +57,8 @@ struct GameBoard {
out(res) {
assert(res >= 0 && res < 9 && isAvailable(res));
} body {
// return availablePositions.choice;
return availablePositions[uniform(0, $)];
// return availablePositions.array.choice;
return availablePositions.array[uniform(0, $)];
}
}