eliot/game/history.h

109 lines
3.1 KiB
C
Raw Permalink Normal View History

/*****************************************************************************
* Eliot
* Copyright (C) 2005-2012 Antoine Fraboulet & Olivier Teulière
* Authors: Antoine Fraboulet <antoine.fraboulet @@ free.fr>
* Olivier Teulière <ipkiss @@ gmail.com>
*
* This program 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.
*
* This program 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
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
#ifndef HISTORY_H_
#define HISTORY_H_
#include <string>
#include <vector>
2012-02-18 22:26:52 +01:00
#include "logging.h"
using std::wstring;
using std::vector;
class Move;
2012-10-06 01:57:39 +02:00
class TurnData;
class PlayedRack;
2005-12-26 20:19:42 +01:00
/**
* History stores all the turns that have been played
* This class is used many times in the game
* - one for the complete game
* - one for each player
*
2012-10-06 01:57:39 +02:00
* The top of the history is an empty TurnData until it has been filled
* and the game is up to a new turn. So a History object is never empty.
* However, the getSize() method only returns the number of complete
* turns, and can therefore return 0.
*
* getCurrentRack() can/should be used to store the current played rack.
2005-12-26 20:19:42 +01:00
* setCurrentRack must be called whenever the current played rack is
* modified.
*
* History owns the turns that it stores. Do not delete a turn referenced
* by History
2005-12-26 20:19:42 +01:00
*/
class History
{
2012-02-18 22:26:52 +01:00
DEFINE_LOGGER();
public:
History();
~History();
2005-11-04 21:00:05 +01:00
/// Get the size of the history (without the current incomplete turn)
unsigned int getSize() const;
2005-11-04 21:00:05 +01:00
/// Get the (possibly incomplete) rack
2005-12-26 16:33:15 +01:00
const PlayedRack& getCurrentRack() const;
/// Set the current rack
void setCurrentRack(const PlayedRack &iPld);
/// Get the previous (complete) turn
2012-10-06 01:57:39 +02:00
const TurnData& getPreviousTurn() const;
/// Get turn 'n' (starting at 0)
2012-10-06 01:57:39 +02:00
const TurnData& getTurn(unsigned int) const;
/**
* Return true if the history doesn't contain at least one move
* corresponding to a valid round, false otherwise.
* Said differently, this method checks whether a word was already played
* on the board.
*/
bool beforeFirstRound() const;
/// Update the history with the given move and complete the turn.
2013-01-16 14:40:34 +01:00
void playMove(const Move &iMove, const PlayedRack &iNewRack);
/// Remove last turn
void removeLastTurn();
2005-11-04 21:00:05 +01:00
2012-03-23 07:41:16 +01:00
void addWarning();
void removeWarning();
void addPenaltyPoints(int iPoints);
void addSoloPoints(int iPoints);
void addEndGamePoints(int iPoints);
2005-12-26 16:33:15 +01:00
/// String handling
wstring toString() const;
2006-01-01 20:49:35 +01:00
private:
2012-10-06 01:57:39 +02:00
vector<TurnData*> m_history;
};
#endif