A Python parser for MediaWiki wikicode https://mwparserfromhell.readthedocs.io/
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 

244 line
9.2 KiB

  1. # -*- coding: utf-8 -*-
  2. #
  3. # Copyright (C) 2012 Ben Kurtovic <ben.kurtovic@verizon.net>
  4. #
  5. # Permission is hereby granted, free of charge, to any person obtaining a copy
  6. # of this software and associated documentation files (the "Software"), to deal
  7. # in the Software without restriction, including without limitation the rights
  8. # to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  9. # copies of the Software, and to permit persons to whom the Software is
  10. # furnished to do so, subject to the following conditions:
  11. #
  12. # The above copyright notice and this permission notice shall be included in
  13. # all copies or substantial portions of the Software.
  14. #
  15. # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16. # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17. # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  18. # AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19. # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  20. # OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  21. # SOFTWARE.
  22. import re
  23. from mwparserfromhell.nodes import (
  24. Heading, HTMLEntity, Node, Tag, Template, Text
  25. )
  26. from mwparserfromhell.string_mixin import StringMixIn
  27. from mwparserfromhell.utils import parse_anything
  28. __all__ = ["Wikicode"]
  29. FLAGS = re.IGNORECASE | re.DOTALL | re.UNICODE
  30. class Wikicode(StringMixIn):
  31. def __init__(self, nodes):
  32. self._nodes = nodes
  33. def __unicode__(self):
  34. return "".join([unicode(node) for node in self.nodes])
  35. def _get_children(self, node):
  36. for context, child in node.__iternodes__(self._get_all_nodes):
  37. yield child
  38. def _get_context(self, node, obj):
  39. for context, child in node.__iternodes__(self._get_all_nodes):
  40. if child is obj:
  41. return context
  42. raise ValueError(obj)
  43. def _get_all_nodes(self, code):
  44. for node in code.nodes:
  45. for child in self._get_children(node):
  46. yield child
  47. def _is_equivalent(self, obj, node):
  48. if isinstance(obj, Node):
  49. if node is obj:
  50. return True
  51. else:
  52. if node == obj:
  53. return True
  54. return False
  55. def _contains(self, nodes, obj):
  56. if isinstance(obj, Node):
  57. for node in nodes:
  58. if node is obj:
  59. return True
  60. else:
  61. if obj in nodes:
  62. return True
  63. return False
  64. def _do_search(self, obj, recursive, callback, context, *args, **kwargs):
  65. if recursive:
  66. for i, node in enumerate(context.nodes):
  67. if self._is_equivalent(obj, node):
  68. return callback(context, i, *args, **kwargs)
  69. if self._contains(self._get_children(node), obj):
  70. context = self._get_context(node, obj)
  71. return self._do_search(obj, recursive, callback, context,
  72. *args, **kwargs)
  73. raise ValueError(obj)
  74. callback(context, self.index(obj, recursive=False), *args, **kwargs)
  75. def _get_tree(self, code, lines, marker=None, indent=0):
  76. def write(*args):
  77. if lines and lines[-1] is marker: # Continue from the last line
  78. lines.pop() # Remove the marker
  79. last = lines.pop()
  80. lines.append(last + " ".join(args))
  81. else:
  82. lines.append(" " * 6 * indent + " ".join(args))
  83. for node in code.nodes:
  84. if isinstance(node, Heading):
  85. write("=" * node.level)
  86. self._get_tree(node.title, lines, marker, indent + 1)
  87. write("=" * node.level)
  88. elif isinstance(node, Tag):
  89. tagnodes = node.tag.nodes
  90. if (not node.attrs and len(tagnodes) == 1 and
  91. isinstance(tagnodes[0], Text)):
  92. write("<" + unicode(tagnodes[0]) + ">")
  93. else:
  94. write("<")
  95. self._get_tree(node.tag, lines, marker, indent + 1)
  96. for attr in node.attrs:
  97. self._get_tree(attr.name, lines, marker, indent + 1)
  98. if not attr.value:
  99. continue
  100. write(" = ")
  101. lines.append(marker) # Continue from this line
  102. self._get_tree(attr.value, lines, marker, indent + 1)
  103. write(">")
  104. self._get_tree(node.contents, lines, marker, indent + 1)
  105. if len(tagnodes) == 1 and isinstance(tagnodes[0], Text):
  106. write("</" + unicode(tagnodes[0]) + ">")
  107. else:
  108. write("</")
  109. self._get_tree(node.tag, lines, marker, indent + 1)
  110. write(">")
  111. elif isinstance(node, Template):
  112. write("{{")
  113. self._get_tree(node.name, lines, marker, indent + 1)
  114. for param in node.params:
  115. write(" | ")
  116. lines.append(marker) # Continue from this line
  117. self._get_tree(param.name, lines, marker, indent + 1)
  118. write(" = ")
  119. lines.append(marker) # Continue from this line
  120. self._get_tree(param.value, lines, marker, indent + 1)
  121. write("}}")
  122. else:
  123. write(unicode(node))
  124. return lines
  125. @property
  126. def nodes(self):
  127. return self._nodes
  128. def get(self, index):
  129. return self.nodes[index]
  130. def set(self, index, value):
  131. nodes = parse_anything(value).nodes
  132. if len(nodes) > 1:
  133. raise ValueError("Cannot coerce multiple nodes into one index")
  134. if index >= len(self.nodes) or -1 * index > len(self.nodes):
  135. raise IndexError("List assignment index out of range")
  136. self.nodes.pop(index)
  137. if nodes:
  138. self.nodes[index] = nodes[0]
  139. def index(self, obj, recursive=False):
  140. if recursive:
  141. for i, node in enumerate(self.nodes):
  142. if self._contains(self._get_children(node), obj):
  143. return i
  144. raise ValueError(obj)
  145. for i, node in enumerate(self.nodes):
  146. if self._is_equivalent(obj, node):
  147. return i
  148. raise ValueError(obj)
  149. def insert(self, index, value):
  150. nodes = parse_anything(value).nodes
  151. for node in reversed(nodes):
  152. self.nodes.insert(index, node)
  153. def insert_before(self, obj, value, recursive=True):
  154. callback = lambda self, i, value: self.insert(i, value)
  155. self._do_search(obj, recursive, callback, self, value)
  156. def insert_after(self, obj, value, recursive=True):
  157. callback = lambda self, i, value: self.insert(i + 1, value)
  158. self._do_search(obj, recursive, callback, self, value)
  159. def replace(self, obj, value, recursive=True):
  160. def callback(self, i, value):
  161. self.nodes.pop(i)
  162. self.insert(i, value)
  163. self._do_search(obj, recursive, callback, self, value)
  164. def append(self, value):
  165. nodes = parse_anything(value).nodes
  166. for node in nodes:
  167. self.nodes.append(node)
  168. def remove(self, obj, recursive=True):
  169. callback = lambda self, i: self.nodes.pop(i)
  170. self._do_search(obj, recursive, callback, self)
  171. def ifilter(self, recursive=False, matches=None, flags=FLAGS,
  172. forcetype=None):
  173. if recursive:
  174. nodes = self._get_all_nodes(self)
  175. else:
  176. nodes = self.nodes
  177. for node in nodes:
  178. if not forcetype or isinstance(node, forcetype):
  179. if not matches or re.search(matches, unicode(node), flags):
  180. yield node
  181. def ifilter_templates(self, recursive=False, matches=None, flags=FLAGS):
  182. return self.filter(recursive, matches, flags, forcetype=Template)
  183. def ifilter_text(self, recursive=False, matches=None, flags=FLAGS):
  184. return self.filter(recursive, matches, flags, forcetype=Text)
  185. def filter(self, recursive=False, matches=None, flags=FLAGS,
  186. forcetype=None):
  187. return list(self.ifilter(recursive, matches, flags, forcetype))
  188. def filter_templates(self, recursive=False, matches=None, flags=FLAGS):
  189. return list(self.ifilter_templates(recursive, matches, flags))
  190. def filter_text(self, recursive=False, matches=None, flags=FLAGS):
  191. return list(self.ifilter_text(recursive, matches, flags))
  192. def strip_code(self, normalize=True, collapse=True):
  193. nodes = []
  194. for node in self.nodes:
  195. stripped = node.__strip__(normalize, collapse)
  196. if stripped:
  197. nodes.append(unicode(stripped))
  198. if collapse:
  199. stripped = u"".join(nodes).strip("\n")
  200. while "\n\n\n" in stripped:
  201. stripped = stripped.replace("\n\n\n", "\n\n")
  202. return stripped
  203. else:
  204. return u"".join(nodes)
  205. def get_tree(self):
  206. marker = object() # Random object we can find with certainty in a list
  207. return "\n".join(self._get_tree(self, [], marker))