mirror of
git://git.savannah.nongnu.org/eliot.git
synced 2025-01-13 20:03:23 +01:00
204 lines
5 KiB
C++
204 lines
5 KiB
C++
/*****************************************************************************
|
|
* Copyright (C) 1999-2005 Eliot
|
|
* Authors: Olivier Teuliere <ipkiss@via.ecp.fr>
|
|
*
|
|
* $Id: tile.cpp,v 1.2 2005/04/09 14:56:03 afrab Exp $
|
|
*
|
|
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*****************************************************************************/
|
|
|
|
#include "tile.h"
|
|
#include <ctype.h>
|
|
|
|
/*************************
|
|
* French tiles
|
|
* Zero + 26 letters + joker
|
|
* tiles ares supposed to be contiguous and joker is separated
|
|
*************************/
|
|
|
|
#define TILE_START 'A'
|
|
#define TILE_END 'Z'
|
|
#define TILE_JOKER '?'
|
|
#define TILE_DUMMY '%'
|
|
|
|
#define TILE_IDX_START 1
|
|
#define TILE_IDX_END 26
|
|
#define TILE_IDX_JOKER 27
|
|
|
|
#define TILES_NUMBER 28
|
|
|
|
/* The jokers and the 'Y' can be considered both as vowels or consonants */
|
|
const unsigned int Tiles_vowels[TILES_NUMBER] =
|
|
{
|
|
/* x A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ? */
|
|
0,1,0,0,0, 1,0,0,0,1,0, 0,0,0,0,1,0,0,0,0,0,1,0, 0, 0, 1, 0,1
|
|
};
|
|
|
|
const unsigned int Tiles_consonants[TILES_NUMBER] =
|
|
{
|
|
/* x A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ? */
|
|
0,0,1,1,1, 0,1,1,1,0,1, 1,1,1,1,0,1,1,1,1,1,0,1, 1, 1, 1, 1,1
|
|
};
|
|
|
|
const unsigned int Tiles_numbers[TILES_NUMBER] =
|
|
{
|
|
/* x A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ? */
|
|
0,9,2,2,3,15,2,2,2,8,1, 1,5,3,6,6,2,1,6,6,6,6,2, 1, 1, 1, 1,2
|
|
};
|
|
|
|
const unsigned int Tiles_points[TILES_NUMBER] =
|
|
{
|
|
/* x A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ? */
|
|
0,1,3,3,2, 1,4,2,4,1,8,10,1,2,1,1,3,8,1,1,1,1,4,10,10,10,10,0
|
|
};
|
|
|
|
/***************************
|
|
***************************/
|
|
|
|
list<Tile> Tile::m_tilesList;
|
|
const Tile Tile::m_TheJoker(TILE_JOKER);
|
|
const Tile Tile::m_TheDummy(0);
|
|
|
|
|
|
Tile::Tile(char c)
|
|
{
|
|
if (c == TILE_JOKER)
|
|
{
|
|
m_joker = true;
|
|
m_dummy = false;
|
|
m_char = TILE_JOKER;
|
|
}
|
|
else if (isalpha(c))
|
|
{
|
|
m_joker = islower(c);
|
|
m_dummy = false;
|
|
m_char = toupper(c);
|
|
}
|
|
else
|
|
{
|
|
m_joker = false;
|
|
m_dummy = true;
|
|
m_char = 0;
|
|
}
|
|
}
|
|
|
|
|
|
bool Tile::isVowel() const
|
|
{
|
|
if (m_dummy)
|
|
return false;
|
|
if (m_joker)
|
|
return Tiles_vowels[TILE_IDX_JOKER];
|
|
return Tiles_vowels[TILE_IDX_START + m_char - TILE_START];
|
|
}
|
|
|
|
|
|
bool Tile::isConsonant() const
|
|
{
|
|
if (m_dummy)
|
|
return false;
|
|
if (m_joker)
|
|
return Tiles_consonants[TILE_IDX_JOKER];
|
|
return Tiles_consonants[TILE_IDX_START + m_char - TILE_START];
|
|
}
|
|
|
|
|
|
unsigned int Tile::maxNumber() const
|
|
{
|
|
if (m_dummy)
|
|
return false;
|
|
if (m_joker)
|
|
return Tiles_numbers[TILE_IDX_JOKER];
|
|
return Tiles_numbers[TILE_IDX_START + m_char - TILE_START];
|
|
}
|
|
|
|
|
|
unsigned int Tile::getPoints() const
|
|
{
|
|
if (m_dummy)
|
|
return false;
|
|
if (m_joker)
|
|
return Tiles_points[TILE_IDX_JOKER];
|
|
return Tiles_points[TILE_IDX_START + m_char - TILE_START];
|
|
}
|
|
|
|
|
|
const list<Tile>& Tile::getAllTiles()
|
|
{
|
|
if (Tile::m_tilesList.size() == 0)
|
|
{
|
|
// XXX: this should be filled from a "language file" instead
|
|
for (char i = TILE_START; i <= TILE_END; i++)
|
|
Tile::m_tilesList.push_back(Tile(i));
|
|
m_tilesList.push_back(Tile(TILE_JOKER));
|
|
}
|
|
return Tile::m_tilesList;
|
|
}
|
|
|
|
|
|
char Tile::toChar() const
|
|
{
|
|
if (m_dummy)
|
|
return TILE_DUMMY;
|
|
if (m_joker)
|
|
{
|
|
if (isalpha(m_char))
|
|
return tolower(m_char);
|
|
else
|
|
return TILE_JOKER;
|
|
}
|
|
return m_char;
|
|
}
|
|
|
|
|
|
bool Tile::operator <(const Tile &iOther) const
|
|
{
|
|
if (iOther.m_dummy)
|
|
return false;
|
|
else if (m_dummy)
|
|
return true;
|
|
else if (m_joker)
|
|
return false;
|
|
else if (iOther.m_joker)
|
|
return true;
|
|
else
|
|
return m_char < iOther.m_char;
|
|
}
|
|
|
|
|
|
bool Tile::operator ==(const Tile &iOther) const
|
|
{
|
|
if (m_dummy || iOther.m_dummy)
|
|
return m_dummy == iOther.m_dummy;
|
|
if (m_joker || iOther.m_joker)
|
|
{
|
|
if (m_joker != iOther.m_joker)
|
|
return false;
|
|
return m_char == iOther.m_char;
|
|
}
|
|
return m_char == iOther.m_char;
|
|
// return (m_joker && iOther.m_joker && m_char == iOther.m_char) ||
|
|
// (m_dummy && iOther.m_dummy) ||
|
|
// (!m_dummy && !iOther.m_dummy
|
|
// && !m_joker && !iOther.m_joker
|
|
// && m_char == iOther.m_char);
|
|
}
|
|
|
|
|
|
bool Tile::operator !=(const Tile &iOther) const
|
|
{
|
|
return !(*this == iOther);
|
|
}
|
|
|