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
|
#ifndef NODE_H_
#define NODE_H_
#include <vector>
#include <boost/unordered_map.hpp>
#include <boost/foreach.hpp>
namespace Moses2
{
template<class KeyClass, class ValueClass>
class Node
{
public:
Node()
{
}
Node(const ValueClass& value) :
m_value(value)
{
}
~Node();
void setKey(const KeyClass& key);
void setValue(const ValueClass& value)
{
m_value = value;
}
Node* findSub(const KeyClass& key);
const Node* findSub(const KeyClass& key) const;
Node *addSubnode(const KeyClass& cKey)
{
Node *node = findSub(cKey);
if (node) {
return node;
}
else {
node = new Node();
subNodes[cKey] = node;
return node;
}
}
std::vector<Node*> getSubnodes();
const ValueClass &getValue() const
{
return m_value;
}
private:
boost::unordered_map<KeyClass, Node*> subNodes;
ValueClass m_value;
};
template<class KeyClass, class ValueClass>
Node<KeyClass, ValueClass>::~Node()
{
typename boost::unordered_map<KeyClass, Node*>::iterator iter;
for (iter = subNodes.begin(); iter != subNodes.end(); ++iter) {
Node *node = iter->second;
delete node;
}
}
template<class KeyClass, class ValueClass>
const Node<KeyClass, ValueClass>* Node<KeyClass, ValueClass>::findSub(
const KeyClass& cKey) const
{
typename boost::unordered_map<KeyClass, Node*>::const_iterator iter;
iter = subNodes.find(cKey);
if (iter != subNodes.end()) {
Node *node = iter->second;
return node;
}
return NULL;
}
template<class KeyClass, class ValueClass>
Node<KeyClass, ValueClass>* Node<KeyClass, ValueClass>::findSub(
const KeyClass& cKey)
{
typename boost::unordered_map<KeyClass, Node*>::iterator iter;
iter = subNodes.find(cKey);
if (iter != subNodes.end()) {
Node *node = iter->second;
return node;
}
return NULL;
}
}
#endif /* end of include guard: NODE_H_ */
|
