A source node that lives next to your booleans (typically inside a
subgraph) and relays them to Group/Node Controllers elsewhere. It reads
booleans in its own graph (always reliable) and delivers the result the
safe way, sidestepping the flaky cross-boundary boolean reads.
Fully automatic: each tick it walks its patch output to discover the
Controllers it feeds - up out of its subgraph, across at the root, and
down into sibling/nested subgraphs - pulls their target labels, and
auto-creates one boolean input per target (no manual signal naming). It
resolves those booleans locally and pushes the result onto every
Controller on the lane, so one Wired Controller fans out to many
(Group and Node, mixed). A patched signal governs its target and
overrides ALL, just like a direct boolean; a target's own direct boolean
wins for that one target.
Two bindings (wire tried first, channel is the fallback):
- wire: WiredController `patch` output -> Controller `patch` input,
followed across boundaries by a robust output walk (link map +
floating links + reverse output-proxy lookup; host matched by id and
identity; descends into sibling subgraphs).
- channel: name-keyed global registry, no traversal, any nesting depth.
Controllers gain a `patch` input and a `channel` field (both inert until
connected). The bus socket is named "patch" (SWITCHBOARD_PATCH) to fit
the Switchboard theme; older saved nodes are normalised on load. Boolean
resolution refactored into shared module functions. Adds a Wired
Controller diagnostics menu. README + example_workflows notes updated.
