Public-Mirror/Textractor
1
0
Fork 1
mirror of https://github.com/Artikash/Textractor.git synced 2024-12-23 17:04:12 +08:00
Code Issues Projects Releases Wiki Activity

allow empty replacements

Browse Source
This commit is contained in:
Akash Mozumdar 2019-02-20 22:14:32 -05:00
parent 40e62a13d6
commit f6a82984c2
1 changed files with 13 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
extensions/replacer.cpp
View File

@ -23,7 +23,7 @@ public:
if (current != &root) current->value = replacement; if (current != &root) current->value = replacement;
} }
std::pair<int, std::wstring> Lookup(const std::wstring& text) std::pair<int, std::optional<std::wstring>> Lookup(const std::wstring& text)
{ {
int length = 0; int length = 0;
Node* current = &root; Node* current = &root;
@ -43,14 +43,14 @@ private:
struct Node struct Node
{ {
std::unordered_map<wchar_t, std::unique_ptr<Node>> next; std::unordered_map<wchar_t, std::unique_ptr<Node>> next;
std::wstring value; std::optional<std::wstring> value;
} root; } root;
} replacementTrie; } replacementTrie;
int Parse(const std::wstring& file) int Parse(const std::wstring& file)
{ {
replacementTrie = {}; replacementTrie = {};
int replacementCount = 0; int count = 0;
size_t end = 0; size_t end = 0;
while (true) while (true)
{ {
@ -58,16 +58,22 @@ int Parse(const std::wstring& file)
size_t becomes = file.find(L"|BECOMES|", original); size_t becomes = file.find(L"|BECOMES|", original);
if ((end = file.find(L"|END|", becomes)) == std::wstring::npos) break; if ((end = file.find(L"|END|", becomes)) == std::wstring::npos) break;
replacementTrie.Put(file.substr(original + 6, becomes - original - 6), file.substr(becomes + 9, end - becomes - 9)); replacementTrie.Put(file.substr(original + 6, becomes - original - 6), file.substr(becomes + 9, end - becomes - 9));
++replacementCount; count += 1;
} }
return replacementCount; return count;
} }
bool Replace(std::wstring& sentence) bool Replace(std::wstring& sentence)
{ {
for (int i = 0; i < sentence.size(); ++i) for (int i = 0; i < sentence.size(); ++i)
if (sentence.size() > 10000) return false; // defend against infinite looping {
else if (auto[length, replacement] = replacementTrie.Lookup(sentence.substr(i)); !replacement.empty()) sentence.replace(i, length, replacement); auto[length, replacement] = replacementTrie.Lookup(sentence.substr(i));
if (replacement)
{
sentence.replace(i, length, replacement.value());
i += replacement.value().size() - 1; // iterate to end of replacement
}
}
return true; return true;
} }