blob: a54671d20d09382707e6775465e5c355302ac4c2 (
plain)
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
|
#ifndef _MATCHINGS_TRIE_
#define _MATCHINGS_TRIE_
#include <memory>
#include <unordered_map>
#include "phrase.h"
#include "phrase_location.h"
using namespace std;
namespace extractor {
struct TrieNode {
TrieNode(shared_ptr<TrieNode> suffix_link = shared_ptr<TrieNode>(),
Phrase phrase = Phrase(),
PhraseLocation matchings = PhraseLocation()) :
suffix_link(suffix_link), phrase(phrase), matchings(matchings) {}
void AddChild(int key, shared_ptr<TrieNode> child_node) {
children[key] = child_node;
}
bool HasChild(int key) {
return children.count(key);
}
shared_ptr<TrieNode> GetChild(int key) {
return children[key];
}
shared_ptr<TrieNode> suffix_link;
Phrase phrase;
PhraseLocation matchings;
unordered_map<int, shared_ptr<TrieNode> > children;
};
class MatchingsTrie {
public:
void Reset();
shared_ptr<TrieNode> GetRoot() const;
private:
void ResetTree(shared_ptr<TrieNode> root);
shared_ptr<TrieNode> root;
};
} // namespace extractor
#endif
|
