1 |
55
|
aaronmk
|
# XPath parsing
|
2 |
21
|
aaronmk
|
|
3 |
55
|
aaronmk
|
import copy
|
4 |
1009
|
aaronmk
|
import warnings
|
5 |
21
|
aaronmk
|
|
6 |
|
|
from Parser import Parser
|
7 |
892
|
aaronmk
|
import util
|
8 |
77
|
aaronmk
|
import xml_dom
|
9 |
21
|
aaronmk
|
|
10 |
1001
|
aaronmk
|
##### Path elements
|
11 |
|
|
|
12 |
21
|
aaronmk
|
class XpathElem:
|
13 |
1002
|
aaronmk
|
def __init__(self, name='', value=None, is_attr=False):
|
14 |
21
|
aaronmk
|
self.name = name
|
15 |
|
|
self.value = value
|
16 |
|
|
self.is_attr = is_attr
|
17 |
97
|
aaronmk
|
self.is_positive = True
|
18 |
1238
|
aaronmk
|
self.is_lookup_only = False
|
19 |
94
|
aaronmk
|
self.is_ptr = False
|
20 |
|
|
self.keys = []
|
21 |
|
|
self.attrs = []
|
22 |
78
|
aaronmk
|
self.other_branches = [] # temp implementation for split paths
|
23 |
21
|
aaronmk
|
|
24 |
|
|
def __repr__(self):
|
25 |
|
|
str_ = ''
|
26 |
141
|
aaronmk
|
if not self.is_positive: str_ += '!'
|
27 |
21
|
aaronmk
|
if self.is_attr: str_ += '@'
|
28 |
1004
|
aaronmk
|
if self.name == '': str_ += '""'
|
29 |
|
|
else: str_ += self.name
|
30 |
1238
|
aaronmk
|
if self.is_lookup_only: str_ += '?'
|
31 |
94
|
aaronmk
|
if self.keys != []: str_ += repr(self.keys)
|
32 |
|
|
if self.attrs != []: str_ += ':'+repr(self.attrs)
|
33 |
|
|
if self.is_ptr: str_ += '->'
|
34 |
|
|
if self.other_branches != []: str_ += '{'+repr(self.other_branches)+'}'
|
35 |
25
|
aaronmk
|
if self.value != None: str_ += '='+repr(self.value)
|
36 |
21
|
aaronmk
|
return str_
|
37 |
|
|
|
38 |
|
|
def __eq__(self, other): return self.__dict__ == other.__dict__
|
39 |
|
|
|
40 |
1002
|
aaronmk
|
empty_elem = XpathElem()
|
41 |
|
|
|
42 |
|
|
def elem_is_empty(elem): return elem == empty_elem
|
43 |
|
|
|
44 |
1004
|
aaronmk
|
def is_self(elem): return elem.name == '' or elem.name == '.'
|
45 |
|
|
|
46 |
|
|
def is_parent(elem): return elem.name == '..'
|
47 |
|
|
|
48 |
1001
|
aaronmk
|
##### Paths
|
49 |
|
|
|
50 |
1350
|
aaronmk
|
def path_is_empty(path): return path == [] or path == [empty_elem]
|
51 |
|
|
|
52 |
99
|
aaronmk
|
def is_positive(path): return path[0].is_positive
|
53 |
|
|
|
54 |
1003
|
aaronmk
|
def is_rooted(path): return elem_is_empty(path[0])
|
55 |
|
|
|
56 |
24
|
aaronmk
|
def value(path): return path[-1].value
|
57 |
|
|
|
58 |
1294
|
aaronmk
|
def set_value(path, value):
|
59 |
|
|
'''Caller must make a shallow copy of the path to prevent modifications from
|
60 |
|
|
propagating to other copies of the path (a deep copy is not needed)'''
|
61 |
|
|
path[-1] = copy.copy(path[-1]) # don't modify other copies of the path
|
62 |
|
|
path[-1].value = value
|
63 |
22
|
aaronmk
|
|
64 |
1577
|
aaronmk
|
def append(path, subpath, i=0):
|
65 |
|
|
'''Recursively appends subpath to every leaf of a path tree'''
|
66 |
|
|
if i >= len(path): path += subpath
|
67 |
|
|
else:
|
68 |
|
|
append(path, subpath, i+1)
|
69 |
|
|
for branch in path[i].other_branches: append(branch, subpath)
|
70 |
|
|
|
71 |
32
|
aaronmk
|
def backward_id(elem):
|
72 |
171
|
aaronmk
|
if len(elem.keys) >= 1 and value(elem.keys[0]) == None: return elem.keys[0]
|
73 |
32
|
aaronmk
|
else: return None
|
74 |
|
|
|
75 |
1001
|
aaronmk
|
instance_level = 1 # root's grandchildren
|
76 |
|
|
|
77 |
|
|
def obj(path):
|
78 |
|
|
obj_path = copy.deepcopy(path[:instance_level+1])
|
79 |
|
|
obj_path[-1].is_ptr = False # prevent pointer w/o target
|
80 |
|
|
return obj_path
|
81 |
|
|
|
82 |
|
|
def set_id(path, id_, has_types=True):
|
83 |
1294
|
aaronmk
|
'''Caller must make a shallow copy of the path to prevent modifications from
|
84 |
2001
|
aaronmk
|
propagating to other copies of the path (a deep copy is not needed).
|
85 |
|
|
@return The path to the ID attr, which can be used to change the ID
|
86 |
|
|
'''
|
87 |
1001
|
aaronmk
|
if has_types: id_level = instance_level
|
88 |
|
|
else: id_level = 0 # root's children
|
89 |
1004
|
aaronmk
|
if is_self(path[0]): id_level += 1 # explicit root element
|
90 |
1294
|
aaronmk
|
|
91 |
|
|
id_elem = path[id_level] = copy.copy(path[id_level])
|
92 |
|
|
# don't modify other copies of the path
|
93 |
|
|
id_elem.keys = id_elem.keys[:] # don't modify other copies of the elem
|
94 |
2001
|
aaronmk
|
id_attr = XpathElem('id', None, is_attr=True)
|
95 |
|
|
|
96 |
|
|
# Save the path to the ID attr
|
97 |
2002
|
aaronmk
|
id_path = path[:id_level] # the path before the ID level
|
98 |
|
|
id_path.append(copy.deepcopy(id_elem)) # this path's id_elem is independent
|
99 |
|
|
id_path.append(copy.copy(id_attr)) # this path's id_attr is independent
|
100 |
2001
|
aaronmk
|
|
101 |
|
|
# Set the ID attr on the provided XPath
|
102 |
|
|
id_attr.value = id_
|
103 |
|
|
id_elem.keys.append([id_attr])
|
104 |
|
|
|
105 |
|
|
return id_path
|
106 |
1001
|
aaronmk
|
|
107 |
|
|
def is_id(path): return path[0].is_attr and path[0].name == 'id'
|
108 |
|
|
|
109 |
1070
|
aaronmk
|
def is_instance(elem): return elem.keys != [] and is_id(elem.keys[0])
|
110 |
1001
|
aaronmk
|
|
111 |
|
|
##### Parsing
|
112 |
|
|
|
113 |
1345
|
aaronmk
|
import xpath_func
|
114 |
|
|
|
115 |
170
|
aaronmk
|
def expand_abbr(name, repl):
|
116 |
|
|
before, abbr, after = name.partition('*')
|
117 |
|
|
if abbr != '': name = before+repl+after
|
118 |
|
|
return name
|
119 |
|
|
|
120 |
154
|
aaronmk
|
_cache = {}
|
121 |
|
|
|
122 |
76
|
aaronmk
|
def parse(str_):
|
123 |
154
|
aaronmk
|
try: return _cache[str_]
|
124 |
|
|
except KeyError: pass
|
125 |
|
|
|
126 |
76
|
aaronmk
|
parser = Parser(str_)
|
127 |
21
|
aaronmk
|
|
128 |
76
|
aaronmk
|
def _path():
|
129 |
97
|
aaronmk
|
is_positive = not parser.str_('!')
|
130 |
|
|
|
131 |
21
|
aaronmk
|
tree = []
|
132 |
|
|
while True:
|
133 |
38
|
aaronmk
|
# Split path
|
134 |
76
|
aaronmk
|
if parser.str_('{'):
|
135 |
1398
|
aaronmk
|
try: last = tree[-1]
|
136 |
|
|
except IndexError: parser.syntax_err('./{')
|
137 |
1070
|
aaronmk
|
last.other_branches = _paths()
|
138 |
1577
|
aaronmk
|
tree += last.other_branches.pop(0) # use first path for now
|
139 |
76
|
aaronmk
|
parser.str_('}', required=True)
|
140 |
1577
|
aaronmk
|
if parser.str_('/'): append(tree, _path()) # subpath after {}
|
141 |
1070
|
aaronmk
|
break # anything after split path has already been parsed
|
142 |
36
|
aaronmk
|
|
143 |
754
|
aaronmk
|
elem = XpathElem(is_attr=parser.str_('@'), name=_value())
|
144 |
38
|
aaronmk
|
|
145 |
1238
|
aaronmk
|
elem.is_lookup_only = parser.str_('?')
|
146 |
|
|
|
147 |
94
|
aaronmk
|
# Keys used to match nodes
|
148 |
76
|
aaronmk
|
if parser.str_('['):
|
149 |
94
|
aaronmk
|
elem.keys = _paths()
|
150 |
76
|
aaronmk
|
parser.str_(']', required=True)
|
151 |
36
|
aaronmk
|
|
152 |
94
|
aaronmk
|
# Attrs created when no matching node exists
|
153 |
|
|
if parser.str_(':'):
|
154 |
|
|
parser.str_('[', required=True)
|
155 |
|
|
elem.attrs = _paths()
|
156 |
|
|
parser.str_(']', required=True)
|
157 |
|
|
|
158 |
76
|
aaronmk
|
elem.is_ptr = parser.str_('->')
|
159 |
21
|
aaronmk
|
tree.append(elem)
|
160 |
36
|
aaronmk
|
|
161 |
|
|
# Lookahead assertion
|
162 |
76
|
aaronmk
|
if parser.str_('('):
|
163 |
|
|
parser.str_('/', required=True) # next / is inside ()
|
164 |
|
|
path = _path()
|
165 |
|
|
parser.str_(')', required=True)
|
166 |
94
|
aaronmk
|
elem.keys.append(path)
|
167 |
36
|
aaronmk
|
tree += path
|
168 |
|
|
|
169 |
76
|
aaronmk
|
if not parser.str_('/'): break
|
170 |
32
|
aaronmk
|
|
171 |
97
|
aaronmk
|
tree[0].is_positive = is_positive
|
172 |
|
|
|
173 |
|
|
# Value
|
174 |
997
|
aaronmk
|
if parser.str_('='):
|
175 |
1009
|
aaronmk
|
if parser.str_('$'): # reference (different from a pointer)
|
176 |
|
|
value = _path()
|
177 |
|
|
else: value = _value() # literal value
|
178 |
997
|
aaronmk
|
set_value(tree, value)
|
179 |
85
|
aaronmk
|
|
180 |
32
|
aaronmk
|
# Expand * abbrs
|
181 |
70
|
aaronmk
|
for i in reversed(xrange(len(tree))):
|
182 |
|
|
elem = tree[i]
|
183 |
171
|
aaronmk
|
if elem.is_ptr: offset = 2
|
184 |
32
|
aaronmk
|
else: offset = 1
|
185 |
170
|
aaronmk
|
try: repl = tree[i+offset].name
|
186 |
171
|
aaronmk
|
except IndexError: pass # no replacement elem
|
187 |
|
|
else: elem.name = expand_abbr(elem.name, repl)
|
188 |
32
|
aaronmk
|
|
189 |
21
|
aaronmk
|
return tree
|
190 |
76
|
aaronmk
|
|
191 |
754
|
aaronmk
|
def _value():
|
192 |
|
|
if parser.str_('"'):
|
193 |
|
|
value = parser.re(r'[^"]*')
|
194 |
|
|
parser.str_('"', required=True)
|
195 |
|
|
else: value = parser.re(r'(?:(?:\w+:)*[\w.*]+)?')
|
196 |
|
|
return value
|
197 |
|
|
|
198 |
94
|
aaronmk
|
def _paths():
|
199 |
|
|
paths = []
|
200 |
1350
|
aaronmk
|
path = _path()
|
201 |
|
|
if not path_is_empty(path): # not empty list
|
202 |
|
|
paths.append(path)
|
203 |
|
|
while parser.str_(','): paths.append(_path())
|
204 |
1352
|
aaronmk
|
if path_is_empty(paths[-1]): paths.pop() # remove trailing ","
|
205 |
94
|
aaronmk
|
return paths
|
206 |
|
|
|
207 |
76
|
aaronmk
|
path = _path()
|
208 |
|
|
parser.end()
|
209 |
1342
|
aaronmk
|
path = xpath_func.process(path)
|
210 |
154
|
aaronmk
|
_cache[str_] = path
|
211 |
76
|
aaronmk
|
return path
|
212 |
21
|
aaronmk
|
|
213 |
1001
|
aaronmk
|
##### Querying/creating XML trees
|
214 |
22
|
aaronmk
|
|
215 |
1005
|
aaronmk
|
def get(root, xpath, create=False, last_only=None, limit=1, allow_rooted=True):
|
216 |
141
|
aaronmk
|
'''Warning: The last_only optimization may put data that should be together
|
217 |
|
|
into separate nodes'''
|
218 |
77
|
aaronmk
|
if last_only == None: last_only = create
|
219 |
887
|
aaronmk
|
if limit == None or limit > 1: last_only = False
|
220 |
892
|
aaronmk
|
if util.is_str(xpath): xpath = parse(xpath)
|
221 |
99
|
aaronmk
|
|
222 |
1005
|
aaronmk
|
# Handle edge cases
|
223 |
998
|
aaronmk
|
if xpath == []: return [root]
|
224 |
886
|
aaronmk
|
if create and not is_positive(xpath): return []
|
225 |
1005
|
aaronmk
|
|
226 |
|
|
# Define vars
|
227 |
998
|
aaronmk
|
doc = root.ownerDocument
|
228 |
1005
|
aaronmk
|
if allow_rooted and is_rooted(xpath): root = doc.documentElement
|
229 |
165
|
aaronmk
|
elem = xpath[0]
|
230 |
|
|
|
231 |
|
|
# Find possible matches
|
232 |
|
|
children = []
|
233 |
|
|
if elem.is_attr:
|
234 |
998
|
aaronmk
|
child = root.getAttributeNode(elem.name)
|
235 |
165
|
aaronmk
|
if child != None: children = [child]
|
236 |
1004
|
aaronmk
|
elif is_self(elem): children = [root]
|
237 |
|
|
elif is_parent(elem):
|
238 |
1000
|
aaronmk
|
parent = xml_dom.parent(root)
|
239 |
1013
|
aaronmk
|
if parent == None: return [] # don't try to create doc root's parent
|
240 |
|
|
root = parent
|
241 |
|
|
children = [root]
|
242 |
165
|
aaronmk
|
else:
|
243 |
998
|
aaronmk
|
children = xml_dom.by_tag_name(root, elem.name,
|
244 |
1815
|
aaronmk
|
last_only=(last_only and (elem.keys == [] or is_instance(elem))),
|
245 |
|
|
ignore_namespace=False) # later set ignore_namespace to True?
|
246 |
165
|
aaronmk
|
|
247 |
1009
|
aaronmk
|
# Retrieve elem value
|
248 |
|
|
value_ = elem.value
|
249 |
|
|
if util.is_list(value_): # reference (different from a pointer)
|
250 |
|
|
targets = get(root, value_)
|
251 |
|
|
try: target = targets[0]
|
252 |
|
|
except IndexError:
|
253 |
|
|
warnings.warn(UserWarning('XPath reference target missing: '
|
254 |
|
|
+str(value_)+'\nXPath: '+str(xpath)))
|
255 |
|
|
value_ = None
|
256 |
|
|
else: value_ = xml_dom.value(target)
|
257 |
|
|
|
258 |
165
|
aaronmk
|
# Check each match
|
259 |
885
|
aaronmk
|
nodes = []
|
260 |
165
|
aaronmk
|
for child in children:
|
261 |
1009
|
aaronmk
|
is_match = value_ == None or xml_dom.value(child) == value_
|
262 |
165
|
aaronmk
|
for attr in elem.keys:
|
263 |
|
|
if not is_match: break
|
264 |
1011
|
aaronmk
|
is_match = ((get(child, attr, False, last_only,
|
265 |
|
|
allow_rooted=False) != []) == is_positive(attr))
|
266 |
885
|
aaronmk
|
if is_match:
|
267 |
|
|
nodes.append(child)
|
268 |
|
|
if limit != None and len(nodes) >= limit: break
|
269 |
165
|
aaronmk
|
|
270 |
|
|
# Create node
|
271 |
886
|
aaronmk
|
if nodes == []:
|
272 |
1239
|
aaronmk
|
if not create or elem.is_lookup_only: return []
|
273 |
77
|
aaronmk
|
if elem.is_attr:
|
274 |
998
|
aaronmk
|
root.setAttribute(elem.name, '')
|
275 |
|
|
node = root.getAttributeNode(elem.name)
|
276 |
1013
|
aaronmk
|
elif util.list_eq_is(children, [root]): node = root
|
277 |
998
|
aaronmk
|
else: node = root.appendChild(doc.createElement(elem.name))
|
278 |
1009
|
aaronmk
|
if value_ != None: xml_dom.set_value(node, value_)
|
279 |
886
|
aaronmk
|
nodes.append(node)
|
280 |
165
|
aaronmk
|
|
281 |
1009
|
aaronmk
|
path_value = value(xpath)
|
282 |
165
|
aaronmk
|
xpath = xpath[1:] # rest of XPath
|
283 |
|
|
|
284 |
886
|
aaronmk
|
next = []
|
285 |
|
|
for node in nodes:
|
286 |
|
|
# Create attrs
|
287 |
|
|
if create:
|
288 |
|
|
for attr in elem.keys + elem.attrs:
|
289 |
1011
|
aaronmk
|
get(node, attr, create, last_only, allow_rooted=False)
|
290 |
886
|
aaronmk
|
|
291 |
|
|
# Follow pointer
|
292 |
|
|
if elem.is_ptr:
|
293 |
998
|
aaronmk
|
root = doc.documentElement
|
294 |
886
|
aaronmk
|
xpath = copy.deepcopy(xpath)
|
295 |
|
|
id_path = backward_id(xpath[instance_level])
|
296 |
|
|
if id_path != None: # backward (child-to-parent) pointer with ID key
|
297 |
|
|
id_path[0].name = expand_abbr(id_path[0].name, node.tagName)
|
298 |
|
|
set_value(id_path, xml_dom.get_id(node)) # modify xpath's id key
|
299 |
|
|
else: # forward (parent-to-child) pointer
|
300 |
|
|
id_ = xml_dom.value(node)
|
301 |
|
|
obj_xpath = obj(xpath) # target object
|
302 |
|
|
if id_ == None or get(root, obj_xpath, False, True) == []:
|
303 |
|
|
# no target or target keys don't match
|
304 |
|
|
if not create: continue
|
305 |
|
|
|
306 |
|
|
# Use last target object's ID + 1
|
307 |
|
|
obj_xpath[-1].keys = [] # just get by tag name
|
308 |
|
|
last = get(root, obj_xpath, False, True)
|
309 |
1840
|
aaronmk
|
if last != []: id_ = str(int(util.coalesce(
|
310 |
|
|
xml_dom.get_id(last[0]), 0)) + 1)
|
311 |
886
|
aaronmk
|
else: id_ = '0'
|
312 |
|
|
|
313 |
|
|
# Will append if target keys didn't match.
|
314 |
|
|
# Use lookahead assertion to avoid this.
|
315 |
|
|
xml_dom.set_value(node, id_)
|
316 |
|
|
else: last_only = False
|
317 |
|
|
set_id(xpath, id_)
|
318 |
|
|
else: root = node
|
319 |
1005
|
aaronmk
|
next += get(root, xpath, create, last_only, limit, allow_rooted=False)
|
320 |
886
|
aaronmk
|
|
321 |
|
|
for branch in elem.other_branches:
|
322 |
1294
|
aaronmk
|
branch = branch[:] # don't modify input!
|
323 |
1009
|
aaronmk
|
set_value(branch, path_value)
|
324 |
1005
|
aaronmk
|
next += get(node, branch, create, last_only, limit,
|
325 |
|
|
allow_rooted=False)
|
326 |
165
|
aaronmk
|
|
327 |
|
|
return next
|
328 |
82
|
aaronmk
|
|
329 |
1320
|
aaronmk
|
def get_1(*args, **kw_args):
|
330 |
|
|
'''Runs get() and returns the first result'''
|
331 |
|
|
return util.list_get(get(*args, **kw_args), 0)
|
332 |
|
|
|
333 |
1689
|
aaronmk
|
def get_value(*args, **kw_args):
|
334 |
|
|
'''Runs get_1() and returns the value of any result node'''
|
335 |
|
|
return util.do_ignore_none(xml_dom.value, get_1(*args, **kw_args))
|
336 |
|
|
|
337 |
141
|
aaronmk
|
def put_obj(root, xpath, id_, has_types, value=None):
|
338 |
892
|
aaronmk
|
if util.is_str(xpath): xpath = parse(xpath)
|
339 |
155
|
aaronmk
|
|
340 |
1294
|
aaronmk
|
xpath = xpath[:] # don't modify input!
|
341 |
82
|
aaronmk
|
set_id(xpath, id_, has_types)
|
342 |
85
|
aaronmk
|
if value != None: set_value(xpath, value)
|
343 |
2000
|
aaronmk
|
return get(root, xpath, True)
|
344 |
133
|
aaronmk
|
|
345 |
135
|
aaronmk
|
def path2xml(xpath, first_branch=True):
|
346 |
|
|
root = xml_dom.create_doc().documentElement
|
347 |
141
|
aaronmk
|
get(root, xpath, True)
|
348 |
135
|
aaronmk
|
return root
|
349 |
133
|
aaronmk
|
|
350 |
141
|
aaronmk
|
def xml_set_id(root, id_): xml_dom.set_id(root.firstChild, id_)
|