blob: 7f666cb2f6268747803b6412cf97474aa8f9b477 (
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
/*
* Quackle -- Crossword game artificial intelligence and analysis tool
* Copyright (C) 2005-2014 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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include <iostream>
#include <QtCore>
#include <QCryptographicHash>
#include "gaddagfactory.h"
#include "util.h"
GaddagFactory::GaddagFactory(const QString& alphabetFile)
{
QuackleIO::FlexibleAlphabetParameters *flexure = new QuackleIO::FlexibleAlphabetParameters;
flexure->load(alphabetFile);
m_alphas = flexure;
// So the separator is sorted to last.
m_root.t = false;
m_root.c = QUACKLE_NULL_MARK; // "_"
m_root.pointer = 0;
m_root.lastchild = true;
m_hash.int32ptr[0] = m_hash.int32ptr[1] = m_hash.int32ptr[2] = m_hash.int32ptr[3] = 0;
}
GaddagFactory::~GaddagFactory()
{
delete m_alphas;
}
bool GaddagFactory::pushWord(const QString& word)
{
UVString originalString = QuackleIO::Util::qstringToString(word);
UVString leftover;
Quackle::LetterString encodedWord = m_alphas->encode(originalString, &leftover);
if (leftover.empty())
{
++m_encodableWords;
hashWord(encodedWord);
// FIXME: This hash will fail if duplicate words are passed in.
// But testing for duplicate words isn't so easy without keeping
// an entirely separate list.
for (unsigned i = 1; i <= encodedWord.length(); i++)
{
Quackle::LetterString newword;
for (int j = i - 1; j >= 0; j--)
newword.push_back(encodedWord[j]);
if (i < encodedWord.length())
{
newword.push_back(internalSeparatorRepresentation); // "^"
for (unsigned j = i; j < encodedWord.length(); j++)
newword.push_back(encodedWord[j]);
}
m_gaddagizedWords.push_back(newword);
}
return true;
}
++m_unencodableWords;
return false;
}
void GaddagFactory::hashWord(const Quackle::LetterString &word)
{
QCryptographicHash wordhash(QCryptographicHash::Md5);
wordhash.addData(word.constData(), word.length());
QByteArray wordhashbytes = wordhash.result();
m_hash.int32ptr[0] ^= ((const int32_t*)wordhashbytes.constData())[0];
m_hash.int32ptr[1] ^= ((const int32_t*)wordhashbytes.constData())[1];
m_hash.int32ptr[2] ^= ((const int32_t*)wordhashbytes.constData())[2];
m_hash.int32ptr[3] ^= ((const int32_t*)wordhashbytes.constData())[3];
}
void GaddagFactory::generate()
{
Quackle::WordList::const_iterator wordsEnd = m_gaddagizedWords.end();
for (Quackle::WordList::const_iterator wordsIt = m_gaddagizedWords.begin(); wordsIt != wordsEnd; ++wordsIt)
m_root.pushWord(*wordsIt);
// for (const auto& words : gaddaggizedWords)
// m_root.pushWord(words);
}
void GaddagFactory::writeIndex(const QString &fname)
{
m_nodelist.push_back(&m_root);
m_root.print(m_nodelist);
ofstream out(QuackleIO::Util::qstringToStdString(fname).c_str(), ios::out | ios::binary);
out.put(1); // GADDAG format version 1
out.write(m_hash.charptr, sizeof(m_hash.charptr));
for (size_t i = 0; i < m_nodelist.size(); i++)
{
unsigned int p = (unsigned int)(m_nodelist[i]->pointer);
if (p != 0)
p -= i; // offset indexing
char bytes[4];
unsigned char n1 = (p & 0x00FF0000) >> 16;
unsigned char n2 = (p & 0x0000FF00) >> 8;
unsigned char n3 = (p & 0x000000FF) >> 0;
unsigned char n4;
n4 = m_nodelist[i]->c;
if (n4 == internalSeparatorRepresentation)
n4 = QUACKLE_NULL_MARK;
if (m_nodelist[i]->t)
n4 |= 64;
if (m_nodelist[i]->lastchild)
n4 |= 128;
bytes[0] = n1; bytes[1] = n2; bytes[2] = n3; bytes[3] = n4;
out.write(bytes, 4);
}
}
void GaddagFactory::Node::print(vector< Node* >& nodelist)
{
if (children.size() > 0)
{
pointer = nodelist.size();
children[children.size() - 1].lastchild = true;
}
for (size_t i = 0; i < children.size(); i++)
nodelist.push_back(&children[i]);
for (size_t i = 0; i < children.size(); i++)
children[i].print(nodelist);
}
void GaddagFactory::Node::pushWord(const Quackle::LetterString& word)
{
if (word.length() == 0)
{
t = true;
return;
}
Quackle::Letter first = Quackle::String::front(word);
Quackle::LetterString rest = Quackle::String::allButFront(word);
int index = -1;
for (size_t i = 0; i < children.size(); i++)
{
if (children[i].c == first)
{
index = i;
i = children.size();
}
}
if (index == -1)
{
Node n;
n.c = first;
n.t = false;
n.pointer = 0;
n.lastchild = false;
children.push_back(n);
index = children.size() - 1;
}
children[index].pushWord(rest);
}
|
