| 331 | |
| 332 | |
| 333 | class TaskRef: |
| 334 | val: KeyType |
| 335 | __slots__ = ("key",) |
| 336 | |
| 337 | def __init__(self, key: KeyType): |
| 338 | self.key = key |
| 339 | |
| 340 | def __str__(self): |
| 341 | return str(self.key) |
| 342 | |
| 343 | def __repr__(self): |
| 344 | return f"{type(self).__name__}({self.key!r})" |
| 345 | |
| 346 | def __hash__(self) -> int: |
| 347 | return hash(self.key) |
| 348 | |
| 349 | def __eq__(self, value: object) -> bool: |
| 350 | if not isinstance(value, TaskRef): |
| 351 | return False |
| 352 | return self.key == value.key |
| 353 | |
| 354 | def __reduce__(self): |
| 355 | return TaskRef, (self.key,) |
| 356 | |
| 357 | def substitute(self, subs: dict, key: KeyType | None = None) -> TaskRef | GraphNode: |
| 358 | if self.key in subs: |
| 359 | val = subs[self.key] |
| 360 | if isinstance(val, GraphNode): |
| 361 | return val.substitute({}, key=self.key) |
| 362 | elif isinstance(val, TaskRef): |
| 363 | return val |
| 364 | else: |
| 365 | return TaskRef(val) |
| 366 | return self |
| 367 | |
| 368 | |
| 369 | def _is_dask_future(obj: object) -> bool: |
no outgoing calls
searching dependent graphs…