-
Notifications
You must be signed in to change notification settings - Fork 1
/
StaticMatcher.cpp
204 lines (187 loc) · 7.59 KB
/
StaticMatcher.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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
#include "StaticMatcher.h"
#include <set>
TStaticTemplateMatcher::TStaticTemplateMatcher():TTrie(),template_lengths(),sink(new TTrieNode),used(false),currentnode(getroot()) {
getroot()->suf_link_ = sink;
getroot()->hard_suf_link_ = sink;
sink->suf_link_ = sink;
sink->hard_suf_link_ = getroot();
}
weak_ptr<TTrieNode> TStaticTemplateMatcher::moveto(weak_ptr<TTrieNode> node, char symbol) {
if (node.lock() == sink)
return weak_ptr<TTrieNode>(getroot());
if (node.lock()->isEdge(symbol))
return weak_ptr<TTrieNode>(node.lock()->next(symbol));
return moveto(suf_link_move(node),symbol);
}
weak_ptr<TTrieNode> TStaticTemplateMatcher::suf_link_move(weak_ptr<TTrieNode> node) {
if (node.lock()->suf_link_.lock())
return node.lock()->suf_link_;
weak_ptr<TTrieNode> prev = node.lock()->parentnode_;
while (prev.lock() != getroot() && !suf_link_move(prev).lock()->isEdge(node.lock()->parentsymbol_))
prev = suf_link_move(prev);
node.lock()->suf_link_ = moveto(suf_link_move(prev),node.lock()->parentsymbol_);
return node.lock()->suf_link_;
}
weak_ptr<TTrieNode> TStaticTemplateMatcher::hard_suf_link_move(weak_ptr<TTrieNode> node){
if (node.lock()->hard_suf_link_.lock())
return node.lock()->hard_suf_link_;
if (!suf_link_move(node).lock()->terminal_.empty()) {
node.lock()->hard_suf_link_ = suf_link_move(node);
return node.lock()->hard_suf_link_;
}
node.lock()->hard_suf_link_= hard_suf_link_move(suf_link_move(node));
return node.lock()->hard_suf_link_;
}
TStringID TStaticTemplateMatcher::AddTemplate(const std::string &templatestr) {
if (used)
throw std::logic_error("AddTemplate after MatchStream");
addstring(templatestr,template_lengths.size());
template_lengths.push_back(templatestr.length());
return template_lengths.size() - 1;
}
void TStaticTemplateMatcher::Handlesymbol(char ch, TMatchResults& ans, size_t &pos) {
currentnode = moveto(currentnode, ch);
weak_ptr<TTrieNode> ansiterator = currentnode;
if (ansiterator.lock()->terminal_.empty())
ansiterator = hard_suf_link_move(ansiterator);
while (!ansiterator.lock()->terminal_.empty()) {
for(TStringID &templateid: ansiterator.lock()->terminal_) {
ans.push_back(std::make_pair(pos, templateid));
}
ansiterator = hard_suf_link_move(ansiterator);
}
}
TMatchResults TStaticTemplateMatcher::MatchStream(ICharStream &stream) {
used = true;
std::vector<TOccurance> ans;
size_t pos = 0;
currentnode = weak_ptr<TTrieNode>(getroot());
if (!getroot()->terminal_.empty())
for (TStringID &templateid: getroot()->terminal_)
ans.push_back(std::make_pair(0,templateid));
while (!stream.IsEmpty()) {
char newchar=stream.GetChar();
if (static_cast<int>(newchar) < 32 || static_cast<int>(newchar) > 255)
throw std::logic_error("Character out of range");
Handlesymbol(newchar, ans, pos);
pos++;
}
return ans;
}
TDynamicTemplateMatcher::TDynamicTemplateMatcher():Matchers(), templates(), CheckOnce() {
template_groups.push_back(std::vector<size_t>());
Matchers.push_back(std::vector<TStaticTemplateMatcher>());
}
TStringID TDynamicTemplateMatcher::AddTemplate(const std::string &templatestr) {
std::vector<size_t> powerof2(1,1);
CheckOnce.addstring(templatestr, 0);
size_t currentpos = 0;
templates.push_back(templatestr);
template_groups[0].push_back(templates.size() - 1);
Matchers[0].push_back(TStaticTemplateMatcher());
Matchers[0].back().AddTemplate(templatestr);
while (Matchers[currentpos].size() > 1) {
TStaticTemplateMatcher tmp;
if (template_groups.size() - 1 == currentpos) {
template_groups.push_back(std::vector<size_t>());
Matchers.push_back(std::vector<TStaticTemplateMatcher>());
}
if (powerof2.size() - 1 == currentpos)
powerof2.push_back(powerof2.back()*2);
while (Matchers[currentpos].size() > 0)
Matchers[currentpos].pop_back();
while (!template_groups[currentpos].empty()) {
template_groups[currentpos + 1].push_back(template_groups[currentpos].back());
tmp.AddTemplate(templates[template_groups[currentpos].back()]);
template_groups[currentpos].pop_back();
}
Matchers[currentpos + 1].push_back(std::move(tmp));
currentpos++;
}
return templates.size() - 1;
}
TMatchResults TDynamicTemplateMatcher::MatchStream(ICharStream& stream){
TMatchResults ans;
size_t pos = 0;
for (size_t groupnumber = 0; groupnumber < Matchers.size(); ++groupnumber)
if (!Matchers[groupnumber].empty() && !Matchers[groupnumber][0].getroot()->terminal_.empty())
ans.push_back(std::make_pair(0,Matchers[groupnumber][0].getroot()->terminal_[0]));
while (!stream.IsEmpty()) {
char newchar=stream.GetChar();
if (static_cast<int>(newchar) < 32 || static_cast<int>(newchar) > 255)
throw std::logic_error("Character out of range");
for (size_t groupnumber = 0; groupnumber < Matchers.size(); ++groupnumber) {
if (!Matchers[groupnumber].empty()) {
TMatchResults tmp;
Matchers[groupnumber][0].Handlesymbol(newchar, tmp, pos);
while (!tmp.empty()) {
tmp.back().second = template_groups[groupnumber][tmp.back().second];
ans.push_back(tmp.back());
tmp.pop_back();
}
}
}
pos++;
}
return ans;
}
void T2DSingleTemplateMatcher::AddTemplateTable(const std::vector<string> &templatetable) {
templateheight = templatetable.size();
Matcher.allowsametemplates = true;
if (!templatetable.empty())
templatelength = templatetable.back().size();
for (size_t row_number = 0; row_number < templatetable.size(); ++row_number) {
if (templatetable[row_number].size()!=templatelength)
throw std::logic_error("row lengths don't match");
Matcher.AddTemplate(templatetable[row_number]);
}
}
void T2DSingleTemplateMatcher::FindRowMatchSequence(const std::vector<size_t>& Matches, size_t columnnumber,
TMatchResults &Result, const std::vector<size_t>& equivalences) {
std::vector<size_t> prefix_function(Matches.size(),0);
if (!Matches.empty())
if (Matches[0] == 0) {
prefix_function[0]=1;
if (templateheight == 1)
Result.push_back(std::make_pair(0,columnnumber));
}
for (size_t rownumber = 1; rownumber < textheight; ++rownumber) {
size_t prev = prefix_function[rownumber - 1];
if (Matches[rownumber] != equivalences[prev])
prev = 0;
prefix_function[rownumber] = prev;
if (Matches[rownumber]==equivalences[prev])
++prefix_function[rownumber];
if (prefix_function[rownumber] == templateheight)
Result.push_back(std::make_pair(rownumber, columnnumber));
}
}
TMatchResults T2DSingleTemplateMatcher::MatchTable(const std::vector<string> &texttable){
string text;
std::vector<size_t> equivalence_class(templateheight, -1);
equivalence_class.push_back(-2);
textheight = texttable.size();
if (!texttable.empty())
textlength = texttable.back().size();
for (size_t row_number = 0; row_number < texttable.size(); ++row_number) {
if (texttable[row_number].size()!=textlength)
throw std::logic_error("row lengths don't match");
text+=texttable[row_number];
}
TStringStream stream(text);
TMatchResults RowsMatch = Matcher.MatchStream(stream);
std::vector<std::vector<size_t>> Matches(textlength, std::vector<size_t>(textheight,-1));
for (size_t Match_number = 0; Match_number < RowsMatch.size(); ++Match_number) {
size_t x = RowsMatch[Match_number].first / textlength;
size_t y = RowsMatch[Match_number].first % textlength;
if (Matches[y][x] + 1 == 0)
Matches[y][x]= RowsMatch[Match_number].second;
if (equivalence_class[RowsMatch[Match_number].second] + 1 == 0)
equivalence_class[RowsMatch[Match_number].second] = Matches[y][x];
}
TMatchResults Res;
for (size_t columntocheck = templatelength - 1;columntocheck < textlength ;++columntocheck) {
FindRowMatchSequence(Matches[columntocheck], columntocheck, Res, equivalence_class);
}
return Res;
}