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
|
#ifndef RADIX_TREE_NODE_HPP
#define RADIX_TREE_NODE_HPP
#include <map>
template <typename K, typename T>
class radix_tree_node {
friend class radix_tree<K, T>;
friend class radix_tree_it<K, T>;
typedef std::pair<const K, T> value_type;
typedef typename std::map<K, radix_tree_node<K, T>* >::iterator it_child;
private:
radix_tree_node() : m_children(), m_parent(NULL), m_value(NULL), m_depth(0), m_is_leaf(false), m_key() { }
radix_tree_node(const value_type &val);
radix_tree_node(const radix_tree_node&); // delete
radix_tree_node& operator=(const radix_tree_node&); // delete
~radix_tree_node();
std::map<K, radix_tree_node<K, T>*> m_children;
radix_tree_node<K, T> *m_parent;
value_type *m_value;
int m_depth;
bool m_is_leaf;
K m_key;
};
template <typename K, typename T>
radix_tree_node<K, T>::radix_tree_node(const value_type &val) :
m_children(),
m_parent(NULL),
m_value(NULL),
m_depth(0),
m_is_leaf(false),
m_key()
{
m_value = new value_type(val);
}
template <typename K, typename T>
radix_tree_node<K, T>::~radix_tree_node()
{
it_child it;
for (it = m_children.begin(); it != m_children.end(); ++it) {
delete it->second;
}
delete m_value;
}
#endif // RADIX_TREE_NODE_HPP
|
