History is kept by flow id: runs, cascades, rollups and events file the id in their flow column and nodes as <flow id>.<node>, the API answers flow plus flow_name and shows and takes nodes as <key>.<node>; events carry flow_id from the moment they are published; run queue items, the stage cache and cached curves keep ids and keys apart; endpoints, the brain graph, device bindings and search name the id to open
This commit is contained in:
@@ -25,7 +25,7 @@ import traceback
|
||||
from collections import Counter
|
||||
from collections.abc import Callable
|
||||
from contextlib import suppress
|
||||
from dataclasses import dataclass, field
|
||||
from dataclasses import dataclass, field, replace
|
||||
from enum import Enum
|
||||
from typing import Any, TypeGuard, cast
|
||||
|
||||
@@ -228,11 +228,13 @@ class RunContext:
|
||||
class Wiring:
|
||||
"""One published node and the qualified messages it is bound to."""
|
||||
|
||||
#: The flow's key, which the messages are qualified with, and its id.
|
||||
flow: str
|
||||
node: str
|
||||
type: str
|
||||
provides: list[str]
|
||||
requires: list[str]
|
||||
flow_id: str = ""
|
||||
|
||||
|
||||
#: Nothing held, as distinct from a node that yielded ``None``.
|
||||
@@ -977,10 +979,9 @@ class FlowController:
|
||||
async def reload_lib_users(self, ref: str) -> list[str]:
|
||||
"""Rebuild the flows running a shared node whose source has changed.
|
||||
|
||||
Returns their ids, which is what `usages` qualifies with.
|
||||
Returns their ids.
|
||||
"""
|
||||
usages = self.store.usages(ref, draft=False)
|
||||
flows = sorted({usage.split(".", 1)[0] for usage in usages})
|
||||
flows = self.store.lib_users(ref)
|
||||
for flow in flows:
|
||||
await self.reload_flow(flow)
|
||||
return flows
|
||||
@@ -1718,19 +1719,20 @@ class FlowController:
|
||||
)
|
||||
if provides or requires:
|
||||
index.append(
|
||||
Wiring(other.name, node.id, node.type, provides, requires)
|
||||
Wiring(
|
||||
other.name, node.id, node.type, provides, requires, other.id
|
||||
)
|
||||
)
|
||||
self._wiring_cache = (revision, index)
|
||||
return index
|
||||
|
||||
def cross_flow_nodes(
|
||||
self, flow: str
|
||||
) -> list[tuple[str, str, list[str], list[str]]]:
|
||||
def cross_flow_nodes(self, flow: str) -> list[Wiring]:
|
||||
"""Nodes in other flows on the far side of a dotted message name.
|
||||
|
||||
Returns ``(flow, node id, messages of `flow` it provides, ones it
|
||||
requires)``. This is what link-in and link-out mean: the wiring is
|
||||
already real — the canvas simply had no way to draw the other end.
|
||||
Returns the far node's `Wiring`, narrowed to the messages of `flow` it
|
||||
provides and requires. This is what link-in and link-out mean: the
|
||||
wiring is already real — the canvas simply had no way to draw the
|
||||
other end. *flow* is a key.
|
||||
"""
|
||||
prefix = f"{flow}."
|
||||
found = []
|
||||
@@ -1740,7 +1742,7 @@ class FlowController:
|
||||
provides = [name for name in entry.provides if name.startswith(prefix)]
|
||||
requires = [name for name in entry.requires if name.startswith(prefix)]
|
||||
if provides or requires:
|
||||
found.append((entry.flow, entry.node, provides, requires))
|
||||
found.append(replace(entry, provides=provides, requires=requires))
|
||||
return found
|
||||
|
||||
def message_node(
|
||||
@@ -1818,6 +1820,7 @@ class FlowController:
|
||||
group.members.append(member)
|
||||
if flow.name not in group.flows:
|
||||
group.flows.append(flow.name)
|
||||
group.flow_ids.append(flow.id)
|
||||
# A merged neuron stands for several nodes, so one of them being
|
||||
# unable to run is enough to mark it; the first reason wins.
|
||||
if group.issue is None:
|
||||
|
||||
Reference in New Issue
Block a user