| 7 | |
| 8 | |
| 9 | class _NodeInfo: |
| 10 | __slots__ = "node", "npredecessors", "successors" |
| 11 | |
| 12 | def __init__(self, node): |
| 13 | # The node this class is augmenting. |
| 14 | self.node = node |
| 15 | |
| 16 | # Number of predecessors, generally >= 0. When this value falls to 0, |
| 17 | # and is returned by get_ready(), this is set to _NODE_OUT and when the |
| 18 | # node is marked done by a call to done(), set to _NODE_DONE. |
| 19 | self.npredecessors = 0 |
| 20 | |
| 21 | # List of successor nodes. The list can contain duplicated elements as |
| 22 | # long as they're all reflected in the successor's npredecessors attribute. |
| 23 | self.successors = [] |
| 24 | |
| 25 | |
| 26 | class CycleError(ValueError): |
no outgoing calls
no test coverage detected
searching dependent graphs…