mirror of
git://git.savannah.nongnu.org/eliot.git
synced 2024-12-28 09:58:15 +01:00
3c7a84d543
Status: It works well, but there are still a few details to improve/fix More details about the changes: - New dependency on Arabica and Libxml2 to parse the XML - Loading the old format is still supported for this release, but won't be supported anymore in the next one - Games are now only saved in the new format - In training mode, the player is now created externally, like in the other modes - Avoid using GameIO (the one from game/) whenever possible - Do not use a FILE* argument anymore when loading a game - Throw and catch exceptions correctly when a game cannot be loaded or saved - The non-regression tests now use a new method to print the game history
180 lines
4 KiB
C++
180 lines
4 KiB
C++
/*****************************************************************************
|
|
* Eliot
|
|
* Copyright (C) 1999-2007 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
|
|
*****************************************************************************/
|
|
|
|
#include <boost/foreach.hpp>
|
|
|
|
#include <string>
|
|
#include <cstdio>
|
|
#include <cstdlib> // For rand()
|
|
|
|
#include <dic.h>
|
|
#include "bag.h"
|
|
#include "debug.h"
|
|
#include "encoding.h"
|
|
|
|
|
|
Bag::Bag(const Dictionary &iDic)
|
|
: m_dic(iDic), m_ntiles(0)
|
|
{
|
|
BOOST_FOREACH(const Tile &tile, m_dic.getAllTiles())
|
|
{
|
|
m_tilesMap[tile] = tile.maxNumber();
|
|
m_ntiles += tile.maxNumber();
|
|
}
|
|
}
|
|
|
|
|
|
unsigned int Bag::in(const Tile &iTile) const
|
|
{
|
|
map<Tile, int>::const_iterator it = m_tilesMap.find(iTile);
|
|
if (it != m_tilesMap.end())
|
|
return (*it).second;
|
|
return 0;
|
|
}
|
|
|
|
|
|
unsigned int Bag::getNbVowels() const
|
|
{
|
|
int v = 0;
|
|
|
|
std::pair<Tile, int> p;
|
|
BOOST_FOREACH(p, m_tilesMap)
|
|
{
|
|
if (p.first.isVowel())
|
|
v += p.second;
|
|
}
|
|
return v;
|
|
}
|
|
|
|
|
|
unsigned int Bag::getNbConsonants() const
|
|
{
|
|
int c = 0;
|
|
|
|
std::pair<Tile, int> p;
|
|
BOOST_FOREACH(p, m_tilesMap)
|
|
{
|
|
if (p.first.isConsonant())
|
|
c += p.second;
|
|
}
|
|
return c;
|
|
}
|
|
|
|
|
|
void Bag::takeTile(const Tile &iTile)
|
|
{
|
|
ASSERT(in(iTile),
|
|
"The bag does not contain the letter " + convertToMb(iTile.getDisplayStr()));
|
|
|
|
m_tilesMap[iTile]--;
|
|
m_ntiles--;
|
|
}
|
|
|
|
|
|
void Bag::replaceTile(const Tile &iTile)
|
|
{
|
|
ASSERT(in(iTile) < iTile.maxNumber(),
|
|
"Cannot replace tile: " + convertToMb(iTile.getDisplayStr()));
|
|
|
|
m_tilesMap[iTile]++;
|
|
m_ntiles++;
|
|
}
|
|
|
|
|
|
Tile Bag::selectRandom() const
|
|
{
|
|
double max = m_ntiles;
|
|
ASSERT(max > 0, "The bag is empty");
|
|
|
|
int n = (int)(max * rand() / (RAND_MAX + 1.0));
|
|
|
|
std::pair<Tile, int> p;
|
|
BOOST_FOREACH(p, m_tilesMap)
|
|
{
|
|
if (n < p.second)
|
|
return p.first;
|
|
n -= p.second;
|
|
}
|
|
ASSERT(false, "We should not come here");
|
|
return Tile();
|
|
}
|
|
|
|
|
|
Tile Bag::selectRandomVowel() const
|
|
{
|
|
double max = getNbVowels();
|
|
ASSERT(max > 0, "Not enough vowels in the bag");
|
|
|
|
int n = (int)(max * rand() / (RAND_MAX + 1.0));
|
|
|
|
std::pair<Tile, int> p;
|
|
BOOST_FOREACH(p, m_tilesMap)
|
|
{
|
|
if (!p.first.isVowel())
|
|
continue;
|
|
if (n < p.second)
|
|
return p.first;
|
|
n -= p.second;
|
|
}
|
|
ASSERT(false, "We should not come here");
|
|
return Tile();
|
|
}
|
|
|
|
|
|
Tile Bag::selectRandomConsonant() const
|
|
{
|
|
double max = getNbConsonants();
|
|
ASSERT(max > 0, "Not enough consonants in the bag");
|
|
|
|
int n = (int)(max * rand() / (RAND_MAX + 1.0));
|
|
|
|
std::pair<Tile, int> p;
|
|
BOOST_FOREACH(p, m_tilesMap)
|
|
{
|
|
if (!p.first.isConsonant())
|
|
continue;
|
|
if (n < p.second)
|
|
return p.first;
|
|
n -= p.second;
|
|
}
|
|
ASSERT(false, "We should not come here");
|
|
return Tile();
|
|
}
|
|
|
|
|
|
void Bag::operator=(const Bag &iOther)
|
|
{
|
|
m_tilesMap = iOther.m_tilesMap;
|
|
m_ntiles = iOther.m_ntiles;
|
|
}
|
|
|
|
|
|
void Bag::dumpAll() const
|
|
{
|
|
std::pair<Tile, int> p;
|
|
BOOST_FOREACH(p, m_tilesMap)
|
|
{
|
|
if (p.second)
|
|
fprintf(stderr, "%lc[%i] ", p.first.toChar(), p.second);
|
|
}
|
|
fprintf(stderr, "\n");
|
|
}
|
|
|