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
|
// Brain Party
// Copyright (C) 2010 Paul Hudson (http://www.tuxradar.com/brainparty)
// Brain Party 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, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
#ifndef __WORDLIST_H__
#define __WORDLIST_H__
#include <vector>
#include <ext/hash_set>
using namespace std;
using namespace __gnu_cxx;
namespace __gnu_cxx
{
template<> struct hash< std::string >
{
size_t operator()( const std::string& x ) const
{
return hash< const char* >()( x.c_str() );
}
};
}
typedef hash_set<string, hash<string> > string_hash_set;
class WordList {
private:
string_hash_set Words;
public:
WordList(const char* file) {
FILE *fp;
char filebuffer[255];
if ((fp = fopen(file, "r")) != NULL) {
while(!feof(fp)) {
fgets(filebuffer, 255, fp);
char* word = new char[255];
sscanf(filebuffer, "%s", word);
Words.insert(word);
delete[] word;
}
fclose(fp);
}
}
~WordList() {
Words.clear();
}
bool Contains(std::string string) {
string_hash_set::const_iterator it = Words.find(string);
if (it != Words.end()) {
return true;
} else {
return false;
}
}
};
#endif
|
