-
Notifications
You must be signed in to change notification settings - Fork 0
/
wordlist.cpp
157 lines (143 loc) · 4.56 KB
/
wordlist.cpp
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
/****************************************************************************
**
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the demonstration applications of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "wordlist.h"
#include <QtCore/QFile>
#include <cstring>
#include <QDebug>
const int LEN_MAX=30;//Rounded to a round number for safety (sentinel and null terminator have room)
bool wordCheck(char word[LEN_MAX]);
WordList::WordList(QObject *parent, QString locale) :
QObject(parent)
{
//init(locale);
}
WordList* WordList::m_instance = 0;
WordList* WordList::instance(QString locale)
{
if(m_instance)
return m_instance;
else
m_instance = new WordList(0, locale);
return m_instance;
}
bool WordList::isPartialWord(const QString &c)
{
return isPartialWord(c.toAscii().toLower().data());
}
bool WordList::isWord(const QString &string)
{
return m_words.contains(string.toLower());
}
QStringList WordList::wordsIn(const QString &str)
{
QStringList ret;
wordsInHelper(QLatin1String(""), str, ret);
return ret;
}
//Using a C style global array since I'm using C style strings anyways
const int WORD_MAX=340000;
char dict[WORD_MAX][LEN_MAX];
int idx[26*26];
int numWords;
void WordList::init(const QString locale){
//Create 'Binary Tree'
//QFile in(":/words.dict");//Assumed to be in alphabetical order already
QFile in;
if (locale=="fr") {
in.setFileName(":/liste_fr.txt");
} else {
in.setFileName(":/wordlist2.txt");
}
bool opened = in.open(QFile::Text | QFile::ReadOnly);
Q_ASSERT(opened);
int c=0;
char cur[LEN_MAX];
char curIdx[2];//Assumed all words have at least 2 letters
curIdx[0] = ' ';
curIdx[1] = ' ';
m_words.clear();
while(in.readLine(cur,LEN_MAX) > 0){
//qDebug() << QString(cur).toLower().trimmed();
if(cur[0]=='\n' || cur[0]=='\0')
continue;
m_words << QString(cur).toLower().trimmed();
sprintf(dict[c],"%s", cur);
if(curIdx[0] < cur[0]){//Assumed each of the 26 letters starts at least one word
curIdx[0] = cur[0];
curIdx[1] = 'a';
idx[(curIdx[0]-'a') * 26] = c;
}
while(curIdx[1] < cur[1]){
curIdx[1]++;
Q_ASSERT(curIdx[1] >= 'a' && curIdx[1] <= 'z');
idx[(curIdx[0]-'a') * 26 + (curIdx[1] - 'a')] = c;
}
c++;
}
numWords = c;
Q_ASSERT(m_words.count() == c);//Assumed no duplicates
in.close();
}
bool WordList::isPartialWord(char *c)
{
int l = strlen(c);
if(l < 2)
return true;
int i = idx[(c[0]-'a') * 26 + (c[1]-'a')];
for(i; i<numWords && strncmp(dict[i],c,l) < 0; i++){};
return (strncmp(dict[i],c,l) == 0);
}
void WordList::wordsInHelper(const QString &given, const QString &left, QStringList &ret)
{
for(int i=0; i<left.length(); i++){
QString part = given + left[i];
if(isPartialWord(part)){
if(isWord(part)){
if(ret.contains(part))
return;//We've hit a duplicate letter arrangement
ret << part;
}
QString nowLeft(left);
nowLeft.remove(i,1);
wordsInHelper(part, nowLeft, ret);
}
}
}