@graphrefly/graphrefly 0.27.0 → 0.29.0

package/dist/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/patterns/index.ts","../src/patterns/domain-templates.ts","../src/patterns/reduction.ts","../src/patterns/graphspec.ts","../src/patterns/guarded-execution.ts","../src/patterns/harness/index.ts","../src/patterns/harness/bridge.ts","../src/patterns/harness/types.ts","../src/patterns/harness/strategy.ts","../src/patterns/harness/loop.ts","../src/patterns/harness/profile.ts","../src/patterns/harness/trace.ts","../src/patterns/lens.ts","../src/patterns/resilient-pipeline.ts","../src/patterns/surface/index.ts","../src/patterns/surface/errors.ts","../src/patterns/surface/create.ts","../src/patterns/surface/reduce.ts","../src/patterns/surface/snapshot.ts","../src/index.ts"],"sourcesContent":["/**\n * Patterns layer: domain/solution helpers (Phase 4+).\n */\n\nexport * as ai from \"./ai.js\";\nexport * as accountability from \"./audit.js\";\nexport * as cqrs from \"./cqrs.js\";\nexport * as demoShell from \"./demo-shell.js\";\nexport * as domainTemplates from \"./domain-templates.js\";\nexport * as graphspec from \"./graphspec.js\";\nexport * as guarded from \"./guarded-execution.js\";\nexport * as harness from \"./harness/index.js\";\nexport * as lens from \"./lens.js\";\nexport * as memory from \"./memory.js\";\nexport * as messaging from \"./messaging.js\";\nexport * as orchestration from \"./orchestration.js\";\nexport * as layout from \"./reactive-layout/index.js\";\nexport * as reduction from \"./reduction.js\";\nexport * as resilientPipeline from \"./resilient-pipeline.js\";\n// Surface layer (§9.3-core): top-level + namespaced. The surface is the\n// entry point for @graphrefly/mcp-server and @graphrefly/cli, so named\n// exports live at the root alongside `core`/`graph`/`extra` style.\nexport * from \"./surface/index.js\";\nexport * as surface from \"./surface/index.js\";\n","/**\n * Domain templates (roadmap §8.2).\n *\n * Opinionated Graph factories for common \"info → action\" domains.\n * Each template wires up §8.1 reduction primitives (stratify, funnel, feedback,\n * budgetGate, scorer) with domain-specific stages. Users fork/extend by\n * accessing named nodes and swapping stages.\n *\n * **Source injection (option B):** templates accept a `source` node, not a\n * hardcoded adapter. Pass `fromOTel(...)`, `fromGitHook(...)`, or a test\n * `state()` — the topology is the same.\n *\n * @module\n */\n\nimport { batch } from \"../core/batch.js\";\nimport { DATA } from \"../core/messages.js\";\nimport type { Node } from \"../core/node.js\";\nimport { derived, effect, state } from \"../core/sugar.js\";\nimport { reactiveLog } from \"../extra/reactive-log.js\";\nimport { Graph, type GraphOptions } from \"../graph/graph.js\";\nimport { feedback, type StratifyRule, scorer, stratify } from \"./reduction.js\";\n\n// ---------------------------------------------------------------------------\n// Shared\n// ---------------------------------------------------------------------------\n\nimport { domainMeta, keepalive } from \"./_internal.js\";\n\nfunction baseMeta(kind: string, extra?: Record<string, unknown>): Record<string, unknown> {\n\treturn domainMeta(\"domain_template\", kind, extra);\n}\n\n// ---------------------------------------------------------------------------\n// 1. observabilityGraph\n// ---------------------------------------------------------------------------\n\n/** Stratification branch config for observability signals. */\nexport type ObservabilityBranch = {\n\tname: string;\n\tclassify: (value: unknown) => boolean;\n};\n\n/** Options for {@link observabilityGraph}. */\nexport type ObservabilityGraphOptions = GraphOptions & {\n\t/** Ingested signal source (e.g. fromOTel(...) or test state). */\n\tsource: Node<unknown>;\n\n\t/**\n\t * Classification rules for signal stratification.\n\t * Default: errors / traces / metrics branches.\n\t */\n\tbranches?: ObservabilityBranch[];\n\n\t/**\n\t * Correlation function: receives stratified branch values and produces\n\t * correlated insights. Default: identity pass-through.\n\t */\n\tcorrelate?: (values: unknown[]) => unknown;\n\n\t/**\n\t * SLO verification function: returns a verification result for a\n\t * correlated insight. Default: always passes.\n\t */\n\tsloCheck?: (value: unknown) => unknown;\n\n\t/**\n\t * Scorer weights for alert prioritization. One per branch.\n\t * Default: equal weights [1, 1, 1].\n\t */\n\tweights?: number[];\n\n\t/** Max feedback iterations for false-positive learning. Default: 5. */\n\tmaxFeedbackIterations?: number;\n};\n\n/**\n * OTel ingest → stratified reduction → correlation → SLO verification →\n * alert prioritization → output.\n *\n * Well-known node names:\n * - `\"source\"` — injected signal source\n * - `\"stratify::branch/<name>\"` — per-branch classification\n * - `\"correlate\"` — cross-branch correlation\n * - `\"slo_value\"`, `\"slo_verified\"` — SLO verification pair\n * - `\"alerts\"` — scored, prioritized output\n * - `\"output\"` — final output (alias for alerts)\n *\n * @category patterns\n */\nexport function observabilityGraph(name: string, opts: ObservabilityGraphOptions): Graph {\n\tconst g = new Graph(name, opts);\n\n\t// --- Source ---\n\tg.add(\"source\", opts.source);\n\n\t// --- Stratify ---\n\tconst defaultBranches: ObservabilityBranch[] = [\n\t\t{ name: \"errors\", classify: (v) => isTagged(v, \"error\") },\n\t\t{ name: \"traces\", classify: (v) => isTagged(v, \"trace\") },\n\t\t{ name: \"metrics\", classify: (v) => isTagged(v, \"metric\") },\n\t];\n\tconst branches = opts.branches ?? defaultBranches;\n\tconst rules: StratifyRule<unknown>[] = branches.map((b) => ({\n\t\tname: b.name,\n\t\tclassify: b.classify,\n\t}));\n\tconst strat = stratify(\"stratify\", opts.source, rules);\n\tg.mount(\"stratify\", strat);\n\n\t// --- Correlate ---\n\t// Collect latest value from each branch, produce correlated output.\n\t// Wrap each branch in a derived with `initial: null` so every branch has\n\t// a seed value at subscribe time — this lets the correlate wave reach its\n\t// first-run gate even when the classifier only routes to one branch.\n\tconst branchNodes = branches.map((b) => {\n\t\ttry {\n\t\t\tconst raw = g.resolve(`stratify::branch/${b.name}`);\n\t\t\treturn derived([raw as Node], ([v]) => v, { initial: null });\n\t\t} catch {\n\t\t\treturn state<unknown>(null);\n\t\t}\n\t});\n\tconst correlateFn = opts.correlate ?? ((vals: unknown[]) => vals);\n\tconst correlateNode = derived<unknown>(\n\t\tbranchNodes as Node[],\n\t\t(vals) => correlateFn(vals as unknown[]),\n\t\t{\n\t\t\tmeta: baseMeta(\"observability\", { stage: \"correlate\" }),\n\t\t},\n\t);\n\tg.add(\"correlate\", correlateNode);\n\n\t// --- SLO verification ---\n\tconst sloCheckFn = opts.sloCheck ?? (() => ({ pass: true }));\n\tconst sloValue = derived<unknown>([correlateNode], (vals) => vals[0], {\n\t\tmeta: baseMeta(\"observability\", { stage: \"slo_value\" }),\n\t});\n\tconst sloVerified = derived<unknown>([sloValue], (vals) => sloCheckFn(vals[0]), {\n\t\tmeta: baseMeta(\"observability\", { stage: \"slo_verified\" }),\n\t});\n\tg.add(\"slo_value\", sloValue);\n\tg.add(\"slo_verified\", sloVerified);\n\n\t// --- Alert scorer ---\n\tconst weightValues = opts.weights ?? branches.map(() => 1);\n\tconst signalNodes = branchNodes.map((bn) =>\n\t\tderived<number>([bn], (vals) => (vals[0] != null ? 1 : 0)),\n\t);\n\tconst weightNodes = weightValues.map((w) => state<number>(w));\n\tfor (let i = 0; i < signalNodes.length; i++) {\n\t\tg.add(`__signal_${i}`, signalNodes[i] as Node<unknown>);\n\t\tg.add(`__weight_${i}`, weightNodes[i] as Node<unknown>);\n\t}\n\tconst alerts = scorer(\n\t\tsignalNodes as ReadonlyArray<Node<number>>,\n\t\tweightNodes as ReadonlyArray<Node<number>>,\n\t);\n\tg.add(\"alerts\", alerts as Node<unknown>);\n\n\t// --- Output alias ---\n\tconst output = derived<unknown>(\n\t\t[alerts as Node, sloVerified],\n\t\t(vals) => ({\n\t\t\tscored: vals[0],\n\t\t\tslo: vals[1],\n\t\t}),\n\t\t{\n\t\t\tmeta: baseMeta(\"observability\", { stage: \"output\" }),\n\t\t},\n\t);\n\tg.add(\"output\", output);\n\n\t// --- Feedback (false-positive learning) ---\n\t// SLO failures feed back to re-check with updated context.\n\tconst fbReentry = state<unknown>(null, {\n\t\tmeta: baseMeta(\"observability\", { stage: \"feedback_reentry\" }),\n\t});\n\tg.add(\"feedback_reentry\", fbReentry);\n\tconst fbCondition = derived<unknown>(\n\t\t[sloVerified],\n\t\t(vals) => {\n\t\t\tconst result = vals[0] as Record<string, unknown> | null;\n\t\t\tif (result && result.pass === false) return result;\n\t\t\treturn null;\n\t\t},\n\t\t{\n\t\t\tmeta: baseMeta(\"observability\", { stage: \"feedback_condition\" }),\n\t\t},\n\t);\n\tg.add(\"feedback_condition\", fbCondition as Node<unknown>);\n\tfeedback(g, \"feedback_condition\", \"feedback_reentry\", {\n\t\tmaxIterations: opts.maxFeedbackIterations ?? 5,\n\t});\n\n\treturn g;\n}\n\n// ---------------------------------------------------------------------------\n// 2. issueTrackerGraph\n// ---------------------------------------------------------------------------\n\n/** A structured issue extracted from raw findings. */\nexport type ExtractedIssue = {\n\tid: string;\n\ttitle: string;\n\tseverity: number;\n\tsource: string;\n\traw: unknown;\n};\n\n/** Options for {@link issueTrackerGraph}. */\nexport type IssueTrackerGraphOptions = GraphOptions & {\n\t/** Findings source (e.g. fromGitHook(...), fromFSWatch(...)). */\n\tsource: Node<unknown>;\n\n\t/**\n\t * Extract structured issues from raw findings.\n\t * Default: wraps raw value as a single issue.\n\t */\n\textract?: (raw: unknown) => ExtractedIssue;\n\n\t/**\n\t * Verify an extracted issue (assertion check).\n\t * Default: always valid.\n\t */\n\tverify?: (issue: ExtractedIssue) => unknown;\n\n\t/**\n\t * Detect regression by comparing against known patterns.\n\t * Receives (current issue, known patterns).\n\t * Default: no regression detected.\n\t */\n\tdetectRegression?: (issue: ExtractedIssue, known: unknown) => unknown;\n\n\t/** Max feedback iterations for re-scanning. Default: 3. */\n\tmaxFeedbackIterations?: number;\n};\n\n/**\n * Findings ingest → extraction → verification → regression detection →\n * distillation → prioritized queue.\n *\n * Well-known node names:\n * - `\"source\"` — injected findings source\n * - `\"extract\"` — structured issue extraction\n * - `\"verify\"` — issue verification\n * - `\"known_patterns\"` — accumulated known issue patterns (state)\n * - `\"regression\"` — regression detection\n * - `\"priority\"` — severity-based prioritization\n * - `\"output\"` — final prioritized output\n *\n * @category patterns\n */\nexport function issueTrackerGraph(name: string, opts: IssueTrackerGraphOptions): Graph {\n\tconst g = new Graph(name, opts);\n\n\t// --- Source ---\n\tg.add(\"source\", opts.source);\n\n\t// --- Extract ---\n\tlet _issueCounter = 0;\n\tconst defaultExtract = (raw: unknown): ExtractedIssue => ({\n\t\tid: `issue-${++_issueCounter}`,\n\t\ttitle: String(raw),\n\t\tseverity: 1,\n\t\tsource: \"unknown\",\n\t\traw,\n\t});\n\tconst extractFn = opts.extract ?? defaultExtract;\n\tconst extractNode = derived<ExtractedIssue>([opts.source], (vals) => extractFn(vals[0]), {\n\t\tmeta: baseMeta(\"issue_tracker\", { stage: \"extract\" }),\n\t});\n\tg.add(\"extract\", extractNode as Node<unknown>);\n\n\t// --- Verify ---\n\tconst verifyFn = opts.verify ?? (() => ({ valid: true }));\n\tconst verifyNode = derived<unknown>(\n\t\t[extractNode as Node],\n\t\t(vals) => {\n\t\t\tconst issue = vals[0] as ExtractedIssue;\n\t\t\treturn { issue, verification: verifyFn(issue) };\n\t\t},\n\t\t{\n\t\t\tmeta: baseMeta(\"issue_tracker\", { stage: \"verify\" }),\n\t\t},\n\t);\n\tg.add(\"verify\", verifyNode);\n\n\t// --- Known patterns (memory / distillation state) ---\n\tconst knownPatterns = state<unknown[]>([], {\n\t\tmeta: baseMeta(\"issue_tracker\", { stage: \"known_patterns\" }),\n\t});\n\tg.add(\"known_patterns\", knownPatterns as Node<unknown>);\n\n\t// --- Regression detection ---\n\tconst detectFn = opts.detectRegression ?? (() => ({ regression: false }));\n\tconst regressionNode = derived<unknown>(\n\t\t[extractNode as Node, knownPatterns as Node],\n\t\t(vals) => {\n\t\t\tconst issue = vals[0] as ExtractedIssue;\n\t\t\tconst known = vals[1];\n\t\t\treturn { issue, regression: detectFn(issue, known) };\n\t\t},\n\t\t{ meta: baseMeta(\"issue_tracker\", { stage: \"regression\" }) },\n\t);\n\tg.add(\"regression\", regressionNode);\n\n\t// --- Priority scoring ---\n\tconst severitySignal = derived<number>([extractNode as Node], (vals) => {\n\t\tconst issue = vals[0] as ExtractedIssue;\n\t\treturn issue?.severity ?? 0;\n\t});\n\tconst regressionSignal = derived<number>([regressionNode], (vals) => {\n\t\tconst r = vals[0] as Record<string, unknown> | null;\n\t\treturn r?.regression ? 2 : 0;\n\t});\n\tg.add(\"__severity_signal\", severitySignal as Node<unknown>);\n\tg.add(\"__regression_signal\", regressionSignal as Node<unknown>);\n\n\tconst severityWeight = state<number>(1);\n\tconst regressionWeight = state<number>(1.5);\n\tg.add(\"__severity_weight\", severityWeight as Node<unknown>);\n\tg.add(\"__regression_weight\", regressionWeight as Node<unknown>);\n\n\tconst priority = scorer([severitySignal, regressionSignal], [severityWeight, regressionWeight]);\n\tg.add(\"priority\", priority as Node<unknown>);\n\n\t// --- Output ---\n\tconst output = derived<unknown>(\n\t\t[verifyNode, regressionNode, priority as Node],\n\t\t(vals) => ({\n\t\t\tverified: vals[0],\n\t\t\tregression: vals[1],\n\t\t\tpriority: vals[2],\n\t\t}),\n\t\t{ meta: baseMeta(\"issue_tracker\", { stage: \"output\" }) },\n\t);\n\tg.add(\"output\", output);\n\n\t// --- Feedback (re-scan on verification failure) ---\n\tconst fbReentry = state<unknown>(null, {\n\t\tmeta: baseMeta(\"issue_tracker\", { stage: \"feedback_reentry\" }),\n\t});\n\tg.add(\"feedback_reentry\", fbReentry);\n\tconst fbCondition = derived<unknown>(\n\t\t[verifyNode],\n\t\t(vals) => {\n\t\t\tconst result = vals[0] as Record<string, unknown> | null;\n\t\t\tif (result) {\n\t\t\t\tconst v = result.verification as Record<string, unknown> | null;\n\t\t\t\tif (v && v.valid === false) return result;\n\t\t\t}\n\t\t\treturn null;\n\t\t},\n\t\t{\n\t\t\tmeta: baseMeta(\"issue_tracker\", { stage: \"feedback_condition\" }),\n\t\t},\n\t);\n\tg.add(\"feedback_condition\", fbCondition as Node<unknown>);\n\tfeedback(g, \"feedback_condition\", \"feedback_reentry\", {\n\t\tmaxIterations: opts.maxFeedbackIterations ?? 3,\n\t});\n\n\treturn g;\n}\n\n// ---------------------------------------------------------------------------\n// 3. contentModerationGraph\n// ---------------------------------------------------------------------------\n\n/** Classification result from LLM moderation. */\nexport type ModerationResult = {\n\tlabel: \"safe\" | \"review\" | \"block\";\n\tconfidence: number;\n\treason?: string;\n\toriginal: unknown;\n};\n\n/** Options for {@link contentModerationGraph}. */\nexport type ContentModerationGraphOptions = GraphOptions & {\n\t/** Content source (text/multimedia ingest). */\n\tsource: Node<unknown>;\n\n\t/**\n\t * Classification function: returns a ModerationResult.\n\t * Default: labels everything \"review\" with confidence 0.5.\n\t */\n\tclassify?: (content: unknown) => ModerationResult;\n\n\t/** System prompt for LLM classification. */\n\tsystemPrompt?: string;\n\n\t/** Scorer weights: [safe, review, block]. Default: [0.1, 1, 2]. */\n\tweights?: [number, number, number];\n\n\t/** Max feedback iterations for policy refinement. Default: 5. */\n\tmaxFeedbackIterations?: number;\n\n\t/** Max review queue size. When set, oldest entries are trimmed on overflow. */\n\tmaxQueueSize?: number;\n};\n\n/**\n * Content ingest → LLM/rule classification → stratified routing (safe/review/block) →\n * human review queue → scorer → feedback (false positives → policy refinement) → output.\n *\n * Well-known node names:\n * - `\"source\"` — content ingest\n * - `\"classify\"` — LLM or rule-based classification\n * - `\"stratify::branch/safe\"`, `\"stratify::branch/review\"`, `\"stratify::branch/block\"` — routed branches\n * - `\"review_queue\"` — state node for human review items\n * - `\"priority\"` — scored priority output\n * - `\"policy\"` — writable state for policy refinement\n * - `\"output\"` — final moderation output\n *\n * @category patterns\n */\nexport function contentModerationGraph(name: string, opts: ContentModerationGraphOptions): Graph {\n\tconst g = new Graph(name, opts);\n\n\t// --- Source ---\n\tg.add(\"source\", opts.source);\n\n\t// --- Classify ---\n\tconst defaultClassify = (content: unknown): ModerationResult => ({\n\t\tlabel: \"review\",\n\t\tconfidence: 0.5,\n\t\toriginal: content,\n\t});\n\tconst classifyFn = opts.classify ?? defaultClassify;\n\tconst classifyNode = derived<ModerationResult>([opts.source], (vals) => classifyFn(vals[0]), {\n\t\tmeta: baseMeta(\"content_moderation\", { stage: \"classify\" }),\n\t});\n\tg.add(\"classify\", classifyNode as Node<unknown>);\n\n\t// --- Stratify (safe / review / block) ---\n\tconst strat = stratify<ModerationResult>(\"stratify\", classifyNode, [\n\t\t{ name: \"safe\", classify: (v) => v.label === \"safe\" },\n\t\t{ name: \"review\", classify: (v) => v.label === \"review\" },\n\t\t{ name: \"block\", classify: (v) => v.label === \"block\" },\n\t]);\n\tg.mount(\"stratify\", strat);\n\n\t// --- Review queue (reactiveLog — O(1) append, bounded) ---\n\tconst reviewLog = reactiveLog<ModerationResult>([], {\n\t\tname: \"review_queue\",\n\t\tmaxSize: opts.maxQueueSize,\n\t});\n\tg.add(\"review_queue\", reviewLog.entries as Node<unknown>);\n\n\t// Bridge review branch → review queue accumulator\n\tlet reviewBranch: Node<unknown>;\n\ttry {\n\t\treviewBranch = g.resolve(\"stratify::branch/review\");\n\t} catch {\n\t\treviewBranch = state<unknown>(null);\n\t\tg.add(\"__review_fallback\", reviewBranch);\n\t}\n\tconst reviewAccumulator = effect([reviewBranch], (vals) => {\n\t\tconst item = vals[0] as ModerationResult | null;\n\t\tif (item) {\n\t\t\treviewLog.append(item);\n\t\t}\n\t});\n\tg.add(\"__review_accumulator\", reviewAccumulator as Node<unknown>);\n\tg.addDisposer(keepalive(reviewAccumulator as Node<unknown>));\n\ttry {\n\t} catch {\n\t\t// fallback branch — no stratify edge to register\n\t}\n\n\t// --- Policy state (human/LLM writable) ---\n\tconst policy = state<Record<string, unknown>>(\n\t\t{},\n\t\t{\n\t\t\tmeta: baseMeta(\"content_moderation\", {\n\t\t\t\tstage: \"policy\",\n\t\t\t\taccess: \"both\",\n\t\t\t\tdescription: \"Moderation policy rules — updated via feedback\",\n\t\t\t}),\n\t\t},\n\t);\n\tg.add(\"policy\", policy as Node<unknown>);\n\n\t// --- Priority scorer ---\n\tconst weights = opts.weights ?? [0.1, 1, 2];\n\tconst confidenceSignal = derived<number>([classifyNode as Node], (vals) => {\n\t\tconst r = vals[0] as ModerationResult | null;\n\t\treturn r?.confidence ?? 0;\n\t});\n\tconst severitySignal = derived<number>([classifyNode as Node], (vals) => {\n\t\tconst r = vals[0] as ModerationResult | null;\n\t\tif (!r) return 0;\n\t\treturn r.label === \"block\" ? weights[2] : r.label === \"review\" ? weights[1] : weights[0];\n\t});\n\tg.add(\"__confidence_signal\", confidenceSignal as Node<unknown>);\n\tg.add(\"__severity_signal\", severitySignal as Node<unknown>);\n\n\tconst wConfidence = state<number>(1);\n\tconst wSeverity = state<number>(1);\n\tg.add(\"__w_confidence\", wConfidence as Node<unknown>);\n\tg.add(\"__w_severity\", wSeverity as Node<unknown>);\n\n\tconst priority = scorer([confidenceSignal, severitySignal], [wConfidence, wSeverity]);\n\tg.add(\"priority\", priority as Node<unknown>);\n\n\t// --- Output ---\n\tconst output = derived<unknown>(\n\t\t[classifyNode as Node, priority as Node],\n\t\t(vals) => ({\n\t\t\tclassification: vals[0],\n\t\t\tpriority: vals[1],\n\t\t}),\n\t\t{ meta: baseMeta(\"content_moderation\", { stage: \"output\" }) },\n\t);\n\tg.add(\"output\", output);\n\n\t// --- Feedback (false positive → policy refinement) ---\n\t// Feedback condition: human marks a review item as false positive.\n\t// When review_queue changes and policy exists, signal for update.\n\tconst fbCondition = derived<unknown>(\n\t\t[reviewLog.entries as Node, policy as Node],\n\t\t(vals) => {\n\t\t\tconst entries = vals[0] as readonly ModerationResult[] | null;\n\t\t\tif (entries && entries.length > 0) {\n\t\t\t\tconst latest = entries[entries.length - 1];\n\t\t\t\t// Items explicitly marked as false positive feed back\n\t\t\t\tif (latest && (latest as unknown as Record<string, unknown>).falsePositive) {\n\t\t\t\t\treturn latest;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn null;\n\t\t},\n\t\t{\n\t\t\tmeta: baseMeta(\"content_moderation\", { stage: \"feedback_condition\" }),\n\t\t},\n\t);\n\tg.add(\"feedback_condition\", fbCondition as Node<unknown>);\n\tfeedback(g, \"feedback_condition\", \"policy\", {\n\t\tmaxIterations: opts.maxFeedbackIterations ?? 5,\n\t});\n\n\treturn g;\n}\n\n// ---------------------------------------------------------------------------\n// 4. dataQualityGraph\n// ---------------------------------------------------------------------------\n\n/** Schema validation result. */\nexport type ValidationResult = {\n\tvalid: boolean;\n\terrors: string[];\n\trecord: unknown;\n};\n\n/** Anomaly detection result. */\nexport type AnomalyResult = {\n\tanomaly: boolean;\n\tscore: number;\n\tdetail?: string;\n\trecord: unknown;\n};\n\n/** Options for {@link dataQualityGraph}. */\nexport type DataQualityGraphOptions = GraphOptions & {\n\t/** Data source (e.g. fromPrisma(...), fromKysely(...)). */\n\tsource: Node<unknown>;\n\n\t/**\n\t * Schema validation function.\n\t * Default: always valid.\n\t */\n\tvalidate?: (record: unknown) => ValidationResult;\n\n\t/**\n\t * Anomaly detection function.\n\t * Default: no anomaly.\n\t */\n\tdetectAnomaly?: (record: unknown) => AnomalyResult;\n\n\t/**\n\t * Drift detection: compares current record against baseline.\n\t * Default: no drift.\n\t */\n\tdetectDrift?: (record: unknown, baseline: unknown) => unknown;\n\n\t/**\n\t * Remediation suggestion function.\n\t * Default: no suggestion.\n\t */\n\tsuggest?: (result: { validation: ValidationResult; anomaly: AnomalyResult }) => unknown;\n\n\t/** Max feedback iterations for rule refinement. Default: 3. */\n\tmaxFeedbackIterations?: number;\n};\n\n/**\n * Data ingest → schema validation → anomaly detection → drift alerting →\n * auto-remediation suggestions → output.\n *\n * Well-known node names:\n * - `\"source\"` — data ingest\n * - `\"validate\"` — schema validation\n * - `\"anomaly\"` — anomaly detection\n * - `\"baseline\"` — rolling baseline state\n * - `\"drift\"` — drift detection\n * - `\"remediate\"` — auto-remediation suggestions\n * - `\"output\"` — combined quality report\n *\n * @category patterns\n */\nexport function dataQualityGraph(name: string, opts: DataQualityGraphOptions): Graph {\n\tconst g = new Graph(name, opts);\n\n\t// --- Source ---\n\tg.add(\"source\", opts.source);\n\n\t// --- Schema validation ---\n\tconst validateFn =\n\t\topts.validate ??\n\t\t((record: unknown): ValidationResult => ({\n\t\t\tvalid: true,\n\t\t\terrors: [],\n\t\t\trecord,\n\t\t}));\n\tconst validateNode = derived<ValidationResult | undefined>(\n\t\t[opts.source],\n\t\t(vals) => (vals[0] != null ? validateFn(vals[0]) : undefined),\n\t\t{ meta: baseMeta(\"data_quality\", { stage: \"validate\" }) },\n\t);\n\tg.add(\"validate\", validateNode as Node<unknown>);\n\n\t// --- Anomaly detection ---\n\tconst detectAnomalyFn =\n\t\topts.detectAnomaly ??\n\t\t((record: unknown): AnomalyResult => ({\n\t\t\tanomaly: false,\n\t\t\tscore: 0,\n\t\t\trecord,\n\t\t}));\n\tconst anomalyNode = derived<AnomalyResult | undefined>(\n\t\t[opts.source],\n\t\t(vals) => (vals[0] != null ? detectAnomalyFn(vals[0]) : undefined),\n\t\t{ meta: baseMeta(\"data_quality\", { stage: \"anomaly\" }) },\n\t);\n\tg.add(\"anomaly\", anomalyNode as Node<unknown>);\n\n\t// --- Baseline (rolling state) ---\n\tconst baseline = state<unknown>(null, {\n\t\tmeta: baseMeta(\"data_quality\", {\n\t\t\tstage: \"baseline\",\n\t\t\tdescription: \"Rolling baseline for drift detection\",\n\t\t}),\n\t});\n\tg.add(\"baseline\", baseline);\n\n\t// Update baseline on valid records\n\tconst baselineUpdater = effect([validateNode as Node], (vals) => {\n\t\tconst result = vals[0] as ValidationResult;\n\t\tif (result?.valid) {\n\t\t\tbatch(() => {\n\t\t\t\tbaseline.down([[DATA, result.record]]);\n\t\t\t});\n\t\t}\n\t});\n\tg.add(\"__baseline_updater\", baselineUpdater as Node<unknown>);\n\tkeepalive(baselineUpdater as Node<unknown>);\n\n\t// --- Drift detection ---\n\tconst detectDriftFn = opts.detectDrift ?? (() => ({ drift: false }));\n\tconst driftNode = derived<unknown>(\n\t\t[opts.source, baseline],\n\t\t(vals) => detectDriftFn(vals[0], vals[1]),\n\t\t{ meta: baseMeta(\"data_quality\", { stage: \"drift\" }) },\n\t);\n\tg.add(\"drift\", driftNode);\n\n\t// --- Remediation suggestions ---\n\tconst suggestFn = opts.suggest ?? (() => null);\n\tconst remediateNode = derived<unknown>(\n\t\t[validateNode as Node, anomalyNode as Node],\n\t\t(vals) =>\n\t\t\tsuggestFn({\n\t\t\t\tvalidation: vals[0] as ValidationResult,\n\t\t\t\tanomaly: vals[1] as AnomalyResult,\n\t\t\t}),\n\t\t{ meta: baseMeta(\"data_quality\", { stage: \"remediate\" }) },\n\t);\n\tg.add(\"remediate\", remediateNode);\n\n\t// --- Output ---\n\tconst output = derived<unknown>(\n\t\t[validateNode as Node, anomalyNode as Node, driftNode, remediateNode],\n\t\t(vals) => ({\n\t\t\tvalidation: vals[0],\n\t\t\tanomaly: vals[1],\n\t\t\tdrift: vals[2],\n\t\t\tremediation: vals[3],\n\t\t}),\n\t\t{ meta: baseMeta(\"data_quality\", { stage: \"output\" }) },\n\t);\n\tg.add(\"output\", output);\n\n\t// --- Feedback (anomaly → validation rule refinement) ---\n\tconst validationRules = state<unknown[]>([], {\n\t\tmeta: baseMeta(\"data_quality\", { stage: \"validation_rules\" }),\n\t});\n\tg.add(\"validation_rules\", validationRules as Node<unknown>);\n\n\tconst fbCondition = derived<unknown>(\n\t\t[anomalyNode as Node],\n\t\t(vals) => {\n\t\t\tconst a = vals[0] as AnomalyResult | null;\n\t\t\tif (a?.anomaly) return a;\n\t\t\treturn null;\n\t\t},\n\t\t{\n\t\t\tmeta: baseMeta(\"data_quality\", { stage: \"feedback_condition\" }),\n\t\t},\n\t);\n\tg.add(\"feedback_condition\", fbCondition as Node<unknown>);\n\tfeedback(g, \"feedback_condition\", \"validation_rules\", {\n\t\tmaxIterations: opts.maxFeedbackIterations ?? 3,\n\t});\n\n\treturn g;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\n/** Check if a value has a `type` or `kind` tag matching the given label. */\nfunction isTagged(value: unknown, tag: string): boolean {\n\tif (value == null || typeof value !== \"object\") return false;\n\tconst v = value as Record<string, unknown>;\n\treturn v.type === tag || v.kind === tag;\n}\n","/**\n * Reduction primitives (roadmap §8.1).\n *\n * Composable building blocks for taking heterogeneous massive inputs and producing\n * prioritized, auditable, human-actionable output. Each primitive is either a Graph\n * factory or a Node factory, built on top of core + extra primitives.\n *\n * @module\n */\n\nimport { batch } from \"../core/batch.js\";\nimport type { NodeActions } from \"../core/config.js\";\nimport {\n\tCOMPLETE,\n\tDATA,\n\tDIRTY,\n\tERROR,\n\ttype Message,\n\tPAUSE,\n\tRESOLVED,\n\tRESUME,\n\tTEARDOWN,\n} from \"../core/messages.js\";\nimport { type Node, type NodeOptions, node } from \"../core/node.js\";\nimport { derived, effect, state } from \"../core/sugar.js\";\nimport { merge } from \"../extra/operators.js\";\nimport { reactiveMap } from \"../extra/reactive-map.js\";\nimport { Graph, type GraphOptions } from \"../graph/graph.js\";\n\n// ---------------------------------------------------------------------------\n// Shared helpers (same pattern as orchestration.ts)\n// ---------------------------------------------------------------------------\n\nexport type StepRef = string | Node<unknown>;\n\nimport { domainMeta, keepalive, tryIncrementBounded } from \"./_internal.js\";\n\nfunction baseMeta(kind: string, meta?: Record<string, unknown>): Record<string, unknown> {\n\treturn domainMeta(\"reduction\", kind, meta);\n}\n\n// ---------------------------------------------------------------------------\n// stratify\n// ---------------------------------------------------------------------------\n\n/** A single routing rule for {@link stratify}. */\nexport type StratifyRule<T> = {\n\t/** Branch name (used as node name under `branch/<name>`). */\n\tname: string;\n\t/** Classifier: returns `true` if the value belongs to this branch. */\n\tclassify: (value: T) => boolean;\n\t/** Optional operator chain applied to the branch after classification. */\n\tops?: (n: Node<T>) => Node;\n};\n\n/** Options for {@link stratify}. */\nexport type StratifyOptions = GraphOptions & {\n\tmeta?: Record<string, unknown>;\n};\n\n/**\n * Route input to different reduction branches based on classifier functions.\n *\n * Each branch gets an independent operator chain. Rules are reactive — update\n * the `\"rules\"` state node to rewrite classification at runtime. Rule updates\n * affect **future items only** (streaming classification, not retroactive).\n *\n * Branch nodes are structural — created at construction time and persist for\n * the graph's lifetime. If a rule name is removed from the rules array, the\n * corresponding branch silently drops items (classifier not found). To tear\n * down a dead branch, call `graph.remove(\"branch/<name>\")`.\n *\n * @param name - Graph name.\n * @param source - Input node (registered externally or will be added as `\"source\"`).\n * @param rules - Initial routing rules.\n * @param opts - Optional graph/meta options.\n * @returns Graph with `\"source\"`, `\"rules\"`, and `\"branch/<name>\"` nodes.\n *\n * @category patterns\n */\nexport function stratify<T>(\n\tname: string,\n\tsource: Node<T>,\n\trules: ReadonlyArray<StratifyRule<T>>,\n\topts?: StratifyOptions,\n): Graph {\n\tconst g = new Graph(name, opts);\n\n\tg.add(\"source\", source as Node<unknown>);\n\tconst rulesNode = state<ReadonlyArray<StratifyRule<T>>>(rules, {\n\t\tmeta: baseMeta(\"stratify_rules\"),\n\t});\n\tg.add(\"rules\", rulesNode as Node<unknown>);\n\n\tfor (const rule of rules) {\n\t\t_addBranch(g, source, rulesNode, rule);\n\t}\n\n\treturn g;\n}\n\nfunction _addBranch<T>(\n\tgraph: Graph,\n\tsource: Node<T>,\n\trulesNode: Node<ReadonlyArray<StratifyRule<T>>>,\n\trule: StratifyRule<T>,\n): void {\n\tconst branchName = `branch/${rule.name}`;\n\n\t// Two-dep gating: intercepts messages from BOTH source (dep 0) and rules\n\t// (dep 1).  Classification is deferred until all dirty deps have settled,\n\t// eliminating the stale-rules race when both are updated in the same batch().\n\t//\n\t// Protocol: DIRTY is buffered until DATA arrives. If the classifier matches,\n\t// emit [DIRTY, DATA]. If not, emit [DIRTY, RESOLVED] so downstream exits\n\t// dirty status cleanly (spec §1.3.1). Source RESOLVED forwards as RESOLVED.\n\t// Rules-only changes produce no downstream emission (\"future items only\").\n\t//\n\t// Producer pattern with `[]` deps: the framework does NOT auto-propagate\n\t// DIRTY/RESOLVED/COMPLETE from source or rules. We forward source terminals\n\t// explicitly below, and we silently absorb rules signals — preserving the\n\t// \"future items only\" semantic (rules changes are invisible downstream).\n\tconst _noValue: unique symbol = Symbol(\"noValue\");\n\tlet sourceDirty = false;\n\tlet rulesDirty = false;\n\tlet sourcePhase2 = false; // source delivered DATA or RESOLVED this cycle\n\tlet sourceValue: T | typeof _noValue = _noValue; // DATA payload, or _noValue for RESOLVED\n\tlet pendingDirty = false; // owe downstream a DIRTY\n\t// Latest rules DATA, seeded at factory time (wiring-time external read —\n\t// allowed per foundation-redesign §3.6). Updated by the rules subscribe\n\t// handler so `resolve()` never reads `rulesNode.cache` from a reactive context.\n\tlet latestRules: ReadonlyArray<StratifyRule<T>> = rulesNode.cache ?? [];\n\n\tfunction resolve(actions: NodeActions): void {\n\t\tif (sourcePhase2) {\n\t\t\tsourcePhase2 = false;\n\t\t\tconst value = sourceValue;\n\t\t\tsourceValue = _noValue;\n\t\t\tif (value !== _noValue) {\n\t\t\t\t// Source emitted DATA — classify with settled rules\n\t\t\t\tconst currentRule = latestRules.find((r) => r.name === rule.name);\n\t\t\t\tlet matches = false;\n\t\t\t\ttry {\n\t\t\t\t\tmatches = currentRule?.classify(value) ?? false;\n\t\t\t\t} catch {\n\t\t\t\t\tmatches = false;\n\t\t\t\t}\n\t\t\t\tif (matches) {\n\t\t\t\t\tpendingDirty = false;\n\t\t\t\t\tactions.emit(value);\n\t\t\t\t} else {\n\t\t\t\t\tif (pendingDirty) {\n\t\t\t\t\t\tpendingDirty = false;\n\t\t\t\t\t\tactions.down([[DIRTY], [RESOLVED]]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Source RESOLVED (unchanged)\n\t\t\t\tif (pendingDirty) {\n\t\t\t\t\tpendingDirty = false;\n\t\t\t\t\tactions.down([[DIRTY], [RESOLVED]]);\n\t\t\t\t} else {\n\t\t\t\t\tactions.down([[RESOLVED]]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// else: rules-only change — no reclassification (\"future items only\")\n\t}\n\n\t// Producer pattern: manually subscribe to source and rules for per-message\n\t// interception (onMessage removed in v5)\n\tconst filterNode = node<T>(\n\t\t[],\n\t\t(_data, filterActions) => {\n\t\t\tconst srcUnsub = (source as Node).subscribe((msgs) => {\n\t\t\t\tfor (const msg of msgs) {\n\t\t\t\t\t_handleStratifyMessage(msg, 0, filterActions);\n\t\t\t\t}\n\t\t\t});\n\t\t\tconst rulesUnsub = (rulesNode as Node).subscribe((msgs) => {\n\t\t\t\tfor (const msg of msgs) {\n\t\t\t\t\t_handleStratifyMessage(msg, 1, filterActions);\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn () => {\n\t\t\t\tsrcUnsub();\n\t\t\t\trulesUnsub();\n\t\t\t};\n\t\t},\n\t\t{\n\t\t\tdescribeKind: \"derived\",\n\t\t\tmeta: baseMeta(\"stratify_branch\", { branch: rule.name }),\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t},\n\t);\n\n\tfunction _handleStratifyMessage(msg: Message, depIndex: number, actions: NodeActions): boolean {\n\t\tconst t = msg[0];\n\n\t\t// --- DIRTY (phase 1) ---\n\t\tif (t === DIRTY) {\n\t\t\tif (depIndex === 0) {\n\t\t\t\tsourceDirty = true;\n\t\t\t\tpendingDirty = true;\n\t\t\t} else {\n\t\t\t\trulesDirty = true;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\t// --- Phase 2 (DATA / RESOLVED) ---\n\t\tif (t === DATA || t === RESOLVED) {\n\t\t\tif (depIndex === 0) {\n\t\t\t\tsourceDirty = false;\n\t\t\t\tsourcePhase2 = true;\n\t\t\t\tsourceValue = t === DATA ? (msg[1] as T) : _noValue;\n\t\t\t} else {\n\t\t\t\t// Rules dep: capture DATA payload into closure before settling.\n\t\t\t\tif (t === DATA) {\n\t\t\t\t\tlatestRules = msg[1] as ReadonlyArray<StratifyRule<T>>;\n\t\t\t\t}\n\t\t\t\trulesDirty = false;\n\t\t\t}\n\n\t\t\t// Wait for all dirty deps to settle\n\t\t\tif (sourceDirty || rulesDirty) return true;\n\n\t\t\tresolve(actions);\n\t\t\treturn true;\n\t\t}\n\n\t\t// --- Terminal ---\n\t\tif (t === COMPLETE || t === ERROR || t === TEARDOWN) {\n\t\t\tsourceDirty = false;\n\t\t\trulesDirty = false;\n\t\t\tsourcePhase2 = false;\n\t\t\tsourceValue = _noValue;\n\t\t\tpendingDirty = false;\n\t\t\tif (depIndex === 0) {\n\t\t\t\tactions.down([msg]);\n\t\t\t}\n\t\t\t// Rules terminal: swallow (branch stays alive)\n\t\t\treturn true;\n\t\t}\n\n\t\t// Swallow PAUSE/RESUME/INVALIDATE from rules dep (internal impl detail)\n\t\tif (depIndex === 1) return true;\n\n\t\treturn false;\n\t}\n\n\tgraph.add(branchName, filterNode as Node<unknown>);\n\n\t// If the rule has an ops chain, apply it and connect the edge\n\tif (rule.ops) {\n\t\tconst transformed = rule.ops(filterNode);\n\t\tconst transformedName = `branch/${rule.name}/out`;\n\t\tgraph.add(transformedName, transformed as Node<unknown>);\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// funnel\n// ---------------------------------------------------------------------------\n\n/** A named stage for {@link funnel}. */\nexport type FunnelStage = {\n\t/** Stage name (mounted as subgraph). */\n\tname: string;\n\t/** Builder: receives a sub-graph, should add an `\"input\"` and `\"output\"` node. */\n\tbuild: (sub: Graph) => void;\n};\n\n/** Options for {@link funnel}. */\nexport type FunnelOptions = GraphOptions & {\n\tmeta?: Record<string, unknown>;\n};\n\n/**\n * Multi-source merge with sequential reduction stages.\n *\n * Sources are merged into a single stream. Each stage is a named subgraph\n * (mounted via `graph.mount()`). Stages connect linearly:\n * `merged → stage[0].input → stage[0].output → stage[1].input → ...`\n *\n * @param name - Graph name.\n * @param sources - Input nodes to merge.\n * @param stages - Sequential reduction stages.\n * @param opts - Optional graph/meta options.\n * @returns Graph with `\"merged\"` and mounted stage subgraphs.\n *\n * @category patterns\n */\nexport function funnel<T>(\n\tname: string,\n\tsources: ReadonlyArray<Node<T>>,\n\tstages: ReadonlyArray<FunnelStage>,\n\topts?: FunnelOptions,\n): Graph {\n\tif (sources.length === 0) throw new RangeError(\"funnel requires at least one source\");\n\tif (stages.length === 0) throw new RangeError(\"funnel requires at least one stage\");\n\n\tconst g = new Graph(name, opts);\n\n\t// Merge all sources\n\tconst merged = sources.length === 1 ? sources[0] : merge(...(sources as unknown as Node<T>[]));\n\tg.add(\"merged\", merged as Node<unknown>);\n\n\t// Build and mount each stage linearly.\n\t// Stage inputs are standalone state nodes, so we bridge via subscribe\n\t// (connect() requires constructor deps). Bridge effects forward DATA\n\t// from the previous output to the next stage's input.\n\tlet prevOutputPath = \"merged\";\n\tfor (let i = 0; i < stages.length; i++) {\n\t\tconst stage = stages[i];\n\t\tconst sub = new Graph(stage.name);\n\t\tstage.build(sub);\n\n\t\t// Validate that the stage has input and output nodes\n\t\ttry {\n\t\t\tsub.resolve(\"input\");\n\t\t} catch {\n\t\t\tthrow new Error(`funnel stage \"${stage.name}\" must define an \"input\" node`);\n\t\t}\n\t\ttry {\n\t\t\tsub.resolve(\"output\");\n\t\t} catch {\n\t\t\tthrow new Error(`funnel stage \"${stage.name}\" must define an \"output\" node`);\n\t\t}\n\n\t\tg.mount(stage.name, sub);\n\n\t\t// Bridge replacement: effect that forwards DATA from previous output\n\t\t// to the next stage's input. TEARDOWN excluded because stage lifecycle\n\t\t// is managed by the parent graph. Shows up in describe().\n\t\tconst prevNode = g.resolve(prevOutputPath);\n\t\tconst stageInputPath = `${stage.name}::input`;\n\t\tconst stageInput = g.resolve(stageInputPath);\n\t\tconst bridgeName = `__bridge_${prevOutputPath}→${stage.name}_input`;\n\t\tconst br = effect(\n\t\t\t[prevNode],\n\t\t\t([data]) => {\n\t\t\t\tstageInput.down([[DATA, data]]);\n\t\t\t},\n\t\t\t{ name: bridgeName },\n\t\t);\n\t\tg.add(bridgeName, br as Node<unknown>);\n\t\tg.addDisposer(keepalive(br));\n\n\t\tprevOutputPath = `${stage.name}::output`;\n\t}\n\n\treturn g;\n}\n\n// ---------------------------------------------------------------------------\n// feedback\n// ---------------------------------------------------------------------------\n\n/** Options for {@link feedback}. */\nexport type FeedbackOptions = {\n\t/** Maximum feedback iterations before stopping (default: 10). */\n\tmaxIterations?: number;\n\t/** Optional budget gate node path for cost-bounded iteration. */\n\tbudgetNode?: StepRef;\n\tmeta?: Record<string, unknown>;\n};\n\n/**\n * Introduce a bounded reactive cycle into an existing graph.\n *\n * When `condition` emits a non-null DATA value, the feedback effect routes it\n * back to the `reentry` state node — creating a cycle. Bounded by\n * `maxIterations` (default 10). The counter node (`__feedback_<condition>`)\n * is the source of truth — reset it to 0 to allow more iterations.\n *\n * To remove the feedback cycle, call `graph.remove(\"__feedback_<condition>\")`.\n *\n * @param graph - Existing graph to augment with a feedback cycle.\n * @param condition - Path to a node whose DATA triggers feedback.\n * @param reentry - Path to a state node that receives the feedback value.\n * @param opts - Iteration bounds and metadata.\n * @returns The same graph (mutated with feedback nodes added).\n *\n * @category patterns\n */\nexport function feedback(\n\tgraph: Graph,\n\tcondition: string,\n\treentry: string,\n\topts?: FeedbackOptions,\n): Graph {\n\tconst maxIter = opts?.maxIterations ?? 10;\n\n\t// Internal counter node — source of truth for iteration bound.\n\t// Reset to 0 to allow more iterations.\n\tconst counterName = `__feedback_${condition}`;\n\tconst counter = state<number>(0, {\n\t\tmeta: baseMeta(\"feedback_counter\", {\n\t\t\tmaxIterations: maxIter,\n\t\t\tfeedbackFrom: condition,\n\t\t\tfeedbackTo: reentry,\n\t\t}),\n\t});\n\tgraph.add(counterName, counter as Node<unknown>);\n\n\t// Resolve the condition and reentry nodes\n\tconst condNode = graph.resolve(condition);\n\tconst reentryNode = graph.resolve(reentry);\n\n\t// Graph-visible feedback effect: intercepts condition DATA, routes back to\n\t// reentry with iteration counting. Registered in the graph so it shows up\n\t// in describe() and cleans up on graph.destroy().\n\t// Feedback effect: subscribe to condition node for per-message interception\n\t// (onMessage removed in v5 — use producer+subscribe instead)\n\tconst feedbackEffectName = `__feedback_effect_${condition}`;\n\tconst feedbackEffect = node(\n\t\t[],\n\t\t(_data, _feedbackActions) => {\n\t\t\tconst unsub = condNode.subscribe((msgs) => {\n\t\t\t\tfor (const msg of msgs) {\n\t\t\t\t\tconst t = msg[0];\n\t\t\t\t\tif (t === DATA) {\n\t\t\t\t\t\tconst condValue = msg[1];\n\t\t\t\t\t\tif (condValue == null) return;\n\t\t\t\t\t\tbatch(() => {\n\t\t\t\t\t\t\tif (tryIncrementBounded(counter, maxIter)) {\n\t\t\t\t\t\t\t\treentryNode.down([[DATA, condValue]]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t\t} else if (t === COMPLETE || t === ERROR) {\n\t\t\t\t\t\tconst terminal: Message = t === ERROR && msg.length > 1 ? [ERROR, msg[1]] : [t];\n\t\t\t\t\t\tcounter.down([terminal]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\treturn () => unsub();\n\t\t},\n\t\t{\n\t\t\tname: feedbackEffectName,\n\t\t\tdescribeKind: \"effect\",\n\t\t\tmeta: {\n\t\t\t\t...baseMeta(\"feedback_effect\", {\n\t\t\t\t\tfeedbackFrom: condition,\n\t\t\t\t\tfeedbackTo: reentry,\n\t\t\t\t}),\n\t\t\t\t_internal: true,\n\t\t\t},\n\t\t},\n\t);\n\tgraph.add(feedbackEffectName, feedbackEffect as Node<unknown>);\n\tgraph.addDisposer(keepalive(feedbackEffect));\n\n\treturn graph;\n}\n\n// ---------------------------------------------------------------------------\n// budgetGate\n// ---------------------------------------------------------------------------\n\n/** A reactive constraint for {@link budgetGate}. */\nexport type BudgetConstraint<T = unknown> = {\n\t/** Constraint node whose value is checked. */\n\tnode: Node<T>;\n\t/** Returns `true` when the constraint is satisfied (budget available). */\n\tcheck: (value: T) => boolean;\n};\n\n/** Options for {@link budgetGate}. */\nexport type BudgetGateOptions = Omit<NodeOptions<unknown>, \"describeKind\" | \"name\" | \"meta\"> & {\n\tmeta?: Record<string, unknown>;\n};\n\n/**\n * Pass-through that respects reactive constraint nodes.\n *\n * DATA flows through when all constraints are satisfied. When any constraint\n * is exceeded, PAUSE is sent upstream and DATA is buffered. When constraints\n * relax, RESUME is sent and buffered DATA flushes.\n *\n * @param source - Input node.\n * @param constraints - Reactive constraint checks.\n * @param opts - Optional node options.\n * @returns Gated node.\n *\n * @category patterns\n */\nexport function budgetGate<T>(\n\tsource: Node<T>,\n\tconstraints: ReadonlyArray<BudgetConstraint>,\n\topts?: BudgetGateOptions,\n): Node<T> {\n\tif (constraints.length === 0) throw new RangeError(\"budgetGate requires at least one constraint\");\n\n\tconst constraintNodes = constraints.map((c) => c.node);\n\tconst allDeps = [source as Node, ...constraintNodes] as Node[];\n\n\tlet buffer: T[] = [];\n\tlet paused = false;\n\tlet pendingResolved = false;\n\tconst lockId = Symbol(\"budget-gate\");\n\n\t// Latest DATA from each constraint. Seeded at **activation time** (inside the\n\t// producer fn below) — a wiring-time boundary read, not a reactive-callback\n\t// read — so concurrent constraint updates between factory-time and\n\t// activation-time are reflected before `checkBudget()` first runs. The\n\t// subscribe handler updates this array on each constraint DATA message, so\n\t// `checkBudget` never reads `.cache` from inside a reactive callback.\n\tconst latestValues: unknown[] = new Array(constraints.length);\n\n\tfunction checkBudget(): boolean {\n\t\treturn constraints.every((c, i) => c.check(latestValues[i]));\n\t}\n\n\tfunction flushBuffer(actions: NodeActions): void {\n\t\twhile (buffer.length > 0 && checkBudget()) {\n\t\t\tconst item = buffer[0]!;\n\t\t\tbuffer = buffer.slice(1);\n\t\t\tactions.emit(item);\n\t\t}\n\t\t// Drain deferred RESOLVED once buffer is empty\n\t\tif (buffer.length === 0 && pendingResolved) {\n\t\t\tpendingResolved = false;\n\t\t\tactions.down([[RESOLVED]]);\n\t\t}\n\t}\n\n\t// Producer pattern: manually subscribe to all deps for per-message interception\n\t// (onMessage removed in v5 — use producer+subscribe instead)\n\treturn node<T>(\n\t\t[],\n\t\t(_data, gateActions) => {\n\t\t\t// Seed `latestValues` at activation (not factory time) so any constraint\n\t\t\t// updates between factory return and first subscribe are captured before\n\t\t\t// source's push-on-subscribe fires `checkBudget()`.\n\t\t\tfor (let i = 0; i < constraints.length; i++) {\n\t\t\t\tlatestValues[i] = constraints[i]!.node.cache;\n\t\t\t}\n\t\t\tconst unsubs: Array<() => void> = [];\n\t\t\tfor (let depIdx = 0; depIdx < allDeps.length; depIdx++) {\n\t\t\t\tconst dep = allDeps[depIdx];\n\t\t\t\tunsubs.push(\n\t\t\t\t\tdep.subscribe((msgs) => {\n\t\t\t\t\t\tfor (const msg of msgs) {\n\t\t\t\t\t\t\t_handleBudgetMessage(msg, depIdx, gateActions);\n\t\t\t\t\t\t}\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn () => {\n\t\t\t\tfor (const u of unsubs) u();\n\t\t\t};\n\t\t},\n\t\t{\n\t\t\t...opts,\n\t\t\tdescribeKind: \"derived\",\n\t\t\tmeta: baseMeta(\"budget_gate\", opts?.meta),\n\t\t} as NodeOptions<T>,\n\t);\n\n\tfunction _handleBudgetMessage(msg: Message, depIndex: number, actions: NodeActions): boolean {\n\t\tconst t = msg[0];\n\n\t\t// Source messages (dep 0)\n\t\tif (depIndex === 0) {\n\t\t\tif (t === DATA) {\n\t\t\t\tif (checkBudget() && buffer.length === 0) {\n\t\t\t\t\tactions.emit(msg[1] as T);\n\t\t\t\t} else {\n\t\t\t\t\tbuffer.push(msg[1] as T);\n\t\t\t\t\tif (!paused) {\n\t\t\t\t\t\tpaused = true;\n\t\t\t\t\t\tactions.up([[PAUSE, lockId]]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif (t === DIRTY) {\n\t\t\t\tactions.down([[DIRTY]]);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif (t === RESOLVED) {\n\t\t\t\tif (buffer.length === 0) {\n\t\t\t\t\tactions.down([[RESOLVED]]);\n\t\t\t\t} else {\n\t\t\t\t\t// Buffer non-empty: defer RESOLVED until buffer drains\n\t\t\t\t\tpendingResolved = true;\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif (t === COMPLETE || t === ERROR) {\n\t\t\t\t// Force-flush all buffered items regardless of budget (terminal = done)\n\t\t\t\tfor (const item of buffer) {\n\t\t\t\t\tactions.emit(item);\n\t\t\t\t}\n\t\t\t\tbuffer = [];\n\t\t\t\tpendingResolved = false;\n\t\t\t\t// Release PAUSE lock before forwarding terminal\n\t\t\t\tif (paused) {\n\t\t\t\t\tpaused = false;\n\t\t\t\t\tactions.up([[RESUME, lockId]]);\n\t\t\t\t}\n\t\t\t\tactions.down([msg]);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\n\t\t// Constraint node messages (dep 1+): capture DATA then re-check budget\n\t\tif (t === DATA) {\n\t\t\tlatestValues[depIndex - 1] = msg[1];\n\t\t}\n\t\tif (t === DATA || t === RESOLVED) {\n\t\t\tif (checkBudget() && buffer.length > 0) {\n\t\t\t\tflushBuffer(actions);\n\t\t\t\tif (buffer.length === 0 && paused) {\n\t\t\t\t\tpaused = false;\n\t\t\t\t\tactions.up([[RESUME, lockId]]);\n\t\t\t\t}\n\t\t\t} else if (!checkBudget() && !paused && buffer.length > 0) {\n\t\t\t\tpaused = true;\n\t\t\t\tactions.up([[PAUSE, lockId]]);\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tif (t === DIRTY) {\n\t\t\t// Don't propagate constraint DIRTY downstream\n\t\t\treturn true;\n\t\t}\n\t\tif (t === ERROR) {\n\t\t\t// Constraint error → forward downstream\n\t\t\tactions.down([msg]);\n\t\t\treturn true;\n\t\t}\n\t\tif (t === COMPLETE) {\n\t\t\t// Constraint completed — locked at last value, no-op\n\t\t\treturn true;\n\t\t}\n\t\t// Unknown constraint types → default forwarding\n\t\treturn false;\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// scorer\n// ---------------------------------------------------------------------------\n\n/** A scored item with full breakdown. */\nexport type ScoredItem<T = unknown> = {\n\t/** Original value. */\n\tvalue: T;\n\t/** Final weighted score. */\n\tscore: number;\n\t/** Per-signal breakdown: signal index → weighted contribution. */\n\tbreakdown: number[];\n};\n\n/** Options for {@link scorer}. */\nexport type ScorerOptions = Omit<NodeOptions<unknown>, \"describeKind\" | \"name\" | \"meta\"> & {\n\tmeta?: Record<string, unknown>;\n\t/** Custom scoring function per signal. Default: identity (signal value IS the score). */\n\tscoreFns?: ReadonlyArray<(value: unknown) => number>;\n};\n\n/**\n * Reactive multi-signal scoring with live weights.\n *\n * Each source emits items to score. Weights are reactive state nodes that\n * LLM or human can adjust live. Output is sorted scored items with full\n * breakdown.\n *\n * @param sources - Signal nodes (each emits a numeric score dimension).\n * @param weights - Reactive weight nodes (one per source).\n * @param opts - Optional node/meta options.\n * @returns Node emitting scored output.\n *\n * @category patterns\n */\nexport function scorer(\n\tsources: ReadonlyArray<Node<number>>,\n\tweights: ReadonlyArray<Node<number>>,\n\topts?: ScorerOptions,\n): Node<ScoredItem<number[]>> {\n\tif (sources.length === 0) throw new RangeError(\"scorer requires at least one source\");\n\tif (sources.length !== weights.length) {\n\t\tthrow new RangeError(\"scorer requires the same number of sources and weights\");\n\t}\n\n\tconst allDeps = [...(sources as unknown as Node[]), ...(weights as unknown as Node[])];\n\tconst n = sources.length;\n\tconst scoreFns = opts?.scoreFns;\n\n\treturn derived<ScoredItem<number[]>>(\n\t\tallDeps,\n\t\t(vals) => {\n\t\t\tconst signals = vals.slice(0, n) as number[];\n\t\t\tconst weightValues = vals.slice(n) as number[];\n\n\t\t\tconst breakdown: number[] = [];\n\t\t\tlet totalScore = 0;\n\n\t\t\tfor (let i = 0; i < n; i++) {\n\t\t\t\tconst sig = signals[i] ?? 0;\n\t\t\t\tconst wt = weightValues[i] ?? 0;\n\t\t\t\tconst rawScore = scoreFns?.[i] ? scoreFns[i](sig) : sig;\n\t\t\t\tconst weighted = (rawScore as number) * wt;\n\t\t\t\tbreakdown.push(weighted);\n\t\t\t\ttotalScore += weighted;\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tvalue: signals,\n\t\t\t\tscore: totalScore,\n\t\t\t\tbreakdown,\n\t\t\t};\n\t\t},\n\t\t{\n\t\t\t...(opts\n\t\t\t\t? {\n\t\t\t\t\t\tequals: opts.equals,\n\t\t\t\t\t\tresubscribable: opts.resubscribable,\n\t\t\t\t\t\tresetOnTeardown: opts.resetOnTeardown,\n\t\t\t\t\t}\n\t\t\t\t: {}),\n\t\t\tdescribeKind: \"derived\",\n\t\t\tmeta: baseMeta(\"scorer\", opts?.meta),\n\t\t},\n\t);\n}\n\n// ---------------------------------------------------------------------------\n// effectivenessTracker\n// ---------------------------------------------------------------------------\n\n/** A single effectiveness record for an action×context pair. */\nexport type EffectivenessEntry = {\n\treadonly key: string;\n\treadonly attempts: number;\n\treadonly successes: number;\n\treadonly successRate: number;\n};\n\n/** Snapshot shape for the effectiveness tracker node. */\nexport type EffectivenessSnapshot = ReadonlyMap<string, EffectivenessEntry>;\n\n/** Bundle returned by {@link effectivenessTracker}. */\nexport interface EffectivenessTrackerBundle {\n\t/** Reactive node — current effectiveness map snapshot. */\n\treadonly node: Node<EffectivenessSnapshot>;\n\n\t/** Record a completed action (success or failure). */\n\trecord(key: string, success: boolean): void;\n\n\t/** Look up effectiveness for a specific key. */\n\tlookup(key: string): EffectivenessEntry | undefined;\n\n\t/** Tear down internal keepalive subscriptions. */\n\tdispose(): void;\n}\n\n/** Options for {@link effectivenessTracker}. */\nexport type EffectivenessTrackerOptions = {\n\t/** Name for the reactive map (default \"effectiveness-entries\"). */\n\tname?: string;\n};\n\n/**\n * Generic action×context → success rate tracker.\n *\n * Generalized from the harness `strategyModel` pattern. Tracks attempts and\n * successes per string key, exposes a reactive snapshot node, and provides\n * `record()` / `lookup()` methods.\n *\n * Use cases: A/B testing, routing optimization, cache policy tuning, retry\n * strategy selection — any domain that tracks effectiveness per action.\n *\n * @param opts - Optional configuration.\n * @returns Bundle with reactive node, record(), lookup(), dispose().\n */\nexport function effectivenessTracker(\n\topts?: EffectivenessTrackerOptions,\n): EffectivenessTrackerBundle {\n\tconst _map = reactiveMap<string, EffectivenessEntry>({\n\t\tname: opts?.name ?? \"effectiveness-entries\",\n\t});\n\n\tconst snapshot = derived<EffectivenessSnapshot>(\n\t\t[_map.entries],\n\t\t([mapSnap]) => {\n\t\t\treturn new Map(mapSnap as ReadonlyMap<string, EffectivenessEntry>);\n\t\t},\n\t\t{\n\t\t\tname: `${opts?.name ?? \"effectiveness\"}-snapshot`,\n\t\t\tequals: (a, b) => {\n\t\t\t\tconst am = a as EffectivenessSnapshot;\n\t\t\t\tconst bm = b as EffectivenessSnapshot;\n\t\t\t\tif (am.size !== bm.size) return false;\n\t\t\t\tfor (const [k, v] of am) {\n\t\t\t\t\tconst bv = bm.get(k);\n\t\t\t\t\tif (!bv || v.attempts !== bv.attempts || v.successes !== bv.successes) return false;\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t},\n\t\t},\n\t);\n\n\tfunction record(key: string, success: boolean): void {\n\t\tconst existing = _map.get(key);\n\t\tconst attempts = (existing?.attempts ?? 0) + 1;\n\t\tconst successes = (existing?.successes ?? 0) + (success ? 1 : 0);\n\t\t_map.set(key, {\n\t\t\tkey,\n\t\t\tattempts,\n\t\t\tsuccesses,\n\t\t\tsuccessRate: successes / attempts,\n\t\t});\n\t}\n\n\tfunction lookup(key: string): EffectivenessEntry | undefined {\n\t\treturn _map.get(key);\n\t}\n\n\tconst _unsub = keepalive(snapshot);\n\n\treturn {\n\t\tnode: snapshot,\n\t\trecord,\n\t\tlookup,\n\t\tdispose: () => _unsub(),\n\t};\n}\n","/**\n * LLM graph composition (roadmap §8.3).\n *\n * Declarative GraphSpec schema + compiler/decompiler for graph topology.\n * The LLM designs graphs as JSON; compileSpec instantiates them; decompileGraph\n * extracts them back. Templates support reusable subgraph patterns. Feedback\n * edges express bounded cycles via §8.1 feedback().\n *\n * @module\n */\n\nimport { DATA } from \"../core/messages.js\";\nimport type { Node } from \"../core/node.js\";\nimport { derived, effect, producer, state } from \"../core/sugar.js\";\nimport { GRAPH_META_SEGMENT, Graph } from \"../graph/graph.js\";\nimport type { ChatMessage, LLMAdapter, LLMResponse } from \"./ai.js\";\nimport { feedback as feedbackPrimitive } from \"./reduction.js\";\n\n// ---------------------------------------------------------------------------\n// GraphSpec types\n// ---------------------------------------------------------------------------\n\n/** A single node declaration in a GraphSpec. */\nexport type GraphSpecNode = {\n\t/** Node kind: state, producer, derived, effect, operator. */\n\ttype: \"state\" | \"producer\" | \"derived\" | \"effect\" | \"operator\";\n\t/** Dependency node names (for derived/effect/operator). */\n\tdeps?: string[];\n\t/** Named function from the catalog (for derived/effect/operator/producer). */\n\tfn?: string;\n\t/** Named source from the catalog (for producer). */\n\tsource?: string;\n\t/** Freeform config passed to the catalog fn/source factory. */\n\tconfig?: Record<string, unknown>;\n\t/** Initial value (for state nodes). */\n\tinitial?: unknown;\n\t/** Human/LLM-readable metadata. */\n\tmeta?: Record<string, unknown>;\n};\n\n/** Template instantiation node — expanded at compile time. */\nexport type GraphSpecTemplateRef = {\n\ttype: \"template\";\n\t/** Name of the template to instantiate. */\n\ttemplate: string;\n\t/** Parameter bindings: template param name → node name. */\n\tbind: Record<string, string>;\n};\n\n/** A reusable subgraph pattern with parameter substitution. */\nexport type GraphSpecTemplate = {\n\t/** Parameter names (prefixed with $ in node refs). */\n\tparams: string[];\n\t/** Node declarations within the template. */\n\tnodes: Record<string, GraphSpecNode>;\n\t/** Which node's output is the template's output. */\n\toutput: string;\n};\n\n/** A feedback edge: bounded cycle from condition to reentry. */\nexport type GraphSpecFeedbackEdge = {\n\t/** Node whose DATA triggers the feedback. */\n\tfrom: string;\n\t/** State node that receives the feedback value. */\n\tto: string;\n\t/** Max iterations before stopping (default: 10). */\n\tmaxIterations?: number;\n};\n\n/** Declarative graph topology for LLM composition (§8.3). */\nexport type GraphSpec = {\n\t/** Graph name. */\n\tname: string;\n\t/** Node declarations (keyed by node name). */\n\tnodes: Record<string, GraphSpecNode | GraphSpecTemplateRef>;\n\t/** Reusable subgraph templates. */\n\ttemplates?: Record<string, GraphSpecTemplate>;\n\t/** Feedback edges (bounded cycles). */\n\tfeedback?: GraphSpecFeedbackEdge[];\n};\n\n// ---------------------------------------------------------------------------\n// Catalog types\n// ---------------------------------------------------------------------------\n\n/**\n * Factory for creating a derived/effect/operator node from catalog.\n * Receives resolved dep nodes and the config from the spec.\n */\nexport type FnFactory = (deps: Node<unknown>[], config: Record<string, unknown>) => Node<unknown>;\n\n/**\n * Factory for creating a producer node from catalog.\n * Receives the config from the spec.\n */\nexport type SourceFactory = (config: Record<string, unknown>) => Node<unknown>;\n\n// ---------------------------------------------------------------------------\n// Rich catalog entries (§9.1b — auto-prompt, catalog-aware validation)\n// ---------------------------------------------------------------------------\n\n/** Simple config field descriptor for LLM prompt generation and validation. */\nexport type ConfigFieldSchema = {\n\t/** Human-readable type: \"string\", \"number\", \"boolean\", \"string[]\", etc. */\n\ttype: string;\n\t/** Whether this field is required (default: true). */\n\trequired?: boolean;\n\t/** Allowed values (enum constraint). */\n\tenum?: readonly (string | number | boolean)[];\n\t/** Human-readable description for LLM context. */\n\tdescription?: string;\n\t/** Default value if omitted. */\n\tdefault?: unknown;\n};\n\n/**\n * Rich catalog entry: bundles a runtime factory with LLM-facing metadata.\n *\n * The metadata is used to:\n * 1. Auto-generate prompt text for {@link llmCompose} (replaces manual `catalogDescription`)\n * 2. Validate LLM output in {@link validateSpec} (catch wrong fn names, invalid config)\n * 3. Provide actionable error messages for {@link llmRefine} feedback loops\n *\n * Developers register ONE object; the library handles prompt generation and validation.\n */\nexport type CatalogFnEntry = {\n\t/** Runtime factory. */\n\tfactory: FnFactory;\n\t/** One-line description for LLM prompt (what it does, not how). */\n\tdescription: string;\n\t/** Config field schemas. Keys are config field names. */\n\tconfigSchema?: Record<string, ConfigFieldSchema>;\n\t/** Example config objects (shown in prompt for complex fns). */\n\texamples?: Record<string, unknown>[];\n\t/** Category tags for grouping in prompt (e.g., \"resilience\", \"reduction\", \"ai\"). */\n\ttags?: string[];\n};\n\n/** Rich catalog entry for producer sources. */\nexport type CatalogSourceEntry = {\n\t/** Runtime factory. */\n\tfactory: SourceFactory;\n\t/** One-line description for LLM prompt. */\n\tdescription: string;\n\t/** Config field schemas. */\n\tconfigSchema?: Record<string, ConfigFieldSchema>;\n\t/** Example config objects. */\n\texamples?: Record<string, unknown>[];\n\t/** Category tags. */\n\ttags?: string[];\n};\n\n/**\n * Fn/source lookup table passed to compileSpec and llmCompose.\n *\n * Accepts both bare factories (backward-compatible) and rich {@link CatalogFnEntry}\n * / {@link CatalogSourceEntry} objects. When rich entries are provided, the library\n * auto-generates LLM prompts and validates LLM output against the catalog.\n */\nexport type GraphSpecCatalog = {\n\tfns?: Record<string, FnFactory | CatalogFnEntry>;\n\tsources?: Record<string, SourceFactory | CatalogSourceEntry>;\n};\n\n// ---------------------------------------------------------------------------\n// Catalog helpers\n// ---------------------------------------------------------------------------\n\n/** Type guard: is this a rich catalog fn entry (vs bare factory)? */\nexport function isRichFnEntry(entry: FnFactory | CatalogFnEntry): entry is CatalogFnEntry {\n\treturn typeof entry === \"object\" && entry !== null && \"factory\" in entry;\n}\n\n/** Type guard: is this a rich catalog source entry (vs bare factory)? */\nexport function isRichSourceEntry(\n\tentry: SourceFactory | CatalogSourceEntry,\n): entry is CatalogSourceEntry {\n\treturn typeof entry === \"object\" && entry !== null && \"factory\" in entry;\n}\n\n/** Extract the runtime factory from a catalog entry (rich or bare). */\nexport function extractFnFactory(entry: FnFactory | CatalogFnEntry): FnFactory {\n\treturn isRichFnEntry(entry) ? entry.factory : entry;\n}\n\n/** Extract the runtime factory from a catalog source entry (rich or bare). */\nexport function extractSourceFactory(entry: SourceFactory | CatalogSourceEntry): SourceFactory {\n\treturn isRichSourceEntry(entry) ? entry.factory : entry;\n}\n\n/**\n * Auto-generate catalog prompt text from rich catalog entries.\n *\n * Groups fns by tag, formats each as `- name: description. Config: { ... }`.\n * Falls back to listing names only for bare factories.\n */\nexport function generateCatalogPrompt(catalog: GraphSpecCatalog): string {\n\tconst sections: string[] = [];\n\n\tif (catalog.fns) {\n\t\t// Group by first tag (or \"Other\")\n\t\tconst groups = new Map<string, string[]>();\n\t\tfor (const [name, entry] of Object.entries(catalog.fns)) {\n\t\t\tconst tag = isRichFnEntry(entry) ? (entry.tags?.[0] ?? \"Other\") : \"Other\";\n\t\t\tif (!groups.has(tag)) groups.set(tag, []);\n\t\t\tgroups.get(tag)!.push(formatFnEntry(name, entry));\n\t\t}\n\t\tfor (const [tag, lines] of groups) {\n\t\t\tsections.push(`${tag}:\\n${lines.join(\"\\n\")}`);\n\t\t}\n\t}\n\n\tif (catalog.sources) {\n\t\tconst lines: string[] = [];\n\t\tfor (const [name, entry] of Object.entries(catalog.sources)) {\n\t\t\tlines.push(formatSourceEntry(name, entry));\n\t\t}\n\t\tif (lines.length > 0) {\n\t\t\tsections.push(`Sources:\\n${lines.join(\"\\n\")}`);\n\t\t}\n\t}\n\n\treturn sections.join(\"\\n\\n\");\n}\n\nfunction formatFnEntry(name: string, entry: FnFactory | CatalogFnEntry): string {\n\tif (!isRichFnEntry(entry)) return `- ${name}`;\n\tlet line = `- ${name}: ${entry.description}`;\n\tif (entry.configSchema) {\n\t\tconst fields = Object.entries(entry.configSchema).map(([k, v]) => {\n\t\t\tlet desc = `${k}: ${v.type}`;\n\t\t\tif (v.enum) desc += ` (${v.enum.join(\"|\")})`;\n\t\t\tif (v.required === false) desc += \"?\";\n\t\t\treturn desc;\n\t\t});\n\t\tline += `. Config: { ${fields.join(\", \")} }`;\n\t}\n\treturn line;\n}\n\nfunction formatSourceEntry(name: string, entry: SourceFactory | CatalogSourceEntry): string {\n\tif (!isRichSourceEntry(entry)) return `- ${name}`;\n\tlet line = `- ${name}: ${entry.description}`;\n\tif (entry.configSchema) {\n\t\tconst fields = Object.entries(entry.configSchema).map(([k, v]) => {\n\t\t\tlet desc = `${k}: ${v.type}`;\n\t\t\tif (v.required === false) desc += \"?\";\n\t\t\treturn desc;\n\t\t});\n\t\tline += `. Config: { ${fields.join(\", \")} }`;\n\t}\n\treturn line;\n}\n\n/**\n * Validate a GraphSpec against a catalog.\n *\n * Checks that fn/source names reference actual catalog entries, and validates\n * config fields against configSchema when rich entries are available.\n * Returns additional errors beyond structural {@link validateSpec} checks.\n */\nexport function validateSpecAgainstCatalog(\n\tspec: GraphSpec,\n\tcatalog: GraphSpecCatalog,\n): GraphSpecValidation {\n\tconst errors: string[] = [];\n\tconst fnNames = new Set(Object.keys(catalog.fns ?? {}));\n\tconst sourceNames = new Set(Object.keys(catalog.sources ?? {}));\n\n\tfor (const [nodeName, nodeRaw] of Object.entries(spec.nodes)) {\n\t\tif (nodeRaw.type === \"template\") continue;\n\t\tconst node = nodeRaw as GraphSpecNode;\n\n\t\t// Check fn name exists in catalog\n\t\tif (node.fn && fnNames.size > 0 && !fnNames.has(node.fn)) {\n\t\t\t// Check if they used a source name as fn\n\t\t\tif (sourceNames.has(node.fn)) {\n\t\t\t\terrors.push(\n\t\t\t\t\t`Node \"${nodeName}\": fn \"${node.fn}\" is a source, not a function. ` +\n\t\t\t\t\t\t`Use it as a producer source instead, or use a function from: ${[...fnNames].join(\", \")}`,\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tconst suggestion = findClosest(node.fn, fnNames);\n\t\t\t\terrors.push(\n\t\t\t\t\t`Node \"${nodeName}\": fn \"${node.fn}\" not found in catalog` +\n\t\t\t\t\t\t(suggestion ? `. Did you mean \"${suggestion}\"?` : \"\"),\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\t// Check source name exists in catalog\n\t\tif (node.source && sourceNames.size > 0 && !sourceNames.has(node.source)) {\n\t\t\tif (fnNames.has(node.source)) {\n\t\t\t\terrors.push(\n\t\t\t\t\t`Node \"${nodeName}\": source \"${node.source}\" is a function, not a source. ` +\n\t\t\t\t\t\t`Use it as fn instead, or use a source from: ${[...sourceNames].join(\", \")}`,\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tconst suggestion = findClosest(node.source, sourceNames);\n\t\t\t\terrors.push(\n\t\t\t\t\t`Node \"${nodeName}\": source \"${node.source}\" not found in catalog` +\n\t\t\t\t\t\t(suggestion ? `. Did you mean \"${suggestion}\"?` : \"\"),\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\t// Validate config against schema (if rich entry)\n\t\tif (node.fn && node.config && catalog.fns?.[node.fn]) {\n\t\t\tconst entry = catalog.fns[node.fn];\n\t\t\tif (isRichFnEntry(entry) && entry.configSchema) {\n\t\t\t\tfor (const [field, schema] of Object.entries(entry.configSchema)) {\n\t\t\t\t\tif (schema.required !== false && !(field in node.config)) {\n\t\t\t\t\t\terrors.push(`Node \"${nodeName}\": config missing required field \"${field}\"`);\n\t\t\t\t\t}\n\t\t\t\t\tif (field in node.config && schema.enum) {\n\t\t\t\t\t\tconst val = node.config[field];\n\t\t\t\t\t\tif (!schema.enum.includes(val as string | number | boolean)) {\n\t\t\t\t\t\t\terrors.push(\n\t\t\t\t\t\t\t\t`Node \"${nodeName}\": config.${field} = ${JSON.stringify(val)}, ` +\n\t\t\t\t\t\t\t\t\t`expected one of: ${schema.enum.join(\", \")}`,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Also check template inner nodes\n\tif (spec.templates) {\n\t\tfor (const [tName, template] of Object.entries(spec.templates)) {\n\t\t\tfor (const [nodeName, node] of Object.entries(template.nodes)) {\n\t\t\t\tif (node.fn && fnNames.size > 0 && !fnNames.has(node.fn)) {\n\t\t\t\t\tconst suggestion = findClosest(node.fn, fnNames);\n\t\t\t\t\terrors.push(\n\t\t\t\t\t\t`Template \"${tName}\" node \"${nodeName}\": fn \"${node.fn}\" not found in catalog` +\n\t\t\t\t\t\t\t(suggestion ? `. Did you mean \"${suggestion}\"?` : \"\"),\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn { valid: errors.length === 0, errors };\n}\n\n/** Simple Levenshtein-based closest match for \"did you mean?\" suggestions. */\nfunction findClosest(input: string, candidates: Set<string>): string | null {\n\tlet best: string | null = null;\n\tlet bestDist = Infinity;\n\tconst lower = input.toLowerCase();\n\tfor (const c of candidates) {\n\t\tconst dist = levenshtein(lower, c.toLowerCase());\n\t\tif (dist < bestDist && dist <= Math.max(3, Math.floor(input.length / 2))) {\n\t\t\tbestDist = dist;\n\t\t\tbest = c;\n\t\t}\n\t}\n\treturn best;\n}\n\nfunction levenshtein(a: string, b: string): number {\n\tconst m = a.length;\n\tconst n = b.length;\n\tconst dp: number[][] = Array.from({ length: m + 1 }, (_, i) =>\n\t\tArray.from({ length: n + 1 }, (_, j) => (i === 0 ? j : j === 0 ? i : 0)),\n\t);\n\tfor (let i = 1; i <= m; i++) {\n\t\tfor (let j = 1; j <= n; j++) {\n\t\t\tdp[i][j] =\n\t\t\t\ta[i - 1] === b[j - 1]\n\t\t\t\t\t? dp[i - 1][j - 1]\n\t\t\t\t\t: 1 + Math.min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]);\n\t\t}\n\t}\n\treturn dp[m][n];\n}\n\n// ---------------------------------------------------------------------------\n// Validation\n// ---------------------------------------------------------------------------\n\n/** Validation result from {@link validateSpec}. */\nexport type GraphSpecValidation = {\n\tvalid: boolean;\n\terrors: string[];\n};\n\nconst VALID_NODE_TYPES = new Set([\n\t\"state\",\n\t\"producer\",\n\t\"derived\",\n\t\"effect\",\n\t\"operator\",\n\t\"template\",\n]);\n\nconst INNER_NODE_TYPES = new Set([\"state\", \"producer\", \"derived\", \"effect\", \"operator\"]);\n\n/**\n * Validate a GraphSpec JSON object.\n *\n * Checks structural validity: required fields, node types, dep references,\n * template references, feedback edge targets, self-cycles, and bind completeness.\n */\nexport function validateSpec(spec: unknown): GraphSpecValidation {\n\tconst errors: string[] = [];\n\n\tif (spec == null || typeof spec !== \"object\") {\n\t\treturn { valid: false, errors: [\"GraphSpec must be a non-null object\"] };\n\t}\n\n\tconst s = spec as Record<string, unknown>;\n\n\tif (typeof s.name !== \"string\" || s.name.length === 0) {\n\t\terrors.push(\"Missing or empty 'name' field\");\n\t}\n\n\tif (s.nodes == null || typeof s.nodes !== \"object\" || Array.isArray(s.nodes)) {\n\t\terrors.push(\"Missing or invalid 'nodes' field (must be an object)\");\n\t\treturn { valid: false, errors };\n\t}\n\n\tconst nodeNames = new Set(Object.keys(s.nodes as object));\n\tconst nodeTypes = new Map<string, string>();\n\tconst templateDefs = new Map<string, { params: string[] }>();\n\n\t// Pre-scan template definitions for param validation\n\tif (s.templates != null && typeof s.templates === \"object\" && !Array.isArray(s.templates)) {\n\t\tfor (const [tName, tRaw] of Object.entries(s.templates as Record<string, unknown>)) {\n\t\t\tif (tRaw != null && typeof tRaw === \"object\") {\n\t\t\t\tconst t = tRaw as Record<string, unknown>;\n\t\t\t\ttemplateDefs.set(tName, {\n\t\t\t\t\tparams: Array.isArray(t.params) ? (t.params as string[]) : [],\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t}\n\n\t// Validate templates\n\tif (s.templates != null) {\n\t\tif (typeof s.templates !== \"object\" || Array.isArray(s.templates)) {\n\t\t\terrors.push(\"'templates' must be an object\");\n\t\t} else {\n\t\t\tfor (const [tName, tRaw] of Object.entries(s.templates as Record<string, unknown>)) {\n\t\t\t\tif (tRaw == null || typeof tRaw !== \"object\") {\n\t\t\t\t\terrors.push(`Template \"${tName}\": must be an object`);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst t = tRaw as Record<string, unknown>;\n\t\t\t\tif (!Array.isArray(t.params)) {\n\t\t\t\t\terrors.push(`Template \"${tName}\": missing 'params' array`);\n\t\t\t\t}\n\t\t\t\tif (t.nodes == null || typeof t.nodes !== \"object\" || Array.isArray(t.nodes)) {\n\t\t\t\t\terrors.push(`Template \"${tName}\": missing or invalid 'nodes' object`);\n\t\t\t\t} else {\n\t\t\t\t\tconst paramSet = new Set(Array.isArray(t.params) ? (t.params as string[]) : []);\n\t\t\t\t\tconst innerNames = new Set(Object.keys(t.nodes as object));\n\t\t\t\t\tfor (const [nName, nRaw] of Object.entries(t.nodes as Record<string, unknown>)) {\n\t\t\t\t\t\tif (nRaw == null || typeof nRaw !== \"object\") {\n\t\t\t\t\t\t\terrors.push(`Template \"${tName}\" node \"${nName}\": must be an object`);\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tconst n = nRaw as Record<string, unknown>;\n\t\t\t\t\t\tif (typeof n.type !== \"string\" || !INNER_NODE_TYPES.has(n.type)) {\n\t\t\t\t\t\t\terrors.push(`Template \"${tName}\" node \"${nName}\": invalid type`);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (Array.isArray(n.deps)) {\n\t\t\t\t\t\t\tfor (const dep of n.deps as string[]) {\n\t\t\t\t\t\t\t\tif (!innerNames.has(dep) && !paramSet.has(dep)) {\n\t\t\t\t\t\t\t\t\terrors.push(\n\t\t\t\t\t\t\t\t\t\t`Template \"${tName}\" node \"${nName}\": dep \"${dep}\" is not an inner node or param`,\n\t\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (typeof t.output !== \"string\") {\n\t\t\t\t\t\terrors.push(`Template \"${tName}\": missing 'output' string`);\n\t\t\t\t\t} else if (!(t.nodes as Record<string, unknown>)[t.output as string]) {\n\t\t\t\t\t\terrors.push(`Template \"${tName}\": output \"${t.output}\" is not a declared node`);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Validate nodes\n\tfor (const [name, raw] of Object.entries(s.nodes as Record<string, unknown>)) {\n\t\tif (raw == null || typeof raw !== \"object\") {\n\t\t\terrors.push(`Node \"${name}\": must be an object`);\n\t\t\tcontinue;\n\t\t}\n\t\tconst n = raw as Record<string, unknown>;\n\t\tif (typeof n.type !== \"string\" || !VALID_NODE_TYPES.has(n.type)) {\n\t\t\terrors.push(\n\t\t\t\t`Node \"${name}\": invalid type \"${String(n.type)}\" (expected: ${[...VALID_NODE_TYPES].join(\", \")})`,\n\t\t\t);\n\t\t\tcontinue;\n\t\t}\n\t\tnodeTypes.set(name, n.type);\n\n\t\tif (n.type === \"template\") {\n\t\t\tif (typeof n.template !== \"string\" || !templateDefs.has(n.template)) {\n\t\t\t\terrors.push(`Node \"${name}\": template \"${String(n.template)}\" not found in templates`);\n\t\t\t} else {\n\t\t\t\t// Check bind completeness: all template params must be bound\n\t\t\t\tif (n.bind == null || typeof n.bind !== \"object\" || Array.isArray(n.bind)) {\n\t\t\t\t\terrors.push(`Node \"${name}\": template ref requires 'bind' object`);\n\t\t\t\t} else {\n\t\t\t\t\tconst tmpl = templateDefs.get(n.template as string)!;\n\t\t\t\t\tconst bind = n.bind as Record<string, string>;\n\t\t\t\t\tfor (const param of tmpl.params) {\n\t\t\t\t\t\tif (!(param in bind)) {\n\t\t\t\t\t\t\terrors.push(\n\t\t\t\t\t\t\t\t`Node \"${name}\": template param \"${param}\" is not bound (template \"${n.template}\")`,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tfor (const [, target] of Object.entries(bind)) {\n\t\t\t\t\t\tif (typeof target === \"string\" && !nodeNames.has(target)) {\n\t\t\t\t\t\t\terrors.push(\n\t\t\t\t\t\t\t\t`Node \"${name}\": bind target \"${target}\" does not reference an existing node`,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tif (Array.isArray(n.deps)) {\n\t\t\t\tfor (const dep of n.deps as string[]) {\n\t\t\t\t\t// Self-referencing dep\n\t\t\t\t\tif (dep === name) {\n\t\t\t\t\t\terrors.push(`Node \"${name}\": self-referencing dep`);\n\t\t\t\t\t} else if (!nodeNames.has(dep)) {\n\t\t\t\t\t\terrors.push(`Node \"${name}\": dep \"${dep}\" does not reference an existing node`);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Warn: derived/effect/operator without deps\n\t\t\tif (\n\t\t\t\t(n.type === \"derived\" || n.type === \"effect\" || n.type === \"operator\") &&\n\t\t\t\t!Array.isArray(n.deps)\n\t\t\t) {\n\t\t\t\terrors.push(`Node \"${name}\": ${n.type} node should have a 'deps' array`);\n\t\t\t}\n\t\t}\n\t}\n\n\t// Validate feedback edges\n\tif (s.feedback != null) {\n\t\tif (!Array.isArray(s.feedback)) {\n\t\t\terrors.push(\"'feedback' must be an array\");\n\t\t} else {\n\t\t\tfor (let i = 0; i < (s.feedback as unknown[]).length; i++) {\n\t\t\t\tconst edge = (s.feedback as unknown[])[i];\n\t\t\t\tif (edge == null || typeof edge !== \"object\") {\n\t\t\t\t\terrors.push(`Feedback [${i}]: must be an object`);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst e = edge as Record<string, unknown>;\n\t\t\t\tif (typeof e.from !== \"string\" || !nodeNames.has(e.from)) {\n\t\t\t\t\terrors.push(\n\t\t\t\t\t\t`Feedback [${i}]: 'from' \"${String(e.from)}\" does not reference an existing node`,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tif (typeof e.from === \"string\" && e.from === e.to) {\n\t\t\t\t\terrors.push(`Feedback [${i}]: 'from' and 'to' must be different nodes`);\n\t\t\t\t}\n\t\t\t\tif (typeof e.to !== \"string\" || !nodeNames.has(e.to)) {\n\t\t\t\t\terrors.push(\n\t\t\t\t\t\t`Feedback [${i}]: 'to' \"${String(e.to)}\" does not reference an existing node`,\n\t\t\t\t\t);\n\t\t\t\t} else if (typeof e.to === \"string\" && nodeTypes.get(e.to) !== \"state\") {\n\t\t\t\t\terrors.push(\n\t\t\t\t\t\t`Feedback [${i}]: 'to' node \"${e.to}\" must be a state node (got \"${nodeTypes.get(e.to) ?? \"unknown\"}\")`,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn { valid: errors.length === 0, errors };\n}\n\n// ---------------------------------------------------------------------------\n// compileSpec\n// ---------------------------------------------------------------------------\n\n/** Options for {@link compileSpec}. */\nexport type CompileSpecOptions = {\n\t/** Fn/source catalog for resolving named factories. */\n\tcatalog?: GraphSpecCatalog;\n};\n\n/**\n * Instantiate a Graph from a GraphSpec.\n *\n * Handles template expansion (mounted subgraphs), feedback wiring via §8.1\n * feedback(), node factory lookup from the catalog, and topology validation.\n *\n * @param spec - Declarative graph topology.\n * @param opts - Catalog and compile options.\n * @returns A running Graph.\n * @throws On validation failure, missing catalog entries, or unresolvable deps.\n *\n * @category patterns\n */\nexport function compileSpec(spec: GraphSpec, opts?: CompileSpecOptions): Graph {\n\tconst validation = validateSpec(spec);\n\tif (!validation.valid) {\n\t\tthrow new Error(`compileSpec: invalid GraphSpec:\\n${validation.errors.join(\"\\n\")}`);\n\t}\n\n\tconst catalog = opts?.catalog ?? {};\n\tconst g = new Graph(spec.name);\n\tconst templates = spec.templates ?? {};\n\n\t// Catalog-aware validation (when rich entries are available)\n\tconst catalogValidation = validateSpecAgainstCatalog(spec, catalog);\n\tif (!catalogValidation.valid) {\n\t\tthrow new Error(\n\t\t\t`compileSpec: catalog validation errors:\\n${catalogValidation.errors.join(\"\\n\")}`,\n\t\t);\n\t}\n\n\t// Helper: resolve fn/source factories from catalog (handles rich + bare entries)\n\tconst resolveFn = (fnName: string): FnFactory | undefined => {\n\t\tconst entry = catalog.fns?.[fnName];\n\t\treturn entry ? extractFnFactory(entry) : undefined;\n\t};\n\tconst resolveSource = (sourceName: string): SourceFactory | undefined => {\n\t\tconst entry = catalog.sources?.[sourceName];\n\t\treturn entry ? extractSourceFactory(entry) : undefined;\n\t};\n\n\t// Phase 1: Create non-template nodes (state/producer first, then derived/effect/operator)\n\tconst created = new Map<string, Node<unknown>>();\n\tconst deferred: [string, GraphSpecNode][] = [];\n\n\tfor (const [name, raw] of Object.entries(spec.nodes)) {\n\t\tif (raw.type === \"template\") continue; // handled in Phase 2\n\n\t\tconst n = raw as GraphSpecNode;\n\t\tif (n.type === \"state\") {\n\t\t\tconst nd = state(n.initial, {\n\t\t\t\tname,\n\t\t\t\tmeta: n.meta ? { ...n.meta } : undefined,\n\t\t\t});\n\t\t\tg.add(name, nd);\n\t\t\tcreated.set(name, nd);\n\t\t} else if (n.type === \"producer\") {\n\t\t\tconst sourceFactory = n.source ? resolveSource(n.source) : undefined;\n\t\t\tconst fnFactory = n.fn ? resolveFn(n.fn) : undefined;\n\t\t\tif (sourceFactory) {\n\t\t\t\tconst nd = sourceFactory(n.config ?? {});\n\t\t\t\tg.add(name, nd);\n\t\t\t\tcreated.set(name, nd);\n\t\t\t} else if (fnFactory) {\n\t\t\t\tconst nd = fnFactory([], n.config ?? {});\n\t\t\t\tg.add(name, nd);\n\t\t\t\tcreated.set(name, nd);\n\t\t\t} else {\n\t\t\t\t// No catalog entry — create a bare producer placeholder\n\t\t\t\tconst nd = producer(() => {}, {\n\t\t\t\t\tname,\n\t\t\t\t\tmeta: { ...n.meta, _specFn: n.fn, _specSource: n.source },\n\t\t\t\t});\n\t\t\t\tg.add(name, nd);\n\t\t\t\tcreated.set(name, nd);\n\t\t\t}\n\t\t} else {\n\t\t\tdeferred.push([name, n]);\n\t\t}\n\t}\n\n\t// Resolve deferred nodes (derived/effect/operator) in dependency order\n\tlet progressed = true;\n\tconst pending = new Map(deferred);\n\twhile (pending.size > 0 && progressed) {\n\t\tprogressed = false;\n\t\tfor (const [name, n] of [...pending.entries()]) {\n\t\t\tconst deps = n.deps ?? [];\n\t\t\tif (!deps.every((dep) => created.has(dep))) continue;\n\n\t\t\tconst resolvedDeps = deps.map((dep) => created.get(dep)!);\n\t\t\tconst fnFactory = n.fn ? resolveFn(n.fn) : undefined;\n\n\t\t\tlet nd: Node<unknown>;\n\t\t\tif (fnFactory) {\n\t\t\t\tnd = fnFactory(resolvedDeps, n.config ?? {});\n\t\t\t} else if (n.type === \"effect\") {\n\t\t\t\tnd = effect(resolvedDeps, () => {});\n\t\t\t} else {\n\t\t\t\t// derived/operator without catalog fn — identity passthrough\n\t\t\t\tnd = derived(resolvedDeps, (vals: readonly unknown[]) => vals[0]);\n\t\t\t}\n\t\t\tg.add(name, nd);\n\t\t\tcreated.set(name, nd);\n\t\t\tpending.delete(name);\n\t\t\tprogressed = true;\n\t\t}\n\t}\n\tif (pending.size > 0) {\n\t\tconst unresolved = [...pending.keys()].sort().join(\", \");\n\t\tthrow new Error(`compileSpec: unresolvable deps for nodes: ${unresolved}`);\n\t}\n\n\t// Phase 2: Expand template instantiations as mounted subgraphs\n\tfor (const [name, raw] of Object.entries(spec.nodes)) {\n\t\tif (raw.type !== \"template\") continue;\n\t\tconst ref = raw as GraphSpecTemplateRef;\n\t\tconst tmpl = templates[ref.template]!;\n\n\t\tconst sub = new Graph(name);\n\t\tconst subCreated = new Map<string, Node<unknown>>();\n\t\tconst subDeferred: [string, GraphSpecNode][] = [];\n\n\t\t// Create inner nodes, resolving $params to bound nodes\n\t\tfor (const [nName, nSpec] of Object.entries(tmpl.nodes)) {\n\t\t\tconst resolvedDeps = (nSpec.deps ?? []).map((dep) => {\n\t\t\t\tif (dep.startsWith(\"$\") && ref.bind[dep]) {\n\t\t\t\t\treturn ref.bind[dep];\n\t\t\t\t}\n\t\t\t\treturn dep;\n\t\t\t});\n\t\t\tconst specWithResolvedDeps = { ...nSpec, deps: resolvedDeps };\n\n\t\t\tif (nSpec.type === \"state\") {\n\t\t\t\tconst nd = state(nSpec.initial, {\n\t\t\t\t\tname: nName,\n\t\t\t\t\tmeta: nSpec.meta ? { ...nSpec.meta } : undefined,\n\t\t\t\t});\n\t\t\t\tsub.add(nName, nd);\n\t\t\t\tsubCreated.set(nName, nd);\n\t\t\t} else if (nSpec.type === \"producer\") {\n\t\t\t\t// Handle producer nodes inside templates\n\t\t\t\tconst sourceFactory = nSpec.source ? resolveSource(nSpec.source) : undefined;\n\t\t\t\tconst fnFactory = nSpec.fn ? resolveFn(nSpec.fn) : undefined;\n\t\t\t\tif (sourceFactory) {\n\t\t\t\t\tconst nd = sourceFactory(nSpec.config ?? {});\n\t\t\t\t\tsub.add(nName, nd);\n\t\t\t\t\tsubCreated.set(nName, nd);\n\t\t\t\t} else if (fnFactory) {\n\t\t\t\t\tconst nd = fnFactory([], nSpec.config ?? {});\n\t\t\t\t\tsub.add(nName, nd);\n\t\t\t\t\tsubCreated.set(nName, nd);\n\t\t\t\t} else {\n\t\t\t\t\tconst nd = producer(() => {}, {\n\t\t\t\t\t\tname: nName,\n\t\t\t\t\t\tmeta: { ...nSpec.meta, _specFn: nSpec.fn, _specSource: nSpec.source },\n\t\t\t\t\t});\n\t\t\t\t\tsub.add(nName, nd);\n\t\t\t\t\tsubCreated.set(nName, nd);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tsubDeferred.push([nName, specWithResolvedDeps]);\n\t\t\t}\n\t\t}\n\n\t\t// Resolve deferred inner nodes\n\t\tlet subProgressed = true;\n\t\tconst subPending = new Map(subDeferred);\n\t\twhile (subPending.size > 0 && subProgressed) {\n\t\t\tsubProgressed = false;\n\t\t\tfor (const [nName, nSpec] of [...subPending.entries()]) {\n\t\t\t\tconst deps = nSpec.deps ?? [];\n\t\t\t\tconst allReady = deps.every((dep) => subCreated.has(dep) || created.has(dep));\n\t\t\t\tif (!allReady) continue;\n\n\t\t\t\tconst resolvedDeps = deps.map((dep) => subCreated.get(dep) ?? created.get(dep)!);\n\t\t\t\tconst fnFactory = nSpec.fn ? resolveFn(nSpec.fn) : undefined;\n\n\t\t\t\tlet nd: Node<unknown>;\n\t\t\t\tif (fnFactory) {\n\t\t\t\t\tnd = fnFactory(resolvedDeps, nSpec.config ?? {});\n\t\t\t\t} else if (nSpec.type === \"effect\") {\n\t\t\t\t\tnd = effect(resolvedDeps, () => {});\n\t\t\t\t} else {\n\t\t\t\t\tnd = derived(resolvedDeps, (vals: readonly unknown[]) => vals[0]);\n\t\t\t\t}\n\t\t\t\tsub.add(nName, nd);\n\t\t\t\tsubCreated.set(nName, nd);\n\t\t\t\tsubPending.delete(nName);\n\t\t\t\tsubProgressed = true;\n\t\t\t}\n\t\t}\n\t\tif (subPending.size > 0) {\n\t\t\tconst unresolved = [...subPending.keys()].sort().join(\", \");\n\t\t\tthrow new Error(\n\t\t\t\t`compileSpec: template \"${ref.template}\" has unresolvable deps: ${unresolved}`,\n\t\t\t);\n\t\t}\n\n\t\tg.mount(name, sub);\n\t\t// Register template output as a reachable node path\n\t\tconst outputPath = `${name}::${tmpl.output}`;\n\t\tcreated.set(name, g.resolve(outputPath));\n\n\t\t// Store template origin meta on the mounted subgraph's first node\n\t\t// so decompileGraph can recover it without structural fingerprinting.\n\t\ttry {\n\t\t\tconst outputNode = g.resolve(outputPath);\n\t\t\toutputNode.meta._templateName?.down([[DATA, ref.template]]);\n\t\t\toutputNode.meta._templateBind?.down([[DATA, ref.bind]]);\n\t\t} catch {\n\t\t\t/* meta nodes may not exist; template origin is best-effort */\n\t\t}\n\t}\n\n\t// Edges are derived from node `_deps` (Unit 7) — no explicit edge wiring step.\n\n\t// Phase 4: Wire feedback edges via §8.1 feedback()\n\tfor (const fb of spec.feedback ?? []) {\n\t\tfeedbackPrimitive(g, fb.from, fb.to, {\n\t\t\tmaxIterations: fb.maxIterations,\n\t\t});\n\t}\n\n\treturn g;\n}\n\n// ---------------------------------------------------------------------------\n// decompileGraph\n// ---------------------------------------------------------------------------\n\n/** Internal meta keys used by compileSpec/feedback — stripped from output. */\nconst INTERNAL_META_KEYS = new Set([\n\t\"reduction\",\n\t\"reduction_type\",\n\t\"_specFn\",\n\t\"_specSource\",\n\t\"_templateName\",\n\t\"_templateBind\",\n\t\"feedbackFrom\",\n\t\"feedbackTo\",\n\t\"_internal\",\n]);\n\n/**\n * Extract a GraphSpec from a running graph.\n *\n * Uses `describe({ detail: \"standard\" })` as a starting point, then enriches:\n * - Feedback edges recovered from counter node meta (`feedbackFrom`/`feedbackTo`)\n * - Template refs recovered from output node meta (`_templateName`/`_templateBind`)\n * - Structural fingerprinting as fallback for 2+ identical mounted subgraphs\n *\n * @param graph - Running graph to decompile.\n * @returns A GraphSpec representation.\n *\n * @category patterns\n */\nexport function decompileGraph(graph: Graph): GraphSpec {\n\tconst desc = graph.describe({ detail: \"standard\" });\n\tconst nodes: Record<string, GraphSpecNode> = {};\n\tconst feedbackEdges: GraphSpecFeedbackEdge[] = [];\n\tconst metaSegment = `::${GRAPH_META_SEGMENT}::`;\n\n\t// Detect feedback counter nodes and extract feedback edges from meta\n\tconst feedbackCounterPattern = /^__feedback_(?!effect_)(.+)$/;\n\tconst feedbackConditions = new Set<string>();\n\n\tfor (const path of Object.keys(desc.nodes)) {\n\t\tif (path.includes(metaSegment)) continue;\n\t\tconst match = feedbackCounterPattern.exec(path);\n\t\tif (match) {\n\t\t\tfeedbackConditions.add(match[1]!);\n\t\t\tconst meta = desc.nodes[path]?.meta as Record<string, unknown> | undefined;\n\t\t\tif (meta?.feedbackFrom && meta?.feedbackTo) {\n\t\t\t\tfeedbackEdges.push({\n\t\t\t\t\tfrom: meta.feedbackFrom as string,\n\t\t\t\t\tto: meta.feedbackTo as string,\n\t\t\t\t\t...(meta.maxIterations ? { maxIterations: meta.maxIterations as number } : {}),\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t}\n\n\t// Build nodes map, skipping meta, feedback internals, and bridge nodes\n\tfor (const [path, nodeDesc] of Object.entries(desc.nodes)) {\n\t\tif (path.includes(metaSegment)) continue;\n\t\tif (feedbackCounterPattern.test(path)) continue;\n\t\t// Skip internal infrastructure nodes (bridge, feedback effect) via meta tag\n\t\tif (nodeDesc.meta?._internal) continue;\n\t\t// Legacy fallback: skip by naming convention\n\t\tif (path.startsWith(\"__feedback_effect_\")) continue;\n\t\tif (path.startsWith(\"__bridge_\")) continue;\n\t\t// Skip subgraph-internal nodes (they belong to templates)\n\t\tif (path.includes(\"::\")) continue;\n\n\t\tconst specNode: GraphSpecNode = {\n\t\t\ttype: nodeDesc.type as GraphSpecNode[\"type\"],\n\t\t};\n\n\t\tif (nodeDesc.deps.length > 0) {\n\t\t\tspecNode.deps = nodeDesc.deps.filter((d) => !d.includes(\"::\"));\n\t\t}\n\n\t\tif (nodeDesc.type === \"state\" && nodeDesc.value !== undefined) {\n\t\t\tspecNode.initial = nodeDesc.value;\n\t\t}\n\n\t\tif (nodeDesc.meta && Object.keys(nodeDesc.meta).length > 0) {\n\t\t\tconst meta: Record<string, unknown> = {};\n\t\t\tfor (const [k, v] of Object.entries(nodeDesc.meta as Record<string, unknown>)) {\n\t\t\t\tif (!INTERNAL_META_KEYS.has(k)) meta[k] = v;\n\t\t\t}\n\t\t\tif (Object.keys(meta).length > 0) {\n\t\t\t\tspecNode.meta = meta;\n\t\t\t}\n\t\t}\n\n\t\tnodes[path] = specNode;\n\t}\n\n\t// Detect templates: first from compile-time meta (option B), then structural fallback\n\tconst templates: Record<string, GraphSpecTemplate> = {};\n\tconst templateRefs: Record<string, GraphSpecTemplateRef> = {};\n\tconst metaDetectedSubgraphs = new Set<string>();\n\n\t// Option B: recover template origin from meta stored by compileSpec\n\tfor (const subName of desc.subgraphs) {\n\t\tconst prefix = `${subName}::`;\n\t\tfor (const [path, nodeDesc] of Object.entries(desc.nodes)) {\n\t\t\tif (!path.startsWith(prefix)) continue;\n\t\t\tif (path.includes(metaSegment)) continue;\n\t\t\tconst meta = nodeDesc.meta as Record<string, unknown> | undefined;\n\t\t\tif (meta?._templateName && meta?._templateBind) {\n\t\t\t\tconst templateName = meta._templateName as string;\n\t\t\t\tconst bind = meta._templateBind as Record<string, string>;\n\n\t\t\t\t// Reconstruct template definition from the subgraph's nodes\n\t\t\t\tif (!templates[templateName]) {\n\t\t\t\t\tconst tmplNodes: Record<string, GraphSpecNode> = {};\n\t\t\t\t\tconst tmplInnerNames = new Set<string>();\n\t\t\t\t\tconst tmplPrefix = `${subName}::`;\n\t\t\t\t\tfor (const [p, nd] of Object.entries(desc.nodes)) {\n\t\t\t\t\t\tif (!p.startsWith(tmplPrefix) || p.includes(metaSegment)) continue;\n\t\t\t\t\t\tconst localName = p.slice(tmplPrefix.length);\n\t\t\t\t\t\tif (localName.includes(\"::\")) continue;\n\t\t\t\t\t\ttmplInnerNames.add(localName);\n\t\t\t\t\t\ttmplNodes[localName] = {\n\t\t\t\t\t\t\ttype: nd.type as GraphSpecNode[\"type\"],\n\t\t\t\t\t\t\t...(nd.deps.length > 0\n\t\t\t\t\t\t\t\t? {\n\t\t\t\t\t\t\t\t\t\tdeps: nd.deps.map((d) =>\n\t\t\t\t\t\t\t\t\t\t\td.startsWith(tmplPrefix) ? d.slice(tmplPrefix.length) : d,\n\t\t\t\t\t\t\t\t\t\t),\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t: {}),\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\t\t\t\t\t// Detect params (external deps) and output\n\t\t\t\t\tconst tmplParams: string[] = [];\n\t\t\t\t\tconst tmplParamMap = new Map<string, string>();\n\t\t\t\t\tfor (const n of Object.values(tmplNodes)) {\n\t\t\t\t\t\tfor (const dep of n.deps ?? []) {\n\t\t\t\t\t\t\tif (!tmplInnerNames.has(dep) && !tmplParamMap.has(dep)) {\n\t\t\t\t\t\t\t\tconst param = `$${dep}`;\n\t\t\t\t\t\t\t\ttmplParams.push(param);\n\t\t\t\t\t\t\t\ttmplParamMap.set(dep, param);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t// Substitute external deps with $params\n\t\t\t\t\tfor (const n of Object.values(tmplNodes)) {\n\t\t\t\t\t\tif (n.deps) n.deps = n.deps.map((d) => tmplParamMap.get(d) ?? d);\n\t\t\t\t\t}\n\t\t\t\t\t// Find output\n\t\t\t\t\tconst depended = new Set<string>();\n\t\t\t\t\tfor (const n of Object.values(tmplNodes)) {\n\t\t\t\t\t\tfor (const dep of n.deps ?? []) {\n\t\t\t\t\t\t\tif (tmplInnerNames.has(dep)) depended.add(dep);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tconst outputCandidates = [...tmplInnerNames].filter((n) => !depended.has(n));\n\t\t\t\t\tconst tmplOutput = outputCandidates[0] ?? [...tmplInnerNames].pop()!;\n\n\t\t\t\t\ttemplates[templateName] = { params: tmplParams, nodes: tmplNodes, output: tmplOutput };\n\t\t\t\t}\n\n\t\t\t\tdelete nodes[subName];\n\t\t\t\ttemplateRefs[subName] = { type: \"template\", template: templateName, bind };\n\t\t\t\tmetaDetectedSubgraphs.add(subName);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t// Structural fallback: group remaining mounted subgraphs by fingerprint\n\tconst structureMap = new Map<string, { name: string; nodes: Record<string, GraphSpecNode> }[]>();\n\tfor (const subName of desc.subgraphs) {\n\t\tif (metaDetectedSubgraphs.has(subName)) continue;\n\t\tconst subNodes: Record<string, GraphSpecNode> = {};\n\t\tconst prefix = `${subName}::`;\n\t\tfor (const [path, nodeDesc] of Object.entries(desc.nodes)) {\n\t\t\tif (path.includes(metaSegment)) continue;\n\t\t\tif (!path.startsWith(prefix)) continue;\n\t\t\tconst localName = path.slice(prefix.length);\n\t\t\tif (localName.includes(\"::\")) continue;\n\t\t\tsubNodes[localName] = {\n\t\t\t\ttype: nodeDesc.type as GraphSpecNode[\"type\"],\n\t\t\t\t...(nodeDesc.deps.length > 0\n\t\t\t\t\t? {\n\t\t\t\t\t\t\tdeps: nodeDesc.deps.map((d) => (d.startsWith(prefix) ? d.slice(prefix.length) : d)),\n\t\t\t\t\t\t}\n\t\t\t\t\t: {}),\n\t\t\t};\n\t\t}\n\t\tconst fingerprint = JSON.stringify(\n\t\t\tObject.fromEntries(\n\t\t\t\tObject.entries(subNodes)\n\t\t\t\t\t.sort(([a], [b]) => a.localeCompare(b))\n\t\t\t\t\t.map(([k, v]) => [k, { type: v.type, deps: v.deps ?? [] }]),\n\t\t\t),\n\t\t);\n\t\tif (!structureMap.has(fingerprint)) {\n\t\t\tstructureMap.set(fingerprint, []);\n\t\t}\n\t\tstructureMap.get(fingerprint)!.push({ name: subName, nodes: subNodes });\n\t}\n\n\t// Subgraphs with identical structure (2+ instances) → templates\n\tfor (const [, group] of structureMap) {\n\t\tif (group.length < 2) continue;\n\t\tconst templateName = `${group[0]!.name}_template`;\n\t\tconst refNodes = group[0]!.nodes;\n\t\tconst innerNames = new Set(Object.keys(refNodes));\n\n\t\t// Detect external deps as params (from first member)\n\t\tconst params: string[] = [];\n\t\tconst baseParamMap = new Map<string, string>();\n\t\tfor (const n of Object.values(refNodes)) {\n\t\t\tfor (const dep of n.deps ?? []) {\n\t\t\t\tif (!innerNames.has(dep) && !baseParamMap.has(dep)) {\n\t\t\t\t\tconst param = `$${dep}`;\n\t\t\t\t\tparams.push(param);\n\t\t\t\t\tbaseParamMap.set(dep, param);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Find output node\n\t\tconst depended = new Set<string>();\n\t\tfor (const n of Object.values(refNodes)) {\n\t\t\tfor (const dep of n.deps ?? []) {\n\t\t\t\tif (innerNames.has(dep)) depended.add(dep);\n\t\t\t}\n\t\t}\n\t\tconst outputCandidates = [...innerNames].filter((n) => !depended.has(n));\n\t\tconst output = outputCandidates[0] ?? [...innerNames].pop()!;\n\n\t\t// Build template nodes with param-substituted deps\n\t\tconst tmplNodes: Record<string, GraphSpecNode> = {};\n\t\tfor (const [nName, nSpec] of Object.entries(refNodes)) {\n\t\t\ttmplNodes[nName] = {\n\t\t\t\t...nSpec,\n\t\t\t\tdeps: nSpec.deps?.map((d) => baseParamMap.get(d) ?? d),\n\t\t\t};\n\t\t}\n\n\t\ttemplates[templateName] = { params, nodes: tmplNodes, output };\n\n\t\t// Build per-member bind maps (each member may bind to different external nodes)\n\t\tfor (const member of group) {\n\t\t\tdelete nodes[member.name];\n\t\t\t// Build this member's own bind map by scanning its external deps\n\t\t\tconst memberBind: Record<string, string> = {};\n\t\t\tconst memberInnerNames = new Set(Object.keys(member.nodes));\n\t\t\tfor (const n of Object.values(member.nodes)) {\n\t\t\t\tfor (const dep of n.deps ?? []) {\n\t\t\t\t\tif (!memberInnerNames.has(dep)) {\n\t\t\t\t\t\t// Find which param this external dep maps to\n\t\t\t\t\t\tconst param = baseParamMap.get(dep) ?? `$${dep}`;\n\t\t\t\t\t\tmemberBind[param] = dep;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ttemplateRefs[member.name] = {\n\t\t\t\ttype: \"template\",\n\t\t\t\ttemplate: templateName,\n\t\t\t\tbind: memberBind,\n\t\t\t};\n\t\t}\n\t}\n\n\tconst allNodes: Record<string, GraphSpecNode | GraphSpecTemplateRef> = {\n\t\t...nodes,\n\t\t...templateRefs,\n\t};\n\n\tconst result: GraphSpec = { name: desc.name, nodes: allNodes };\n\tif (Object.keys(templates).length > 0) result.templates = templates;\n\tif (feedbackEdges.length > 0) result.feedback = feedbackEdges;\n\n\treturn result;\n}\n\n// ---------------------------------------------------------------------------\n// specDiff\n// ---------------------------------------------------------------------------\n\n/** A single change in a spec diff. */\nexport type SpecDiffEntry = {\n\ttype: \"added\" | \"removed\" | \"changed\";\n\tpath: string;\n\tdetail?: string;\n};\n\n/** Structural diff between two GraphSpecs. */\nexport type SpecDiffResult = {\n\tentries: SpecDiffEntry[];\n\tsummary: string;\n};\n\n/**\n * Compute a structural diff between two GraphSpecs.\n *\n * Template-aware: reports \"changed template definition\" vs \"changed\n * instantiation bindings.\" No runtime needed — pure JSON comparison.\n *\n * @param specA - The \"before\" spec.\n * @param specB - The \"after\" spec.\n * @returns Diff entries and a human-readable summary.\n *\n * @category patterns\n */\nexport function specDiff(specA: GraphSpec, specB: GraphSpec): SpecDiffResult {\n\tconst entries: SpecDiffEntry[] = [];\n\n\t// Diff name\n\tif (specA.name !== specB.name) {\n\t\tentries.push({\n\t\t\ttype: \"changed\",\n\t\t\tpath: \"name\",\n\t\t\tdetail: `\"${specA.name}\" → \"${specB.name}\"`,\n\t\t});\n\t}\n\n\t// Diff nodes\n\tconst nodesA = new Set(Object.keys(specA.nodes));\n\tconst nodesB = new Set(Object.keys(specB.nodes));\n\n\tfor (const name of nodesB) {\n\t\tif (!nodesA.has(name)) {\n\t\t\tconst n = specB.nodes[name]!;\n\t\t\tentries.push({\n\t\t\t\ttype: \"added\",\n\t\t\t\tpath: `nodes.${name}`,\n\t\t\t\tdetail: `type: ${n.type}`,\n\t\t\t});\n\t\t}\n\t}\n\tfor (const name of nodesA) {\n\t\tif (!nodesB.has(name)) {\n\t\t\tentries.push({ type: \"removed\", path: `nodes.${name}` });\n\t\t}\n\t}\n\tfor (const name of nodesA) {\n\t\tif (!nodesB.has(name)) continue;\n\t\tconst a = specA.nodes[name]!;\n\t\tconst b = specB.nodes[name]!;\n\t\tif (JSON.stringify(a) !== JSON.stringify(b)) {\n\t\t\tconst details: string[] = [];\n\t\t\tif (a.type !== b.type) details.push(`type: ${a.type} → ${b.type}`);\n\t\t\tif (JSON.stringify((a as GraphSpecNode).deps) !== JSON.stringify((b as GraphSpecNode).deps)) {\n\t\t\t\tdetails.push(\"deps changed\");\n\t\t\t}\n\t\t\tif ((a as GraphSpecNode).fn !== (b as GraphSpecNode).fn) {\n\t\t\t\tdetails.push(`fn: ${(a as GraphSpecNode).fn} → ${(b as GraphSpecNode).fn}`);\n\t\t\t}\n\t\t\tif (\n\t\t\t\tJSON.stringify((a as GraphSpecNode).config) !== JSON.stringify((b as GraphSpecNode).config)\n\t\t\t) {\n\t\t\t\tdetails.push(\"config changed\");\n\t\t\t}\n\t\t\tentries.push({\n\t\t\t\ttype: \"changed\",\n\t\t\t\tpath: `nodes.${name}`,\n\t\t\t\tdetail: details.join(\"; \") || \"modified\",\n\t\t\t});\n\t\t}\n\t}\n\n\t// Diff templates\n\tconst tmplA = specA.templates ?? {};\n\tconst tmplB = specB.templates ?? {};\n\tconst tmplNamesA = new Set(Object.keys(tmplA));\n\tconst tmplNamesB = new Set(Object.keys(tmplB));\n\n\tfor (const name of tmplNamesB) {\n\t\tif (!tmplNamesA.has(name)) {\n\t\t\tentries.push({ type: \"added\", path: `templates.${name}` });\n\t\t}\n\t}\n\tfor (const name of tmplNamesA) {\n\t\tif (!tmplNamesB.has(name)) {\n\t\t\tentries.push({ type: \"removed\", path: `templates.${name}` });\n\t\t}\n\t}\n\tfor (const name of tmplNamesA) {\n\t\tif (!tmplNamesB.has(name)) continue;\n\t\tif (JSON.stringify(tmplA[name]) !== JSON.stringify(tmplB[name])) {\n\t\t\tentries.push({\n\t\t\t\ttype: \"changed\",\n\t\t\t\tpath: `templates.${name}`,\n\t\t\t\tdetail: \"template definition changed\",\n\t\t\t});\n\t\t}\n\t}\n\n\t// Diff feedback\n\tconst fbA = specA.feedback ?? [];\n\tconst fbB = specB.feedback ?? [];\n\tconst fbKeyA = new Set(fbA.map((e) => `${e.from}->${e.to}`));\n\tconst fbKeyB = new Set(fbB.map((e) => `${e.from}->${e.to}`));\n\n\tfor (const fb of fbB) {\n\t\tconst key = `${fb.from}->${fb.to}`;\n\t\tif (!fbKeyA.has(key)) {\n\t\t\tentries.push({\n\t\t\t\ttype: \"added\",\n\t\t\t\tpath: `feedback.${key}`,\n\t\t\t\tdetail: `maxIterations: ${fb.maxIterations ?? 10}`,\n\t\t\t});\n\t\t}\n\t}\n\tfor (const fb of fbA) {\n\t\tconst key = `${fb.from}->${fb.to}`;\n\t\tif (!fbKeyB.has(key)) {\n\t\t\tentries.push({ type: \"removed\", path: `feedback.${key}` });\n\t\t}\n\t}\n\tfor (const fb of fbA) {\n\t\tconst key = `${fb.from}->${fb.to}`;\n\t\tconst counterpart = fbB.find((b) => b.from === fb.from && b.to === fb.to);\n\t\tif (counterpart && JSON.stringify(fb) !== JSON.stringify(counterpart)) {\n\t\t\tentries.push({\n\t\t\t\ttype: \"changed\",\n\t\t\t\tpath: `feedback.${key}`,\n\t\t\t\tdetail: `maxIterations: ${fb.maxIterations ?? 10} → ${counterpart.maxIterations ?? 10}`,\n\t\t\t});\n\t\t}\n\t}\n\n\t// Build summary\n\tconst added = entries.filter((e) => e.type === \"added\").length;\n\tconst removed = entries.filter((e) => e.type === \"removed\").length;\n\tconst changed = entries.filter((e) => e.type === \"changed\").length;\n\tconst parts: string[] = [];\n\tif (added) parts.push(`${added} added`);\n\tif (removed) parts.push(`${removed} removed`);\n\tif (changed) parts.push(`${changed} changed`);\n\tconst summary = parts.length > 0 ? parts.join(\", \") : \"no changes\";\n\n\treturn { entries, summary };\n}\n\n// ---------------------------------------------------------------------------\n// llmCompose\n// ---------------------------------------------------------------------------\n\n/** Options for {@link llmCompose}. */\nexport type LLMComposeOptions = {\n\tmodel?: string;\n\ttemperature?: number;\n\tmaxTokens?: number;\n\t/** Extra instructions appended to the system prompt. */\n\tsystemPromptExtra?: string;\n\t/**\n\t * Available fn/source catalog names for the LLM to reference.\n\t * When omitted and `catalog` contains rich {@link CatalogFnEntry} entries,\n\t * the prompt is auto-generated via {@link generateCatalogPrompt}.\n\t */\n\tcatalogDescription?: string;\n\t/**\n\t * Catalog for auto-prompt generation and catalog-aware validation.\n\t * When rich entries are provided, the catalog prompt is auto-generated\n\t * and LLM output is validated against fn/source names and config schemas.\n\t */\n\tcatalog?: GraphSpecCatalog;\n\t/**\n\t * Max auto-refine attempts when the LLM output fails catalog validation.\n\t * Each attempt feeds the validation errors back to the LLM via llmRefine.\n\t * Default: 0 (no auto-refine). Set to 2-3 for production use.\n\t */\n\tmaxAutoRefine?: number;\n};\n\nconst LLM_COMPOSE_SYSTEM_PROMPT = `You are a graph architect for GraphReFly, a reactive graph protocol.\n\nGiven a natural-language description, produce a JSON GraphSpec with this structure:\n\n{\n  \"name\": \"<graph_name>\",\n  \"nodes\": {\n    \"<node_name>\": {\n      \"type\": \"state\" | \"derived\" | \"producer\" | \"effect\" | \"operator\",\n      \"deps\": [\"<dep_node_name>\", ...],\n      \"fn\": \"<catalog_function_name>\",\n      \"source\": \"<catalog_source_name>\",\n      \"config\": { ... },\n      \"initial\": <value>,\n      \"meta\": { \"description\": \"<purpose>\" }\n    },\n    \"<template_instance>\": {\n      \"type\": \"template\",\n      \"template\": \"<template_name>\",\n      \"bind\": { \"$param\": \"node_name\" }\n    }\n  },\n  \"templates\": {\n    \"<template_name>\": {\n      \"params\": [\"$param1\", \"$param2\"],\n      \"nodes\": { ... },\n      \"output\": \"<output_node>\"\n    }\n  },\n  \"feedback\": [\n    { \"from\": \"<condition_node>\", \"to\": \"<state_node>\", \"maxIterations\": 10 }\n  ]\n}\n\nRules:\n- \"state\" nodes hold user/LLM-writable values (knobs). Use \"initial\" for default values.\n- \"derived\" nodes compute from deps using a named \"fn\".\n- \"effect\" nodes produce side effects from deps.\n- \"producer\" nodes generate values from a named \"source\".\n- Use \"templates\" when the same subgraph pattern repeats (e.g., per-source resilience).\n- Use \"feedback\" for bounded cycles where a derived value writes back to a state node.\n- meta.description is required for every node.\n- Return ONLY valid JSON, no markdown fences or commentary.`;\n\n/** Strip markdown code fences. */\nfunction stripFences(text: string): string {\n\tconst match = text.match(/^```(?:json)?\\s*([\\s\\S]*?)\\s*```[\\s\\S]*$/);\n\treturn match ? match[1]! : text;\n}\n\n/**\n * Ask an LLM to compose a GraphSpec from a natural-language problem description.\n *\n * The LLM generates a GraphSpec (with templates + feedback), validated before\n * returning. The spec is for human review before compilation via compileSpec().\n *\n * @param problem - Natural language problem description.\n * @param adapter - LLM adapter for the generation call.\n * @param opts - Model options and catalog description.\n * @returns A validated GraphSpec.\n * @throws On invalid LLM output or validation failure.\n *\n * @category patterns\n */\nexport async function llmCompose(\n\tproblem: string,\n\tadapter: LLMAdapter,\n\topts?: LLMComposeOptions,\n): Promise<GraphSpec> {\n\tlet systemPrompt = LLM_COMPOSE_SYSTEM_PROMPT;\n\n\t// Auto-generate catalog prompt from rich entries, or use manual description\n\tconst catalogPrompt =\n\t\topts?.catalogDescription ?? (opts?.catalog ? generateCatalogPrompt(opts.catalog) : undefined);\n\tif (catalogPrompt) {\n\t\tsystemPrompt += `\\n\\nAvailable catalog (use ONLY these names):\\n${catalogPrompt}`;\n\t}\n\tif (opts?.systemPromptExtra) {\n\t\tsystemPrompt += `\\n\\n${opts.systemPromptExtra}`;\n\t}\n\n\tconst messages: ChatMessage[] = [\n\t\t{ role: \"system\", content: systemPrompt },\n\t\t{ role: \"user\", content: problem },\n\t];\n\n\tconst rawResult = adapter.invoke(messages, {\n\t\tmodel: opts?.model,\n\t\ttemperature: opts?.temperature ?? 0,\n\t\tmaxTokens: opts?.maxTokens,\n\t});\n\n\t// System boundary: await the adapter's response (Promise, plain value).\n\tconst response = (await rawResult) as LLMResponse;\n\tlet content = response.content.trim();\n\n\tif (content.startsWith(\"```\")) {\n\t\tcontent = stripFences(content);\n\t}\n\n\tlet parsed: unknown;\n\ttry {\n\t\tparsed = JSON.parse(content);\n\t} catch {\n\t\tthrow new Error(`llmCompose: LLM response is not valid JSON: ${content.slice(0, 200)}`);\n\t}\n\n\tconst validation = validateSpec(parsed);\n\tif (!validation.valid) {\n\t\tthrow new Error(`llmCompose: invalid GraphSpec:\\n${validation.errors.join(\"\\n\")}`);\n\t}\n\n\tlet spec = parsed as GraphSpec;\n\n\t// Catalog-aware validation + auto-refine loop\n\tif (opts?.catalog) {\n\t\tconst maxRefine = opts.maxAutoRefine ?? 0;\n\t\tfor (let attempt = 0; attempt <= maxRefine; attempt++) {\n\t\t\tconst catalogValidation = validateSpecAgainstCatalog(spec, opts.catalog);\n\t\t\tif (catalogValidation.valid) break;\n\n\t\t\tif (attempt === maxRefine) {\n\t\t\t\t// Last attempt failed — return with errors attached as meta\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`llmCompose: catalog validation failed after ${maxRefine} refine attempts:\\n${catalogValidation.errors.join(\"\\n\")}`,\n\t\t\t\t);\n\t\t\t}\n\n\t\t\t// Auto-refine: feed catalog errors back to LLM\n\t\t\tspec = await llmRefine(\n\t\t\t\tspec,\n\t\t\t\t`Fix these catalog errors:\\n${catalogValidation.errors.join(\"\\n\")}\\n\\nUse ONLY functions and sources from the catalog.`,\n\t\t\t\tadapter,\n\t\t\t\t{ ...opts, catalogDescription: catalogPrompt },\n\t\t\t);\n\t\t}\n\t}\n\n\treturn spec;\n}\n\n// ---------------------------------------------------------------------------\n// llmRefine\n// ---------------------------------------------------------------------------\n\n/** Options for {@link llmRefine}. */\nexport type LLMRefineOptions = LLMComposeOptions;\n\n/**\n * Ask an LLM to modify an existing GraphSpec based on feedback or changed requirements.\n *\n * @param currentSpec - The current GraphSpec to modify.\n * @param feedback - Natural language feedback or changed requirements.\n * @param adapter - LLM adapter for the generation call.\n * @param opts - Model options.\n * @returns A new GraphSpec incorporating the feedback.\n * @throws On invalid LLM output or validation failure.\n *\n * @category patterns\n */\nexport async function llmRefine(\n\tcurrentSpec: GraphSpec,\n\tfeedback: string,\n\tadapter: LLMAdapter,\n\topts?: LLMRefineOptions,\n): Promise<GraphSpec> {\n\tlet systemPrompt = LLM_COMPOSE_SYSTEM_PROMPT;\n\tif (opts?.catalogDescription) {\n\t\tsystemPrompt += `\\n\\nAvailable catalog:\\n${opts.catalogDescription}`;\n\t}\n\tif (opts?.systemPromptExtra) {\n\t\tsystemPrompt += `\\n\\n${opts.systemPromptExtra}`;\n\t}\n\n\tconst messages: ChatMessage[] = [\n\t\t{ role: \"system\", content: systemPrompt },\n\t\t{\n\t\t\trole: \"user\",\n\t\t\tcontent: `Current GraphSpec:\\n${JSON.stringify(currentSpec, null, 2)}\\n\\nModification request: ${feedback}\\n\\nReturn the complete modified GraphSpec as JSON.`,\n\t\t},\n\t];\n\n\tconst rawResult = adapter.invoke(messages, {\n\t\tmodel: opts?.model,\n\t\ttemperature: opts?.temperature ?? 0,\n\t\tmaxTokens: opts?.maxTokens,\n\t});\n\n\t// System boundary: await the adapter's response.\n\tconst response = (await rawResult) as LLMResponse;\n\tlet content = response.content.trim();\n\n\tif (content.startsWith(\"```\")) {\n\t\tcontent = stripFences(content);\n\t}\n\n\tlet parsed: unknown;\n\ttry {\n\t\tparsed = JSON.parse(content);\n\t} catch {\n\t\tthrow new Error(`llmRefine: LLM response is not valid JSON: ${content.slice(0, 200)}`);\n\t}\n\n\tconst validation = validateSpec(parsed);\n\tif (!validation.valid) {\n\t\tthrow new Error(`llmRefine: invalid GraphSpec:\\n${validation.errors.join(\"\\n\")}`);\n\t}\n\n\treturn parsed as GraphSpec;\n}\n","/**\n * Composable safety layer (roadmap §9.0b).\n *\n * {@link guardedExecution} wraps any {@link Graph} with:\n *\n * - {@link policyEnforcer} — reactive ABAC, policies stored as a `Node` so\n *   LLMs / humans can update them at runtime. Now with full transitive\n *   dynamic coverage via `watchTopologyTree`.\n * - Scoped {@link GuardedExecutionGraph.scopedDescribe} — delegates to\n *   `target.describe({actor})` so callers see only what the actor is\n *   allowed to see.\n * - The enforcer's `violations` topic is republished as `violations` on\n *   the wrapper, composable with {@link graphLens}.`health` alerts.\n *\n * V1 scope: policies + actor + scoped describe. Budget-as-option is NOT\n * in V1 — it requires a cost-tracking design that hasn't landed yet.\n * Callers who need a budget limit today append a budget-aware\n * {@link PolicyRuleData} to the policies list (check current cost and\n * `deny` when exhausted).\n *\n * @module\n */\nimport type { Actor } from \"../core/actor.js\";\nimport type { PolicyRuleData } from \"../core/guard.js\";\nimport type { Node } from \"../core/node.js\";\nimport {\n\ttype DescribeFilter,\n\tGraph,\n\ttype GraphDescribeOptions,\n\ttype GraphDescribeOutput,\n\ttype GraphOptions,\n} from \"../graph/index.js\";\nimport { type PolicyEnforcerGraph, type PolicyViolation, policyEnforcer } from \"./audit.js\";\nimport type { TopicGraph } from \"./messaging.js\";\n\n/** Options for {@link guardedExecution}. */\nexport interface GuardedExecutionOptions {\n\t/**\n\t * Policies enforced against every guarded write. Static list or a live\n\t * `Node<readonly PolicyRuleData[]>` (LLM-updatable).\n\t *\n\t * **Deny-by-default gotcha:** the underlying `policyFromRules()` denies any\n\t * action that matches no rule. An empty policies list in `mode: \"enforce\"`\n\t * therefore blocks EVERY write AND every `observe` through the stacked\n\t * guard — including `scopedDescribe()`. If you want a permissive base, add\n\t * at least `{ effect: \"allow\", action: \"*\" }` and layer deny rules on top.\n\t * In `mode: \"audit\"` no guards are stacked, so empty policies are safe.\n\t */\n\tpolicies: readonly PolicyRuleData[] | Node<readonly PolicyRuleData[]>;\n\t/**\n\t * Actor whose perspective drives {@link GuardedExecutionGraph.scopedDescribe}\n\t * and {@link GuardedExecutionGraph.describe} — when omitted, callers must\n\t * pass `{actor}` explicitly or they get the target's raw describe.\n\t */\n\tactor?: Actor;\n\t/**\n\t * `\"enforce\"` (default) — push guards onto target nodes so disallowed\n\t * writes throw {@link GuardDenied}.\n\t * `\"audit\"` — record would-be denials to the `violations` topic without\n\t * blocking writes.\n\t */\n\tmode?: \"audit\" | \"enforce\";\n\t/** Ring-buffer cap for the `violations` topic. Default 1000 (inherited from policyEnforcer). */\n\tviolationsLimit?: number;\n\t/** Wrapper graph name. Default `${target.name}_guarded`. */\n\tname?: string;\n\t/** Wrapper graph options. */\n\tgraph?: GraphOptions;\n}\n\n/**\n * Wrapper over a target {@link Graph} providing reactive ABAC + scoped\n * describe. Mounts a {@link PolicyEnforcerGraph} under `enforcer`.\n *\n * @category patterns\n */\nexport class GuardedExecutionGraph extends Graph {\n\treadonly enforcer: PolicyEnforcerGraph;\n\treadonly violations: TopicGraph<PolicyViolation>;\n\tprivate readonly _target: Graph;\n\tprivate readonly _defaultActor: Actor | undefined;\n\n\tconstructor(target: Graph, opts: GuardedExecutionOptions) {\n\t\tsuper(opts.name ?? `${target.name}_guarded`, opts.graph);\n\t\tthis._target = target;\n\t\tthis._defaultActor = opts.actor;\n\n\t\tconst enforcerOpts: {\n\t\t\tmode: \"audit\" | \"enforce\";\n\t\t\tname: string;\n\t\t\tviolationsLimit?: number;\n\t\t} = {\n\t\t\tmode: opts.mode ?? \"enforce\",\n\t\t\tname: \"enforcer\",\n\t\t};\n\t\tif (opts.violationsLimit != null) enforcerOpts.violationsLimit = opts.violationsLimit;\n\n\t\tthis.enforcer = policyEnforcer(target, opts.policies, enforcerOpts);\n\t\tthis.violations = this.enforcer.violations;\n\n\t\t// Mount the enforcer as a child so `wrapper.describe()` surfaces its\n\t\t// `policies` / `violationCount` nodes for introspection.\n\t\tthis.mount(\"enforcer\", this.enforcer);\n\t}\n\n\t/**\n\t * Describe the **target** graph scoped to the configured actor. Returns\n\t * only nodes the actor is permitted to see (via the target's node guards\n\t * filtering `describe()` via `actor`).\n\t *\n\t * Pass `{actor}` in opts to override the configured actor for this call.\n\t * Pass any standard {@link GraphDescribeOptions} fields (`detail`,\n\t * `fields`, `filter`) — they apply to the target's describe.\n\t *\n\t * **Mode interaction:**\n\t * - In `mode: \"enforce\"` (default), the enforcer stacks a policy-derived\n\t *   guard on every target node. `scopedDescribe({actor})` then filters by\n\t *   the AND of per-node guards AND the stacked policy guard.\n\t * - In `mode: \"audit\"`, NO guards are stacked — `scopedDescribe` filters\n\t *   purely by the target's pre-existing per-node guards. If a target has\n\t *   no node-level guards, the policy rules you pass have no effect on\n\t *   visibility (they only populate the `violations` topic on writes).\n\t */\n\tscopedDescribe(\n\t\topts?: Omit<GraphDescribeOptions, \"actor\"> & { actor?: Actor },\n\t): GraphDescribeOutput {\n\t\tconst actor = opts?.actor ?? this._defaultActor;\n\t\tconst describeOpts: GraphDescribeOptions = {\n\t\t\t...opts,\n\t\t\t...(actor != null ? { actor } : {}),\n\t\t};\n\t\treturn this._target.describe(describeOpts);\n\t}\n\n\t/** The wrapped graph (escape hatch for tooling). */\n\tget target(): Graph {\n\t\treturn this._target;\n\t}\n}\n\n/**\n * Wrap a {@link Graph} with {@link policyEnforcer} plus a scoped describe\n * lens. Returns a {@link GuardedExecutionGraph} that can be mounted, diffed,\n * or composed with {@link graphLens}.\n *\n * @param target - The graph to guard.\n * @param opts - See {@link GuardedExecutionOptions}.\n *\n * @example\n * ```ts\n * const guarded = guardedExecution(app, {\n *   actor: { type: \"human\", id: \"alice\" },\n *   policies: [\n *     { effect: \"allow\", action: \"read\", actorType: \"human\" },\n *     { effect: \"deny\", action: \"write\", pathPattern: \"system::*\" },\n *   ],\n *   mode: \"enforce\",\n * });\n *\n * const view = guarded.scopedDescribe({ detail: \"standard\" });\n * guarded.violations.events.subscribe(msgs => console.log(\"violations:\", msgs));\n * ```\n *\n * @category patterns\n */\nexport function guardedExecution(\n\ttarget: Graph,\n\topts: GuardedExecutionOptions,\n): GuardedExecutionGraph {\n\treturn new GuardedExecutionGraph(target, opts);\n}\n\n// Re-export types useful for call sites.\nexport type { DescribeFilter };\n","/**\n * Harness wiring (roadmap §9.0).\n *\n * Reactive collaboration loop: static-topology, flowing data.\n * Composes orchestration (gate), AI (promptNode), reduction (scorer/stratify),\n * and messaging (TopicGraph/bridge) into a 7-stage loop.\n *\n * @module\n */\n\nexport * from \"./bridge.js\";\nexport * from \"./loop.js\";\nexport * from \"./profile.js\";\nexport * from \"./strategy.js\";\nexport * from \"./trace.js\";\nexport * from \"./types.js\";\n","/**\n * Harness bridge factories (roadmap §9.0).\n *\n * Intake bridges, eval source wrapper, before/after comparison,\n * affected-task filter, code-change bridge, and notification effect.\n * All are compositions of existing primitives — no new abstractions.\n *\n * @module\n */\n\nimport type { Node } from \"../../core/node.js\";\nimport { derived, effect, state } from \"../../core/sugar.js\";\nimport { switchMap } from \"../../extra/operators.js\";\nimport { fromAny } from \"../../extra/sources.js\";\nimport type { TopicGraph } from \"../messaging.js\";\n\nimport type { IntakeItem, Severity, TriagedItem } from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Generic intake bridge\n// ---------------------------------------------------------------------------\n\n/** Options for {@link createIntakeBridge}. */\nexport interface IntakeBridgeOptions {\n\t/** Name for the effect node (default \"intake-bridge\"). */\n\tname?: string;\n}\n\n/**\n * Generic source→intake bridge factory.\n *\n * Watches a source node for new values, passes each through a user-supplied\n * `parser` that produces zero or more `IntakeItem`s, and publishes them to\n * the given intake topic.\n *\n * This is the generalized pattern behind {@link evalIntakeBridge}. Use it for\n * CI results, test failures, Slack messages, monitoring alerts, or any domain\n * where structured results should flow into a harness loop.\n *\n * @param source - Reactive node emitting domain-specific data.\n * @param intakeTopic - TopicGraph to publish IntakeItem entries to.\n * @param parser - Converts source data into IntakeItem[]. Return empty array to skip.\n * @param opts - Optional configuration.\n * @returns The effect node (for lifecycle management).\n */\nexport function createIntakeBridge<T>(\n\tsource: Node<T>,\n\tintakeTopic: TopicGraph<IntakeItem>,\n\tparser: (value: T) => IntakeItem[],\n\topts?: IntakeBridgeOptions,\n): Node<unknown> {\n\treturn effect(\n\t\t[source as Node<unknown>],\n\t\t([value]) => {\n\t\t\tif (value == null) return;\n\t\t\tconst items = parser(value as T);\n\t\t\tfor (const item of items) {\n\t\t\t\tintakeTopic.publish(item);\n\t\t\t}\n\t\t},\n\t\t{ name: opts?.name ?? \"intake-bridge\" },\n\t);\n}\n\n// ---------------------------------------------------------------------------\n// Generic eval result shape\n// ---------------------------------------------------------------------------\n\n/**\n * Minimal eval result shape accepted by the bridge.\n *\n * TS eval runner uses `EvalRun` from `evals/lib/types.ts` which is a superset\n * of this shape. The bridge only reads what it needs.\n */\nexport interface EvalResult {\n\trun_id: string;\n\tmodel: string;\n\ttasks: EvalTaskResult[];\n}\n\nexport interface EvalTaskResult {\n\ttask_id: string;\n\tvalid: boolean;\n\tjudge_scores?: EvalJudgeScore[];\n}\n\nexport interface EvalJudgeScore {\n\tclaim: string;\n\tpass: boolean;\n\treasoning: string;\n}\n\n// ---------------------------------------------------------------------------\n// Bridge factory\n// ---------------------------------------------------------------------------\n\nexport interface EvalIntakeBridgeOptions {\n\t/** Name for the effect node (default \"eval-intake-bridge\"). */\n\tname?: string;\n\t/** Minimum severity for eval-sourced items (default \"medium\"). */\n\tdefaultSeverity?: Severity;\n}\n\n/**\n * Create an effect node that watches an eval results source and publishes\n * per-criterion findings to an intake topic.\n *\n * Each failing judge criterion produces a separate IntakeItem — not one\n * item per task. This gives the triage stage granular findings to classify.\n *\n * @param evalSource - Node emitting EvalResult (or EvalResult[]).\n * @param intakeTopic - TopicGraph to publish IntakeItem entries to.\n * @param opts - Optional configuration.\n * @returns The effect node (for lifecycle management).\n */\nexport function evalIntakeBridge(\n\tevalSource: Node<EvalResult | EvalResult[]>,\n\tintakeTopic: TopicGraph<IntakeItem>,\n\topts?: EvalIntakeBridgeOptions,\n): Node<unknown> {\n\tconst defaultSeverity = opts?.defaultSeverity ?? \"medium\";\n\n\treturn effect(\n\t\t[evalSource],\n\t\t([results]) => {\n\t\t\tif (results == null) return;\n\t\t\tconst runs = Array.isArray(results) ? (results as EvalResult[]) : [results as EvalResult];\n\n\t\t\tfor (const run of runs) {\n\t\t\t\tfor (const task of run.tasks) {\n\t\t\t\t\t// Only process tasks with failures\n\t\t\t\t\tif (task.valid && task.judge_scores?.every((s) => s.pass)) continue;\n\n\t\t\t\t\t// Task-level validity failure (no judge scores or overall invalid)\n\t\t\t\t\tif (!task.valid && (!task.judge_scores || task.judge_scores.length === 0)) {\n\t\t\t\t\t\tintakeTopic.publish({\n\t\t\t\t\t\t\tsource: \"eval\",\n\t\t\t\t\t\t\tsummary: `Task ${task.task_id} invalid (model: ${run.model})`,\n\t\t\t\t\t\t\tevidence: `Run ${run.run_id}: task produced invalid output`,\n\t\t\t\t\t\t\taffectsAreas: [\"graphspec\"],\n\t\t\t\t\t\t\taffectsEvalTasks: [task.task_id],\n\t\t\t\t\t\t\tseverity: defaultSeverity,\n\t\t\t\t\t\t});\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// Per-criterion findings\n\t\t\t\t\tif (task.judge_scores) {\n\t\t\t\t\t\tfor (const score of task.judge_scores) {\n\t\t\t\t\t\t\tif (score.pass) continue;\n\t\t\t\t\t\t\tintakeTopic.publish({\n\t\t\t\t\t\t\t\tsource: \"eval\",\n\t\t\t\t\t\t\t\tsummary: `${task.task_id}: ${score.claim} (model: ${run.model})`,\n\t\t\t\t\t\t\t\tevidence: score.reasoning,\n\t\t\t\t\t\t\t\taffectsAreas: [\"graphspec\"],\n\t\t\t\t\t\t\t\taffectsEvalTasks: [task.task_id],\n\t\t\t\t\t\t\t\tseverity: defaultSeverity,\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: opts?.name ?? \"eval-intake-bridge\" },\n\t);\n}\n\n// ---------------------------------------------------------------------------\n// Composition A: Eval-driven improvement loop\n// ---------------------------------------------------------------------------\n\n/**\n * Wrap any eval runner as a reactive producer node.\n *\n * When `trigger` emits, calls `runner()` and emits the result downstream.\n * Uses `switchMap` + `fromAny` — the async boundary stays in the source\n * layer (spec §5.10). A new trigger cancels any in-flight run.\n *\n * ```ts\n * const trigger = state(0);         // bump to trigger a new run\n * const results = evalSource(trigger, () => runEvals(config));\n * results.subscribe(msgs => { ... });\n * trigger.down([[DATA, 1]]);         // fires the runner\n * ```\n *\n * @param trigger - Any node; each new DATA emission fires the runner.\n * @param runner  - Returns an EvalResult (or promise of one).\n */\nexport function evalSource<T extends EvalResult>(\n\ttrigger: Node<unknown>,\n\trunner: () => T | Promise<T>,\n): Node<T> {\n\treturn switchMap(trigger, () => fromAny(runner()) as Node<T>);\n}\n\n// ---------------------------------------------------------------------------\n\n/** Per-task delta produced by {@link beforeAfterCompare}. */\nexport interface EvalTaskDelta {\n\ttaskId: string;\n\tbefore: boolean;\n\tafter: boolean;\n\t/** Score-level diff (after − before), undefined if no scores present. */\n\tscoreDiff?: number;\n}\n\n/** Output of {@link beforeAfterCompare}. */\nexport interface EvalDelta {\n\t/** Task IDs that newly fail in `after` (were passing in `before`). */\n\tnewFailures: string[];\n\t/** Task IDs that now pass in `after` (were failing in `before`). */\n\tresolved: string[];\n\t/** Full per-task breakdown. */\n\ttaskDeltas: EvalTaskDelta[];\n\t/** True when net resolutions > net failures. */\n\toverallImproved: boolean;\n}\n\n/**\n * Derived node that computes before/after eval deltas.\n *\n * Pure computation: no LLM, no async. Compares per-task validity and\n * pass counts between two `EvalResult` snapshots.\n *\n * @param before - Node holding the baseline eval result.\n * @param after  - Node holding the new eval result.\n */\nexport function beforeAfterCompare(\n\tbefore: Node<EvalResult>,\n\tafter: Node<EvalResult>,\n): Node<EvalDelta> {\n\treturn derived<EvalDelta>(\n\t\t[before as Node<unknown>, after as Node<unknown>],\n\t\t([b, a]) => {\n\t\t\tconst bRes = b as EvalResult;\n\t\t\tconst aRes = a as EvalResult;\n\n\t\t\tconst beforeMap = new Map<string, EvalTaskResult>(bRes.tasks.map((t) => [t.task_id, t]));\n\t\t\tconst afterMap = new Map<string, EvalTaskResult>(aRes.tasks.map((t) => [t.task_id, t]));\n\n\t\t\tconst allIds = new Set([...beforeMap.keys(), ...afterMap.keys()]);\n\t\t\tconst taskDeltas: EvalTaskDelta[] = [];\n\t\t\tconst newFailures: string[] = [];\n\t\t\tconst resolved: string[] = [];\n\n\t\t\tfor (const id of allIds) {\n\t\t\t\tconst bt = beforeMap.get(id);\n\t\t\t\tconst at = afterMap.get(id);\n\t\t\t\tconst beforeValid = bt?.valid ?? false;\n\t\t\t\tconst afterValid = at?.valid ?? false;\n\n\t\t\t\tconst beforeScore = bt?.judge_scores\n\t\t\t\t\t? bt.judge_scores.filter((s) => s.pass).length\n\t\t\t\t\t: undefined;\n\t\t\t\tconst afterScore = at?.judge_scores\n\t\t\t\t\t? at.judge_scores.filter((s) => s.pass).length\n\t\t\t\t\t: undefined;\n\t\t\t\tconst scoreDiff =\n\t\t\t\t\tbeforeScore !== undefined && afterScore !== undefined\n\t\t\t\t\t\t? afterScore - beforeScore\n\t\t\t\t\t\t: undefined;\n\n\t\t\t\ttaskDeltas.push({ taskId: id, before: beforeValid, after: afterValid, scoreDiff });\n\t\t\t\tif (beforeValid && !afterValid) newFailures.push(id);\n\t\t\t\tif (!beforeValid && afterValid) resolved.push(id);\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tnewFailures,\n\t\t\t\tresolved,\n\t\t\t\ttaskDeltas,\n\t\t\t\toverallImproved: resolved.length > newFailures.length,\n\t\t\t};\n\t\t},\n\t\t{ name: \"eval-delta\" },\n\t);\n}\n\n// ---------------------------------------------------------------------------\n\n/**\n * Derived node that selects which eval task IDs to re-run.\n *\n * Collects `affectsEvalTasks` from all triaged items, deduplicates, then\n * optionally intersects with `fullTaskSet`. Returns a sorted array of IDs.\n *\n * Use this to avoid re-running the full eval suite after each fix: only the\n * tasks that the triaged items claim to affect are returned.\n *\n * @param issues      - Node holding the current list of triaged items.\n * @param fullTaskSet - Optional node (or plain array) of all known task IDs.\n *                      When provided, output is the intersection.\n */\nexport function affectedTaskFilter(\n\tissues: Node<readonly TriagedItem[]>,\n\tfullTaskSet?: Node<readonly string[]> | readonly string[],\n): Node<string[]> {\n\tconst taskSetNode: Node<unknown> | null =\n\t\tfullTaskSet == null\n\t\t\t? null\n\t\t\t: Array.isArray(fullTaskSet)\n\t\t\t\t? (state(fullTaskSet as readonly string[]) as Node<unknown>)\n\t\t\t\t: (fullTaskSet as Node<unknown>);\n\n\tconst deps: Node<unknown>[] = [issues as Node<unknown>];\n\tif (taskSetNode) deps.push(taskSetNode);\n\n\treturn derived<string[]>(\n\t\tdeps,\n\t\t(values) => {\n\t\t\tconst items = values[0] as readonly TriagedItem[];\n\t\t\tconst all = taskSetNode ? new Set(values[1] as readonly string[]) : null;\n\n\t\t\tconst affected = new Set<string>();\n\t\t\tfor (const item of items) {\n\t\t\t\tfor (const id of item.affectsEvalTasks ?? []) {\n\t\t\t\t\tif (all == null || all.has(id)) affected.add(id);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn [...affected].sort();\n\t\t},\n\t\t{ name: \"affected-task-filter\" },\n\t);\n}\n\n// ---------------------------------------------------------------------------\n// Composition D: Quality gate (CI/CD)\n// ---------------------------------------------------------------------------\n\n/** A single lint error emitted by a CI tool. */\nexport interface LintError {\n\tfile: string;\n\tline: number;\n\tcol: number;\n\trule: string;\n\tmessage: string;\n}\n\n/** A single test failure emitted by a test runner. */\nexport interface TestFailure {\n\ttestId: string;\n\tfile: string;\n\tmessage: string;\n}\n\n/** Structured code-change / CI event. */\nexport interface CodeChange {\n\t/** Files touched by the change. */\n\tfiles: string[];\n\tlintErrors?: LintError[];\n\ttestFailures?: TestFailure[];\n}\n\n/** Options for {@link codeChangeBridge}. */\nexport interface CodeChangeBridgeOptions {\n\t/** Name for the effect node (default \"code-change-bridge\"). */\n\tname?: string;\n\t/** Default severity for generated IntakeItems (default \"high\"). */\n\tdefaultSeverity?: Severity;\n}\n\n/**\n * Intake bridge for code-change / CI events.\n *\n * Watches a source node for `CodeChange` events and publishes one\n * `IntakeItem` per lint error and per test failure to the intake topic.\n * Pass a custom `parser` to override the default mapping.\n *\n * @param source      - Node emitting CodeChange events.\n * @param intakeTopic - TopicGraph to publish IntakeItem entries to.\n * @param parser      - Optional custom parser (overrides default).\n * @param opts        - Optional configuration.\n */\nexport function codeChangeBridge(\n\tsource: Node<CodeChange>,\n\tintakeTopic: TopicGraph<IntakeItem>,\n\tparser?: (change: CodeChange) => IntakeItem[],\n\topts?: CodeChangeBridgeOptions,\n): Node<unknown> {\n\tconst defaultSeverity = opts?.defaultSeverity ?? \"high\";\n\n\tfunction defaultParser(change: CodeChange): IntakeItem[] {\n\t\tconst items: IntakeItem[] = [];\n\t\tfor (const err of change.lintErrors ?? []) {\n\t\t\titems.push({\n\t\t\t\tsource: \"code-change\",\n\t\t\t\tsummary: `Lint: ${err.rule} in ${err.file}:${err.line}`,\n\t\t\t\tevidence: err.message,\n\t\t\t\taffectsAreas: [err.file],\n\t\t\t\tseverity: defaultSeverity,\n\t\t\t});\n\t\t}\n\t\tfor (const fail of change.testFailures ?? []) {\n\t\t\titems.push({\n\t\t\t\tsource: \"test\",\n\t\t\t\tsummary: `Test failure: ${fail.testId}`,\n\t\t\t\tevidence: fail.message,\n\t\t\t\taffectsAreas: [fail.file],\n\t\t\t\taffectsEvalTasks: [fail.testId],\n\t\t\t\tseverity: defaultSeverity,\n\t\t\t});\n\t\t}\n\t\treturn items;\n\t}\n\n\tconst resolve = parser ?? defaultParser;\n\n\treturn effect(\n\t\t[source as Node<unknown>],\n\t\t([change]) => {\n\t\t\tif (change == null) return;\n\t\t\tfor (const item of resolve(change as CodeChange)) {\n\t\t\t\tintakeTopic.publish(item);\n\t\t\t}\n\t\t},\n\t\t{ name: opts?.name ?? \"code-change-bridge\" },\n\t);\n}\n\n// ---------------------------------------------------------------------------\n\n/** Transport function for {@link notifyEffect}. Sync or async. */\nexport type NotifyTransport<T> = (item: T) => void | Promise<void>;\n\n/** Options for {@link notifyEffect}. */\nexport interface NotifyEffectOptions {\n\t/** Name for the effect node (default \"notify-effect\"). */\n\tname?: string;\n}\n\n/**\n * Effect node that sends each new topic entry to an external channel.\n *\n * The `transport` function is called for every item published to `topic`.\n * Async transports are bridged via `fromAny` (spec §5.10 compliant).\n *\n * Typical use: Slack webhook, GitHub PR comment, email notification, etc.\n * The factory provides reactive wiring; the transport supplies domain logic.\n *\n * ```ts\n * notifyEffect(alertQueue, async (item) => {\n *   await fetch(SLACK_WEBHOOK, { method: 'POST', body: JSON.stringify({ text: item.summary }) });\n * });\n * ```\n *\n * @param topic     - TopicGraph whose latest entry triggers the notification.\n * @param transport - Called with each new item. May return a Promise.\n * @param opts      - Optional configuration.\n */\nexport function notifyEffect<T>(\n\ttopic: TopicGraph<T>,\n\ttransport: NotifyTransport<T>,\n\topts?: NotifyEffectOptions,\n): Node<unknown> {\n\treturn effect(\n\t\t[topic.latest as Node<unknown>],\n\t\t([item]) => {\n\t\t\tif (item == null) return;\n\t\t\t// transport is a side effect (webhook, Slack, email). Async transports\n\t\t\t// are fire-and-forget — the Promise result does not feed back into the\n\t\t\t// graph. Suppress unhandled-rejection noise by voiding the return.\n\t\t\tvoid transport(item as T);\n\t\t},\n\t\t{ name: opts?.name ?? \"notify-effect\" },\n\t);\n}\n","/**\n * Harness wiring types (roadmap §9.0).\n *\n * Shared types for the reactive collaboration loop: intake, triage, queue,\n * gate, execute, verify, reflect. These types are intentionally domain-agnostic\n * — the harness loop is not specific to eval workflows.\n *\n * @module\n */\n\n// ---------------------------------------------------------------------------\n// Intake\n// ---------------------------------------------------------------------------\n\n/** Sources that can produce intake items. */\nexport type IntakeSource = \"eval\" | \"test\" | \"human\" | \"code-change\" | \"hypothesis\" | \"parity\";\n\n/** Severity levels for intake items. */\nexport type Severity = \"critical\" | \"high\" | \"medium\" | \"low\";\n\n/** Root cause categories for triage classification. */\nexport type RootCause =\n\t| \"composition\"\n\t| \"missing-fn\"\n\t| \"bad-docs\"\n\t| \"schema-gap\"\n\t| \"regression\"\n\t| \"unknown\";\n\n/** Intervention types that address root causes. */\nexport type Intervention =\n\t| \"template\"\n\t| \"catalog-fn\"\n\t| \"docs\"\n\t| \"wrapper\"\n\t| \"schema-change\"\n\t| \"investigate\";\n\n/** Routing destinations after triage. */\nexport type QueueRoute = \"auto-fix\" | \"needs-decision\" | \"investigation\" | \"backlog\";\n\n/** Ordered queue route names for iteration. */\nexport const QUEUE_NAMES: readonly QueueRoute[] = [\n\t\"auto-fix\",\n\t\"needs-decision\",\n\t\"investigation\",\n\t\"backlog\",\n];\n\n/**\n * An item entering the harness loop via the INTAKE stage.\n *\n * All intake sources produce this uniform shape — the intake topic\n * doesn't care where items came from.\n */\nexport interface IntakeItem {\n\tsource: IntakeSource;\n\tsummary: string;\n\tevidence: string;\n\taffectsAreas: string[];\n\taffectsEvalTasks?: string[];\n\tseverity?: Severity;\n\trelatedTo?: string[];\n\t/** Item-carried reingestion count. Incremented on each full-loop reingestion. */\n\t_reingestions?: number;\n}\n\n// ---------------------------------------------------------------------------\n// Triage output\n// ---------------------------------------------------------------------------\n\n/** Output of the TRIAGE stage — enriched intake item with classification. */\nexport interface TriagedItem extends IntakeItem {\n\trootCause: RootCause;\n\tintervention: Intervention;\n\troute: QueueRoute;\n\tpriority: number;\n\ttriageReasoning?: string;\n\t/** Item-carried retry count. Incremented on each fast-retry pass. */\n\t_retries?: number;\n}\n\n// ---------------------------------------------------------------------------\n// Strategy model\n// ---------------------------------------------------------------------------\n\n/** Effectiveness record for a rootCause→intervention pair. */\nexport interface StrategyEntry {\n\trootCause: RootCause;\n\tintervention: Intervention;\n\tattempts: number;\n\tsuccesses: number;\n\tsuccessRate: number;\n}\n\n/** Key format: `${rootCause}→${intervention}`. */\nexport type StrategyKey = `${RootCause}→${Intervention}`;\n\nexport function strategyKey(rootCause: RootCause, intervention: Intervention): StrategyKey {\n\treturn `${rootCause}→${intervention}`;\n}\n\n// ---------------------------------------------------------------------------\n// Execution & verification\n// ---------------------------------------------------------------------------\n\n/** LLM output shape from the EXECUTE stage (partial — lacks `item`). */\nexport type ExecuteOutput = {\n\toutcome: \"success\" | \"failure\" | \"partial\";\n\tdetail: string;\n};\n\n/** Full execution result assembled downstream (LLM output + context). */\nexport interface ExecutionResult {\n\titem: TriagedItem;\n\toutcome: \"success\" | \"failure\" | \"partial\";\n\tdetail: string;\n}\n\n/** Whether an error is self-correctable (fast-retry) or structural (full loop). */\nexport type ErrorClass = \"self-correctable\" | \"structural\";\n\n/** Classifier for fast-retry path. */\nexport type ErrorClassifier = (result: ExecutionResult) => ErrorClass;\n\n/** Default error classifier: parse/config errors are self-correctable. */\nexport function defaultErrorClassifier(result: ExecutionResult): ErrorClass {\n\tconst d = result.detail.toLowerCase();\n\tif (\n\t\td.includes(\"parse\") ||\n\t\td.includes(\"json\") ||\n\t\td.includes(\"config\") ||\n\t\td.includes(\"validation\") ||\n\t\td.includes(\"syntax\")\n\t) {\n\t\treturn \"self-correctable\";\n\t}\n\treturn \"structural\";\n}\n\n// ---------------------------------------------------------------------------\n// Verification output\n// ---------------------------------------------------------------------------\n\n/** Result of the VERIFY stage. */\nexport interface VerifyResult {\n\titem: TriagedItem;\n\texecution: ExecutionResult;\n\tverified: boolean;\n\tfindings: string[];\n\terrorClass?: ErrorClass;\n}\n\n// ---------------------------------------------------------------------------\n// Priority scoring\n// ---------------------------------------------------------------------------\n\n/** Configurable signals for priority scoring. */\nexport interface PrioritySignals {\n\t/** Per-severity base weight (default: critical=100, high=70, medium=40, low=10). */\n\tseverityWeights?: Partial<Record<Severity, number>>;\n\t/** Decay rate per second for attention decay (default ~1.15e-6 ≈ 7-day half-life). */\n\tdecayRate?: number;\n\t/** Strategy model effectiveness boost threshold (default 0.7). */\n\teffectivenessThreshold?: number;\n\t/** Strategy model effectiveness boost amount (default 15). */\n\teffectivenessBoost?: number;\n}\n\n/** Default severity weights. */\nexport const DEFAULT_SEVERITY_WEIGHTS: Record<Severity, number> = {\n\tcritical: 100,\n\thigh: 70,\n\tmedium: 40,\n\tlow: 10,\n};\n\n/** Default decay rate: ~7-day half-life. */\nexport const DEFAULT_DECAY_RATE = Math.LN2 / (7 * 24 * 3600);\n\n// ---------------------------------------------------------------------------\n// Harness loop configuration\n// ---------------------------------------------------------------------------\n\n/** Per-queue configuration in the harness loop. */\nexport interface QueueConfig {\n\t/** Whether this queue is gated (requires human approval). */\n\tgated: boolean;\n\t/** Maximum pending items in the gate (default Infinity). */\n\tmaxPending?: number;\n\t/** Start the gate in open (auto-approve) mode? */\n\tstartOpen?: boolean;\n}\n\n/** Default queue configurations. */\nexport const DEFAULT_QUEUE_CONFIGS: Record<QueueRoute, QueueConfig> = {\n\t\"auto-fix\": { gated: false },\n\t\"needs-decision\": { gated: true },\n\tinvestigation: { gated: true },\n\tbacklog: { gated: false, startOpen: false },\n};\n\n/** Options for {@link harnessLoop}. */\nexport interface HarnessLoopOptions {\n\t/** LLM adapter for promptNode-based stages (triage, execute, verify, reflect). */\n\tadapter: unknown; // LLMAdapter — kept as unknown to avoid circular dep\n\n\t/** Custom triage prompt (receives IntakeItem + strategy model as context). */\n\ttriagePrompt?: string | ((...args: unknown[]) => string);\n\n\t/** Custom execute prompt. */\n\texecutePrompt?: string | ((...args: unknown[]) => string);\n\n\t/** Custom verify prompt. */\n\tverifyPrompt?: string | ((...args: unknown[]) => string);\n\n\t/** Per-queue configuration overrides. */\n\tqueues?: Partial<Record<QueueRoute, QueueConfig>>;\n\n\t/** Priority scoring signals. */\n\tpriority?: PrioritySignals;\n\n\t/** Error classifier for fast-retry path. */\n\terrorClassifier?: ErrorClassifier;\n\n\t/** Max fast-retries per item before routing to full intake (default 2). */\n\tmaxRetries?: number;\n\n\t/** Global retry cap across all items — circuit breaker (default maxRetries × 10). */\n\tmaxTotalRetries?: number;\n\n\t/** Max re-ingestions from verify→intake before giving up (default 1). */\n\tmaxReingestions?: number;\n\n\t/** Global reingestion cap across all items — circuit breaker (default maxReingestions × 10). */\n\tmaxTotalReingestions?: number;\n\n\t/** Retained limit for topic logs (default 1000). */\n\tretainedLimit?: number;\n}\n","/**\n * Strategy model and priority scoring (roadmap §9.0).\n *\n * Pure-computation derived nodes — no LLM, no async.\n *\n * @module\n */\n\nimport { monotonicNs } from \"../../core/clock.js\";\nimport type { Node } from \"../../core/node.js\";\nimport { derived } from \"../../core/sugar.js\";\nimport { reactiveMap } from \"../../extra/reactive-map.js\";\nimport { decay } from \"../memory.js\";\n\nimport {\n\tDEFAULT_DECAY_RATE,\n\tDEFAULT_SEVERITY_WEIGHTS,\n\ttype Intervention,\n\ttype PrioritySignals,\n\ttype RootCause,\n\ttype StrategyEntry,\n\ttype StrategyKey,\n\tstrategyKey,\n\ttype TriagedItem,\n} from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Strategy model\n// ---------------------------------------------------------------------------\n\n/** Snapshot shape for the strategy model node. */\nexport type StrategySnapshot = ReadonlyMap<StrategyKey, StrategyEntry>;\n\n/** Bundle returned by {@link strategyModel}. */\nexport interface StrategyModelBundle {\n\t/** Reactive node — current strategy map. */\n\treadonly node: Node<StrategySnapshot>;\n\n\t/** Record a completed issue (success or failure). */\n\trecord(rootCause: RootCause, intervention: Intervention, success: boolean): void;\n\n\t/** Look up effectiveness for a specific pair. */\n\tlookup(rootCause: RootCause, intervention: Intervention): StrategyEntry | undefined;\n\n\t/** Tear down internal keepalive subscriptions. */\n\tdispose(): void;\n}\n\n/**\n * Create a strategy model that tracks `rootCause × intervention → successRate`\n * over completed issues. Pure derived computation — no LLM.\n *\n * The model feeds back into TRIAGE for routing hints.\n */\nexport function strategyModel(): StrategyModelBundle {\n\tconst _map = reactiveMap<StrategyKey, StrategyEntry>({ name: \"strategy-entries\" });\n\n\t// Derived node that projects the reactive map into a plain Map snapshot.\n\tconst snapshot = derived<StrategySnapshot>(\n\t\t[_map.entries],\n\t\t([mapSnap]) => {\n\t\t\tconst raw = mapSnap as ReadonlyMap<StrategyKey, StrategyEntry>;\n\t\t\t// Return a fresh frozen copy so consumers see a stable reference.\n\t\t\treturn new Map(raw);\n\t\t},\n\t\t{\n\t\t\tname: \"strategy-model\",\n\t\t\tequals: (a, b) => {\n\t\t\t\tconst am = a as StrategySnapshot;\n\t\t\t\tconst bm = b as StrategySnapshot;\n\t\t\t\tif (am.size !== bm.size) return false;\n\t\t\t\tfor (const [k, v] of am) {\n\t\t\t\t\tconst bv = bm.get(k);\n\t\t\t\t\tif (!bv || v.attempts !== bv.attempts || v.successes !== bv.successes) return false;\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t},\n\t\t},\n\t);\n\n\tfunction record(rootCause: RootCause, intervention: Intervention, success: boolean): void {\n\t\tconst key = strategyKey(rootCause, intervention);\n\t\tconst existing = _map.get(key);\n\t\tconst attempts = (existing?.attempts ?? 0) + 1;\n\t\tconst successes = (existing?.successes ?? 0) + (success ? 1 : 0);\n\t\t_map.set(key, {\n\t\t\trootCause,\n\t\t\tintervention,\n\t\t\tattempts,\n\t\t\tsuccesses,\n\t\t\tsuccessRate: successes / attempts,\n\t\t});\n\t}\n\n\tfunction lookup(rootCause: RootCause, intervention: Intervention): StrategyEntry | undefined {\n\t\treturn _map.get(strategyKey(rootCause, intervention));\n\t}\n\n\t// Keep the derived alive so get() works without an external subscriber.\n\tconst _unsub = snapshot.subscribe(() => {});\n\n\tfunction dispose(): void {\n\t\t_unsub();\n\t}\n\n\treturn { node: snapshot, record, lookup, dispose };\n}\n\n// ---------------------------------------------------------------------------\n// Priority scoring\n// ---------------------------------------------------------------------------\n\n/**\n * Create a priority scoring derived node for a single triaged item.\n *\n * Combines severity weight, attention decay, strategy model effectiveness,\n * and an optional external urgency signal.\n *\n * @param item - Node holding the triaged item.\n * @param strategy - Strategy model node.\n * @param lastInteractionNs - Node holding the monotonic timestamp (ns) of last human interaction.\n * @param urgency - Optional external urgency signal node (0–1 scale).\n * @param signals - Configurable scoring parameters.\n */\nexport function priorityScore(\n\titem: Node<TriagedItem>,\n\tstrategy: Node<StrategySnapshot>,\n\tlastInteractionNs: Node<number>,\n\turgency?: Node<number>,\n\tsignals?: PrioritySignals,\n): Node<number> {\n\tconst severityWeights = { ...DEFAULT_SEVERITY_WEIGHTS, ...signals?.severityWeights };\n\tconst decayRate = signals?.decayRate ?? DEFAULT_DECAY_RATE;\n\tconst effectivenessThreshold = signals?.effectivenessThreshold ?? 0.7;\n\tconst effectivenessBoost = signals?.effectivenessBoost ?? 15;\n\n\tconst deps: Node<unknown>[] = [item, strategy, lastInteractionNs];\n\tif (urgency) deps.push(urgency);\n\n\treturn derived<number>(\n\t\tdeps,\n\t\t(values) => {\n\t\t\tconst itm = values[0] as TriagedItem;\n\t\t\tconst strat = values[1] as StrategySnapshot;\n\t\t\tconst lastNs = values[2] as number;\n\t\t\tconst urg = urgency ? (values[3] as number) : 0;\n\n\t\t\t// Base score from severity\n\t\t\tconst baseWeight = severityWeights[itm.severity ?? \"medium\"];\n\t\t\tconst ageSeconds = (monotonicNs() - lastNs) / 1e9;\n\t\t\tlet score = decay(baseWeight, ageSeconds, decayRate, 0);\n\n\t\t\t// Strategy model boost\n\t\t\tconst key = strategyKey(itm.rootCause, itm.intervention);\n\t\t\tconst entry = strat.get(key);\n\t\t\tif (entry && entry.successRate >= effectivenessThreshold) {\n\t\t\t\tscore += effectivenessBoost;\n\t\t\t}\n\n\t\t\t// External urgency boost (0–1 scale → 0–20 points)\n\t\t\tscore += urg * 20;\n\n\t\t\treturn score;\n\t\t},\n\t\t{ name: \"priority-score\" },\n\t);\n}\n","/**\n * harnessLoop() factory (roadmap §9.0).\n *\n * Wires the static 7-stage topology: INTAKE → TRIAGE → QUEUE → GATE →\n * EXECUTE → VERIFY → REFLECT. Static topology, flowing data — the Kafka\n * insight applied to human+LLM collaboration.\n *\n * @module\n */\n\nimport type { Node } from \"../../core/node.js\";\nimport { node } from \"../../core/node.js\";\nimport { effect, state } from \"../../core/sugar.js\";\nimport { merge, withLatestFrom } from \"../../extra/operators.js\";\nimport { Graph } from \"../../graph/graph.js\";\nimport { trackingKey, tryIncrementBounded } from \"../_internal.js\";\nimport type { LLMAdapter } from \"../ai.js\";\nimport { promptNode } from \"../ai.js\";\nimport { TopicGraph } from \"../messaging.js\";\nimport { type GateController, gate } from \"../orchestration.js\";\nimport { type StrategyModelBundle, type StrategySnapshot, strategyModel } from \"./strategy.js\";\nimport {\n\tDEFAULT_QUEUE_CONFIGS,\n\tdefaultErrorClassifier,\n\ttype ErrorClass,\n\ttype ErrorClassifier,\n\ttype ExecuteOutput,\n\ttype ExecutionResult,\n\ttype HarnessLoopOptions,\n\ttype IntakeItem,\n\tQUEUE_NAMES,\n\ttype QueueConfig,\n\ttype QueueRoute,\n\ttype TriagedItem,\n\ttype VerifyResult,\n} from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Default prompts\n// ---------------------------------------------------------------------------\n\nconst DEFAULT_TRIAGE_PROMPT = `You are a triage classifier for a reactive collaboration harness.\n\nGiven an intake item, classify it and output JSON:\n{\n  \"rootCause\": \"composition\" | \"missing-fn\" | \"bad-docs\" | \"schema-gap\" | \"regression\" | \"unknown\",\n  \"intervention\": \"template\" | \"catalog-fn\" | \"docs\" | \"wrapper\" | \"schema-change\" | \"investigate\",\n  \"route\": \"auto-fix\" | \"needs-decision\" | \"investigation\" | \"backlog\",\n  \"priority\": <number 0-100>,\n  \"triageReasoning\": \"<one sentence>\"\n}\n\nStrategy model (past effectiveness):\n{{strategy}}\n\nIntake item:\n{{item}}`;\n\nconst DEFAULT_EXECUTE_PROMPT = `You are an implementation agent.\n\nGiven a triaged issue with root cause and intervention type, produce a fix.\n\nIssue:\n{{item}}\n\nOutput JSON:\n{\n  \"outcome\": \"success\" | \"failure\" | \"partial\",\n  \"detail\": \"<description of what was done or what failed>\"\n}`;\n\nconst DEFAULT_VERIFY_PROMPT = `You are a QA reviewer.\n\nGiven an execution result, verify whether the fix is correct.\n\nExecution:\n{{execution}}\n\nOriginal issue:\n{{item}}\n\nOutput JSON:\n{\n  \"verified\": true/false,\n  \"findings\": [\"<finding1>\", ...],\n  \"errorClass\": \"self-correctable\" | \"structural\"  // only if verified=false\n}`;\n\n// ---------------------------------------------------------------------------\n// HarnessGraph\n// ---------------------------------------------------------------------------\n\n/** The graph returned by {@link harnessLoop}. */\nexport class HarnessGraph extends Graph {\n\t/** Intake topic — publish items here to enter the loop. */\n\treadonly intake: TopicGraph<IntakeItem>;\n\n\t/** Per-route queue topics. */\n\treadonly queues: ReadonlyMap<QueueRoute, TopicGraph<TriagedItem>>;\n\n\t/** Per-route gate controllers (only for gated queues). */\n\treadonly gates: ReadonlyMap<QueueRoute, GateController<TriagedItem>>;\n\n\t/** Strategy model bundle — record outcomes, lookup effectiveness. */\n\treadonly strategy: StrategyModelBundle;\n\n\t/** Verify results topic — subscribe to see verification outcomes. */\n\treadonly verifyResults: TopicGraph<VerifyResult>;\n\n\t/** Global retry count across all items (circuit breaker). Reactive — subscribable. */\n\treadonly totalRetries: Node<number>;\n\n\t/** Global reingestion count across all items (circuit breaker). Reactive — subscribable. */\n\treadonly totalReingestions: Node<number>;\n\n\tconstructor(\n\t\tname: string,\n\t\tintake: TopicGraph<IntakeItem>,\n\t\tqueues: Map<QueueRoute, TopicGraph<TriagedItem>>,\n\t\tgates: Map<QueueRoute, GateController<TriagedItem>>,\n\t\tstrategy: StrategyModelBundle,\n\t\tverifyResults: TopicGraph<VerifyResult>,\n\t\ttotalRetries: Node<number>,\n\t\ttotalReingestions: Node<number>,\n\t) {\n\t\tsuper(name);\n\t\tthis.intake = intake;\n\t\tthis.queues = queues;\n\t\tthis.gates = gates;\n\t\tthis.strategy = strategy;\n\t\tthis.verifyResults = verifyResults;\n\t\tthis.totalRetries = totalRetries;\n\t\tthis.totalReingestions = totalReingestions;\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// harnessLoop factory\n// ---------------------------------------------------------------------------\n\n/**\n * Wire the reactive collaboration loop as a static-topology graph.\n *\n * The loop has 7 stages:\n * 1. **INTAKE** — items arrive from multiple sources via `intake.publish()`\n * 2. **TRIAGE** — promptNode classifies, routes, and prioritizes\n * 3. **QUEUE** — 4 priority-ordered TopicGraphs (auto-fix, needs-decision, investigation, backlog)\n * 4. **GATE** — human approval on configurable queues\n * 5. **EXECUTE** — promptNode or human implements the fix\n * 6. **VERIFY** — promptNode reviews + optional fast-retry\n * 7. **REFLECT** — strategy model records outcomes\n *\n * @param name - Graph name.\n * @param opts - Configuration.\n * @returns HarnessGraph with controller accessors.\n */\nexport function harnessLoop(name: string, opts: HarnessLoopOptions): HarnessGraph {\n\tconst adapter = opts.adapter as LLMAdapter;\n\tconst maxRetries = opts.maxRetries ?? 2;\n\tconst retainedLimit = opts.retainedLimit ?? 1000;\n\tconst errorClassifier: ErrorClassifier = opts.errorClassifier ?? defaultErrorClassifier;\n\n\t// Merge queue configs with defaults\n\tconst queueConfigs = new Map<QueueRoute, QueueConfig>();\n\tfor (const route of QUEUE_NAMES) {\n\t\tqueueConfigs.set(route, {\n\t\t\t...DEFAULT_QUEUE_CONFIGS[route],\n\t\t\t...opts.queues?.[route],\n\t\t});\n\t}\n\n\t// --- Stage 1: INTAKE ---\n\tconst intake = new TopicGraph<IntakeItem>(\"intake\", { retainedLimit });\n\n\t// --- Strategy model (used by triage + reflect) ---\n\tconst strategy = strategyModel();\n\n\t// --- Stage 2: TRIAGE ---\n\t// Strategy context uses withLatestFrom: intake.latest is the reactive trigger,\n\t// strategy.node is sampled without being a trigger. This breaks the feedback\n\t// cycle (verify → strategy.record() → strategy.node) reactively — strategy\n\t// changes don't re-fire triage, only new intake items do.\n\tconst triageInput = withLatestFrom(\n\t\tintake.latest as Node<unknown>,\n\t\tstrategy.node as Node<unknown>,\n\t);\n\n\tconst triageNode = promptNode<TriagedItem>(\n\t\tadapter,\n\t\t[triageInput as Node<unknown>],\n\t\topts.triagePrompt ??\n\t\t\t((pair: unknown) => {\n\t\t\t\tconst [item, strat] = pair as [unknown, StrategySnapshot];\n\t\t\t\t// Empty text → promptNode's SENTINEL gate skips the LLM call.\n\t\t\t\tif (!item) return \"\";\n\t\t\t\treturn DEFAULT_TRIAGE_PROMPT.replace(\n\t\t\t\t\t\"{{strategy}}\",\n\t\t\t\t\tJSON.stringify(Array.from(strat.entries())),\n\t\t\t\t).replace(\"{{item}}\", JSON.stringify(item));\n\t\t\t}),\n\t\t{\n\t\t\tname: \"triage\",\n\t\t\tformat: \"json\",\n\t\t\tretries: 1,\n\t\t},\n\t);\n\n\t// --- Stage 3: QUEUE ---\n\tconst queueTopics = new Map<QueueRoute, TopicGraph<TriagedItem>>();\n\tfor (const route of QUEUE_NAMES) {\n\t\tqueueTopics.set(route, new TopicGraph<TriagedItem>(`queue/${route}`, { retainedLimit }));\n\t}\n\n\t// Router: merge intake fields into triage classification before routing to queue.\n\t// The LLM only returns {rootCause, intervention, route, priority} — the router\n\t// pairs it with the original intake item (summary, evidence, etc.).\n\t// Sample triageInput (not intake.latest) — triageInput holds the [item, strategy]\n\t// pair that *triggered* this specific triage, so we get the correct item even if\n\t// a newer intake item has arrived since. triageNode triggers; triageInput sampled.\n\tconst routerInput = withLatestFrom(triageNode as Node<unknown>, triageInput as Node<unknown>);\n\tconst router = effect([routerInput as Node<unknown>], ([pair]) => {\n\t\tif (pair == null) return;\n\t\tconst [classification, triagePair] = pair as [\n\t\t\tTriagedItem | null,\n\t\t\t[IntakeItem | null, StrategySnapshot] | null,\n\t\t];\n\t\tif (!classification || !classification.route) return;\n\t\tconst intakeItem = triagePair?.[0];\n\t\tconst merged: TriagedItem = { ...intakeItem, ...classification };\n\t\tconst topic = queueTopics.get(merged.route);\n\t\tif (topic) topic.publish(merged);\n\t});\n\tconst routerUnsub = router.subscribe(() => {});\n\n\t// --- Stage 4: GATE ---\n\t// Create a container graph for gates (gate() requires a Graph to register nodes in)\n\tconst gateGraph = new Graph(\"gates\");\n\tconst gateControllers = new Map<QueueRoute, GateController<TriagedItem>>();\n\n\tfor (const route of QUEUE_NAMES) {\n\t\tconst config = queueConfigs.get(route)!;\n\t\tconst topic = queueTopics.get(route)!;\n\n\t\tif (config.gated) {\n\t\t\t// Register the topic's latest node in the gate graph so gate() can resolve it\n\t\t\tgateGraph.add(`${route}/source`, topic.latest as Node<unknown>);\n\t\t\tconst ctrl = gate<TriagedItem>(gateGraph, `${route}/gate`, `${route}/source`, {\n\t\t\t\tmaxPending: config.maxPending,\n\t\t\t\tstartOpen: config.startOpen,\n\t\t\t});\n\t\t\tgateControllers.set(route, ctrl);\n\t\t}\n\t}\n\n\t// --- Stage 5: EXECUTE ---\n\t// Merge all gate outputs + ungated queue latests + retry feedback into a\n\t// single execute input using the merge() operator (no imperative .down()).\n\tconst retryTopic = new TopicGraph<TriagedItem>(\"retry-input\", { retainedLimit });\n\n\tconst queueOutputs: Node<TriagedItem | null>[] = [];\n\tfor (const route of QUEUE_NAMES) {\n\t\tconst config = queueConfigs.get(route)!;\n\t\tif (config.gated && gateControllers.has(route)) {\n\t\t\tqueueOutputs.push(gateControllers.get(route)!.node as Node<TriagedItem | null>);\n\t\t} else {\n\t\t\tqueueOutputs.push(queueTopics.get(route)!.latest as Node<TriagedItem | null>);\n\t\t}\n\t}\n\tqueueOutputs.push(retryTopic.latest as Node<TriagedItem | null>);\n\n\tconst executeInput = merge<TriagedItem | null>(...queueOutputs);\n\n\tconst executeNode = promptNode<ExecuteOutput>(\n\t\tadapter,\n\t\t[executeInput as Node<unknown>],\n\t\topts.executePrompt ??\n\t\t\t((item: unknown) => DEFAULT_EXECUTE_PROMPT.replace(\"{{item}}\", JSON.stringify(item))),\n\t\t{\n\t\t\tname: \"execute\",\n\t\t\tformat: \"json\",\n\t\t\tretries: 1,\n\t\t},\n\t);\n\n\t// --- Execute context: [execOutput, item] captured once per execute-wave ---\n\t//\n\t// executeInput feeds into executeNode (dep) AND later into verifyNode (dep).\n\t// Without this node, verifyNode would fire twice per wave in the retry path:\n\t// once when executeNode settles (with stale item from prevData), and once when\n\t// executeInput delivers the retry item directly. The second fire would pair the\n\t// correct item with a verify output that was computed using the wrong item.\n\t//\n\t// withLatestFrom(executeNode, executeInput) fires exactly once per execute-wave:\n\t// executeInput notifies executeNode first (depth-first), executeNode runs fn and\n\t// settles in executeContextNode.dep[0], then executeInput settles in dep[1].\n\t// dirtyDepCount reaches 0 only after both settle → fn runs once with correct data.\n\tconst executeContextNode = withLatestFrom(\n\t\texecuteNode as Node<unknown>,\n\t\texecuteInput as Node<unknown>,\n\t);\n\n\t// --- Stage 6: VERIFY ---\n\tconst verifyResults = new TopicGraph<VerifyResult>(\"verify-results\", { retainedLimit });\n\n\t// The LLM returns only {verified, findings, errorClass?}. We type the promptNode\n\t// output as the partial shape and assemble the full VerifyResult downstream.\n\ttype VerifyOutput = { verified: boolean; findings: string[]; errorClass?: ErrorClass };\n\n\t// verifyNode depends on executeContextNode ([execOutput, item]) — single dep.\n\t// This ensures verifyNode fires once per execute-wave with the correct item.\n\tconst verifyNode = promptNode<VerifyOutput>(\n\t\tadapter,\n\t\t[executeContextNode as Node<unknown>],\n\t\topts.verifyPrompt ??\n\t\t\t((ctxPair: unknown) => {\n\t\t\t\tconst [execution, item] = ctxPair as [ExecuteOutput | null, unknown];\n\t\t\t\treturn DEFAULT_VERIFY_PROMPT.replace(\"{{execution}}\", JSON.stringify(execution)).replace(\n\t\t\t\t\t\"{{item}}\",\n\t\t\t\t\tJSON.stringify(item),\n\t\t\t\t);\n\t\t\t}),\n\t\t{\n\t\t\tname: \"verify\",\n\t\t\tformat: \"json\",\n\t\t\tretries: 1,\n\t\t},\n\t);\n\n\t// --- Fast-retry path ---\n\t// verifyContext = withLatestFrom(verifyNode, executeContextNode):\n\t//   [verifyOutput, [execOutput, item]]\n\t// Fires once when verifyNode settles; executeContextNode is sampled as secondary.\n\tconst verifyContext = withLatestFrom(\n\t\tverifyNode as Node<unknown>,\n\t\texecuteContextNode as Node<unknown>,\n\t);\n\n\tconst maxReingestions = opts.maxReingestions ?? 1;\n\tconst maxTotalRetries = Math.min(opts.maxTotalRetries ?? maxRetries * 10, 100);\n\tconst maxTotalReingestions = Math.min(opts.maxTotalReingestions ?? maxReingestions * 10, 100);\n\tconst totalRetries = state(0);\n\tconst totalReingestions = state(0);\n\n\t// Uses shared `tryIncrementBounded` (patterns/_internal.ts) — documented\n\t// P3 exception for self-owned counters read+written from a single call\n\t// site (`fastRetry` effect below).\n\n\t// Use raw node() so we can check batchData[0] directly — effect() falls back\n\t// to ctx.prevData[0] when verifyContext emits RESOLVED (secondary-only wave),\n\t// which would re-fire with stale context and create phantom retries.\n\tconst fastRetry = node([verifyContext as Node<unknown>], (batchData, _actions) => {\n\t\tconst batch = batchData[0];\n\t\tif (batch == null || batch.length === 0) return; // RESOLVED or not involved — skip\n\t\tconst ctxVal = batch[batch.length - 1];\n\t\tif (ctxVal == null) return;\n\t\t// verifyContext shape: [verifyOutput, [execOutput, item]]\n\t\tconst [vo, execCtx] = ctxVal as [\n\t\t\tVerifyOutput | null,\n\t\t\t[ExecuteOutput | null, TriagedItem | null] | null,\n\t\t];\n\t\tconst [execRaw, item] = execCtx ?? [null, null];\n\t\tif (!vo || !item) return;\n\n\t\t// Assemble full ExecutionResult + VerifyResult from LLM outputs + context\n\t\tconst exec: ExecutionResult = {\n\t\t\titem,\n\t\t\toutcome: execRaw?.outcome ?? \"failure\",\n\t\t\tdetail: execRaw?.detail ?? \"unknown\",\n\t\t};\n\t\tconst vr: VerifyResult = {\n\t\t\titem,\n\t\t\texecution: exec,\n\t\t\tverified: vo.verified,\n\t\t\tfindings: vo.findings ?? [],\n\t\t\terrorClass: vo.errorClass,\n\t\t};\n\n\t\tif (vr.verified) {\n\t\t\tstrategy.record(item.rootCause, item.intervention, true);\n\t\t\tverifyResults.publish(vr);\n\t\t\treturn;\n\t\t}\n\n\t\t// Failed verification\n\t\tconst errClass =\n\t\t\tvr.errorClass ??\n\t\t\terrorClassifier({\n\t\t\t\titem,\n\t\t\t\toutcome: \"failure\",\n\t\t\t\tdetail: vr.findings.join(\"; \"),\n\t\t\t});\n\n\t\tconst itemRetries = item._retries ?? 0;\n\n\t\tif (\n\t\t\terrClass === \"self-correctable\" &&\n\t\t\titemRetries < maxRetries &&\n\t\t\ttryIncrementBounded(totalRetries, maxTotalRetries)\n\t\t) {\n\t\t\tconst key = trackingKey(item);\n\t\t\tconst retryItem: TriagedItem = {\n\t\t\t\t...item,\n\t\t\t\t_retries: itemRetries + 1,\n\t\t\t\tsummary: `[RETRY ${itemRetries + 1}/${maxRetries}] ${key} — Previous attempt failed: ${vr.findings.join(\"; \")}`,\n\t\t\t\trelatedTo: [key],\n\t\t\t};\n\t\t\tretryTopic.publish(retryItem);\n\t\t} else {\n\t\t\t// Structural failure or max retries exceeded → full loop via INTAKE\n\t\t\tstrategy.record(item.rootCause, item.intervention, false);\n\t\t\tverifyResults.publish(vr);\n\n\t\t\tconst key = trackingKey(item);\n\t\t\tconst itemReingestions = item._reingestions ?? 0;\n\t\t\tif (\n\t\t\t\titemReingestions < maxReingestions &&\n\t\t\t\ttryIncrementBounded(totalReingestions, maxTotalReingestions)\n\t\t\t) {\n\t\t\t\tintake.publish({\n\t\t\t\t\tsource: \"eval\",\n\t\t\t\t\tsummary: `Verification failed for: ${key}`,\n\t\t\t\t\tevidence: vr.findings.join(\"\\n\"),\n\t\t\t\t\taffectsAreas: item.affectsAreas,\n\t\t\t\t\taffectsEvalTasks: item.affectsEvalTasks,\n\t\t\t\t\tseverity: \"high\",\n\t\t\t\t\trelatedTo: [key],\n\t\t\t\t\t_reingestions: itemReingestions + 1,\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t});\n\n\tconst fastRetryUnsub = fastRetry.subscribe(() => {}); // keepalive (COMPOSITION-GUIDE §1)\n\n\t// --- Stage 7: REFLECT ---\n\t// Strategy model is already updated in the fast-retry/verify effect above.\n\t// Hypothesis generation and memory distillation are pluggable extensions\n\t// wired externally via verifyResults topic subscription — not hardcoded here.\n\n\t// --- Assemble HarnessGraph ---\n\tconst harness = new HarnessGraph(\n\t\tname,\n\t\tintake,\n\t\tqueueTopics,\n\t\tgateControllers,\n\t\tstrategy,\n\t\tverifyResults,\n\t\ttotalRetries,\n\t\ttotalReingestions,\n\t);\n\n\t// Register disposers for unregistered internal nodes (D1/D2 fix)\n\tharness.addDisposer(routerUnsub);\n\tharness.addDisposer(fastRetryUnsub);\n\tharness.addDisposer(strategy.dispose);\n\n\t// Register stage nodes for introspection (harnessTrace, describe, observe)\n\tharness.add(\"triage\", triageNode as Node<unknown>);\n\tharness.add(\"execute\", executeNode as Node<unknown>);\n\tharness.add(\"verify\", verifyNode as Node<unknown>);\n\tharness.add(\"strategy\", strategy.node as Node<unknown>);\n\n\t// Mount subgraphs\n\tharness.mount(\"intake\", intake);\n\tfor (const [route, topic] of queueTopics) {\n\t\tharness.mount(`queue/${route}`, topic);\n\t}\n\tharness.mount(\"gates\", gateGraph);\n\tharness.mount(\"retry-input\", retryTopic);\n\tharness.mount(\"verify-results\", verifyResults);\n\n\treturn harness;\n}\n","/**\n * Harness-specific graph profiling (roadmap §9.0).\n *\n * Extends {@link graphProfile} with harness domain counters:\n * queue depths, strategy entries, retry/reingestion tracker sizes.\n *\n * @module\n */\n\nimport {\n\ttype GraphProfileOptions,\n\ttype GraphProfileResult,\n\tgraphProfile,\n} from \"../../graph/profile.js\";\nimport type { HarnessGraph } from \"./loop.js\";\nimport type { QueueRoute } from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/** Harness-specific profile extending the base graph profile. */\nexport interface HarnessProfileResult extends GraphProfileResult {\n\t/** Per-queue retained item counts. */\n\tqueueDepths: Record<QueueRoute, number>;\n\t/** Number of rootCause→intervention entries in the strategy model. */\n\tstrategyEntries: number;\n\t/** Global retry count across all items. */\n\ttotalRetries: number;\n\t/** Global reingestion count across all items. */\n\ttotalReingestions: number;\n}\n\n// ---------------------------------------------------------------------------\n// Implementation\n// ---------------------------------------------------------------------------\n\n/**\n * Profile a harness graph with domain-specific counters.\n *\n * @param harness - The HarnessGraph to profile.\n * @param opts - Optional base profile options.\n * @returns Harness profile with queue depths, strategy stats, and tracker sizes.\n */\nexport function harnessProfile(\n\tharness: HarnessGraph,\n\topts?: GraphProfileOptions,\n): HarnessProfileResult {\n\tconst base = graphProfile(harness, opts);\n\n\tconst queueDepths: Record<string, number> = {};\n\tfor (const [route, topic] of harness.queues) {\n\t\tqueueDepths[route] = topic.retained().length;\n\t}\n\n\treturn {\n\t\t...base,\n\t\tqueueDepths: queueDepths as Record<QueueRoute, number>,\n\t\tstrategyEntries: harness.strategy.node.cache?.size ?? 0,\n\t\ttotalRetries: harness.totalRetries.cache ?? 0,\n\t\ttotalReingestions: harness.totalReingestions.cache ?? 0,\n\t};\n}\n","/**\n * Harness pipeline trace (roadmap §9.0 — Inspection Tool Consolidation).\n *\n * Attaches reactive observers (via `observe()`) to all harness stages.\n * One call gives full pipeline visibility with stage labels and elapsed\n * timestamps relative to the `harnessTrace()` invocation time.\n *\n * Supports two output modes:\n * - **String logger** (default): rendered lines to `console.log` or a custom sink.\n * - **Structured events**: programmatic `TraceEvent[]` list for test assertions\n *   and tooling. Access via `handle.events`.\n *\n * Supports configurable detail levels (`\"summary\"`, `\"standard\"`, `\"full\"`)\n * to control output verbosity without composing different tool calls.\n *\n * @module\n */\n\nimport { monotonicNs } from \"../../core/clock.js\";\nimport type { ObserveResult } from \"../../graph/graph.js\";\nimport type { HarnessGraph } from \"./loop.js\";\nimport { QUEUE_NAMES } from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/** Event type captured by structured trace. */\nexport type TraceEventType = \"data\" | \"error\" | \"complete\";\n\n/** A single structured trace event. */\nexport interface TraceEvent {\n\t/** Elapsed seconds since trace was created. */\n\telapsed: number;\n\t/** Pipeline stage label (INTAKE, TRIAGE, QUEUE, GATE, EXECUTE, VERIFY, STRATEGY). */\n\tstage: string;\n\t/** Event type. */\n\ttype: TraceEventType;\n\t/** Data payload (present for \"data\" and \"error\" events). Omitted at \"summary\" detail. */\n\tdata?: unknown;\n\t/** Human-readable summary of the data. Present at \"standard\" and \"full\" detail. */\n\tsummary?: string;\n}\n\n/** Detail level for trace output. */\nexport type TraceDetail =\n\t/** Stage + elapsed only. No data preview. Lowest overhead. */\n\t| \"summary\"\n\t/** Stage + elapsed + truncated data preview. Default. */\n\t| \"standard\"\n\t/** Stage + elapsed + full raw data. Use for debugging, not production. */\n\t| \"full\";\n\n/** Handle returned by {@link harnessTrace}. Call `dispose()` to stop tracing. */\nexport interface HarnessTraceHandle {\n\t/** Stop tracing and detach all observers. Safe to call multiple times. */\n\tdispose(): void;\n\t/**\n\t * Structured trace events collected since creation. Plain array — no\n\t * subscription needed (COMPOSITION-GUIDE §1: avoid lazy-activation\n\t * friction for inspection tools). Populated reactively via observe().\n\t */\n\treadonly events: readonly TraceEvent[];\n}\n\n/** Options for {@link harnessTrace}. */\nexport interface HarnessTraceOptions {\n\t/** Sink for rendered trace lines. Default: `console.log`. */\n\tlogger?: (line: string) => void;\n\t/** Detail level for both string and structured output. Default: `\"summary\"`. */\n\tdetail?: TraceDetail;\n}\n\n// ---------------------------------------------------------------------------\n// Stage labels\n// ---------------------------------------------------------------------------\n\n/** Observe paths → stage labels for the 7 harness stages. */\nconst STAGE_LABELS: Record<string, string> = {\n\t\"intake::latest\": \"INTAKE\",\n\ttriage: \"TRIAGE\",\n\texecute: \"EXECUTE\",\n\t\"verify-results::latest\": \"VERIFY\",\n\tstrategy: \"STRATEGY\",\n};\n\nfor (const route of QUEUE_NAMES) {\n\tSTAGE_LABELS[`queue/${route}::latest`] = \"QUEUE\";\n}\n\n// ---------------------------------------------------------------------------\n// Implementation\n// ---------------------------------------------------------------------------\n\n/**\n * Attach reactive trace observers to all harness pipeline stages.\n *\n * Wires `graph.observe(path, { format: \"json\" })` to each stage node,\n * intercepting the logger callback to emit stage-labeled lines with\n * elapsed timestamps. Surfaces DATA, ERROR, and COMPLETE events.\n *\n * **Structured events:** Every trace event is also pushed to\n * `handle.events` — a plain array (not a reactive node) that tests and\n * tooling can inspect programmatically. To use structured events alone\n * without string output, pass `{ logger: null }`.\n *\n * **Detail levels:**\n * - `\"summary\"` — stage + elapsed only. Minimal overhead.\n * - `\"standard\"` (default) — stage + elapsed + truncated data preview.\n * - `\"full\"` — stage + elapsed + full raw data object in events.\n *\n * Elapsed timestamps are relative to the `harnessTrace()` invocation time,\n * not the first event.\n *\n * @param harness - The HarnessGraph to trace.\n * @param opts - Optional configuration.\n * @returns Handle with `dispose()` to stop tracing and `events` for structured access.\n */\nexport function harnessTrace(\n\tharness: HarnessGraph,\n\topts?: HarnessTraceOptions,\n): HarnessTraceHandle {\n\tconst logger = opts?.logger ?? console.log;\n\tconst detail: TraceDetail = opts?.detail ?? \"summary\";\n\tconst startNs = monotonicNs();\n\tconst observations: ObserveResult[] = [];\n\tconst events: TraceEvent[] = [];\n\n\tfunction elapsedSecs(): number {\n\t\treturn (monotonicNs() - startNs) / 1e9;\n\t}\n\n\tfunction elapsedStr(): string {\n\t\treturn elapsedSecs().toFixed(3);\n\t}\n\n\tfunction recordEvent(stage: string, type: TraceEventType, rawData: unknown): void {\n\t\tconst e = elapsedSecs();\n\t\tconst ev: TraceEvent = { elapsed: e, stage, type };\n\n\t\tif (detail !== \"summary\") {\n\t\t\tev.summary = summarize(rawData);\n\t\t}\n\t\tif (detail === \"full\") {\n\t\t\tev.data = rawData;\n\t\t}\n\n\t\tevents.push(ev);\n\t}\n\n\tfunction wireStage(path: string, stage: string): void {\n\t\ttry {\n\t\t\tconst obs = harness.observe(path, {\n\t\t\t\tformat: \"json\",\n\t\t\t\tlogger: (_line, event) => {\n\t\t\t\t\tif (event.type === \"data\") {\n\t\t\t\t\t\trecordEvent(stage, \"data\", event.data);\n\t\t\t\t\t\tif (logger) {\n\t\t\t\t\t\t\tif (detail === \"summary\") {\n\t\t\t\t\t\t\t\tlogger(`[${elapsedStr()}s] ${stage.padEnd(9)} ←`);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tconst dataStr = event.data !== undefined ? ` ${summarize(event.data)}` : \"\";\n\t\t\t\t\t\t\t\tlogger(`[${elapsedStr()}s] ${stage.padEnd(9)} ←${dataStr}`);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (event.type === \"error\") {\n\t\t\t\t\t\trecordEvent(stage, \"error\", event.data);\n\t\t\t\t\t\tif (logger) {\n\t\t\t\t\t\t\tconst errStr = event.data !== undefined ? ` ${summarize(event.data)}` : \"\";\n\t\t\t\t\t\t\tlogger(`[${elapsedStr()}s] ${stage.padEnd(9)} ✗${errStr}`);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (event.type === \"complete\") {\n\t\t\t\t\t\trecordEvent(stage, \"complete\", undefined);\n\t\t\t\t\t\tif (logger) {\n\t\t\t\t\t\t\tlogger(`[${elapsedStr()}s] ${stage.padEnd(9)} ■ complete`);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\tincludeTypes: [\"data\", \"error\", \"complete\"],\n\t\t\t});\n\t\t\tobservations.push(obs);\n\t\t} catch {\n\t\t\t// Node may not exist (e.g., queue route not mounted) — skip silently\n\t\t}\n\t}\n\n\t// Wire stage nodes (COMPOSITION-GUIDE §5: sinks before sources)\n\tfor (const [path, stage] of Object.entries(STAGE_LABELS)) {\n\t\twireStage(path, stage);\n\t}\n\n\t// Wire gate outputs per gated queue\n\tfor (const [gatedRoute] of harness.gates) {\n\t\twireStage(`gates::${gatedRoute}/gate`, \"GATE\");\n\t}\n\n\treturn {\n\t\tget events(): readonly TraceEvent[] {\n\t\t\treturn events;\n\t\t},\n\t\tdispose() {\n\t\t\tfor (const obs of observations) obs.dispose();\n\t\t\tobservations.length = 0;\n\t\t},\n\t};\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction summarize(value: unknown): string {\n\tif (value == null) return \"null\";\n\tif (typeof value === \"string\") return truncate(value, 80);\n\tif (typeof value === \"number\" || typeof value === \"boolean\") return String(value);\n\tif (typeof value === \"bigint\") return String(value);\n\ttry {\n\t\tconst json = JSON.stringify(value);\n\t\treturn truncate(json, 120);\n\t} catch {\n\t\treturn String(value);\n\t}\n}\n\nfunction truncate(s: string, max: number): string {\n\treturn s.length > max ? `${s.slice(0, max - 1)}…` : s;\n}\n","/**\n * Reactive graph observability (roadmap §9.0b — mid-level harness blocks).\n *\n * {@link graphLens} rides on any {@link Graph}, exposing four reactive\n * observability surfaces:\n *\n * - {@link LensGraph.stats} — `Node<TopologyStats>` recomputed on\n *   structural change (transitive across mounted subgraphs). Named `stats`\n *   rather than `topology` to avoid collision with the inherited\n *   {@link Graph.topology} event stream on `LensGraph`.\n * - {@link LensGraph.health} — `Node<HealthReport>` flipping `ok=false`\n *   when any node enters `\"errored\"` status, with `upstreamCause` walked\n *   backward through deps.\n * - {@link LensGraph.flow} — `ReactiveMapBundle<string, FlowEntry>` (not a\n *   plain snapshot node) tracking per-path DATA counts + `lastUpdate_ns`.\n *   O(1) `get`/`has`/`size` queries; `.entries` node emits lazily only when\n *   subscribed. Built on the shipped `reactiveMap` primitive.\n * - {@link LensGraph.why} — returns a live `Node<CausalChain>` from `from`\n *   to `to`, reusing {@link reactiveExplainPath}.\n *\n * Everything is pure-reactive — no polling, no opinionated thresholds.\n * Callers who want periodic staleness checks or bottleneck classification\n * compose them explicitly with `fromTimer` + a derived node.\n *\n * The transitive topology-subscription helper lives in {@link watchTopologyTree}\n * (re-exported here for convenience; canonical source is `graph/topology-tree.ts`).\n *\n * @module\n */\nimport { monotonicNs } from \"../core/clock.js\";\nimport type { Node } from \"../core/node.js\";\nimport { derived, state } from \"../core/sugar.js\";\nimport { type ReactiveMapBundle, reactiveMap } from \"../extra/reactive-map.js\";\nimport {\n\ttype CausalChain,\n\tGraph,\n\ttype GraphDescribeOutput,\n\ttype GraphOptions,\n\treachable,\n\twatchTopologyTree,\n} from \"../graph/index.js\";\nimport { domainMeta, keepalive } from \"./_internal.js\";\nimport { reactiveExplainPath } from \"./audit.js\";\n\nexport { watchTopologyTree } from \"../graph/index.js\";\n\n// ---------------------------------------------------------------------------\n// Payload types\n// ---------------------------------------------------------------------------\n\n/** Aggregate topology stats emitted by {@link LensGraph.stats}. */\nexport interface TopologyStats {\n\t/** Total primary nodes across this graph and all transitively mounted subgraphs. */\n\tnodeCount: number;\n\t/** Total directed edges (derived from deps; no duplicates). */\n\tedgeCount: number;\n\t/** Count of mounted subgraphs (transitive). */\n\tsubgraphCount: number;\n\t/** Qualified paths with no upstream deps (source nodes). Sorted. */\n\tsources: readonly string[];\n\t/** Qualified paths with no downstream consumers in-graph (sink nodes). Sorted. */\n\tsinks: readonly string[];\n\t/** Longest path from any source to any sink (in edges). `0` for empty graphs. */\n\tdepth: number;\n\t/** `true` if the dep DAG contains a cycle (feedback edge). */\n\thasCycles: boolean;\n}\n\n/** A single health problem entry. */\nexport interface HealthProblem {\n\tpath: string;\n\t/** V1 only reports `\"errored\"`. Future versions may add `\"completed\"`, `\"disconnected\"`. */\n\tstatus: \"errored\";\n\t/** First errored upstream ancestor along the dep chain, when one exists and is distinct from `path`. */\n\tupstreamCause?: string;\n}\n\n/** Aggregate health snapshot. `ok=true` iff `problems.length === 0`. */\nexport interface HealthReport {\n\tok: boolean;\n\tproblems: readonly HealthProblem[];\n}\n\n/** One per-path flow entry stored in {@link LensGraph.flow}. */\nexport interface FlowEntry {\n\tpath: string;\n\t/** Cumulative DATA emissions observed since the lens activated. */\n\tcount: number;\n\t/** `monotonicNs()` at the most recent DATA emission, or `null` if none yet. */\n\tlastUpdate_ns: number | null;\n}\n\n// ---------------------------------------------------------------------------\n// Options\n// ---------------------------------------------------------------------------\n\n/** Options for {@link graphLens}. */\nexport interface GraphLensOptions {\n\tname?: string;\n\tgraph?: GraphOptions;\n\t/**\n\t * Limit which node paths `flow` tracks. When omitted, every path in\n\t * `target.describe()` is observed. Recommended for graphs with hundreds\n\t * of nodes since each tracked path adds one observe-event dispatch per\n\t * DATA emission.\n\t */\n\tpathFilter?: (path: string) => boolean;\n\t/**\n\t * LRU cap on the {@link LensGraph.flow} map. When set, the flow tracker\n\t * evicts least-recently-used paths (by insertion / set order) once the\n\t * entry count exceeds this bound. Omit for unbounded (not recommended\n\t * for long-running graphs with churning paths). Passed through to the\n\t * underlying {@link reactiveMap}'s `maxSize`.\n\t */\n\tmaxFlowPaths?: number;\n}\n\n// ---------------------------------------------------------------------------\n// Stat computation\n// ---------------------------------------------------------------------------\n\nfunction lensMeta(kind: string): Record<string, unknown> {\n\treturn domainMeta(\"lens\", kind);\n}\n\nfunction computeTopologyStats(described: GraphDescribeOutput): TopologyStats {\n\tconst paths = Object.keys(described.nodes);\n\tconst depsByPath = new Map<string, readonly string[]>();\n\tconst dependents = new Map<string, Set<string>>();\n\tfor (const path of paths) {\n\t\tconst deps = described.nodes[path]?.deps ?? [];\n\t\tdepsByPath.set(path, deps);\n\t\tfor (const dep of deps) {\n\t\t\tif (!dependents.has(dep)) dependents.set(dep, new Set());\n\t\t\tdependents.get(dep)!.add(path);\n\t\t}\n\t}\n\tconst sources: string[] = [];\n\tconst sinks: string[] = [];\n\tfor (const path of paths) {\n\t\tif ((depsByPath.get(path) ?? []).length === 0) sources.push(path);\n\t\tif (!dependents.has(path)) sinks.push(path);\n\t}\n\tsources.sort();\n\tsinks.sort();\n\n\tconst edgeCount = described.edges.length;\n\n\t// Cycle detection + longest path (DFS with recursion stack). Longest path\n\t// is measured in edges; undefined deps are ignored. Running on the DAG\n\t// subset: if a cycle is detected we still return `depth` for the acyclic\n\t// portion (0 if the whole graph cycles).\n\tconst WHITE = 0;\n\tconst GRAY = 1;\n\tconst BLACK = 2;\n\tconst color = new Map<string, number>();\n\tfor (const p of paths) color.set(p, WHITE);\n\tlet hasCycles = false;\n\tconst longestFrom = new Map<string, number>();\n\n\tconst dfs = (path: string): number => {\n\t\tconst c = color.get(path) ?? WHITE;\n\t\tif (c === GRAY) {\n\t\t\thasCycles = true;\n\t\t\treturn 0;\n\t\t}\n\t\tif (c === BLACK) return longestFrom.get(path) ?? 0;\n\t\tcolor.set(path, GRAY);\n\t\tlet best = 0;\n\t\tconst kids = dependents.get(path);\n\t\tif (kids != null) {\n\t\t\tfor (const k of kids) {\n\t\t\t\tconst childLongest = dfs(k);\n\t\t\t\tif (childLongest + 1 > best) best = childLongest + 1;\n\t\t\t}\n\t\t}\n\t\tcolor.set(path, BLACK);\n\t\tlongestFrom.set(path, best);\n\t\treturn best;\n\t};\n\n\tlet depth = 0;\n\tfor (const src of sources) {\n\t\tconst d = dfs(src);\n\t\tif (d > depth) depth = d;\n\t}\n\t// Visit remaining nodes so cycle-only subgraphs still flip hasCycles.\n\tfor (const p of paths) {\n\t\tif (color.get(p) === WHITE) dfs(p);\n\t}\n\n\treturn {\n\t\tnodeCount: paths.length,\n\t\tedgeCount,\n\t\tsubgraphCount: described.subgraphs.length,\n\t\tsources,\n\t\tsinks,\n\t\tdepth,\n\t\thasCycles,\n\t};\n}\n\nfunction computeHealthReport(described: GraphDescribeOutput): HealthReport {\n\tconst problems: HealthProblem[] = [];\n\tfor (const [path, desc] of Object.entries(described.nodes)) {\n\t\tif (desc.status !== \"errored\") continue;\n\t\tconst entry: HealthProblem = { path, status: \"errored\" };\n\t\t// Walk upstream to find the first errored ancestor (if any) distinct from `path`.\n\t\t// Explicit empty options disambiguates the overload (otherwise both match\n\t\t// and TS picks the `withDetail:true` signature first).\n\t\tconst upstream = reachable(described, path, \"upstream\", {});\n\t\tfor (const p of upstream) {\n\t\t\tif (p === path) continue;\n\t\t\tif (described.nodes[p]?.status === \"errored\") {\n\t\t\t\tentry.upstreamCause = p;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tproblems.push(entry);\n\t}\n\tproblems.sort((a, b) => (a.path < b.path ? -1 : a.path > b.path ? 1 : 0));\n\treturn { ok: problems.length === 0, problems };\n}\n\nfunction topologyStatsEqual(a: TopologyStats, b: TopologyStats): boolean {\n\treturn (\n\t\ta.nodeCount === b.nodeCount &&\n\t\ta.edgeCount === b.edgeCount &&\n\t\ta.subgraphCount === b.subgraphCount &&\n\t\ta.depth === b.depth &&\n\t\ta.hasCycles === b.hasCycles &&\n\t\tstringArrayEqual(a.sources, b.sources) &&\n\t\tstringArrayEqual(a.sinks, b.sinks)\n\t);\n}\n\nfunction healthReportEqual(a: HealthReport, b: HealthReport): boolean {\n\tif (a.ok !== b.ok) return false;\n\tif (a.problems.length !== b.problems.length) return false;\n\tfor (let i = 0; i < a.problems.length; i++) {\n\t\tconst x = a.problems[i]!;\n\t\tconst y = b.problems[i]!;\n\t\tif (x.path !== y.path) return false;\n\t\tif (x.status !== y.status) return false;\n\t\tif (x.upstreamCause !== y.upstreamCause) return false;\n\t}\n\treturn true;\n}\n\nfunction stringArrayEqual(a: readonly string[], b: readonly string[]): boolean {\n\tif (a.length !== b.length) return false;\n\tfor (let i = 0; i < a.length; i++) {\n\t\tif (a[i] !== b[i]) return false;\n\t}\n\treturn true;\n}\n\n// ---------------------------------------------------------------------------\n// LensGraph\n// ---------------------------------------------------------------------------\n\n/**\n * Reactive observability surface for a target {@link Graph}.\n * See {@link graphLens}.\n *\n * @category observability\n */\nexport class LensGraph extends Graph {\n\t/**\n\t * Aggregate structural stats — `nodeCount`, `edgeCount`, `sources`,\n\t * `sinks`, `depth`, `hasCycles`, `subgraphCount`. Recomputes on every\n\t * structural change via {@link watchTopologyTree} (transitive).\n\t *\n\t * Named `stats` (not `topology`) because `Graph.topology` already names\n\t * the raw `TopologyEvent` stream on every graph including `LensGraph`;\n\t * giving the lens its own `topology` accessor with an incompatible\n\t * `Node<TopologyStats>` type would break Liskov substitutability.\n\t */\n\treadonly stats: Node<TopologyStats>;\n\treadonly health: Node<HealthReport>;\n\t/**\n\t * Per-path flow tracker — a live {@link ReactiveMapBundle} keyed by\n\t * qualified path. Use `.get(path)` / `.has(path)` / `.size` for O(1)\n\t * sync queries; subscribe to `.entries` for a reactive snapshot of the\n\t * whole map. Lazy — the snapshot is materialized only while `.entries`\n\t * has subscribers.\n\t *\n\t * Shape intentionally differs from `stats` / `health` (which are plain\n\t * `Node<Report>`) because `flow` is a keyed collection, not a single\n\t * aggregate value. The map shape exposes cheaper queries than any\n\t * snapshot-based design.\n\t */\n\treadonly flow: ReactiveMapBundle<string, FlowEntry>;\n\tprivate readonly _target: Graph;\n\n\tconstructor(target: Graph, opts: GraphLensOptions = {}) {\n\t\tsuper(opts.name ?? `${target.name}_lens`, opts.graph);\n\t\tthis._target = target;\n\n\t\t// ——————————————————————————————————————————————————————————————\n\t\t// Shared tick counters (closure-held — COMPOSITION-GUIDE §28 pattern).\n\t\t// `.cache` reads on state() can be undefined before the derived\n\t\t// subscribes; using closure counters keeps the derived fn pure.\n\t\t// ——————————————————————————————————————————————————————————————\n\t\tlet statsVersion = 0;\n\t\tlet healthVersion = 0;\n\t\tconst statsTick = state(0, { name: \"stats_tick\" });\n\t\tconst healthTick = state(0, { name: \"health_tick\" });\n\t\tthis.add(\"stats_tick\", statsTick);\n\t\tthis.add(\"health_tick\", healthTick);\n\n\t\t// ——————————————————————————————————————————————————————————————\n\t\t// flow — reactiveMap<qualifiedPath, FlowEntry>\n\t\t// ——————————————————————————————————————————————————————————————\n\t\tconst mapOpts: { name: string; maxSize?: number } = { name: \"flow\" };\n\t\tif (opts.maxFlowPaths != null) mapOpts.maxSize = opts.maxFlowPaths;\n\t\tthis.flow = reactiveMap<string, FlowEntry>(mapOpts);\n\t\tthis.add(\"flow\", this.flow.entries);\n\n\t\tconst pathFilter = opts.pathFilter;\n\n\t\t// ——————————————————————————————————————————————————————————————\n\t\t// Single consolidated topology watcher (stats + health + flow cleanup)\n\t\t// ——————————————————————————————————————————————————————————————\n\t\tconst offTopology = watchTopologyTree(target, (event, _emitter, prefix) => {\n\t\t\t// Any structural change bumps stats & health.\n\t\t\tstatsVersion += 1;\n\t\t\tstatsTick.emit(statsVersion);\n\t\t\thealthVersion += 1;\n\t\t\thealthTick.emit(healthVersion);\n\n\t\t\t// Flow cleanup for removed paths — use the prefix to compute the\n\t\t\t// qualified key that matches `flow`'s entries.\n\t\t\tif (event.kind === \"removed\") {\n\t\t\t\tif (event.nodeKind === \"node\") {\n\t\t\t\t\tconst qp = `${prefix}${event.name}`;\n\t\t\t\t\tthis.flow.delete(qp);\n\t\t\t\t} else {\n\t\t\t\t\t// Mount removal: audit.nodes are paths RELATIVE to the unmounted\n\t\t\t\t\t// subgraph. Qualify with the mount's prefix to match flow keys.\n\t\t\t\t\tconst mountPrefix = `${prefix}${event.name}::`;\n\t\t\t\t\tconst keysToDelete: string[] = [];\n\t\t\t\t\tfor (const relativePath of event.audit.nodes) {\n\t\t\t\t\t\tconst qualified =\n\t\t\t\t\t\t\trelativePath === \"\" ? `${prefix}${event.name}` : `${mountPrefix}${relativePath}`;\n\t\t\t\t\t\tkeysToDelete.push(qualified);\n\t\t\t\t\t}\n\t\t\t\t\t// deleteMany collapses N deletions into one snapshot emit.\n\t\t\t\t\tif (keysToDelete.length > 0) this.flow.deleteMany(keysToDelete);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t\tthis.addDisposer(offTopology);\n\n\t\t// ——————————————————————————————————————————————————————————————\n\t\t// Single consolidated observe subscription (health + flow DATA counter)\n\t\t// ——————————————————————————————————————————————————————————————\n\t\tconst observeHandle = target.observe({ timeline: true, structured: true });\n\t\tconst offObserve = observeHandle.onEvent((event) => {\n\t\t\tconst t = event.type;\n\t\t\t// Health: recompute on status transitions and ERROR resolution.\n\t\t\tif (t === \"error\" || t === \"complete\" || t === \"data\" || t === \"teardown\") {\n\t\t\t\thealthVersion += 1;\n\t\t\t\thealthTick.emit(healthVersion);\n\t\t\t}\n\t\t\t// Flow: per-path DATA counter. Writes into reactiveMap; the map's\n\t\t\t// version counter + lazy `.entries` emission takes care of downstream\n\t\t\t// propagation (O(P) snapshot only when `.entries` is subscribed).\n\t\t\tif (t === \"data\") {\n\t\t\t\tconst path = event.path ?? \"\";\n\t\t\t\tif (!path) return;\n\t\t\t\tif (pathFilter != null && !pathFilter(path)) return;\n\t\t\t\tconst existing = this.flow.get(path);\n\t\t\t\tconst count = existing != null ? existing.count + 1 : 1;\n\t\t\t\tthis.flow.set(path, { path, count, lastUpdate_ns: monotonicNs() });\n\t\t\t}\n\t\t});\n\t\tthis.addDisposer(() => {\n\t\t\toffObserve();\n\t\t\tobserveHandle.dispose();\n\t\t});\n\n\t\t// ——————————————————————————————————————————————————————————————\n\t\t// stats — derived from the tick\n\t\t// ——————————————————————————————————————————————————————————————\n\t\tthis.stats = derived<TopologyStats>(\n\t\t\t[statsTick],\n\t\t\t() => computeTopologyStats(target.describe({ detail: \"minimal\" })),\n\t\t\t{\n\t\t\t\tname: \"stats\",\n\t\t\t\tdescribeKind: \"derived\",\n\t\t\t\tequals: topologyStatsEqual,\n\t\t\t\tmeta: lensMeta(\"stats\"),\n\t\t\t},\n\t\t);\n\t\tthis.add(\"stats\", this.stats);\n\t\tthis.addDisposer(keepalive(this.stats));\n\n\t\t// ——————————————————————————————————————————————————————————————\n\t\t// health — derived from the tick\n\t\t// ——————————————————————————————————————————————————————————————\n\t\tthis.health = derived<HealthReport>(\n\t\t\t[healthTick],\n\t\t\t() => computeHealthReport(target.describe({ detail: \"standard\" })),\n\t\t\t{\n\t\t\t\tname: \"health\",\n\t\t\t\tdescribeKind: \"derived\",\n\t\t\t\tequals: healthReportEqual,\n\t\t\t\tmeta: lensMeta(\"health\"),\n\t\t\t},\n\t\t);\n\t\tthis.add(\"health\", this.health);\n\t\tthis.addDisposer(keepalive(this.health));\n\t}\n\n\t/**\n\t * Live causal chain from `from` to `to`. Recomputes whenever the target\n\t * mutates. Disposed automatically when the lens is destroyed.\n\t *\n\t * **Lifetime note:** every call to `why()` registers a lens-owned disposer\n\t * that runs on `lens.destroy()`. The returned `dispose` function releases\n\t * the internal subscription but does NOT remove the lens-owned disposer —\n\t * so heavy calling (e.g. per render frame) accumulates no-op disposers\n\t * until lens teardown. Cache the returned handle for long-lived queries.\n\t *\n\t * @param from - Qualified path of the upstream endpoint.\n\t * @param to - Qualified path of the downstream endpoint.\n\t * @param opts - See {@link reactiveExplainPath}.\n\t */\n\twhy(\n\t\tfrom: string,\n\t\tto: string,\n\t\topts?: { maxDepth?: number; name?: string; findCycle?: boolean },\n\t): { node: Node<CausalChain>; dispose: () => void } {\n\t\tconst handle = reactiveExplainPath(this._target, from, to, opts);\n\t\tthis.addDisposer(handle.dispose);\n\t\treturn handle;\n\t}\n\n\t/** Reference to the lensed graph. */\n\tget target(): Graph {\n\t\treturn this._target;\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// Factory\n// ---------------------------------------------------------------------------\n\n/**\n * Create a reactive observability lens over a {@link Graph}. Returns a\n * {@link LensGraph} with three reactive surfaces (`stats`, `health`, `flow`)\n * plus the `why(from, to)` method.\n *\n * The returned graph is detached. Mount it via `target.mount(\"lens\", lens)`\n * if you want it to appear in the target's `describe()`, or keep it standalone.\n *\n * @param target - The graph to observe.\n * @param opts - See {@link GraphLensOptions}.\n *\n * @example\n * ```ts\n * const g = new Graph(\"app\");\n * g.add(\"counter\", state(0));\n * const lens = graphLens(g);\n * lens.stats.subscribe((msgs) => console.log(msgs[0]?.[1])); // TopologyStats\n * // Flow queries — O(1) without subscribing to snapshots:\n * lens.flow.get(\"counter\");        // FlowEntry | undefined\n * lens.flow.size;                  // number\n * lens.flow.entries.subscribe(...); // reactive snapshot, lazy-materialized\n * ```\n *\n * @category observability\n */\nexport function graphLens(target: Graph, opts?: GraphLensOptions): LensGraph {\n\treturn new LensGraph(target, opts);\n}\n","/**\n * Resilience composition with correct nesting order (roadmap §9.0b).\n *\n * {@link resilientPipeline} composes the resilience primitives from\n * `extra/resilience.ts` in the order discovered during the §9.1 eval runs:\n *\n * ```text\n *   rateLimit → budget → breaker → timeout → retry → fallback → status\n * ```\n *\n * Note on retry/timeout ordering: `timeout` is applied BEFORE `retry` so each\n * retry attempt resubscribes to a fresh deadline (per-attempt semantics). If\n * `timeout` wrapped `retry`, a single deadline would apply to the entire\n * retry chain — not what callers expect.\n *\n * Every step is optional — omit the option and that layer is skipped. The\n * returned bundle exposes the final `Node<T>` plus the status/error/breaker\n * companions so callers can wire them into dashboards, alerts, or\n * {@link graphLens}.\n *\n * Subsumes the pre-1.0 `resilientFetch` template — that template becomes a\n * preconfigured instance of this factory for the HTTP fetch case.\n *\n * @module\n */\nimport type { Node } from \"../core/node.js\";\nimport { NS_PER_MS, NS_PER_SEC } from \"../extra/backoff.js\";\nimport {\n\ttype CircuitBreakerOptions,\n\ttype CircuitState,\n\tcircuitBreaker,\n\ttype FallbackInput,\n\tfallback,\n\ttype RateLimiterOptions,\n\ttype RetryOptions,\n\trateLimiter,\n\tretry,\n\ttype StatusValue,\n\ttimeout,\n\twithBreaker,\n\twithStatus,\n} from \"../extra/resilience.js\";\nimport { type BudgetConstraint, budgetGate } from \"./reduction.js\";\n\n/** Options for {@link resilientPipeline}. Every field is optional — omit to skip that layer. */\nexport interface ResilientPipelineOptions<T> {\n\t/** Admission control — at most `maxEvents` DATA per `windowNs`. See {@link rateLimiter}. */\n\trateLimit?: RateLimiterOptions;\n\t/** Cost/constraint gate. See {@link budgetGate}. */\n\tbudget?: ReadonlyArray<BudgetConstraint>;\n\t/** Circuit breaker — fail-fast when the downstream resource is unhealthy. See {@link circuitBreaker}. */\n\tbreaker?: CircuitBreakerOptions;\n\t/**\n\t * Behavior when the breaker is open:\n\t * - `\"skip\"` — emit RESOLVED (default, lets downstream drop the beat)\n\t * - `\"error\"` — emit a `CircuitOpenError` so `retry`/`fallback` can react\n\t *\n\t * Only used when `breaker` is provided.\n\t */\n\tbreakerOnOpen?: \"skip\" | \"error\";\n\t/** Retry policy on terminal ERROR. See {@link retry}. */\n\tretry?: RetryOptions;\n\t/**\n\t * Per-attempt deadline in milliseconds. Converted to ns internally. Omit to skip the timeout wrap.\n\t *\n\t * Specified in ms (not ns) because callers consistently think in millisecond deadlines;\n\t * retry/breaker/ratelimit options take ns to match their primitives exactly.\n\t */\n\ttimeoutMs?: number;\n\t/** Final fallback value emitted on terminal ERROR after retry exhausts. See {@link fallback}. */\n\tfallback?: FallbackInput<T>;\n\t/** Initial status reported by the status node. Default `\"pending\"`. */\n\tinitialStatus?: StatusValue;\n}\n\n/** Output bundle of {@link resilientPipeline}. */\nexport interface ResilientPipelineBundle<T> {\n\t/** The final resilient node. Subscribe to this for DATA emissions. */\n\tnode: Node<T>;\n\t/** Live status: `\"pending\" | \"active\" | \"completed\" | \"errored\"`. */\n\tstatus: Node<StatusValue>;\n\t/** Last error payload, or `null` when not errored. */\n\terror: Node<unknown | null>;\n\t/** Breaker state when `opts.breaker` was provided; `undefined` otherwise. */\n\tbreakerState: Node<CircuitState> | undefined;\n}\n\n/**\n * Compose a resilient pipeline around `source` in the canonical nesting\n * order — `rateLimit → budget → breaker → timeout → retry → fallback → status`.\n * Omit any option to skip that layer.\n *\n * @param source - Upstream node to wrap.\n * @param opts - See {@link ResilientPipelineOptions}. All fields optional.\n *\n * @example\n * ```ts\n * const safeFetch = resilientPipeline(fetchNode, {\n *   rateLimit: { maxEvents: 10, windowNs: NS_PER_SEC },\n *   breaker: { failureThreshold: 5 },\n *   retry: { count: 3, backoff: \"exponential\" },\n *   timeoutMs: 10_000,\n *   fallback: null,\n * });\n * safeFetch.status.subscribe(msgs => console.log(msgs));\n * ```\n *\n * @category patterns\n */\nexport function resilientPipeline<T>(\n\tsource: Node<T>,\n\topts: ResilientPipelineOptions<T> = {},\n): ResilientPipelineBundle<T> {\n\tlet current: Node<T> = source;\n\n\t// 1. Admission control — cheapest to drop / queue before any other work.\n\tif (opts.rateLimit != null) {\n\t\tcurrent = rateLimiter(current, opts.rateLimit);\n\t}\n\n\t// 2. Budget — block when constraints are exhausted. Also cheap (no I/O).\n\tif (opts.budget != null && opts.budget.length > 0) {\n\t\tcurrent = budgetGate(current, opts.budget);\n\t}\n\n\t// 3. Breaker — skip the resource when unhealthy (fail-fast before retry wastes time).\n\tlet breakerState: Node<CircuitState> | undefined;\n\tif (opts.breaker != null) {\n\t\tconst breaker = circuitBreaker(opts.breaker);\n\t\tconst onOpen = opts.breakerOnOpen ?? \"skip\";\n\t\tconst wrapped = withBreaker<T>(breaker, { onOpen })(current);\n\t\tcurrent = wrapped.node;\n\t\tbreakerState = wrapped.breakerState;\n\t}\n\n\t// 4. Timeout — per-attempt deadline. Applied BEFORE retry so each retry\n\t//    resubscribes to a fresh timeout. Swapping the order (timeout OUTSIDE\n\t//    retry) would apply one global deadline to the entire retry chain —\n\t//    not what callers expect for \"per-attempt timeout.\"\n\tif (opts.timeoutMs != null) {\n\t\tif (opts.timeoutMs <= 0) throw new RangeError(\"timeoutMs must be > 0\");\n\t\t// Guard against `timeoutMs * NS_PER_MS` overflowing Number.MAX_SAFE_INTEGER\n\t\t// (~9.007e15). 9_000_000 ms ≈ 2.5 hours is a sane upper bound; callers\n\t\t// needing longer deadlines should express them at the primitive level.\n\t\tif (opts.timeoutMs > 9_000_000) {\n\t\t\tthrow new RangeError(\n\t\t\t\t\"timeoutMs must be <= 9_000_000 (≈2.5h) to stay within safe ns arithmetic\",\n\t\t\t);\n\t\t}\n\t\tcurrent = timeout(current, opts.timeoutMs * NS_PER_MS);\n\t}\n\n\t// 5. Retry — resubscribe on ERROR up to `count` times. Wraps timeout so\n\t//    each retry gets its own fresh deadline.\n\tif (opts.retry != null) {\n\t\tcurrent = retry(current, opts.retry);\n\t}\n\n\t// 6. Fallback — last resort after retry+timeout exhaust.\n\tif (opts.fallback !== undefined) {\n\t\tcurrent = fallback(current, opts.fallback);\n\t}\n\n\t// 7. Status wrapping — observability. Always last so it sees the final shape.\n\tconst withStatusBundle = withStatus(current, { initialStatus: opts.initialStatus ?? \"pending\" });\n\n\treturn {\n\t\tnode: withStatusBundle.node,\n\t\tstatus: withStatusBundle.status,\n\t\terror: withStatusBundle.error,\n\t\tbreakerState,\n\t};\n}\n\n// Re-export NS constants for consumers authoring pipeline options at call sites.\nexport { NS_PER_MS, NS_PER_SEC };\n","/**\n * Surface layer (§9.3-core) — shared, JSON-safe operations consumed by\n * `@graphrefly/mcp-server` and `@graphrefly/cli`.\n *\n * The surface is a thin projection of existing Graph APIs (`describe`,\n * `observe`, `explain`, `snapshot`, `restore`, static `diff`), plus two\n * genuinely new operations:\n *\n * 1. {@link createGraph} — `compileSpec` wrapped with typed surface errors.\n * 2. {@link reduce} — one-shot `input → pipeline → output`.\n *\n * Snapshot persistence reuses the {@link StorageTier} substrate introduced\n * for `Graph.attachStorage`, so one-shot snapshots and auto-checkpoints\n * share the {@link GraphCheckpointRecord} envelope. No new wire format.\n *\n * Errors throw as {@link SurfaceError} — wrappers map to their native\n * error channel (MCP `isError`, CLI exit code). No `Result<T, E>` wrapper.\n *\n * @module\n */\n\n// Re-export the graphspec types the surface operates on, so MCP/CLI\n// wrappers get `GraphSpec`/`GraphSpecCatalog` from one import. The\n// runtime functions (`compileSpec`, `validateSpec`, `decompileGraph`,\n// etc.) stay inside `patterns.graphspec` — surface callers use\n// {@link createGraph}, not those directly.\nexport type {\n\tCatalogFnEntry,\n\tCatalogSourceEntry,\n\tConfigFieldSchema,\n\tFnFactory,\n\tGraphSpec,\n\tGraphSpecCatalog,\n\tGraphSpecFeedbackEdge,\n\tGraphSpecNode,\n\tGraphSpecTemplate,\n\tGraphSpecTemplateRef,\n\tGraphSpecValidation,\n\tSourceFactory,\n} from \"../graphspec.js\";\nexport type { CreateGraphOptions } from \"./create.js\";\nexport { createGraph } from \"./create.js\";\nexport type { SurfaceErrorCode, SurfaceErrorPayload } from \"./errors.js\";\nexport { asSurfaceError, SurfaceError } from \"./errors.js\";\nexport type { ReduceOptions } from \"./reduce.js\";\nexport { runReduction } from \"./reduce.js\";\nexport type {\n\tRestoreSnapshotOptions,\n\tSaveSnapshotResult,\n} from \"./snapshot.js\";\nexport {\n\tdeleteSnapshot,\n\tdiffSnapshots,\n\tlistSnapshots,\n\trestoreSnapshot,\n\tSNAPSHOT_WIRE_VERSION,\n\tsaveSnapshot,\n} from \"./snapshot.js\";\n","/**\n * Typed errors for the surface layer (§9.3-core).\n *\n * The surface layer is consumed by `@graphrefly/mcp-server` and\n * `@graphrefly/cli`. Both have native error channels (MCP's `isError` flag,\n * CLI's exit codes), so surface functions throw a {@link SurfaceError}\n * carrying a structured code + details payload that wrappers can map to\n * their native shape. No `Result` envelope — keep the callsite idiom\n * `try/catch` and let each wrapper surface the error its own way.\n *\n * @module\n */\n\n/** Structured error codes emitted by the surface layer. JSON-safe. */\nexport type SurfaceErrorCode =\n\t| \"invalid-spec\"\n\t| \"graph-not-found\"\n\t| \"graph-exists\"\n\t| \"snapshot-not-found\"\n\t| \"node-not-found\"\n\t| \"reduce-timeout\"\n\t| \"catalog-error\"\n\t| \"restore-failed\"\n\t| \"snapshot-failed\"\n\t| \"tier-no-list\"\n\t| \"internal-error\";\n\n/** JSON-safe shape surfaces should echo back through the wrapper. */\nexport interface SurfaceErrorPayload {\n\tcode: SurfaceErrorCode;\n\tmessage: string;\n\t/** Optional structured detail; must be JSON-safe. */\n\tdetails?: Readonly<Record<string, unknown>>;\n}\n\n/**\n * Thrown by surface layer functions on failure. `code` is the stable\n * machine-readable identifier; `details` carries structured context\n * (e.g. `validateSpec` errors, missing path name). Both fields round-trip\n * through `toJSON()` for wrappers that serialize errors over the wire.\n */\nexport class SurfaceError extends Error {\n\treadonly code: SurfaceErrorCode;\n\treadonly details?: Readonly<Record<string, unknown>>;\n\n\tconstructor(\n\t\tcode: SurfaceErrorCode,\n\t\tmessage: string,\n\t\tdetails?: Readonly<Record<string, unknown>>,\n\t) {\n\t\tsuper(message);\n\t\tthis.name = \"SurfaceError\";\n\t\tthis.code = code;\n\t\tif (details !== undefined) this.details = details;\n\t}\n\n\t/**\n\t * JSON-safe payload for wire serialization. Defensively validates\n\t * `details` — if it can't be round-tripped through `JSON.stringify`\n\t * (cyclic refs, `BigInt`, `Error` instance not pre-toJSON'd), the\n\t * payload falls back to `{code, message}` only rather than crashing\n\t * the MCP/CLI wrapper when it serializes this error onto the wire.\n\t */\n\ttoJSON(): SurfaceErrorPayload {\n\t\tconst out: SurfaceErrorPayload = { code: this.code, message: this.message };\n\t\tif (this.details !== undefined) {\n\t\t\tconst safe = safeDetails(this.details);\n\t\t\tif (safe !== undefined) out.details = safe;\n\t\t}\n\t\treturn out;\n\t}\n}\n\nfunction safeDetails(\n\tdetails: Readonly<Record<string, unknown>>,\n): Readonly<Record<string, unknown>> | undefined {\n\ttry {\n\t\t// Round-trip through JSON to strip non-serializable values (functions,\n\t\t// undefined) and reject cyclic structures with a thrown TypeError. The\n\t\t// round-trip result is the canonical wire shape.\n\t\treturn JSON.parse(JSON.stringify(details)) as Readonly<Record<string, unknown>>;\n\t} catch {\n\t\treturn undefined;\n\t}\n}\n\n/** Wrap any thrown value as a SurfaceError. Idempotent on existing SurfaceError. */\nexport function asSurfaceError(\n\terr: unknown,\n\tfallbackCode: SurfaceErrorCode = \"internal-error\",\n): SurfaceError {\n\tif (err instanceof SurfaceError) return err;\n\tconst message = err instanceof Error ? err.message : String(err);\n\treturn new SurfaceError(fallbackCode, message);\n}\n","/**\n * Surface: create a graph from a {@link GraphSpec} (§9.3-core).\n *\n * Thin wrapper over {@link compileSpec} that converts the two failure modes\n * ({@link validateSpec} structural errors, and catalog-aware validation\n * errors) into typed {@link SurfaceError} throws. Consumers are MCP/CLI\n * wrappers, not end-user graph code — those should import `compileSpec`\n * directly.\n *\n * @module\n */\n\nimport type { Graph } from \"../../graph/graph.js\";\nimport type { CompileSpecOptions, GraphSpec } from \"../graphspec.js\";\nimport { compileSpec, validateSpec, validateSpecAgainstCatalog } from \"../graphspec.js\";\nimport { SurfaceError } from \"./errors.js\";\n\n/** Options for {@link createGraph}. Same shape as {@link CompileSpecOptions}. */\nexport type CreateGraphOptions = CompileSpecOptions;\n\n/**\n * Build a {@link Graph} from a parsed {@link GraphSpec} with surface-layer\n * error typing.\n *\n * @throws {SurfaceError} `invalid-spec` for structural errors;\n *   `catalog-error` when fn/source names or config don't match the catalog.\n */\nexport function createGraph(spec: GraphSpec, opts?: CreateGraphOptions): Graph {\n\tconst structural = validateSpec(spec);\n\tif (!structural.valid) {\n\t\tthrow new SurfaceError(\n\t\t\t\"invalid-spec\",\n\t\t\t`GraphSpec validation failed:\\n${structural.errors.join(\"\\n\")}`,\n\t\t\t{ errors: structural.errors },\n\t\t);\n\t}\n\tconst catalog = opts?.catalog ?? {};\n\tconst catalogValidation = validateSpecAgainstCatalog(spec, catalog);\n\tif (!catalogValidation.valid) {\n\t\tthrow new SurfaceError(\n\t\t\t\"catalog-error\",\n\t\t\t`Catalog validation failed:\\n${catalogValidation.errors.join(\"\\n\")}`,\n\t\t\t{ errors: catalogValidation.errors },\n\t\t);\n\t}\n\ttry {\n\t\treturn compileSpec(spec, opts);\n\t} catch (err) {\n\t\t// compileSpec re-throws validation errors plus may throw on missing\n\t\t// catalog entries for template-inner deferred nodes. Surface as\n\t\t// catalog-error; callers can inspect the wrapped message.\n\t\tconst message = err instanceof Error ? err.message : String(err);\n\t\tthrow new SurfaceError(\"catalog-error\", message);\n\t}\n}\n","/**\n * Surface: one-shot `input → pipeline → output` (§9.3-core).\n *\n * `runReduction` compiles a {@link GraphSpec}, pushes an input value to a\n * named state node, awaits the first post-push DATA emission on a named\n * output, then disposes the graph. Stateless per call — no graphId, no\n * registry.\n *\n * Named `runReduction` (not `reduce`) to avoid collision with the\n * reactive {@link reduce} operator in `extra/operators.ts`. The MCP tool\n * name (`graphrefly_reduce`) and CLI subcommand (`graphrefly reduce`) use\n * the short form; the library export carries the verb.\n *\n * The subscribe-before-push ordering is deliberate. `graph.set` propagates\n * synchronously for sync derived/operator chains; for async sources\n * (`fromPromise`, `fromAsyncIter`, LLM adapters) the first post-push DATA\n * arrives on a later tick. Subscribing before the push catches both, and\n * skipping the priming push-on-subscribe emission avoids resolving with the\n * stale pre-push cache (spec §2.2).\n *\n * @module\n */\n\nimport { COMPLETE, DATA, ERROR, RESOLVED } from \"../../core/messages.js\";\nimport type { Node } from \"../../core/node.js\";\nimport type { GraphSpec, GraphSpecCatalog } from \"../graphspec.js\";\nimport { createGraph } from \"./create.js\";\nimport { SurfaceError } from \"./errors.js\";\n\n/** Options for {@link reduce}. */\nexport interface ReduceOptions {\n\t/** Fn/source catalog for {@link createGraph}. */\n\tcatalog?: GraphSpecCatalog;\n\t/** Path of the state node that receives the input. Default `\"input\"`. */\n\tinputPath?: string;\n\t/** Path of the node whose first post-push DATA is the result. Default `\"output\"`. */\n\toutputPath?: string;\n\t/** Hard deadline in milliseconds. Default `30_000`. */\n\ttimeoutMs?: number;\n}\n\nconst DEFAULT_TIMEOUT_MS = 30_000;\n\n/**\n * Run a spec as a one-shot reduction: `input → graph → output`.\n *\n * Resolves on the first `[DATA, v]` **or** `[RESOLVED]` emitted by\n * `outputPath` after the input push. The RESOLVED path handles spec\n * §1.3.3 equals-substitution (output recomputed to a value equal to its\n * cache, so the graph skips the DATA push) by returning `outputNode.cache`\n * — the caller always gets the settled value, never hangs on idempotent\n * inputs.\n *\n * @throws {SurfaceError} `invalid-spec` / `catalog-error` (propagated from\n *   {@link createGraph}), `node-not-found` when `inputPath`/`outputPath`\n *   can't be resolved, `reduce-timeout` when `timeoutMs` elapses without\n *   a post-push emission, or the ERROR payload from the graph re-thrown\n *   as `internal-error`.\n */\nexport async function runReduction(\n\tspec: GraphSpec,\n\tinput: unknown,\n\topts?: ReduceOptions,\n): Promise<unknown> {\n\tconst inputPath = opts?.inputPath ?? \"input\";\n\tconst outputPath = opts?.outputPath ?? \"output\";\n\tconst timeoutMs = opts?.timeoutMs ?? DEFAULT_TIMEOUT_MS;\n\n\tconst graph = createGraph(spec, { catalog: opts?.catalog });\n\tlet outputNode: Node<unknown>;\n\ttry {\n\t\toutputNode = graph.resolve(outputPath);\n\t} catch {\n\t\tgraph.destroy();\n\t\tthrow new SurfaceError(\n\t\t\t\"node-not-found\",\n\t\t\t`reduce: output path \"${outputPath}\" is not registered`,\n\t\t\t{ path: outputPath },\n\t\t);\n\t}\n\t// Verify input path exists before we subscribe and push.\n\ttry {\n\t\tgraph.resolve(inputPath);\n\t} catch {\n\t\tgraph.destroy();\n\t\tthrow new SurfaceError(\n\t\t\t\"node-not-found\",\n\t\t\t`reduce: input path \"${inputPath}\" is not registered`,\n\t\t\t{ path: inputPath },\n\t\t);\n\t}\n\n\ttry {\n\t\treturn await new Promise<unknown>((resolve, reject) => {\n\t\t\tlet primed = false;\n\t\t\tlet settled = false;\n\t\t\tlet timer: ReturnType<typeof setTimeout> | undefined;\n\t\t\tlet unsub: (() => void) | undefined;\n\t\t\tlet shouldUnsub = false;\n\n\t\t\tconst finish = (action: () => void): void => {\n\t\t\t\tif (settled) return;\n\t\t\t\tsettled = true;\n\t\t\t\tif (timer !== undefined) clearTimeout(timer);\n\t\t\t\tif (unsub !== undefined) {\n\t\t\t\t\tunsub();\n\t\t\t\t\tunsub = undefined;\n\t\t\t\t} else {\n\t\t\t\t\tshouldUnsub = true;\n\t\t\t\t}\n\t\t\t\taction();\n\t\t\t};\n\n\t\t\tunsub = outputNode.subscribe((msgs) => {\n\t\t\t\tfor (const m of msgs) {\n\t\t\t\t\tif (settled) return;\n\t\t\t\t\t// Skip push-on-subscribe emissions that land before we\n\t\t\t\t\t// trigger the input push — those carry pre-push state.\n\t\t\t\t\tif (!primed) continue;\n\t\t\t\t\tif (m[0] === DATA) {\n\t\t\t\t\t\tfinish(() => resolve(m[1]));\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (m[0] === RESOLVED) {\n\t\t\t\t\t\t// Spec §1.3.3 equals-substitution: the output recomputed to\n\t\t\t\t\t\t// a value equal to its cached value, so the graph emits\n\t\t\t\t\t\t// RESOLVED instead of DATA. For a one-shot reduce the\n\t\t\t\t\t\t// caller wants the output value — read the cache **before**\n\t\t\t\t\t\t// finish() runs unsub (which can trigger lazy deactivation\n\t\t\t\t\t\t// and clear the cache per the RAM-cache rule).\n\t\t\t\t\t\tconst cached = outputNode.cache;\n\t\t\t\t\t\tfinish(() => resolve(cached));\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (m[0] === ERROR) {\n\t\t\t\t\t\tconst payload = m[1];\n\t\t\t\t\t\tconst message = payload instanceof Error ? payload.message : String(payload);\n\t\t\t\t\t\tconst cause = payload instanceof Error ? payload : undefined;\n\t\t\t\t\t\tfinish(() =>\n\t\t\t\t\t\t\treject(\n\t\t\t\t\t\t\t\tnew SurfaceError(\n\t\t\t\t\t\t\t\t\t\"internal-error\",\n\t\t\t\t\t\t\t\t\t`reduce: output emitted ERROR: ${message}`,\n\t\t\t\t\t\t\t\t\tcause != null ? { cause } : undefined,\n\t\t\t\t\t\t\t\t),\n\t\t\t\t\t\t\t),\n\t\t\t\t\t\t);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (m[0] === COMPLETE) {\n\t\t\t\t\t\tfinish(() =>\n\t\t\t\t\t\t\treject(\n\t\t\t\t\t\t\t\tnew SurfaceError(\n\t\t\t\t\t\t\t\t\t\"internal-error\",\n\t\t\t\t\t\t\t\t\t`reduce: output COMPLETEd without a post-push DATA`,\n\t\t\t\t\t\t\t\t),\n\t\t\t\t\t\t\t),\n\t\t\t\t\t\t);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t\tif (shouldUnsub) {\n\t\t\t\tunsub?.();\n\t\t\t\tunsub = undefined;\n\t\t\t}\n\n\t\t\tprimed = true;\n\t\t\ttry {\n\t\t\t\tgraph.set(inputPath, input);\n\t\t\t} catch (err) {\n\t\t\t\tconst message = err instanceof Error ? err.message : String(err);\n\t\t\t\tconst cause = err instanceof Error ? err : undefined;\n\t\t\t\tfinish(() =>\n\t\t\t\t\treject(\n\t\t\t\t\t\tnew SurfaceError(\n\t\t\t\t\t\t\t\"internal-error\",\n\t\t\t\t\t\t\t`reduce: failed to set input on \"${inputPath}\": ${message}`,\n\t\t\t\t\t\t\tcause != null ? { path: inputPath, cause } : { path: inputPath },\n\t\t\t\t\t\t),\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// Synchronous wave may have already settled the promise via the\n\t\t\t// subscribe callback above; skip the timer in that case so we\n\t\t\t// don't leak an orphan setTimeout into the event loop (A1, E4).\n\t\t\tif (!settled && Number.isFinite(timeoutMs) && timeoutMs > 0) {\n\t\t\t\ttimer = setTimeout(() => {\n\t\t\t\t\tfinish(() =>\n\t\t\t\t\t\treject(\n\t\t\t\t\t\t\tnew SurfaceError(\n\t\t\t\t\t\t\t\t\"reduce-timeout\",\n\t\t\t\t\t\t\t\t`reduce: no output emitted within ${timeoutMs}ms`,\n\t\t\t\t\t\t\t\t{ timeoutMs, outputPath },\n\t\t\t\t\t\t\t),\n\t\t\t\t\t\t),\n\t\t\t\t\t);\n\t\t\t\t}, timeoutMs);\n\t\t\t\t// Belt-and-suspenders: if the caller drops the returned promise\n\t\t\t\t// we shouldn't keep the process alive.\n\t\t\t\ttimer.unref?.();\n\t\t\t}\n\t\t});\n\t} finally {\n\t\tgraph.destroy();\n\t}\n}\n","/**\n * Surface: snapshot save/restore/diff/list over {@link StorageTier} (§9.3-core).\n *\n * One-shot snapshot management for stateless callers (MCP tools, CLI\n * commands) layered on the existing multi-tier auto-checkpoint substrate.\n * A saved snapshot is a `mode: \"full\"` {@link GraphCheckpointRecord} with\n * `seq: 0` — byte-identical to the baseline anchor\n * {@link Graph.attachStorage} writes on its first flush. An\n * auto-checkpointed graph can therefore be restored through this surface,\n * and a surface-saved snapshot can be picked up by `attachStorage({\n * autoRestore: true })`.\n *\n * The wire envelope stays at {@link SNAPSHOT_WIRE_VERSION}; no new format.\n *\n * @module\n */\n\nimport { wallClockNs } from \"../../core/clock.js\";\nimport type { StorageTier } from \"../../extra/storage.js\";\nimport type {\n\tGraphCheckpointRecord,\n\tGraphDiffResult,\n\tGraphNodeFactory,\n\tGraphPersistSnapshot,\n} from \"../../graph/graph.js\";\nimport { Graph, SNAPSHOT_VERSION } from \"../../graph/graph.js\";\nimport { SurfaceError } from \"./errors.js\";\n\n/**\n * Current envelope version. Re-exported from `graph.ts` so the one-shot\n * surface path and `Graph.attachStorage` write byte-identical\n * `format_version` fields — no silent wire drift.\n */\nexport const SNAPSHOT_WIRE_VERSION = SNAPSHOT_VERSION;\n\n/** Shape returned by {@link saveSnapshot}. */\nexport interface SaveSnapshotResult {\n\tsnapshotId: string;\n\ttimestamp_ns: number;\n}\n\n/** Options for {@link restoreSnapshot}. */\nexport interface RestoreSnapshotOptions {\n\t/** Passthrough to `Graph.fromSnapshot`. First matching pattern wins. */\n\tfactories?: Record<string, GraphNodeFactory>;\n}\n\nfunction unwrapCheckpoint(raw: unknown, snapshotId: string): GraphPersistSnapshot {\n\tif (raw == null || typeof raw !== \"object\") {\n\t\tthrow new SurfaceError(\"snapshot-not-found\", `snapshot \"${snapshotId}\" not found in tier`, {\n\t\t\tsnapshotId,\n\t\t});\n\t}\n\t// Accept both wrapped (GraphCheckpointRecord) and bare\n\t// (GraphPersistSnapshot) payloads — attachStorage writes wrapped, a user\n\t// may also hand us a bare one via dictStorage for tests.\n\tconst record = raw as Record<string, unknown>;\n\tif (\"mode\" in record) {\n\t\tif (record.mode === \"full\" && \"snapshot\" in record) {\n\t\t\treturn record.snapshot as GraphPersistSnapshot;\n\t\t}\n\t\tif (record.mode === \"diff\") {\n\t\t\tthrow new SurfaceError(\n\t\t\t\t\"restore-failed\",\n\t\t\t\t`snapshot \"${snapshotId}\" is a diff record; restore the baseline and replay WAL instead`,\n\t\t\t\t{ snapshotId, mode: \"diff\" },\n\t\t\t);\n\t\t}\n\t\tthrow new SurfaceError(\n\t\t\t\"restore-failed\",\n\t\t\t`snapshot \"${snapshotId}\" has unknown mode \"${String(record.mode)}\"`,\n\t\t\t{ snapshotId, mode: String(record.mode) },\n\t\t);\n\t}\n\tif (\"nodes\" in record && \"edges\" in record && \"subgraphs\" in record && \"name\" in record) {\n\t\treturn record as unknown as GraphPersistSnapshot;\n\t}\n\tthrow new SurfaceError(\n\t\t\"restore-failed\",\n\t\t`snapshot \"${snapshotId}\" payload is not a GraphCheckpointRecord or GraphPersistSnapshot`,\n\t\t{ snapshotId },\n\t);\n}\n\n/**\n * Write a graph's current state as a one-shot `mode: \"full\"` record.\n *\n * Uses the same {@link GraphCheckpointRecord} envelope as\n * {@link Graph.attachStorage} so the two persistence paths interoperate.\n *\n * @throws {SurfaceError} `snapshot-failed` when the tier's `save` throws.\n */\nexport async function saveSnapshot(\n\tgraph: Graph,\n\tsnapshotId: string,\n\ttier: StorageTier,\n): Promise<SaveSnapshotResult> {\n\tlet snapshot: GraphPersistSnapshot;\n\ttry {\n\t\tsnapshot = graph.snapshot();\n\t} catch (err) {\n\t\tconst message = err instanceof Error ? err.message : String(err);\n\t\tthrow new SurfaceError(\n\t\t\t\"snapshot-failed\",\n\t\t\t`snapshot \"${snapshotId}\" serialization failed: ${message}`,\n\t\t\t{ snapshotId },\n\t\t);\n\t}\n\tconst record: GraphCheckpointRecord = {\n\t\tmode: \"full\",\n\t\tseq: 0,\n\t\ttimestamp_ns: wallClockNs(),\n\t\tformat_version: SNAPSHOT_WIRE_VERSION,\n\t\tsnapshot,\n\t};\n\ttry {\n\t\tawait tier.save(snapshotId, record);\n\t} catch (err) {\n\t\tconst message = err instanceof Error ? err.message : String(err);\n\t\tthrow new SurfaceError(\"snapshot-failed\", `snapshot \"${snapshotId}\" save failed: ${message}`, {\n\t\t\tsnapshotId,\n\t\t});\n\t}\n\treturn { snapshotId, timestamp_ns: record.timestamp_ns };\n}\n\n/**\n * Load a snapshot from a tier and materialize it as a new {@link Graph}.\n *\n * Uses {@link Graph.fromSnapshot} to reconstruct topology; pass\n * `factories` when the graph includes non-state nodes that the default\n * hydrator can't rebuild on its own.\n *\n * **Requires a `mode: \"full\"` record.** Surface-written snapshots from\n * {@link saveSnapshot} always qualify. Records written by\n * {@link Graph.attachStorage} with `compactEvery > 1` may be\n * `mode: \"diff\"` between compacts — those throw `restore-failed` until\n * the tier's next compact flush (or until Phase 8.7 WAL replay lands).\n * If you need interop during development, either call\n * {@link saveSnapshot} explicitly (always full) or configure\n * `attachStorage({compactEvery: 1})`.\n *\n * @throws {SurfaceError} `snapshot-not-found` on miss; `restore-failed`\n *   when the payload shape doesn't match, when the record is\n *   `mode: \"diff\"`, or when `Graph.fromSnapshot` rejects.\n */\nexport async function restoreSnapshot(\n\tsnapshotId: string,\n\ttier: StorageTier,\n\topts?: RestoreSnapshotOptions,\n): Promise<Graph> {\n\tconst raw = await tier.load(snapshotId);\n\tconst snapshot = unwrapCheckpoint(raw, snapshotId);\n\ttry {\n\t\treturn Graph.fromSnapshot(\n\t\t\tsnapshot,\n\t\t\topts?.factories ? { factories: opts.factories } : undefined,\n\t\t);\n\t} catch (err) {\n\t\tconst message = err instanceof Error ? err.message : String(err);\n\t\tthrow new SurfaceError(\n\t\t\t\"restore-failed\",\n\t\t\t`snapshot \"${snapshotId}\" restore failed: ${message}`,\n\t\t\t{\n\t\t\t\tsnapshotId,\n\t\t\t},\n\t\t);\n\t}\n}\n\n/**\n * Load two snapshots and compute a {@link GraphDiffResult} via static\n * {@link Graph.diff}. Returns the audit shape (structural + value diff,\n * no payload); use {@link diffForWAL} directly for WAL-oriented diffs.\n *\n * @throws {SurfaceError} `snapshot-not-found` on either miss.\n */\nexport async function diffSnapshots(\n\tsnapshotIdA: string,\n\tsnapshotIdB: string,\n\ttier: StorageTier,\n): Promise<GraphDiffResult> {\n\tconst [rawA, rawB] = await Promise.all([tier.load(snapshotIdA), tier.load(snapshotIdB)]);\n\tconst snapshotA = unwrapCheckpoint(rawA, snapshotIdA);\n\tconst snapshotB = unwrapCheckpoint(rawB, snapshotIdB);\n\treturn Graph.diff(snapshotA, snapshotB);\n}\n\n/**\n * Enumerate snapshot ids on a tier.\n *\n * **Scope caveat:** returns every key on the tier, not just those\n * written by {@link saveSnapshot}. When the same tier also backs\n * {@link Graph.attachStorage} (for auto-checkpoints keyed by\n * `graph.name`), those names appear in this list too. Wrappers that\n * want a namespaced snapshot store should use a dedicated tier or\n * encode an id prefix on write. Tracked in `docs/optimizations.md`\n * under \"surface `listSnapshots` namespacing\".\n *\n * @throws {SurfaceError} `tier-no-list` when the tier does not implement\n *   the optional `list()` method. Check `typeof tier.list === \"function\"`\n *   before calling if you want to branch on capability.\n */\nexport async function listSnapshots(tier: StorageTier): Promise<readonly string[]> {\n\tif (typeof tier.list !== \"function\") {\n\t\tthrow new SurfaceError(\n\t\t\t\"tier-no-list\",\n\t\t\t\"StorageTier does not implement list(); wrap the tier with an enumerator or use a different backend\",\n\t\t);\n\t}\n\treturn tier.list();\n}\n\n/**\n * Delete a snapshot from a tier.\n *\n * Silent on miss (clear semantics). `tier.clear` is optional — throws\n * `snapshot-failed` when the tier is append-only.\n *\n * @throws {SurfaceError} `snapshot-failed` when `clear` is unsupported\n *   or throws.\n */\nexport async function deleteSnapshot(snapshotId: string, tier: StorageTier): Promise<void> {\n\tif (typeof tier.clear !== \"function\") {\n\t\tthrow new SurfaceError(\n\t\t\t\"snapshot-failed\",\n\t\t\t`StorageTier is append-only (no clear()); cannot delete \"${snapshotId}\"`,\n\t\t\t{ snapshotId },\n\t\t);\n\t}\n\ttry {\n\t\tawait tier.clear(snapshotId);\n\t} catch (err) {\n\t\tconst message = err instanceof Error ? err.message : String(err);\n\t\tthrow new SurfaceError(\n\t\t\t\"snapshot-failed\",\n\t\t\t`snapshot \"${snapshotId}\" delete failed: ${message}`,\n\t\t\t{\n\t\t\t\tsnapshotId,\n\t\t\t},\n\t\t);\n\t}\n}\n","/**\n * GraphRefly — public API surface.\n */\nexport const version = \"0.0.0\";\n\nexport * from \"./compat/index.js\";\nexport * as compat from \"./compat/index.js\";\n// Named re-exports enable finer-grained tree-shaking for consumers.\nexport * from \"./core/index.js\";\n// Keep namespace exports for ergonomic grouped imports.\nexport * as core from \"./core/index.js\";\nexport * from \"./extra/index.js\";\nexport * as extra from \"./extra/index.js\";\nexport * from \"./graph/index.js\";\nexport * as graph from \"./graph/index.js\";\nexport * from \"./patterns/index.js\";\nexport * as patterns from \"./patterns/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAqCA,SAAS,SAAS,MAAc,MAAyD;AACxF,SAAO,WAAW,aAAa,MAAM,IAAI;AAC1C;AAyCO,SAAS,SACf,MACA,QACA,OACA,MACQ;AACR,QAAM,IAAI,IAAI,MAAM,MAAM,IAAI;AAE9B,IAAE,IAAI,UAAU,MAAuB;AACvC,QAAM,YAAY,MAAsC,OAAO;AAAA,IAC9D,MAAM,SAAS,gBAAgB;AAAA,EAChC,CAAC;AACD,IAAE,IAAI,SAAS,SAA0B;AAEzC,aAAW,QAAQ,OAAO;AACzB,eAAW,GAAG,QAAQ,WAAW,IAAI;AAAA,EACtC;AAEA,SAAO;AACR;AAEA,SAAS,WACR,OACA,QACA,WACA,MACO;AACP,QAAM,aAAa,UAAU,KAAK,IAAI;AAetC,QAAM,WAA0B,uBAAO,SAAS;AAChD,MAAI,cAAc;AAClB,MAAI,aAAa;AACjB,MAAI,eAAe;AACnB,MAAI,cAAmC;AACvC,MAAI,eAAe;AAInB,MAAI,cAA8C,UAAU,SAAS,CAAC;AAEtE,WAAS,QAAQ,SAA4B;AAC5C,QAAI,cAAc;AACjB,qBAAe;AACf,YAAM,QAAQ;AACd,oBAAc;AACd,UAAI,UAAU,UAAU;AAEvB,cAAM,cAAc,YAAY,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,IAAI;AAChE,YAAI,UAAU;AACd,YAAI;AACH,oBAAU,aAAa,SAAS,KAAK,KAAK;AAAA,QAC3C,QAAQ;AACP,oBAAU;AAAA,QACX;AACA,YAAI,SAAS;AACZ,yBAAe;AACf,kBAAQ,KAAK,KAAK;AAAA,QACnB,OAAO;AACN,cAAI,cAAc;AACjB,2BAAe;AACf,oBAAQ,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,QAAQ,CAAC,CAAC;AAAA,UACnC;AAAA,QACD;AAAA,MACD,OAAO;AAEN,YAAI,cAAc;AACjB,yBAAe;AACf,kBAAQ,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,QAAQ,CAAC,CAAC;AAAA,QACnC,OAAO;AACN,kBAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QAC1B;AAAA,MACD;AAAA,IACD;AAAA,EAED;AAIA,QAAM,aAAa;AAAA,IAClB,CAAC;AAAA,IACD,CAAC,OAAO,kBAAkB;AACzB,YAAM,WAAY,OAAgB,UAAU,CAAC,SAAS;AACrD,mBAAW,OAAO,MAAM;AACvB,iCAAuB,KAAK,GAAG,aAAa;AAAA,QAC7C;AAAA,MACD,CAAC;AACD,YAAM,aAAc,UAAmB,UAAU,CAAC,SAAS;AAC1D,mBAAW,OAAO,MAAM;AACvB,iCAAuB,KAAK,GAAG,aAAa;AAAA,QAC7C;AAAA,MACD,CAAC;AACD,aAAO,MAAM;AACZ,iBAAS;AACT,mBAAW;AAAA,MACZ;AAAA,IACD;AAAA,IACA;AAAA,MACC,cAAc;AAAA,MACd,MAAM,SAAS,mBAAmB,EAAE,QAAQ,KAAK,KAAK,CAAC;AAAA,MACvD,0BAA0B;AAAA,IAC3B;AAAA,EACD;AAEA,WAAS,uBAAuB,KAAc,UAAkB,SAA+B;AAC9F,UAAM,IAAI,IAAI,CAAC;AAGf,QAAI,MAAM,OAAO;AAChB,UAAI,aAAa,GAAG;AACnB,sBAAc;AACd,uBAAe;AAAA,MAChB,OAAO;AACN,qBAAa;AAAA,MACd;AACA,aAAO;AAAA,IACR;AAGA,QAAI,MAAM,QAAQ,MAAM,UAAU;AACjC,UAAI,aAAa,GAAG;AACnB,sBAAc;AACd,uBAAe;AACf,sBAAc,MAAM,OAAQ,IAAI,CAAC,IAAU;AAAA,MAC5C,OAAO;AAEN,YAAI,MAAM,MAAM;AACf,wBAAc,IAAI,CAAC;AAAA,QACpB;AACA,qBAAa;AAAA,MACd;AAGA,UAAI,eAAe,WAAY,QAAO;AAEtC,cAAQ,OAAO;AACf,aAAO;AAAA,IACR;AAGA,QAAI,MAAM,YAAY,MAAM,SAAS,MAAM,UAAU;AACpD,oBAAc;AACd,mBAAa;AACb,qBAAe;AACf,oBAAc;AACd,qBAAe;AACf,UAAI,aAAa,GAAG;AACnB,gBAAQ,KAAK,CAAC,GAAG,CAAC;AAAA,MACnB;AAEA,aAAO;AAAA,IACR;AAGA,QAAI,aAAa,EAAG,QAAO;AAE3B,WAAO;AAAA,EACR;AAEA,QAAM,IAAI,YAAY,UAA2B;AAGjD,MAAI,KAAK,KAAK;AACb,UAAM,cAAc,KAAK,IAAI,UAAU;AACvC,UAAM,kBAAkB,UAAU,KAAK,IAAI;AAC3C,UAAM,IAAI,iBAAiB,WAA4B;AAAA,EACxD;AACD;AAkCO,SAAS,OACf,MACA,SACA,QACA,MACQ;AACR,MAAI,QAAQ,WAAW,EAAG,OAAM,IAAI,WAAW,qCAAqC;AACpF,MAAI,OAAO,WAAW,EAAG,OAAM,IAAI,WAAW,oCAAoC;AAElF,QAAM,IAAI,IAAI,MAAM,MAAM,IAAI;AAG9B,QAAM,SAAS,QAAQ,WAAW,IAAI,QAAQ,CAAC,IAAI,MAAM,GAAI,OAAgC;AAC7F,IAAE,IAAI,UAAU,MAAuB;AAMvC,MAAI,iBAAiB;AACrB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACvC,UAAM,QAAQ,OAAO,CAAC;AACtB,UAAM,MAAM,IAAI,MAAM,MAAM,IAAI;AAChC,UAAM,MAAM,GAAG;AAGf,QAAI;AACH,UAAI,QAAQ,OAAO;AAAA,IACpB,QAAQ;AACP,YAAM,IAAI,MAAM,iBAAiB,MAAM,IAAI,+BAA+B;AAAA,IAC3E;AACA,QAAI;AACH,UAAI,QAAQ,QAAQ;AAAA,IACrB,QAAQ;AACP,YAAM,IAAI,MAAM,iBAAiB,MAAM,IAAI,gCAAgC;AAAA,IAC5E;AAEA,MAAE,MAAM,MAAM,MAAM,GAAG;AAKvB,UAAM,WAAW,EAAE,QAAQ,cAAc;AACzC,UAAM,iBAAiB,GAAG,MAAM,IAAI;AACpC,UAAM,aAAa,EAAE,QAAQ,cAAc;AAC3C,UAAM,aAAa,YAAY,cAAc,SAAI,MAAM,IAAI;AAC3D,UAAM,KAAK;AAAA,MACV,CAAC,QAAQ;AAAA,MACT,CAAC,CAAC,IAAI,MAAM;AACX,mBAAW,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;AAAA,MAC/B;AAAA,MACA,EAAE,MAAM,WAAW;AAAA,IACpB;AACA,MAAE,IAAI,YAAY,EAAmB;AACrC,MAAE,YAAY,UAAU,EAAE,CAAC;AAE3B,qBAAiB,GAAG,MAAM,IAAI;AAAA,EAC/B;AAEA,SAAO;AACR;AAiCO,SAAS,SACf,OACA,WACA,SACA,MACQ;AACR,QAAM,UAAU,MAAM,iBAAiB;AAIvC,QAAM,cAAc,cAAc,SAAS;AAC3C,QAAM,UAAU,MAAc,GAAG;AAAA,IAChC,MAAM,SAAS,oBAAoB;AAAA,MAClC,eAAe;AAAA,MACf,cAAc;AAAA,MACd,YAAY;AAAA,IACb,CAAC;AAAA,EACF,CAAC;AACD,QAAM,IAAI,aAAa,OAAwB;AAG/C,QAAM,WAAW,MAAM,QAAQ,SAAS;AACxC,QAAM,cAAc,MAAM,QAAQ,OAAO;AAOzC,QAAM,qBAAqB,qBAAqB,SAAS;AACzD,QAAM,iBAAiB;AAAA,IACtB,CAAC;AAAA,IACD,CAAC,OAAO,qBAAqB;AAC5B,YAAM,QAAQ,SAAS,UAAU,CAAC,SAAS;AAC1C,mBAAW,OAAO,MAAM;AACvB,gBAAM,IAAI,IAAI,CAAC;AACf,cAAI,MAAM,MAAM;AACf,kBAAM,YAAY,IAAI,CAAC;AACvB,gBAAI,aAAa,KAAM;AACvB,kBAAM,MAAM;AACX,kBAAI,oBAAoB,SAAS,OAAO,GAAG;AAC1C,4BAAY,KAAK,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC;AAAA,cACrC;AAAA,YACD,CAAC;AAAA,UACF,WAAW,MAAM,YAAY,MAAM,OAAO;AACzC,kBAAM,WAAoB,MAAM,SAAS,IAAI,SAAS,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;AAC9E,oBAAQ,KAAK,CAAC,QAAQ,CAAC;AAAA,UACxB;AAAA,QACD;AAAA,MACD,CAAC;AACD,aAAO,MAAM,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,MACC,MAAM;AAAA,MACN,cAAc;AAAA,MACd,MAAM;AAAA,QACL,GAAG,SAAS,mBAAmB;AAAA,UAC9B,cAAc;AAAA,UACd,YAAY;AAAA,QACb,CAAC;AAAA,QACD,WAAW;AAAA,MACZ;AAAA,IACD;AAAA,EACD;AACA,QAAM,IAAI,oBAAoB,cAA+B;AAC7D,QAAM,YAAY,UAAU,cAAc,CAAC;AAE3C,SAAO;AACR;AAiCO,SAAS,WACf,QACA,aACA,MACU;AACV,MAAI,YAAY,WAAW,EAAG,OAAM,IAAI,WAAW,6CAA6C;AAEhG,QAAM,kBAAkB,YAAY,IAAI,CAAC,MAAM,EAAE,IAAI;AACrD,QAAM,UAAU,CAAC,QAAgB,GAAG,eAAe;AAEnD,MAAIA,UAAc,CAAC;AACnB,MAAI,SAAS;AACb,MAAI,kBAAkB;AACtB,QAAM,SAAS,uBAAO,aAAa;AAQnC,QAAM,eAA0B,IAAI,MAAM,YAAY,MAAM;AAE5D,WAAS,cAAuB;AAC/B,WAAO,YAAY,MAAM,CAAC,GAAG,MAAM,EAAE,MAAM,aAAa,CAAC,CAAC,CAAC;AAAA,EAC5D;AAEA,WAAS,YAAY,SAA4B;AAChD,WAAOA,QAAO,SAAS,KAAK,YAAY,GAAG;AAC1C,YAAM,OAAOA,QAAO,CAAC;AACrB,MAAAA,UAASA,QAAO,MAAM,CAAC;AACvB,cAAQ,KAAK,IAAI;AAAA,IAClB;AAEA,QAAIA,QAAO,WAAW,KAAK,iBAAiB;AAC3C,wBAAkB;AAClB,cAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,IAC1B;AAAA,EACD;AAIA,SAAO;AAAA,IACN,CAAC;AAAA,IACD,CAAC,OAAO,gBAAgB;AAIvB,eAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC5C,qBAAa,CAAC,IAAI,YAAY,CAAC,EAAG,KAAK;AAAA,MACxC;AACA,YAAM,SAA4B,CAAC;AACnC,eAAS,SAAS,GAAG,SAAS,QAAQ,QAAQ,UAAU;AACvD,cAAM,MAAM,QAAQ,MAAM;AAC1B,eAAO;AAAA,UACN,IAAI,UAAU,CAAC,SAAS;AACvB,uBAAW,OAAO,MAAM;AACvB,mCAAqB,KAAK,QAAQ,WAAW;AAAA,YAC9C;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AACA,aAAO,MAAM;AACZ,mBAAW,KAAK,OAAQ,GAAE;AAAA,MAC3B;AAAA,IACD;AAAA,IACA;AAAA,MACC,GAAG;AAAA,MACH,cAAc;AAAA,MACd,MAAM,SAAS,eAAe,MAAM,IAAI;AAAA,IACzC;AAAA,EACD;AAEA,WAAS,qBAAqB,KAAc,UAAkB,SAA+B;AAC5F,UAAM,IAAI,IAAI,CAAC;AAGf,QAAI,aAAa,GAAG;AACnB,UAAI,MAAM,MAAM;AACf,YAAI,YAAY,KAAKA,QAAO,WAAW,GAAG;AACzC,kBAAQ,KAAK,IAAI,CAAC,CAAM;AAAA,QACzB,OAAO;AACN,UAAAA,QAAO,KAAK,IAAI,CAAC,CAAM;AACvB,cAAI,CAAC,QAAQ;AACZ,qBAAS;AACT,oBAAQ,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC;AAAA,UAC7B;AAAA,QACD;AACA,eAAO;AAAA,MACR;AACA,UAAI,MAAM,OAAO;AAChB,gBAAQ,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;AACtB,eAAO;AAAA,MACR;AACA,UAAI,MAAM,UAAU;AACnB,YAAIA,QAAO,WAAW,GAAG;AACxB,kBAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAAA,QAC1B,OAAO;AAEN,4BAAkB;AAAA,QACnB;AACA,eAAO;AAAA,MACR;AACA,UAAI,MAAM,YAAY,MAAM,OAAO;AAElC,mBAAW,QAAQA,SAAQ;AAC1B,kBAAQ,KAAK,IAAI;AAAA,QAClB;AACA,QAAAA,UAAS,CAAC;AACV,0BAAkB;AAElB,YAAI,QAAQ;AACX,mBAAS;AACT,kBAAQ,GAAG,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,QAC9B;AACA,gBAAQ,KAAK,CAAC,GAAG,CAAC;AAClB,eAAO;AAAA,MACR;AACA,aAAO;AAAA,IACR;AAGA,QAAI,MAAM,MAAM;AACf,mBAAa,WAAW,CAAC,IAAI,IAAI,CAAC;AAAA,IACnC;AACA,QAAI,MAAM,QAAQ,MAAM,UAAU;AACjC,UAAI,YAAY,KAAKA,QAAO,SAAS,GAAG;AACvC,oBAAY,OAAO;AACnB,YAAIA,QAAO,WAAW,KAAK,QAAQ;AAClC,mBAAS;AACT,kBAAQ,GAAG,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,QAC9B;AAAA,MACD,WAAW,CAAC,YAAY,KAAK,CAAC,UAAUA,QAAO,SAAS,GAAG;AAC1D,iBAAS;AACT,gBAAQ,GAAG,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC;AAAA,MAC7B;AACA,aAAO;AAAA,IACR;AACA,QAAI,MAAM,OAAO;AAEhB,aAAO;AAAA,IACR;AACA,QAAI,MAAM,OAAO;AAEhB,cAAQ,KAAK,CAAC,GAAG,CAAC;AAClB,aAAO;AAAA,IACR;AACA,QAAI,MAAM,UAAU;AAEnB,aAAO;AAAA,IACR;AAEA,WAAO;AAAA,EACR;AACD;AAqCO,SAAS,OACf,SACA,SACA,MAC6B;AAC7B,MAAI,QAAQ,WAAW,EAAG,OAAM,IAAI,WAAW,qCAAqC;AACpF,MAAI,QAAQ,WAAW,QAAQ,QAAQ;AACtC,UAAM,IAAI,WAAW,wDAAwD;AAAA,EAC9E;AAEA,QAAM,UAAU,CAAC,GAAI,SAA+B,GAAI,OAA6B;AACrF,QAAM,IAAI,QAAQ;AAClB,QAAM,WAAW,MAAM;AAEvB,SAAO;AAAA,IACN;AAAA,IACA,CAAC,SAAS;AACT,YAAM,UAAU,KAAK,MAAM,GAAG,CAAC;AAC/B,YAAM,eAAe,KAAK,MAAM,CAAC;AAEjC,YAAM,YAAsB,CAAC;AAC7B,UAAI,aAAa;AAEjB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,cAAM,MAAM,QAAQ,CAAC,KAAK;AAC1B,cAAM,KAAK,aAAa,CAAC,KAAK;AAC9B,cAAM,WAAW,WAAW,CAAC,IAAI,SAAS,CAAC,EAAE,GAAG,IAAI;AACpD,cAAM,WAAY,WAAsB;AACxC,kBAAU,KAAK,QAAQ;AACvB,sBAAc;AAAA,MACf;AAEA,aAAO;AAAA,QACN,OAAO;AAAA,QACP,OAAO;AAAA,QACP;AAAA,MACD;AAAA,IACD;AAAA,IACA;AAAA,MACC,GAAI,OACD;AAAA,QACA,QAAQ,KAAK;AAAA,QACb,gBAAgB,KAAK;AAAA,QACrB,iBAAiB,KAAK;AAAA,MACvB,IACC,CAAC;AAAA,MACJ,cAAc;AAAA,MACd,MAAM,SAAS,UAAU,MAAM,IAAI;AAAA,IACpC;AAAA,EACD;AACD;AAmDO,SAAS,qBACf,MAC6B;AAC7B,QAAM,OAAO,YAAwC;AAAA,IACpD,MAAM,MAAM,QAAQ;AAAA,EACrB,CAAC;AAED,QAAM,WAAW;AAAA,IAChB,CAAC,KAAK,OAAO;AAAA,IACb,CAAC,CAAC,OAAO,MAAM;AACd,aAAO,IAAI,IAAI,OAAkD;AAAA,IAClE;AAAA,IACA;AAAA,MACC,MAAM,GAAG,MAAM,QAAQ,eAAe;AAAA,MACtC,QAAQ,CAAC,GAAG,MAAM;AACjB,cAAM,KAAK;AACX,cAAM,KAAK;AACX,YAAI,GAAG,SAAS,GAAG,KAAM,QAAO;AAChC,mBAAW,CAAC,GAAG,CAAC,KAAK,IAAI;AACxB,gBAAM,KAAK,GAAG,IAAI,CAAC;AACnB,cAAI,CAAC,MAAM,EAAE,aAAa,GAAG,YAAY,EAAE,cAAc,GAAG,UAAW,QAAO;AAAA,QAC/E;AACA,eAAO;AAAA,MACR;AAAA,IACD;AAAA,EACD;AAEA,WAAS,OAAO,KAAa,SAAwB;AACpD,UAAM,WAAW,KAAK,IAAI,GAAG;AAC7B,UAAM,YAAY,UAAU,YAAY,KAAK;AAC7C,UAAM,aAAa,UAAU,aAAa,MAAM,UAAU,IAAI;AAC9D,SAAK,IAAI,KAAK;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,YAAY;AAAA,IAC1B,CAAC;AAAA,EACF;AAEA,WAAS,OAAO,KAA6C;AAC5D,WAAO,KAAK,IAAI,GAAG;AAAA,EACpB;AAEA,QAAM,SAAS,UAAU,QAAQ;AAEjC,SAAO;AAAA,IACN,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA,SAAS,MAAM,OAAO;AAAA,EACvB;AACD;;;ADjyBA,SAASC,UAAS,MAAc,OAA0D;AACzF,SAAO,WAAW,mBAAmB,MAAM,KAAK;AACjD;AA2DO,SAAS,mBAAmB,MAAc,MAAwC;AACxF,QAAM,IAAI,IAAI,MAAM,MAAM,IAAI;AAG9B,IAAE,IAAI,UAAU,KAAK,MAAM;AAG3B,QAAM,kBAAyC;AAAA,IAC9C,EAAE,MAAM,UAAU,UAAU,CAAC,MAAM,SAAS,GAAG,OAAO,EAAE;AAAA,IACxD,EAAE,MAAM,UAAU,UAAU,CAAC,MAAM,SAAS,GAAG,OAAO,EAAE;AAAA,IACxD,EAAE,MAAM,WAAW,UAAU,CAAC,MAAM,SAAS,GAAG,QAAQ,EAAE;AAAA,EAC3D;AACA,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,QAAiC,SAAS,IAAI,CAAC,OAAO;AAAA,IAC3D,MAAM,EAAE;AAAA,IACR,UAAU,EAAE;AAAA,EACb,EAAE;AACF,QAAM,QAAQ,SAAS,YAAY,KAAK,QAAQ,KAAK;AACrD,IAAE,MAAM,YAAY,KAAK;AAOzB,QAAM,cAAc,SAAS,IAAI,CAAC,MAAM;AACvC,QAAI;AACH,YAAM,MAAM,EAAE,QAAQ,oBAAoB,EAAE,IAAI,EAAE;AAClD,aAAO,QAAQ,CAAC,GAAW,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,SAAS,KAAK,CAAC;AAAA,IAC5D,QAAQ;AACP,aAAO,MAAe,IAAI;AAAA,IAC3B;AAAA,EACD,CAAC;AACD,QAAM,cAAc,KAAK,cAAc,CAAC,SAAoB;AAC5D,QAAM,gBAAgB;AAAA,IACrB;AAAA,IACA,CAAC,SAAS,YAAY,IAAiB;AAAA,IACvC;AAAA,MACC,MAAMA,UAAS,iBAAiB,EAAE,OAAO,YAAY,CAAC;AAAA,IACvD;AAAA,EACD;AACA,IAAE,IAAI,aAAa,aAAa;AAGhC,QAAM,aAAa,KAAK,aAAa,OAAO,EAAE,MAAM,KAAK;AACzD,QAAM,WAAW,QAAiB,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,CAAC,GAAG;AAAA,IACrE,MAAMA,UAAS,iBAAiB,EAAE,OAAO,YAAY,CAAC;AAAA,EACvD,CAAC;AACD,QAAM,cAAc,QAAiB,CAAC,QAAQ,GAAG,CAAC,SAAS,WAAW,KAAK,CAAC,CAAC,GAAG;AAAA,IAC/E,MAAMA,UAAS,iBAAiB,EAAE,OAAO,eAAe,CAAC;AAAA,EAC1D,CAAC;AACD,IAAE,IAAI,aAAa,QAAQ;AAC3B,IAAE,IAAI,gBAAgB,WAAW;AAGjC,QAAM,eAAe,KAAK,WAAW,SAAS,IAAI,MAAM,CAAC;AACzD,QAAM,cAAc,YAAY;AAAA,IAAI,CAAC,OACpC,QAAgB,CAAC,EAAE,GAAG,CAAC,SAAU,KAAK,CAAC,KAAK,OAAO,IAAI,CAAE;AAAA,EAC1D;AACA,QAAM,cAAc,aAAa,IAAI,CAAC,MAAM,MAAc,CAAC,CAAC;AAC5D,WAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC5C,MAAE,IAAI,YAAY,CAAC,IAAI,YAAY,CAAC,CAAkB;AACtD,MAAE,IAAI,YAAY,CAAC,IAAI,YAAY,CAAC,CAAkB;AAAA,EACvD;AACA,QAAM,SAAS;AAAA,IACd;AAAA,IACA;AAAA,EACD;AACA,IAAE,IAAI,UAAU,MAAuB;AAGvC,QAAM,SAAS;AAAA,IACd,CAAC,QAAgB,WAAW;AAAA,IAC5B,CAAC,UAAU;AAAA,MACV,QAAQ,KAAK,CAAC;AAAA,MACd,KAAK,KAAK,CAAC;AAAA,IACZ;AAAA,IACA;AAAA,MACC,MAAMA,UAAS,iBAAiB,EAAE,OAAO,SAAS,CAAC;AAAA,IACpD;AAAA,EACD;AACA,IAAE,IAAI,UAAU,MAAM;AAItB,QAAM,YAAY,MAAe,MAAM;AAAA,IACtC,MAAMA,UAAS,iBAAiB,EAAE,OAAO,mBAAmB,CAAC;AAAA,EAC9D,CAAC;AACD,IAAE,IAAI,oBAAoB,SAAS;AACnC,QAAM,cAAc;AAAA,IACnB,CAAC,WAAW;AAAA,IACZ,CAAC,SAAS;AACT,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,UAAU,OAAO,SAAS,MAAO,QAAO;AAC5C,aAAO;AAAA,IACR;AAAA,IACA;AAAA,MACC,MAAMA,UAAS,iBAAiB,EAAE,OAAO,qBAAqB,CAAC;AAAA,IAChE;AAAA,EACD;AACA,IAAE,IAAI,sBAAsB,WAA4B;AACxD,WAAS,GAAG,sBAAsB,oBAAoB;AAAA,IACrD,eAAe,KAAK,yBAAyB;AAAA,EAC9C,CAAC;AAED,SAAO;AACR;AA0DO,SAAS,kBAAkB,MAAc,MAAuC;AACtF,QAAM,IAAI,IAAI,MAAM,MAAM,IAAI;AAG9B,IAAE,IAAI,UAAU,KAAK,MAAM;AAG3B,MAAI,gBAAgB;AACpB,QAAM,iBAAiB,CAAC,SAAkC;AAAA,IACzD,IAAI,SAAS,EAAE,aAAa;AAAA,IAC5B,OAAO,OAAO,GAAG;AAAA,IACjB,UAAU;AAAA,IACV,QAAQ;AAAA,IACR;AAAA,EACD;AACA,QAAM,YAAY,KAAK,WAAW;AAClC,QAAM,cAAc,QAAwB,CAAC,KAAK,MAAM,GAAG,CAAC,SAAS,UAAU,KAAK,CAAC,CAAC,GAAG;AAAA,IACxF,MAAMA,UAAS,iBAAiB,EAAE,OAAO,UAAU,CAAC;AAAA,EACrD,CAAC;AACD,IAAE,IAAI,WAAW,WAA4B;AAG7C,QAAM,WAAW,KAAK,WAAW,OAAO,EAAE,OAAO,KAAK;AACtD,QAAM,aAAa;AAAA,IAClB,CAAC,WAAmB;AAAA,IACpB,CAAC,SAAS;AACT,YAAM,QAAQ,KAAK,CAAC;AACpB,aAAO,EAAE,OAAO,cAAc,SAAS,KAAK,EAAE;AAAA,IAC/C;AAAA,IACA;AAAA,MACC,MAAMA,UAAS,iBAAiB,EAAE,OAAO,SAAS,CAAC;AAAA,IACpD;AAAA,EACD;AACA,IAAE,IAAI,UAAU,UAAU;AAG1B,QAAM,gBAAgB,MAAiB,CAAC,GAAG;AAAA,IAC1C,MAAMA,UAAS,iBAAiB,EAAE,OAAO,iBAAiB,CAAC;AAAA,EAC5D,CAAC;AACD,IAAE,IAAI,kBAAkB,aAA8B;AAGtD,QAAM,WAAW,KAAK,qBAAqB,OAAO,EAAE,YAAY,MAAM;AACtE,QAAM,iBAAiB;AAAA,IACtB,CAAC,aAAqB,aAAqB;AAAA,IAC3C,CAAC,SAAS;AACT,YAAM,QAAQ,KAAK,CAAC;AACpB,YAAM,QAAQ,KAAK,CAAC;AACpB,aAAO,EAAE,OAAO,YAAY,SAAS,OAAO,KAAK,EAAE;AAAA,IACpD;AAAA,IACA,EAAE,MAAMA,UAAS,iBAAiB,EAAE,OAAO,aAAa,CAAC,EAAE;AAAA,EAC5D;AACA,IAAE,IAAI,cAAc,cAAc;AAGlC,QAAM,iBAAiB,QAAgB,CAAC,WAAmB,GAAG,CAAC,SAAS;AACvE,UAAM,QAAQ,KAAK,CAAC;AACpB,WAAO,OAAO,YAAY;AAAA,EAC3B,CAAC;AACD,QAAM,mBAAmB,QAAgB,CAAC,cAAc,GAAG,CAAC,SAAS;AACpE,UAAM,IAAI,KAAK,CAAC;AAChB,WAAO,GAAG,aAAa,IAAI;AAAA,EAC5B,CAAC;AACD,IAAE,IAAI,qBAAqB,cAA+B;AAC1D,IAAE,IAAI,uBAAuB,gBAAiC;AAE9D,QAAM,iBAAiB,MAAc,CAAC;AACtC,QAAM,mBAAmB,MAAc,GAAG;AAC1C,IAAE,IAAI,qBAAqB,cAA+B;AAC1D,IAAE,IAAI,uBAAuB,gBAAiC;AAE9D,QAAM,WAAW,OAAO,CAAC,gBAAgB,gBAAgB,GAAG,CAAC,gBAAgB,gBAAgB,CAAC;AAC9F,IAAE,IAAI,YAAY,QAAyB;AAG3C,QAAM,SAAS;AAAA,IACd,CAAC,YAAY,gBAAgB,QAAgB;AAAA,IAC7C,CAAC,UAAU;AAAA,MACV,UAAU,KAAK,CAAC;AAAA,MAChB,YAAY,KAAK,CAAC;AAAA,MAClB,UAAU,KAAK,CAAC;AAAA,IACjB;AAAA,IACA,EAAE,MAAMA,UAAS,iBAAiB,EAAE,OAAO,SAAS,CAAC,EAAE;AAAA,EACxD;AACA,IAAE,IAAI,UAAU,MAAM;AAGtB,QAAM,YAAY,MAAe,MAAM;AAAA,IACtC,MAAMA,UAAS,iBAAiB,EAAE,OAAO,mBAAmB,CAAC;AAAA,EAC9D,CAAC;AACD,IAAE,IAAI,oBAAoB,SAAS;AACnC,QAAM,cAAc;AAAA,IACnB,CAAC,UAAU;AAAA,IACX,CAAC,SAAS;AACT,YAAM,SAAS,KAAK,CAAC;AACrB,UAAI,QAAQ;AACX,cAAM,IAAI,OAAO;AACjB,YAAI,KAAK,EAAE,UAAU,MAAO,QAAO;AAAA,MACpC;AACA,aAAO;AAAA,IACR;AAAA,IACA;AAAA,MACC,MAAMA,UAAS,iBAAiB,EAAE,OAAO,qBAAqB,CAAC;AAAA,IAChE;AAAA,EACD;AACA,IAAE,IAAI,sBAAsB,WAA4B;AACxD,WAAS,GAAG,sBAAsB,oBAAoB;AAAA,IACrD,eAAe,KAAK,yBAAyB;AAAA,EAC9C,CAAC;AAED,SAAO;AACR;AAqDO,SAAS,uBAAuB,MAAc,MAA4C;AAChG,QAAM,IAAI,IAAI,MAAM,MAAM,IAAI;AAG9B,IAAE,IAAI,UAAU,KAAK,MAAM;AAG3B,QAAM,kBAAkB,CAAC,aAAwC;AAAA,IAChE,OAAO;AAAA,IACP,YAAY;AAAA,IACZ,UAAU;AAAA,EACX;AACA,QAAM,aAAa,KAAK,YAAY;AACpC,QAAM,eAAe,QAA0B,CAAC,KAAK,MAAM,GAAG,CAAC,SAAS,WAAW,KAAK,CAAC,CAAC,GAAG;AAAA,IAC5F,MAAMA,UAAS,sBAAsB,EAAE,OAAO,WAAW,CAAC;AAAA,EAC3D,CAAC;AACD,IAAE,IAAI,YAAY,YAA6B;AAG/C,QAAM,QAAQ,SAA2B,YAAY,cAAc;AAAA,IAClE,EAAE,MAAM,QAAQ,UAAU,CAAC,MAAM,EAAE,UAAU,OAAO;AAAA,IACpD,EAAE,MAAM,UAAU,UAAU,CAAC,MAAM,EAAE,UAAU,SAAS;AAAA,IACxD,EAAE,MAAM,SAAS,UAAU,CAAC,MAAM,EAAE,UAAU,QAAQ;AAAA,EACvD,CAAC;AACD,IAAE,MAAM,YAAY,KAAK;AAGzB,QAAM,YAAY,YAA8B,CAAC,GAAG;AAAA,IACnD,MAAM;AAAA,IACN,SAAS,KAAK;AAAA,EACf,CAAC;AACD,IAAE,IAAI,gBAAgB,UAAU,OAAwB;AAGxD,MAAI;AACJ,MAAI;AACH,mBAAe,EAAE,QAAQ,yBAAyB;AAAA,EACnD,QAAQ;AACP,mBAAe,MAAe,IAAI;AAClC,MAAE,IAAI,qBAAqB,YAAY;AAAA,EACxC;AACA,QAAM,oBAAoB,OAAO,CAAC,YAAY,GAAG,CAAC,SAAS;AAC1D,UAAM,OAAO,KAAK,CAAC;AACnB,QAAI,MAAM;AACT,gBAAU,OAAO,IAAI;AAAA,IACtB;AAAA,EACD,CAAC;AACD,IAAE,IAAI,wBAAwB,iBAAkC;AAChE,IAAE,YAAY,UAAU,iBAAkC,CAAC;AAC3D,MAAI;AAAA,EACJ,QAAQ;AAAA,EAER;AAGA,QAAMC,UAAS;AAAA,IACd,CAAC;AAAA,IACD;AAAA,MACC,MAAMD,UAAS,sBAAsB;AAAA,QACpC,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,aAAa;AAAA,MACd,CAAC;AAAA,IACF;AAAA,EACD;AACA,IAAE,IAAI,UAAUC,OAAuB;AAGvC,QAAM,UAAU,KAAK,WAAW,CAAC,KAAK,GAAG,CAAC;AAC1C,QAAM,mBAAmB,QAAgB,CAAC,YAAoB,GAAG,CAAC,SAAS;AAC1E,UAAM,IAAI,KAAK,CAAC;AAChB,WAAO,GAAG,cAAc;AAAA,EACzB,CAAC;AACD,QAAM,iBAAiB,QAAgB,CAAC,YAAoB,GAAG,CAAC,SAAS;AACxE,UAAM,IAAI,KAAK,CAAC;AAChB,QAAI,CAAC,EAAG,QAAO;AACf,WAAO,EAAE,UAAU,UAAU,QAAQ,CAAC,IAAI,EAAE,UAAU,WAAW,QAAQ,CAAC,IAAI,QAAQ,CAAC;AAAA,EACxF,CAAC;AACD,IAAE,IAAI,uBAAuB,gBAAiC;AAC9D,IAAE,IAAI,qBAAqB,cAA+B;AAE1D,QAAM,cAAc,MAAc,CAAC;AACnC,QAAM,YAAY,MAAc,CAAC;AACjC,IAAE,IAAI,kBAAkB,WAA4B;AACpD,IAAE,IAAI,gBAAgB,SAA0B;AAEhD,QAAM,WAAW,OAAO,CAAC,kBAAkB,cAAc,GAAG,CAAC,aAAa,SAAS,CAAC;AACpF,IAAE,IAAI,YAAY,QAAyB;AAG3C,QAAM,SAAS;AAAA,IACd,CAAC,cAAsB,QAAgB;AAAA,IACvC,CAAC,UAAU;AAAA,MACV,gBAAgB,KAAK,CAAC;AAAA,MACtB,UAAU,KAAK,CAAC;AAAA,IACjB;AAAA,IACA,EAAE,MAAMD,UAAS,sBAAsB,EAAE,OAAO,SAAS,CAAC,EAAE;AAAA,EAC7D;AACA,IAAE,IAAI,UAAU,MAAM;AAKtB,QAAM,cAAc;AAAA,IACnB,CAAC,UAAU,SAAiBC,OAAc;AAAA,IAC1C,CAAC,SAAS;AACT,YAAM,UAAU,KAAK,CAAC;AACtB,UAAI,WAAW,QAAQ,SAAS,GAAG;AAClC,cAAM,SAAS,QAAQ,QAAQ,SAAS,CAAC;AAEzC,YAAI,UAAW,OAA8C,eAAe;AAC3E,iBAAO;AAAA,QACR;AAAA,MACD;AACA,aAAO;AAAA,IACR;AAAA,IACA;AAAA,MACC,MAAMD,UAAS,sBAAsB,EAAE,OAAO,qBAAqB,CAAC;AAAA,IACrE;AAAA,EACD;AACA,IAAE,IAAI,sBAAsB,WAA4B;AACxD,WAAS,GAAG,sBAAsB,UAAU;AAAA,IAC3C,eAAe,KAAK,yBAAyB;AAAA,EAC9C,CAAC;AAED,SAAO;AACR;AAqEO,SAAS,iBAAiB,MAAc,MAAsC;AACpF,QAAM,IAAI,IAAI,MAAM,MAAM,IAAI;AAG9B,IAAE,IAAI,UAAU,KAAK,MAAM;AAG3B,QAAM,aACL,KAAK,aACJ,CAAC,YAAuC;AAAA,IACxC,OAAO;AAAA,IACP,QAAQ,CAAC;AAAA,IACT;AAAA,EACD;AACD,QAAM,eAAe;AAAA,IACpB,CAAC,KAAK,MAAM;AAAA,IACZ,CAAC,SAAU,KAAK,CAAC,KAAK,OAAO,WAAW,KAAK,CAAC,CAAC,IAAI;AAAA,IACnD,EAAE,MAAMA,UAAS,gBAAgB,EAAE,OAAO,WAAW,CAAC,EAAE;AAAA,EACzD;AACA,IAAE,IAAI,YAAY,YAA6B;AAG/C,QAAM,kBACL,KAAK,kBACJ,CAAC,YAAoC;AAAA,IACrC,SAAS;AAAA,IACT,OAAO;AAAA,IACP;AAAA,EACD;AACD,QAAM,cAAc;AAAA,IACnB,CAAC,KAAK,MAAM;AAAA,IACZ,CAAC,SAAU,KAAK,CAAC,KAAK,OAAO,gBAAgB,KAAK,CAAC,CAAC,IAAI;AAAA,IACxD,EAAE,MAAMA,UAAS,gBAAgB,EAAE,OAAO,UAAU,CAAC,EAAE;AAAA,EACxD;AACA,IAAE,IAAI,WAAW,WAA4B;AAG7C,QAAM,WAAW,MAAe,MAAM;AAAA,IACrC,MAAMA,UAAS,gBAAgB;AAAA,MAC9B,OAAO;AAAA,MACP,aAAa;AAAA,IACd,CAAC;AAAA,EACF,CAAC;AACD,IAAE,IAAI,YAAY,QAAQ;AAG1B,QAAM,kBAAkB,OAAO,CAAC,YAAoB,GAAG,CAAC,SAAS;AAChE,UAAM,SAAS,KAAK,CAAC;AACrB,QAAI,QAAQ,OAAO;AAClB,YAAM,MAAM;AACX,iBAAS,KAAK,CAAC,CAAC,MAAM,OAAO,MAAM,CAAC,CAAC;AAAA,MACtC,CAAC;AAAA,IACF;AAAA,EACD,CAAC;AACD,IAAE,IAAI,sBAAsB,eAAgC;AAC5D,YAAU,eAAgC;AAG1C,QAAM,gBAAgB,KAAK,gBAAgB,OAAO,EAAE,OAAO,MAAM;AACjE,QAAM,YAAY;AAAA,IACjB,CAAC,KAAK,QAAQ,QAAQ;AAAA,IACtB,CAAC,SAAS,cAAc,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IACxC,EAAE,MAAMA,UAAS,gBAAgB,EAAE,OAAO,QAAQ,CAAC,EAAE;AAAA,EACtD;AACA,IAAE,IAAI,SAAS,SAAS;AAGxB,QAAM,YAAY,KAAK,YAAY,MAAM;AACzC,QAAM,gBAAgB;AAAA,IACrB,CAAC,cAAsB,WAAmB;AAAA,IAC1C,CAAC,SACA,UAAU;AAAA,MACT,YAAY,KAAK,CAAC;AAAA,MAClB,SAAS,KAAK,CAAC;AAAA,IAChB,CAAC;AAAA,IACF,EAAE,MAAMA,UAAS,gBAAgB,EAAE,OAAO,YAAY,CAAC,EAAE;AAAA,EAC1D;AACA,IAAE,IAAI,aAAa,aAAa;AAGhC,QAAM,SAAS;AAAA,IACd,CAAC,cAAsB,aAAqB,WAAW,aAAa;AAAA,IACpE,CAAC,UAAU;AAAA,MACV,YAAY,KAAK,CAAC;AAAA,MAClB,SAAS,KAAK,CAAC;AAAA,MACf,OAAO,KAAK,CAAC;AAAA,MACb,aAAa,KAAK,CAAC;AAAA,IACpB;AAAA,IACA,EAAE,MAAMA,UAAS,gBAAgB,EAAE,OAAO,SAAS,CAAC,EAAE;AAAA,EACvD;AACA,IAAE,IAAI,UAAU,MAAM;AAGtB,QAAM,kBAAkB,MAAiB,CAAC,GAAG;AAAA,IAC5C,MAAMA,UAAS,gBAAgB,EAAE,OAAO,mBAAmB,CAAC;AAAA,EAC7D,CAAC;AACD,IAAE,IAAI,oBAAoB,eAAgC;AAE1D,QAAM,cAAc;AAAA,IACnB,CAAC,WAAmB;AAAA,IACpB,CAAC,SAAS;AACT,YAAM,IAAI,KAAK,CAAC;AAChB,UAAI,GAAG,QAAS,QAAO;AACvB,aAAO;AAAA,IACR;AAAA,IACA;AAAA,MACC,MAAMA,UAAS,gBAAgB,EAAE,OAAO,qBAAqB,CAAC;AAAA,IAC/D;AAAA,EACD;AACA,IAAE,IAAI,sBAAsB,WAA4B;AACxD,WAAS,GAAG,sBAAsB,oBAAoB;AAAA,IACrD,eAAe,KAAK,yBAAyB;AAAA,EAC9C,CAAC;AAED,SAAO;AACR;AAOA,SAAS,SAAS,OAAgB,KAAsB;AACvD,MAAI,SAAS,QAAQ,OAAO,UAAU,SAAU,QAAO;AACvD,QAAM,IAAI;AACV,SAAO,EAAE,SAAS,OAAO,EAAE,SAAS;AACrC;;;AEnuBA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAyKO,SAAS,cAAc,OAA4D;AACzF,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,aAAa;AACpE;AAGO,SAAS,kBACf,OAC8B;AAC9B,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,aAAa;AACpE;AAGO,SAAS,iBAAiB,OAA8C;AAC9E,SAAO,cAAc,KAAK,IAAI,MAAM,UAAU;AAC/C;AAGO,SAAS,qBAAqB,OAA0D;AAC9F,SAAO,kBAAkB,KAAK,IAAI,MAAM,UAAU;AACnD;AAQO,SAAS,sBAAsB,SAAmC;AACxE,QAAM,WAAqB,CAAC;AAE5B,MAAI,QAAQ,KAAK;AAEhB,UAAM,SAAS,oBAAI,IAAsB;AACzC,eAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,QAAQ,GAAG,GAAG;AACxD,YAAM,MAAM,cAAc,KAAK,IAAK,MAAM,OAAO,CAAC,KAAK,UAAW;AAClE,UAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,CAAC,CAAC;AACxC,aAAO,IAAI,GAAG,EAAG,KAAK,cAAc,MAAM,KAAK,CAAC;AAAA,IACjD;AACA,eAAW,CAAC,KAAK,KAAK,KAAK,QAAQ;AAClC,eAAS,KAAK,GAAG,GAAG;AAAA,EAAM,MAAM,KAAK,IAAI,CAAC,EAAE;AAAA,IAC7C;AAAA,EACD;AAEA,MAAI,QAAQ,SAAS;AACpB,UAAM,QAAkB,CAAC;AACzB,eAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,QAAQ,OAAO,GAAG;AAC5D,YAAM,KAAK,kBAAkB,MAAM,KAAK,CAAC;AAAA,IAC1C;AACA,QAAI,MAAM,SAAS,GAAG;AACrB,eAAS,KAAK;AAAA,EAAa,MAAM,KAAK,IAAI,CAAC,EAAE;AAAA,IAC9C;AAAA,EACD;AAEA,SAAO,SAAS,KAAK,MAAM;AAC5B;AAEA,SAAS,cAAc,MAAc,OAA2C;AAC/E,MAAI,CAAC,cAAc,KAAK,EAAG,QAAO,KAAK,IAAI;AAC3C,MAAI,OAAO,KAAK,IAAI,KAAK,MAAM,WAAW;AAC1C,MAAI,MAAM,cAAc;AACvB,UAAM,SAAS,OAAO,QAAQ,MAAM,YAAY,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM;AACjE,UAAI,OAAO,GAAG,CAAC,KAAK,EAAE,IAAI;AAC1B,UAAI,EAAE,KAAM,SAAQ,KAAK,EAAE,KAAK,KAAK,GAAG,CAAC;AACzC,UAAI,EAAE,aAAa,MAAO,SAAQ;AAClC,aAAO;AAAA,IACR,CAAC;AACD,YAAQ,eAAe,OAAO,KAAK,IAAI,CAAC;AAAA,EACzC;AACA,SAAO;AACR;AAEA,SAAS,kBAAkB,MAAc,OAAmD;AAC3F,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO,KAAK,IAAI;AAC/C,MAAI,OAAO,KAAK,IAAI,KAAK,MAAM,WAAW;AAC1C,MAAI,MAAM,cAAc;AACvB,UAAM,SAAS,OAAO,QAAQ,MAAM,YAAY,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM;AACjE,UAAI,OAAO,GAAG,CAAC,KAAK,EAAE,IAAI;AAC1B,UAAI,EAAE,aAAa,MAAO,SAAQ;AAClC,aAAO;AAAA,IACR,CAAC;AACD,YAAQ,eAAe,OAAO,KAAK,IAAI,CAAC;AAAA,EACzC;AACA,SAAO;AACR;AASO,SAAS,2BACf,MACA,SACsB;AACtB,QAAM,SAAmB,CAAC;AAC1B,QAAM,UAAU,IAAI,IAAI,OAAO,KAAK,QAAQ,OAAO,CAAC,CAAC,CAAC;AACtD,QAAM,cAAc,IAAI,IAAI,OAAO,KAAK,QAAQ,WAAW,CAAC,CAAC,CAAC;AAE9D,aAAW,CAAC,UAAU,OAAO,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AAC7D,QAAI,QAAQ,SAAS,WAAY;AACjC,UAAME,QAAO;AAGb,QAAIA,MAAK,MAAM,QAAQ,OAAO,KAAK,CAAC,QAAQ,IAAIA,MAAK,EAAE,GAAG;AAEzD,UAAI,YAAY,IAAIA,MAAK,EAAE,GAAG;AAC7B,eAAO;AAAA,UACN,SAAS,QAAQ,UAAUA,MAAK,EAAE,+FAC+B,CAAC,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,QACzF;AAAA,MACD,OAAO;AACN,cAAM,aAAa,YAAYA,MAAK,IAAI,OAAO;AAC/C,eAAO;AAAA,UACN,SAAS,QAAQ,UAAUA,MAAK,EAAE,4BAChC,aAAa,mBAAmB,UAAU,OAAO;AAAA,QACpD;AAAA,MACD;AAAA,IACD;AAGA,QAAIA,MAAK,UAAU,YAAY,OAAO,KAAK,CAAC,YAAY,IAAIA,MAAK,MAAM,GAAG;AACzE,UAAI,QAAQ,IAAIA,MAAK,MAAM,GAAG;AAC7B,eAAO;AAAA,UACN,SAAS,QAAQ,cAAcA,MAAK,MAAM,8EACM,CAAC,GAAG,WAAW,EAAE,KAAK,IAAI,CAAC;AAAA,QAC5E;AAAA,MACD,OAAO;AACN,cAAM,aAAa,YAAYA,MAAK,QAAQ,WAAW;AACvD,eAAO;AAAA,UACN,SAAS,QAAQ,cAAcA,MAAK,MAAM,4BACxC,aAAa,mBAAmB,UAAU,OAAO;AAAA,QACpD;AAAA,MACD;AAAA,IACD;AAGA,QAAIA,MAAK,MAAMA,MAAK,UAAU,QAAQ,MAAMA,MAAK,EAAE,GAAG;AACrD,YAAM,QAAQ,QAAQ,IAAIA,MAAK,EAAE;AACjC,UAAI,cAAc,KAAK,KAAK,MAAM,cAAc;AAC/C,mBAAW,CAAC,OAAO,MAAM,KAAK,OAAO,QAAQ,MAAM,YAAY,GAAG;AACjE,cAAI,OAAO,aAAa,SAAS,EAAE,SAASA,MAAK,SAAS;AACzD,mBAAO,KAAK,SAAS,QAAQ,qCAAqC,KAAK,GAAG;AAAA,UAC3E;AACA,cAAI,SAASA,MAAK,UAAU,OAAO,MAAM;AACxC,kBAAM,MAAMA,MAAK,OAAO,KAAK;AAC7B,gBAAI,CAAC,OAAO,KAAK,SAAS,GAAgC,GAAG;AAC5D,qBAAO;AAAA,gBACN,SAAS,QAAQ,aAAa,KAAK,MAAM,KAAK,UAAU,GAAG,CAAC,sBACvC,OAAO,KAAK,KAAK,IAAI,CAAC;AAAA,cAC5C;AAAA,YACD;AAAA,UACD;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAGA,MAAI,KAAK,WAAW;AACnB,eAAW,CAAC,OAAO,QAAQ,KAAK,OAAO,QAAQ,KAAK,SAAS,GAAG;AAC/D,iBAAW,CAAC,UAAUA,KAAI,KAAK,OAAO,QAAQ,SAAS,KAAK,GAAG;AAC9D,YAAIA,MAAK,MAAM,QAAQ,OAAO,KAAK,CAAC,QAAQ,IAAIA,MAAK,EAAE,GAAG;AACzD,gBAAM,aAAa,YAAYA,MAAK,IAAI,OAAO;AAC/C,iBAAO;AAAA,YACN,aAAa,KAAK,WAAW,QAAQ,UAAUA,MAAK,EAAE,4BACpD,aAAa,mBAAmB,UAAU,OAAO;AAAA,UACpD;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO;AAC7C;AAGA,SAAS,YAAY,OAAe,YAAwC;AAC3E,MAAI,OAAsB;AAC1B,MAAI,WAAW;AACf,QAAM,QAAQ,MAAM,YAAY;AAChC,aAAW,KAAK,YAAY;AAC3B,UAAM,OAAO,YAAY,OAAO,EAAE,YAAY,CAAC;AAC/C,QAAI,OAAO,YAAY,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,SAAS,CAAC,CAAC,GAAG;AACzE,iBAAW;AACX,aAAO;AAAA,IACR;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAAS,YAAY,GAAW,GAAmB;AAClD,QAAM,IAAI,EAAE;AACZ,QAAM,IAAI,EAAE;AACZ,QAAM,KAAiB,MAAM;AAAA,IAAK,EAAE,QAAQ,IAAI,EAAE;AAAA,IAAG,CAAC,GAAG,MACxD,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,CAACC,IAAG,MAAO,MAAM,IAAI,IAAI,MAAM,IAAI,IAAI,CAAE;AAAA,EACxE;AACA,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC5B,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC5B,SAAG,CAAC,EAAE,CAAC,IACN,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IACjB,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,IACf,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAAA,IAC9D;AAAA,EACD;AACA,SAAO,GAAG,CAAC,EAAE,CAAC;AACf;AAYA,IAAM,mBAAmB,oBAAI,IAAI;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAED,IAAM,mBAAmB,oBAAI,IAAI,CAAC,SAAS,YAAY,WAAW,UAAU,UAAU,CAAC;AAQhF,SAAS,aAAa,MAAoC;AAChE,QAAM,SAAmB,CAAC;AAE1B,MAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC7C,WAAO,EAAE,OAAO,OAAO,QAAQ,CAAC,qCAAqC,EAAE;AAAA,EACxE;AAEA,QAAM,IAAI;AAEV,MAAI,OAAO,EAAE,SAAS,YAAY,EAAE,KAAK,WAAW,GAAG;AACtD,WAAO,KAAK,+BAA+B;AAAA,EAC5C;AAEA,MAAI,EAAE,SAAS,QAAQ,OAAO,EAAE,UAAU,YAAY,MAAM,QAAQ,EAAE,KAAK,GAAG;AAC7E,WAAO,KAAK,sDAAsD;AAClE,WAAO,EAAE,OAAO,OAAO,OAAO;AAAA,EAC/B;AAEA,QAAM,YAAY,IAAI,IAAI,OAAO,KAAK,EAAE,KAAe,CAAC;AACxD,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,eAAe,oBAAI,IAAkC;AAG3D,MAAI,EAAE,aAAa,QAAQ,OAAO,EAAE,cAAc,YAAY,CAAC,MAAM,QAAQ,EAAE,SAAS,GAAG;AAC1F,eAAW,CAAC,OAAO,IAAI,KAAK,OAAO,QAAQ,EAAE,SAAoC,GAAG;AACnF,UAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC7C,cAAM,IAAI;AACV,qBAAa,IAAI,OAAO;AAAA,UACvB,QAAQ,MAAM,QAAQ,EAAE,MAAM,IAAK,EAAE,SAAsB,CAAC;AAAA,QAC7D,CAAC;AAAA,MACF;AAAA,IACD;AAAA,EACD;AAGA,MAAI,EAAE,aAAa,MAAM;AACxB,QAAI,OAAO,EAAE,cAAc,YAAY,MAAM,QAAQ,EAAE,SAAS,GAAG;AAClE,aAAO,KAAK,+BAA+B;AAAA,IAC5C,OAAO;AACN,iBAAW,CAAC,OAAO,IAAI,KAAK,OAAO,QAAQ,EAAE,SAAoC,GAAG;AACnF,YAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC7C,iBAAO,KAAK,aAAa,KAAK,sBAAsB;AACpD;AAAA,QACD;AACA,cAAM,IAAI;AACV,YAAI,CAAC,MAAM,QAAQ,EAAE,MAAM,GAAG;AAC7B,iBAAO,KAAK,aAAa,KAAK,2BAA2B;AAAA,QAC1D;AACA,YAAI,EAAE,SAAS,QAAQ,OAAO,EAAE,UAAU,YAAY,MAAM,QAAQ,EAAE,KAAK,GAAG;AAC7E,iBAAO,KAAK,aAAa,KAAK,sCAAsC;AAAA,QACrE,OAAO;AACN,gBAAM,WAAW,IAAI,IAAI,MAAM,QAAQ,EAAE,MAAM,IAAK,EAAE,SAAsB,CAAC,CAAC;AAC9E,gBAAM,aAAa,IAAI,IAAI,OAAO,KAAK,EAAE,KAAe,CAAC;AACzD,qBAAW,CAAC,OAAO,IAAI,KAAK,OAAO,QAAQ,EAAE,KAAgC,GAAG;AAC/E,gBAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC7C,qBAAO,KAAK,aAAa,KAAK,WAAW,KAAK,sBAAsB;AACpE;AAAA,YACD;AACA,kBAAM,IAAI;AACV,gBAAI,OAAO,EAAE,SAAS,YAAY,CAAC,iBAAiB,IAAI,EAAE,IAAI,GAAG;AAChE,qBAAO,KAAK,aAAa,KAAK,WAAW,KAAK,iBAAiB;AAAA,YAChE;AACA,gBAAI,MAAM,QAAQ,EAAE,IAAI,GAAG;AAC1B,yBAAW,OAAO,EAAE,MAAkB;AACrC,oBAAI,CAAC,WAAW,IAAI,GAAG,KAAK,CAAC,SAAS,IAAI,GAAG,GAAG;AAC/C,yBAAO;AAAA,oBACN,aAAa,KAAK,WAAW,KAAK,WAAW,GAAG;AAAA,kBACjD;AAAA,gBACD;AAAA,cACD;AAAA,YACD;AAAA,UACD;AACA,cAAI,OAAO,EAAE,WAAW,UAAU;AACjC,mBAAO,KAAK,aAAa,KAAK,4BAA4B;AAAA,UAC3D,WAAW,CAAE,EAAE,MAAkC,EAAE,MAAgB,GAAG;AACrE,mBAAO,KAAK,aAAa,KAAK,cAAc,EAAE,MAAM,0BAA0B;AAAA,UAC/E;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAGA,aAAW,CAAC,MAAM,GAAG,KAAK,OAAO,QAAQ,EAAE,KAAgC,GAAG;AAC7E,QAAI,OAAO,QAAQ,OAAO,QAAQ,UAAU;AAC3C,aAAO,KAAK,SAAS,IAAI,sBAAsB;AAC/C;AAAA,IACD;AACA,UAAM,IAAI;AACV,QAAI,OAAO,EAAE,SAAS,YAAY,CAAC,iBAAiB,IAAI,EAAE,IAAI,GAAG;AAChE,aAAO;AAAA,QACN,SAAS,IAAI,oBAAoB,OAAO,EAAE,IAAI,CAAC,gBAAgB,CAAC,GAAG,gBAAgB,EAAE,KAAK,IAAI,CAAC;AAAA,MAChG;AACA;AAAA,IACD;AACA,cAAU,IAAI,MAAM,EAAE,IAAI;AAE1B,QAAI,EAAE,SAAS,YAAY;AAC1B,UAAI,OAAO,EAAE,aAAa,YAAY,CAAC,aAAa,IAAI,EAAE,QAAQ,GAAG;AACpE,eAAO,KAAK,SAAS,IAAI,gBAAgB,OAAO,EAAE,QAAQ,CAAC,0BAA0B;AAAA,MACtF,OAAO;AAEN,YAAI,EAAE,QAAQ,QAAQ,OAAO,EAAE,SAAS,YAAY,MAAM,QAAQ,EAAE,IAAI,GAAG;AAC1E,iBAAO,KAAK,SAAS,IAAI,wCAAwC;AAAA,QAClE,OAAO;AACN,gBAAM,OAAO,aAAa,IAAI,EAAE,QAAkB;AAClD,gBAAM,OAAO,EAAE;AACf,qBAAW,SAAS,KAAK,QAAQ;AAChC,gBAAI,EAAE,SAAS,OAAO;AACrB,qBAAO;AAAA,gBACN,SAAS,IAAI,sBAAsB,KAAK,6BAA6B,EAAE,QAAQ;AAAA,cAChF;AAAA,YACD;AAAA,UACD;AACA,qBAAW,CAAC,EAAE,MAAM,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC9C,gBAAI,OAAO,WAAW,YAAY,CAAC,UAAU,IAAI,MAAM,GAAG;AACzD,qBAAO;AAAA,gBACN,SAAS,IAAI,mBAAmB,MAAM;AAAA,cACvC;AAAA,YACD;AAAA,UACD;AAAA,QACD;AAAA,MACD;AAAA,IACD,OAAO;AACN,UAAI,MAAM,QAAQ,EAAE,IAAI,GAAG;AAC1B,mBAAW,OAAO,EAAE,MAAkB;AAErC,cAAI,QAAQ,MAAM;AACjB,mBAAO,KAAK,SAAS,IAAI,yBAAyB;AAAA,UACnD,WAAW,CAAC,UAAU,IAAI,GAAG,GAAG;AAC/B,mBAAO,KAAK,SAAS,IAAI,WAAW,GAAG,uCAAuC;AAAA,UAC/E;AAAA,QACD;AAAA,MACD;AAEA,WACE,EAAE,SAAS,aAAa,EAAE,SAAS,YAAY,EAAE,SAAS,eAC3D,CAAC,MAAM,QAAQ,EAAE,IAAI,GACpB;AACD,eAAO,KAAK,SAAS,IAAI,MAAM,EAAE,IAAI,kCAAkC;AAAA,MACxE;AAAA,IACD;AAAA,EACD;AAGA,MAAI,EAAE,YAAY,MAAM;AACvB,QAAI,CAAC,MAAM,QAAQ,EAAE,QAAQ,GAAG;AAC/B,aAAO,KAAK,6BAA6B;AAAA,IAC1C,OAAO;AACN,eAAS,IAAI,GAAG,IAAK,EAAE,SAAuB,QAAQ,KAAK;AAC1D,cAAM,OAAQ,EAAE,SAAuB,CAAC;AACxC,YAAI,QAAQ,QAAQ,OAAO,SAAS,UAAU;AAC7C,iBAAO,KAAK,aAAa,CAAC,sBAAsB;AAChD;AAAA,QACD;AACA,cAAM,IAAI;AACV,YAAI,OAAO,EAAE,SAAS,YAAY,CAAC,UAAU,IAAI,EAAE,IAAI,GAAG;AACzD,iBAAO;AAAA,YACN,aAAa,CAAC,cAAc,OAAO,EAAE,IAAI,CAAC;AAAA,UAC3C;AAAA,QACD;AACA,YAAI,OAAO,EAAE,SAAS,YAAY,EAAE,SAAS,EAAE,IAAI;AAClD,iBAAO,KAAK,aAAa,CAAC,4CAA4C;AAAA,QACvE;AACA,YAAI,OAAO,EAAE,OAAO,YAAY,CAAC,UAAU,IAAI,EAAE,EAAE,GAAG;AACrD,iBAAO;AAAA,YACN,aAAa,CAAC,YAAY,OAAO,EAAE,EAAE,CAAC;AAAA,UACvC;AAAA,QACD,WAAW,OAAO,EAAE,OAAO,YAAY,UAAU,IAAI,EAAE,EAAE,MAAM,SAAS;AACvE,iBAAO;AAAA,YACN,aAAa,CAAC,iBAAiB,EAAE,EAAE,gCAAgC,UAAU,IAAI,EAAE,EAAE,KAAK,SAAS;AAAA,UACpG;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO;AAC7C;AAyBO,SAAS,YAAY,MAAiB,MAAkC;AAC9E,QAAM,aAAa,aAAa,IAAI;AACpC,MAAI,CAAC,WAAW,OAAO;AACtB,UAAM,IAAI,MAAM;AAAA,EAAoC,WAAW,OAAO,KAAK,IAAI,CAAC,EAAE;AAAA,EACnF;AAEA,QAAM,UAAU,MAAM,WAAW,CAAC;AAClC,QAAM,IAAI,IAAI,MAAM,KAAK,IAAI;AAC7B,QAAM,YAAY,KAAK,aAAa,CAAC;AAGrC,QAAM,oBAAoB,2BAA2B,MAAM,OAAO;AAClE,MAAI,CAAC,kBAAkB,OAAO;AAC7B,UAAM,IAAI;AAAA,MACT;AAAA,EAA4C,kBAAkB,OAAO,KAAK,IAAI,CAAC;AAAA,IAChF;AAAA,EACD;AAGA,QAAM,YAAY,CAAC,WAA0C;AAC5D,UAAM,QAAQ,QAAQ,MAAM,MAAM;AAClC,WAAO,QAAQ,iBAAiB,KAAK,IAAI;AAAA,EAC1C;AACA,QAAM,gBAAgB,CAAC,eAAkD;AACxE,UAAM,QAAQ,QAAQ,UAAU,UAAU;AAC1C,WAAO,QAAQ,qBAAqB,KAAK,IAAI;AAAA,EAC9C;AAGA,QAAM,UAAU,oBAAI,IAA2B;AAC/C,QAAM,WAAsC,CAAC;AAE7C,aAAW,CAAC,MAAM,GAAG,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACrD,QAAI,IAAI,SAAS,WAAY;AAE7B,UAAM,IAAI;AACV,QAAI,EAAE,SAAS,SAAS;AACvB,YAAM,KAAK,MAAM,EAAE,SAAS;AAAA,QAC3B;AAAA,QACA,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,IAAI;AAAA,MAChC,CAAC;AACD,QAAE,IAAI,MAAM,EAAE;AACd,cAAQ,IAAI,MAAM,EAAE;AAAA,IACrB,WAAW,EAAE,SAAS,YAAY;AACjC,YAAM,gBAAgB,EAAE,SAAS,cAAc,EAAE,MAAM,IAAI;AAC3D,YAAM,YAAY,EAAE,KAAK,UAAU,EAAE,EAAE,IAAI;AAC3C,UAAI,eAAe;AAClB,cAAM,KAAK,cAAc,EAAE,UAAU,CAAC,CAAC;AACvC,UAAE,IAAI,MAAM,EAAE;AACd,gBAAQ,IAAI,MAAM,EAAE;AAAA,MACrB,WAAW,WAAW;AACrB,cAAM,KAAK,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;AACvC,UAAE,IAAI,MAAM,EAAE;AACd,gBAAQ,IAAI,MAAM,EAAE;AAAA,MACrB,OAAO;AAEN,cAAM,KAAK,SAAS,MAAM;AAAA,QAAC,GAAG;AAAA,UAC7B;AAAA,UACA,MAAM,EAAE,GAAG,EAAE,MAAM,SAAS,EAAE,IAAI,aAAa,EAAE,OAAO;AAAA,QACzD,CAAC;AACD,UAAE,IAAI,MAAM,EAAE;AACd,gBAAQ,IAAI,MAAM,EAAE;AAAA,MACrB;AAAA,IACD,OAAO;AACN,eAAS,KAAK,CAAC,MAAM,CAAC,CAAC;AAAA,IACxB;AAAA,EACD;AAGA,MAAI,aAAa;AACjB,QAAM,UAAU,IAAI,IAAI,QAAQ;AAChC,SAAO,QAAQ,OAAO,KAAK,YAAY;AACtC,iBAAa;AACb,eAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,QAAQ,QAAQ,CAAC,GAAG;AAC/C,YAAM,OAAO,EAAE,QAAQ,CAAC;AACxB,UAAI,CAAC,KAAK,MAAM,CAAC,QAAQ,QAAQ,IAAI,GAAG,CAAC,EAAG;AAE5C,YAAM,eAAe,KAAK,IAAI,CAAC,QAAQ,QAAQ,IAAI,GAAG,CAAE;AACxD,YAAM,YAAY,EAAE,KAAK,UAAU,EAAE,EAAE,IAAI;AAE3C,UAAI;AACJ,UAAI,WAAW;AACd,aAAK,UAAU,cAAc,EAAE,UAAU,CAAC,CAAC;AAAA,MAC5C,WAAW,EAAE,SAAS,UAAU;AAC/B,aAAK,OAAO,cAAc,MAAM;AAAA,QAAC,CAAC;AAAA,MACnC,OAAO;AAEN,aAAK,QAAQ,cAAc,CAAC,SAA6B,KAAK,CAAC,CAAC;AAAA,MACjE;AACA,QAAE,IAAI,MAAM,EAAE;AACd,cAAQ,IAAI,MAAM,EAAE;AACpB,cAAQ,OAAO,IAAI;AACnB,mBAAa;AAAA,IACd;AAAA,EACD;AACA,MAAI,QAAQ,OAAO,GAAG;AACrB,UAAM,aAAa,CAAC,GAAG,QAAQ,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,IAAI;AACvD,UAAM,IAAI,MAAM,6CAA6C,UAAU,EAAE;AAAA,EAC1E;AAGA,aAAW,CAAC,MAAM,GAAG,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACrD,QAAI,IAAI,SAAS,WAAY;AAC7B,UAAM,MAAM;AACZ,UAAM,OAAO,UAAU,IAAI,QAAQ;AAEnC,UAAM,MAAM,IAAI,MAAM,IAAI;AAC1B,UAAM,aAAa,oBAAI,IAA2B;AAClD,UAAM,cAAyC,CAAC;AAGhD,eAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACxD,YAAM,gBAAgB,MAAM,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ;AACpD,YAAI,IAAI,WAAW,GAAG,KAAK,IAAI,KAAK,GAAG,GAAG;AACzC,iBAAO,IAAI,KAAK,GAAG;AAAA,QACpB;AACA,eAAO;AAAA,MACR,CAAC;AACD,YAAM,uBAAuB,EAAE,GAAG,OAAO,MAAM,aAAa;AAE5D,UAAI,MAAM,SAAS,SAAS;AAC3B,cAAM,KAAK,MAAM,MAAM,SAAS;AAAA,UAC/B,MAAM;AAAA,UACN,MAAM,MAAM,OAAO,EAAE,GAAG,MAAM,KAAK,IAAI;AAAA,QACxC,CAAC;AACD,YAAI,IAAI,OAAO,EAAE;AACjB,mBAAW,IAAI,OAAO,EAAE;AAAA,MACzB,WAAW,MAAM,SAAS,YAAY;AAErC,cAAM,gBAAgB,MAAM,SAAS,cAAc,MAAM,MAAM,IAAI;AACnE,cAAM,YAAY,MAAM,KAAK,UAAU,MAAM,EAAE,IAAI;AACnD,YAAI,eAAe;AAClB,gBAAM,KAAK,cAAc,MAAM,UAAU,CAAC,CAAC;AAC3C,cAAI,IAAI,OAAO,EAAE;AACjB,qBAAW,IAAI,OAAO,EAAE;AAAA,QACzB,WAAW,WAAW;AACrB,gBAAM,KAAK,UAAU,CAAC,GAAG,MAAM,UAAU,CAAC,CAAC;AAC3C,cAAI,IAAI,OAAO,EAAE;AACjB,qBAAW,IAAI,OAAO,EAAE;AAAA,QACzB,OAAO;AACN,gBAAM,KAAK,SAAS,MAAM;AAAA,UAAC,GAAG;AAAA,YAC7B,MAAM;AAAA,YACN,MAAM,EAAE,GAAG,MAAM,MAAM,SAAS,MAAM,IAAI,aAAa,MAAM,OAAO;AAAA,UACrE,CAAC;AACD,cAAI,IAAI,OAAO,EAAE;AACjB,qBAAW,IAAI,OAAO,EAAE;AAAA,QACzB;AAAA,MACD,OAAO;AACN,oBAAY,KAAK,CAAC,OAAO,oBAAoB,CAAC;AAAA,MAC/C;AAAA,IACD;AAGA,QAAI,gBAAgB;AACpB,UAAM,aAAa,IAAI,IAAI,WAAW;AACtC,WAAO,WAAW,OAAO,KAAK,eAAe;AAC5C,sBAAgB;AAChB,iBAAW,CAAC,OAAO,KAAK,KAAK,CAAC,GAAG,WAAW,QAAQ,CAAC,GAAG;AACvD,cAAM,OAAO,MAAM,QAAQ,CAAC;AAC5B,cAAM,WAAW,KAAK,MAAM,CAAC,QAAQ,WAAW,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC;AAC5E,YAAI,CAAC,SAAU;AAEf,cAAM,eAAe,KAAK,IAAI,CAAC,QAAQ,WAAW,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAE;AAC/E,cAAM,YAAY,MAAM,KAAK,UAAU,MAAM,EAAE,IAAI;AAEnD,YAAI;AACJ,YAAI,WAAW;AACd,eAAK,UAAU,cAAc,MAAM,UAAU,CAAC,CAAC;AAAA,QAChD,WAAW,MAAM,SAAS,UAAU;AACnC,eAAK,OAAO,cAAc,MAAM;AAAA,UAAC,CAAC;AAAA,QACnC,OAAO;AACN,eAAK,QAAQ,cAAc,CAAC,SAA6B,KAAK,CAAC,CAAC;AAAA,QACjE;AACA,YAAI,IAAI,OAAO,EAAE;AACjB,mBAAW,IAAI,OAAO,EAAE;AACxB,mBAAW,OAAO,KAAK;AACvB,wBAAgB;AAAA,MACjB;AAAA,IACD;AACA,QAAI,WAAW,OAAO,GAAG;AACxB,YAAM,aAAa,CAAC,GAAG,WAAW,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,IAAI;AAC1D,YAAM,IAAI;AAAA,QACT,0BAA0B,IAAI,QAAQ,4BAA4B,UAAU;AAAA,MAC7E;AAAA,IACD;AAEA,MAAE,MAAM,MAAM,GAAG;AAEjB,UAAM,aAAa,GAAG,IAAI,KAAK,KAAK,MAAM;AAC1C,YAAQ,IAAI,MAAM,EAAE,QAAQ,UAAU,CAAC;AAIvC,QAAI;AACH,YAAM,aAAa,EAAE,QAAQ,UAAU;AACvC,iBAAW,KAAK,eAAe,KAAK,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC;AAC1D,iBAAW,KAAK,eAAe,KAAK,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,IACvD,QAAQ;AAAA,IAER;AAAA,EACD;AAKA,aAAW,MAAM,KAAK,YAAY,CAAC,GAAG;AACrC,aAAkB,GAAG,GAAG,MAAM,GAAG,IAAI;AAAA,MACpC,eAAe,GAAG;AAAA,IACnB,CAAC;AAAA,EACF;AAEA,SAAO;AACR;AAOA,IAAM,qBAAqB,oBAAI,IAAI;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAeM,SAAS,eAAe,OAAyB;AACvD,QAAM,OAAO,MAAM,SAAS,EAAE,QAAQ,WAAW,CAAC;AAClD,QAAM,QAAuC,CAAC;AAC9C,QAAM,gBAAyC,CAAC;AAChD,QAAM,cAAc,KAAK,kBAAkB;AAG3C,QAAM,yBAAyB;AAC/B,QAAM,qBAAqB,oBAAI,IAAY;AAE3C,aAAW,QAAQ,OAAO,KAAK,KAAK,KAAK,GAAG;AAC3C,QAAI,KAAK,SAAS,WAAW,EAAG;AAChC,UAAM,QAAQ,uBAAuB,KAAK,IAAI;AAC9C,QAAI,OAAO;AACV,yBAAmB,IAAI,MAAM,CAAC,CAAE;AAChC,YAAM,OAAO,KAAK,MAAM,IAAI,GAAG;AAC/B,UAAI,MAAM,gBAAgB,MAAM,YAAY;AAC3C,sBAAc,KAAK;AAAA,UAClB,MAAM,KAAK;AAAA,UACX,IAAI,KAAK;AAAA,UACT,GAAI,KAAK,gBAAgB,EAAE,eAAe,KAAK,cAAwB,IAAI,CAAC;AAAA,QAC7E,CAAC;AAAA,MACF;AAAA,IACD;AAAA,EACD;AAGA,aAAW,CAAC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AAC1D,QAAI,KAAK,SAAS,WAAW,EAAG;AAChC,QAAI,uBAAuB,KAAK,IAAI,EAAG;AAEvC,QAAI,SAAS,MAAM,UAAW;AAE9B,QAAI,KAAK,WAAW,oBAAoB,EAAG;AAC3C,QAAI,KAAK,WAAW,WAAW,EAAG;AAElC,QAAI,KAAK,SAAS,IAAI,EAAG;AAEzB,UAAM,WAA0B;AAAA,MAC/B,MAAM,SAAS;AAAA,IAChB;AAEA,QAAI,SAAS,KAAK,SAAS,GAAG;AAC7B,eAAS,OAAO,SAAS,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,SAAS,IAAI,CAAC;AAAA,IAC9D;AAEA,QAAI,SAAS,SAAS,WAAW,SAAS,UAAU,QAAW;AAC9D,eAAS,UAAU,SAAS;AAAA,IAC7B;AAEA,QAAI,SAAS,QAAQ,OAAO,KAAK,SAAS,IAAI,EAAE,SAAS,GAAG;AAC3D,YAAM,OAAgC,CAAC;AACvC,iBAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,SAAS,IAA+B,GAAG;AAC9E,YAAI,CAAC,mBAAmB,IAAI,CAAC,EAAG,MAAK,CAAC,IAAI;AAAA,MAC3C;AACA,UAAI,OAAO,KAAK,IAAI,EAAE,SAAS,GAAG;AACjC,iBAAS,OAAO;AAAA,MACjB;AAAA,IACD;AAEA,UAAM,IAAI,IAAI;AAAA,EACf;AAGA,QAAM,YAA+C,CAAC;AACtD,QAAM,eAAqD,CAAC;AAC5D,QAAM,wBAAwB,oBAAI,IAAY;AAG9C,aAAW,WAAW,KAAK,WAAW;AACrC,UAAM,SAAS,GAAG,OAAO;AACzB,eAAW,CAAC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AAC1D,UAAI,CAAC,KAAK,WAAW,MAAM,EAAG;AAC9B,UAAI,KAAK,SAAS,WAAW,EAAG;AAChC,YAAM,OAAO,SAAS;AACtB,UAAI,MAAM,iBAAiB,MAAM,eAAe;AAC/C,cAAM,eAAe,KAAK;AAC1B,cAAM,OAAO,KAAK;AAGlB,YAAI,CAAC,UAAU,YAAY,GAAG;AAC7B,gBAAM,YAA2C,CAAC;AAClD,gBAAM,iBAAiB,oBAAI,IAAY;AACvC,gBAAM,aAAa,GAAG,OAAO;AAC7B,qBAAW,CAAC,GAAG,EAAE,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AACjD,gBAAI,CAAC,EAAE,WAAW,UAAU,KAAK,EAAE,SAAS,WAAW,EAAG;AAC1D,kBAAM,YAAY,EAAE,MAAM,WAAW,MAAM;AAC3C,gBAAI,UAAU,SAAS,IAAI,EAAG;AAC9B,2BAAe,IAAI,SAAS;AAC5B,sBAAU,SAAS,IAAI;AAAA,cACtB,MAAM,GAAG;AAAA,cACT,GAAI,GAAG,KAAK,SAAS,IAClB;AAAA,gBACA,MAAM,GAAG,KAAK;AAAA,kBAAI,CAAC,MAClB,EAAE,WAAW,UAAU,IAAI,EAAE,MAAM,WAAW,MAAM,IAAI;AAAA,gBACzD;AAAA,cACD,IACC,CAAC;AAAA,YACL;AAAA,UACD;AAEA,gBAAM,aAAuB,CAAC;AAC9B,gBAAM,eAAe,oBAAI,IAAoB;AAC7C,qBAAW,KAAK,OAAO,OAAO,SAAS,GAAG;AACzC,uBAAW,OAAO,EAAE,QAAQ,CAAC,GAAG;AAC/B,kBAAI,CAAC,eAAe,IAAI,GAAG,KAAK,CAAC,aAAa,IAAI,GAAG,GAAG;AACvD,sBAAM,QAAQ,IAAI,GAAG;AACrB,2BAAW,KAAK,KAAK;AACrB,6BAAa,IAAI,KAAK,KAAK;AAAA,cAC5B;AAAA,YACD;AAAA,UACD;AAEA,qBAAW,KAAK,OAAO,OAAO,SAAS,GAAG;AACzC,gBAAI,EAAE,KAAM,GAAE,OAAO,EAAE,KAAK,IAAI,CAAC,MAAM,aAAa,IAAI,CAAC,KAAK,CAAC;AAAA,UAChE;AAEA,gBAAM,WAAW,oBAAI,IAAY;AACjC,qBAAW,KAAK,OAAO,OAAO,SAAS,GAAG;AACzC,uBAAW,OAAO,EAAE,QAAQ,CAAC,GAAG;AAC/B,kBAAI,eAAe,IAAI,GAAG,EAAG,UAAS,IAAI,GAAG;AAAA,YAC9C;AAAA,UACD;AACA,gBAAM,mBAAmB,CAAC,GAAG,cAAc,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;AAC3E,gBAAM,aAAa,iBAAiB,CAAC,KAAK,CAAC,GAAG,cAAc,EAAE,IAAI;AAElE,oBAAU,YAAY,IAAI,EAAE,QAAQ,YAAY,OAAO,WAAW,QAAQ,WAAW;AAAA,QACtF;AAEA,eAAO,MAAM,OAAO;AACpB,qBAAa,OAAO,IAAI,EAAE,MAAM,YAAY,UAAU,cAAc,KAAK;AACzE,8BAAsB,IAAI,OAAO;AACjC;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAGA,QAAM,eAAe,oBAAI,IAAsE;AAC/F,aAAW,WAAW,KAAK,WAAW;AACrC,QAAI,sBAAsB,IAAI,OAAO,EAAG;AACxC,UAAM,WAA0C,CAAC;AACjD,UAAM,SAAS,GAAG,OAAO;AACzB,eAAW,CAAC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK,KAAK,GAAG;AAC1D,UAAI,KAAK,SAAS,WAAW,EAAG;AAChC,UAAI,CAAC,KAAK,WAAW,MAAM,EAAG;AAC9B,YAAM,YAAY,KAAK,MAAM,OAAO,MAAM;AAC1C,UAAI,UAAU,SAAS,IAAI,EAAG;AAC9B,eAAS,SAAS,IAAI;AAAA,QACrB,MAAM,SAAS;AAAA,QACf,GAAI,SAAS,KAAK,SAAS,IACxB;AAAA,UACA,MAAM,SAAS,KAAK,IAAI,CAAC,MAAO,EAAE,WAAW,MAAM,IAAI,EAAE,MAAM,OAAO,MAAM,IAAI,CAAE;AAAA,QACnF,IACC,CAAC;AAAA,MACL;AAAA,IACD;AACA,UAAM,cAAc,KAAK;AAAA,MACxB,OAAO;AAAA,QACN,OAAO,QAAQ,QAAQ,EACrB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,EACrC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;AAAA,MAC5D;AAAA,IACD;AACA,QAAI,CAAC,aAAa,IAAI,WAAW,GAAG;AACnC,mBAAa,IAAI,aAAa,CAAC,CAAC;AAAA,IACjC;AACA,iBAAa,IAAI,WAAW,EAAG,KAAK,EAAE,MAAM,SAAS,OAAO,SAAS,CAAC;AAAA,EACvE;AAGA,aAAW,CAAC,EAAE,KAAK,KAAK,cAAc;AACrC,QAAI,MAAM,SAAS,EAAG;AACtB,UAAM,eAAe,GAAG,MAAM,CAAC,EAAG,IAAI;AACtC,UAAM,WAAW,MAAM,CAAC,EAAG;AAC3B,UAAM,aAAa,IAAI,IAAI,OAAO,KAAK,QAAQ,CAAC;AAGhD,UAAM,SAAmB,CAAC;AAC1B,UAAM,eAAe,oBAAI,IAAoB;AAC7C,eAAW,KAAK,OAAO,OAAO,QAAQ,GAAG;AACxC,iBAAW,OAAO,EAAE,QAAQ,CAAC,GAAG;AAC/B,YAAI,CAAC,WAAW,IAAI,GAAG,KAAK,CAAC,aAAa,IAAI,GAAG,GAAG;AACnD,gBAAM,QAAQ,IAAI,GAAG;AACrB,iBAAO,KAAK,KAAK;AACjB,uBAAa,IAAI,KAAK,KAAK;AAAA,QAC5B;AAAA,MACD;AAAA,IACD;AAGA,UAAM,WAAW,oBAAI,IAAY;AACjC,eAAW,KAAK,OAAO,OAAO,QAAQ,GAAG;AACxC,iBAAW,OAAO,EAAE,QAAQ,CAAC,GAAG;AAC/B,YAAI,WAAW,IAAI,GAAG,EAAG,UAAS,IAAI,GAAG;AAAA,MAC1C;AAAA,IACD;AACA,UAAM,mBAAmB,CAAC,GAAG,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;AACvE,UAAM,SAAS,iBAAiB,CAAC,KAAK,CAAC,GAAG,UAAU,EAAE,IAAI;AAG1D,UAAM,YAA2C,CAAC;AAClD,eAAW,CAAC,OAAO,KAAK,KAAK,OAAO,QAAQ,QAAQ,GAAG;AACtD,gBAAU,KAAK,IAAI;AAAA,QAClB,GAAG;AAAA,QACH,MAAM,MAAM,MAAM,IAAI,CAAC,MAAM,aAAa,IAAI,CAAC,KAAK,CAAC;AAAA,MACtD;AAAA,IACD;AAEA,cAAU,YAAY,IAAI,EAAE,QAAQ,OAAO,WAAW,OAAO;AAG7D,eAAW,UAAU,OAAO;AAC3B,aAAO,MAAM,OAAO,IAAI;AAExB,YAAM,aAAqC,CAAC;AAC5C,YAAM,mBAAmB,IAAI,IAAI,OAAO,KAAK,OAAO,KAAK,CAAC;AAC1D,iBAAW,KAAK,OAAO,OAAO,OAAO,KAAK,GAAG;AAC5C,mBAAW,OAAO,EAAE,QAAQ,CAAC,GAAG;AAC/B,cAAI,CAAC,iBAAiB,IAAI,GAAG,GAAG;AAE/B,kBAAM,QAAQ,aAAa,IAAI,GAAG,KAAK,IAAI,GAAG;AAC9C,uBAAW,KAAK,IAAI;AAAA,UACrB;AAAA,QACD;AAAA,MACD;AACA,mBAAa,OAAO,IAAI,IAAI;AAAA,QAC3B,MAAM;AAAA,QACN,UAAU;AAAA,QACV,MAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AAEA,QAAM,WAAiE;AAAA,IACtE,GAAG;AAAA,IACH,GAAG;AAAA,EACJ;AAEA,QAAM,SAAoB,EAAE,MAAM,KAAK,MAAM,OAAO,SAAS;AAC7D,MAAI,OAAO,KAAK,SAAS,EAAE,SAAS,EAAG,QAAO,YAAY;AAC1D,MAAI,cAAc,SAAS,EAAG,QAAO,WAAW;AAEhD,SAAO;AACR;AA+BO,SAAS,SAAS,OAAkB,OAAkC;AAC5E,QAAM,UAA2B,CAAC;AAGlC,MAAI,MAAM,SAAS,MAAM,MAAM;AAC9B,YAAQ,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,MAAM;AAAA,MACN,QAAQ,IAAI,MAAM,IAAI,aAAQ,MAAM,IAAI;AAAA,IACzC,CAAC;AAAA,EACF;AAGA,QAAM,SAAS,IAAI,IAAI,OAAO,KAAK,MAAM,KAAK,CAAC;AAC/C,QAAM,SAAS,IAAI,IAAI,OAAO,KAAK,MAAM,KAAK,CAAC;AAE/C,aAAW,QAAQ,QAAQ;AAC1B,QAAI,CAAC,OAAO,IAAI,IAAI,GAAG;AACtB,YAAM,IAAI,MAAM,MAAM,IAAI;AAC1B,cAAQ,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,SAAS,IAAI;AAAA,QACnB,QAAQ,SAAS,EAAE,IAAI;AAAA,MACxB,CAAC;AAAA,IACF;AAAA,EACD;AACA,aAAW,QAAQ,QAAQ;AAC1B,QAAI,CAAC,OAAO,IAAI,IAAI,GAAG;AACtB,cAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,SAAS,IAAI,GAAG,CAAC;AAAA,IACxD;AAAA,EACD;AACA,aAAW,QAAQ,QAAQ;AAC1B,QAAI,CAAC,OAAO,IAAI,IAAI,EAAG;AACvB,UAAM,IAAI,MAAM,MAAM,IAAI;AAC1B,UAAM,IAAI,MAAM,MAAM,IAAI;AAC1B,QAAI,KAAK,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,GAAG;AAC5C,YAAM,UAAoB,CAAC;AAC3B,UAAI,EAAE,SAAS,EAAE,KAAM,SAAQ,KAAK,SAAS,EAAE,IAAI,WAAM,EAAE,IAAI,EAAE;AACjE,UAAI,KAAK,UAAW,EAAoB,IAAI,MAAM,KAAK,UAAW,EAAoB,IAAI,GAAG;AAC5F,gBAAQ,KAAK,cAAc;AAAA,MAC5B;AACA,UAAK,EAAoB,OAAQ,EAAoB,IAAI;AACxD,gBAAQ,KAAK,OAAQ,EAAoB,EAAE,WAAO,EAAoB,EAAE,EAAE;AAAA,MAC3E;AACA,UACC,KAAK,UAAW,EAAoB,MAAM,MAAM,KAAK,UAAW,EAAoB,MAAM,GACzF;AACD,gBAAQ,KAAK,gBAAgB;AAAA,MAC9B;AACA,cAAQ,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,SAAS,IAAI;AAAA,QACnB,QAAQ,QAAQ,KAAK,IAAI,KAAK;AAAA,MAC/B,CAAC;AAAA,IACF;AAAA,EACD;AAGA,QAAM,QAAQ,MAAM,aAAa,CAAC;AAClC,QAAM,QAAQ,MAAM,aAAa,CAAC;AAClC,QAAM,aAAa,IAAI,IAAI,OAAO,KAAK,KAAK,CAAC;AAC7C,QAAM,aAAa,IAAI,IAAI,OAAO,KAAK,KAAK,CAAC;AAE7C,aAAW,QAAQ,YAAY;AAC9B,QAAI,CAAC,WAAW,IAAI,IAAI,GAAG;AAC1B,cAAQ,KAAK,EAAE,MAAM,SAAS,MAAM,aAAa,IAAI,GAAG,CAAC;AAAA,IAC1D;AAAA,EACD;AACA,aAAW,QAAQ,YAAY;AAC9B,QAAI,CAAC,WAAW,IAAI,IAAI,GAAG;AAC1B,cAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,aAAa,IAAI,GAAG,CAAC;AAAA,IAC5D;AAAA,EACD;AACA,aAAW,QAAQ,YAAY;AAC9B,QAAI,CAAC,WAAW,IAAI,IAAI,EAAG;AAC3B,QAAI,KAAK,UAAU,MAAM,IAAI,CAAC,MAAM,KAAK,UAAU,MAAM,IAAI,CAAC,GAAG;AAChE,cAAQ,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,aAAa,IAAI;AAAA,QACvB,QAAQ;AAAA,MACT,CAAC;AAAA,IACF;AAAA,EACD;AAGA,QAAM,MAAM,MAAM,YAAY,CAAC;AAC/B,QAAM,MAAM,MAAM,YAAY,CAAC;AAC/B,QAAM,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,KAAK,EAAE,EAAE,EAAE,CAAC;AAC3D,QAAM,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE,IAAI,KAAK,EAAE,EAAE,EAAE,CAAC;AAE3D,aAAW,MAAM,KAAK;AACrB,UAAM,MAAM,GAAG,GAAG,IAAI,KAAK,GAAG,EAAE;AAChC,QAAI,CAAC,OAAO,IAAI,GAAG,GAAG;AACrB,cAAQ,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,YAAY,GAAG;AAAA,QACrB,QAAQ,kBAAkB,GAAG,iBAAiB,EAAE;AAAA,MACjD,CAAC;AAAA,IACF;AAAA,EACD;AACA,aAAW,MAAM,KAAK;AACrB,UAAM,MAAM,GAAG,GAAG,IAAI,KAAK,GAAG,EAAE;AAChC,QAAI,CAAC,OAAO,IAAI,GAAG,GAAG;AACrB,cAAQ,KAAK,EAAE,MAAM,WAAW,MAAM,YAAY,GAAG,GAAG,CAAC;AAAA,IAC1D;AAAA,EACD;AACA,aAAW,MAAM,KAAK;AACrB,UAAM,MAAM,GAAG,GAAG,IAAI,KAAK,GAAG,EAAE;AAChC,UAAM,cAAc,IAAI,KAAK,CAAC,MAAM,EAAE,SAAS,GAAG,QAAQ,EAAE,OAAO,GAAG,EAAE;AACxE,QAAI,eAAe,KAAK,UAAU,EAAE,MAAM,KAAK,UAAU,WAAW,GAAG;AACtE,cAAQ,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,YAAY,GAAG;AAAA,QACrB,QAAQ,kBAAkB,GAAG,iBAAiB,EAAE,WAAM,YAAY,iBAAiB,EAAE;AAAA,MACtF,CAAC;AAAA,IACF;AAAA,EACD;AAGA,QAAM,QAAQ,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE;AACxD,QAAM,UAAU,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,EAAE;AAC5D,QAAM,UAAU,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,EAAE;AAC5D,QAAM,QAAkB,CAAC;AACzB,MAAI,MAAO,OAAM,KAAK,GAAG,KAAK,QAAQ;AACtC,MAAI,QAAS,OAAM,KAAK,GAAG,OAAO,UAAU;AAC5C,MAAI,QAAS,OAAM,KAAK,GAAG,OAAO,UAAU;AAC5C,QAAM,UAAU,MAAM,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI;AAEtD,SAAO,EAAE,SAAS,QAAQ;AAC3B;AAiCA,IAAM,4BAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA6ClC,SAAS,YAAY,MAAsB;AAC1C,QAAM,QAAQ,KAAK,MAAM,0CAA0C;AACnE,SAAO,QAAQ,MAAM,CAAC,IAAK;AAC5B;AAgBA,eAAsB,WACrB,SACA,SACA,MACqB;AACrB,MAAI,eAAe;AAGnB,QAAM,gBACL,MAAM,uBAAuB,MAAM,UAAU,sBAAsB,KAAK,OAAO,IAAI;AACpF,MAAI,eAAe;AAClB,oBAAgB;AAAA;AAAA;AAAA,EAAkD,aAAa;AAAA,EAChF;AACA,MAAI,MAAM,mBAAmB;AAC5B,oBAAgB;AAAA;AAAA,EAAO,KAAK,iBAAiB;AAAA,EAC9C;AAEA,QAAM,WAA0B;AAAA,IAC/B,EAAE,MAAM,UAAU,SAAS,aAAa;AAAA,IACxC,EAAE,MAAM,QAAQ,SAAS,QAAQ;AAAA,EAClC;AAEA,QAAM,YAAY,QAAQ,OAAO,UAAU;AAAA,IAC1C,OAAO,MAAM;AAAA,IACb,aAAa,MAAM,eAAe;AAAA,IAClC,WAAW,MAAM;AAAA,EAClB,CAAC;AAGD,QAAM,WAAY,MAAM;AACxB,MAAI,UAAU,SAAS,QAAQ,KAAK;AAEpC,MAAI,QAAQ,WAAW,KAAK,GAAG;AAC9B,cAAU,YAAY,OAAO;AAAA,EAC9B;AAEA,MAAI;AACJ,MAAI;AACH,aAAS,KAAK,MAAM,OAAO;AAAA,EAC5B,QAAQ;AACP,UAAM,IAAI,MAAM,+CAA+C,QAAQ,MAAM,GAAG,GAAG,CAAC,EAAE;AAAA,EACvF;AAEA,QAAM,aAAa,aAAa,MAAM;AACtC,MAAI,CAAC,WAAW,OAAO;AACtB,UAAM,IAAI,MAAM;AAAA,EAAmC,WAAW,OAAO,KAAK,IAAI,CAAC,EAAE;AAAA,EAClF;AAEA,MAAI,OAAO;AAGX,MAAI,MAAM,SAAS;AAClB,UAAM,YAAY,KAAK,iBAAiB;AACxC,aAAS,UAAU,GAAG,WAAW,WAAW,WAAW;AACtD,YAAM,oBAAoB,2BAA2B,MAAM,KAAK,OAAO;AACvE,UAAI,kBAAkB,MAAO;AAE7B,UAAI,YAAY,WAAW;AAE1B,cAAM,IAAI;AAAA,UACT,+CAA+C,SAAS;AAAA,EAAsB,kBAAkB,OAAO,KAAK,IAAI,CAAC;AAAA,QAClH;AAAA,MACD;AAGA,aAAO,MAAM;AAAA,QACZ;AAAA,QACA;AAAA,EAA8B,kBAAkB,OAAO,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA,QACjE;AAAA,QACA,EAAE,GAAG,MAAM,oBAAoB,cAAc;AAAA,MAC9C;AAAA,IACD;AAAA,EACD;AAEA,SAAO;AACR;AAqBA,eAAsB,UACrB,aACAC,WACA,SACA,MACqB;AACrB,MAAI,eAAe;AACnB,MAAI,MAAM,oBAAoB;AAC7B,oBAAgB;AAAA;AAAA;AAAA,EAA2B,KAAK,kBAAkB;AAAA,EACnE;AACA,MAAI,MAAM,mBAAmB;AAC5B,oBAAgB;AAAA;AAAA,EAAO,KAAK,iBAAiB;AAAA,EAC9C;AAEA,QAAM,WAA0B;AAAA,IAC/B,EAAE,MAAM,UAAU,SAAS,aAAa;AAAA,IACxC;AAAA,MACC,MAAM;AAAA,MACN,SAAS;AAAA,EAAuB,KAAK,UAAU,aAAa,MAAM,CAAC,CAAC;AAAA;AAAA,wBAA6BA,SAAQ;AAAA;AAAA;AAAA,IAC1G;AAAA,EACD;AAEA,QAAM,YAAY,QAAQ,OAAO,UAAU;AAAA,IAC1C,OAAO,MAAM;AAAA,IACb,aAAa,MAAM,eAAe;AAAA,IAClC,WAAW,MAAM;AAAA,EAClB,CAAC;AAGD,QAAM,WAAY,MAAM;AACxB,MAAI,UAAU,SAAS,QAAQ,KAAK;AAEpC,MAAI,QAAQ,WAAW,KAAK,GAAG;AAC9B,cAAU,YAAY,OAAO;AAAA,EAC9B;AAEA,MAAI;AACJ,MAAI;AACH,aAAS,KAAK,MAAM,OAAO;AAAA,EAC5B,QAAQ;AACP,UAAM,IAAI,MAAM,8CAA8C,QAAQ,MAAM,GAAG,GAAG,CAAC,EAAE;AAAA,EACtF;AAEA,QAAM,aAAa,aAAa,MAAM;AACtC,MAAI,CAAC,WAAW,OAAO;AACtB,UAAM,IAAI,MAAM;AAAA,EAAkC,WAAW,OAAO,KAAK,IAAI,CAAC,EAAE;AAAA,EACjF;AAEA,SAAO;AACR;;;AC19CA;AAAA;AAAA;AAAA;AAAA;AA4EO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EACvC;AAAA,EACA;AAAA,EACQ;AAAA,EACA;AAAA,EAEjB,YAAY,QAAe,MAA+B;AACzD,UAAM,KAAK,QAAQ,GAAG,OAAO,IAAI,YAAY,KAAK,KAAK;AACvD,SAAK,UAAU;AACf,SAAK,gBAAgB,KAAK;AAE1B,UAAM,eAIF;AAAA,MACH,MAAM,KAAK,QAAQ;AAAA,MACnB,MAAM;AAAA,IACP;AACA,QAAI,KAAK,mBAAmB,KAAM,cAAa,kBAAkB,KAAK;AAEtE,SAAK,WAAW,eAAe,QAAQ,KAAK,UAAU,YAAY;AAClE,SAAK,aAAa,KAAK,SAAS;AAIhC,SAAK,MAAM,YAAY,KAAK,QAAQ;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBA,eACC,MACsB;AACtB,UAAM,QAAQ,MAAM,SAAS,KAAK;AAClC,UAAM,eAAqC;AAAA,MAC1C,GAAG;AAAA,MACH,GAAI,SAAS,OAAO,EAAE,MAAM,IAAI,CAAC;AAAA,IAClC;AACA,WAAO,KAAK,QAAQ,SAAS,YAAY;AAAA,EAC1C;AAAA;AAAA,EAGA,IAAI,SAAgB;AACnB,WAAO,KAAK;AAAA,EACb;AACD;AA2BO,SAAS,iBACf,QACA,MACwB;AACxB,SAAO,IAAI,sBAAsB,QAAQ,IAAI;AAC9C;;;AC1KA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;AC6CO,SAAS,mBACf,QACA,aACA,QACA,MACgB;AAChB,SAAO;AAAA,IACN,CAAC,MAAuB;AAAA,IACxB,CAAC,CAAC,KAAK,MAAM;AACZ,UAAI,SAAS,KAAM;AACnB,YAAM,QAAQ,OAAO,KAAU;AAC/B,iBAAW,QAAQ,OAAO;AACzB,oBAAY,QAAQ,IAAI;AAAA,MACzB;AAAA,IACD;AAAA,IACA,EAAE,MAAM,MAAM,QAAQ,gBAAgB;AAAA,EACvC;AACD;AAqDO,SAAS,iBACfC,aACA,aACA,MACgB;AAChB,QAAM,kBAAkB,MAAM,mBAAmB;AAEjD,SAAO;AAAA,IACN,CAACA,WAAU;AAAA,IACX,CAAC,CAAC,OAAO,MAAM;AACd,UAAI,WAAW,KAAM;AACrB,YAAM,OAAO,MAAM,QAAQ,OAAO,IAAK,UAA2B,CAAC,OAAqB;AAExF,iBAAW,OAAO,MAAM;AACvB,mBAAW,QAAQ,IAAI,OAAO;AAE7B,cAAI,KAAK,SAAS,KAAK,cAAc,MAAM,CAAC,MAAM,EAAE,IAAI,EAAG;AAG3D,cAAI,CAAC,KAAK,UAAU,CAAC,KAAK,gBAAgB,KAAK,aAAa,WAAW,IAAI;AAC1E,wBAAY,QAAQ;AAAA,cACnB,QAAQ;AAAA,cACR,SAAS,QAAQ,KAAK,OAAO,oBAAoB,IAAI,KAAK;AAAA,cAC1D,UAAU,OAAO,IAAI,MAAM;AAAA,cAC3B,cAAc,CAAC,WAAW;AAAA,cAC1B,kBAAkB,CAAC,KAAK,OAAO;AAAA,cAC/B,UAAU;AAAA,YACX,CAAC;AACD;AAAA,UACD;AAGA,cAAI,KAAK,cAAc;AACtB,uBAAW,SAAS,KAAK,cAAc;AACtC,kBAAI,MAAM,KAAM;AAChB,0BAAY,QAAQ;AAAA,gBACnB,QAAQ;AAAA,gBACR,SAAS,GAAG,KAAK,OAAO,KAAK,MAAM,KAAK,YAAY,IAAI,KAAK;AAAA,gBAC7D,UAAU,MAAM;AAAA,gBAChB,cAAc,CAAC,WAAW;AAAA,gBAC1B,kBAAkB,CAAC,KAAK,OAAO;AAAA,gBAC/B,UAAU;AAAA,cACX,CAAC;AAAA,YACF;AAAA,UACD;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,MAAM,QAAQ,qBAAqB;AAAA,EAC5C;AACD;AAuBO,SAAS,WACf,SACA,QACU;AACV,SAAO,UAAU,SAAS,MAAM,QAAQ,OAAO,CAAC,CAAY;AAC7D;AAkCO,SAAS,mBACf,QACA,OACkB;AAClB,SAAO;AAAA,IACN,CAAC,QAAyB,KAAsB;AAAA,IAChD,CAAC,CAAC,GAAG,CAAC,MAAM;AACX,YAAM,OAAO;AACb,YAAM,OAAO;AAEb,YAAM,YAAY,IAAI,IAA4B,KAAK,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;AACvF,YAAM,WAAW,IAAI,IAA4B,KAAK,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;AAEtF,YAAM,SAAS,oBAAI,IAAI,CAAC,GAAG,UAAU,KAAK,GAAG,GAAG,SAAS,KAAK,CAAC,CAAC;AAChE,YAAM,aAA8B,CAAC;AACrC,YAAM,cAAwB,CAAC;AAC/B,YAAM,WAAqB,CAAC;AAE5B,iBAAW,MAAM,QAAQ;AACxB,cAAM,KAAK,UAAU,IAAI,EAAE;AAC3B,cAAM,KAAK,SAAS,IAAI,EAAE;AAC1B,cAAM,cAAc,IAAI,SAAS;AACjC,cAAM,aAAa,IAAI,SAAS;AAEhC,cAAM,cAAc,IAAI,eACrB,GAAG,aAAa,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,SACtC;AACH,cAAM,aAAa,IAAI,eACpB,GAAG,aAAa,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,SACtC;AACH,cAAM,YACL,gBAAgB,UAAa,eAAe,SACzC,aAAa,cACb;AAEJ,mBAAW,KAAK,EAAE,QAAQ,IAAI,QAAQ,aAAa,OAAO,YAAY,UAAU,CAAC;AACjF,YAAI,eAAe,CAAC,WAAY,aAAY,KAAK,EAAE;AACnD,YAAI,CAAC,eAAe,WAAY,UAAS,KAAK,EAAE;AAAA,MACjD;AAEA,aAAO;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA,iBAAiB,SAAS,SAAS,YAAY;AAAA,MAChD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,aAAa;AAAA,EACtB;AACD;AAiBO,SAAS,mBACf,QACA,aACiB;AACjB,QAAM,cACL,eAAe,OACZ,OACA,MAAM,QAAQ,WAAW,IACvB,MAAM,WAAgC,IACtC;AAEN,QAAM,OAAwB,CAAC,MAAuB;AACtD,MAAI,YAAa,MAAK,KAAK,WAAW;AAEtC,SAAO;AAAA,IACN;AAAA,IACA,CAAC,WAAW;AACX,YAAM,QAAQ,OAAO,CAAC;AACtB,YAAM,MAAM,cAAc,IAAI,IAAI,OAAO,CAAC,CAAsB,IAAI;AAEpE,YAAM,WAAW,oBAAI,IAAY;AACjC,iBAAW,QAAQ,OAAO;AACzB,mBAAW,MAAM,KAAK,oBAAoB,CAAC,GAAG;AAC7C,cAAI,OAAO,QAAQ,IAAI,IAAI,EAAE,EAAG,UAAS,IAAI,EAAE;AAAA,QAChD;AAAA,MACD;AACA,aAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;AAAA,IAC3B;AAAA,IACA,EAAE,MAAM,uBAAuB;AAAA,EAChC;AACD;AAkDO,SAAS,iBACf,QACA,aACA,QACA,MACgB;AAChB,QAAM,kBAAkB,MAAM,mBAAmB;AAEjD,WAAS,cAAc,QAAkC;AACxD,UAAM,QAAsB,CAAC;AAC7B,eAAW,OAAO,OAAO,cAAc,CAAC,GAAG;AAC1C,YAAM,KAAK;AAAA,QACV,QAAQ;AAAA,QACR,SAAS,SAAS,IAAI,IAAI,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,QACrD,UAAU,IAAI;AAAA,QACd,cAAc,CAAC,IAAI,IAAI;AAAA,QACvB,UAAU;AAAA,MACX,CAAC;AAAA,IACF;AACA,eAAW,QAAQ,OAAO,gBAAgB,CAAC,GAAG;AAC7C,YAAM,KAAK;AAAA,QACV,QAAQ;AAAA,QACR,SAAS,iBAAiB,KAAK,MAAM;AAAA,QACrC,UAAU,KAAK;AAAA,QACf,cAAc,CAAC,KAAK,IAAI;AAAA,QACxB,kBAAkB,CAAC,KAAK,MAAM;AAAA,QAC9B,UAAU;AAAA,MACX,CAAC;AAAA,IACF;AACA,WAAO;AAAA,EACR;AAEA,QAAM,UAAU,UAAU;AAE1B,SAAO;AAAA,IACN,CAAC,MAAuB;AAAA,IACxB,CAAC,CAAC,MAAM,MAAM;AACb,UAAI,UAAU,KAAM;AACpB,iBAAW,QAAQ,QAAQ,MAAoB,GAAG;AACjD,oBAAY,QAAQ,IAAI;AAAA,MACzB;AAAA,IACD;AAAA,IACA,EAAE,MAAM,MAAM,QAAQ,qBAAqB;AAAA,EAC5C;AACD;AAgCO,SAAS,aACf,OACA,WACA,MACgB;AAChB,SAAO;AAAA,IACN,CAAC,MAAM,MAAuB;AAAA,IAC9B,CAAC,CAAC,IAAI,MAAM;AACX,UAAI,QAAQ,KAAM;AAIlB,WAAK,UAAU,IAAS;AAAA,IACzB;AAAA,IACA,EAAE,MAAM,MAAM,QAAQ,gBAAgB;AAAA,EACvC;AACD;;;ACvaO,IAAM,cAAqC;AAAA,EACjD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD;AAmDO,SAAS,YAAY,WAAsB,cAAyC;AAC1F,SAAO,GAAG,SAAS,SAAI,YAAY;AACpC;AA0BO,SAAS,uBAAuB,QAAqC;AAC3E,QAAM,IAAI,OAAO,OAAO,YAAY;AACpC,MACC,EAAE,SAAS,OAAO,KAClB,EAAE,SAAS,MAAM,KACjB,EAAE,SAAS,QAAQ,KACnB,EAAE,SAAS,YAAY,KACvB,EAAE,SAAS,QAAQ,GAClB;AACD,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAgCO,IAAM,2BAAqD;AAAA,EACjE,UAAU;AAAA,EACV,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,KAAK;AACN;AAGO,IAAM,qBAAqB,KAAK,OAAO,IAAI,KAAK;AAiBhD,IAAM,wBAAyD;AAAA,EACrE,YAAY,EAAE,OAAO,MAAM;AAAA,EAC3B,kBAAkB,EAAE,OAAO,KAAK;AAAA,EAChC,eAAe,EAAE,OAAO,KAAK;AAAA,EAC7B,SAAS,EAAE,OAAO,OAAO,WAAW,MAAM;AAC3C;;;AClJO,SAAS,gBAAqC;AACpD,QAAM,OAAO,YAAwC,EAAE,MAAM,mBAAmB,CAAC;AAGjF,QAAM,WAAW;AAAA,IAChB,CAAC,KAAK,OAAO;AAAA,IACb,CAAC,CAAC,OAAO,MAAM;AACd,YAAM,MAAM;AAEZ,aAAO,IAAI,IAAI,GAAG;AAAA,IACnB;AAAA,IACA;AAAA,MACC,MAAM;AAAA,MACN,QAAQ,CAAC,GAAG,MAAM;AACjB,cAAM,KAAK;AACX,cAAM,KAAK;AACX,YAAI,GAAG,SAAS,GAAG,KAAM,QAAO;AAChC,mBAAW,CAAC,GAAG,CAAC,KAAK,IAAI;AACxB,gBAAM,KAAK,GAAG,IAAI,CAAC;AACnB,cAAI,CAAC,MAAM,EAAE,aAAa,GAAG,YAAY,EAAE,cAAc,GAAG,UAAW,QAAO;AAAA,QAC/E;AACA,eAAO;AAAA,MACR;AAAA,IACD;AAAA,EACD;AAEA,WAAS,OAAO,WAAsB,cAA4B,SAAwB;AACzF,UAAM,MAAM,YAAY,WAAW,YAAY;AAC/C,UAAM,WAAW,KAAK,IAAI,GAAG;AAC7B,UAAM,YAAY,UAAU,YAAY,KAAK;AAC7C,UAAM,aAAa,UAAU,aAAa,MAAM,UAAU,IAAI;AAC9D,SAAK,IAAI,KAAK;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,YAAY;AAAA,IAC1B,CAAC;AAAA,EACF;AAEA,WAAS,OAAO,WAAsB,cAAuD;AAC5F,WAAO,KAAK,IAAI,YAAY,WAAW,YAAY,CAAC;AAAA,EACrD;AAGA,QAAM,SAAS,SAAS,UAAU,MAAM;AAAA,EAAC,CAAC;AAE1C,WAAS,UAAgB;AACxB,WAAO;AAAA,EACR;AAEA,SAAO,EAAE,MAAM,UAAU,QAAQ,QAAQ,QAAQ;AAClD;AAkBO,SAAS,cACf,MACA,UACA,mBACA,SACA,SACe;AACf,QAAM,kBAAkB,EAAE,GAAG,0BAA0B,GAAG,SAAS,gBAAgB;AACnF,QAAM,YAAY,SAAS,aAAa;AACxC,QAAM,yBAAyB,SAAS,0BAA0B;AAClE,QAAM,qBAAqB,SAAS,sBAAsB;AAE1D,QAAM,OAAwB,CAAC,MAAM,UAAU,iBAAiB;AAChE,MAAI,QAAS,MAAK,KAAK,OAAO;AAE9B,SAAO;AAAA,IACN;AAAA,IACA,CAAC,WAAW;AACX,YAAM,MAAM,OAAO,CAAC;AACpB,YAAM,QAAQ,OAAO,CAAC;AACtB,YAAM,SAAS,OAAO,CAAC;AACvB,YAAM,MAAM,UAAW,OAAO,CAAC,IAAe;AAG9C,YAAM,aAAa,gBAAgB,IAAI,YAAY,QAAQ;AAC3D,YAAM,cAAc,YAAY,IAAI,UAAU;AAC9C,UAAI,QAAQ,MAAM,YAAY,YAAY,WAAW,CAAC;AAGtD,YAAM,MAAM,YAAY,IAAI,WAAW,IAAI,YAAY;AACvD,YAAM,QAAQ,MAAM,IAAI,GAAG;AAC3B,UAAI,SAAS,MAAM,eAAe,wBAAwB;AACzD,iBAAS;AAAA,MACV;AAGA,eAAS,MAAM;AAEf,aAAO;AAAA,IACR;AAAA,IACA,EAAE,MAAM,iBAAiB;AAAA,EAC1B;AACD;;;AC7HA,IAAM,wBAAwB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAiB9B,IAAM,yBAAyB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAa/B,IAAM,wBAAwB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsBvB,IAAM,eAAN,cAA2B,MAAM;AAAA;AAAA,EAE9B;AAAA;AAAA,EAGA;AAAA;AAAA,EAGA;AAAA;AAAA,EAGA;AAAA;AAAA,EAGA;AAAA;AAAA,EAGA;AAAA;AAAA,EAGA;AAAA,EAET,YACC,MACA,QACA,QACA,OACA,UACA,eACA,cACA,mBACC;AACD,UAAM,IAAI;AACV,SAAK,SAAS;AACd,SAAK,SAAS;AACd,SAAK,QAAQ;AACb,SAAK,WAAW;AAChB,SAAK,gBAAgB;AACrB,SAAK,eAAe;AACpB,SAAK,oBAAoB;AAAA,EAC1B;AACD;AAsBO,SAAS,YAAY,MAAc,MAAwC;AACjF,QAAM,UAAU,KAAK;AACrB,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,QAAM,kBAAmC,KAAK,mBAAmB;AAGjE,QAAM,eAAe,oBAAI,IAA6B;AACtD,aAAW,SAAS,aAAa;AAChC,iBAAa,IAAI,OAAO;AAAA,MACvB,GAAG,sBAAsB,KAAK;AAAA,MAC9B,GAAG,KAAK,SAAS,KAAK;AAAA,IACvB,CAAC;AAAA,EACF;AAGA,QAAM,SAAS,IAAI,WAAuB,UAAU,EAAE,cAAc,CAAC;AAGrE,QAAM,WAAW,cAAc;AAO/B,QAAM,cAAc;AAAA,IACnB,OAAO;AAAA,IACP,SAAS;AAAA,EACV;AAEA,QAAM,aAAa;AAAA,IAClB;AAAA,IACA,CAAC,WAA4B;AAAA,IAC7B,KAAK,iBACH,CAAC,SAAkB;AACnB,YAAM,CAAC,MAAM,KAAK,IAAI;AAEtB,UAAI,CAAC,KAAM,QAAO;AAClB,aAAO,sBAAsB;AAAA,QAC5B;AAAA,QACA,KAAK,UAAU,MAAM,KAAK,MAAM,QAAQ,CAAC,CAAC;AAAA,MAC3C,EAAE,QAAQ,YAAY,KAAK,UAAU,IAAI,CAAC;AAAA,IAC3C;AAAA,IACD;AAAA,MACC,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,SAAS;AAAA,IACV;AAAA,EACD;AAGA,QAAM,cAAc,oBAAI,IAAyC;AACjE,aAAW,SAAS,aAAa;AAChC,gBAAY,IAAI,OAAO,IAAI,WAAwB,SAAS,KAAK,IAAI,EAAE,cAAc,CAAC,CAAC;AAAA,EACxF;AAQA,QAAM,cAAc,eAAe,YAA6B,WAA4B;AAC5F,QAAM,SAAS,OAAO,CAAC,WAA4B,GAAG,CAAC,CAAC,IAAI,MAAM;AACjE,QAAI,QAAQ,KAAM;AAClB,UAAM,CAAC,gBAAgB,UAAU,IAAI;AAIrC,QAAI,CAAC,kBAAkB,CAAC,eAAe,MAAO;AAC9C,UAAM,aAAa,aAAa,CAAC;AACjC,UAAM,SAAsB,EAAE,GAAG,YAAY,GAAG,eAAe;AAC/D,UAAM,QAAQ,YAAY,IAAI,OAAO,KAAK;AAC1C,QAAI,MAAO,OAAM,QAAQ,MAAM;AAAA,EAChC,CAAC;AACD,QAAM,cAAc,OAAO,UAAU,MAAM;AAAA,EAAC,CAAC;AAI7C,QAAM,YAAY,IAAI,MAAM,OAAO;AACnC,QAAM,kBAAkB,oBAAI,IAA6C;AAEzE,aAAW,SAAS,aAAa;AAChC,UAAM,SAAS,aAAa,IAAI,KAAK;AACrC,UAAM,QAAQ,YAAY,IAAI,KAAK;AAEnC,QAAI,OAAO,OAAO;AAEjB,gBAAU,IAAI,GAAG,KAAK,WAAW,MAAM,MAAuB;AAC9D,YAAM,OAAO,KAAkB,WAAW,GAAG,KAAK,SAAS,GAAG,KAAK,WAAW;AAAA,QAC7E,YAAY,OAAO;AAAA,QACnB,WAAW,OAAO;AAAA,MACnB,CAAC;AACD,sBAAgB,IAAI,OAAO,IAAI;AAAA,IAChC;AAAA,EACD;AAKA,QAAM,aAAa,IAAI,WAAwB,eAAe,EAAE,cAAc,CAAC;AAE/E,QAAM,eAA2C,CAAC;AAClD,aAAW,SAAS,aAAa;AAChC,UAAM,SAAS,aAAa,IAAI,KAAK;AACrC,QAAI,OAAO,SAAS,gBAAgB,IAAI,KAAK,GAAG;AAC/C,mBAAa,KAAK,gBAAgB,IAAI,KAAK,EAAG,IAAgC;AAAA,IAC/E,OAAO;AACN,mBAAa,KAAK,YAAY,IAAI,KAAK,EAAG,MAAkC;AAAA,IAC7E;AAAA,EACD;AACA,eAAa,KAAK,WAAW,MAAkC;AAE/D,QAAM,eAAe,MAA0B,GAAG,YAAY;AAE9D,QAAM,cAAc;AAAA,IACnB;AAAA,IACA,CAAC,YAA6B;AAAA,IAC9B,KAAK,kBACH,CAAC,SAAkB,uBAAuB,QAAQ,YAAY,KAAK,UAAU,IAAI,CAAC;AAAA,IACpF;AAAA,MACC,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,SAAS;AAAA,IACV;AAAA,EACD;AAcA,QAAM,qBAAqB;AAAA,IAC1B;AAAA,IACA;AAAA,EACD;AAGA,QAAM,gBAAgB,IAAI,WAAyB,kBAAkB,EAAE,cAAc,CAAC;AAQtF,QAAM,aAAa;AAAA,IAClB;AAAA,IACA,CAAC,kBAAmC;AAAA,IACpC,KAAK,iBACH,CAAC,YAAqB;AACtB,YAAM,CAAC,WAAW,IAAI,IAAI;AAC1B,aAAO,sBAAsB,QAAQ,iBAAiB,KAAK,UAAU,SAAS,CAAC,EAAE;AAAA,QAChF;AAAA,QACA,KAAK,UAAU,IAAI;AAAA,MACpB;AAAA,IACD;AAAA,IACD;AAAA,MACC,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,SAAS;AAAA,IACV;AAAA,EACD;AAMA,QAAM,gBAAgB;AAAA,IACrB;AAAA,IACA;AAAA,EACD;AAEA,QAAM,kBAAkB,KAAK,mBAAmB;AAChD,QAAM,kBAAkB,KAAK,IAAI,KAAK,mBAAmB,aAAa,IAAI,GAAG;AAC7E,QAAM,uBAAuB,KAAK,IAAI,KAAK,wBAAwB,kBAAkB,IAAI,GAAG;AAC5F,QAAM,eAAe,MAAM,CAAC;AAC5B,QAAM,oBAAoB,MAAM,CAAC;AASjC,QAAM,YAAY,KAAK,CAAC,aAA8B,GAAG,CAAC,WAAW,aAAa;AACjF,UAAMC,SAAQ,UAAU,CAAC;AACzB,QAAIA,UAAS,QAAQA,OAAM,WAAW,EAAG;AACzC,UAAM,SAASA,OAAMA,OAAM,SAAS,CAAC;AACrC,QAAI,UAAU,KAAM;AAEpB,UAAM,CAAC,IAAI,OAAO,IAAI;AAItB,UAAM,CAAC,SAAS,IAAI,IAAI,WAAW,CAAC,MAAM,IAAI;AAC9C,QAAI,CAAC,MAAM,CAAC,KAAM;AAGlB,UAAM,OAAwB;AAAA,MAC7B;AAAA,MACA,SAAS,SAAS,WAAW;AAAA,MAC7B,QAAQ,SAAS,UAAU;AAAA,IAC5B;AACA,UAAM,KAAmB;AAAA,MACxB;AAAA,MACA,WAAW;AAAA,MACX,UAAU,GAAG;AAAA,MACb,UAAU,GAAG,YAAY,CAAC;AAAA,MAC1B,YAAY,GAAG;AAAA,IAChB;AAEA,QAAI,GAAG,UAAU;AAChB,eAAS,OAAO,KAAK,WAAW,KAAK,cAAc,IAAI;AACvD,oBAAc,QAAQ,EAAE;AACxB;AAAA,IACD;AAGA,UAAM,WACL,GAAG,cACH,gBAAgB;AAAA,MACf;AAAA,MACA,SAAS;AAAA,MACT,QAAQ,GAAG,SAAS,KAAK,IAAI;AAAA,IAC9B,CAAC;AAEF,UAAM,cAAc,KAAK,YAAY;AAErC,QACC,aAAa,sBACb,cAAc,cACd,oBAAoB,cAAc,eAAe,GAChD;AACD,YAAM,MAAM,YAAY,IAAI;AAC5B,YAAM,YAAyB;AAAA,QAC9B,GAAG;AAAA,QACH,UAAU,cAAc;AAAA,QACxB,SAAS,UAAU,cAAc,CAAC,IAAI,UAAU,KAAK,GAAG,oCAA+B,GAAG,SAAS,KAAK,IAAI,CAAC;AAAA,QAC7G,WAAW,CAAC,GAAG;AAAA,MAChB;AACA,iBAAW,QAAQ,SAAS;AAAA,IAC7B,OAAO;AAEN,eAAS,OAAO,KAAK,WAAW,KAAK,cAAc,KAAK;AACxD,oBAAc,QAAQ,EAAE;AAExB,YAAM,MAAM,YAAY,IAAI;AAC5B,YAAM,mBAAmB,KAAK,iBAAiB;AAC/C,UACC,mBAAmB,mBACnB,oBAAoB,mBAAmB,oBAAoB,GAC1D;AACD,eAAO,QAAQ;AAAA,UACd,QAAQ;AAAA,UACR,SAAS,4BAA4B,GAAG;AAAA,UACxC,UAAU,GAAG,SAAS,KAAK,IAAI;AAAA,UAC/B,cAAc,KAAK;AAAA,UACnB,kBAAkB,KAAK;AAAA,UACvB,UAAU;AAAA,UACV,WAAW,CAAC,GAAG;AAAA,UACf,eAAe,mBAAmB;AAAA,QACnC,CAAC;AAAA,MACF;AAAA,IACD;AAAA,EACD,CAAC;AAED,QAAM,iBAAiB,UAAU,UAAU,MAAM;AAAA,EAAC,CAAC;AAQnD,QAAM,UAAU,IAAI;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AAGA,UAAQ,YAAY,WAAW;AAC/B,UAAQ,YAAY,cAAc;AAClC,UAAQ,YAAY,SAAS,OAAO;AAGpC,UAAQ,IAAI,UAAU,UAA2B;AACjD,UAAQ,IAAI,WAAW,WAA4B;AACnD,UAAQ,IAAI,UAAU,UAA2B;AACjD,UAAQ,IAAI,YAAY,SAAS,IAAqB;AAGtD,UAAQ,MAAM,UAAU,MAAM;AAC9B,aAAW,CAAC,OAAO,KAAK,KAAK,aAAa;AACzC,YAAQ,MAAM,SAAS,KAAK,IAAI,KAAK;AAAA,EACtC;AACA,UAAQ,MAAM,SAAS,SAAS;AAChC,UAAQ,MAAM,eAAe,UAAU;AACvC,UAAQ,MAAM,kBAAkB,aAAa;AAE7C,SAAO;AACR;;;AC5aO,SAAS,eACf,SACA,MACuB;AACvB,QAAM,OAAO,aAAa,SAAS,IAAI;AAEvC,QAAM,cAAsC,CAAC;AAC7C,aAAW,CAAC,OAAO,KAAK,KAAK,QAAQ,QAAQ;AAC5C,gBAAY,KAAK,IAAI,MAAM,SAAS,EAAE;AAAA,EACvC;AAEA,SAAO;AAAA,IACN,GAAG;AAAA,IACH;AAAA,IACA,iBAAiB,QAAQ,SAAS,KAAK,OAAO,QAAQ;AAAA,IACtD,cAAc,QAAQ,aAAa,SAAS;AAAA,IAC5C,mBAAmB,QAAQ,kBAAkB,SAAS;AAAA,EACvD;AACD;;;ACgBA,IAAM,eAAuC;AAAA,EAC5C,kBAAkB;AAAA,EAClB,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,0BAA0B;AAAA,EAC1B,UAAU;AACX;AAEA,WAAW,SAAS,aAAa;AAChC,eAAa,SAAS,KAAK,UAAU,IAAI;AAC1C;AA8BO,SAAS,aACf,SACA,MACqB;AACrB,QAAM,SAAS,MAAM,UAAU,QAAQ;AACvC,QAAM,SAAsB,MAAM,UAAU;AAC5C,QAAM,UAAU,YAAY;AAC5B,QAAM,eAAgC,CAAC;AACvC,QAAM,SAAuB,CAAC;AAE9B,WAAS,cAAsB;AAC9B,YAAQ,YAAY,IAAI,WAAW;AAAA,EACpC;AAEA,WAAS,aAAqB;AAC7B,WAAO,YAAY,EAAE,QAAQ,CAAC;AAAA,EAC/B;AAEA,WAAS,YAAY,OAAe,MAAsB,SAAwB;AACjF,UAAM,IAAI,YAAY;AACtB,UAAM,KAAiB,EAAE,SAAS,GAAG,OAAO,KAAK;AAEjD,QAAI,WAAW,WAAW;AACzB,SAAG,UAAU,UAAU,OAAO;AAAA,IAC/B;AACA,QAAI,WAAW,QAAQ;AACtB,SAAG,OAAO;AAAA,IACX;AAEA,WAAO,KAAK,EAAE;AAAA,EACf;AAEA,WAAS,UAAU,MAAc,OAAqB;AACrD,QAAI;AACH,YAAM,MAAM,QAAQ,QAAQ,MAAM;AAAA,QACjC,QAAQ;AAAA,QACR,QAAQ,CAAC,OAAO,UAAU;AACzB,cAAI,MAAM,SAAS,QAAQ;AAC1B,wBAAY,OAAO,QAAQ,MAAM,IAAI;AACrC,gBAAI,QAAQ;AACX,kBAAI,WAAW,WAAW;AACzB,uBAAO,IAAI,WAAW,CAAC,MAAM,MAAM,OAAO,CAAC,CAAC,SAAI;AAAA,cACjD,OAAO;AACN,sBAAM,UAAU,MAAM,SAAS,SAAY,IAAI,UAAU,MAAM,IAAI,CAAC,KAAK;AACzE,uBAAO,IAAI,WAAW,CAAC,MAAM,MAAM,OAAO,CAAC,CAAC,UAAK,OAAO,EAAE;AAAA,cAC3D;AAAA,YACD;AAAA,UACD,WAAW,MAAM,SAAS,SAAS;AAClC,wBAAY,OAAO,SAAS,MAAM,IAAI;AACtC,gBAAI,QAAQ;AACX,oBAAM,SAAS,MAAM,SAAS,SAAY,IAAI,UAAU,MAAM,IAAI,CAAC,KAAK;AACxE,qBAAO,IAAI,WAAW,CAAC,MAAM,MAAM,OAAO,CAAC,CAAC,UAAK,MAAM,EAAE;AAAA,YAC1D;AAAA,UACD,WAAW,MAAM,SAAS,YAAY;AACrC,wBAAY,OAAO,YAAY,MAAS;AACxC,gBAAI,QAAQ;AACX,qBAAO,IAAI,WAAW,CAAC,MAAM,MAAM,OAAO,CAAC,CAAC,kBAAa;AAAA,YAC1D;AAAA,UACD;AAAA,QACD;AAAA,QACA,cAAc,CAAC,QAAQ,SAAS,UAAU;AAAA,MAC3C,CAAC;AACD,mBAAa,KAAK,GAAG;AAAA,IACtB,QAAQ;AAAA,IAER;AAAA,EACD;AAGA,aAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,YAAY,GAAG;AACzD,cAAU,MAAM,KAAK;AAAA,EACtB;AAGA,aAAW,CAAC,UAAU,KAAK,QAAQ,OAAO;AACzC,cAAU,UAAU,UAAU,SAAS,MAAM;AAAA,EAC9C;AAEA,SAAO;AAAA,IACN,IAAI,SAAgC;AACnC,aAAO;AAAA,IACR;AAAA,IACA,UAAU;AACT,iBAAW,OAAO,aAAc,KAAI,QAAQ;AAC5C,mBAAa,SAAS;AAAA,IACvB;AAAA,EACD;AACD;AAMA,SAAS,UAAU,OAAwB;AAC1C,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,OAAO,UAAU,SAAU,QAAO,SAAS,OAAO,EAAE;AACxD,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAW,QAAO,OAAO,KAAK;AAChF,MAAI,OAAO,UAAU,SAAU,QAAO,OAAO,KAAK;AAClD,MAAI;AACH,UAAM,OAAO,KAAK,UAAU,KAAK;AACjC,WAAO,SAAS,MAAM,GAAG;AAAA,EAC1B,QAAQ;AACP,WAAO,OAAO,KAAK;AAAA,EACpB;AACD;AAEA,SAAS,SAAS,GAAW,KAAqB;AACjD,SAAO,EAAE,SAAS,MAAM,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,WAAM;AACrD;;;AClOA;AAAA;AAAA;AAAA;AAAA;AAAA;AAyHA,SAAS,SAAS,MAAuC;AACxD,SAAO,WAAW,QAAQ,IAAI;AAC/B;AAEA,SAAS,qBAAqB,WAA+C;AAC5E,QAAM,QAAQ,OAAO,KAAK,UAAU,KAAK;AACzC,QAAM,aAAa,oBAAI,IAA+B;AACtD,QAAM,aAAa,oBAAI,IAAyB;AAChD,aAAW,QAAQ,OAAO;AACzB,UAAM,OAAO,UAAU,MAAM,IAAI,GAAG,QAAQ,CAAC;AAC7C,eAAW,IAAI,MAAM,IAAI;AACzB,eAAW,OAAO,MAAM;AACvB,UAAI,CAAC,WAAW,IAAI,GAAG,EAAG,YAAW,IAAI,KAAK,oBAAI,IAAI,CAAC;AACvD,iBAAW,IAAI,GAAG,EAAG,IAAI,IAAI;AAAA,IAC9B;AAAA,EACD;AACA,QAAM,UAAoB,CAAC;AAC3B,QAAM,QAAkB,CAAC;AACzB,aAAW,QAAQ,OAAO;AACzB,SAAK,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG,WAAW,EAAG,SAAQ,KAAK,IAAI;AAChE,QAAI,CAAC,WAAW,IAAI,IAAI,EAAG,OAAM,KAAK,IAAI;AAAA,EAC3C;AACA,UAAQ,KAAK;AACb,QAAM,KAAK;AAEX,QAAM,YAAY,UAAU,MAAM;AAMlC,QAAM,QAAQ;AACd,QAAM,OAAO;AACb,QAAM,QAAQ;AACd,QAAM,QAAQ,oBAAI,IAAoB;AACtC,aAAW,KAAK,MAAO,OAAM,IAAI,GAAG,KAAK;AACzC,MAAI,YAAY;AAChB,QAAM,cAAc,oBAAI,IAAoB;AAE5C,QAAM,MAAM,CAAC,SAAyB;AACrC,UAAM,IAAI,MAAM,IAAI,IAAI,KAAK;AAC7B,QAAI,MAAM,MAAM;AACf,kBAAY;AACZ,aAAO;AAAA,IACR;AACA,QAAI,MAAM,MAAO,QAAO,YAAY,IAAI,IAAI,KAAK;AACjD,UAAM,IAAI,MAAM,IAAI;AACpB,QAAI,OAAO;AACX,UAAM,OAAO,WAAW,IAAI,IAAI;AAChC,QAAI,QAAQ,MAAM;AACjB,iBAAW,KAAK,MAAM;AACrB,cAAM,eAAe,IAAI,CAAC;AAC1B,YAAI,eAAe,IAAI,KAAM,QAAO,eAAe;AAAA,MACpD;AAAA,IACD;AACA,UAAM,IAAI,MAAM,KAAK;AACrB,gBAAY,IAAI,MAAM,IAAI;AAC1B,WAAO;AAAA,EACR;AAEA,MAAI,QAAQ;AACZ,aAAW,OAAO,SAAS;AAC1B,UAAM,IAAI,IAAI,GAAG;AACjB,QAAI,IAAI,MAAO,SAAQ;AAAA,EACxB;AAEA,aAAW,KAAK,OAAO;AACtB,QAAI,MAAM,IAAI,CAAC,MAAM,MAAO,KAAI,CAAC;AAAA,EAClC;AAEA,SAAO;AAAA,IACN,WAAW,MAAM;AAAA,IACjB;AAAA,IACA,eAAe,UAAU,UAAU;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AAEA,SAAS,oBAAoB,WAA8C;AAC1E,QAAM,WAA4B,CAAC;AACnC,aAAW,CAAC,MAAM,IAAI,KAAK,OAAO,QAAQ,UAAU,KAAK,GAAG;AAC3D,QAAI,KAAK,WAAW,UAAW;AAC/B,UAAM,QAAuB,EAAE,MAAM,QAAQ,UAAU;AAIvD,UAAM,WAAW,UAAU,WAAW,MAAM,YAAY,CAAC,CAAC;AAC1D,eAAW,KAAK,UAAU;AACzB,UAAI,MAAM,KAAM;AAChB,UAAI,UAAU,MAAM,CAAC,GAAG,WAAW,WAAW;AAC7C,cAAM,gBAAgB;AACtB;AAAA,MACD;AAAA,IACD;AACA,aAAS,KAAK,KAAK;AAAA,EACpB;AACA,WAAS,KAAK,CAAC,GAAG,MAAO,EAAE,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,IAAI,CAAE;AACxE,SAAO,EAAE,IAAI,SAAS,WAAW,GAAG,SAAS;AAC9C;AAEA,SAAS,mBAAmB,GAAkB,GAA2B;AACxE,SACC,EAAE,cAAc,EAAE,aAClB,EAAE,cAAc,EAAE,aAClB,EAAE,kBAAkB,EAAE,iBACtB,EAAE,UAAU,EAAE,SACd,EAAE,cAAc,EAAE,aAClB,iBAAiB,EAAE,SAAS,EAAE,OAAO,KACrC,iBAAiB,EAAE,OAAO,EAAE,KAAK;AAEnC;AAEA,SAAS,kBAAkB,GAAiB,GAA0B;AACrE,MAAI,EAAE,OAAO,EAAE,GAAI,QAAO;AAC1B,MAAI,EAAE,SAAS,WAAW,EAAE,SAAS,OAAQ,QAAO;AACpD,WAAS,IAAI,GAAG,IAAI,EAAE,SAAS,QAAQ,KAAK;AAC3C,UAAM,IAAI,EAAE,SAAS,CAAC;AACtB,UAAM,IAAI,EAAE,SAAS,CAAC;AACtB,QAAI,EAAE,SAAS,EAAE,KAAM,QAAO;AAC9B,QAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,QAAI,EAAE,kBAAkB,EAAE,cAAe,QAAO;AAAA,EACjD;AACA,SAAO;AACR;AAEA,SAAS,iBAAiB,GAAsB,GAA+B;AAC9E,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AAClC,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO;AAAA,EAC3B;AACA,SAAO;AACR;AAYO,IAAM,YAAN,cAAwB,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAW3B;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA;AAAA,EACQ;AAAA,EAEjB,YAAY,QAAe,OAAyB,CAAC,GAAG;AACvD,UAAM,KAAK,QAAQ,GAAG,OAAO,IAAI,SAAS,KAAK,KAAK;AACpD,SAAK,UAAU;AAOf,QAAI,eAAe;AACnB,QAAI,gBAAgB;AACpB,UAAM,YAAY,MAAM,GAAG,EAAE,MAAM,aAAa,CAAC;AACjD,UAAM,aAAa,MAAM,GAAG,EAAE,MAAM,cAAc,CAAC;AACnD,SAAK,IAAI,cAAc,SAAS;AAChC,SAAK,IAAI,eAAe,UAAU;AAKlC,UAAM,UAA8C,EAAE,MAAM,OAAO;AACnE,QAAI,KAAK,gBAAgB,KAAM,SAAQ,UAAU,KAAK;AACtD,SAAK,OAAO,YAA+B,OAAO;AAClD,SAAK,IAAI,QAAQ,KAAK,KAAK,OAAO;AAElC,UAAM,aAAa,KAAK;AAKxB,UAAM,cAAc,kBAAkB,QAAQ,CAAC,OAAO,UAAU,WAAW;AAE1E,sBAAgB;AAChB,gBAAU,KAAK,YAAY;AAC3B,uBAAiB;AACjB,iBAAW,KAAK,aAAa;AAI7B,UAAI,MAAM,SAAS,WAAW;AAC7B,YAAI,MAAM,aAAa,QAAQ;AAC9B,gBAAM,KAAK,GAAG,MAAM,GAAG,MAAM,IAAI;AACjC,eAAK,KAAK,OAAO,EAAE;AAAA,QACpB,OAAO;AAGN,gBAAM,cAAc,GAAG,MAAM,GAAG,MAAM,IAAI;AAC1C,gBAAM,eAAyB,CAAC;AAChC,qBAAW,gBAAgB,MAAM,MAAM,OAAO;AAC7C,kBAAM,YACL,iBAAiB,KAAK,GAAG,MAAM,GAAG,MAAM,IAAI,KAAK,GAAG,WAAW,GAAG,YAAY;AAC/E,yBAAa,KAAK,SAAS;AAAA,UAC5B;AAEA,cAAI,aAAa,SAAS,EAAG,MAAK,KAAK,WAAW,YAAY;AAAA,QAC/D;AAAA,MACD;AAAA,IACD,CAAC;AACD,SAAK,YAAY,WAAW;AAK5B,UAAM,gBAAgB,OAAO,QAAQ,EAAE,UAAU,MAAM,YAAY,KAAK,CAAC;AACzE,UAAM,aAAa,cAAc,QAAQ,CAAC,UAAU;AACnD,YAAM,IAAI,MAAM;AAEhB,UAAI,MAAM,WAAW,MAAM,cAAc,MAAM,UAAU,MAAM,YAAY;AAC1E,yBAAiB;AACjB,mBAAW,KAAK,aAAa;AAAA,MAC9B;AAIA,UAAI,MAAM,QAAQ;AACjB,cAAM,OAAO,MAAM,QAAQ;AAC3B,YAAI,CAAC,KAAM;AACX,YAAI,cAAc,QAAQ,CAAC,WAAW,IAAI,EAAG;AAC7C,cAAM,WAAW,KAAK,KAAK,IAAI,IAAI;AACnC,cAAM,QAAQ,YAAY,OAAO,SAAS,QAAQ,IAAI;AACtD,aAAK,KAAK,IAAI,MAAM,EAAE,MAAM,OAAO,eAAe,YAAY,EAAE,CAAC;AAAA,MAClE;AAAA,IACD,CAAC;AACD,SAAK,YAAY,MAAM;AACtB,iBAAW;AACX,oBAAc,QAAQ;AAAA,IACvB,CAAC;AAKD,SAAK,QAAQ;AAAA,MACZ,CAAC,SAAS;AAAA,MACV,MAAM,qBAAqB,OAAO,SAAS,EAAE,QAAQ,UAAU,CAAC,CAAC;AAAA,MACjE;AAAA,QACC,MAAM;AAAA,QACN,cAAc;AAAA,QACd,QAAQ;AAAA,QACR,MAAM,SAAS,OAAO;AAAA,MACvB;AAAA,IACD;AACA,SAAK,IAAI,SAAS,KAAK,KAAK;AAC5B,SAAK,YAAY,UAAU,KAAK,KAAK,CAAC;AAKtC,SAAK,SAAS;AAAA,MACb,CAAC,UAAU;AAAA,MACX,MAAM,oBAAoB,OAAO,SAAS,EAAE,QAAQ,WAAW,CAAC,CAAC;AAAA,MACjE;AAAA,QACC,MAAM;AAAA,QACN,cAAc;AAAA,QACd,QAAQ;AAAA,QACR,MAAM,SAAS,QAAQ;AAAA,MACxB;AAAA,IACD;AACA,SAAK,IAAI,UAAU,KAAK,MAAM;AAC9B,SAAK,YAAY,UAAU,KAAK,MAAM,CAAC;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,IACC,MACA,IACA,MACmD;AACnD,UAAM,SAAS,oBAAoB,KAAK,SAAS,MAAM,IAAI,IAAI;AAC/D,SAAK,YAAY,OAAO,OAAO;AAC/B,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,IAAI,SAAgB;AACnB,WAAO,KAAK;AAAA,EACb;AACD;AA+BO,SAAS,UAAU,QAAe,MAAoC;AAC5E,SAAO,IAAI,UAAU,QAAQ,IAAI;AAClC;;;AC5dA;AAAA;AAAA;AAAA;AAAA;AAAA;AA6GO,SAAS,kBACf,QACA,OAAoC,CAAC,GACR;AAC7B,MAAI,UAAmB;AAGvB,MAAI,KAAK,aAAa,MAAM;AAC3B,cAAU,YAAY,SAAS,KAAK,SAAS;AAAA,EAC9C;AAGA,MAAI,KAAK,UAAU,QAAQ,KAAK,OAAO,SAAS,GAAG;AAClD,cAAU,WAAW,SAAS,KAAK,MAAM;AAAA,EAC1C;AAGA,MAAI;AACJ,MAAI,KAAK,WAAW,MAAM;AACzB,UAAM,UAAU,eAAe,KAAK,OAAO;AAC3C,UAAM,SAAS,KAAK,iBAAiB;AACrC,UAAM,UAAU,YAAe,SAAS,EAAE,OAAO,CAAC,EAAE,OAAO;AAC3D,cAAU,QAAQ;AAClB,mBAAe,QAAQ;AAAA,EACxB;AAMA,MAAI,KAAK,aAAa,MAAM;AAC3B,QAAI,KAAK,aAAa,EAAG,OAAM,IAAI,WAAW,uBAAuB;AAIrE,QAAI,KAAK,YAAY,KAAW;AAC/B,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAAA,IACD;AACA,cAAU,QAAQ,SAAS,KAAK,YAAY,SAAS;AAAA,EACtD;AAIA,MAAI,KAAK,SAAS,MAAM;AACvB,cAAU,MAAM,SAAS,KAAK,KAAK;AAAA,EACpC;AAGA,MAAI,KAAK,aAAa,QAAW;AAChC,cAAU,SAAS,SAAS,KAAK,QAAQ;AAAA,EAC1C;AAGA,QAAM,mBAAmB,WAAW,SAAS,EAAE,eAAe,KAAK,iBAAiB,UAAU,CAAC;AAE/F,SAAO;AAAA,IACN,MAAM,iBAAiB;AAAA,IACvB,QAAQ,iBAAiB;AAAA,IACzB,OAAO,iBAAiB;AAAA,IACxB;AAAA,EACD;AACD;;;AC5KA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACyCO,IAAM,eAAN,cAA2B,MAAM;AAAA,EAC9B;AAAA,EACA;AAAA,EAET,YACC,MACA,SACA,SACC;AACD,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,QAAI,YAAY,OAAW,MAAK,UAAU;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,SAA8B;AAC7B,UAAM,MAA2B,EAAE,MAAM,KAAK,MAAM,SAAS,KAAK,QAAQ;AAC1E,QAAI,KAAK,YAAY,QAAW;AAC/B,YAAM,OAAO,YAAY,KAAK,OAAO;AACrC,UAAI,SAAS,OAAW,KAAI,UAAU;AAAA,IACvC;AACA,WAAO;AAAA,EACR;AACD;AAEA,SAAS,YACR,SACgD;AAChD,MAAI;AAIH,WAAO,KAAK,MAAM,KAAK,UAAU,OAAO,CAAC;AAAA,EAC1C,QAAQ;AACP,WAAO;AAAA,EACR;AACD;AAGO,SAAS,eACf,KACA,eAAiC,kBAClB;AACf,MAAI,eAAe,aAAc,QAAO;AACxC,QAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,SAAO,IAAI,aAAa,cAAc,OAAO;AAC9C;;;ACnEO,SAAS,YAAY,MAAiB,MAAkC;AAC9E,QAAM,aAAa,aAAa,IAAI;AACpC,MAAI,CAAC,WAAW,OAAO;AACtB,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,EAAiC,WAAW,OAAO,KAAK,IAAI,CAAC;AAAA,MAC7D,EAAE,QAAQ,WAAW,OAAO;AAAA,IAC7B;AAAA,EACD;AACA,QAAM,UAAU,MAAM,WAAW,CAAC;AAClC,QAAM,oBAAoB,2BAA2B,MAAM,OAAO;AAClE,MAAI,CAAC,kBAAkB,OAAO;AAC7B,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,EAA+B,kBAAkB,OAAO,KAAK,IAAI,CAAC;AAAA,MAClE,EAAE,QAAQ,kBAAkB,OAAO;AAAA,IACpC;AAAA,EACD;AACA,MAAI;AACH,WAAO,YAAY,MAAM,IAAI;AAAA,EAC9B,SAAS,KAAK;AAIb,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,UAAM,IAAI,aAAa,iBAAiB,OAAO;AAAA,EAChD;AACD;;;ACbA,IAAM,qBAAqB;AAkB3B,eAAsB,aACrB,MACA,OACA,MACmB;AACnB,QAAM,YAAY,MAAM,aAAa;AACrC,QAAM,aAAa,MAAM,cAAc;AACvC,QAAM,YAAY,MAAM,aAAa;AAErC,QAAM,QAAQ,YAAY,MAAM,EAAE,SAAS,MAAM,QAAQ,CAAC;AAC1D,MAAI;AACJ,MAAI;AACH,iBAAa,MAAM,QAAQ,UAAU;AAAA,EACtC,QAAQ;AACP,UAAM,QAAQ;AACd,UAAM,IAAI;AAAA,MACT;AAAA,MACA,wBAAwB,UAAU;AAAA,MAClC,EAAE,MAAM,WAAW;AAAA,IACpB;AAAA,EACD;AAEA,MAAI;AACH,UAAM,QAAQ,SAAS;AAAA,EACxB,QAAQ;AACP,UAAM,QAAQ;AACd,UAAM,IAAI;AAAA,MACT;AAAA,MACA,uBAAuB,SAAS;AAAA,MAChC,EAAE,MAAM,UAAU;AAAA,IACnB;AAAA,EACD;AAEA,MAAI;AACH,WAAO,MAAM,IAAI,QAAiB,CAAC,SAAS,WAAW;AACtD,UAAI,SAAS;AACb,UAAI,UAAU;AACd,UAAI;AACJ,UAAI;AACJ,UAAI,cAAc;AAElB,YAAM,SAAS,CAAC,WAA6B;AAC5C,YAAI,QAAS;AACb,kBAAU;AACV,YAAI,UAAU,OAAW,cAAa,KAAK;AAC3C,YAAI,UAAU,QAAW;AACxB,gBAAM;AACN,kBAAQ;AAAA,QACT,OAAO;AACN,wBAAc;AAAA,QACf;AACA,eAAO;AAAA,MACR;AAEA,cAAQ,WAAW,UAAU,CAAC,SAAS;AACtC,mBAAW,KAAK,MAAM;AACrB,cAAI,QAAS;AAGb,cAAI,CAAC,OAAQ;AACb,cAAI,EAAE,CAAC,MAAM,MAAM;AAClB,mBAAO,MAAM,QAAQ,EAAE,CAAC,CAAC,CAAC;AAC1B;AAAA,UACD;AACA,cAAI,EAAE,CAAC,MAAM,UAAU;AAOtB,kBAAMC,UAAS,WAAW;AAC1B,mBAAO,MAAM,QAAQA,OAAM,CAAC;AAC5B;AAAA,UACD;AACA,cAAI,EAAE,CAAC,MAAM,OAAO;AACnB,kBAAM,UAAU,EAAE,CAAC;AACnB,kBAAM,UAAU,mBAAmB,QAAQ,QAAQ,UAAU,OAAO,OAAO;AAC3E,kBAAM,QAAQ,mBAAmB,QAAQ,UAAU;AACnD;AAAA,cAAO,MACN;AAAA,gBACC,IAAI;AAAA,kBACH;AAAA,kBACA,iCAAiC,OAAO;AAAA,kBACxC,SAAS,OAAO,EAAE,MAAM,IAAI;AAAA,gBAC7B;AAAA,cACD;AAAA,YACD;AACA;AAAA,UACD;AACA,cAAI,EAAE,CAAC,MAAM,UAAU;AACtB;AAAA,cAAO,MACN;AAAA,gBACC,IAAI;AAAA,kBACH;AAAA,kBACA;AAAA,gBACD;AAAA,cACD;AAAA,YACD;AACA;AAAA,UACD;AAAA,QACD;AAAA,MACD,CAAC;AACD,UAAI,aAAa;AAChB,gBAAQ;AACR,gBAAQ;AAAA,MACT;AAEA,eAAS;AACT,UAAI;AACH,cAAM,IAAI,WAAW,KAAK;AAAA,MAC3B,SAAS,KAAK;AACb,cAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,cAAM,QAAQ,eAAe,QAAQ,MAAM;AAC3C;AAAA,UAAO,MACN;AAAA,YACC,IAAI;AAAA,cACH;AAAA,cACA,mCAAmC,SAAS,MAAM,OAAO;AAAA,cACzD,SAAS,OAAO,EAAE,MAAM,WAAW,MAAM,IAAI,EAAE,MAAM,UAAU;AAAA,YAChE;AAAA,UACD;AAAA,QACD;AACA;AAAA,MACD;AAKA,UAAI,CAAC,WAAW,OAAO,SAAS,SAAS,KAAK,YAAY,GAAG;AAC5D,gBAAQ,WAAW,MAAM;AACxB;AAAA,YAAO,MACN;AAAA,cACC,IAAI;AAAA,gBACH;AAAA,gBACA,oCAAoC,SAAS;AAAA,gBAC7C,EAAE,WAAW,WAAW;AAAA,cACzB;AAAA,YACD;AAAA,UACD;AAAA,QACD,GAAG,SAAS;AAGZ,cAAM,QAAQ;AAAA,MACf;AAAA,IACD,CAAC;AAAA,EACF,UAAE;AACD,UAAM,QAAQ;AAAA,EACf;AACD;;;AC/KO,IAAM,wBAAwB;AAcrC,SAAS,iBAAiB,KAAc,YAA0C;AACjF,MAAI,OAAO,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,aAAa,sBAAsB,aAAa,UAAU,uBAAuB;AAAA,MAC1F;AAAA,IACD,CAAC;AAAA,EACF;AAIA,QAAM,SAAS;AACf,MAAI,UAAU,QAAQ;AACrB,QAAI,OAAO,SAAS,UAAU,cAAc,QAAQ;AACnD,aAAO,OAAO;AAAA,IACf;AACA,QAAI,OAAO,SAAS,QAAQ;AAC3B,YAAM,IAAI;AAAA,QACT;AAAA,QACA,aAAa,UAAU;AAAA,QACvB,EAAE,YAAY,MAAM,OAAO;AAAA,MAC5B;AAAA,IACD;AACA,UAAM,IAAI;AAAA,MACT;AAAA,MACA,aAAa,UAAU,uBAAuB,OAAO,OAAO,IAAI,CAAC;AAAA,MACjE,EAAE,YAAY,MAAM,OAAO,OAAO,IAAI,EAAE;AAAA,IACzC;AAAA,EACD;AACA,MAAI,WAAW,UAAU,WAAW,UAAU,eAAe,UAAU,UAAU,QAAQ;AACxF,WAAO;AAAA,EACR;AACA,QAAM,IAAI;AAAA,IACT;AAAA,IACA,aAAa,UAAU;AAAA,IACvB,EAAE,WAAW;AAAA,EACd;AACD;AAUA,eAAsB,aACrB,OACA,YACA,MAC8B;AAC9B,MAAI;AACJ,MAAI;AACH,eAAW,MAAM,SAAS;AAAA,EAC3B,SAAS,KAAK;AACb,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,UAAM,IAAI;AAAA,MACT;AAAA,MACA,aAAa,UAAU,2BAA2B,OAAO;AAAA,MACzD,EAAE,WAAW;AAAA,IACd;AAAA,EACD;AACA,QAAM,SAAgC;AAAA,IACrC,MAAM;AAAA,IACN,KAAK;AAAA,IACL,cAAc,YAAY;AAAA,IAC1B,gBAAgB;AAAA,IAChB;AAAA,EACD;AACA,MAAI;AACH,UAAM,KAAK,KAAK,YAAY,MAAM;AAAA,EACnC,SAAS,KAAK;AACb,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,UAAM,IAAI,aAAa,mBAAmB,aAAa,UAAU,kBAAkB,OAAO,IAAI;AAAA,MAC7F;AAAA,IACD,CAAC;AAAA,EACF;AACA,SAAO,EAAE,YAAY,cAAc,OAAO,aAAa;AACxD;AAsBA,eAAsB,gBACrB,YACA,MACA,MACiB;AACjB,QAAM,MAAM,MAAM,KAAK,KAAK,UAAU;AACtC,QAAM,WAAW,iBAAiB,KAAK,UAAU;AACjD,MAAI;AACH,WAAO,MAAM;AAAA,MACZ;AAAA,MACA,MAAM,YAAY,EAAE,WAAW,KAAK,UAAU,IAAI;AAAA,IACnD;AAAA,EACD,SAAS,KAAK;AACb,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,UAAM,IAAI;AAAA,MACT;AAAA,MACA,aAAa,UAAU,qBAAqB,OAAO;AAAA,MACnD;AAAA,QACC;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;AASA,eAAsB,cACrB,aACA,aACA,MAC2B;AAC3B,QAAM,CAAC,MAAM,IAAI,IAAI,MAAM,QAAQ,IAAI,CAAC,KAAK,KAAK,WAAW,GAAG,KAAK,KAAK,WAAW,CAAC,CAAC;AACvF,QAAM,YAAY,iBAAiB,MAAM,WAAW;AACpD,QAAM,YAAY,iBAAiB,MAAM,WAAW;AACpD,SAAO,MAAM,KAAK,WAAW,SAAS;AACvC;AAiBA,eAAsB,cAAc,MAA+C;AAClF,MAAI,OAAO,KAAK,SAAS,YAAY;AACpC,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,SAAO,KAAK,KAAK;AAClB;AAWA,eAAsB,eAAe,YAAoB,MAAkC;AAC1F,MAAI,OAAO,KAAK,UAAU,YAAY;AACrC,UAAM,IAAI;AAAA,MACT;AAAA,MACA,2DAA2D,UAAU;AAAA,MACrE,EAAE,WAAW;AAAA,IACd;AAAA,EACD;AACA,MAAI;AACH,UAAM,KAAK,MAAM,UAAU;AAAA,EAC5B,SAAS,KAAK;AACb,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,UAAM,IAAI;AAAA,MACT;AAAA,MACA,aAAa,UAAU,oBAAoB,OAAO;AAAA,MAClD;AAAA,QACC;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;;;AC/OO,IAAM,UAAU;","names":["buffer","baseMeta","policy","node","_","feedback","evalSource","batch","cached"]}