Created by Vladimir Tsvetkov on 08 07 14 clear clear -o search -std 11

  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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
// Created by Vladimir Tsvetkov on 08/07/14.
//clear && clear && g++ -o search -std=c++11 -g search.cpp ./../../src/string/unistring.cpp
#include "../../include/search/search.h"
/*Unistring starCharToUnistring(char *starStr)
{
Utf8String strseq = Utf8String(starStr);
Unistring strunistring = Unistring(strseq);
return strunistring;
}
Unistring stdStrToUnistring(std::string *str)
{
Unistring strunistring = starCharToUnistring((char*)(*str).c_str());
return strunistring;
}*/
int commonPrefix(Unistring *data, Unistring *pattern, int curIndex)
{
Unistring *cutPattern;
cutPattern = pattern->substr(curIndex);
for(int i = 0; i < data->size(); i++)
if (i == cutPattern->size() || (*data)[i] != (*cutPattern)[i])
return i;
return data->size();
}
std::set<Unistring> *insertSetIntoSet(std::set<Unistring> *set, std::set<Unistring> *insSet)
{
auto newSet = new std::set<Unistring>;
for(auto i:(*set))
newSet->insert(i);
for(auto i:(*insSet))
newSet->insert(i);
return newSet;
}
//attention! pattern is Unistring
bool isValidPattern(Unistring *pattern)
{
if (pattern->size() < 3)
{
return false;
} else
{
return true;
}
}
Unistring *preProcessPattern(Unistring *pattern)
{
auto *newPattern = new Unistring;
bool firstStar = false;
for(auto i:(*pattern))
{
if (i == unichar('*'))
{
if (!firstStar)
{
newPattern->append(i);
firstStar = true;
}
} else
{
newPattern->append(i);
firstStar = false;
}
}
return newPattern;
}
std::set<Unistring> *Trie::searchWordsFromTrie(Unistring *pattern)
{
std::set<Unistring> *finalset;
//Unistring newPattern = preProcessPattern(pattern);
//if (!isValidPattern(newPattern))
//{
//пичаль
//throw std::domain_error("слишком короткая строка");
//}
//if (pattern[0] == unichar('*'))
//{
// finalset = searchWords(root.leaves[pattern[0]], pattern, 1);
//} else
//{
finalset = searchWords(root, pattern, 0);
//}
return finalset;
}
/*std::set<Unistring> Trie::unsafeSearch(Unistring pattern)
{
std::set<Unistring> finalset;
finalset = searchWords(root, pattern, 0);
for(auto i:finalset)
{
i.print();
std::cout<<std::endl;
}
}*/
void Trie::findRemainingNodes(std::set<Unistring> *wordSet, trieNode *node)
{
if (node->isFinal)
{
wordSet->insert(*(node->data));
} else
{
for (auto i:node->leaves)
{
findRemainingNodes(wordSet, &i.second);
}
}
}
void DBG(std::string str)
{
std::cout << str << "\n";
}
std::set<Unistring> *Trie::searchWords(trieNode *node, Unistring *pattern, int curIndex)
{
std::cout << "searchWordsCall with curIndex " << curIndex << "\n";
if ( ((*(node->data))[0]).is_sentinel() && (curIndex == (pattern->size() - 1) || (*pattern)[curIndex] == unichar('*')))
{
auto wordSet = new std::set<Unistring>;
wordSet->insert(*node->data);
return wordSet;
}
DBG(" 1st end conditions checked");
if (!(*(node->data))[0].is_sentinel() && (curIndex == (pattern->size() - 1) || (*pattern)[curIndex] == unichar('*')))
{
//run recursive walking and return all nodes
auto wordSet = new std::set<Unistring>;
findRemainingNodes(wordSet, node);
return wordSet;
}
DBG("end conditions checked");
//int magic = 1;
auto *wordSet = new std::set<Unistring>;
unichar curChar = (*pattern)[curIndex];
if (curChar == unichar('*'))
{
wordSet=insertSetIntoSet(wordSet, searchWords(node, pattern, curIndex + 1)); //звезда пустой символ
//или запускаю поиск от этой же вершины с обрезанной буквой
//что делать если все буквы обрезали
if (node->data->size() == 0)
{
for(auto i:node->leaves)
{
wordSet=insertSetIntoSet(wordSet, searchWords(&i.second, pattern, curIndex));
}
} else
{
Unistring *newData = node->data->substr(1);
std::map<unichar, trieNode> newleaves = node->leaves;
auto *nextNode = new trieNode(newData, newleaves, false);
wordSet=insertSetIntoSet(wordSet, searchWords(nextNode, pattern, curIndex));
}
return wordSet;
} else
{
int commonPrefixsize;
if (curIndex == 0)
{
commonPrefixsize = commonPrefix(node->data, pattern, curIndex);
} else
{
commonPrefixsize = commonPrefix(node->data, pattern, curIndex-1);
}
//Unistring commonPrefix = node.data.substring(0, commonPrefixsize);
trieNode *nextNode;
if (commonPrefixsize == node->data->size())
{
//поиск от ребенка
nextNode = &node->leaves[(*pattern)[commonPrefixsize]];
} else
{
//сплитим ноду
Unistring *newData = node->data->substr(commonPrefixsize, node->data->size());
std::map<unichar, trieNode> newleaves = node->leaves;
nextNode = new trieNode(newData, newleaves, false);
}
wordSet=insertSetIntoSet(wordSet, searchWords(nextNode, pattern, curIndex + commonPrefixsize)); // нужно ли -1?
return wordSet;
}
auto *retSet = new std::set<Unistring>;
return retSet;
}
Trie::Trie(trieNode *nroot)
{
this->root = nroot;
}
trieNode::~trieNode(){}
trieNode::trieNode(){}
Trie::~Trie(){}
trieNode::trieNode(Unistring *ndata, std::map<unichar, trieNode> nleaves, bool nisFinal)
{
this->data = ndata;
this->leaves = nleaves;
this->isFinal = nisFinal;
}
void search_test()
{
/*
std::cout<<"start test stdStrToUnistring\n";
std::string pattern;
std::cin >> pattern;
std::cout<<pattern<<"\n";
Unistring patternunistring = stdStrToUnistring(&pattern);
patternunistring.print();
std::cout<<"\n";
std::cout<<"start test starCharToUnistring\n";
char str[] = {'a', 'b', 'r', 'a'};
std::cout<<str<<"\n";
Unistring strunistring = starCharToUnistring(str);
strunistring.print();
std::cout<<"\n";
std::cout<<"start test commonPrefixsize\n";
std::string data1, pattern1;
int curIndex;
std::cin >> data1;
std::cin >> pattern1;
std::cin >> curIndex;
int prefixsize = commonPrefix(stdStrToUnistring(&data1), stdStrToUnistring(&pattern1), curIndex);
std::cout << prefixsize;
*/
Unistring *str = new Unistring();
str->append(unichar('a'));
str->append(SentinelGenerator::instance().generate());
std::map<unichar, trieNode> nleaves1;
trieNode node1 = trieNode(str, nleaves1, true);
std::map<unichar, trieNode> nleaves;
nleaves[unichar('a')] = node1;
Unistring *mi = new Unistring;
auto nroot = new trieNode(mi, nleaves, false);
Trie tree = Trie(nroot);
str->print();
Unistring *pattern = new Unistring;
pattern->append(unichar('a'));
pattern->print();
tree.searchWordsFromTrie(pattern);
}