Lines Matching refs:succ
56 self.succ = {}
69 self.succ = []
74 self.succ.append(None)
78 self.succ[self.last] = this
89 return result, self.succ[result]
98 self.first = self.succ[ix]
100 self.succ[self.pred[ix]] = self.succ[ix]
101 if self.succ[ix] is None:
104 self.pred[self.succ[ix]] = self.pred[ix]
187 if c not in t.succ:
191 t.succ[c] = new_node
192 t = t.succ[c]
202 succ = sorted([ch_map[c] + edge_start for c in node.succ.keys()])
203 if len(succ):
207 ix = edge_ix - succ[0]
209 all(edges.is_free(ix + s) for s in succ) and
224 for s in succ:
237 for c, next in node.succ.items():
259 for c in sorted(node.succ.keys()):
260 succ = node.succ[c]
261 s += ' ' + c + str(dedup_ix[succ.bfs_ix])
360 for c, next in node.succ.items():
