source: trunk/Tests.pas

unit Tests;

interface

uses
  Classes, SysUtils, TestCase, Game;

type

  { TTestCaseGame }

  TTestCaseGame = class(TTestCase)
    Game: TGame;
    procedure Run; override;
    constructor Create; override;
    destructor Destroy; override;
  end;

  { TTestCaseMap }

  TTestCaseMap = class(TTestCase)
    Game: TGame;
    procedure Run; override;
    constructor Create; override;
    destructor Destroy; override;
  end;

function GetTestCases: TTestCases;


implementation

uses
  Geometry, MapType, Map;

function GetTestCases: TTestCases;
begin
  Result := TTestCases.Create;
  with Result do begin
    with TTestCaseGame(AddNew('Load and save', TTestCaseGame)) do begin
    end;
    with TTestCaseMap(AddNew('Map cells connection', TTestCaseMap)) do begin
    end;
  end;
end;

{ TTestCaseGame }

procedure TTestCaseGame.Run;
const
  FileName = 'Test.xtg';
  Size = 10;
var
  Game2: TGame;
begin
  Game.Map.Size := TPoint.Create(Size, Size);
  Game.MapType := mtSquare;
  Game.New;
  Game.SaveToFile(FileName);
  Game2 := TGame.Create;
  Game2.LoadFromFile(FileName);
  Evaluate(Game2.Compare(Game));
  Log := 'Game1: ' + LineEnding + Game.ToString + LineEnding +
    'Game2: ' + LineEnding + Game2.ToString + LineEnding;
  Game2.Free;
end;

constructor TTestCaseGame.Create;
begin
  inherited;
  Game := TGame.Create;
end;

destructor TTestCaseGame.Destroy;
begin
  FreeAndNil(Game);
  inherited;
end;

{ TTestCaseMap }

procedure TTestCaseMap.Run;
var
  X, Y: Integer;
  Connected: Boolean;
  Cell: TCell;
  Expected: Integer;
const
  Size = 10;
begin
  Connected := True;
  Game.Map.Size := TPoint.Create(Size, Size);
  Game.MapType := mtSquare;
  Game.New;
  for Y := 0 to Size - 1 do
  for X := 0 to Size - 1 do begin
    Cell := Game.Map.Cells[X + Y * Size];
    Expected := 4;
    if (X = 0) or (X = Size - 1) then Dec(Expected);
    if (Y = 0) or (Y = Size - 1) then Dec(Expected);
    if Cell.Neighbors.Count <> Expected then begin
      Log := Log + 'Cell ' + IntToStr(X + Y * Size) + ' expected neighbors count ' +
        IntToStr(Expected) + ' but is ' + IntToStr(Cell.Neighbors.Count) + LineEnding;
      if not Connected then Break;
    end;
  end;
  Evaluate(Connected);
end;

constructor TTestCaseMap.Create;
begin
  inherited;
  Game := TGame.Create;
end;

destructor TTestCaseMap.Destroy;
begin
  FreeAndNil(Game);
  inherited;
end;

end.