2005-08-16 00:20:20 +02:00
|
|
|
/* Eliot */
|
|
|
|
/* Copyright (C) 1999 Antoine Fraboulet */
|
|
|
|
/* */
|
|
|
|
/* This file is part of Eliot. */
|
|
|
|
/* */
|
|
|
|
/* Eliot is free software; you can redistribute it and/or modify */
|
|
|
|
/* it under the terms of the GNU General Public License as published by */
|
|
|
|
/* the Free Software Foundation; either version 2 of the License, or */
|
|
|
|
/* (at your option) any later version. */
|
|
|
|
/* */
|
|
|
|
/* Eliot is distributed in the hope that it will be useful, */
|
|
|
|
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
|
|
|
|
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the */
|
|
|
|
/* GNU General Public License for more details. */
|
|
|
|
/* */
|
|
|
|
/* You should have received a copy of the GNU General Public License */
|
|
|
|
/* along with this program; if not, write to the Free Software */
|
2005-10-23 16:53:42 +02:00
|
|
|
/* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
|
2005-08-16 00:20:20 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* \file history.cpp
|
|
|
|
* \brief Game history system
|
|
|
|
* \author Antoine Fraboulet
|
|
|
|
* \date 2005
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <string>
|
|
|
|
#include "rack.h"
|
2005-12-26 20:19:42 +01:00
|
|
|
#include "pldrack.h"
|
|
|
|
#include "round.h"
|
2005-12-26 16:33:15 +01:00
|
|
|
#include "turn.h"
|
2005-08-16 00:20:20 +02:00
|
|
|
#include "debug.h"
|
2005-12-26 20:19:42 +01:00
|
|
|
#include "history.h"
|
2005-08-16 00:20:20 +02:00
|
|
|
|
|
|
|
/* ******************************************************** */
|
|
|
|
/* ******************************************************** */
|
|
|
|
/* ******************************************************** */
|
|
|
|
|
|
|
|
|
|
|
|
History::History()
|
|
|
|
{
|
2006-01-01 20:49:35 +01:00
|
|
|
Turn* t = new Turn ();
|
2005-12-26 20:19:42 +01:00
|
|
|
m_history.clear();
|
2005-12-26 16:33:15 +01:00
|
|
|
m_history.push_back(t);
|
2005-08-16 00:20:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
History::~History()
|
|
|
|
{
|
2005-12-26 16:33:15 +01:00
|
|
|
for (unsigned int i = 0; i < m_history.size(); i++)
|
|
|
|
{
|
|
|
|
if (m_history[i] != NULL)
|
|
|
|
{
|
|
|
|
delete m_history[i];
|
|
|
|
m_history[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
2005-08-16 00:20:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int History::getSize() const
|
|
|
|
{
|
2005-12-27 01:06:23 +01:00
|
|
|
return m_history.size() - 1;
|
2005-08-16 00:20:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-12-26 16:33:15 +01:00
|
|
|
const PlayedRack& History::getCurrentRack() const
|
2005-08-16 00:20:20 +02:00
|
|
|
{
|
2005-12-26 16:33:15 +01:00
|
|
|
return m_history.back()->getPlayedRack();
|
2005-08-16 00:20:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void History::setCurrentRack(const PlayedRack &iPld)
|
|
|
|
{
|
2005-12-26 16:33:15 +01:00
|
|
|
m_history.back()->setPlayedRack(iPld);
|
2005-08-16 00:20:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-12-26 16:33:15 +01:00
|
|
|
const Turn& History::getPreviousTurn() const
|
2005-08-16 00:20:20 +02:00
|
|
|
{
|
2005-12-26 16:33:15 +01:00
|
|
|
int idx = m_history.size() - 2;
|
2005-12-27 01:06:23 +01:00
|
|
|
ASSERT(0 <= idx , "No previous turn");
|
2005-12-26 16:33:15 +01:00
|
|
|
return *(m_history[idx]);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const Turn& History::getTurn(unsigned int n) const
|
|
|
|
{
|
|
|
|
ASSERT(0 <= n && n < m_history.size(), "Wrong turn number");
|
|
|
|
return *(m_history[n]);
|
2005-08-16 00:20:20 +02:00
|
|
|
}
|
|
|
|
|
2005-12-26 23:57:44 +01:00
|
|
|
/*
|
|
|
|
* This function increments the number of racks, and fills the new rack
|
|
|
|
* with the unplayed tiles from the previous one.
|
|
|
|
* 03 sept 2000 : We have to sort the tiles according to the new rules
|
|
|
|
*/
|
2005-08-16 00:20:20 +02:00
|
|
|
void History::playRound(int player, int turn, const Round& round)
|
|
|
|
{
|
|
|
|
Rack rack;
|
|
|
|
Turn * current_turn;
|
2005-11-04 21:00:05 +01:00
|
|
|
|
2005-12-26 16:33:15 +01:00
|
|
|
current_turn = m_history.back();
|
2005-08-16 00:20:20 +02:00
|
|
|
|
|
|
|
/* set the number and the round */
|
|
|
|
current_turn->setNum(turn);
|
|
|
|
current_turn->setPlayer(player);
|
|
|
|
current_turn->setRound(round);
|
|
|
|
|
|
|
|
/* get what was the rack for the current turn */
|
|
|
|
current_turn->getPlayedRack().getRack(rack);
|
|
|
|
|
|
|
|
/* remove the played tiles from the rack */
|
|
|
|
for (int i = 0; i < round.getWordLen(); i++)
|
|
|
|
{
|
|
|
|
if (round.isPlayedFromRack(i))
|
|
|
|
{
|
|
|
|
if (round.isJoker(i))
|
|
|
|
rack.remove(Tile::Joker());
|
|
|
|
else
|
|
|
|
rack.remove(round.getTile(i));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* create a new turn */
|
2005-12-26 16:33:15 +01:00
|
|
|
Turn * next_turn = new Turn();
|
|
|
|
PlayedRack pldrack;
|
|
|
|
pldrack.setOld(rack);
|
|
|
|
next_turn->setPlayedRack(pldrack);
|
|
|
|
m_history.push_back(next_turn);
|
2005-08-16 00:20:20 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void History::removeLastTurn()
|
|
|
|
{
|
2005-12-26 16:33:15 +01:00
|
|
|
int idx = m_history.size();
|
2005-08-16 00:20:20 +02:00
|
|
|
ASSERT(0 < idx , "Wrong turn number");
|
2005-11-04 21:00:05 +01:00
|
|
|
|
2005-08-16 00:20:20 +02:00
|
|
|
if (idx > 1)
|
2005-12-26 16:33:15 +01:00
|
|
|
{
|
|
|
|
Turn *t = m_history.back();
|
|
|
|
m_history.pop_back();
|
|
|
|
delete t;
|
|
|
|
}
|
2005-08-16 00:20:20 +02:00
|
|
|
|
2006-01-01 20:49:35 +01:00
|
|
|
// now we have the previous played round in back()
|
2005-12-26 16:33:15 +01:00
|
|
|
Turn* t = m_history.back();
|
2005-08-16 00:20:20 +02:00
|
|
|
t->setNum(0);
|
|
|
|
t->setPlayer(0);
|
|
|
|
t->setRound(Round());
|
|
|
|
#ifdef BACK_REMOVE_RACK_NEW_PART
|
|
|
|
t->getPlayedRound().setNew(Rack());
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-12-27 17:54:38 +01:00
|
|
|
string History::toString() const
|
2005-08-16 00:20:20 +02:00
|
|
|
{
|
|
|
|
unsigned int i;
|
2005-12-27 17:54:38 +01:00
|
|
|
string rs = "";
|
2005-12-26 16:33:15 +01:00
|
|
|
#ifdef DEBUG
|
|
|
|
char buff[20];
|
2006-01-01 20:49:35 +01:00
|
|
|
sprintf(buff,"%d",m_history.size());
|
2005-12-27 17:54:38 +01:00
|
|
|
rs = "history size = " + string(buff) + "\n\n";
|
2005-12-26 16:33:15 +01:00
|
|
|
#endif
|
|
|
|
for (i = 0; i < m_history.size(); i++)
|
|
|
|
{
|
|
|
|
Turn *t = m_history[i];
|
2006-01-01 20:49:35 +01:00
|
|
|
rs += t->toString() + string("\n");
|
2005-12-26 16:33:15 +01:00
|
|
|
}
|
2005-08-16 00:20:20 +02:00
|
|
|
return rs;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ******************************************************** */
|
|
|
|
/* ******************************************************** */
|
|
|
|
/* ******************************************************** */
|
|
|
|
|
2005-12-26 16:33:15 +01:00
|
|
|
|
2005-08-16 00:20:20 +02:00
|
|
|
/// Local Variables:
|
2006-01-01 20:49:35 +01:00
|
|
|
/// mode: c++
|
2005-08-16 00:20:20 +02:00
|
|
|
/// mode: hs-minor
|
|
|
|
/// c-basic-offset: 4
|
2006-01-01 20:49:35 +01:00
|
|
|
/// indent-tabs-mode: nil
|
2005-08-16 00:20:20 +02:00
|
|
|
/// End:
|