-
Notifications
You must be signed in to change notification settings - Fork 0
/
singleton_diction.cpp
82 lines (68 loc) · 1.84 KB
/
singleton_diction.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
#include <fstream>
#include "common_classes.h"
#include "singleton_diction.h"
using namespace std;
// Hungry Singleton
SingletonDiction & SingletonDiction::GetInstance()
{
static SingletonDiction s_instance;
return s_instance;
}
// Read dictionary from disk to memory
void SingletonDiction::Init()
{
TextFileOperation::ReadText("dict/wordlist.txt", uset_dictionary_);
}
// Build word piece with minimal character size 2, this will be used as the base for lookup.
// Example, word "nice" will be expanded by this function to word piece like ni,nic,nice, ic, ice, ce.
void SingletonDiction::BuildWordPiece()
{
unordered_set<string> uset_dictionary_temp;
if (uset_dictionary_.empty())
throw runtime_error("uset_dictionary_ is empty, function BuildWordPiece() quit!");
auto iter_temp = uset_dictionary_.begin();
while (iter_temp != uset_dictionary_.end())
{
uset_dictionary_temp.insert(*iter_temp);
++iter_temp;
}
int n_size;
string str_sub;
auto iter = uset_dictionary_temp.begin();
while (iter != uset_dictionary_temp.end())
{
n_size = (*iter).size();
if ( n_size <= 2)
{
++iter;
continue;
}
else
{
for (int n_pos = 0; n_pos < n_size - 1; ++n_pos)
{
for (int n_len = 2; n_len <= n_size - n_pos; ++n_len)
{
str_sub = iter->substr(n_pos, n_len);
uset_dictionary_.insert(str_sub);
}
}
}
++iter;
}
}
// Lookup the str_letters to see if exists in dictionary
bool SingletonDiction::LookupDict(string str_letters)
{
if (str_letters.empty())
throw runtime_error("Invalid input to function LookupDict()!");
// If letters found in dictionary, return true, otherwise, return false.
if (uset_dictionary_.find(str_letters) != (uset_dictionary_.end()))
{
return true;
}
else
{
return false;
}
}