blob: 301708519b384e06aa41de5d77eda06a0c15d649 (
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
|
/*
* 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/>.
*/
#ifndef QUACKLE_GADDAGFACTORY_H
#define QUACKLE_GADDAGFACTORY_H
#include <cstdint>
#include "flexiblealphabet.h"
class GaddagFactory {
public:
static const Quackle::Letter internalSeparatorRepresentation = QUACKLE_FIRST_LETTER + QUACKLE_MAXIMUM_ALPHABET_SIZE;
GaddagFactory(const UVString &alphabetFile);
~GaddagFactory();
int wordCount() const { return m_gaddagizedWords.size(); };
int nodeCount() const { return m_nodelist.size(); };
int encodableWords() const { return m_encodableWords; };
int unencodableWords() const { return m_unencodableWords; };
bool pushWord(const UVString &word);
bool pushWord(const Quackle::LetterString &word);
void hashWord(const Quackle::LetterString &word);
void sortWords() { sort(m_gaddagizedWords.begin(), m_gaddagizedWords.end()); };
void generate();
void writeIndex(const string &fname);
const char* hashBytes() { return m_hash.charptr; };
private:
class Node {
public:
Quackle::Letter c;
bool t;
vector<Node> children;
int pointer;
bool lastchild;
void pushWord(const Quackle::LetterString& word);
void print(vector< Node* >& m_nodelist);
};
int m_encodableWords;
int m_unencodableWords;
Quackle::WordList m_gaddagizedWords;
vector< Node* > m_nodelist;
Quackle::AlphabetParameters *m_alphas;
Node m_root;
union {
char charptr[16];
std::int32_t int32ptr[4];
} m_hash;
};
#endif
|
