summaryrefslogtreecommitdiff
path: root/quackleio/dict.h
blob: 4935e4b2bc2ef1584358a69bce38b4443466ce35 (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
/*
 *  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
 */

#ifndef QUACKLEIO_DICT_H
#define QUACKLEIO_DICT_H

#include <vector>

#include <QStringList>

#include <alphabetparameters.h>
#include <generator.h>

namespace Dict
{

class Extension : public Quackle::ExtensionWithInfo
{
public:
	Extension() {}
	Extension(const Quackle::ExtensionWithInfo extensionWithInfo);
	QString word;
};

typedef QList<Extension> ExtensionList;

class Word : public Quackle::WordWithInfo
{
public:
	QString word;

	static ExtensionList extensionsByLength(int length, const ExtensionList &list);

	ExtensionList getFrontExtensionList() const;
	ExtensionList getBackExtensionList() const;

private:
	ExtensionList getExtensionList(bool front) const;
};

class WordList : public QList<Word>
{
public:
	WordList();
	~WordList();

	enum SortType { Alphabetical, Playability, Length, LengthLongestFirst, Probability };

	void setSortBy(SortType sortType);
	static SortType sortType;
};

typedef QList<WordList> WordListList;

class Querier
{
public:
	virtual ~Querier() {};

	enum QueryFlags { None = 0x0000, WithExtensions = 0x0001, NoRequireAllLetters = 0x0002, CallUpdate = 0x0004 };

	virtual WordList query(const QString &query, int flags = None) = 0;
	virtual QString alphagram(const QString &letters) const = 0;
	virtual bool isBritish(const Quackle::LetterString &word) = 0;
	virtual bool isLoaded() const = 0;
};

}

// Returns true if word1 is less playable than word2;
// otherwise returns false.
bool operator<(const Dict::Word &word1, const Dict::Word &word2);

#endif