Lines Matching refs:succ
52 self.succ = {}
65 self.succ = []
70 self.succ.append(None)
74 self.succ[self.last] = this
85 return result, self.succ[result]
94 self.first = self.succ[ix]
96 self.succ[self.pred[ix]] = self.succ[ix]
97 if self.succ[ix] is None:
100 self.pred[self.succ[ix]] = self.pred[ix]
183 if c not in t.succ:
187 t.succ[c] = new_node
188 t = t.succ[c]
198 succ = sorted([ch_map[c] + edge_start for c in node.succ.keys()])
199 if len(succ):
203 ix = edge_ix - succ[0]
205 all(edges.is_free(ix + s) for s in succ) and
220 for s in succ:
233 for c, next in node.succ.items():
255 for c in sorted(node.succ.keys()):
256 succ = node.succ[c]
257 s += ' ' + c + str(dedup_ix[succ.bfs_ix])
352 for c, next in node.succ.items():
