Searched refs:ch_map (Results 1 – 1 of 1) sorted by relevance
195 def pack(self, node_list, ch_map, use_node=False): argument202 succ = sorted([ch_map[c] + edge_start for c in node.succ.keys()])226 size += max(ch_map.values()) + 1230 def bfs(self, ch_map): argument238 assert ch_map[c] not in mapped, 'duplicate edge ' + node.str + ' ' + hex(ord(c))239 mapped[ch_map[c]] = next286 ch_map = {'.': 0}300 ch_map[c] = i + 1301 return ch_map320 def generate_alphabet(ch_map): argument[all …]