|
27
|
1 import logging
|
|
|
2
|
|
|
3 class HashTreeNode:
|
|
|
4 """Node of a HashTree.
|
|
|
5 Has a value and keeps children in a dict indexed by key."""
|
|
|
6 key = None
|
|
|
7 value = None
|
|
|
8 children = None
|
|
|
9
|
|
|
10 def __init__(self, key=None, value=None, children=None):
|
|
|
11 """create node"""
|
|
|
12 self.key = key
|
|
|
13 self.value = value
|
|
|
14 self.children = children
|
|
|
15
|
|
|
16
|
|
|
17 def getNode(self, key):
|
|
|
18 """return node under key"""
|
|
|
19 if self.children is None:
|
|
|
20 return None
|
|
|
21 else:
|
|
|
22 return self.children.get(key, None)
|
|
|
23
|
|
|
24
|
|
|
25 def addNode(self, node):
|
|
|
26 """add child node using key from node"""
|
|
|
27 if self.children is None:
|
|
|
28 self.children = {node.key : node}
|
|
|
29 else:
|
|
|
30 self.children[node.key] = node
|
|
|
31
|
|
|
32
|
|
29
|
33 def getSubtreeAsList(self):
|
|
34
|
34 """returns the subtree as flattened list sorted by key (depth first)"""
|
|
27
|
35 if self.children is None:
|
|
|
36 if self.value is None:
|
|
|
37 return []
|
|
|
38 else:
|
|
|
39 return [self.value]
|
|
|
40
|
|
|
41 else:
|
|
|
42 if self.value is None:
|
|
|
43 sub = []
|
|
|
44 else:
|
|
|
45 sub = [self.value]
|
|
|
46
|
|
|
47 keys = self.children.keys()
|
|
|
48 keys.sort()
|
|
|
49 for k in keys:
|
|
|
50 #logging.debug("getSubtreeList: k=%s sub=%s"%(k,sub))
|
|
29
|
51 sub.extend(self.children.get(k).getSubtreeAsList())
|
|
27
|
52
|
|
|
53 return sub
|
|
|
54
|
|
|
55
|
|
|
56 def getSubtreeAsText(self):
|
|
|
57 """prints whole tree as text"""
|
|
|
58 if self.children is None:
|
|
|
59 return "(%s:%s)"%(self.key, self.value)
|
|
|
60 else:
|
|
|
61 sub = "(%s:%s):["%(self.key, self.value)
|
|
|
62 keys = self.children.keys()
|
|
|
63 keys.sort()
|
|
|
64 for k in keys:
|
|
|
65 sub += self.children.get(k).getSubtreeAsText()
|
|
|
66 sub += ", "
|
|
|
67
|
|
|
68 return sub + "] "
|
|
|
69
|
|
|
70
|
|
|
71 class HashTree:
|
|
|
72 """Tree using dictionaries"""
|
|
|
73
|
|
|
74 root = None
|
|
|
75 keySeparator = '.'
|
|
|
76 keyFn = None
|
|
|
77
|
|
|
78 def __init__(self, keySeparator='.', keyFn=None):
|
|
|
79 """creates a HashTree"""
|
|
|
80 self.root = HashTreeNode()
|
|
|
81 self.keySeparator = keySeparator
|
|
|
82 self.keyFn = keyFn
|
|
|
83
|
|
|
84
|
|
|
85 def getNode(self, key):
|
|
|
86 """gets node under key from the tree.
|
|
|
87 key can be sequence of key string or a single string using keySeparator.
|
|
30
|
88 If key is None, returns root node.
|
|
27
|
89 """
|
|
30
|
90 if key is None:
|
|
|
91 return self.root
|
|
|
92
|
|
27
|
93 if isinstance(key, basestring):
|
|
|
94 keys = key.split(self.keySeparator)
|
|
|
95 if self.keyFn is not None:
|
|
|
96 keys = [self.keyFn(k) for k in keys]
|
|
30
|
97
|
|
27
|
98 elif isinstance(key, list):
|
|
|
99 keys = key
|
|
30
|
100
|
|
27
|
101 else:
|
|
|
102 keys = [key]
|
|
|
103
|
|
|
104 node = self.root
|
|
|
105 for k in keys:
|
|
|
106 #logging.debug("getNode node=%s k=%s"%(node, repr(k)))
|
|
|
107 node = node.getNode(k)
|
|
|
108 #logging.debug("getNode got:%s"%(node))
|
|
|
109 if node is None:
|
|
|
110 return None
|
|
|
111
|
|
|
112 return node
|
|
|
113
|
|
|
114
|
|
|
115 def get(self, key):
|
|
|
116 """gets value under key from the tree.
|
|
|
117 key can be sequence of key string or a single string using keySeparator.
|
|
|
118 """
|
|
|
119 node = self.getNode(key)
|
|
|
120 if node is None:
|
|
|
121 return None
|
|
|
122
|
|
|
123 return node.value
|
|
|
124
|
|
|
125
|
|
|
126 def add(self, key, value):
|
|
|
127 """adds value under key to the tree.
|
|
|
128 key can be sequence of key string or a single string using keySeparator.
|
|
|
129 """
|
|
|
130 #logging.debug("add(key=%s, value=%s)"%(repr(key), value))
|
|
|
131 if isinstance(key, basestring):
|
|
|
132 keys = key.split(self.keySeparator)
|
|
|
133 if self.keyFn is not None:
|
|
|
134 keys = [self.keyFn(k) for k in keys]
|
|
|
135 elif isinstance(key, list):
|
|
|
136 keys = key
|
|
|
137 else:
|
|
|
138 keys = [key]
|
|
|
139
|
|
|
140 node = self.root
|
|
|
141 for k in keys:
|
|
|
142 nextnode = node.getNode(k)
|
|
|
143 if nextnode is None:
|
|
|
144 nextnode = HashTreeNode(key=k)
|
|
|
145 node.addNode(nextnode)
|
|
|
146
|
|
|
147 node = nextnode
|
|
|
148
|
|
|
149 node.value = value
|
|
|
150
|
|
|
151
|
|
|
152
|
