@niscorp/nova 0.1.0 → 0.1.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/ACTION_DOCS.md +121 -30
- package/ADAPTER.md +167 -12
- package/CHANGELOG.md +19 -0
- package/DESIGN.md +45 -22
- package/I18N_DOCS.md +4 -4
- package/LAYOUT_DOCS.md +55 -14
- package/REACT_DOCS.md +52 -16
- package/README.md +54 -19
- package/SHELL_DOCS.md +136 -16
- package/TERMINAL_DOCS.md +13 -7
- package/dist/adapters/dom/components/index.d.cts +2 -2
- package/dist/adapters/dom/components/index.d.ts +2 -2
- package/dist/adapters/dom/index.cjs +351 -53
- package/dist/adapters/dom/index.cjs.map +1 -1
- package/dist/adapters/dom/index.d.cts +4 -2
- package/dist/adapters/dom/index.d.ts +4 -2
- package/dist/adapters/dom/index.js +2 -2
- package/dist/adapters/dom/server.cjs +356 -55
- package/dist/adapters/dom/server.cjs.map +1 -1
- package/dist/adapters/dom/server.d.cts +2 -2
- package/dist/adapters/dom/server.d.ts +2 -2
- package/dist/adapters/dom/server.js +7 -4
- package/dist/adapters/dom/server.js.map +1 -1
- package/dist/adapters/react/components/index.d.cts +4 -4
- package/dist/adapters/react/components/index.d.ts +4 -4
- package/dist/adapters/react/index.d.cts +4 -4
- package/dist/adapters/react/index.d.ts +4 -4
- package/dist/adapters/tty/components/index.d.cts +2 -2
- package/dist/adapters/tty/components/index.d.ts +2 -2
- package/dist/adapters/tty/index.d.cts +2 -2
- package/dist/adapters/tty/index.d.ts +2 -2
- package/dist/adapters/vue/components/index.d.cts +6 -6
- package/dist/adapters/vue/components/index.d.ts +6 -6
- package/dist/adapters/vue/index.d.cts +4 -4
- package/dist/adapters/vue/index.d.ts +4 -4
- package/dist/adapters/vue/index.js +1 -1
- package/dist/agent/index.d.cts +2 -2
- package/dist/agent/index.d.ts +2 -2
- package/dist/{chunk-7B3RDENH.js → chunk-6N4WRC5V.js} +9 -4
- package/dist/chunk-6N4WRC5V.js.map +1 -0
- package/dist/chunk-FQAJ24KA.js +408 -0
- package/dist/chunk-FQAJ24KA.js.map +1 -0
- package/dist/devtools/index.d.cts +2 -2
- package/dist/devtools/index.d.ts +2 -2
- package/dist/i18n/index.d.cts +2 -2
- package/dist/i18n/index.d.ts +2 -2
- package/dist/index.cjs +8 -2
- package/dist/index.cjs.map +1 -1
- package/dist/index.d.cts +5 -5
- package/dist/index.d.ts +5 -5
- package/dist/index.js +2 -2
- package/dist/{palette-CP0wd3bE.d.ts → palette-Mx7XHYC6.d.ts} +1 -1
- package/dist/{palette-lm0bU9i5.d.cts → palette-wbJB_svk.d.cts} +1 -1
- package/dist/reflect/index.d.cts +2 -2
- package/dist/reflect/index.d.ts +2 -2
- package/dist/{types-DdltMfw7.d.ts → types-B-rjaUX0.d.ts} +1 -1
- package/dist/{types-Boh9ckdG.d.ts → types-BB9RXel5.d.ts} +1 -1
- package/dist/{types-De0KpxfI.d.cts → types-BLVRduoz.d.cts} +11 -1
- package/dist/{types-DhHL0twe.d.ts → types-B_nOtkyt.d.ts} +1 -1
- package/dist/{types-Brc7v_pS.d.ts → types-DE77Jl2W.d.ts} +11 -1
- package/dist/{types-Dv6JLmgo.d.cts → types-PDXOkvtK.d.cts} +1 -1
- package/dist/{types-Q80YtOQt.d.cts → types-mRKXqZPX.d.cts} +1 -1
- package/dist/{types-ByNSwtUV.d.cts → types-uk19d6KC.d.cts} +1 -1
- package/package.json +7 -10
- package/dist/chunk-7B3RDENH.js.map +0 -1
- package/dist/chunk-EG2RUXJN.js +0 -266
- package/dist/chunk-EG2RUXJN.js.map +0 -1
- package/dist/chunk-I5D2R5UA.js +0 -753
- package/dist/chunk-I5D2R5UA.js.map +0 -1
- package/dist/chunk-LA3BSEMX.js +0 -1905
- package/dist/chunk-LA3BSEMX.js.map +0 -1
- package/dist/chunk-OAMC6R6E.js +0 -121
- package/dist/chunk-OAMC6R6E.js.map +0 -1
- package/dist/primitive-props-CGoJvmcH.d.cts +0 -100
- package/dist/primitive-props-CGoJvmcH.d.ts +0 -100
package/dist/chunk-EG2RUXJN.js
DELETED
|
@@ -1,266 +0,0 @@
|
|
|
1
|
-
import { collectChannels, auditAction } from './chunk-RQB4PRPV.js';
|
|
2
|
-
|
|
3
|
-
// src/reflect/walk.ts
|
|
4
|
-
var isRecord = (value) => value !== null && typeof value === "object" && !Array.isArray(value);
|
|
5
|
-
var walkNodes = (value, visit) => {
|
|
6
|
-
if (Array.isArray(value)) {
|
|
7
|
-
for (const item of value) walkNodes(item, visit);
|
|
8
|
-
return;
|
|
9
|
-
}
|
|
10
|
-
if (!isRecord(value)) return;
|
|
11
|
-
visit(value);
|
|
12
|
-
for (const inner of Object.values(value)) walkNodes(inner, visit);
|
|
13
|
-
};
|
|
14
|
-
var componentsOf = (value) => {
|
|
15
|
-
const out = /* @__PURE__ */ new Set();
|
|
16
|
-
walkNodes(value, (record) => {
|
|
17
|
-
if (typeof record["component"] === "string") out.add(record["component"]);
|
|
18
|
-
});
|
|
19
|
-
return out;
|
|
20
|
-
};
|
|
21
|
-
var refsOf = (value) => {
|
|
22
|
-
const out = /* @__PURE__ */ new Set();
|
|
23
|
-
walkNodes(value, (record) => {
|
|
24
|
-
if (record["component"] === void 0 || !isRecord(record["props"])) return;
|
|
25
|
-
walkNodes(record["props"], (props) => {
|
|
26
|
-
for (const [key, propValue] of Object.entries(props)) {
|
|
27
|
-
if ((key === "ref" || key.endsWith("Ref")) && typeof propValue === "string" && propValue !== "") out.add(propValue);
|
|
28
|
-
}
|
|
29
|
-
});
|
|
30
|
-
});
|
|
31
|
-
return out;
|
|
32
|
-
};
|
|
33
|
-
var loopVarsOf = (value) => {
|
|
34
|
-
const out = /* @__PURE__ */ new Set();
|
|
35
|
-
walkNodes(value, (record) => {
|
|
36
|
-
if (typeof record["as"] === "string" && record["for"] !== void 0) out.add(record["as"]);
|
|
37
|
-
});
|
|
38
|
-
return out;
|
|
39
|
-
};
|
|
40
|
-
|
|
41
|
-
// src/reflect/audit.ts
|
|
42
|
-
var classifyAudit = (issue, definition) => {
|
|
43
|
-
const layout = typeof definition.layout === "object" ? definition.layout : void 0;
|
|
44
|
-
const bind = issue.match(/binds "\$\.([\w.]+)"/);
|
|
45
|
-
if (bind !== null) {
|
|
46
|
-
const root = (bind[1] ?? "").split(".")[0] ?? "";
|
|
47
|
-
if (root === "index" || root === "items") {
|
|
48
|
-
return { kind: "info", tag: "loop scope", reason: `\`${root}\` is a renderer-reserved loop variable` };
|
|
49
|
-
}
|
|
50
|
-
if (loopVarsOf(layout).has(root)) {
|
|
51
|
-
return { kind: "info", tag: "loop var", reason: `\`${root}\` is a loop \`as:\` variable \u2014 in scope at runtime` };
|
|
52
|
-
}
|
|
53
|
-
}
|
|
54
|
-
const ref = issue.match(/ref "([^"]+)"/);
|
|
55
|
-
if (ref !== null && issue.includes("listens") && refsOf(layout).has(ref[1] ?? "")) {
|
|
56
|
-
return { kind: "info", tag: "prop ref", reason: "dispatched by a component from a props value (e.g. Table rowRef / cell.ref)" };
|
|
57
|
-
}
|
|
58
|
-
if (issue.includes("{{")) {
|
|
59
|
-
return { kind: "info", tag: "template", reason: "target resolves from data at runtime \u2014 statically unknowable" };
|
|
60
|
-
}
|
|
61
|
-
return { kind: "address" };
|
|
62
|
-
};
|
|
63
|
-
var auditCatalog = (definitions) => {
|
|
64
|
-
const defs = Array.isArray(definitions) ? [...definitions] : Object.values(definitions);
|
|
65
|
-
const catalog = defs.map((definition) => ({ id: definition.id, ...definition.input !== void 0 ? { input: definition.input } : {} }));
|
|
66
|
-
const channels = [
|
|
67
|
-
...new Set(
|
|
68
|
-
defs.flatMap((definition) => {
|
|
69
|
-
const usage = collectChannels(definition);
|
|
70
|
-
return [...usage.emits, ...usage.listens];
|
|
71
|
-
})
|
|
72
|
-
)
|
|
73
|
-
];
|
|
74
|
-
return defs.map((definition) => {
|
|
75
|
-
const issues = auditAction(definition, { catalog, channels }).issues.map((issue) => ({ issue, ...classifyAudit(issue, definition) }));
|
|
76
|
-
issues.sort((a, b) => Number(a.kind === "info") - Number(b.kind === "info"));
|
|
77
|
-
return { id: definition.id, address: issues.filter((issue) => issue.kind === "address").length, issues };
|
|
78
|
-
}).filter((row) => row.issues.length > 0).sort((a, b) => b.address - a.address);
|
|
79
|
-
};
|
|
80
|
-
|
|
81
|
-
// src/reflect/shell.ts
|
|
82
|
-
var snapshotShell = (shell, exclude = []) => {
|
|
83
|
-
const state = shell.getState();
|
|
84
|
-
const canvases = Object.values(state.canvases).filter((canvas) => !exclude.includes(canvas.id)).map((canvas) => ({
|
|
85
|
-
id: canvas.id,
|
|
86
|
-
depth: canvas.stack.length,
|
|
87
|
-
items: [...canvas.stack].reverse().map((instance) => ({
|
|
88
|
-
definitionId: instance.definitionId,
|
|
89
|
-
instanceId: instance.id,
|
|
90
|
-
status: instance.status,
|
|
91
|
-
active: instance.id === canvas.active?.id
|
|
92
|
-
}))
|
|
93
|
-
}));
|
|
94
|
-
return { canvases, layouts: shell.layoutStore.list(), components: shell.registry.list() };
|
|
95
|
-
};
|
|
96
|
-
var compact = (value, over, head) => {
|
|
97
|
-
if (Array.isArray(value)) {
|
|
98
|
-
return over === 0 || value.length <= over ? value.map((item) => compact(item, over, head)) : [...value.slice(0, head).map((item) => compact(item, over, head)), `\u2026${value.length - head} more`];
|
|
99
|
-
}
|
|
100
|
-
if (value === null || typeof value !== "object") return value;
|
|
101
|
-
const out = {};
|
|
102
|
-
for (const [key, inner] of Object.entries(value)) out[key] = compact(inner, over, head);
|
|
103
|
-
return out;
|
|
104
|
-
};
|
|
105
|
-
var describeShell = (shell, options = {}) => {
|
|
106
|
-
const { only, mark, collapseOver = 5, head = 3, clean } = options;
|
|
107
|
-
const lines = [];
|
|
108
|
-
for (const [canvasId, canvas] of Object.entries(shell.getState().canvases)) {
|
|
109
|
-
if (only !== void 0 && !only.includes(canvasId)) continue;
|
|
110
|
-
if (canvas.active === void 0) {
|
|
111
|
-
lines.push(` ${canvasId}: (empty)`);
|
|
112
|
-
continue;
|
|
113
|
-
}
|
|
114
|
-
lines.push(` ${canvasId}: ${canvas.stack.map((item, index) => `${item.definitionId}${index === canvas.stack.length - 1 ? "*" : ""}`).join(" \u203A ")}`);
|
|
115
|
-
for (const item of canvas.stack) {
|
|
116
|
-
const runtime = shell.getRuntime(item.id);
|
|
117
|
-
const note = mark?.(item.id);
|
|
118
|
-
const data = runtime === void 0 ? void 0 : (clean ?? ((value) => value))(runtime.getData());
|
|
119
|
-
lines.push(` ${item.definitionId}${note === void 0 ? "" : ` ${note}`} data: ${data === void 0 ? "{}" : JSON.stringify(compact(data, collapseOver, head))}`);
|
|
120
|
-
}
|
|
121
|
-
}
|
|
122
|
-
return lines.join("\n");
|
|
123
|
-
};
|
|
124
|
-
var describeInstance = (shell, instanceId) => {
|
|
125
|
-
const runtime = shell.getRuntime(instanceId);
|
|
126
|
-
if (runtime === void 0) return void 0;
|
|
127
|
-
const definition = runtime.definition;
|
|
128
|
-
const layout = definition.layout;
|
|
129
|
-
const layoutNode = typeof layout === "string" ? shell.layoutStore.get(layout) : layout;
|
|
130
|
-
const issues = auditAction(definition).issues.map((issue) => ({ issue, ...classifyAudit(issue, definition) }));
|
|
131
|
-
return {
|
|
132
|
-
id: definition.id,
|
|
133
|
-
instanceId,
|
|
134
|
-
canvasId: runtime.instance.canvasId,
|
|
135
|
-
status: runtime.instance.status,
|
|
136
|
-
title: definition.title ?? "",
|
|
137
|
-
data: runtime.getData(),
|
|
138
|
-
endpoints: Object.entries(definition.endpoints ?? {}).map(([name, config]) => ({ name, config })),
|
|
139
|
-
triggers: definition.triggers ?? [],
|
|
140
|
-
lifecycle: definition.lifecycle ?? {},
|
|
141
|
-
layoutKind: typeof layout === "string" ? "store" : "inline",
|
|
142
|
-
layout: layoutNode,
|
|
143
|
-
input: definition.input,
|
|
144
|
-
issues
|
|
145
|
-
};
|
|
146
|
-
};
|
|
147
|
-
|
|
148
|
-
// src/reflect/graph.ts
|
|
149
|
-
var navTargetsOf = (definition) => {
|
|
150
|
-
const out = /* @__PURE__ */ new Set();
|
|
151
|
-
const scan = (value) => walkNodes(value, (record) => {
|
|
152
|
-
for (const key of ["push", "replace", "resetTo"]) {
|
|
153
|
-
const target = record[key];
|
|
154
|
-
if (isRecord(target) && typeof target["action"] === "string") out.add(target["action"]);
|
|
155
|
-
}
|
|
156
|
-
});
|
|
157
|
-
scan(definition.triggers ?? []);
|
|
158
|
-
scan(definition.lifecycle ?? {});
|
|
159
|
-
return [...out].sort();
|
|
160
|
-
};
|
|
161
|
-
var actionGraph = (definitions) => {
|
|
162
|
-
const defs = Array.isArray(definitions) ? [...definitions] : Object.values(definitions);
|
|
163
|
-
const known = new Set(defs.map((definition) => definition.id));
|
|
164
|
-
const dangling = /* @__PURE__ */ new Set();
|
|
165
|
-
const nodes = defs.map((definition) => {
|
|
166
|
-
const pushes = navTargetsOf(definition);
|
|
167
|
-
for (const target of pushes) if (!target.includes("{{") && !known.has(target)) dangling.add(target);
|
|
168
|
-
const usage = collectChannels(definition);
|
|
169
|
-
return { id: definition.id, pushes, emits: usage.emits, listens: usage.listens };
|
|
170
|
-
});
|
|
171
|
-
return { nodes, dangling: [...dangling].sort() };
|
|
172
|
-
};
|
|
173
|
-
|
|
174
|
-
// src/reflect/cycles.ts
|
|
175
|
-
var NAV_KEYS = ["push", "replace", "resetTo"];
|
|
176
|
-
var isLiteral = (value) => typeof value === "string" && value !== "" && !value.includes("{{");
|
|
177
|
-
var edgesOf = (definition, from, steps, known, out) => {
|
|
178
|
-
if (!Array.isArray(steps)) return;
|
|
179
|
-
for (const step of steps) {
|
|
180
|
-
if (!isRecord(step)) continue;
|
|
181
|
-
const emit = step["emit"];
|
|
182
|
-
if (isRecord(emit) && isLiteral(emit["channel"])) out.push({ from, to: `channel:${emit["channel"]}`, action: definition.id, via: "emit" });
|
|
183
|
-
if (step["reload"] === true) out.push({ from, to: `mount:${definition.id}`, action: definition.id, via: "reload" });
|
|
184
|
-
for (const key of NAV_KEYS) {
|
|
185
|
-
const nav = step[key];
|
|
186
|
-
if (isRecord(nav) && isLiteral(nav["action"]) && known.has(nav["action"])) out.push({ from, to: `mount:${nav["action"]}`, action: definition.id, via: key });
|
|
187
|
-
}
|
|
188
|
-
if (typeof step["call"] === "string") {
|
|
189
|
-
edgesOf(definition, from, step["onSuccess"], known, out);
|
|
190
|
-
edgesOf(definition, from, step["onError"], known, out);
|
|
191
|
-
}
|
|
192
|
-
}
|
|
193
|
-
};
|
|
194
|
-
var label = (node) => node.startsWith("channel:") ? node.slice("channel:".length) : `mount ${node.slice("mount:".length)}`;
|
|
195
|
-
var chainCycles = (definitions) => {
|
|
196
|
-
const defs = Array.isArray(definitions) ? [...definitions] : Object.values(definitions);
|
|
197
|
-
const known = new Set(defs.map((definition) => definition.id));
|
|
198
|
-
const edges = [];
|
|
199
|
-
for (const definition of defs) {
|
|
200
|
-
for (const trigger of definition.triggers ?? []) {
|
|
201
|
-
if (isLiteral(trigger.message)) edgesOf(definition, `channel:${trigger.message}`, trigger.do, known, edges);
|
|
202
|
-
}
|
|
203
|
-
edgesOf(definition, `mount:${definition.id}`, definition.lifecycle?.mount, known, edges);
|
|
204
|
-
}
|
|
205
|
-
const outgoing = /* @__PURE__ */ new Map();
|
|
206
|
-
for (const edge of edges) outgoing.set(edge.from, [...outgoing.get(edge.from) ?? [], edge]);
|
|
207
|
-
const index = /* @__PURE__ */ new Map();
|
|
208
|
-
const low = /* @__PURE__ */ new Map();
|
|
209
|
-
const onStack = /* @__PURE__ */ new Set();
|
|
210
|
-
const stack = [];
|
|
211
|
-
const components = [];
|
|
212
|
-
let counter = 0;
|
|
213
|
-
const connect = (node) => {
|
|
214
|
-
index.set(node, counter);
|
|
215
|
-
low.set(node, counter);
|
|
216
|
-
counter += 1;
|
|
217
|
-
stack.push(node);
|
|
218
|
-
onStack.add(node);
|
|
219
|
-
for (const edge of outgoing.get(node) ?? []) {
|
|
220
|
-
if (!index.has(edge.to)) {
|
|
221
|
-
connect(edge.to);
|
|
222
|
-
low.set(node, Math.min(low.get(node) ?? 0, low.get(edge.to) ?? 0));
|
|
223
|
-
} else if (onStack.has(edge.to)) {
|
|
224
|
-
low.set(node, Math.min(low.get(node) ?? 0, index.get(edge.to) ?? 0));
|
|
225
|
-
}
|
|
226
|
-
}
|
|
227
|
-
if (low.get(node) !== index.get(node)) return;
|
|
228
|
-
const component = [];
|
|
229
|
-
for (let top = stack.pop(); top !== void 0; top = stack.pop()) {
|
|
230
|
-
onStack.delete(top);
|
|
231
|
-
component.push(top);
|
|
232
|
-
if (top === node) break;
|
|
233
|
-
}
|
|
234
|
-
components.push(component);
|
|
235
|
-
};
|
|
236
|
-
for (const node of [...outgoing.keys()].sort()) if (!index.has(node)) connect(node);
|
|
237
|
-
const cycleIn = (component) => {
|
|
238
|
-
const members = new Set(component);
|
|
239
|
-
const start = [...component].sort()[0];
|
|
240
|
-
if (start === void 0) return void 0;
|
|
241
|
-
const via = /* @__PURE__ */ new Map();
|
|
242
|
-
const queue = [start];
|
|
243
|
-
for (let node = queue.shift(); node !== void 0; node = queue.shift()) {
|
|
244
|
-
for (const edge of outgoing.get(node) ?? []) {
|
|
245
|
-
if (!members.has(edge.to)) continue;
|
|
246
|
-
if (edge.to === start) {
|
|
247
|
-
const steps = [edge];
|
|
248
|
-
for (let back = via.get(node); back !== void 0; back = via.get(back.from)) steps.unshift(back);
|
|
249
|
-
return steps;
|
|
250
|
-
}
|
|
251
|
-
if (via.has(edge.to)) continue;
|
|
252
|
-
via.set(edge.to, edge);
|
|
253
|
-
queue.push(edge.to);
|
|
254
|
-
}
|
|
255
|
-
}
|
|
256
|
-
return void 0;
|
|
257
|
-
};
|
|
258
|
-
return components.map(cycleIn).filter((steps) => steps !== void 0).map((steps) => ({
|
|
259
|
-
steps,
|
|
260
|
-
path: [label(steps[0]?.from ?? ""), ...steps.map((step) => `\u2014${step.via} (${step.action})\u2192 ${label(step.to)}`)].join(" ")
|
|
261
|
-
})).sort((a, b) => a.path.localeCompare(b.path));
|
|
262
|
-
};
|
|
263
|
-
|
|
264
|
-
export { actionGraph, auditCatalog, chainCycles, classifyAudit, componentsOf, describeInstance, describeShell, isRecord, loopVarsOf, refsOf, snapshotShell, walkNodes };
|
|
265
|
-
//# sourceMappingURL=chunk-EG2RUXJN.js.map
|
|
266
|
-
//# sourceMappingURL=chunk-EG2RUXJN.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/reflect/walk.ts","../src/reflect/audit.ts","../src/reflect/shell.ts","../src/reflect/graph.ts","../src/reflect/cycles.ts"],"names":[],"mappings":";;;AAcO,IAAM,QAAA,GAAW,CAAC,KAAA,KACvB,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,QAAA,IAAY,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK;AAI9D,IAAM,SAAA,GAAY,CAAC,KAAA,EAAgB,KAAA,KAA2D;AACnG,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,KAAA,MAAW,IAAA,IAAQ,KAAA,EAAO,SAAA,CAAU,IAAA,EAAM,KAAK,CAAA;AAC/C,IAAA;AAAA,EACF;AACA,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACtB,EAAA,KAAA,CAAM,KAAK,CAAA;AACX,EAAA,KAAA,MAAW,SAAS,MAAA,CAAO,MAAA,CAAO,KAAK,CAAA,EAAG,SAAA,CAAU,OAAO,KAAK,CAAA;AAClE;AAIO,IAAM,YAAA,GAAe,CAAC,KAAA,KAAgC;AAC3D,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,SAAA,CAAU,KAAA,EAAO,CAAC,MAAA,KAAW;AAC3B,IAAA,IAAI,OAAO,OAAO,WAAW,CAAA,KAAM,UAAU,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,WAAW,CAAC,CAAA;AAAA,EAC1E,CAAC,CAAA;AACD,EAAA,OAAO,GAAA;AACT;AAKO,IAAM,MAAA,GAAS,CAAC,KAAA,KAAgC;AACrD,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,SAAA,CAAU,KAAA,EAAO,CAAC,MAAA,KAAW;AAC3B,IAAA,IAAI,MAAA,CAAO,WAAW,CAAA,KAAM,MAAA,IAAa,CAAC,QAAA,CAAS,MAAA,CAAO,OAAO,CAAC,CAAA,EAAG;AACrE,IAAA,SAAA,CAAU,MAAA,CAAO,OAAO,CAAA,EAAG,CAAC,KAAA,KAAU;AACpC,MAAA,KAAA,MAAW,CAAC,GAAA,EAAK,SAAS,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AACpD,QAAA,IAAA,CAAK,GAAA,KAAQ,KAAA,IAAS,GAAA,CAAI,QAAA,CAAS,KAAK,CAAA,KAAM,OAAO,SAAA,KAAc,QAAA,IAAY,SAAA,KAAc,EAAA,EAAI,GAAA,CAAI,IAAI,SAAS,CAAA;AAAA,MACpH;AAAA,IACF,CAAC,CAAA;AAAA,EACH,CAAC,CAAA;AACD,EAAA,OAAO,GAAA;AACT;AAIO,IAAM,UAAA,GAAa,CAAC,KAAA,KAAgC;AACzD,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,SAAA,CAAU,KAAA,EAAO,CAAC,MAAA,KAAW;AAC3B,IAAA,IAAI,OAAO,MAAA,CAAO,IAAI,CAAA,KAAM,QAAA,IAAY,MAAA,CAAO,KAAK,CAAA,KAAM,MAAA,EAAW,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,IAAI,CAAC,CAAA;AAAA,EAC3F,CAAC,CAAA;AACD,EAAA,OAAO,GAAA;AACT;;;AChDO,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAe,UAAA,KAA6C;AACxF,EAAA,MAAM,SAAS,OAAO,UAAA,CAAW,MAAA,KAAW,QAAA,GAAW,WAAW,MAAA,GAAS,MAAA;AAE3E,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,sBAAsB,CAAA;AAC/C,EAAA,IAAI,SAAS,IAAA,EAAM;AACjB,IAAA,MAAM,IAAA,GAAA,CAAQ,KAAK,CAAC,CAAA,IAAK,IAAI,KAAA,CAAM,GAAG,CAAA,CAAE,CAAC,CAAA,IAAK,EAAA;AAC9C,IAAA,IAAI,IAAA,KAAS,OAAA,IAAW,IAAA,KAAS,OAAA,EAAS;AACxC,MAAA,OAAO,EAAE,MAAM,MAAA,EAAQ,GAAA,EAAK,cAAc,MAAA,EAAQ,CAAA,EAAA,EAAK,IAAI,CAAA,uCAAA,CAAA,EAA0C;AAAA,IACvG;AACA,IAAA,IAAI,UAAA,CAAW,MAAM,CAAA,CAAE,GAAA,CAAI,IAAI,CAAA,EAAG;AAChC,MAAA,OAAO,EAAE,MAAM,MAAA,EAAQ,GAAA,EAAK,YAAY,MAAA,EAAQ,CAAA,EAAA,EAAK,IAAI,CAAA,wDAAA,CAAA,EAAsD;AAAA,IACjH;AAAA,EACF;AAEA,EAAA,MAAM,GAAA,GAAM,KAAA,CAAM,KAAA,CAAM,eAAe,CAAA;AACvC,EAAA,IAAI,GAAA,KAAQ,IAAA,IAAQ,KAAA,CAAM,QAAA,CAAS,SAAS,CAAA,IAAK,MAAA,CAAO,MAAM,CAAA,CAAE,GAAA,CAAI,GAAA,CAAI,CAAC,CAAA,IAAK,EAAE,CAAA,EAAG;AACjF,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,GAAA,EAAK,UAAA,EAAY,QAAQ,6EAAA,EAA8E;AAAA,EAChI;AAEA,EAAA,IAAI,KAAA,CAAM,QAAA,CAAS,IAAI,CAAA,EAAG;AACxB,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,GAAA,EAAK,UAAA,EAAY,QAAQ,mEAAA,EAA+D;AAAA,EACjH;AAEA,EAAA,OAAO,EAAE,MAAM,SAAA,EAAU;AAC3B;AAUO,IAAM,YAAA,GAAe,CAC1B,WAAA,KACsB;AACtB,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,OAAA,CAAQ,WAAW,CAAA,GAAI,CAAC,GAAG,WAAW,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,WAAW,CAAA;AACtF,EAAA,MAAM,OAAA,GAAU,KAAK,GAAA,CAAI,CAAC,gBAAgB,EAAE,EAAA,EAAI,WAAW,EAAA,EAAI,GAAI,WAAW,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAO,UAAA,CAAW,OAAM,GAAI,IAAI,CAAE,CAAA;AACxI,EAAA,MAAM,QAAA,GAAW;AAAA,IACf,GAAG,IAAI,GAAA;AAAA,MACL,IAAA,CAAK,OAAA,CAAQ,CAAC,UAAA,KAAe;AAC3B,QAAA,MAAM,KAAA,GAAQ,gBAAgB,UAAU,CAAA;AACxC,QAAA,OAAO,CAAC,GAAG,KAAA,CAAM,KAAA,EAAO,GAAG,MAAM,OAAO,CAAA;AAAA,MAC1C,CAAC;AAAA;AACH,GACF;AACA,EAAA,OAAO,IAAA,CACJ,GAAA,CAAI,CAAC,UAAA,KAAgC;AACpC,IAAA,MAAM,SAAS,WAAA,CAAY,UAAA,EAAY,EAAE,OAAA,EAAS,QAAA,EAAU,CAAA,CAAE,MAAA,CAAO,IAAI,CAAC,KAAA,MAA4B,EAAE,KAAA,EAAO,GAAG,cAAc,KAAA,EAAO,UAAU,GAAE,CAAE,CAAA;AACrJ,IAAA,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,MAAA,CAAO,CAAA,CAAE,IAAA,KAAS,MAAM,CAAA,GAAI,MAAA,CAAO,CAAA,CAAE,IAAA,KAAS,MAAM,CAAC,CAAA;AAC3E,IAAA,OAAO,EAAE,EAAA,EAAI,UAAA,CAAW,EAAA,EAAI,SAAS,MAAA,CAAO,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,CAAM,IAAA,KAAS,SAAS,CAAA,CAAE,QAAQ,MAAA,EAAO;AAAA,EACzG,CAAC,CAAA,CACA,MAAA,CAAO,CAAC,GAAA,KAAQ,IAAI,MAAA,CAAO,MAAA,GAAS,CAAC,CAAA,CACrC,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,OAAA,GAAU,EAAE,OAAO,CAAA;AACzC;;;AChCO,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAc,OAAA,GAA6B,EAAC,KAAqB;AAC7F,EAAA,MAAM,KAAA,GAAQ,MAAM,QAAA,EAAS;AAC7B,EAAA,MAAM,WAAW,MAAA,CAAO,MAAA,CAAO,MAAM,QAAQ,CAAA,CAC1C,OAAO,CAAC,MAAA,KAAW,CAAC,OAAA,CAAQ,SAAS,MAAA,CAAO,EAAE,CAAC,CAAA,CAC/C,GAAA,CAAI,CAAC,MAAA,MAAuB;AAAA,IAC3B,IAAI,MAAA,CAAO,EAAA;AAAA,IACX,KAAA,EAAO,OAAO,KAAA,CAAM,MAAA;AAAA,IACpB,KAAA,EAAO,CAAC,GAAG,MAAA,CAAO,KAAK,EAAE,OAAA,EAAQ,CAAE,GAAA,CAAI,CAAC,QAAA,MAA2B;AAAA,MACjE,cAAc,QAAA,CAAS,YAAA;AAAA,MACvB,YAAY,QAAA,CAAS,EAAA;AAAA,MACrB,QAAQ,QAAA,CAAS,MAAA;AAAA,MACjB,MAAA,EAAQ,QAAA,CAAS,EAAA,KAAO,MAAA,CAAO,MAAA,EAAQ;AAAA,KACzC,CAAE;AAAA,GACJ,CAAE,CAAA;AACJ,EAAA,OAAO,EAAE,QAAA,EAAU,OAAA,EAAS,KAAA,CAAM,WAAA,CAAY,IAAA,EAAK,EAAG,UAAA,EAAY,KAAA,CAAM,QAAA,CAAS,IAAA,EAAK,EAAE;AAC1F;AAyBA,IAAM,OAAA,GAAU,CAAC,KAAA,EAAgB,IAAA,EAAc,IAAA,KAA0B;AACvE,EAAA,IAAI,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,KAAS,CAAA,IAAK,KAAA,CAAM,MAAA,IAAU,OAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,QAAQ,IAAA,EAAM,IAAA,EAAM,IAAI,CAAC,IAAI,CAAC,GAAG,KAAA,CAAM,KAAA,CAAM,GAAG,IAAI,CAAA,CAAE,GAAA,CAAI,CAAC,SAAS,OAAA,CAAQ,IAAA,EAAM,IAAA,EAAM,IAAI,CAAC,CAAA,EAAG,CAAA,MAAA,EAAI,KAAA,CAAM,MAAA,GAAS,IAAI,CAAA,KAAA,CAAO,CAAA;AAAA,EAChM;AACA,EAAA,IAAI,KAAA,KAAU,IAAA,IAAQ,OAAO,KAAA,KAAU,UAAU,OAAO,KAAA;AACxD,EAAA,MAAM,MAA+B,EAAC;AACtC,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAgC,CAAA,EAAG,GAAA,CAAI,GAAG,CAAA,GAAI,OAAA,CAAQ,KAAA,EAAO,MAAM,IAAI,CAAA;AACjH,EAAA,OAAO,GAAA;AACT,CAAA;AAEO,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAc,OAAA,GAAgC,EAAC,KAAc;AACzF,EAAA,MAAM,EAAE,MAAM,IAAA,EAAM,YAAA,GAAe,GAAG,IAAA,GAAO,CAAA,EAAG,OAAM,GAAI,OAAA;AAC1D,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,KAAA,MAAW,CAAC,QAAA,EAAU,MAAM,CAAA,IAAK,MAAA,CAAO,QAAQ,KAAA,CAAM,QAAA,EAAS,CAAE,QAAQ,CAAA,EAAG;AAC1E,IAAA,IAAI,SAAS,MAAA,IAAa,CAAC,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAG;AACpD,IAAA,IAAI,MAAA,CAAO,WAAW,MAAA,EAAW;AAC/B,MAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAA,EAAK,QAAQ,CAAA,SAAA,CAAW,CAAA;AACnC,MAAA;AAAA,IACF;AACA,IAAA,KAAA,CAAM,IAAA,CAAK,CAAA,EAAA,EAAK,QAAQ,CAAA,EAAA,EAAK,MAAA,CAAO,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU,CAAA,EAAG,IAAA,CAAK,YAAY,GAAG,KAAA,KAAU,MAAA,CAAO,KAAA,CAAM,MAAA,GAAS,CAAA,GAAI,GAAA,GAAM,EAAE,CAAA,CAAE,CAAA,CAAE,IAAA,CAAK,UAAK,CAAC,CAAA,CAAE,CAAA;AACnJ,IAAA,KAAA,MAAW,IAAA,IAAQ,OAAO,KAAA,EAAO;AAC/B,MAAA,MAAM,OAAA,GAAU,KAAA,CAAM,UAAA,CAAW,IAAA,CAAK,EAAE,CAAA;AACxC,MAAA,MAAM,IAAA,GAAO,IAAA,GAAO,IAAA,CAAK,EAAE,CAAA;AAC3B,MAAA,MAAM,IAAA,GAAO,OAAA,KAAY,MAAA,GAAY,MAAA,GAAA,CAAa,KAAA,KAAU,CAAC,KAAA,KAAmC,KAAA,CAAA,EAAQ,OAAA,CAAQ,OAAA,EAAS,CAAA;AACzH,MAAA,KAAA,CAAM,IAAA,CAAK,OAAO,IAAA,CAAK,YAAY,GAAG,IAAA,KAAS,MAAA,GAAY,EAAA,GAAK,CAAA,CAAA,EAAI,IAAI,CAAA,CAAE,UAAU,IAAA,KAAS,MAAA,GAAY,IAAA,GAAO,IAAA,CAAK,SAAA,CAAU,OAAA,CAAQ,MAAM,YAAA,EAAc,IAAI,CAAC,CAAC,CAAA,CAAE,CAAA;AAAA,IACrK;AAAA,EACF;AACA,EAAA,OAAO,KAAA,CAAM,KAAK,IAAI,CAAA;AACxB;AAoBO,IAAM,gBAAA,GAAmB,CAAC,KAAA,EAAc,UAAA,KAAkD;AAC/F,EAAA,MAAM,OAAA,GAAU,KAAA,CAAM,UAAA,CAAW,UAAU,CAAA;AAC3C,EAAA,IAAI,OAAA,KAAY,QAAW,OAAO,MAAA;AAElC,EAAA,MAAM,aAA+B,OAAA,CAAQ,UAAA;AAC7C,EAAA,MAAM,SAAS,UAAA,CAAW,MAAA;AAC1B,EAAA,MAAM,UAAA,GAAa,OAAO,MAAA,KAAW,QAAA,GAAW,MAAM,WAAA,CAAY,GAAA,CAAI,MAAM,CAAA,GAAI,MAAA;AAChF,EAAA,MAAM,MAAA,GAAS,WAAA,CAAY,UAAU,CAAA,CAAE,OAAO,GAAA,CAAI,CAAC,KAAA,MAA4B,EAAE,OAAO,GAAG,aAAA,CAAc,KAAA,EAAO,UAAU,GAAE,CAAE,CAAA;AAE9H,EAAA,OAAO;AAAA,IACL,IAAI,UAAA,CAAW,EAAA;AAAA,IACf,UAAA;AAAA,IACA,QAAA,EAAU,QAAQ,QAAA,CAAS,QAAA;AAAA,IAC3B,MAAA,EAAQ,QAAQ,QAAA,CAAS,MAAA;AAAA,IACzB,KAAA,EAAO,WAAW,KAAA,IAAS,EAAA;AAAA,IAC3B,IAAA,EAAM,QAAQ,OAAA,EAAQ;AAAA,IACtB,WAAW,MAAA,CAAO,OAAA,CAAQ,UAAA,CAAW,SAAA,IAAa,EAAE,CAAA,CAAE,GAAA,CAAI,CAAC,CAAC,IAAA,EAAM,MAAM,OAAO,EAAE,IAAA,EAAM,QAAO,CAAE,CAAA;AAAA,IAChG,QAAA,EAAU,UAAA,CAAW,QAAA,IAAY,EAAC;AAAA,IAClC,SAAA,EAAW,UAAA,CAAW,SAAA,IAAa,EAAC;AAAA,IACpC,UAAA,EAAY,OAAO,MAAA,KAAW,QAAA,GAAW,OAAA,GAAU,QAAA;AAAA,IACnD,MAAA,EAAQ,UAAA;AAAA,IACR,OAAO,UAAA,CAAW,KAAA;AAAA,IAClB;AAAA,GACF;AACF;;;ACtIA,IAAM,YAAA,GAAe,CAAC,UAAA,KAA2C;AAC/D,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAY;AAC5B,EAAA,MAAM,OAAO,CAAC,KAAA,KACZ,SAAA,CAAU,KAAA,EAAO,CAAC,MAAA,KAAW;AAC3B,IAAA,KAAA,MAAW,GAAA,IAAO,CAAC,MAAA,EAAQ,SAAA,EAAW,SAAS,CAAA,EAAG;AAChD,MAAA,MAAM,MAAA,GAAS,OAAO,GAAG,CAAA;AACzB,MAAA,IAAI,QAAA,CAAS,MAAM,CAAA,IAAK,OAAO,MAAA,CAAO,QAAQ,CAAA,KAAM,QAAA,EAAU,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,QAAQ,CAAC,CAAA;AAAA,IACxF;AAAA,EACF,CAAC,CAAA;AACH,EAAA,IAAA,CAAK,UAAA,CAAW,QAAA,IAAY,EAAE,CAAA;AAC9B,EAAA,IAAA,CAAK,UAAA,CAAW,SAAA,IAAa,EAAE,CAAA;AAC/B,EAAA,OAAO,CAAC,GAAG,GAAG,CAAA,CAAE,IAAA,EAAK;AACvB,CAAA;AAeO,IAAM,WAAA,GAAc,CACzB,WAAA,KACgB;AAChB,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,OAAA,CAAQ,WAAW,CAAA,GAAI,CAAC,GAAG,WAAW,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,WAAW,CAAA;AACtF,EAAA,MAAM,KAAA,GAAQ,IAAI,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,UAAA,KAAe,UAAA,CAAW,EAAE,CAAC,CAAA;AAC7D,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AAEjC,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,GAAA,CAAI,CAAC,UAAA,KAA2B;AACjD,IAAA,MAAM,MAAA,GAAS,aAAa,UAAU,CAAA;AACtC,IAAA,KAAA,MAAW,MAAA,IAAU,MAAA,EAAQ,IAAI,CAAC,OAAO,QAAA,CAAS,IAAI,CAAA,IAAK,CAAC,MAAM,GAAA,CAAI,MAAM,CAAA,EAAG,QAAA,CAAS,IAAI,MAAM,CAAA;AAClG,IAAA,MAAM,KAAA,GAAQ,gBAAgB,UAAU,CAAA;AACxC,IAAA,OAAO,EAAE,EAAA,EAAI,UAAA,CAAW,EAAA,EAAI,MAAA,EAAQ,OAAO,KAAA,CAAM,KAAA,EAAO,OAAA,EAAS,KAAA,CAAM,OAAA,EAAQ;AAAA,EACjF,CAAC,CAAA;AAED,EAAA,OAAO,EAAE,OAAO,QAAA,EAAU,CAAC,GAAG,QAAQ,CAAA,CAAE,MAAK,EAAE;AACjD;;;AChBA,IAAM,QAAA,GAAW,CAAC,MAAA,EAAQ,SAAA,EAAW,SAAS,CAAA;AAE9C,IAAM,SAAA,GAAY,CAAC,KAAA,KAAoC,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,EAAA,IAAM,CAAC,KAAA,CAAM,QAAA,CAAS,IAAI,CAAA;AAExH,IAAM,UAAU,CAAC,UAAA,EAA8B,IAAA,EAAc,KAAA,EAAgB,OAA4B,GAAA,KAA2B;AAClI,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA,EAAG;AAC3B,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,CAAC,QAAA,CAAS,IAAI,CAAA,EAAG;AACrB,IAAA,MAAM,IAAA,GAAO,KAAK,MAAM,CAAA;AACxB,IAAA,IAAI,QAAA,CAAS,IAAI,CAAA,IAAK,SAAA,CAAU,KAAK,SAAS,CAAC,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAE,MAAM,EAAA,EAAI,CAAA,QAAA,EAAW,IAAA,CAAK,SAAS,CAAC,CAAA,CAAA,EAAI,QAAQ,UAAA,CAAW,EAAA,EAAI,GAAA,EAAK,MAAA,EAAQ,CAAA;AACzI,IAAA,IAAI,KAAK,QAAQ,CAAA,KAAM,MAAM,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,EAAA,EAAI,CAAA,MAAA,EAAS,UAAA,CAAW,EAAE,CAAA,CAAA,EAAI,MAAA,EAAQ,WAAW,EAAA,EAAI,GAAA,EAAK,UAAU,CAAA;AAClH,IAAA,KAAA,MAAW,OAAO,QAAA,EAAU;AAC1B,MAAA,MAAM,GAAA,GAAM,KAAK,GAAG,CAAA;AACpB,MAAA,IAAI,QAAA,CAAS,GAAG,CAAA,IAAK,SAAA,CAAU,GAAA,CAAI,QAAQ,CAAC,CAAA,IAAK,KAAA,CAAM,GAAA,CAAI,GAAA,CAAI,QAAQ,CAAC,CAAA,EAAG,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,EAAA,EAAI,CAAA,MAAA,EAAS,GAAA,CAAI,QAAQ,CAAC,CAAA,CAAA,EAAI,MAAA,EAAQ,UAAA,CAAW,EAAA,EAAI,GAAA,EAAK,KAAK,CAAA;AAAA,IAC7J;AACA,IAAA,IAAI,OAAO,IAAA,CAAK,MAAM,CAAA,KAAM,QAAA,EAAU;AACpC,MAAA,OAAA,CAAQ,YAAY,IAAA,EAAM,IAAA,CAAK,WAAW,CAAA,EAAG,OAAO,GAAG,CAAA;AACvD,MAAA,OAAA,CAAQ,YAAY,IAAA,EAAM,IAAA,CAAK,SAAS,CAAA,EAAG,OAAO,GAAG,CAAA;AAAA,IACvD;AAAA,EACF;AACF,CAAA;AAEA,IAAM,QAAQ,CAAC,IAAA,KAA0B,IAAA,CAAK,UAAA,CAAW,UAAU,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,UAAA,CAAW,MAAM,CAAA,GAAI,CAAA,MAAA,EAAS,KAAK,KAAA,CAAM,QAAA,CAAS,MAAM,CAAC,CAAA,CAAA;AAEpI,IAAM,WAAA,GAAc,CAAC,WAAA,KAA8F;AACxH,EAAA,MAAM,IAAA,GAAO,KAAA,CAAM,OAAA,CAAQ,WAAW,CAAA,GAAI,CAAC,GAAG,WAAW,CAAA,GAAI,MAAA,CAAO,MAAA,CAAO,WAAW,CAAA;AACtF,EAAA,MAAM,KAAA,GAAQ,IAAI,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,UAAA,KAAe,UAAA,CAAW,EAAE,CAAC,CAAA;AAC7D,EAAA,MAAM,QAAqB,EAAC;AAC5B,EAAA,KAAA,MAAW,cAAc,IAAA,EAAM;AAC7B,IAAA,KAAA,MAAW,OAAA,IAAW,UAAA,CAAW,QAAA,IAAY,EAAC,EAAG;AAC/C,MAAA,IAAI,SAAA,CAAU,OAAA,CAAQ,OAAO,CAAA,EAAG,OAAA,CAAQ,UAAA,EAAY,CAAA,QAAA,EAAW,OAAA,CAAQ,OAAO,CAAA,CAAA,EAAI,OAAA,CAAQ,EAAA,EAAI,OAAO,KAAK,CAAA;AAAA,IAC5G;AACA,IAAA,OAAA,CAAQ,UAAA,EAAY,SAAS,UAAA,CAAW,EAAE,IAAI,UAAA,CAAW,SAAA,EAAW,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAAA,EACzF;AACA,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAyB;AAC9C,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO,QAAA,CAAS,GAAA,CAAI,IAAA,CAAK,MAAM,CAAC,GAAI,QAAA,CAAS,GAAA,CAAI,KAAK,IAAI,CAAA,IAAK,EAAC,EAAI,IAAI,CAAC,CAAA;AAI5F,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAoB;AACtC,EAAA,MAAM,GAAA,uBAAU,GAAA,EAAoB;AACpC,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,MAAM,QAAkB,EAAC;AACzB,EAAA,MAAM,aAAyB,EAAC;AAChC,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,MAAM,OAAA,GAAU,CAAC,IAAA,KAAuB;AACtC,IAAA,KAAA,CAAM,GAAA,CAAI,MAAM,OAAO,CAAA;AACvB,IAAA,GAAA,CAAI,GAAA,CAAI,MAAM,OAAO,CAAA;AACrB,IAAA,OAAA,IAAW,CAAA;AACX,IAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AACf,IAAA,OAAA,CAAQ,IAAI,IAAI,CAAA;AAChB,IAAA,KAAA,MAAW,QAAQ,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,IAAK,EAAC,EAAG;AAC3C,MAAA,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACvB,QAAA,OAAA,CAAQ,KAAK,EAAE,CAAA;AACf,QAAA,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,IAAA,CAAK,GAAA,CAAI,IAAI,GAAA,CAAI,IAAI,CAAA,IAAK,CAAA,EAAG,IAAI,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAC,CAAC,CAAA;AAAA,MACnE,CAAA,MAAA,IAAW,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC/B,QAAA,GAAA,CAAI,GAAA,CAAI,IAAA,EAAM,IAAA,CAAK,GAAA,CAAI,IAAI,GAAA,CAAI,IAAI,CAAA,IAAK,CAAA,EAAG,MAAM,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,IAAK,CAAC,CAAC,CAAA;AAAA,MACrE;AAAA,IACF;AACA,IAAA,IAAI,IAAI,GAAA,CAAI,IAAI,MAAM,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,EAAG;AACvC,IAAA,MAAM,YAAsB,EAAC;AAC7B,IAAA,KAAA,IAAS,GAAA,GAAM,MAAM,GAAA,EAAI,EAAG,QAAQ,MAAA,EAAW,GAAA,GAAM,KAAA,CAAM,GAAA,EAAI,EAAG;AAChE,MAAA,OAAA,CAAQ,OAAO,GAAG,CAAA;AAClB,MAAA,SAAA,CAAU,KAAK,GAAG,CAAA;AAClB,MAAA,IAAI,QAAQ,IAAA,EAAM;AAAA,IACpB;AACA,IAAA,UAAA,CAAW,KAAK,SAAS,CAAA;AAAA,EAC3B,CAAA;AACA,EAAA,KAAA,MAAW,QAAQ,CAAC,GAAG,QAAA,CAAS,IAAA,EAAM,CAAA,CAAE,IAAA,EAAK,EAAG,IAAI,CAAC,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA,UAAW,IAAI,CAAA;AAIlF,EAAA,MAAM,OAAA,GAAU,CAAC,SAAA,KAA0D;AACzE,IAAA,MAAM,OAAA,GAAU,IAAI,GAAA,CAAI,SAAS,CAAA;AACjC,IAAA,MAAM,QAAQ,CAAC,GAAG,SAAS,CAAA,CAAE,IAAA,GAAO,CAAC,CAAA;AACrC,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,MAAA;AAChC,IAAA,MAAM,GAAA,uBAAU,GAAA,EAAuB;AACvC,IAAA,MAAM,KAAA,GAAQ,CAAC,KAAK,CAAA;AACpB,IAAA,KAAA,IAAS,IAAA,GAAO,MAAM,KAAA,EAAM,EAAG,SAAS,MAAA,EAAW,IAAA,GAAO,KAAA,CAAM,KAAA,EAAM,EAAG;AACvE,MAAA,KAAA,MAAW,QAAQ,QAAA,CAAS,GAAA,CAAI,IAAI,CAAA,IAAK,EAAC,EAAG;AAC3C,QAAA,IAAI,CAAC,OAAA,CAAQ,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AAC3B,QAAA,IAAI,IAAA,CAAK,OAAO,KAAA,EAAO;AACrB,UAAA,MAAM,KAAA,GAAQ,CAAC,IAAI,CAAA;AACnB,UAAA,KAAA,IAAS,IAAA,GAAO,GAAA,CAAI,GAAA,CAAI,IAAI,GAAG,IAAA,KAAS,MAAA,EAAW,IAAA,GAAO,GAAA,CAAI,IAAI,IAAA,CAAK,IAAI,CAAA,EAAG,KAAA,CAAM,QAAQ,IAAI,CAAA;AAChG,UAAA,OAAO,KAAA;AAAA,QACT;AACA,QAAA,IAAI,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG;AACtB,QAAA,GAAA,CAAI,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,IAAI,CAAA;AACrB,QAAA,KAAA,CAAM,IAAA,CAAK,KAAK,EAAE,CAAA;AAAA,MACpB;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AAEA,EAAA,OAAO,UAAA,CACJ,GAAA,CAAI,OAAO,CAAA,CACX,MAAA,CAAO,CAAC,KAAA,KAAgC,KAAA,KAAU,MAAS,CAAA,CAC3D,GAAA,CAAI,CAAC,KAAA,MAAW;AAAA,IACf,KAAA;AAAA,IACA,IAAA,EAAM,CAAC,KAAA,CAAM,KAAA,CAAM,CAAC,CAAA,EAAG,IAAA,IAAQ,EAAE,CAAA,EAAG,GAAG,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,CAAA,MAAA,EAAI,IAAA,CAAK,GAAG,CAAA,EAAA,EAAK,IAAA,CAAK,MAAM,CAAA,QAAA,EAAM,KAAA,CAAM,IAAA,CAAK,EAAE,CAAC,CAAA,CAAE,CAAC,CAAA,CAAE,KAAK,GAAG;AAAA,GAC1H,CAAE,CAAA,CACD,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,IAAA,CAAK,aAAA,CAAc,CAAA,CAAE,IAAI,CAAC,CAAA;AAChD","file":"chunk-EG2RUXJN.js","sourcesContent":["// ═══════════════════════════════════════════════════════════\n// The one traversal the codebase kept re-writing. A nova artifact — a layout,\n// a render tree, a definition, a whole manifest — is nested plain objects and\n// arrays; walking it to collect or check \"every node that has X\" was\n// hand-rolled in moss (collectComponents, hasVisibleContent) and relay's\n// devtools (walk, collectLoopVars, collectPropRefs). This is that walk, once,\n// plus the collectors that ride it.\n//\n// This is the STRUCTURAL walk — it visits every plain-object record. The\n// SEMANTIC walkers (collectChannels, which follows call→onSuccess; the typed\n// RenderNode model-binding walk) stay their own thing: folding them onto a\n// blind structural walk would lose their precision.\n// ═══════════════════════════════════════════════════════════\n\nexport const isRecord = (value: unknown): value is Record<string, unknown> =>\n value !== null && typeof value === 'object' && !Array.isArray(value);\n\n// Visit every plain-object record in a nova tree, arrays and nested objects\n// included. The visitor sees each record before its children.\nexport const walkNodes = (value: unknown, visit: (record: Record<string, unknown>) => void): void => {\n if (Array.isArray(value)) {\n for (const item of value) walkNodes(item, visit);\n return;\n }\n if (!isRecord(value)) return;\n visit(value);\n for (const inner of Object.values(value)) walkNodes(inner, visit);\n};\n\n// Every component NAME referenced anywhere in a tree — layouts, render trees,\n// fragments, a manifest. (Was moss's `collectComponents`.)\nexport const componentsOf = (value: unknown): Set<string> => {\n const out = new Set<string>();\n walkNodes(value, (record) => {\n if (typeof record['component'] === 'string') out.add(record['component']);\n });\n return out;\n};\n\n// Every ref carried by a `ref` / `*Ref` key INSIDE a component's props — the\n// refs a component dispatches for (a Table's rowRef, a cell's ref), which\n// node-level `ref:` analysis doesn't see. (Was devtools' `collectPropRefs`.)\nexport const refsOf = (value: unknown): Set<string> => {\n const out = new Set<string>();\n walkNodes(value, (record) => {\n if (record['component'] === undefined || !isRecord(record['props'])) return;\n walkNodes(record['props'], (props) => {\n for (const [key, propValue] of Object.entries(props)) {\n if ((key === 'ref' || key.endsWith('Ref')) && typeof propValue === 'string' && propValue !== '') out.add(propValue);\n }\n });\n });\n return out;\n};\n\n// Every loop `as:` variable declared anywhere in a layout — the names that are\n// in scope at runtime inside a `for`. (Was devtools' `collectLoopVars`.)\nexport const loopVarsOf = (value: unknown): Set<string> => {\n const out = new Set<string>();\n walkNodes(value, (record) => {\n if (typeof record['as'] === 'string' && record['for'] !== undefined) out.add(record['as']);\n });\n return out;\n};\n","import { auditAction, collectChannels } from '@action';\nimport type { ActionDefinition } from '@action';\nimport { loopVarsOf, refsOf } from './walk';\n\n// ═══════════════════════════════════════════════════════════\n// Audit classification — the static auditAction (action/audit.ts) has three\n// known blind spots; each is decidable from the definition itself. This turns\n// a raw issue string into `address` (a real break a human should see) or\n// `info` (runtime-explained). It's nova reasoning about its OWN audit\n// semantics — generic, not app opinion — so it lives here, not in an app's\n// devtools. Uses the walk collectors (loopVarsOf/refsOf).\n// ═══════════════════════════════════════════════════════════\n\nexport type IssueClass = { kind: 'address' } | { kind: 'info'; tag: string; reason: string };\n\nexport const classifyAudit = (issue: string, definition: ActionDefinition): IssueClass => {\n const layout = typeof definition.layout === 'object' ? definition.layout : undefined;\n\n const bind = issue.match(/binds \"\\$\\.([\\w.]+)\"/);\n if (bind !== null) {\n const root = (bind[1] ?? '').split('.')[0] ?? '';\n if (root === 'index' || root === 'items') {\n return { kind: 'info', tag: 'loop scope', reason: `\\`${root}\\` is a renderer-reserved loop variable` };\n }\n if (loopVarsOf(layout).has(root)) {\n return { kind: 'info', tag: 'loop var', reason: `\\`${root}\\` is a loop \\`as:\\` variable — in scope at runtime` };\n }\n }\n\n const ref = issue.match(/ref \"([^\"]+)\"/);\n if (ref !== null && issue.includes('listens') && refsOf(layout).has(ref[1] ?? '')) {\n return { kind: 'info', tag: 'prop ref', reason: 'dispatched by a component from a props value (e.g. Table rowRef / cell.ref)' };\n }\n\n if (issue.includes('{{')) {\n return { kind: 'info', tag: 'template', reason: 'target resolves from data at runtime — statically unknowable' };\n }\n\n return { kind: 'address' };\n};\n\nexport type ClassifiedIssue = { issue: string } & IssueClass;\nexport type CatalogAuditRow = { id: string; address: number; issues: ClassifiedIssue[] };\n\n// Audit a whole set of definitions and classify every finding: each definition\n// is checked against a catalog + channel vocabulary derived from the set, so\n// cross-action wiring (a push to a missing action, a channel nobody serves) is\n// visible. Rows carry unresolved (`address`) findings first and sort by how\n// many they have. The self-audit devtools render this verbatim.\nexport const auditCatalog = (\n definitions: Record<string, ActionDefinition> | readonly ActionDefinition[],\n): CatalogAuditRow[] => {\n const defs = Array.isArray(definitions) ? [...definitions] : Object.values(definitions);\n const catalog = defs.map((definition) => ({ id: definition.id, ...(definition.input !== undefined ? { input: definition.input } : {}) }));\n const channels = [\n ...new Set(\n defs.flatMap((definition) => {\n const usage = collectChannels(definition);\n return [...usage.emits, ...usage.listens];\n }),\n ),\n ];\n return defs\n .map((definition): CatalogAuditRow => {\n const issues = auditAction(definition, { catalog, channels }).issues.map((issue): ClassifiedIssue => ({ issue, ...classifyAudit(issue, definition) }));\n issues.sort((a, b) => Number(a.kind === 'info') - Number(b.kind === 'info'));\n return { id: definition.id, address: issues.filter((issue) => issue.kind === 'address').length, issues };\n })\n .filter((row) => row.issues.length > 0)\n .sort((a, b) => b.address - a.address);\n};\n","import type { Shell } from '@shell';\nimport type { ActionDefinition, EndpointConfig, TriggerConfig } from '@action';\nimport type { LayoutNode } from '@layout';\nimport { classifyAudit, type ClassifiedIssue } from './audit';\nimport { auditAction } from '@action';\n\n// ═══════════════════════════════════════════════════════════\n// Shell reflection — nova reading its own running state. The canvas/instance\n// tree (snapshotShell) and a full model for one instance (describeInstance).\n// Both were re-derived in relay's devtools fns; they're pure reads over the\n// Shell's own introspection API, so they belong here. Consumers: devtools, and\n// (server-ladder) the working-set / level-streaming that walks the same tree.\n// ═══════════════════════════════════════════════════════════\n\nexport type InstanceRef = {\n definitionId: string;\n instanceId: string;\n status: string;\n active: boolean;\n};\n\nexport type CanvasRef = {\n id: string;\n depth: number;\n // top-of-stack first\n items: InstanceRef[];\n};\n\nexport type ShellSnapshot = {\n canvases: CanvasRef[];\n layouts: string[];\n // every component name the shell's registry can render\n components: string[];\n};\n\n// The whole shell as a tree of canvases → instances, plus the shell-level\n// model (layout store ids, registered component names). `exclude` drops\n// canvases the caller owns (a devtools canvas shouldn't inspect itself).\nexport const snapshotShell = (shell: Shell, exclude: readonly string[] = []): ShellSnapshot => {\n const state = shell.getState();\n const canvases = Object.values(state.canvases)\n .filter((canvas) => !exclude.includes(canvas.id))\n .map((canvas): CanvasRef => ({\n id: canvas.id,\n depth: canvas.stack.length,\n items: [...canvas.stack].reverse().map((instance): InstanceRef => ({\n definitionId: instance.definitionId,\n instanceId: instance.id,\n status: instance.status,\n active: instance.id === canvas.active?.id,\n })),\n }));\n return { canvases, layouts: shell.layoutStore.list(), components: shell.registry.list() };\n};\n\n// ─── the shell as text ─────────────────────────────────────\n// What a model is shown when it has to reason about a screen. Same tree as\n// snapshotShell, rendered flat with each card's live data.\n//\n// Long arrays collapse to a head and a count: an agent looking at the same\n// screen many times a shift cannot pay for forty rows each time, and a person\n// reading a board of forty does not hold forty either.\n\nexport type DescribeShellOptions = {\n // Canvases to render. Default: all of them.\n only?: readonly string[];\n // Marks an instance in the output. An agent whose answer is the complete state\n // of its own canvases has to tell its cards from the person's.\n mark?: (instanceId: string) => string | undefined;\n // Array length past which values collapse. 0 disables collapsing.\n collapseOver?: number;\n head?: number;\n // Last pass over each card's data before it is written. A caller that knows\n // which fields are for rendering rather than reading — tones, formatted\n // stamps — drops them here instead of paying for them.\n clean?: (data: Record<string, unknown>) => Record<string, unknown>;\n};\n\nconst compact = (value: unknown, over: number, head: number): unknown => {\n if (Array.isArray(value)) {\n return over === 0 || value.length <= over ? value.map((item) => compact(item, over, head)) : [...value.slice(0, head).map((item) => compact(item, over, head)), `…${value.length - head} more`];\n }\n if (value === null || typeof value !== 'object') return value;\n const out: Record<string, unknown> = {};\n for (const [key, inner] of Object.entries(value as Record<string, unknown>)) out[key] = compact(inner, over, head);\n return out;\n};\n\nexport const describeShell = (shell: Shell, options: DescribeShellOptions = {}): string => {\n const { only, mark, collapseOver = 5, head = 3, clean } = options;\n const lines: string[] = [];\n for (const [canvasId, canvas] of Object.entries(shell.getState().canvases)) {\n if (only !== undefined && !only.includes(canvasId)) continue;\n if (canvas.active === undefined) {\n lines.push(` ${canvasId}: (empty)`);\n continue;\n }\n lines.push(` ${canvasId}: ${canvas.stack.map((item, index) => `${item.definitionId}${index === canvas.stack.length - 1 ? '*' : ''}`).join(' › ')}`);\n for (const item of canvas.stack) {\n const runtime = shell.getRuntime(item.id);\n const note = mark?.(item.id);\n const data = runtime === undefined ? undefined : (clean ?? ((value: Record<string, unknown>) => value))(runtime.getData());\n lines.push(` ${item.definitionId}${note === undefined ? '' : ` ${note}`} data: ${data === undefined ? '{}' : JSON.stringify(compact(data, collapseOver, head))}`);\n }\n }\n return lines.join('\\n');\n};\n\nexport type InstanceModel = {\n id: string;\n instanceId: string;\n canvasId: string;\n status: string;\n title: string;\n data: Record<string, unknown>;\n endpoints: Array<{ name: string; config: EndpointConfig }>;\n triggers: TriggerConfig[];\n lifecycle: Record<string, unknown>;\n layoutKind: 'inline' | 'store';\n layout: LayoutNode | undefined;\n input: Record<string, unknown> | undefined;\n issues: ClassifiedIssue[];\n};\n\n// The full model for one live instance — its definition wiring, its current\n// data, and its classified audit. `undefined` when the id isn't mounted.\nexport const describeInstance = (shell: Shell, instanceId: string): InstanceModel | undefined => {\n const runtime = shell.getRuntime(instanceId);\n if (runtime === undefined) return undefined;\n\n const definition: ActionDefinition = runtime.definition;\n const layout = definition.layout;\n const layoutNode = typeof layout === 'string' ? shell.layoutStore.get(layout) : layout;\n const issues = auditAction(definition).issues.map((issue): ClassifiedIssue => ({ issue, ...classifyAudit(issue, definition) }));\n\n return {\n id: definition.id,\n instanceId,\n canvasId: runtime.instance.canvasId,\n status: runtime.instance.status,\n title: definition.title ?? '',\n data: runtime.getData(),\n endpoints: Object.entries(definition.endpoints ?? {}).map(([name, config]) => ({ name, config })),\n triggers: definition.triggers ?? [],\n lifecycle: definition.lifecycle ?? {},\n layoutKind: typeof layout === 'string' ? 'store' : 'inline',\n layout: layoutNode,\n input: definition.input,\n issues,\n };\n};\n","import { collectChannels } from '@action';\nimport type { ActionDefinition } from '@action';\nimport { walkNodes, isRecord } from './walk';\n\n// ═══════════════════════════════════════════════════════════\n// The action graph — each action's outgoing edges: the actions it can push to\n// (navigation) and the channels it emits/listens on. This is the adjacency the\n// audit closure walks per role, and the neighbourhood the server ladder's\n// working-set / level-streaming serves by radius. Built on the walk (nav\n// targets) + the semantic channel walker. Reachability (radius-N) layers on\n// top when working-set streaming lands.\n// ═══════════════════════════════════════════════════════════\n\n// Every action a definition navigates to — push/replace/resetTo targets in its\n// triggers and lifecycle. A template target ({{…}}) is runtime-resolved, kept\n// as-is so a caller can see it's dynamic.\nconst navTargetsOf = (definition: ActionDefinition): string[] => {\n const out = new Set<string>();\n const scan = (value: unknown): void =>\n walkNodes(value, (record) => {\n for (const key of ['push', 'replace', 'resetTo']) {\n const target = record[key];\n if (isRecord(target) && typeof target['action'] === 'string') out.add(target['action']);\n }\n });\n scan(definition.triggers ?? []);\n scan(definition.lifecycle ?? {});\n return [...out].sort();\n};\n\nexport type ActionNode = {\n id: string;\n pushes: string[];\n emits: string[];\n listens: string[];\n};\n\nexport type ActionGraph = {\n nodes: ActionNode[];\n // ids referenced as push targets that aren't defined here (a dangling edge)\n dangling: string[];\n};\n\nexport const actionGraph = (\n definitions: Record<string, ActionDefinition> | readonly ActionDefinition[],\n): ActionGraph => {\n const defs = Array.isArray(definitions) ? [...definitions] : Object.values(definitions);\n const known = new Set(defs.map((definition) => definition.id));\n const dangling = new Set<string>();\n\n const nodes = defs.map((definition): ActionNode => {\n const pushes = navTargetsOf(definition);\n for (const target of pushes) if (!target.includes('{{') && !known.has(target)) dangling.add(target);\n const usage = collectChannels(definition);\n return { id: definition.id, pushes, emits: usage.emits, listens: usage.listens };\n });\n\n return { nodes, dangling: [...dangling].sort() };\n};\n","import type { ActionDefinition } from '@action';\nimport { isRecord } from './walk';\n\n// ═══════════════════════════════════════════════════════════\n// CHAINS THAT NEVER END, found in the definitions. A step list has no\n// conditionals, so once a chain can come back to where it started it always\n// will: a trigger on `x` that emits `x`, two triggers answering each other, a\n// mount that reloads itself, a mount whose emit reaches a trigger that pushes\n// the same action again. The runtime stops every such chain at its budget\n// (action/runtime/cause.ts); this finds them before anything runs.\n//\n// The graph: a node is where steps start running — a channel (its message\n// triggers) or an action's mount. An edge is a step that starts more:\n//\n// · `emit: c` → the channel c\n// · `reload` → this action's own mount\n// · `push`/`replace`/`resetTo` of A → A's mount\n//\n// followed through `call`'s onSuccess/onError, which run as part of the same\n// chain. A channel or target written as a template (`{{…}}`) is decided at\n// runtime and has no edge; a push to an action not in the set has none\n// either. Fragment triggers join when an action is composed — walk the\n// composed definitions to see them.\n// ═══════════════════════════════════════════════════════════\n\nexport type ChainStep = {\n // Where the steps run: `channel:x` or `mount:<action id>`.\n from: string;\n to: string;\n // The action whose trigger or mount carries the step.\n action: string;\n // What the step is: `emit`, `reload`, `push`, `replace`, `resetTo`.\n via: string;\n};\n\nexport type ChainCycle = {\n // The steps round the cycle, back to where it started.\n steps: ChainStep[];\n // One line: `x —emit (loop)→ x`.\n path: string;\n};\n\nconst NAV_KEYS = ['push', 'replace', 'resetTo'];\n\nconst isLiteral = (value: unknown): value is string => typeof value === 'string' && value !== '' && !value.includes('{{');\n\nconst edgesOf = (definition: ActionDefinition, from: string, steps: unknown, known: ReadonlySet<string>, out: ChainStep[]): void => {\n if (!Array.isArray(steps)) return;\n for (const step of steps) {\n if (!isRecord(step)) continue;\n const emit = step['emit'];\n if (isRecord(emit) && isLiteral(emit['channel'])) out.push({ from, to: `channel:${emit['channel']}`, action: definition.id, via: 'emit' });\n if (step['reload'] === true) out.push({ from, to: `mount:${definition.id}`, action: definition.id, via: 'reload' });\n for (const key of NAV_KEYS) {\n const nav = step[key];\n if (isRecord(nav) && isLiteral(nav['action']) && known.has(nav['action'])) out.push({ from, to: `mount:${nav['action']}`, action: definition.id, via: key });\n }\n if (typeof step['call'] === 'string') {\n edgesOf(definition, from, step['onSuccess'], known, out);\n edgesOf(definition, from, step['onError'], known, out);\n }\n }\n};\n\nconst label = (node: string): string => (node.startsWith('channel:') ? node.slice('channel:'.length) : `mount ${node.slice('mount:'.length)}`);\n\nexport const chainCycles = (definitions: Record<string, ActionDefinition> | readonly ActionDefinition[]): ChainCycle[] => {\n const defs = Array.isArray(definitions) ? [...definitions] : Object.values(definitions);\n const known = new Set(defs.map((definition) => definition.id));\n const edges: ChainStep[] = [];\n for (const definition of defs) {\n for (const trigger of definition.triggers ?? []) {\n if (isLiteral(trigger.message)) edgesOf(definition, `channel:${trigger.message}`, trigger.do, known, edges);\n }\n edgesOf(definition, `mount:${definition.id}`, definition.lifecycle?.mount, known, edges);\n }\n const outgoing = new Map<string, ChainStep[]>();\n for (const edge of edges) outgoing.set(edge.from, [...(outgoing.get(edge.from) ?? []), edge]);\n\n // One cycle per strongly connected component that has one (Tarjan), so a\n // tangle of triggers reports once, not once per rotation of every loop in it.\n const index = new Map<string, number>();\n const low = new Map<string, number>();\n const onStack = new Set<string>();\n const stack: string[] = [];\n const components: string[][] = [];\n let counter = 0;\n const connect = (node: string): void => {\n index.set(node, counter);\n low.set(node, counter);\n counter += 1;\n stack.push(node);\n onStack.add(node);\n for (const edge of outgoing.get(node) ?? []) {\n if (!index.has(edge.to)) {\n connect(edge.to);\n low.set(node, Math.min(low.get(node) ?? 0, low.get(edge.to) ?? 0));\n } else if (onStack.has(edge.to)) {\n low.set(node, Math.min(low.get(node) ?? 0, index.get(edge.to) ?? 0));\n }\n }\n if (low.get(node) !== index.get(node)) return;\n const component: string[] = [];\n for (let top = stack.pop(); top !== undefined; top = stack.pop()) {\n onStack.delete(top);\n component.push(top);\n if (top === node) break;\n }\n components.push(component);\n };\n for (const node of [...outgoing.keys()].sort()) if (!index.has(node)) connect(node);\n\n // A path round the component from its first node back to it, by\n // breadth-first search inside the component — the shortest such cycle.\n const cycleIn = (component: readonly string[]): ChainStep[] | undefined => {\n const members = new Set(component);\n const start = [...component].sort()[0];\n if (start === undefined) return undefined;\n const via = new Map<string, ChainStep>();\n const queue = [start];\n for (let node = queue.shift(); node !== undefined; node = queue.shift()) {\n for (const edge of outgoing.get(node) ?? []) {\n if (!members.has(edge.to)) continue;\n if (edge.to === start) {\n const steps = [edge];\n for (let back = via.get(node); back !== undefined; back = via.get(back.from)) steps.unshift(back);\n return steps;\n }\n if (via.has(edge.to)) continue;\n via.set(edge.to, edge);\n queue.push(edge.to);\n }\n }\n return undefined;\n };\n\n return components\n .map(cycleIn)\n .filter((steps): steps is ChainStep[] => steps !== undefined)\n .map((steps) => ({\n steps,\n path: [label(steps[0]?.from ?? ''), ...steps.map((step) => `—${step.via} (${step.action})→ ${label(step.to)}`)].join(' '),\n }))\n .sort((a, b) => a.path.localeCompare(b.path));\n};\n"]}
|