blob: e949ef02d8a2db6a311efa72c0612a2a5e236a01 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
/*
* Quackle -- Crossword game artificial intelligence and analysis tool
* Copyright (C) 2005-2006 Jason Katz-Brown and John O'Laughlin.
*
* 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 Street, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#include <vector>
#include <map>
#include "dict.h"
#include "util.h"
using namespace std;
using namespace Dict;
WordList::SortType WordList::sortType = Playability;
WordList::WordList()
{
}
WordList::~WordList()
{
}
void WordList::setSortBy(SortType _sortType)
{
sortType = _sortType;
}
bool operator<(const Dict::Word &word1, const Dict::Word &word2)
{
switch (Dict::WordList::sortType)
{
case Dict::WordList::Alphabetical:
return word1.word < word2.word;
case Dict::WordList::Playability:
if (word1.playability != word2.playability)
return word1.playability > word2.playability;
if (word1.word.length() != word2.word.length())
return word1.word.length() < word2.word.length();
// fall through
case Dict::WordList::Probability:
return word1.probability > word2.probability;
case Dict::WordList::Length:
case Dict::WordList::LengthLongestFirst:
{
bool ret;
if (word1.word.length() != word2.word.length())
ret = word1.word.length() < word2.word.length();
else
ret = word1.word < word2.word;
if (Dict::WordList::sortType == Dict::WordList::LengthLongestFirst)
return !ret;
return ret;
}
}
return false;
}
ExtensionList Word::extensionsByLength(int length, const ExtensionList &list)
{
ExtensionList ret;
for (ExtensionList::const_iterator it = list.begin(); it != list.end(); ++it)
{
if ((*it).extensionLetterString.length() == length)
{
Extension extension(*it);
extension.word = QuackleIO::Util::letterStringToQString((*it).extensionLetterString);
ret.append(extension);
}
}
return ret;
}
ExtensionList Word::getFrontExtensionList() const
{
return getExtensionList(true);
}
ExtensionList Word::getBackExtensionList() const
{
return getExtensionList(false);
}
ExtensionList Word::getExtensionList(bool front) const
{
ExtensionList ret;
const vector<Quackle::ExtensionWithInfo> *list = front? &frontExtensions : &backExtensions;
for (vector<Quackle::ExtensionWithInfo>::const_iterator it = list->begin(); it != list->end(); ++it)
{
Extension extension(*it);
extension.word = QuackleIO::Util::letterStringToQString((*it).extensionLetterString);
ret.append(extension);
}
return ret;
}
Extension::Extension(const Quackle::ExtensionWithInfo extensionWithInfo)
{
playability = extensionWithInfo.playability;
probability = extensionWithInfo.probability;
british = extensionWithInfo.british;
}
|
