Searched refs:ch_map (Results 1 – 1 of 1) sorted by relevance
191 def pack(self, node_list, ch_map, use_node=False): argument198 succ = sorted([ch_map[c] + edge_start for c in node.succ.keys()])222 size += max(ch_map.values()) + 1226 def bfs(self, ch_map): argument234 assert ch_map[c] not in mapped, 'duplicate edge ' + node.str + ' ' + hex(ord(c))235 mapped[ch_map[c]] = next281 ch_map = {'.': 0}291 ch_map[c] = i + 1292 return ch_map311 def generate_alphabet(ch_map): argument[all …]