| 1 |
21
|
aaronmk
|
# XML DOM tree manipulation
|
| 2 |
|
|
|
| 3 |
73
|
aaronmk
|
import cgi
|
| 4 |
|
|
from HTMLParser import HTMLParser
|
| 5 |
21
|
aaronmk
|
from xml.dom import Node
|
| 6 |
299
|
aaronmk
|
import xml.dom.minidom as minidom
|
| 7 |
21
|
aaronmk
|
|
| 8 |
73
|
aaronmk
|
import strings
|
| 9 |
331
|
aaronmk
|
import util
|
| 10 |
73
|
aaronmk
|
|
| 11 |
840
|
aaronmk
|
##### Escaping input
|
| 12 |
|
|
|
| 13 |
73
|
aaronmk
|
def escape(str_):
|
| 14 |
|
|
return strings.to_unicode(cgi.escape(str_, True)).encode('ascii',
|
| 15 |
|
|
'xmlcharrefreplace')
|
| 16 |
|
|
|
| 17 |
|
|
def unescape(str_): return HTMLParser().unescape(str_)
|
| 18 |
|
|
|
| 19 |
840
|
aaronmk
|
##### IDs
|
| 20 |
455
|
aaronmk
|
|
| 21 |
21
|
aaronmk
|
def get_id(node): return node.getAttribute('id')
|
| 22 |
|
|
|
| 23 |
|
|
def set_id(node, id_): node.setAttribute('id', id_)
|
| 24 |
|
|
|
| 25 |
840
|
aaronmk
|
##### Element node contents
|
| 26 |
455
|
aaronmk
|
|
| 27 |
840
|
aaronmk
|
def is_elem(node): return node.nodeType == Node.ELEMENT_NODE
|
| 28 |
|
|
|
| 29 |
453
|
aaronmk
|
def is_completely_empty(node): return node.firstChild == None
|
| 30 |
135
|
aaronmk
|
|
| 31 |
301
|
aaronmk
|
def has_one_child(node):
|
| 32 |
|
|
return node.firstChild != None and node.firstChild.nextSibling == None
|
| 33 |
|
|
|
| 34 |
840
|
aaronmk
|
def is_simple(node):
|
| 35 |
|
|
'''Whether every child recursively has no more than one child'''
|
| 36 |
|
|
return (not is_elem(node) or is_completely_empty(node)
|
| 37 |
|
|
or (has_one_child(node) and is_simple(node.firstChild)))
|
| 38 |
|
|
|
| 39 |
305
|
aaronmk
|
class NodeIter:
|
| 40 |
|
|
def __init__(self, node): self.child = node.firstChild
|
| 41 |
|
|
|
| 42 |
|
|
def __iter__(self): return self
|
| 43 |
|
|
|
| 44 |
|
|
def curr(self):
|
| 45 |
|
|
if self.child != None: return self.child
|
| 46 |
|
|
raise StopIteration
|
| 47 |
|
|
|
| 48 |
|
|
def next(self):
|
| 49 |
|
|
child = self.curr()
|
| 50 |
|
|
self.child = self.child.nextSibling
|
| 51 |
|
|
return child
|
| 52 |
|
|
|
| 53 |
840
|
aaronmk
|
##### Comments
|
| 54 |
455
|
aaronmk
|
|
| 55 |
453
|
aaronmk
|
def is_comment(node): return node.nodeType == Node.COMMENT_NODE
|
| 56 |
|
|
|
| 57 |
|
|
def is_empty(node):
|
| 58 |
|
|
for child in NodeIter(node):
|
| 59 |
|
|
if not is_comment(child): return False
|
| 60 |
|
|
return True
|
| 61 |
|
|
|
| 62 |
840
|
aaronmk
|
##### Child nodes that are elements
|
| 63 |
455
|
aaronmk
|
|
| 64 |
21
|
aaronmk
|
class NodeElemIter:
|
| 65 |
|
|
def __init__(self, node): self.child = node.firstChild
|
| 66 |
|
|
|
| 67 |
|
|
def __iter__(self): return self
|
| 68 |
|
|
|
| 69 |
|
|
def curr(self):
|
| 70 |
|
|
while self.child != None:
|
| 71 |
298
|
aaronmk
|
if is_elem(self.child): return self.child
|
| 72 |
21
|
aaronmk
|
self.child = self.child.nextSibling
|
| 73 |
|
|
raise StopIteration
|
| 74 |
|
|
|
| 75 |
|
|
def next(self):
|
| 76 |
|
|
child = self.curr()
|
| 77 |
|
|
self.child = self.child.nextSibling
|
| 78 |
|
|
return child
|
| 79 |
|
|
|
| 80 |
|
|
def first_elem(node): return NodeElemIter(node).next()
|
| 81 |
|
|
|
| 82 |
450
|
aaronmk
|
def has_elems(node):
|
| 83 |
|
|
try: first_elem(node); return True
|
| 84 |
|
|
except StopIteration: return False
|
| 85 |
|
|
|
| 86 |
21
|
aaronmk
|
class NodeElemReverseIter:
|
| 87 |
|
|
def __init__(self, node): self.child = node.lastChild
|
| 88 |
|
|
|
| 89 |
|
|
def __iter__(self): return self
|
| 90 |
|
|
|
| 91 |
|
|
def curr(self):
|
| 92 |
|
|
while self.child != None:
|
| 93 |
298
|
aaronmk
|
if is_elem(self.child): return self.child
|
| 94 |
21
|
aaronmk
|
self.child = self.child.previousSibling
|
| 95 |
|
|
raise StopIteration
|
| 96 |
|
|
|
| 97 |
|
|
def next(self):
|
| 98 |
|
|
child = self.curr()
|
| 99 |
|
|
self.child = self.child.previousSibling
|
| 100 |
|
|
return child
|
| 101 |
|
|
|
| 102 |
|
|
def last_elem(node): return NodeElemReverseIter(node).next()
|
| 103 |
|
|
|
| 104 |
840
|
aaronmk
|
##### Parent nodes
|
| 105 |
|
|
|
| 106 |
1017
|
aaronmk
|
def parent(node):
|
| 107 |
999
|
aaronmk
|
'''Does not treat the document object as the root node's parent, since it's
|
| 108 |
|
|
not a true element node'''
|
| 109 |
1017
|
aaronmk
|
parent_ = node.parentNode
|
| 110 |
|
|
if parent_ != None and is_elem(parent_): return parent_
|
| 111 |
|
|
else: return None
|
| 112 |
|
|
|
| 113 |
|
|
class NodeParentIter:
|
| 114 |
|
|
'''See parent() for special treatment of root node.
|
| 115 |
|
|
Note that the first element returned is the current node, not its parent.'''
|
| 116 |
21
|
aaronmk
|
def __init__(self, node): self.node = node
|
| 117 |
|
|
|
| 118 |
|
|
def __iter__(self): return self
|
| 119 |
|
|
|
| 120 |
|
|
def curr(self):
|
| 121 |
1017
|
aaronmk
|
if self.node != None: return self.node
|
| 122 |
|
|
else: raise StopIteration
|
| 123 |
21
|
aaronmk
|
|
| 124 |
|
|
def next(self):
|
| 125 |
|
|
node = self.curr()
|
| 126 |
1017
|
aaronmk
|
self.node = parent(self.node)
|
| 127 |
21
|
aaronmk
|
return node
|
| 128 |
|
|
|
| 129 |
840
|
aaronmk
|
##### Element nodes containing text
|
| 130 |
661
|
aaronmk
|
|
| 131 |
298
|
aaronmk
|
def is_text_node(node): return node.nodeType == Node.TEXT_NODE
|
| 132 |
|
|
|
| 133 |
301
|
aaronmk
|
def is_text(node): return has_one_child(node) and is_text_node(node.firstChild)
|
| 134 |
21
|
aaronmk
|
|
| 135 |
|
|
def value(node):
|
| 136 |
29
|
aaronmk
|
if node.firstChild != None: return node.firstChild.nodeValue
|
| 137 |
21
|
aaronmk
|
else: return node.nodeValue
|
| 138 |
|
|
|
| 139 |
143
|
aaronmk
|
def set_value(node, value):
|
| 140 |
298
|
aaronmk
|
if is_elem(node): node.appendChild(node.ownerDocument.createTextNode(value))
|
| 141 |
22
|
aaronmk
|
else: node.nodeValue = value
|
| 142 |
|
|
|
| 143 |
86
|
aaronmk
|
class NodeTextEntryIter:
|
| 144 |
|
|
def __init__(self, node): self.iter_ = NodeElemIter(node)
|
| 145 |
|
|
|
| 146 |
|
|
def __iter__(self): return self
|
| 147 |
|
|
|
| 148 |
1176
|
aaronmk
|
def next(self):
|
| 149 |
|
|
util.skip(self.iter_, is_empty)
|
| 150 |
|
|
entry = self.iter_.next()
|
| 151 |
839
|
aaronmk
|
if is_text(entry): value_ = value(entry)
|
| 152 |
|
|
else:
|
| 153 |
|
|
assert has_one_child(entry) # TODO: convert to an exception
|
| 154 |
|
|
value_ = entry.firstChild
|
| 155 |
|
|
return (entry.tagName, value_)
|
| 156 |
86
|
aaronmk
|
|
| 157 |
792
|
aaronmk
|
def is_text_node_entry(val): return util.is_str(val[1])
|
| 158 |
|
|
|
| 159 |
|
|
class TextEntryOnlyIter(util.CheckedIter):
|
| 160 |
|
|
def __init__(self, iterable):
|
| 161 |
|
|
util.CheckedIter.__init__(self, is_text_node_entry, iterable)
|
| 162 |
|
|
|
| 163 |
840
|
aaronmk
|
##### Modifying/replacing a node
|
| 164 |
455
|
aaronmk
|
|
| 165 |
135
|
aaronmk
|
def set_child(node, name, value):
|
| 166 |
|
|
'''Note: does not remove any existing child of the same name'''
|
| 167 |
|
|
child = node.ownerDocument.createElement(name)
|
| 168 |
143
|
aaronmk
|
set_value(child, value)
|
| 169 |
135
|
aaronmk
|
node.appendChild(child)
|
| 170 |
|
|
|
| 171 |
435
|
aaronmk
|
def remove(node): node.parentNode.removeChild(node)
|
| 172 |
|
|
|
| 173 |
963
|
aaronmk
|
def replace(old, new):
|
| 174 |
|
|
'''@param new Node|None'''
|
| 175 |
|
|
if new == None: old.parentNode.removeChild(old)
|
| 176 |
|
|
else: old.parentNode.replaceChild(new, old) # note order reversed
|
| 177 |
86
|
aaronmk
|
|
| 178 |
757
|
aaronmk
|
def replace_with_text(node, new):
|
| 179 |
792
|
aaronmk
|
if util.is_str(new): new = node.ownerDocument.createTextNode(new)
|
| 180 |
757
|
aaronmk
|
replace(node, new)
|
| 181 |
86
|
aaronmk
|
|
| 182 |
840
|
aaronmk
|
##### Searching child nodes
|
| 183 |
455
|
aaronmk
|
|
| 184 |
22
|
aaronmk
|
def by_tag_name(node, name, last_only=False):
|
| 185 |
135
|
aaronmk
|
'''last_only optimization returns last matching node'''
|
| 186 |
22
|
aaronmk
|
children = []
|
| 187 |
888
|
aaronmk
|
if last_only: iter_ = NodeElemReverseIter(node)
|
| 188 |
|
|
else: iter_ = NodeElemIter(node)
|
| 189 |
|
|
for child in iter_:
|
| 190 |
22
|
aaronmk
|
if child.tagName == name:
|
| 191 |
|
|
children.append(child)
|
| 192 |
|
|
if last_only: break
|
| 193 |
|
|
return children
|
| 194 |
28
|
aaronmk
|
|
| 195 |
840
|
aaronmk
|
##### XML documents
|
| 196 |
455
|
aaronmk
|
|
| 197 |
133
|
aaronmk
|
def create_doc(root='_'):
|
| 198 |
303
|
aaronmk
|
return minidom.getDOMImplementation().createDocument(None, root, None)
|
| 199 |
133
|
aaronmk
|
|
| 200 |
840
|
aaronmk
|
##### Printing XML
|
| 201 |
455
|
aaronmk
|
|
| 202 |
304
|
aaronmk
|
prettyxml_config = dict(addindent=' ', newl='\n')
|
| 203 |
331
|
aaronmk
|
toprettyxml_config = prettyxml_config.copy()
|
| 204 |
|
|
util.rename_key(toprettyxml_config, 'addindent', 'indent')
|
| 205 |
304
|
aaronmk
|
|
| 206 |
840
|
aaronmk
|
##### minidom modifications
|
| 207 |
455
|
aaronmk
|
|
| 208 |
299
|
aaronmk
|
minidom._write_data = lambda writer, data: writer.write(escape(data))
|
| 209 |
73
|
aaronmk
|
|
| 210 |
305
|
aaronmk
|
minidom.Node.__iter__ = lambda self: NodeIter(self)
|
| 211 |
|
|
|
| 212 |
857
|
aaronmk
|
def __Node_str(self):
|
| 213 |
860
|
aaronmk
|
return strings.remove_extra_newl(self.toprettyxml(**toprettyxml_config))
|
| 214 |
796
|
aaronmk
|
minidom.Node.__str__ = __Node_str
|
| 215 |
|
|
minidom.Node.__repr__ = __Node_str
|
| 216 |
|
|
minidom.Element.__repr__ = __Node_str
|
| 217 |
301
|
aaronmk
|
|
| 218 |
888
|
aaronmk
|
def __Attr_str(self): return self.name+'="'+escape(self.value)+'"'
|
| 219 |
|
|
minidom.Attr.__str__ = __Attr_str
|
| 220 |
|
|
minidom.Attr.__repr__ = __Attr_str
|
| 221 |
|
|
|
| 222 |
315
|
aaronmk
|
minidom.Node.pop = lambda self: self.removeChild(self.lastChild)
|
| 223 |
|
|
|
| 224 |
|
|
def __Node_clear(self):
|
| 225 |
|
|
while not is_empty(self): self.pop()
|
| 226 |
|
|
minidom.Node.clear = __Node_clear
|
| 227 |
|
|
|
| 228 |
301
|
aaronmk
|
def __Element_write_opening(self, writer, indent='', addindent='', newl=''):
|
| 229 |
298
|
aaronmk
|
writer.write(indent+'<'+self.tagName)
|
| 230 |
|
|
for attr_idx in xrange(self.attributes.length):
|
| 231 |
891
|
aaronmk
|
writer.write(' '+str(self.attributes.item(attr_idx)))
|
| 232 |
298
|
aaronmk
|
writer.write('>'+newl)
|
| 233 |
301
|
aaronmk
|
minidom.Element.write_opening = __Element_write_opening
|
| 234 |
73
|
aaronmk
|
|
| 235 |
301
|
aaronmk
|
def __Element_write_closing(self, writer, indent='', addindent='', newl=''):
|
| 236 |
298
|
aaronmk
|
writer.write('</'+self.tagName+'>'+newl)
|
| 237 |
301
|
aaronmk
|
minidom.Element.write_closing = __Element_write_closing
|
| 238 |
298
|
aaronmk
|
|
| 239 |
299
|
aaronmk
|
_writexml_orig = minidom.Element.writexml
|
| 240 |
301
|
aaronmk
|
def __Element_writexml(self, writer, indent='', addindent='', newl=''):
|
| 241 |
306
|
aaronmk
|
if isinstance(indent, int): indent = addindent*indent
|
| 242 |
774
|
aaronmk
|
if is_simple(self):
|
| 243 |
|
|
writer.write(indent)
|
| 244 |
|
|
_writexml_orig(self, writer)
|
| 245 |
|
|
writer.write(newl)
|
| 246 |
28
|
aaronmk
|
else: _writexml_orig(self, writer, indent, addindent, newl)
|
| 247 |
301
|
aaronmk
|
minidom.Element.writexml = __Element_writexml
|
| 248 |
28
|
aaronmk
|
|
| 249 |
301
|
aaronmk
|
def __Document_write_opening(self, writer, indent='', addindent='', newl='',
|
| 250 |
|
|
encoding=None):
|
| 251 |
|
|
xmlDecl = '<?xml version="1.0" '
|
| 252 |
|
|
if encoding != None: xmlDecl += 'encoding="'+escape(encoding)+'"'
|
| 253 |
|
|
xmlDecl += '?>'+newl
|
| 254 |
|
|
writer.write(xmlDecl)
|
| 255 |
|
|
assert has_one_child(self)
|
| 256 |
|
|
assert is_elem(self.firstChild)
|
| 257 |
|
|
self.firstChild.write_opening(writer, indent, addindent, newl)
|
| 258 |
|
|
minidom.Document.write_opening = __Document_write_opening
|
| 259 |
|
|
|
| 260 |
|
|
def __Document_write_closing(self, writer, indent='', addindent='', newl=''):
|
| 261 |
|
|
self.firstChild.write_closing(writer, indent, addindent, newl)
|
| 262 |
|
|
minidom.Document.write_closing = __Document_write_closing
|
