Spaces:
Runtime error
Runtime error
File size: 9,089 Bytes
af382f0 |
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 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 |
# -*- coding: utf-8 -*-
import copy
from typing import List, Tuple, Any
import re
class Item:
def __init__(self, value, start, end):
self.value = value
self.start = start
self.end = end
class TreeNode:
def __init__(self, item:Item):
self.item = item
self.state = 0
self.sons = []
self.parent = None
class Tree:
def __init__(self, item: Item, text:str):
self.root = TreeNode(item)
self.text = text
self.first_label = True
def isNodeIn(self, node1:TreeNode, node2:TreeNode):
if node1.item.start > node2.item.start and node1.item.end < node2.item.end:
return True
return False
def insert(self, new_node: TreeNode, current_node: TreeNode):
if len(current_node.sons) == 0:
if self.isNodeIn(new_node, current_node):
current_node.sons.append(new_node)
new_node.parent = current_node
return True
else:
return False
for son in current_node.sons:
done = self.insert(new_node, son)
if done:
return True
if self.isNodeIn(new_node, current_node):
current_node.sons.append(new_node)
new_node.parent = current_node
return True
else:
return False
def node_count(self):
cnt = 0
if self.root is not None:
cnt = 1
sons = self.root.sons
while len(sons) > 0:
current: TreeNode = sons.pop()
cnt += 1
if len(current.sons) > 0:
sons.extend(current.sons)
return cnt
def reset_state(self, reset_value, current_node:TreeNode=None):
if current_node == None:
current_node = self.root
current_node.state = reset_value
for i in range(len(current_node.sons)):
self.reset_state(reset_value, current_node=current_node.sons[i])
def get_node_content(self, node:TreeNode):
value_length = len(node.item.value)
start = node.item.start
end = node.item.end
return self.text[
start+value_length+1:end-1
]
def build_dict(self, current_dict:dict, current_root:TreeNode, filter_value:list=None, mode:str="filter"):
assert mode.lower() in ["filter", "remain"], \
f"mode `{mode}` is not in ['filter', 'remain']"
if len(current_root.sons) == 0:
if filter_value is None or (mode.lower() == "remain" and current_root.state == 1):
return {current_root.item.value: self.get_node_content(current_root)}
if mode.lower() == "filter" and current_root.item.value in filter_value:
return None
elif mode.lower() == "filter" and current_root.item.value not in filter_value:
return {current_root.item.value: self.get_node_content(current_root)}
elif mode.lower() == "remain" and current_root.item.value in filter_value:
return {current_root.item.value: self.get_node_content(current_root)}
elif mode.lower() == "remain" and current_root.item.value not in filter_value:
return None
else:
if filter_value is not None:
if mode.lower() == "filter" and current_root.item.value in filter_value:
return None
if self.first_label:
if mode.lower() == "remain" and current_root.item.value not in filter_value and current_root.item.value != "root" and current_root.state==0:
return None
current_dict[current_root.item.value] = {}
for i in range(len(current_root.sons)):
if mode.lower() == "remain":
if current_root.parent is not None and current_root.parent.state == 1:
current_root.state = 1
if current_root.item.value in filter_value:
current_root.state = 1
current_root.sons[i].state = 1
if current_root.state == 1:
current_root.sons[i].state = 1
if current_root.sons[i].item.value in filter_value:
current_root.sons[i].state = 1
item = self.build_dict(current_dict[current_root.item.value], current_root.sons[i], filter_value, mode)
if isinstance(item, dict):
current_dict[current_root.item.value].update(item)
def build_xml(self, current_item: list, current_root:TreeNode, filter_value:list=None, mode:str="filter"):
assert mode.lower() in ["filter", "remain"], \
f"mode `{mode}` is not in ['filter', 'remain']"
if len(current_root.sons) == 0:
if filter_value is None or (mode.lower() == "remain" and current_root.state == 1):
return f"<{current_root.item.value}>{self.get_node_content(current_root)}</{current_root.item.value}>"
if mode.lower() == "filter" and current_root.item.value in filter_value:
return None
elif mode.lower() == "filter" and current_root.item.value not in filter_value:
return f"<{current_root.item.value}>{self.get_node_content(current_root)}</{current_root.item.value}>"
elif mode.lower() == "remain" and current_root.item.value in filter_value:
return f"<{current_root.item.value}>{self.get_node_content(current_root)}</{current_root.item.value}>"
elif mode.lower() == "remain" and current_root.item.value not in filter_value:
return None
else:
if filter_value is not None:
if mode.lower() == "filter" and current_root.item.value in filter_value:
return None
if self.first_label:
if mode.lower() == "remain" and current_root.item.value not in filter_value and current_root.item.value != "root" and current_root.state==0:
return None
current_item.append(f"<{current_root.item.value}>")
for i in range(len(current_root.sons)):
if mode.lower() == "remain":
if current_root.parent is not None and current_root.parent.state == 1:
current_root.state = 1
if current_root.item.value in filter_value:
current_root.state = 1
current_root.sons[i].state = 1
if current_root.state == 1:
current_root.sons[i].state = 1
if current_root.sons[i].item.value in filter_value:
current_root.sons[i].state = 1
item = self.build_xml(current_item, current_root.sons[i], filter_value, mode)
if isinstance(item, str):
current_item.append(f"{item}")
current_item.append(f"</{current_root.item.value}>")
def extract_tag_names(text: str, sort:bool=True)->List[Tuple[str, int, int]]:
pattern = r'<([^<>]+)>'
matches = re.findall(pattern, text)
pos = []
start = 0
for item in matches:
pos.append(
text[start:].find(item)+start
)
start = text[start:].find(item)+start + len(item)
stack_item = []
stack_pos = []
answer = []
for idx, item in enumerate(matches):
if item[0] != '/':
stack_item.append(item)
stack_pos.append(pos[idx])
else:
end_pos = pos[idx]
if item[1:] in stack_item:
while stack_item[-1] != item[1:]:
stack_item.pop()
stack_pos.pop()
answer.append((stack_item.pop(), stack_pos.pop(), end_pos))
if sort:
return sorted(answer, key=lambda x: x[1])
return answer
def construct_tree(text, add_root_label:bool=True):
if add_root_label:
print("root label is added!")
text = f"<root>\n{text}\n</root>"
data = extract_tag_names(text)
tree = Tree(Item(*data[0]), text)
nodes_list = []
for d in data[1:]:
new_node = TreeNode(
Item(*d)
)
nodes_list.append(new_node)
for i in range(len(nodes_list)):
tree.insert(
new_node=nodes_list[i],
current_node=tree.root
)
return tree
def tree2dict(tree:Tree, filter:list=None, mode="filter"):
answer = {}
tree.reset_state(0)
tree.build_dict(answer, tree.root, filter, mode)
return answer
def tree2xml(tree, filter:list=None, mode="filter"):
answer = []
tree.reset_state(0)
tree.build_xml(answer, tree.root, filter, mode)
return "\n".join(answer)
|