blob: 73d75e7a97cd6b1ca2bc30160ac5f08d9c503509 (
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
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/**
* @file
* @author 2012-2014 Stefan Radomski (stefan.radomski@cs.tu-darmstadt.de)
* @copyright Simplified BSD
*
* @cond
* This program is free software: you can redistribute it and/or modify
* it under the terms of the FreeBSD license as published by the FreeBSD
* project.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*
* You should have received a copy of the FreeBSD license along with this
* program. If not, see <http://www.opensource.org/licenses/bsd-license>.
* @endcond
*/
#ifndef TRIE_H_UZMQRBO5
#define TRIE_H_UZMQRBO5
#include "uscxml/Common.h"
#include <string>
#include <map>
#include <list>
namespace uscxml {
struct USCXML_API TrieNode {
TrieNode();
virtual ~TrieNode();
bool hasWord;
int index;
std::string identifier;
std::string value;
std::map<std::string, TrieNode*> childs;
void dump(int indent = 0);
};
struct USCXML_API Trie {
Trie();
Trie(const std::string& seperator);
virtual ~Trie();
void addWord(const std::string& word);
size_t getNextToken(const std::string& word, size_t offset, std::string& token);
std::string escapeWord(const std::string& word);
TrieNode* getNodeWithPrefix(const std::string& prefix);
std::list<TrieNode*> getWordsWithPrefix(const std::string& prefix);
std::list<TrieNode*> getChildsWithWords(TrieNode* node);
void dump();
TrieNode* root;
std::string seperator;
int lastIndex;
};
}
#endif /* end of include guard: TRIE_H_UZMQRBO5 */
|
