pi-fabric 0.129.0 → 0.129.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/agents.js +3 -3
- package/dist/chunks/{chunk-HEJA6ZGP.js → chunk-3UFN4LKG.js} +6 -6
- package/dist/chunks/{chunk-HEJA6ZGP.js.map → chunk-3UFN4LKG.js.map} +1 -1
- package/dist/chunks/{chunk-43JHZNXZ.js → chunk-3XT5WHSG.js} +4 -4
- package/dist/chunks/{chunk-3NU3Z43H.js → chunk-4WKD3YM3.js} +3 -3
- package/dist/chunks/{chunk-DXVMGTC7.js → chunk-6GWDGTHC.js} +2 -2
- package/dist/chunks/{chunk-4ZUMD27O.js → chunk-7CLTT7FD.js} +8 -3
- package/dist/chunks/{chunk-4ZUMD27O.js.map → chunk-7CLTT7FD.js.map} +2 -2
- package/dist/chunks/{chunk-LIAMZBOP.js → chunk-7N7IC3Z2.js} +2 -2
- package/dist/chunks/{chunk-EEYLMDTO.js → chunk-C6C4ER5J.js} +3 -3
- package/dist/chunks/{chunk-L5SULLDY.js → chunk-E4D5FUHX.js} +4 -4
- package/dist/chunks/{chunk-3KRAD6BR.js → chunk-GS67KDMV.js} +2 -2
- package/dist/chunks/{chunk-O7YKXJOG.js → chunk-GW25FXU4.js} +19 -4
- package/dist/chunks/{chunk-O7YKXJOG.js.map → chunk-GW25FXU4.js.map} +2 -2
- package/dist/chunks/{chunk-CQD5W3DV.js → chunk-H57KPL3V.js} +3 -3
- package/dist/chunks/{chunk-Y2GC7YXJ.js → chunk-HFDJWLMS.js} +4 -4
- package/dist/chunks/{chunk-MK4TBJ6O.js → chunk-HGD75NZY.js} +2 -2
- package/dist/chunks/{chunk-RDGAQ5VZ.js → chunk-HRDMBGMY.js} +6 -6
- package/dist/chunks/{chunk-IWK5QA3D.js → chunk-IOPDT6GA.js} +2 -2
- package/dist/chunks/{chunk-7WEXQQEQ.js → chunk-L3OOZ5TJ.js} +2 -2
- package/dist/chunks/{chunk-KIOAZ4AA.js → chunk-MPMEK3IQ.js} +2 -2
- package/dist/chunks/{chunk-TA47LVFC.js → chunk-N2J2TCYZ.js} +4 -4
- package/dist/chunks/{chunk-BTHPGT27.js → chunk-N3SSXCEC.js} +2 -2
- package/dist/chunks/{chunk-BTHPGT27.js.map → chunk-N3SSXCEC.js.map} +1 -1
- package/dist/chunks/{chunk-NVTQDYZ4.js → chunk-OI43UUG5.js} +3 -3
- package/dist/chunks/{chunk-WLVHI3QU.js → chunk-OP6CWP4N.js} +2 -2
- package/dist/chunks/{chunk-SCOJ4BWV.js → chunk-P7YSPKTM.js} +1 -1
- package/dist/chunks/{chunk-SCOJ4BWV.js.map → chunk-P7YSPKTM.js.map} +1 -1
- package/dist/chunks/{chunk-4QTGATQD.js → chunk-PUBHBEYO.js} +2 -2
- package/dist/chunks/{chunk-VWYSKQ6F.js → chunk-QOEOKW2X.js} +2 -2
- package/dist/chunks/{chunk-RTHZUDOI.js → chunk-RAA3FAYZ.js} +2 -2
- package/dist/chunks/{chunk-AAAPZSRU.js → chunk-RWKQ5SRW.js} +2 -2
- package/dist/chunks/{chunk-XB3OQO4N.js → chunk-SSRSCT2M.js} +2 -2
- package/dist/chunks/{chunk-BAYAQYAL.js → chunk-TXCNZCZP.js} +2 -2
- package/dist/chunks/{chunk-7C6QZCUR.js → chunk-X7GHEK6O.js} +5 -5
- package/dist/chunks/{chunk-KNV6LT4Y.js → chunk-XMYG2TKR.js} +2 -2
- package/dist/cli/decisions.js +1 -1
- package/dist/cli/mesh.js +2 -2
- package/dist/compaction/claim-events.js +7 -7
- package/dist/compaction/hook.js +6 -6
- package/dist/compaction/owner.js +7 -7
- package/dist/core/action-registry.js +7 -7
- package/dist/core/provider-operations.js.map +1 -1
- package/dist/durable-extension.d.ts +1 -1
- package/dist/durable-extension.js +1 -1
- package/dist/durable-extension.js.map +1 -1
- package/dist/entropy/index.js +9 -9
- package/dist/extension-bootstrap.js +6 -6
- package/dist/fabric-runtime-state.js +25 -25
- package/dist/fabric-runtime-state.js.map +1 -1
- package/dist/index.js +12 -12
- package/dist/jev/observation.js +5 -5
- package/dist/jev.js +8 -8
- package/dist/memory/digest.js +2 -2
- package/dist/memory/discovery.js +6 -6
- package/dist/memory/file-worker.js +9 -9
- package/dist/memory/normalize.js +5 -5
- package/dist/memory/search.js +7 -7
- package/dist/memory/worker-provider.js +10 -10
- package/dist/memory.js +10 -10
- package/dist/mesh/store.d.ts.map +1 -1
- package/dist/providers/jev-provider.js +8 -8
- package/dist/providers/memory-provider.js +9 -9
- package/dist/residency/host.js +9 -9
- package/dist/residency/pi-entry.js +9 -9
- package/dist/runtime/cpython-runtime.d.ts.map +1 -1
- package/dist/runtime/cpython-runtime.js +21 -13
- package/dist/runtime/cpython-runtime.js.map +2 -2
- package/dist/topology/participant-directory.d.ts.map +1 -1
- package/dist/verified/generated/authority.d.ts +1 -1
- package/dist/verified/generated/authority.js +1 -1
- package/dist/verified/generated/budget.d.ts +1 -1
- package/dist/verified/generated/budget.js +1 -1
- package/dist/verified/generated/compaction.d.ts +1 -1
- package/dist/verified/generated/compaction.js +1 -1
- package/dist/verified/generated/grants.d.ts +1 -1
- package/dist/verified/generated/grants.js +1 -1
- package/dist/verified/generated/lifecycle.d.ts +1 -1
- package/dist/verified/generated/lifecycle.js +1 -1
- package/dist/verified/generated/manifest.json +21 -21
- package/dist/verified/generated/policy.d.ts +1 -1
- package/dist/verified/generated/policy.js +1 -1
- package/dist/verified/generated/provider.d.ts +1 -1
- package/dist/verified/generated/provider.js +1 -1
- package/dist/verified/generated/resources.d.ts +1 -1
- package/dist/verified/generated/resources.js +1 -1
- package/dist/verified/generated/speculation.d.ts +1 -1
- package/dist/verified/generated/speculation.js +1 -1
- package/dist/verified/generated/storage.d.ts +1 -1
- package/dist/verified/generated/storage.js +1 -1
- package/package.json +2 -2
- /package/dist/chunks/{chunk-43JHZNXZ.js.map → chunk-3XT5WHSG.js.map} +0 -0
- /package/dist/chunks/{chunk-3NU3Z43H.js.map → chunk-4WKD3YM3.js.map} +0 -0
- /package/dist/chunks/{chunk-DXVMGTC7.js.map → chunk-6GWDGTHC.js.map} +0 -0
- /package/dist/chunks/{chunk-LIAMZBOP.js.map → chunk-7N7IC3Z2.js.map} +0 -0
- /package/dist/chunks/{chunk-EEYLMDTO.js.map → chunk-C6C4ER5J.js.map} +0 -0
- /package/dist/chunks/{chunk-L5SULLDY.js.map → chunk-E4D5FUHX.js.map} +0 -0
- /package/dist/chunks/{chunk-3KRAD6BR.js.map → chunk-GS67KDMV.js.map} +0 -0
- /package/dist/chunks/{chunk-CQD5W3DV.js.map → chunk-H57KPL3V.js.map} +0 -0
- /package/dist/chunks/{chunk-Y2GC7YXJ.js.map → chunk-HFDJWLMS.js.map} +0 -0
- /package/dist/chunks/{chunk-MK4TBJ6O.js.map → chunk-HGD75NZY.js.map} +0 -0
- /package/dist/chunks/{chunk-RDGAQ5VZ.js.map → chunk-HRDMBGMY.js.map} +0 -0
- /package/dist/chunks/{chunk-IWK5QA3D.js.map → chunk-IOPDT6GA.js.map} +0 -0
- /package/dist/chunks/{chunk-7WEXQQEQ.js.map → chunk-L3OOZ5TJ.js.map} +0 -0
- /package/dist/chunks/{chunk-KIOAZ4AA.js.map → chunk-MPMEK3IQ.js.map} +0 -0
- /package/dist/chunks/{chunk-TA47LVFC.js.map → chunk-N2J2TCYZ.js.map} +0 -0
- /package/dist/chunks/{chunk-NVTQDYZ4.js.map → chunk-OI43UUG5.js.map} +0 -0
- /package/dist/chunks/{chunk-WLVHI3QU.js.map → chunk-OP6CWP4N.js.map} +0 -0
- /package/dist/chunks/{chunk-4QTGATQD.js.map → chunk-PUBHBEYO.js.map} +0 -0
- /package/dist/chunks/{chunk-VWYSKQ6F.js.map → chunk-QOEOKW2X.js.map} +0 -0
- /package/dist/chunks/{chunk-RTHZUDOI.js.map → chunk-RAA3FAYZ.js.map} +0 -0
- /package/dist/chunks/{chunk-AAAPZSRU.js.map → chunk-RWKQ5SRW.js.map} +0 -0
- /package/dist/chunks/{chunk-XB3OQO4N.js.map → chunk-SSRSCT2M.js.map} +0 -0
- /package/dist/chunks/{chunk-BAYAQYAL.js.map → chunk-TXCNZCZP.js.map} +0 -0
- /package/dist/chunks/{chunk-7C6QZCUR.js.map → chunk-X7GHEK6O.js.map} +0 -0
- /package/dist/chunks/{chunk-KNV6LT4Y.js.map → chunk-XMYG2TKR.js.map} +0 -0
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
{
|
|
2
2
|
"version": 3,
|
|
3
3
|
"sources": ["../../src/verified/generated/authority.js", "../../src/verified/authority.ts", "../../src/core/action-registry.ts", "../../src/verified/generated/resources.js", "../../src/verified/resources.ts", "../../src/components/effect-policy.ts", "../../src/core/action-repair.ts", "../../src/core/provider-bindings.ts", "../../src/verified/generated/lifecycle.js", "../../src/verified/lifecycle.ts"],
|
|
4
|
-
"sourcesContent": ["// Generated by scripts/verified-kernels.ts from proofs/authority.ts with gdp-wired@0.30.1. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $m(v, what) { if (!(v instanceof Map)) throw new RangeError(what + ' must be a Map of naturals'); for (const [key, x] of v) { $n(key, 'a key of ' + what); $n(x, 'a cell of ' + what); } return v; }\nfunction $keys(maps, names) { const keys = new Set(); let past = 0; for (const c of Object.values(maps)) for (const key of c.keys()) past = Math.max(past, key + 1); for (const n of names) for (const key of maps[n].keys()) keys.add(key); return [...keys, past]; }\nfunction $every(keys, f) { const past = keys[keys.length - 1], d = f(past), cells = new Map(); for (let i = 0; i < keys.length - 1; i++) { const v = f(keys[i]); if (v !== d) cells.set(keys[i], v); } return {cells, d}; }\n\nexport const capabilityAuthority = /* @__PURE__ */ (() => {\n// Generated from the machine capability authority. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"live\": 0, \"granted\": 0}, maps: {\"Grants\": new Map()}};\n}\nfunction step(params, state, input) {\n const env = {\"op\": $n(input[\"op\"], \"input op\"), \"name\": $n(input[\"name\"], \"input name\"), \"parentLive\": $n(input[\"parentLive\"], \"input parentLive\")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, \"Candidate\": $m(input[\"Candidate\"], \"input Candidate\"), \"Parent\": $m(input[\"Parent\"], \"input Parent\")};\n const flag0 = $keys(maps, [\"Candidate\",\"Parent\"]).every(k => (((maps[\"Candidate\"].get(k) ?? 0) <= 1) && ((maps[\"Parent\"].get(k) ?? 0) <= 1)));\n const flag1 = $keys(maps, [\"Candidate\",\"Parent\"]).every(k => ((!(1 <= (maps[\"Candidate\"].get(k) ?? 0))) || (1 <= (maps[\"Parent\"].get(k) ?? 0))));\n const flag2 = $keys(maps, [\"Candidate\",\"Parent\"]).every(k => ((maps[\"Candidate\"].get(k) ?? 0) <= (maps[\"Parent\"].get(k) ?? 0)));\n const flag3 = (env[\"op\"] === 0);\n const flag4 = ((env[\"op\"] === 1) && ((env[\"parentLive\"] === 1) && flag2));\n const flag5 = ((env[\"op\"] === 2) && ((s[\"live\"] === 1) && (1 <= (maps[\"Grants\"].get(env[\"name\"]) ?? dft[\"Grants\"] ?? 0))));\n if (!((env[\"op\"] < 4) && (env[\"parentLive\"] <= 1) && flag0)) throw new RangeError(\"capability authority: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"live\": ((flag3 || flag4) ? 1 : ((env[\"op\"] === 2) ? s[\"live\"] : 0)), \"granted\": (flag5 ? 1 : 0)};\n const write0 = $every($keys(maps, [\"Candidate\",\"Grants\"]), k => ((flag3 || flag4) ? (maps[\"Candidate\"].get(k) ?? 0) : ((env[\"op\"] === 2) ? (maps[\"Grants\"].get(k) ?? dft[\"Grants\"] ?? 0) : 0)));\n state.maps[\"Grants\"] = write0.cells; dft[\"Grants\"] = write0.d;\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { Interner, bit, idSet, members, type MachineState } from \"./machine.js\";\nimport { capabilityAuthority } from \"./generated/authority.js\";\nimport type { FabricCapabilityBindingView } from \"../protocol.js\";\n\nconst ISSUE = 0, DERIVE = 1, USE = 2, RELEASE = 3;\n\n/** Trusted codec: JSON's fixed-position string/number tuple preserves ref,\n * provider, binding identity, generation and descriptor identity, and one\n * injective table per authority tree turns each complete tuple into an id.\n * Descriptor hashing itself remains trusted; the kernel proves equality of\n * identities, not hash injectivity. */\nconst encodeGrant = (grant: Readonly<FabricCapabilityBindingView>): string => JSON.stringify([\n grant.ref, grant.provider, grant.providerBindingId, grant.generation, grant.descriptorHash,\n]);\n\n/** Private canonical state behind ActionRegistry's WeakMap-owned public views.\n * Root issuance is a trusted registry operation, not a caller-supplied permission\n * Boolean. The compiled kernel decides derivation/use/release over exact grants.\n * JS identity, WeakMap ownership, binding observations and abort delivery remain trusted.\n */\nexport class CapabilityAuthority {\n #state: MachineState;\n readonly #names: Interner;\n readonly #grants: ReadonlyMap<string, Readonly<FabricCapabilityBindingView>>;\n\n private constructor(grants: readonly FabricCapabilityBindingView[], parent?: CapabilityAuthority) {\n const canonical = grants.map(grant => Object.freeze({ ...grant }));\n this.#grants = new Map(canonical.map(grant => [grant.ref, grant]));\n this.#names = parent ? parent.#names : new Interner();\n const candidate = idSet(canonical.map(grant => this.#names.id(encodeGrant(grant))));\n const parentGrants = parent ? idSet(members(parent.#state, \"Grants\")) : new Map<number, number>();\n this.#state = capabilityAuthority.step({}, capabilityAuthority.init({}), {\n op: parent ? DERIVE : ISSUE, name: 0, parentLive: bit(parent?.active ?? false),\n Candidate: candidate, Parent: parentGrants,\n });\n }\n\n static issue(grants: readonly FabricCapabilityBindingView[]): CapabilityAuthority {\n return new CapabilityAuthority(grants);\n }\n\n derive(grants: readonly FabricCapabilityBindingView[]): CapabilityAuthority {\n return new CapabilityAuthority(grants, this);\n }\n\n get active(): boolean {\n return this.#state.scalars.live === 1;\n }\n\n release(): void {\n this.#state = capabilityAuthority.step({}, this.#state, { op: RELEASE, name: 0, parentLive: 0, Candidate: new Map(), Parent: new Map() });\n }\n\n resolve(ref: string): FabricCapabilityBindingView | undefined {\n const grant = this.#grants.get(ref);\n if (!grant) return undefined;\n this.#state = capabilityAuthority.step({}, this.#state, {\n op: USE, name: this.#names.id(encodeGrant(grant)), parentLive: 0, Candidate: new Map(), Parent: new Map(),\n });\n return this.#state.scalars.granted === 1 ? { ...grant } : undefined;\n }\n\n bindings(): FabricCapabilityBindingView[] {\n return this.active ? [...this.#grants.values()].map(grant => ({ ...grant })) : [];\n }\n}\n", "import type { ProviderOperations, ProviderOperation } from \"./provider-operations.js\";\nimport { CapabilityAuthority } from \"../verified/authority.js\";\nimport { randomUUID } from \"node:crypto\";\nimport { effectConflictsBetween, registrationEffect, summarizeEffects } from \"../components/effect-policy.js\";\n\n/** Effective page size for registry list(): caller default 100, hard cap 1000.\n * Exported so guest discovery surfaces slice identically to the registry. */\nexport const fabricActionListLimit = (limit?: number): number =>\n Math.max(1, Math.min(limit ?? 100, 1_000));\nimport { repairCatalogInput, validateCatalogArgs, validationMessage } from \"./action-arguments.js\";\nimport {\n MAX_AUDIT_VALUE_CHARS,\n boundedPreviewValue,\n boundedResult,\n strictDecisionResult,\n failedResultError,\n failedResultOutcome,\n previewArgs,\n previewResult,\n} from \"./action-result.js\";\nimport { runAbortable, settleWithin, throwIfAborted } from \"../async-settlement.js\";\nimport type {\n FabricCapabilityRequirement,\n FabricComponentProviderLease,\n} from \"../components/types.js\";\nimport {\n executionOutcomeFromError,\n FabricResolutionError,\n FabricTraceSafeError,\n type FabricExecutionTraceOperationHandle,\n type FabricExecutionTraceRecorder,\n} from \"../audit/trace.js\";\nimport {\n FABRIC_NESTED_TOOL_CALL_ID_PREFIX,\n type FabricActionDescriptor,\n type FabricActionEffect,\n type FabricCapabilityBindingView,\n type FabricCapabilityCatalog,\n type FabricCapabilityResolution,\n type FabricCommittedCapabilityView,\n type FabricGuestTypeSources,\n type FabricInvocationActivityUpdate,\n type FabricInvocationContext,\n type FabricMediaBlock,\n type FabricNamedActionTypeSource,\n type FabricProvider,\n type FabricProviderListRequest,\n type FabricProviderTypeSource,\n type FabricScope,\n type FabricScopedProviderResult,\n} from \"../protocol.js\";\nimport {\n formatUnknownActionMessage,\n repairActionName,\n} from \"./action-repair.js\";\nimport {\n applyActiveActionName,\n applyActiveArgRepairs,\n getActiveRepairCompiler,\n} from \"../repairs/active.js\";\nimport {\n activeQuarantinedRefNames,\n effectiveInputSchema,\n normalizeActiveArguments,\n isActiveQuarantine,\n} from \"../entropy/active.js\";\nimport { formatFabricEffectConflict } from \"./effect-conflict.js\";\nimport { providerGlobalNames } from \"../provider-globals.js\";\nimport { stableJsonHash } from \"./stable-hash.js\";\nimport type {\n FabricSpeculationReplay,\n FabricSpeculationRuntime,\n} from \"../speculation/types.js\";\nimport type { FabricNestedToolResultProxy } from \"./tool-result-proxy.js\";\nimport type { FabricHostPolicy } from \"./host-policy.js\";\nimport {\n FabricProviderBindings,\n type FabricProviderBinding,\n type FabricProviderBindingEvent,\n} from \"./provider-bindings.js\";\n\nexport interface ResolvedFabricAction extends FabricActionDescriptor {\n ref: string;\n provider: string;\n}\n\ninterface FabricEffectConflict {\n withRef: string;\n resources: string[];\n reason: \"shared_resource\" | \"unknown_resource\";\n}\n\nexport interface FabricCallAudit {\n ref: string;\n nestedToolCallId: string;\n startedAt: number;\n endedAt?: number;\n success?: boolean;\n error?: string;\n resultChars?: number;\n resultTruncated?: boolean;\n tool?: string;\n provider?: string;\n args?: Record<string, unknown>;\n result?: unknown;\n media?: FabricMediaBlock[];\n mediaNote?: string;\n preview?: unknown;\n effectConflicts?: FabricEffectConflict[];\n /** Result was pre-launched while the program streamed and served from the speculation store. */\n speculated?: boolean;\n /** Spelled action name that repaired to the canonical one at resolve (e.g. search \u2192 recall). */\n repairedFrom?: string;\n /** The provider reported a nested result with Pi's `terminate: true`. In memory only. */\n terminate?: true;\n}\n\nexport type FabricRegistryActivityEvent =\n | {\n type: \"call_start\";\n callId: string;\n ref: string;\n args: Record<string, unknown>;\n }\n | {\n type: \"call_update\";\n callId: string;\n update: FabricInvocationActivityUpdate;\n }\n | {\n type: \"call_args\";\n callId: string;\n args: Record<string, unknown>;\n }\n | {\n type: \"call_end\";\n callId: string;\n success: boolean;\n result?: unknown;\n preview?: unknown;\n error?: string;\n };\n\nexport interface FabricCapabilityViewLease extends FabricCapabilityResolution {\n release(): Promise<void>;\n}\n\nexport interface FabricRegistryInvocationContext extends FabricInvocationContext {\n authorize?(action: ResolvedFabricAction): Promise<void>;\n approve(\n action: ResolvedFabricAction,\n args: Record<string, unknown>,\n ): Promise<void>;\n audits: FabricCallAudit[];\n maxResultChars: number;\n trace?: FabricExecutionTraceRecorder;\n traceOperation?: FabricExecutionTraceOperationHandle;\n observeInvocation?(event: FabricRegistryActivityEvent): void;\n}\n\n/**\n * Prefix pi-fabric prepends to every nested tool-call id it generates inside a\n * fabric_exec run (one per pi., mcp., or agents. invocation). Extensions can\n * detect that a tool_call/tool_result event came from a nested fabric call \u2014\n * rather than a top-level call the LLM made directly \u2014 by checking\n * `event.toolCallId.startsWith(NESTED_TOOL_CALL_ID_PREFIX)`. The LLM's own\n * tool-call ids (e.g. openai \"call_\u2026\", anthropic \"toolu_\u2026\") never use this\n * prefix, so the signal is unambiguous.\n */\nexport const NESTED_TOOL_CALL_ID_PREFIX = FABRIC_NESTED_TOOL_CALL_ID_PREFIX;\n\nconst providerNamePattern = /^[a-z][a-z0-9_-]*$/;\n/** A provider whose catalog is slower than this keeps a loose program global for that execution. */\nconst PROVIDER_TYPE_SOURCE_TIMEOUT_MS = 500;\n\nconst isPlainRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === \"object\" && value !== null && !Array.isArray(value);\n\n/** Lexical, deliberately loose: a miss only leaves that global loosely typed. */\nconst usesProviderGlobal = (code: string, name: string): boolean =>\n new RegExp(`(?<![\\\\w$.])${name}\\\\s*(?:\\\\?\\\\.|\\\\.|\\\\[)`).test(code);\n\n/** Copies only the named fields the declaration builder reads; never the descriptor. */\nconst actionTypeSource = (name: unknown, inputSchema: unknown): FabricNamedActionTypeSource | undefined =>\n typeof name === \"string\" && name.length > 0 && name.length <= 256\n ? { name, inputSchema: isPlainRecord(inputSchema) ? inputSchema : {} }\n : undefined;\n/** Process-wide issuance record owned by src/scope.ts. */\nconst SCOPE_HOLDER = Symbol.for(\"pi-fabric:scope:v1\");\n\n/** structuredClone detaches ordinary nested references, but deliberately shares\n * SharedArrayBuffer backing memory. Such payloads cannot be approved as stable\n * snapshots, including when hidden in maps, views, cycles or Error.cause.\n */\nconst snapshotArguments = (args: Record<string, unknown>): Record<string, unknown> => {\n const snapshot = structuredClone(args);\n const pending: unknown[] = [snapshot];\n const seen = new WeakSet<object>();\n while (pending.length > 0) {\n const value = pending.pop();\n if (value === null || typeof value !== \"object\" || seen.has(value)) continue;\n seen.add(value);\n if (typeof SharedArrayBuffer !== \"undefined\" && value instanceof SharedArrayBuffer) {\n throw new FabricTraceSafeError(\"Fabric argument snapshots cannot contain shared memory\");\n }\n // WebAssembly.Memory has no own data properties; its backing buffer is\n // nevertheless shared by structuredClone and must be inspected explicitly.\n if (Object.prototype.toString.call(value) === \"[object WebAssembly.Memory]\") {\n pending.push((value as { buffer: unknown }).buffer);\n continue;\n }\n if (ArrayBuffer.isView(value)) {\n pending.push(value.buffer);\n continue;\n }\n if (value instanceof Map) for (const [key, entry] of value) pending.push(key, entry);\n if (value instanceof Set) for (const entry of value) pending.push(entry);\n for (const key of Reflect.ownKeys(value)) {\n const property = Object.getOwnPropertyDescriptor(value, key);\n if (property && \"value\" in property) pending.push(property.value);\n }\n }\n return snapshot;\n};\n\nconst resolveDescriptor = (\n provider: FabricProvider,\n descriptor: FabricActionDescriptor,\n): ResolvedFabricAction => ({\n ...descriptor,\n effect: descriptor.effect ?? (descriptor.risk === \"read\"\n ? { kind: \"none\", ordering: \"commutative\" }\n : { kind: \"emission\", ordering: \"unknown\" }),\n provider: provider.name,\n ref: `${provider.name}.${descriptor.name}`,\n});\n\nconst descriptorHash = stableJsonHash;\n\nconst actionDescriptorHash = (action: ResolvedFabricAction): string =>\n descriptorHash({\n ref: action.ref,\n description: action.description,\n inputSchema: action.inputSchema,\n outputSchema: action.outputSchema,\n risk: action.risk,\n namespace: action.namespace,\n effect: action.effect,\n });\n\nconst discoveryTerms = (value: string): string[] =>\n [...value.normalize(\"NFKC\").matchAll(/[\\p{L}\\p{N}_]+/gu)]\n .map((match) => match[0].toLowerCase());\n\nexport const scoreActionSearch = (\n query: string,\n action: {\n ref: string;\n name: string;\n description: string;\n provider: string;\n namespace?: string;\n inputSchema: unknown;\n },\n providerDescription = \"\",\n): number => {\n const normalizedQuery = query.normalize(\"NFKC\").trim().toLowerCase();\n if (!normalizedQuery) return 0;\n const queryTerms = [...new Set(discoveryTerms(normalizedQuery))];\n const ref = action.ref.normalize(\"NFKC\").toLowerCase();\n const name = action.name.normalize(\"NFKC\").toLowerCase();\n const description = action.description.normalize(\"NFKC\").toLowerCase();\n const provider = action.provider.normalize(\"NFKC\").toLowerCase();\n const providerBody = providerDescription.normalize(\"NFKC\").toLowerCase();\n const namespace = (action.namespace ?? \"\").normalize(\"NFKC\").toLowerCase();\n const schema = JSON.stringify(action.inputSchema ?? {}).normalize(\"NFKC\").toLowerCase();\n const tokenSets = {\n ref: new Set(discoveryTerms(ref)),\n name: new Set(discoveryTerms(name)),\n description: new Set(discoveryTerms(description)),\n provider: new Set(discoveryTerms(provider)),\n providerBody: new Set(discoveryTerms(providerBody)),\n namespace: new Set(discoveryTerms(namespace)),\n schema: new Set(discoveryTerms(schema)),\n };\n const fields = Object.values(tokenSets);\n let score = 0;\n if (ref === normalizedQuery) score += 1_000;\n if (name === normalizedQuery) score += 800;\n if (ref.startsWith(normalizedQuery)) score += 300;\n else if (ref.includes(normalizedQuery)) score += 120;\n if (description.includes(normalizedQuery)) score += 40;\n if (providerBody.includes(normalizedQuery)) score += 20;\n if (schema.includes(normalizedQuery)) score += 10;\n let matchedTerms = 0;\n for (const term of queryTerms) {\n const matched = fields.some((field) => field.has(term));\n if (!matched) continue;\n matchedTerms += 1;\n if (tokenSets.ref.has(term) || tokenSets.name.has(term)) score += 30;\n if (tokenSets.provider.has(term)) score += 20;\n if (tokenSets.description.has(term)) score += 8;\n if (tokenSets.providerBody.has(term)) score += 4;\n if (tokenSets.namespace.has(term)) score += 6;\n if (tokenSets.schema.has(term)) score += 2;\n }\n if (queryTerms.length > 0 && matchedTerms === queryTerms.length) score += 15;\n return score;\n};\n\nconst conflictBetween = (\n left: FabricActionEffect,\n right: FabricActionEffect,\n): { resources: string[]; reason: FabricEffectConflict[\"reason\"] } | undefined => {\n return effectConflictsBetween(\n summarizeEffects([registrationEffect({ label: \"left\", ...left })]),\n summarizeEffects([registrationEffect({ label: \"right\", ...right })]),\n )[0];\n};\n\nexport class ActionRegistry {\n readonly #shutdown = new AbortController();\n readonly #views = new WeakMap<FabricCommittedCapabilityView, { controller: AbortController; signal: AbortSignal; authority: CapabilityAuthority }>();\n #operations: Promise<ProviderOperations> | undefined;\n readonly #providerBindings = new FabricProviderBindings();\n readonly #activeEffects = new Map<string, { ref: string; effect: FabricActionEffect }>();\n readonly #unavailable = new Map<string, string>();\n #unavailableResolver: ((name: string) => string | undefined) | undefined;\n #hostPolicy: FabricHostPolicy | undefined;\n #speculation: FabricSpeculationRuntime | undefined;\n #speculationEligibility: ((action: ResolvedFabricAction) => boolean) | undefined;\n\n constructor(readonly toolResultProxy?: FabricNestedToolResultProxy) {\n this.#providerBindings.subscribe(() => this.#speculation?.reset?.());\n }\n\n /**\n * Attach the speculative-PTC runtime. Eligibility is re-checked against the\n * resolved descriptor at launch and replay, so a config/captured-tool change\n * cannot sneak a side-effecting ref into the store after the fact.\n */\n setSpeculation(\n runtime: FabricSpeculationRuntime | undefined,\n eligibility?: (action: ResolvedFabricAction) => boolean,\n ): void {\n this.#speculation = runtime;\n this.#speculationEligibility = eligibility;\n }\n\n #allowsSpeculation(action: ResolvedFabricAction): boolean {\n const localRead = action.risk === \"read\" && action.effect?.kind === \"none\";\n // MCP keeps its conservative network/effect classification. Only the live\n // eligibility callback can attest an allowlisted read; explicit unsafe\n // annotations still refuse even if a custom callback opts it in.\n const mcpRead = action.provider === \"mcp\" && action.risk === \"network\" &&\n action.annotations?.destructiveHint !== true && action.annotations?.readOnlyHint !== false;\n return (localRead || mcpRead) && this.#speculationEligibility?.(structuredClone(action)) === true;\n }\n\n register(provider: FabricProvider, options: { overwrite?: boolean } = {}): void {\n this.mount(provider, options);\n }\n\n mount(\n provider: FabricProvider,\n options: { overwrite?: boolean; staged?: boolean } = {},\n ): FabricComponentProviderLease {\n if (this.#shutdown.signal.aborted) throw new Error(\"Fabric registry is closed\");\n if (!providerNamePattern.test(provider.name)) {\n throw new Error(`Invalid Fabric provider name: ${provider.name}`);\n }\n const lease = this.#providerBindings.mount(provider, options);\n this.#unavailable.delete(provider.name);\n return lease;\n }\n\n activateProviderBindings(bindingIds: readonly string[]): string[] {\n return this.#providerBindings.activate(bindingIds);\n }\n\n subscribeProviderChanges(\n listener: (event: FabricProviderBindingEvent) => void,\n ): () => void {\n return this.#providerBindings.subscribe(listener);\n }\n\n notifyCatalogChanged(provider: string): void {\n this.#providerBindings.notifyCatalogChanged(provider);\n }\n\n has(name: string): boolean {\n return this.#providerBindings.has(name);\n }\n\n setUnavailableResolver(resolve: (name: string) => string | undefined): void {\n this.#unavailableResolver = resolve;\n }\n\n /** Host restrictions checked before any provider prepares or runs an action. */\n setHostPolicy(policy: FabricHostPolicy | undefined): void {\n this.#hostPolicy = policy;\n }\n\n get hostPolicy(): FabricHostPolicy | undefined {\n return this.#hostPolicy;\n }\n\n #policyProviders(providers: FabricProvider[]): FabricProvider[] {\n return providers.filter((provider) => !this.#hostPolicy?.previewProviderHidden(provider.name));\n }\n\n #listProvider(\n provider: FabricProvider,\n request: FabricProviderListRequest,\n context: FabricInvocationContext,\n ): Promise<FabricActionDescriptor[]> {\n return runAbortable(context.signal, () => {\n // Seal at actual admission, even without an active policy. Pure provider\n // previews and unused type globals must not seal an otherwise idle host.\n if (this.#hostPolicy?.providerHidden(provider.name)) return [];\n return this.#providerBindings.trackProvider(provider, () => provider.list(request, context));\n });\n }\n\n #policyRefs(refs: string[]): string[] {\n const policy = this.#hostPolicy;\n if (!policy?.active) return refs;\n return refs.filter((ref) => {\n const separator = ref.indexOf(\".\");\n return !policy.refDenial(ref.slice(0, separator), ref.slice(separator + 1));\n });\n }\n\n #policyActions<T extends { provider: string; name: string }>(actions: T[]): T[] {\n const policy = this.#hostPolicy;\n return policy?.active ? actions.filter((action) => !policy.refDenial(action.provider, action.name)) : actions;\n }\n\n /**\n * Decide again on the action that resolution produced. Name repair can turn\n * a ref the policy allowed as written (pi.Write, pi.save) into a denied\n * canonical action, so every caller checks the resolved name before it\n * prepares arguments or runs the provider.\n */\n #assertResolvedAllowed(action: { provider: string; name: string }): void {\n const denial = this.#hostPolicy?.refDenial(action.provider, action.name);\n if (denial) throw new FabricResolutionError(denial);\n }\n\n markUnavailable(name: string, reason: string): void {\n if (!providerNamePattern.test(name)) {\n throw new Error(`Invalid Fabric provider name: ${name}`);\n }\n if (this.#providerBindings.has(name)) {\n throw new Error(`Cannot mark a registered Fabric provider unavailable: ${name}`);\n }\n this.#unavailable.set(name, reason);\n }\n\n unavailableProviders(): Array<{ name: string; reason: string }> {\n return [...this.#unavailable.entries()]\n .map(([name, reason]) => ({ name, reason }))\n .sort((left, right) => left.name.localeCompare(right.name));\n }\n\n unregister(\n name: string,\n options?: { provider?: FabricProvider; generation?: number | string; keepProviderOpen?: boolean },\n ): FabricProvider | undefined {\n return this.#providerBindings.unregister(name, options);\n }\n\n #visibleProviders(context?: FabricInvocationContext): FabricProvider[] {\n if (context) this.#scopeContext(context);\n return context?.capabilityView\n ? [...new Set(this.#viewAuthority(context.capabilityView).bindings().map(value => this.#providerBindings.binding(value.providerBindingId)?.provider).filter((provider): provider is FabricProvider => Boolean(provider)))]\n : this.#policyProviders(this.#providerBindings.providers());\n }\n\n providers(context?: FabricInvocationContext): Array<{ name: string; description: string }> {\n return this.#visibleProviders(context)\n .map((provider) => ({ name: provider.name, description: provider.description }))\n .sort((left, right) => left.name.localeCompare(right.name));\n }\n\n async inspectCapabilities(\n requirements: readonly (string | FabricCapabilityRequirement)[],\n context: FabricInvocationContext,\n ): Promise<FabricCapabilityResolution> {\n return this.#resolveCapabilities(requirements, context, false);\n }\n\n async acquireCapabilityView(\n requirements: readonly (string | FabricCapabilityRequirement)[],\n context: FabricInvocationContext,\n ): Promise<FabricCapabilityViewLease> {\n return this.#resolveCapabilities(requirements, context, true);\n }\n\n /**\n * Names of the visible providers that get a program global (see\n * src/provider-globals.ts): sorted, capped, and never a Fabric global, a\n * built-in provider, or a language keyword or builtin. A committed view\n * limits the names to the providers it binds.\n */\n providerGlobals(context?: FabricInvocationContext): string[] {\n return providerGlobalNames(this.#visibleProviders(context).map((provider) => provider.name));\n }\n\n /**\n * Snapshot the tool schemas backing the dynamic guest surfaces (mcp,\n * extensions and provider globals) so the type gate can reject\n * argument-shape mistakes before the sandbox runs. Side-effect-free by\n * construction: MCP data comes from the provider's cache-warm descriptor\n * slice (listing would schedule background revalidation), extension data\n * from the captured-tool catalog, provider-global data from each provider's\n * own list(). Providers that cannot supply data yet simply contribute no\n * section, or a loose global, and the loose declarations stand for that\n * execution. With `code`, a provider's list() runs only when the program\n * uses its global (`name.` or `name[`); other provider globals stay loose,\n * so a program never waits on, or triggers, a catalog it does not use.\n */\n async guestTypeSources(\n context: FabricInvocationContext,\n options: { code?: string } = {},\n ): Promise<FabricGuestTypeSources> {\n context = this.#scopeContext(context);\n const sources: FabricGuestTypeSources = {};\n const globals = this.providerGlobals(context);\n if (context.capabilityView) {\n const actions = await this.list({ limit: 1_000 }, context);\n if (globals.length > 0) {\n sources.providers = globals.map((provider) => ({\n provider,\n actions: actions\n .filter((action) => action.provider === provider)\n .flatMap((action) => actionTypeSource(action.name, action.inputSchema) ?? []),\n }));\n }\n const byServer = new Map<string, FabricNamedActionTypeSource[]>();\n for (const action of actions.filter((candidate) => candidate.provider === \"mcp\")) {\n const server = action.namespace;\n if (!server || server === \"management\" || action.name.startsWith(\"$\")) continue;\n const prefix = `${server}.`;\n const name = action.name.startsWith(prefix)\n ? action.name.slice(prefix.length)\n : action.name;\n const tools = byServer.get(server) ?? [];\n tools.push({ name, inputSchema: action.inputSchema });\n byServer.set(server, tools);\n }\n if (byServer.size > 0) {\n sources.mcpServers = [...byServer.entries()].map(([server, tools]) => ({\n server,\n tools,\n }));\n }\n const extensionTools = actions\n .filter((action) => action.provider === \"extensions\")\n .map((action) => ({ name: action.name, inputSchema: action.inputSchema }));\n if (extensionTools.length > 0) sources.extensionTools = extensionTools;\n return sources;\n }\n const mcp = this.#providerBindings.current(\"mcp\")?.provider as\n | (FabricProvider & { sliceDescriptors?: () => FabricActionDescriptor[] })\n | undefined;\n const mcpDescriptors = this.#hostPolicy?.active\n ? mcp?.sliceDescriptors?.().filter((descriptor) => !this.#hostPolicy!.previewDenial(\"mcp\", descriptor.name))\n : mcp?.sliceDescriptors?.();\n if (mcpDescriptors && mcpDescriptors.length > 0) {\n const byServer = new Map<string, Map<string, FabricNamedActionTypeSource>>();\n for (const descriptor of mcpDescriptors) {\n const server = descriptor.namespace;\n if (!server || server === \"management\" || descriptor.name.startsWith(\"$\")) continue;\n const prefix = `${server}.`;\n const toolName = descriptor.name.startsWith(prefix)\n ? descriptor.name.slice(prefix.length)\n : descriptor.name;\n let tools = byServer.get(server);\n if (!tools) {\n tools = new Map();\n byServer.set(server, tools);\n }\n // Teaching: the type gate checks programs against the compiled\n // schema, the same shape invoke validates against, so shape\n // mistakes surface before the sandbox runs.\n tools.set(toolName, {\n name: toolName,\n inputSchema: effectiveInputSchema(\n `mcp.${descriptor.name}`,\n descriptor.inputSchema,\n ) as Record<string, unknown>,\n });\n }\n if (byServer.size > 0) {\n sources.mcpServers = [...byServer.entries()].map(([server, tools]) => ({\n server,\n tools: [...tools.values()],\n }));\n }\n }\n const extensions = this.#providerBindings.current(\"extensions\")?.provider;\n if (extensions) {\n try {\n const descriptors = this.#policyActions((await this.#listProvider(extensions, {}, context)).map((descriptor) => ({ ...descriptor, provider: \"extensions\" })));\n if (descriptors.length > 0) {\n sources.extensionTools = descriptors.map((descriptor) => ({\n name: descriptor.name,\n inputSchema: effectiveInputSchema(\n `extensions.${descriptor.name}`,\n descriptor.inputSchema,\n ) as Record<string, unknown>,\n }));\n }\n } catch {\n // Capture catalog not ready yet; the loose extensions surface stands\n // for this execution.\n }\n }\n if (globals.length > 0) {\n const { code } = options;\n sources.providers = await Promise.all(globals.map((name) =>\n code === undefined || usesProviderGlobal(code, name)\n ? this.#providerTypeSource(name, context)\n : { provider: name, actions: [] }));\n }\n return sources;\n }\n\n // A provider that fails, stalls past the bound, or lists nothing still gets\n // its global, declared loosely: the global's existence never depends on a\n // transient listing, and the registry validates every call at dispatch.\n async #providerTypeSource(name: string, context: FabricInvocationContext): Promise<FabricProviderTypeSource> {\n const provider = this.#providerBindings.current(name)?.provider;\n if (!provider) return { provider: name, actions: [] };\n let timer: ReturnType<typeof setTimeout> | undefined;\n try {\n const descriptors = await Promise.race([\n this.#listProvider(provider, {}, context),\n new Promise<undefined>((resolve) => {\n const handle = setTimeout(() => resolve(undefined), PROVIDER_TYPE_SOURCE_TIMEOUT_MS);\n (handle as { unref?: () => void }).unref?.();\n timer = handle;\n }),\n ]);\n if (!Array.isArray(descriptors)) return { provider: name, actions: [] };\n const quarantined = activeQuarantinedRefNames();\n return {\n provider: name,\n actions: descriptors.flatMap((descriptor) => {\n if (!isPlainRecord(descriptor) || quarantined.has(`${name}.${String(descriptor.name)}`)) return [];\n if (this.#hostPolicy?.active && this.#hostPolicy.refDenial(name, String(descriptor.name))) return [];\n // Teaching: the type gate checks against the compiled schema,\n // the same shape invoke validates against.\n return actionTypeSource(\n descriptor.name,\n isPlainRecord(descriptor.inputSchema)\n ? effectiveInputSchema(`${name}.${descriptor.name}`, descriptor.inputSchema)\n : undefined,\n ) ?? [];\n }),\n };\n } catch {\n return { provider: name, actions: [] };\n } finally {\n if (timer) clearTimeout(timer);\n }\n }\n\n // The model-facing discovery view: quarantined refs hide here, and the\n // compiled overlay teaches: listed schemas show the compiled shape so\n // tightened enums are visible before the first call. Pass `declared: true`\n // for the compile's base-surface truth, which keeps quarantined refs\n // visible and schemas declared so base-digest proofs and artifact\n // carry-forward read the live contract. Capability-view paths stay\n // declared everywhere (see describe): committed views pin declared\n // digests, and a surface activation must never invalidate them.\n async listDetailed(\n request: FabricProviderListRequest & { provider?: string; declared?: boolean },\n context: FabricInvocationContext,\n include: (action: ResolvedFabricAction) => boolean = () => true,\n ): Promise<{ actions: ResolvedFabricAction[]; total: number; truncated: boolean }> {\n context = this.#scopeContext(context);\n if (context.capabilityView) {\n const refs = this.#policyRefs(this.#viewAuthority(context.capabilityView).bindings().map(binding => binding.ref))\n .filter((ref) => !request.provider || ref.startsWith(`${request.provider}.`))\n .filter((ref) => request.declared || !activeQuarantinedRefNames().has(ref))\n .sort();\n const actions = await Promise.all(refs.map((ref) => this.describe(ref, context)));\n const query = request.query?.normalize(\"NFKC\").trim().toLowerCase();\n const filtered = actions\n .filter((action) => !request.namespace || action.namespace === request.namespace)\n .filter((action) =>\n !query || `${action.ref} ${action.description}`.toLowerCase().includes(query),\n )\n .filter(include);\n const page = filtered.slice(0, fabricActionListLimit(request.limit));\n return { actions: page, total: filtered.length, truncated: filtered.length > page.length };\n }\n const providers = this.#policyProviders(request.provider\n ? [this.#requireProvider(request.provider)]\n : this.#providerBindings.providers());\n const lists = await Promise.all(\n providers.map(async (provider) => {\n // Provider enumeration is exhaustive; only the registry applies the\n // presentation limit, after visibility filtering and total counting.\n const enumeration: FabricProviderListRequest = {\n ...(request.namespace === undefined ? {} : { namespace: request.namespace }),\n ...(request.query === undefined ? {} : { query: request.query }),\n };\n const descriptors = await this.#listProvider(provider, enumeration, context);\n return descriptors\n .filter(\n (descriptor) =>\n request.declared ||\n !activeQuarantinedRefNames().has(`${provider.name}.${descriptor.name}`),\n )\n .map((descriptor) => {\n const action = resolveDescriptor(provider, descriptor);\n // Teaching: the listing carries the compiled schema. Declared\n // requests (the compile snapshot) keep the live contract.\n return request.declared\n ? action\n : {\n ...action,\n inputSchema: effectiveInputSchema(\n action.ref,\n action.inputSchema,\n ) as Record<string, unknown>,\n };\n });\n }),\n );\n const all = this.#policyActions(lists.flat()).filter(include);\n const page = all.slice(0, fabricActionListLimit(request.limit));\n return { actions: page, total: all.length, truncated: all.length > page.length };\n }\n async list(\n request: FabricProviderListRequest & { provider?: string; declared?: boolean },\n context: FabricInvocationContext,\n ): Promise<ResolvedFabricAction[]> {\n const { actions } = await this.listDetailed(request, context);\n return actions;\n }\n\n async catalog(\n context: FabricInvocationContext,\n options: {\n provider?: string;\n limit?: number;\n includeProvider?: (provider: string) => boolean;\n } = {},\n ): Promise<FabricCapabilityCatalog> {\n context = this.#scopeContext(context);\n const providers = (context.capabilityView\n ? [...new Map(\n this.#viewAuthority(context.capabilityView).bindings().flatMap((pinned) => {\n const binding = this.#providerBindings.binding(pinned.providerBindingId);\n return binding ? [[binding.name, binding.provider] as const] : [];\n }),\n ).values()]\n : options.provider\n ? [this.#requireProvider(options.provider)]\n : this.#providerBindings.providers())\n .filter((provider) => !options.provider || provider.name === options.provider)\n .filter((provider) => options.includeProvider?.(provider.name) ?? true)\n .filter((provider) => !this.#hostPolicy?.previewProviderHidden(provider.name))\n .sort((left, right) => left.name.localeCompare(right.name));\n const lists = await Promise.all(\n providers.map(async (provider) => ({\n provider,\n actions: context.capabilityView\n ? await this.list({ provider: provider.name, limit: 1_000 }, context)\n : (await this.#listProvider(provider, {}, context))\n .filter(\n (descriptor) =>\n !activeQuarantinedRefNames().has(`${provider.name}.${descriptor.name}`),\n )\n .map((descriptor) => resolveDescriptor(provider, descriptor)),\n })),\n ).then((entries) => entries.map(({ provider, actions }) => ({ provider, actions: this.#policyActions(actions) })));\n const allActions = lists.flatMap(({ actions }) => actions)\n .sort((left, right) => left.ref.localeCompare(right.ref));\n const limit = Math.max(1, Math.min(Math.floor(options.limit ?? 1_000), 1_000));\n const retainedRefs = new Set(allActions.slice(0, limit).map((action) => action.ref));\n const providerHeads = lists.map(({ provider, actions }) => {\n const actionHeads = actions\n .filter((action) => retainedRefs.has(action.ref))\n .sort((left, right) => left.ref.localeCompare(right.ref))\n .map((action) => ({\n key: `action:${action.ref}`,\n parentKey: `provider:${provider.name}`,\n ref: action.ref,\n name: action.name,\n description: action.description,\n descriptorHash: actionDescriptorHash(action),\n risk: action.risk,\n ...(action.namespace === undefined ? {} : { namespace: action.namespace }),\n ...(action.effect === undefined ? {} : { effect: action.effect }),\n }));\n return {\n key: `provider:${provider.name}`,\n parentKey: \"capability:fabric\",\n name: provider.name,\n description: provider.description,\n descriptorHash: descriptorHash({\n name: provider.name,\n description: provider.description,\n actions: actionHeads.map((action) => action.descriptorHash),\n }),\n actions: actionHeads,\n };\n });\n const indexedActions = providerHeads.reduce((total, provider) => total + provider.actions.length, 0);\n const rootHash = descriptorHash(providerHeads.map((provider) => provider.descriptorHash));\n return {\n kind: \"pi-fabric.capability-catalog\",\n version: 1,\n root: {\n key: \"capability:fabric\",\n name: \"Fabric capabilities\",\n description: context.capabilityView\n ? \"Committed provider and action metadata for this execution; not historical session evidence.\"\n : \"Current registered provider and action metadata for navigation; not historical session evidence.\",\n descriptorHash: rootHash,\n },\n providers: providerHeads,\n totalActions: allActions.length,\n indexedActions,\n complete: indexedActions === allActions.length,\n reasons: indexedActions === allActions.length ? [] : [\"action_limit\"],\n };\n }\n\n async search(\n query: string,\n context: FabricInvocationContext,\n limit = 30,\n ): Promise<ResolvedFabricAction[]> {\n const normalizedQuery = query.normalize(\"NFKC\").trim().toLowerCase();\n if (!normalizedQuery) return [];\n const listed = await this.list({ limit: 1_000 }, context);\n return listed\n .map((action) => ({\n action,\n score: scoreActionSearch(\n normalizedQuery,\n action,\n this.#providerBindings.current(action.provider)?.provider.description ?? \"\",\n ),\n }))\n .filter((entry) => entry.score > 0)\n .sort(\n (left, right) =>\n right.score - left.score || left.action.ref.localeCompare(right.action.ref),\n )\n .slice(0, Math.max(1, Math.min(limit, 100)))\n .map((entry) => entry.action);\n }\n\n async describe(ref: string, context: FabricInvocationContext): Promise<ResolvedFabricAction> {\n context = this.#scopeContext(context);\n if (ref.includes(\".\")) {\n const { provider, actionName, expectedDescriptorHash } = this.#parseRef(\n ref,\n context.capabilityView,\n );\n const resolved = await this.#resolveActionDescriptor(\n provider,\n actionName,\n context,\n context.capabilityView === undefined,\n );\n if (!resolved.action) {\n throw new FabricResolutionError(formatUnknownActionMessage(ref, resolved.suggestions));\n }\n const action = resolved.action;\n this.#assertResolvedAllowed(action);\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) {\n throw new FabricResolutionError(`Fabric capability descriptor changed: ${ref}`);\n }\n return action;\n }\n if (context.capabilityView) {\n const pinned = await Promise.all(\n this.#policyRefs(this.#viewAuthority(context.capabilityView).bindings().map(binding => binding.ref)).map((candidate) =>\n this.describe(candidate, context),\n ),\n );\n const matches = pinned.filter((action) => action.name === ref);\n if (matches.length === 1) return matches[0]!;\n if (matches.length > 1) {\n throw new Error(\n `\"${ref}\" matches ${matches.length} committed Fabric actions; qualify with provider.action: ` +\n matches.map((match) => match.ref).sort().join(\", \"),\n );\n }\n throw new FabricResolutionError(`Unknown Fabric action in committed view: ${ref}`);\n }\n // Bare action names (what typed calls pragmatically use): walk every\n // provider for a unique action-name match.\n const matches: ResolvedFabricAction[] = [];\n const declaredNames: string[] = [];\n for (const provider of this.#policyProviders(this.#providerBindings.providers())) {\n let descriptors: FabricActionDescriptor[];\n try {\n descriptors = await this.#listProvider(provider, {}, context);\n } catch {\n continue;\n }\n for (const descriptor of descriptors) {\n declaredNames.push(descriptor.name);\n if (descriptor.name === ref) matches.push(resolveDescriptor(provider, descriptor));\n }\n }\n matches.splice(0, matches.length, ...this.#policyActions(matches));\n if (matches.length === 1) return matches[0]!;\n if (matches.length > 1) {\n throw new Error(\n `\"${ref}\" matches ${matches.length} Fabric actions; qualify with provider.action: ` +\n matches.map((match) => match.ref).sort().join(\", \"),\n );\n }\n const repair = repairActionName(declaredNames, ref);\n throw new FabricResolutionError(formatUnknownActionMessage(ref, repair.suggestions));\n }\n\n async acquireScoped(\n ref: string,\n args: Record<string, unknown>,\n context: FabricInvocationContext & Partial<Pick<FabricRegistryInvocationContext, \"authorize\" | \"approve\">>,\n adopt?: ProviderOperation[\"adopt\"],\n ): Promise<FabricScopedProviderResult> {\n context = this.#scopeContext(context);\n args = snapshotArguments(args);\n const { binding, provider, actionName, expectedDescriptorHash } = this.#parseRef(\n ref,\n context.capabilityView,\n );\n context = this.#bindingContext(binding, context);\n const endInvocation = this.#providerBindings.beginInvocation(binding.id);\n const releaseBinding = this.#providerBindings.retain([binding.id]);\n try {\n const resolved = await this.#resolveActionDescriptor(\n provider,\n actionName,\n context,\n context.capabilityView === undefined,\n );\n if (!resolved.action) {\n throw new FabricResolutionError(formatUnknownActionMessage(ref, resolved.suggestions));\n }\n const action = resolved.action;\n this.#assertResolvedAllowed(action);\n const providerActionName = resolved.repairedFrom === undefined ? actionName : action.name;\n const authority = { ref: action.ref, descriptor: actionDescriptorHash(action) };\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) {\n throw new FabricResolutionError(`Fabric capability descriptor changed: ${ref}`);\n }\n if (action.effect?.kind !== \"scoped\") {\n throw new Error(`Fabric action is not a scoped acquisition: ${ref}`);\n }\n if (!provider.acquire) {\n throw new Error(`Fabric provider does not implement scoped acquisition: ${provider.name}`);\n }\n // Supervised callers may supply the same policy hooks as invoke. Base\n // contexts remain supported; their host owns authorization/approval.\n if (context.authorize) {\n await runAbortable(context.signal, () => context.authorize!(structuredClone(action)));\n }\n const effectiveSchema = effectiveInputSchema(\n action.ref,\n action.inputSchema,\n ) as Record<string, unknown>;\n const catalogInput = repairCatalogInput(action.ref, effectiveSchema, args);\n const preparedArgs = provider.prepareArguments\n ? await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.prepareArguments!(providerActionName, catalogInput.args, context)),\n )\n : catalogInput.args;\n if (typeof preparedArgs !== \"object\" || preparedArgs === null || Array.isArray(preparedArgs)) {\n throw new Error(`Argument preparation for ${ref} did not return an object`);\n }\n const catalog = validateCatalogArgs(\n action.ref,\n effectiveSchema,\n // Preparation may return provider-held nested references. Detach before\n // validation and never expose this validated snapshot to policy hooks.\n snapshotArguments(preparedArgs),\n catalogInput.observedUnexpected,\n );\n if (catalog.invalid) throw new Error(`Invalid arguments for ${ref}: ${catalog.invalid}`);\n if (context.approve) {\n await runAbortable(context.signal, () => context.approve!(structuredClone(action), snapshotArguments(catalog.args)));\n }\n const acquired = await runAbortable(context.signal, () =>\n this.#runPlanned(binding, providerActionName, authority, \"acquire\", catalog.args, context, undefined, adopt),\n ) as FabricScopedProviderResult;\n throwIfAborted(context.signal);\n if (!acquired || typeof acquired.dispose !== \"function\") {\n throw new Error(`Scoped acquisition ${ref} did not return a disposer`);\n }\n return { value: acquired.value, dispose: acquired.dispose };\n } finally {\n void endInvocation().catch(() => undefined);\n // The interpreter owns the returned resource lease. This temporary hold\n // protects resolution/acquisition only; cancellation must not await close.\n void releaseBinding().catch(() => undefined);\n }\n }\n\n async invoke(\n ref: string,\n args: Record<string, unknown>,\n context: FabricRegistryInvocationContext,\n ): Promise<unknown> {\n context = this.#scopeContext(context);\n args = snapshotArguments(args);\n const traceOperation = context.traceOperation ?? context.trace?.issueCall(ref, snapshotArguments(args));\n let failureStage: \"resolve\" | \"guard\" | \"prepare\" | \"validate\" | \"approve\" | \"invoke\" = \"resolve\";\n let audit: FabricCallAudit | undefined;\n let invocationActive = false;\n let endBindingInvocation: (() => Promise<void>) | undefined;\n try {\n const { binding, provider, actionName, expectedDescriptorHash } = this.#parseRef(\n ref,\n context.capabilityView,\n );\n context = this.#bindingContext(binding, context);\n endBindingInvocation = this.#providerBindings.beginInvocation(binding.id);\n const resolved = await this.#resolveActionDescriptor(\n provider,\n actionName,\n context,\n context.capabilityView === undefined,\n );\n if (!resolved.action) {\n throw new FabricResolutionError(formatUnknownActionMessage(ref, resolved.suggestions));\n }\n const action = resolved.action;\n this.#assertResolvedAllowed(action);\n const providerActionName = resolved.repairedFrom === undefined ? actionName : action.name;\n const authority = { ref: action.ref, descriptor: actionDescriptorHash(action) };\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) {\n throw new FabricResolutionError(`Fabric capability descriptor changed: ${ref}`);\n }\n traceOperation?.resolved(action.provider, action.name);\n\n failureStage = \"guard\";\n if (action.effect?.kind === \"scoped\") {\n throw new FabricTraceSafeError(\n `Fabric scoped action ${ref} requires a supervised acquisition context`,\n );\n }\n if (context.authorize) {\n await runAbortable(context.signal, () => context.authorize!(structuredClone(action)));\n }\n\n failureStage = \"prepare\";\n const effectiveSchema = effectiveInputSchema(\n action.ref,\n action.inputSchema,\n ) as Record<string, unknown>;\n const catalogInput = repairCatalogInput(action.ref, effectiveSchema, args);\n const preparedArgs = provider.prepareArguments\n ? await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.prepareArguments!(providerActionName, catalogInput.args, context)),\n )\n : catalogInput.args;\n if (typeof preparedArgs !== \"object\" || preparedArgs === null || Array.isArray(preparedArgs)) {\n throw new FabricTraceSafeError(`Argument preparation for ${ref} did not return an object`);\n }\n\n failureStage = \"validate\";\n const catalog = validateCatalogArgs(\n action.ref,\n effectiveSchema,\n // Preparation may return provider-held nested references. Detach before\n // validation and never expose this validated snapshot to policy hooks.\n snapshotArguments(preparedArgs),\n catalogInput.observedUnexpected,\n );\n traceOperation?.prepared(snapshotArguments(catalog.args));\n if (catalog.normalization) traceOperation?.normalized(structuredClone(catalog.normalization));\n // TypeBox validator messages describe schema expectations only \u2014 they\n // never echo argument values \u2014 so they are safe for durable traces.\n if (catalog.invalid) {\n // A validate-rejected attempt is in-domain evidence against the\n // effective surface, but rejected argument values are untrusted\n // input and never enter the durable record. The trace-safe feed\n // persists only values the live schema's own enums declare: for a\n // closed-domain parameter the refused value is already the author's\n // public vocabulary, so the observation pool can carry it and a\n // later reset (base drift or review) re-derives with it included.\n // Values outside the declared enums (typos, payloads) drop here,\n // the same pre-birth rule the derivation applies.\n const declaredSchema = action.inputSchema;\n const declaredProperties =\n typeof declaredSchema === \"object\" &&\n declaredSchema !== null &&\n !Array.isArray(declaredSchema) &&\n typeof (declaredSchema as Record<string, unknown>).properties === \"object\" &&\n (declaredSchema as Record<string, unknown>).properties !== null\n ? ((declaredSchema as Record<string, unknown>).properties as Record<string, unknown>)\n : undefined;\n const attemptArgs: Record<string, unknown> = {};\n for (const [key, value] of Object.entries(catalog.args)) {\n const property = declaredProperties ? declaredProperties[key] : undefined;\n const declaredEnum =\n typeof property === \"object\" && property !== null\n ? (property as Record<string, unknown>).enum\n : undefined;\n if (!Array.isArray(declaredEnum)) continue;\n if (\n typeof value !== \"string\" &&\n typeof value !== \"number\" &&\n typeof value !== \"boolean\"\n ) {\n continue;\n }\n if (String(value).length > MAX_AUDIT_VALUE_CHARS) continue;\n if (!declaredEnum.includes(value)) continue;\n attemptArgs[key] = value;\n }\n if (Object.keys(attemptArgs).length > 0) {\n const attempt: FabricCallAudit = {\n ref,\n nestedToolCallId: `${NESTED_TOOL_CALL_ID_PREFIX}${randomUUID()}`,\n startedAt: Date.now(),\n tool: action.name,\n provider: action.provider,\n args: attemptArgs,\n success: false,\n error: `Invalid arguments for ${ref}: ${catalog.invalid}`,\n endedAt: Date.now(),\n ...(resolved.repairedFrom !== undefined\n ? { repairedFrom: resolved.repairedFrom }\n : {}),\n };\n context.audits.push(attempt);\n }\n throw new FabricTraceSafeError(`Invalid arguments for ${ref}: ${catalog.invalid}`);\n }\n\n failureStage = \"approve\";\n await runAbortable(context.signal, () => context.approve(structuredClone(action), snapshotArguments(catalog.args)));\n\n failureStage = \"invoke\";\n const nestedToolCallId = `${NESTED_TOOL_CALL_ID_PREFIX}${randomUUID()}`;\n const effect = action.effect!;\n const effectConflicts = [...this.#activeEffects.values()].flatMap((active) => {\n const conflict = conflictBetween(effect, active.effect);\n return conflict ? [{ withRef: active.ref, ...conflict }] : [];\n }).slice(0, 32);\n if (effectConflicts.length > 0 && context.effectPolicy === \"strict\") {\n failureStage = \"guard\";\n throw new FabricTraceSafeError(\n `Fabric effect conflict for ${ref}: ${effectConflicts\n .map((conflict) => formatFabricEffectConflict(\n conflict.withRef,\n conflict.resources,\n conflict.reason,\n ))\n .join(\"; \")}`,\n );\n }\n const argsPreview = previewArgs(ref, catalog.args);\n const activeAudit: FabricCallAudit = {\n ref,\n nestedToolCallId,\n startedAt: Date.now(),\n tool: action.name,\n provider: action.provider,\n args: boundedPreviewValue(\n argsPreview,\n MAX_AUDIT_VALUE_CHARS,\n ) as Record<string, unknown>,\n ...(effectConflicts.length > 0 ? { effectConflicts } : {}),\n ...(resolved.repairedFrom !== undefined\n ? { repairedFrom: resolved.repairedFrom }\n : {}),\n };\n audit = activeAudit;\n invocationActive = true;\n context.audits.push(activeAudit);\n context.observeInvocation?.({\n type: \"call_start\",\n callId: nestedToolCallId,\n ref,\n args: argsPreview,\n });\n context.update(`Calling ${ref}`);\n this.#activeEffects.set(nestedToolCallId, { ref, effect });\n let servedFromSpeculation = false;\n let providerValue: unknown;\n let providerInvoked = false;\n try {\n if (this.#speculation && this.#allowsSpeculation(action)) {\n const served = await runAbortable(context.signal, () =>\n this.#speculation!.tryServe(context.parentToolCallId, ref, snapshotArguments(catalog.args), JSON.stringify([binding.id, authority.descriptor, context.capabilityView?.id ?? null, context.scope?.digest ?? null, context.nativeToolResult === true])));\n if (served.hit) {\n providerValue = await runAbortable(context.signal, () => this.#runPlanned(binding, providerActionName, authority, \"replay\", catalog.args, context, served.value));\n servedFromSpeculation = true;\n activeAudit.speculated = true;\n if (served.replay.updatedArgs !== undefined) {\n const replayedPreview = previewArgs(ref, served.replay.updatedArgs);\n activeAudit.args = boundedPreviewValue(\n replayedPreview,\n MAX_AUDIT_VALUE_CHARS,\n ) as Record<string, unknown>;\n traceOperation?.prepared(snapshotArguments(served.replay.updatedArgs));\n context.observeInvocation?.({\n type: \"call_args\",\n callId: nestedToolCallId,\n args: replayedPreview,\n });\n }\n if (served.replay.media?.length) {\n activeAudit.media = [...(activeAudit.media ?? []), ...served.replay.media];\n if (served.replay.mediaNote) activeAudit.mediaNote = served.replay.mediaNote;\n }\n if (served.replay.preview !== undefined) activeAudit.preview = served.replay.preview;\n if (served.replay.terminate) activeAudit.terminate = true;\n }\n }\n if (!servedFromSpeculation) {\n providerInvoked = true;\n providerValue = await runAbortable(context.signal, () =>\n this.#runPlanned(binding, providerActionName, authority, \"invoke\", catalog.args, {\n ...context,\n nestedToolCallId,\n update(message) {\n if (!invocationActive) return;\n context.update(message);\n context.observeInvocation?.({\n type: \"call_update\",\n callId: nestedToolCallId,\n update: { type: \"progress\", message },\n });\n },\n activity(update) {\n if (!invocationActive) return;\n context.activity?.(update);\n context.observeInvocation?.({\n type: \"call_update\",\n callId: nestedToolCallId,\n update,\n });\n },\n attachMedia(blocks, note) {\n if (!invocationActive) return;\n if (!activeAudit.media) activeAudit.media = [];\n for (const block of blocks) activeAudit.media.push(block);\n if (note) activeAudit.mediaNote = note;\n },\n updateArguments(updatedArgs) {\n if (!invocationActive) return;\n const updatedPreview = previewArgs(ref, updatedArgs);\n activeAudit.args = boundedPreviewValue(\n updatedPreview,\n MAX_AUDIT_VALUE_CHARS,\n ) as Record<string, unknown>;\n traceOperation?.prepared(snapshotArguments(updatedArgs));\n context.observeInvocation?.({\n type: \"call_args\",\n callId: nestedToolCallId,\n args: updatedPreview,\n });\n },\n attachPreview(preview) {\n if (!invocationActive) return;\n activeAudit.preview = preview;\n },\n requestTerminate() {\n if (!invocationActive) return;\n activeAudit.terminate = true;\n },\n }).finally(() => {\n if (effect.kind !== \"none\") this.#speculation?.bumpEpoch();\n this.#activeEffects.delete(nestedToolCallId);\n }),\n );\n }\n } finally {\n if (!providerInvoked) this.#activeEffects.delete(nestedToolCallId);\n }\n const value = this.toolResultProxy\n ? await runAbortable(context.signal, () => this.toolResultProxy!.proxy({\n action,\n args: snapshotArguments(catalog.args),\n toolCallId: nestedToolCallId,\n parentToolCallId: context.parentToolCallId,\n value: providerValue,\n ...(context.signal ? { signal: context.signal } : {}),\n }))\n : providerValue;\n const bounded = action.ref === \"jev.decide\"\n ? strictDecisionResult(value)\n : boundedResult(value, context.maxResultChars);\n const resultError = failedResultError(value);\n activeAudit.success = resultError === undefined;\n if (resultError) activeAudit.error = resultError;\n activeAudit.resultChars = bounded.chars;\n activeAudit.resultTruncated = bounded.truncated;\n const resultPreview = previewResult(bounded.value);\n activeAudit.result = boundedPreviewValue(resultPreview, MAX_AUDIT_VALUE_CHARS);\n activeAudit.endedAt = Date.now();\n context.observeInvocation?.({\n type: \"call_end\",\n callId: nestedToolCallId,\n success: resultError === undefined,\n result: resultPreview,\n ...(activeAudit.preview !== undefined ? { preview: activeAudit.preview } : {}),\n ...(resultError ? { error: resultError } : {}),\n });\n if (resultError) {\n traceOperation?.fail(\"invoke\", resultError, failedResultOutcome(value), bounded.value, {\n resultTruncated: bounded.truncated,\n });\n } else {\n traceOperation?.succeed(bounded.value, { resultTruncated: bounded.truncated });\n }\n throwIfAborted(context.signal);\n return bounded.value;\n } catch (error) {\n const message = error instanceof Error ? error.message : String(error);\n traceOperation?.fail(failureStage, error, executionOutcomeFromError(error, context.signal));\n if (audit) {\n audit.success = false;\n audit.error = message;\n audit.endedAt = Date.now();\n context.observeInvocation?.({\n type: \"call_end\",\n callId: audit.nestedToolCallId,\n success: false,\n error: audit.error,\n });\n }\n throw error;\n } finally {\n invocationActive = false;\n if (audit) audit.endedAt ??= Date.now();\n void endBindingInvocation?.().catch(() => undefined);\n }\n }\n\n /**\n * Prepare + pre-launch a speculative call discovered in a partially\n * streamed program (see src/speculation). Pure pipeline only: descriptor\n * resolution, the eligibility gate on the resolved action, argument\n * preparation, and schema validation. The compiled entropy surface gates\n * launches too: quarantined refs never pre-launch and overlays validate\n * prepared arguments, so the store never warms a call the serve path\n * would reject. authorize/approve/audits are skipped\n * because the eligibility gate restricts this path to actions that never\n * prompt, and the real call re-runs the full pipeline on a serve miss.\n * Side-channel outputs are captured into `replay` so the serve path can\n * project them into the real audit.\n */\n async speculate(\n ref: string,\n args: Record<string, unknown>,\n context: FabricInvocationContext,\n replay: FabricSpeculationReplay,\n ): Promise<\n | {\n preparedArgs: Record<string, unknown>;\n bindingToken: string;\n execute(signal: AbortSignal | undefined): Promise<unknown>;\n }\n | undefined\n > {\n if (!this.#speculationEligibility) return undefined;\n try {\n context = this.#scopeContext(context);\n args = snapshotArguments(args);\n const { binding, provider, actionName, expectedDescriptorHash } = this.#parseRef(\n ref,\n context.capabilityView,\n );\n context = this.#bindingContext(binding, context);\n const descriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(actionName, context)));\n if (!descriptor) return undefined;\n const action = resolveDescriptor(provider, descriptor);\n if (this.#hostPolicy?.refDenial(action.provider, action.name)) return undefined;\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) {\n return undefined;\n }\n if (isActiveQuarantine(provider.name, actionName, descriptor.inputSchema)) {\n return undefined;\n }\n const authority = { ref: action.ref, descriptor: actionDescriptorHash(action) };\n if (!this.#allowsSpeculation(action)) return undefined;\n const effectiveSchema = effectiveInputSchema(\n action.ref,\n action.inputSchema,\n ) as Record<string, unknown>;\n const catalogInput = applyActiveArgRepairs(action.ref, args, effectiveSchema);\n const preparedArgs = provider.prepareArguments\n ? await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.prepareArguments!(action.name, catalogInput, context)))\n : catalogInput;\n if (\n typeof preparedArgs !== \"object\" ||\n preparedArgs === null ||\n Array.isArray(preparedArgs)\n ) {\n return undefined;\n }\n const repairedArgs = normalizeActiveArguments(action.ref, effectiveSchema,\n applyActiveArgRepairs(action.ref, snapshotArguments(preparedArgs), effectiveSchema),\n ).args;\n if (validationMessage(effectiveSchema, repairedArgs)) return undefined;\n const nestedToolCallId = `${NESTED_TOOL_CALL_ID_PREFIX}spec-${randomUUID()}`;\n const execute = await this.#preparePlanned(binding, action.name, authority, \"speculate\", repairedArgs, this.#bindingContext(binding, {\n ...context, nestedToolCallId, update() {}, activity() {},\n attachMedia(blocks, note) { replay.media = [...(replay.media ?? []), ...blocks]; if (note) replay.mediaNote = note; },\n updateArguments(updatedArgs) { replay.updatedArgs = updatedArgs; },\n attachPreview(preview) { replay.preview = preview; },\n requestTerminate() { replay.terminate = true; },\n }));\n return {\n get preparedArgs() { return snapshotArguments(repairedArgs); },\n bindingToken: JSON.stringify([binding.id, authority.descriptor, context.capabilityView?.id ?? null, context.scope?.digest ?? null, context.nativeToolResult === true]),\n execute: async signal => {\n const combined = AbortSignal.any([context.signal!, ...(signal ? [signal] : [])]);\n const actual = execute(combined);\n void actual.catch(() => undefined);\n return runAbortable(combined, () => actual);\n },\n };\n } catch {\n // Speculation degrades silently; the real call runs the full pipeline.\n return undefined;\n }\n }\n\n async endInvocation(parentToolCallId: string, timeoutMs = 1_000): Promise<void> {\n this.#speculation?.onInvocationEnd?.(parentToolCallId);\n const providers = new Set(\n this.#providerBindings.entries().map((binding) => binding.provider),\n );\n const finalizers = [...providers].flatMap((provider) =>\n provider.invocationEnded\n ? [this.#providerBindings.trackProvider(provider, () => provider.invocationEnded!(parentToolCallId), true)]\n : [],\n );\n await settleWithin(finalizers, timeoutMs);\n }\n\n /** Revocation is distinct from rolling withdrawal: pinned old generations may\n * survive retirement, but revoked bindings admit no further work. */\n revokeProvider(name: string): void {\n const binding = this.#providerBindings.current(name);\n if (binding) this.#providerBindings.revoke(binding.id);\n }\n\n providerStatus(): Array<{ name: string; generation: number; state: string; inFlight: number; revoked: boolean; error?: string }> {\n return this.#providerBindings.entries().map(binding => ({ name: binding.name, generation: binding.generation, state: binding.state,\n inFlight: binding.inFlight, revoked: this.#providerBindings.signal(binding.id).aborted,\n ...(binding.closeError ? { error: binding.closeError } : {}) }));\n }\n\n async close(excludedProviderNames: Set<string> = new Set()): Promise<void> {\n this.#shutdown.abort(new Error(\"Fabric registry closed\"));\n try {\n if (this.#operations) await (await this.#operations).close();\n } finally {\n await this.#providerBindings.close(excludedProviderNames);\n }\n }\n\n\n async #resolveCapabilities(\n requirements: readonly (string | FabricCapabilityRequirement)[],\n context: FabricInvocationContext,\n retain: boolean,\n ): Promise<FabricCapabilityViewLease> {\n context = this.#scopeContext(context);\n const normalized = new Map<string, boolean>();\n for (const requirement of requirements) {\n const ref = (typeof requirement === \"string\" ? requirement : requirement.ref).trim();\n if (!ref || ref.length > 256 || !ref.includes(\".\")) {\n throw new Error(`Fabric capability requirements must use provider.action: ${ref || \"<empty>\"}`);\n }\n const optional = typeof requirement === \"string\" ? false : requirement.optional === true;\n normalized.set(ref, (normalized.get(ref) ?? true) && optional);\n }\n\n const missing: string[] = [];\n const optionalMissing: string[] = [];\n const resolved = new Map<string, FabricCapabilityBindingView>();\n const temporaryReleases: Array<() => Promise<void>> = [];\n let permanentRelease: (() => Promise<void>) | undefined;\n try {\n for (const [ref, optional] of [...normalized].sort(([left], [right]) =>\n left.localeCompare(right),\n )) {\n try {\n const { binding, provider, actionName, expectedDescriptorHash } = this.#parseRef(ref, context.capabilityView);\n const release = this.#providerBindings.retain([binding.id]);\n temporaryReleases.push(release);\n const descriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(actionName, context)),\n );\n if (!descriptor) throw new FabricResolutionError(`Unknown Fabric action: ${ref}`);\n const action = resolveDescriptor(provider, descriptor);\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) throw new FabricResolutionError(`Committed capability drifted: ${ref}`);\n resolved.set(ref, {\n ref,\n provider: provider.name,\n providerBindingId: binding.id,\n generation: binding.generation,\n descriptorHash: actionDescriptorHash(action),\n });\n } catch (error) {\n if (!(error instanceof FabricResolutionError)) throw error;\n (optional ? optionalMissing : missing).push(ref);\n }\n }\n\n let view: FabricCommittedCapabilityView | undefined;\n if (missing.length === 0) {\n // Resolution awaited provider code: recheck the parent immediately\n // before deriving, even for an empty/optional-only child. Never derive\n // from the public view's presentation fields.\n throwIfAborted(context.signal);\n const values = [...resolved.values()];\n const authority = context.capabilityView\n ? this.#viewAuthority(context.capabilityView).derive(values)\n : CapabilityAuthority.issue(values);\n if (!authority.active) throw new FabricResolutionError(\"Fabric capability view is unissued, released, or revoked\");\n const bindings = Object.fromEntries(authority.bindings().map(value => [value.ref, value]));\n if (retain) permanentRelease = this.#providerBindings.retain(\n values.map((binding) => binding.providerBindingId),\n );\n for (const value of Object.values(bindings)) Object.freeze(value);\n view = Object.freeze({\n id: randomUUID(),\n digest: descriptorHash(values),\n semanticDigest: descriptorHash(\n values.map(({ ref, provider, descriptorHash: hash }) => ({\n ref,\n provider,\n descriptorHash: hash,\n })),\n ),\n bindings: Object.freeze(bindings),\n });\n const controller = new AbortController();\n const parent = context.capabilityView ? this.#requireView(context.capabilityView) : undefined;\n const signal = AbortSignal.any([this.#shutdown.signal, controller.signal, ...(parent ? [parent] : [])]);\n this.#views.set(view, { controller, signal, authority });\n const revoked = () => {\n authority.release();\n const release = permanentRelease;\n permanentRelease = undefined;\n void release?.().catch(() => undefined);\n };\n signal.addEventListener(\"abort\", revoked, { once: true });\n if (signal.aborted) revoked();\n }\n return {\n satisfied: missing.length === 0,\n missing,\n optionalMissing,\n ...(view ? { view } : {}),\n release: async () => {\n const release = permanentRelease;\n permanentRelease = undefined;\n if (view) this.#views.get(view)?.controller.abort(new Error(\"Fabric capability view released\"));\n await release?.();\n },\n };\n } finally {\n await Promise.allSettled(temporaryReleases.map((release) => release()));\n }\n }\n\n async #declaredActionNames(\n provider: FabricProvider,\n context: FabricInvocationContext,\n ): Promise<string[]> {\n try {\n const descriptors = await this.#listProvider(provider, {}, context);\n return descriptors.map((descriptor) => descriptor.name);\n } catch {\n return [];\n }\n }\n\n // Resolve a provider action descriptor, repairing a near-miss action name\n // (mirroring arg-normalization's prepare-stage argument repair) when the\n // caller is not pinned to a committed capability view. Committed views are\n // exact contracts: a pinned miss keeps the plain resolution error.\n async #resolveActionDescriptor(\n provider: FabricProvider,\n actionName: string,\n context: FabricInvocationContext,\n allowRepair: boolean,\n ): Promise<{ action?: ResolvedFabricAction; suggestions: string[]; repairedFrom?: string }> {\n const descriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(actionName, context)),\n );\n // A quarantined ref resolves as unknown: the model-facing catalog never\n // shows it, and a direct call gets the standard not-found message with\n // suggestions, exactly like any retired action.\n if (descriptor && !isActiveQuarantine(provider.name, actionName, descriptor.inputSchema)) {\n return {\n action: resolveDescriptor(provider, descriptor),\n suggestions: [],\n ...(descriptor.name !== actionName ? { repairedFrom: actionName } : {}),\n };\n }\n if (!allowRepair) return { suggestions: [] };\n const declared = (await this.#declaredActionNames(provider, context)).filter(\n (name) => !activeQuarantinedRefNames().has(`${provider.name}.${name}`),\n );\n const catalogName = applyActiveActionName(provider.name, actionName, declared);\n if (catalogName !== actionName) {\n const catalogDescriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(catalogName, context)),\n );\n if (catalogDescriptor) {\n return {\n action: resolveDescriptor(provider, catalogDescriptor),\n suggestions: [],\n repairedFrom: actionName,\n };\n }\n }\n const repair = repairActionName(declared, actionName);\n const compiler = getActiveRepairCompiler();\n if (repair.repaired !== undefined) {\n compiler?.observeUnknownAction(provider.name, actionName, declared, {\n countError: false,\n });\n const repairedDescriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(repair.repaired!, context)),\n );\n if (repairedDescriptor) {\n return {\n action: resolveDescriptor(provider, repairedDescriptor),\n suggestions: [],\n repairedFrom: actionName,\n };\n }\n compiler?.recordInvocationError();\n } else {\n compiler?.observeUnknownAction(provider.name, actionName, declared);\n }\n return {\n suggestions: repair.suggestions.map((name) => `${provider.name}.${name}`),\n };\n }\n\n #parseRef(\n ref: string,\n view?: FabricCommittedCapabilityView,\n ): {\n binding: FabricProviderBinding;\n provider: FabricProvider;\n actionName: string;\n expectedDescriptorHash?: string;\n } {\n if (view) this.#requireView(view);\n const separator = ref.indexOf(\".\");\n if (separator <= 0 || separator === ref.length - 1) {\n throw new Error(`Fabric action references must use provider.action: ${ref}`);\n }\n const providerName = ref.slice(0, separator);\n // The sealed host policy decides from the ref as written, before any\n // provider code (describe, list or prepareArguments) runs for a refused\n // action. Callers decide again on the resolved name with\n // #assertResolvedAllowed, because resolution can repair the name.\n const hostDenial = this.#hostPolicy?.refDenial(providerName, ref.slice(separator + 1));\n if (hostDenial) throw new FabricResolutionError(hostDenial);\n const pinned = view ? this.#viewAuthority(view).resolve(ref) : undefined;\n if (view && !pinned) {\n throw new FabricResolutionError(`Fabric capability is outside the committed view: ${ref}`);\n }\n const binding = pinned\n ? this.#providerBindings.binding(pinned.providerBindingId)\n : this.#providerBindings.current(providerName);\n if (!binding || binding.name !== providerName || (pinned && (pinned.generation !== binding.generation || pinned.provider !== providerName || pinned.ref !== ref))) {\n if (pinned) {\n throw new FabricResolutionError(\n `Fabric capability binding is no longer available: ${ref} (${pinned.providerBindingId})`,\n );\n }\n this.#requireProvider(providerName);\n throw new FabricResolutionError(`Unknown Fabric provider: ${providerName}`);\n }\n return {\n binding,\n provider: binding.provider,\n actionName: ref.slice(separator + 1),\n ...(pinned ? { expectedDescriptorHash: pinned.descriptorHash } : {}),\n };\n }\n\n #requireView(view: FabricCommittedCapabilityView): AbortSignal {\n const owned = this.#views.get(view);\n if (!owned || owned.signal.aborted || !owned.authority.active) throw new FabricResolutionError(\"Fabric capability view is unissued, released, or revoked\");\n return owned.signal;\n }\n\n #viewAuthority(view: FabricCommittedCapabilityView): CapabilityAuthority {\n this.#requireView(view);\n return this.#views.get(view)!.authority;\n }\n\n #scopeContext<T extends FabricInvocationContext>(context: T): T {\n const view = context.capabilityView ? this.#requireView(context.capabilityView) : undefined;\n throwIfAborted(context.signal);\n if (this.#shutdown.signal.aborted) throw new FabricResolutionError(\"Fabric registry is closed\");\n // Host-issued scope (src/scope.ts) replaces any caller value; failed issuance refuses every call.\n const issued = (globalThis as Record<symbol, { scope?: FabricScope; error?: string } | undefined>)[SCOPE_HOLDER];\n if (issued?.error) throw new FabricResolutionError(`Fabric scope issuance failed; provider calls are refused: ${issued.error}`);\n const scoped = { ...context, signal: AbortSignal.any([this.#shutdown.signal, ...(context.signal ? [context.signal] : []), ...(view ? [view] : [])]) };\n if (issued?.scope) scoped.scope = issued.scope;\n else delete scoped.scope;\n return scoped;\n }\n\n #bindingContext<T extends FabricInvocationContext>(binding: FabricProviderBinding, context: T): T {\n return { ...context, signal: AbortSignal.any([this.#providerBindings.signal(binding.id), ...(context.signal ? [context.signal] : [])]) };\n }\n\n async #preparePlanned(binding: FabricProviderBinding, actionName: string, authority: { ref: string; descriptor: string }, mode: ProviderOperation[\"mode\"], args: Record<string, unknown>, context: FabricInvocationContext, replayValue?: unknown, adopt?: ProviderOperation[\"adopt\"]): Promise<(signal?: AbortSignal) => Promise<unknown>> {\n const payload = snapshotArguments(args);\n this.#operations ??= import(\"./provider-operations.js\").then(({ ProviderOperations }) => new ProviderOperations(this.#providerBindings));\n return (await this.#operations).prepare({ binding, action: actionName, ...authority, mode, args: payload, context, replayValue, ...(adopt ? { adopt } : {}),\n observe: async observedContext => {\n const descriptor = await binding.provider.describe(actionName, observedContext);\n if (!descriptor) return { ref: \"\", descriptor: \"\" };\n const action = resolveDescriptor(binding.provider, descriptor);\n return { ref: action.ref, descriptor: actionDescriptorHash(action) };\n },\n });\n }\n\n #runPlanned(binding: FabricProviderBinding, actionName: string, authority: { ref: string; descriptor: string }, mode: ProviderOperation[\"mode\"], args: Record<string, unknown>, context: FabricInvocationContext, replayValue?: unknown, adopt?: ProviderOperation[\"adopt\"]): Promise<unknown> {\n return this.#providerBindings.track(binding.id, async () => {\n const execute = await this.#preparePlanned(binding, actionName, authority, mode, args, context, replayValue, adopt);\n return execute();\n });\n }\n\n #requireProvider(name: string): FabricProvider {\n const provider = this.#providerBindings.current(name)?.provider;\n if (provider) return provider;\n const unavailableReason = this.#unavailable.get(name) ?? this.#unavailableResolver?.(name);\n if (unavailableReason) {\n throw new FabricResolutionError(\n `Fabric provider \"${name}\" is unavailable: ${unavailableReason}`,\n );\n }\n const registered = this.#providerBindings.providers()\n .map((provider) => provider.name)\n .sort((left, right) => left.localeCompare(right));\n throw new FabricResolutionError(\n `Unknown Fabric provider: ${name}` +\n (registered.length > 0 ? ` (registered providers: ${registered.join(\", \")})` : \"\"),\n );\n }\n}\n", "// Generated by scripts/verified-kernels.ts from proofs/resources.ts with gdp-wired@0.30.1. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $m(v, what) { if (!(v instanceof Map)) throw new RangeError(what + ' must be a Map of naturals'); for (const [key, x] of v) { $n(key, 'a key of ' + what); $n(x, 'a cell of ' + what); } return v; }\nfunction $keys(maps, names) { const keys = new Set(); let past = 0; for (const c of Object.values(maps)) for (const key of c.keys()) past = Math.max(past, key + 1); for (const n of names) for (const key of maps[n].keys()) keys.add(key); return [...keys, past]; }\nfunction $breaks(maps, reads, cmps) { const p = new Set([0]); for (const [n, d, minus] of reads) { for (const s of maps[n].keys()) { if (minus) p.add(s + d); else if (s >= d) p.add(s - d); } if (minus) p.add(d); } for (const [v, d, minus] of cmps) { if (minus) { p.add(v + d); p.add(d); } else if (v >= d) p.add(v - d); } const keys = new Set(); for (const q of p) for (let i = -1; i <= 2; i++) if (q + i >= 0) keys.add(q + i); const sorted = [...keys].sort((a, b) => a - b); sorted.push(sorted[sorted.length - 1] + 1); return sorted; }\nfunction $every(keys, f) { const past = keys[keys.length - 1], d = f(past), cells = new Map(); for (let i = 0; i < keys.length - 1; i++) { const v = f(keys[i]); if (v !== d) cells.set(keys[i], v); } return {cells, d}; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\nfunction $join(ks, x, y, f) { const by = new Map(); for (const k1 of ks) { const v = y(k1), l = by.get(v); if (l) l.push(k1); else by.set(v, [k1]); } return ks.every(k => { const l = by.get(x(k)); return l === undefined || l.every(k1 => f(k, k1)); }); }\nfunction $spread(keys, n) { const out = new Set(); for (const k of keys) for (let i = 0; i < n; i++) out.add(k + i); return [...out].sort((a, b) => a - b); }\n\nexport const resourceScope = /* @__PURE__ */ (() => {\n// Generated from the machine resource scope. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"exact\": 0}, maps: {\"Names\": new Map()}};\n}\nfunction step(params, state, input) {\n const env = {\"op\": $n(input[\"op\"], \"input op\"), \"first\": $n(input[\"first\"], \"input first\")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, \"Given\": $m(input[\"Given\"], \"input Given\"), \"Len\": $m(input[\"Len\"], \"input Len\")};\n const flag0 = $keys(maps, [\"Given\"]).every(k => ((maps[\"Given\"].get(k) ?? 0) <= 1));\n const flag1 = $breaks(maps, [[\"Given\", 0, false]], [[0, 0, false], [1, 0, false]]).every(k => ((!(1 <= (maps[\"Given\"].get(k) ?? 0))) || ((!(k === 0)) && (!(k === 1)))));\n const flag2 = $breaks(maps, [[\"Given\", 0, false], [\"Names\", 0, false], [\"Names\", 0, false], [\"Given\", 0, false], [\"Given\", 0, false], [\"Len\", 0, false]], [[0, 0, false], [1, 0, false], [66, 0, false]]).every(k => ((((!(1 <= (maps[\"Given\"].get(k) ?? 0))) || (1 <= (maps[\"Names\"].get(k) ?? dft[\"Names\"] ?? 0))) && ((!(1 <= (maps[\"Names\"].get(k) ?? dft[\"Names\"] ?? 0))) || (1 <= (maps[\"Given\"].get(k) ?? 0)))) && ((!(1 <= (maps[\"Given\"].get(k) ?? 0))) || ((!(k === 0)) && (!(k === 1)) && (k < 66) && ((maps[\"Len\"].get(k) ?? 0) <= 256)))));\n const flag3 = $keys(maps, [\"Given\",\"Names\"]).every(k => ((maps[\"Given\"].get(k) ?? 0) === (maps[\"Names\"].get(k) ?? dft[\"Names\"] ?? 0)));\n const flag4 = $keys(maps, [\"Given\",\"Len\"]).every(k => ((!(1 <= (maps[\"Given\"].get(k) ?? 0))) || ((maps[\"Len\"].get(k) ?? 0) <= 256)));\n const flag5 = ((1 <= (maps[\"Given\"].get(env[\"first\"]) ?? 0)) && (((env[\"op\"] === 0) && flag1) || ((env[\"op\"] === 1) && ((s[\"exact\"] === 1) && flag2))));\n if (!((env[\"op\"] < 2) && flag0)) throw new RangeError(\"resource scope: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"exact\": (flag5 ? 1 : 0)};\n const write0 = $every($keys(maps, [\"Given\"]), k => (flag5 ? (maps[\"Given\"].get(k) ?? 0) : 0));\n state.maps[\"Names\"] = write0.cells; dft[\"Names\"] = write0.d;\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const resourceConflict = /* @__PURE__ */ (() => {\n// Generated from the machine resource conflict. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"leftEffect\": $n(input[\"leftEffect\"], \"input leftEffect\"), \"rightEffect\": $n(input[\"rightEffect\"], \"input rightEffect\"), \"leftExact\": $n(input[\"leftExact\"], \"input leftExact\"), \"rightExact\": $n(input[\"rightExact\"], \"input rightExact\"), \"leftOrdered\": $n(input[\"leftOrdered\"], \"input leftOrdered\"), \"rightOrdered\": $n(input[\"rightOrdered\"], \"input rightOrdered\"), \"witness\": $n(input[\"witness\"], \"input witness\")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, \"Left\": $m(input[\"Left\"], \"input Left\"), \"Right\": $m(input[\"Right\"], \"input Right\")};\n const flag0 = $keys(maps, [\"Left\",\"Right\"]).every(k => (((maps[\"Left\"].get(k) ?? 0) <= 1) && ((maps[\"Right\"].get(k) ?? 0) <= 1)));\n const flag1 = $keys(maps, [\"Left\",\"Right\"]).every(k => ($x((maps[\"Left\"].get(k) ?? 0) + (maps[\"Right\"].get(k) ?? 0)) <= 1));\n const flag2 = (!flag1);\n const flag3 = $keys(maps, [\"Left\",\"Right\"]).every(k => ((!(1 <= (maps[\"Left\"].get(k) ?? 0))) || (!(1 <= (maps[\"Right\"].get(k) ?? 0)))));\n if (!((env[\"leftEffect\"] <= 1) && (env[\"rightEffect\"] <= 1) && (env[\"leftExact\"] <= 1) && (env[\"rightExact\"] <= 1) && (env[\"leftOrdered\"] <= 1) && (env[\"rightOrdered\"] <= 1) && flag0)) throw new RangeError(\"resource conflict: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"conflict\": (((env[\"leftEffect\"] === 1) && (env[\"rightEffect\"] === 1) && ((env[\"leftOrdered\"] === 1) || (env[\"rightOrdered\"] === 1)) && ((!((env[\"leftExact\"] === 1) && (env[\"rightExact\"] === 1))) || flag2)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const resourceGroups = /* @__PURE__ */ (() => {\n// Generated from the machine resource groups. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"L_len\": $n(input[\"L_len\"], \"input L_len\"), \"R_len\": $n(input[\"R_len\"], \"input R_len\"), \"LN_len\": $n(input[\"LN_len\"], \"input LN_len\"), \"RN_len\": $n(input[\"RN_len\"], \"input RN_len\")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, \"L.effect\": $m(input[\"L.effect\"], \"input L.effect\"), \"L.ordered\": $m(input[\"L.ordered\"], \"input L.ordered\"), \"L.exact\": $m(input[\"L.exact\"], \"input L.exact\"), \"R.effect\": $m(input[\"R.effect\"], \"input R.effect\"), \"R.ordered\": $m(input[\"R.ordered\"], \"input R.ordered\"), \"R.exact\": $m(input[\"R.exact\"], \"input R.exact\"), \"LN.item\": $m(input[\"LN.item\"], \"input LN.item\"), \"LN.name\": $m(input[\"LN.name\"], \"input LN.name\"), \"RN.item\": $m(input[\"RN.item\"], \"input RN.item\"), \"RN.name\": $m(input[\"RN.name\"], \"input RN.name\")};\n const flag0 = $breaks(maps, [[\"LN.item\", 0, false]], [[env[\"LN_len\"], 0, false]]).every(k => ((!(k < env[\"LN_len\"])) || ((maps[\"LN.item\"].get(k) ?? 0) < env[\"L_len\"])));\n const flag1 = $breaks(maps, [[\"RN.item\", 0, false]], [[env[\"RN_len\"], 0, false]]).every(k => ((!(k < env[\"RN_len\"])) || ((maps[\"RN.item\"].get(k) ?? 0) < env[\"R_len\"])));\n const flag2 = (flag0 && flag1);\n const flag3 = (ks => ks.every(k => ks.every(k1 => ((!((k < env[\"L_len\"]) && (k1 < env[\"R_len\"]) && (0 <= 0))) || (!((((maps[\"L.effect\"].get(k) ?? 0) === 1) && ((maps[\"R.effect\"].get(k1) ?? 0) === 1) && (((maps[\"L.ordered\"].get(k) ?? 0) === 1) || ((maps[\"R.ordered\"].get(k1) ?? 0) === 1))) && (!(((maps[\"L.exact\"].get(k) ?? 0) === 1) && ((maps[\"R.exact\"].get(k1) ?? 0) === 1)))))))))($spread($breaks(maps, [[\"L.effect\", 0, false], [\"L.ordered\", 0, false], [\"L.exact\", 0, false], [\"R.effect\", 0, false], [\"R.ordered\", 0, false], [\"R.exact\", 0, false]], [[env[\"L_len\"], 0, false], [env[\"R_len\"], 0, false]]), 2));\n const flag4 = $join($spread($breaks(maps, [[\"LN.name\", 0, false], [\"LN.item\", 0, false], [\"LN.item\", 0, false], [\"RN.name\", 0, false], [\"RN.item\", 0, false], [\"RN.item\", 0, false]], [[env[\"LN_len\"], 0, false], [env[\"RN_len\"], 0, false]]), 2), k => (maps[\"LN.name\"].get(k) ?? 0), k1 => (maps[\"RN.name\"].get(k1) ?? 0), (k, k1) => ((!((k < env[\"LN_len\"]) && (k1 < env[\"RN_len\"]) && ((maps[\"LN.name\"].get(k) ?? 0) === (maps[\"RN.name\"].get(k1) ?? 0)) && (0 <= 0))) || (!(((maps[\"L.effect\"].get((maps[\"LN.item\"].get(k) ?? 0)) ?? 0) === 1) && ((maps[\"R.effect\"].get((maps[\"RN.item\"].get(k1) ?? 0)) ?? 0) === 1) && (((maps[\"L.ordered\"].get((maps[\"LN.item\"].get(k) ?? 0)) ?? 0) === 1) || ((maps[\"R.ordered\"].get((maps[\"RN.item\"].get(k1) ?? 0)) ?? 0) === 1))))));\n const flag5 = $breaks(maps, [[\"L.effect\", 0, false], [\"L.ordered\", 0, false], [\"L.exact\", 0, false]], [[env[\"L_len\"], 0, false]]).every(k => ((!(k < env[\"L_len\"])) || (((maps[\"L.effect\"].get(k) ?? 0) <= 1) && ((maps[\"L.ordered\"].get(k) ?? 0) <= 1) && ((maps[\"L.exact\"].get(k) ?? 0) <= 1))));\n const flag6 = $breaks(maps, [[\"R.effect\", 0, false], [\"R.ordered\", 0, false], [\"R.exact\", 0, false]], [[env[\"R_len\"], 0, false]]).every(k => ((!(k < env[\"R_len\"])) || (((maps[\"R.effect\"].get(k) ?? 0) <= 1) && ((maps[\"R.ordered\"].get(k) ?? 0) <= 1) && ((maps[\"R.exact\"].get(k) ?? 0) <= 1))));\n if (!(flag5 && flag6 && flag2)) throw new RangeError(\"resource groups: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"conflict\": ((flag3 && flag4) ? 0 : 1)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { bit, idSet, members } from \"./machine.js\";\nimport { resourceScope, resourceConflict, resourceGroups as groupsMachine } from \"./generated/resources.js\";\n\n/** A resource scope as the host sees it: exact names, or unknown (\"*\"). */\nexport interface ResourceScope { readonly exact: boolean; readonly names: readonly string[] }\nexport interface ResourceEffect { readonly effect: boolean; readonly ordered: boolean; readonly scope: ResourceScope }\n\nconst EMPTY = 0, WILDCARD = 1, FIRST = 2;\nconst UNKNOWN: ResourceScope = Object.freeze({ exact: false, names: Object.freeze([]) as readonly string[] });\n\n/** Trusted codec: one injective table per decision. The empty name (and any\n * non-string resource) is 0, the wildcard is 1, and every other string,\n * NULs and lone surrogates included, gets its own id from 2. Never truncate,\n * hash or normalize Unicode here. */\nclass ResourceNames {\n readonly #ids = new Map<string, number>();\n readonly #names: string[] = [];\n id(value: unknown): number {\n if (typeof value !== \"string\" || value === \"\") return EMPTY;\n if (value === \"*\") return WILDCARD;\n let id = this.#ids.get(value);\n if (id === undefined) {\n id = FIRST + this.#names.length;\n this.#ids.set(value, id);\n this.#names.push(value);\n }\n return id;\n }\n name(id: number): string {\n const name = this.#names[id - FIRST];\n if (name === undefined) throw new Error(`Invalid verified resource id ${id}`);\n return name;\n }\n /** Each id's complete UTF-16 length, for the kernel's 256-unit bound. */\n lengths(ids: Iterable<number>): Map<number, number> {\n const cells = new Map<number, number>();\n for (const id of ids) if (id >= FIRST) cells.set(id, this.name(id).length);\n return cells;\n }\n}\n\nconst SOURCE = 0, NORMALIZE = 1;\nconst step = (names: ResourceNames, state: ReturnType<typeof resourceScope.init>, op: number, values: readonly unknown[]) => {\n const ids = values.map((value) => names.id(value));\n return resourceScope.step({}, state, { op, first: ids[0] ?? EMPTY, Given: idSet(ids), Len: names.lengths(ids) });\n};\n\nconst decode = (names: ResourceNames, state: ReturnType<typeof resourceScope.init>, order: readonly unknown[]): ResourceScope => {\n if (state.scalars.exact !== 1) return UNKNOWN;\n // Present the kernel's set in declaration order; membership is the kernel's.\n const held = new Set(members(state, \"Names\"));\n const listed = [...new Set(order.map((value) => names.id(value)))].filter((id) => held.delete(id));\n if (held.size > 0) throw new Error(\"Verified resource scope names an undeclared resource\");\n return { exact: true, names: listed.map((id) => names.name(id)) };\n};\n\n/** Interpret a complete declaration: exact when nonempty with no empty or wildcard identity. */\nexport const resourceSource = (values: readonly unknown[] | undefined): ResourceScope => {\n const declared: unknown[] = Array.isArray(values) ? Array.from(values) : [];\n const names = new ResourceNames();\n return decode(names, step(names, resourceScope.init({}), SOURCE, declared), declared);\n};\n\nexport const decodeResourceScope = (scope: ResourceScope): string[] => (scope.exact ? [...scope.names] : [\"*\"]);\n\n/** Check an untrusted proposal against the complete declaration: exact only when\n * the proposal names the same set, at most 64 valid names of at most 256 units. */\nexport const resourceNormalize = (values: readonly unknown[] | undefined, proposal: readonly unknown[]): ResourceScope => {\n const declared: unknown[] = Array.isArray(values) ? Array.from(values) : [];\n const candidate = Array.from(proposal);\n const names = new ResourceNames();\n // Intern the proposal first: its names take the ids the 64-name window covers.\n for (const value of candidate) names.id(value);\n const source = step(names, resourceScope.init({}), SOURCE, declared);\n return decode(names, step(names, source, NORMALIZE, candidate), candidate);\n};\n\nexport const boundedEffectResources = (resources: readonly string[] | undefined): string[] => {\n // Capture the entire declaration before running the untrusted proposer.\n const declared: unknown[] = Array.isArray(resources) ? Array.from(resources) : [];\n const proposal = new Set<unknown>();\n for (const resource of declared) {\n proposal.add(resource);\n if (proposal.size > 64) break;\n }\n return decodeResourceScope(resourceNormalize(declared, [...proposal]));\n};\n\nexport const encodeResourceEffects = (\n effects: readonly { kind: string; ordering: string; resources: readonly string[] }[],\n): ResourceEffect[] => effects.map((effect) => effect.kind === \"none\"\n ? { effect: false, ordered: false, scope: UNKNOWN }\n : { effect: true, ordered: effect.ordering !== \"commutative\", scope: resourceSource(effect.resources) });\n\nconst conflicts = (names: ResourceNames, left: ResourceEffect, right: ResourceEffect): boolean => {\n const state = resourceConflict.step({}, resourceConflict.init({}), {\n leftEffect: bit(left.effect), rightEffect: bit(right.effect),\n leftExact: bit(left.scope.exact), rightExact: bit(right.scope.exact),\n leftOrdered: bit(left.ordered), rightOrdered: bit(right.ordered), witness: EMPTY,\n Left: idSet(left.scope.names.map((name) => names.id(name))),\n Right: idSet(right.scope.names.map((name) => names.id(name))),\n });\n return state.scalars.conflict === 1;\n};\n\n/** Effect flags as list cells: one 0/1 map per field, keyed by position. */\nconst effectCells = (side: readonly ResourceEffect[]) => ({\n effect: new Map(side.map((e, i) => [i, bit(e.effect)])),\n ordered: new Map(side.map((e, i) => [i, bit(e.ordered)])),\n exact: new Map(side.map((e, i) => [i, bit(e.scope.exact)])),\n});\n\n/** Each exact scope's names as rows (item, name), where `item` is the effect's\n * position. Rows name an effect of their own side by construction. */\nconst rowCells = (names: ResourceNames, side: readonly ResourceEffect[]) => {\n const rows = side.flatMap((e, item) => (e.scope.exact ? e.scope.names : []).map((name) => [item, names.id(name)] as const));\n return { len: rows.length, item: new Map(rows.map(([item], p) => [p, item])), name: new Map(rows.map(([, name], p) => [p, name])) };\n};\n\n/** Whether any effect on the left conflicts with any effect on the right,\n * decided over every pair by the compiled groups kernel. Both sides' names\n * come from one table, so a name shared across them shares its id. */\nexport const resourceGroups = (left: readonly ResourceEffect[], right: readonly ResourceEffect[]): boolean => {\n const names = new ResourceNames();\n const L = effectCells(left), R = effectCells(right), LN = rowCells(names, left), RN = rowCells(names, right);\n const state = groupsMachine.step({}, groupsMachine.init({}), {\n L_len: left.length, R_len: right.length, LN_len: LN.len, RN_len: RN.len,\n \"L.effect\": L.effect, \"L.ordered\": L.ordered, \"L.exact\": L.exact,\n \"R.effect\": R.effect, \"R.ordered\": R.ordered, \"R.exact\": R.exact,\n \"LN.item\": LN.item, \"LN.name\": LN.name, \"RN.item\": RN.item, \"RN.name\": RN.name,\n });\n return state.scalars.conflict === 1;\n};\n\nexport const resourceConflictOf = (left: ResourceScope, right: ResourceScope, leftOrdered: boolean, rightOrdered: boolean): boolean =>\n conflicts(new ResourceNames(), { effect: true, ordered: leftOrdered, scope: left }, { effect: true, ordered: rightOrdered, scope: right });\n", "import { unknownConflict, knownConflict } from \"../verified/policy.js\";\nimport { boundedEffectResources, encodeResourceEffects, resourceGroups } from \"../verified/resources.js\";\nimport type { ResolvedFabricAction } from \"../core/action-registry.js\";\nimport type {\n FabricComponentEffectConflict,\n FabricComponentEffectInfo,\n FabricComponentEffectOptions,\n FabricComponentEffectRegistration,\n} from \"./types.js\";\n\nexport class FabricComponentIndependenceError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"FabricComponentIndependenceError\";\n }\n}\n\nconst normalizeResources = boundedEffectResources;\n\nexport const trackedRegistration = (\n registration: FabricComponentEffectRegistration | undefined,\n fallbackLabel: string,\n): FabricComponentEffectOptions => {\n if (typeof registration === \"string\") return { label: registration };\n return { label: fallbackLabel, ...registration };\n};\n\nexport const registrationEffect = (\n registration: FabricComponentEffectOptions,\n): FabricComponentEffectInfo => ({\n label: registration.label?.trim().slice(0, 256) || \"anonymous\",\n kind: registration.kind ?? \"transactional\",\n resources: normalizeResources(registration.resources),\n ordering: registration.ordering ?? \"unknown\",\n});\n\nexport const actionEffect = (\n action: ResolvedFabricAction,\n): FabricComponentEffectInfo | undefined => {\n if (!action.effect || action.effect.kind === \"none\") return undefined;\n return {\n label: action.ref,\n kind: action.effect.kind,\n resources: normalizeResources(action.effect.resources),\n ordering: action.effect.ordering ?? \"unknown\",\n };\n};\n\ninterface FabricComponentEffectSummary {\n declarations: ReturnType<typeof encodeResourceEffects>;\n hasEffects: boolean;\n hasNoncommutative: boolean;\n hasUnknown: boolean;\n hasUnknownNoncommutative: boolean;\n resourceNoncommutative: Map<string, boolean>;\n}\n\ntype FabricComponentConflictBasis = Omit<FabricComponentEffectConflict, \"withComponent\">;\n\nexport const summarizeEffects = (\n effects: readonly FabricComponentEffectInfo[],\n): FabricComponentEffectSummary => {\n const resourceNoncommutative = new Map<string, boolean>();\n let hasNoncommutative = false;\n let hasUnknown = false;\n let hasUnknownNoncommutative = false;\n let effectful = 0;\n for (const effect of effects) {\n if (effect.kind === \"none\") continue;\n effectful++;\n const noncommutative = effect.ordering !== \"commutative\";\n hasNoncommutative ||= noncommutative;\n for (const resource of effect.resources) {\n if (resource === \"*\") {\n hasUnknown = true;\n hasUnknownNoncommutative ||= noncommutative;\n } else {\n resourceNoncommutative.set(\n resource,\n (resourceNoncommutative.get(resource) ?? false) || noncommutative,\n );\n }\n }\n }\n return {\n declarations: encodeResourceEffects(effects),\n hasEffects: effectful > 0,\n hasNoncommutative,\n hasUnknown,\n hasUnknownNoncommutative,\n resourceNoncommutative,\n };\n};\n\nexport const effectConflictsBetween = (\n left: FabricComponentEffectSummary,\n right: FabricComponentEffectSummary,\n): FabricComponentConflictBasis[] => {\n // Only the compiled full-declaration decision can grant independence.\n // The summaries below explain a conflict; they cannot erase one.\n if (!resourceGroups(left.declarations, right.declarations)) return [];\n const conflicts: FabricComponentConflictBasis[] = [];\n if (\n unknownConflict(\n left.hasUnknown, left.hasUnknownNoncommutative, left.hasNoncommutative,\n right.hasUnknown, right.hasUnknownNoncommutative, right.hasNoncommutative,\n )\n ) {\n conflicts.push({ resources: [\"*\"], reason: \"unknown_resource\" });\n }\n const overlap = [...left.resourceNoncommutative.keys()]\n .filter((resource) =>\n knownConflict(\n right.resourceNoncommutative.has(resource),\n left.resourceNoncommutative.get(resource) ?? false,\n right.resourceNoncommutative.get(resource) ?? false,\n ),\n )\n .sort();\n if (overlap.length > 0) {\n conflicts.push({ resources: overlap, reason: \"shared_resource\" });\n }\n return conflicts.length > 0 ? conflicts : [{ resources: [\"*\"], reason: \"unknown_resource\" }];\n};\n\nexport const compareEffectInfo = (\n left: FabricComponentEffectInfo,\n right: FabricComponentEffectInfo,\n): number =>\n left.label.localeCompare(right.label) ||\n left.kind.localeCompare(right.kind) ||\n left.ordering.localeCompare(right.ordering) ||\n left.resources.join(\"\\0\").localeCompare(right.resources.join(\"\\0\"));\n\n", "// Action-name repair for Fabric registry resolution, mirroring the\n// argument-shape repair architecture in src/providers/arg-normalization.ts:\n//\n// 1. The registry resolve stage canonicalizes near-miss action spellings\n// (memory.search \u2192 memory.recall) before the provider descriptor is\n// demanded. The repair surface is mostly derived from the provider's\n// declared action names rather than maintained by hand. Exact casing and\n// separator forms and unique authored synonyms authorize repair; plural,\n// prefix, token-alignment, and edit-distance matches only suggest names.\n// 2. The resolution failure tier owns the didactic failure: ambiguous or\n// unmatched names fail with the closest declared candidates named, and\n// the original \"Unknown Fabric action\" prefix is preserved.\n//\n// As with KEY_SYNONYM_CLASSES in arg-normalization, only genuinely semantic\n// verb synonyms need explicit vocabulary, and a spilled name repairs only\n// when exactly one declared member fits: ambiguity (or absence) leaves the\n// name untouched so the failure tier can enumerate the honest choices.\n\ninterface ActionNameRepair {\n /** Canonical declared action name when exactly one candidate fits. */\n repaired?: string;\n /** Ranked declared candidates for the didactic failure message. */\n suggestions: string[];\n}\n\n// Verb/concept classes shared across the stable providers. Each class mixes\n// plausible spilled verbs with the canonical names providers actually\n// declare, so e.g. \"search\" repairs to memory.recall (sole recall-class\n// member declared by memory) while \"fetch\" on mesh stays ambiguous between\n// mesh.get and mesh.read. A class only fires when exactly one member is\n// declared by the target provider's catalog.\nconst ACTION_SYNONYM_CLASSES: ReadonlyArray<ReadonlyArray<string>> = [\n // memory.recall and its spilled search verbs.\n [\"recall\", \"search\", \"find\", \"query\", \"lookup\", \"grep\", \"scan\", \"locate\"],\n // memory.expand / read-one-entry verbs.\n [\"expand\", \"get\", \"read\", \"fetch\", \"load\", \"view\", \"show\"],\n // memory.sessions and list-style catalog reads.\n [\"sessions\", \"list\", \"ls\", \"enumerate\", \"index\"],\n // state.transition / mesh.put write verbs.\n [\"transition\", \"write\", \"put\", \"set\", \"save\", \"update\", \"store\", \"upsert\", \"append\", \"post\"],\n // agents.create family.\n [\"create\", \"spawn\", \"new\", \"add\", \"make\", \"register\"],\n // mesh.publish family (\"post\" deliberately also sits in the write class,\n // so mesh.post stays ambiguous between publish and put).\n [\"publish\", \"send\", \"emit\", \"notify\"],\n // teardown verbs.\n [\"delete\", \"remove\", \"rm\", \"destroy\", \"drop\", \"clear\"],\n // components.reload family.\n [\"reload\", \"restart\", \"refresh\", \"rebuild\", \"reboot\"],\n // status/introspection reads (\"get\" is deliberately shared with the\n // expand class: memory.get expands an entry, components.get is status).\n [\"status\", \"info\", \"inspect\", \"health\", \"describe\", \"get\"],\n // execution verbs.\n [\"run\", \"execute\", \"exec\", \"invoke\", \"call\", \"start\", \"go\"],\n // cancellation verbs.\n [\"cancel\", \"abort\", \"stop\", \"kill\", \"terminate\"],\n // verification verbs.\n [\"verify\", \"check\", \"validate\", \"assert\", \"confirm\", \"certify\"],\n // timeline reads.\n [\"history\", \"log\", \"journal\", \"events\", \"timeline\", \"transitions\"],\n // subscription verbs.\n [\"subscribe\", \"watch\", \"listen\", \"observe\", \"follow\"],\n // compact.request family.\n [\"request\", \"begin\", \"initiate\", \"trigger\", \"schedule\"],\n // schema.commit family.\n [\"commit\", \"apply\", \"finalize\"],\n // agents messaging pair (both declare, so spilled verbs here stay\n // ambiguous and the failure tier enumerates ask vs tell).\n [\"ask\", \"tell\", \"say\", \"chat\"],\n];\n\n// Casing/spacing/underscore/dollar-insensitive action form, mirroring\n// normalizeForm in arg-normalization: \"$servers\" and \"servers\" share a form.\nconst normalizeActionForm = (name: string): string =>\n name.toLowerCase().replace(/[^a-z0-9]/g, \"\");\n\nconst ACTION_CLASS_FORMS = ACTION_SYNONYM_CLASSES.map((cls) =>\n new Set(cls.map(normalizeActionForm)),\n);\n\nconst camelTokens = (name: string): string[] =>\n name\n .replace(/([a-z0-9])([A-Z])/g, \"$1 $2\")\n .replace(/([A-Z]+)([A-Z][a-z])/g, \"$1 $2\")\n .toLowerCase()\n .split(/[^a-z0-9]+/)\n .filter((token) => token.length > 0);\n\n// Singular/plural near-misses collapse to one form, mirroring the derived\n// plural handling of declared schema keys in arg-normalization.\nconst singularActionForm = (form: string): string =>\n form.length > 3 && form.endsWith(\"s\") ? form.slice(0, -1) : form;\n\nconst levenshtein = (left: string, right: string): number => {\n if (left === right) return 0;\n if (left.length === 0) return right.length;\n if (right.length === 0) return left.length;\n let previous = new Array<number>(right.length + 1);\n let current = new Array<number>(right.length + 1);\n for (let j = 0; j <= right.length; j++) previous[j] = j;\n for (let i = 1; i <= left.length; i++) {\n current[0] = i;\n for (let j = 1; j <= right.length; j++) {\n current[j] = Math.min(\n previous[j]! + 1,\n current[j - 1]! + 1,\n previous[j - 1]! + (left[i - 1] === right[j - 1] ? 0 : 1),\n );\n }\n const swap = previous;\n previous = current;\n current = swap;\n }\n return previous[right.length]!;\n};\n\n// Edit-distance budget scales with the spilled length; short names keep a\n// tight budget so \"get\" never quietly becomes \"set\".\nconst editThreshold = (form: string): number =>\n form.length <= 4 ? 1 : Math.max(2, Math.floor(form.length / 4));\n\nconst tokenAligned = (spilled: string[], declared: string[]): boolean => {\n if (spilled.length === 0 || spilled.length !== declared.length) return false;\n return spilled.every((token, index) => {\n const other = declared[index]!;\n if (token === other) return true;\n return token.length >= 3 && other.length >= 3 &&\n (token.startsWith(other) || other.startsWith(token));\n });\n};\n\nconst sortNames = (names: readonly string[]): string[] =>\n [...new Set(names)].sort((left, right) => left.localeCompare(right));\n\ninterface CatalogForm {\n name: string;\n form: string;\n singular: string;\n tokens: string[];\n}\n\n// Catalog identity is weakly held; validate its contents so mutable provider\n// registrations cannot retain stale names, ambiguity, or authorization targets.\ninterface CatalogSnapshot {\n forms: CatalogForm[];\n repairs: Map<string, ActionNameRepair>;\n}\n\nconst catalogCache = new WeakMap<readonly string[], CatalogSnapshot>();\nconst catalogSnapshot = (declared: readonly string[]): CatalogSnapshot => {\n const cached = catalogCache.get(declared);\n if (cached?.forms.length === declared.length && cached.forms.every((entry, index) => entry.name === declared[index])) {\n return cached;\n }\n const forms = declared.map((name) => {\n const form = normalizeActionForm(name);\n return { name, form, singular: singularActionForm(form), tokens: camelTokens(name) };\n });\n const snapshot = { forms, repairs: new Map<string, ActionNameRepair>() };\n catalogCache.set(declared, snapshot);\n return snapshot;\n};\n\n/**\n * Repair a spilled action name against the provider's declared names.\n * Returns the canonical name when exactly one declared candidate fits, or\n * ranked suggestions for the didactic failure message.\n */\nconst computeActionRepair = (\n catalog: readonly CatalogForm[],\n actionName: string,\n): ActionNameRepair => {\n const spilledForm = normalizeActionForm(actionName);\n if (spilledForm.length === 0) return { suggestions: [] };\n if (catalog.some((entry) => entry.name === actionName)) return { suggestions: [] };\n const forms = [...new Map(catalog.map((entry) => [entry.name, entry])).values()];\n\n // Exact case/separator forms prove identity before semantic aliases.\n const exact = forms.filter((entry) => entry.form === spilledForm).map((entry) => entry.name);\n if (exact.length === 1) return { repaired: exact[0]!, suggestions: exact };\n if (exact.length > 1) return { suggestions: sortNames(exact) };\n if (forms.length === 0) return { suggestions: [] };\n\n // Tier 1 \u2014 semantic verb classes: the spilled verb belongs to a shared\n // synonym class; repair only when exactly one class member is declared.\n const classCandidates = sortNames(ACTION_CLASS_FORMS\n .filter((classForms) => classForms.has(spilledForm))\n .flatMap((classForms) =>\n forms.filter((entry) => classForms.has(entry.form)).map((entry) => entry.name)\n ));\n if (classCandidates.length === 1) {\n return { repaired: classCandidates[0]!, suggestions: [classCandidates[0]!] };\n }\n if (classCandidates.length > 1) {\n return { suggestions: sortNames(classCandidates) };\n }\n\n // Similarity is only didactic evidence, even with a unique candidate.\n // Singular/plural, token alignment, and prefixes never authorize repair.\n const spilledTokens = camelTokens(actionName);\n const spilledSingular = singularActionForm(spilledForm);\n const derived: string[] = [];\n for (const entry of forms) {\n if (\n entry.form === spilledForm ||\n entry.singular === spilledSingular ||\n (spilledTokens.length > 0 && tokenAligned(spilledTokens, entry.tokens)) ||\n (spilledForm.length >= 4 && entry.form.startsWith(spilledForm))\n ) {\n derived.push(entry.name);\n }\n }\n if (derived.length > 0) return { suggestions: sortNames(derived) };\n\n // Bounded edit distance ranks suggestions, never semantic proof.\n const distances = forms.map((entry) => ({\n name: entry.name,\n distance: levenshtein(spilledForm, entry.form),\n }));\n const min = Math.min(...distances.map((entry) => entry.distance));\n const threshold = editThreshold(spilledForm);\n if (min <= threshold) {\n const nearest = sortNames(\n distances.filter((entry) => entry.distance === min).map((entry) => entry.name),\n );\n return { suggestions: nearest };\n }\n\n // Failure tier \u2014 rank a few close names so the error teaches the catalog.\n const suggestions = distances\n .filter((entry) => entry.distance <= Math.max(3, Math.floor(spilledForm.length / 2)))\n .sort((left, right) =>\n left.distance - right.distance || left.name.localeCompare(right.name)\n )\n .slice(0, 3)\n .map((entry) => entry.name);\n return { suggestions: sortNames(suggestions) };\n};\n\n// Bound memoized near-misses per live catalogue. Every call revalidates the\n// names above, so replacement/removal invalidates repairs as well as forms.\nexport const repairActionName = (declared: readonly string[], actionName: string): ActionNameRepair => {\n const catalog = catalogSnapshot(declared);\n let result = catalog.repairs.get(actionName);\n if (!result) {\n result = computeActionRepair(catalog.forms, actionName);\n if (actionName.length <= 512) {\n if (catalog.repairs.size >= 128) catalog.repairs.delete(catalog.repairs.keys().next().value!);\n catalog.repairs.set(actionName, result);\n }\n }\n // Callers own suggestions; never expose mutable cached values.\n return { ...result, suggestions: [...result.suggestions] };\n};\n\n/**\n * The didactic unknown-action failure message. The original\n * \"Unknown Fabric action: <ref>\" prefix is preserved verbatim; declared\n * candidates are appended only when repair found close misses.\n */\nexport const formatUnknownActionMessage = (\n ref: string,\n suggestions: readonly string[],\n): string =>\n suggestions.length > 0\n ? `Unknown Fabric action: ${ref} (did you mean: ${suggestions.slice(0, 3).join(\", \")}?)`\n : `Unknown Fabric action: ${ref}`;\n", "import { randomUUID } from \"node:crypto\";\nimport { settleWithin } from \"../async-settlement.js\";\nimport { VERIFIED_NAT_MAX } from \"../verified/nat.js\";\nimport { consume } from \"../verified/policy.js\";\nimport { bindingStep, type BindingLife, type BindingEvent, type BindingOutcome } from \"../verified/lifecycle.js\";\nimport type { FabricComponentProviderLease } from \"../components/types.js\";\nimport type { FabricProvider } from \"../protocol.js\";\n\ntype FabricProviderBindingState = \"staged\" | \"active\" | \"retiring\" | \"closed\";\n\nexport interface FabricProviderBinding {\n id: string;\n name: string;\n generation: number;\n provider: FabricProvider;\n state: FabricProviderBindingState;\n ownerRetained: boolean;\n allowReplace: boolean;\n retainers: number;\n inFlight: number;\n closeTask?: Promise<void>;\n closeError?: string;\n unsubscribeCatalog?: () => void;\n}\n\nexport type FabricProviderBindingEvent =\n | { type: \"staged\" | \"activated\" | \"retiring\" | \"closed\"; binding: FabricProviderBinding }\n | { type: \"catalog\"; provider: string };\n\nconst snapshot = (binding: FabricProviderBinding): FabricProviderBinding => ({\n ...binding,\n ...(binding.closeTask ? { closeTask: binding.closeTask } : {}),\n});\n\nconst useOnce = (): (() => boolean) => {\n let active = true;\n return () => {\n const next = consume(active);\n active = next.active;\n return next.released;\n };\n};\n\nexport class FabricProviderBindings {\n readonly #lifecycles = new Map<string, BindingLife>();\n readonly #current = new Map<string, FabricProviderBinding>();\n readonly #staged = new Map<string, FabricProviderBinding>();\n readonly #all = new Map<string, FabricProviderBinding>();\n readonly #generations = new Map<string, number>();\n readonly #pending = new Set<Promise<unknown>>();\n readonly #excluded = new Set<string>();\n readonly #signals = new Map<string, AbortController>();\n readonly #listeners = new Set<(event: FabricProviderBindingEvent) => void>();\n\n subscribe(listener: (event: FabricProviderBindingEvent) => void): () => void {\n this.#listeners.add(listener);\n return () => this.#listeners.delete(listener);\n }\n\n current(name: string): FabricProviderBinding | undefined {\n return this.#current.get(name);\n }\n\n binding(id: string): FabricProviderBinding | undefined {\n const binding = this.#all.get(id);\n const life = this.#lifecycles.get(id);\n return binding && life && bindingStep(life, { $: \"Inspect\" }).command.$ === \"Granted\" ? binding : undefined;\n }\n\n has(name: string): boolean {\n return this.#current.has(name);\n }\n\n providers(): FabricProvider[] {\n return [...this.#current.values()].map((binding) => binding.provider);\n }\n\n entries(): FabricProviderBinding[] {\n return [...this.#all.values()].filter((binding) => binding.state !== \"closed\");\n }\n\n mount(\n provider: FabricProvider,\n options: { overwrite?: boolean; staged?: boolean } = {},\n ): FabricComponentProviderLease {\n // A host-owned (excluded) generation never reaches provider.close(), so\n // its instance may be remounted while that generation finishes closing.\n if ([...this.#all.values()].some(binding =>\n binding.provider === provider && binding.closeTask && !this.#excluded.has(binding.id))) {\n throw new Error(\"Cannot mount a provider instance whose close has begun\");\n }\n const current = this.#current.get(provider.name);\n const staged = this.#staged.get(provider.name);\n if ((current || staged) && !options.overwrite) {\n throw new Error(`Fabric provider already registered: ${provider.name}`);\n }\n if (staged && options.overwrite) this.retire(staged.id);\n const generation = (this.#generations.get(provider.name) ?? 0) + 1;\n if (!Number.isSafeInteger(generation)) throw new Error(\"Provider generation overflow\");\n this.#generations.set(provider.name, generation);\n const binding: FabricProviderBinding = {\n id: randomUUID(),\n name: provider.name,\n generation,\n provider,\n state: options.staged ? \"staged\" : \"active\",\n ownerRetained: true,\n allowReplace: options.overwrite === true,\n retainers: 0,\n inFlight: 0,\n };\n if (provider.subscribeCatalog) {\n binding.unsubscribeCatalog = provider.subscribeCatalog(() =>\n this.notifyCatalogChanged(provider.name),\n );\n }\n this.#all.set(binding.id, binding);\n this.#lifecycles.set(binding.id, { $: \"Life\", phase: { $: options.staged ? \"Staged\" : \"Active\" }, owner: true, holds: 0, calls: 0, revoked: false });\n this.#signals.set(binding.id, new AbortController());\n if (options.staged) {\n this.#staged.set(binding.name, binding);\n this.#emit({ type: \"staged\", binding: snapshot(binding) });\n } else {\n const replaced = this.#activateOne(binding);\n if (replaced && options.overwrite) void this.releaseOwner(replaced.id).catch(() => undefined);\n }\n\n const takeRelease = useOnce();\n return {\n bindingId: binding.id,\n name: binding.name,\n generation: binding.generation,\n get active() {\n return binding.state === \"active\";\n },\n retire: () => this.retire(binding.id),\n release: async () => {\n if (!takeRelease()) return binding.closeTask;\n return this.releaseOwner(binding.id);\n },\n };\n }\n\n activate(bindingIds: readonly string[]): string[] {\n const bindings = bindingIds.map((id) => {\n const binding = this.#all.get(id);\n if (!binding || binding.state === \"closed\" || binding.closeTask) {\n throw new Error(`Unknown Fabric provider binding: ${id}`);\n }\n if (binding.state !== \"staged\" && binding.state !== \"active\") {\n throw new Error(`Fabric provider binding is ${binding.state}: ${binding.name}`);\n }\n return binding;\n });\n const names = new Set<string>();\n for (const binding of bindings) {\n if (names.has(binding.name)) {\n throw new Error(`Cannot activate multiple Fabric bindings for provider ${binding.name}`);\n }\n names.add(binding.name);\n const current = this.#current.get(binding.name);\n if (current && current.id !== binding.id && !binding.allowReplace) {\n throw new Error(`Fabric provider already registered: ${binding.name}`);\n }\n }\n const replaced: string[] = [];\n for (const binding of bindings) {\n const previous = this.#activateOne(binding);\n if (previous && previous.id !== binding.id) {\n replaced.push(previous.id);\n if (binding.allowReplace) void this.releaseOwner(previous.id).catch(() => undefined);\n }\n }\n return replaced;\n }\n\n /** Withdraw the current binding: retire it and drop its owner hold, so\n * retained generations drain under the normal lifecycle rules. `provider`\n * and `generation` (number = generation, string = binding id) pin the target;\n * a mismatch withdraws nothing. `keepProviderOpen` skips provider.close() for\n * host-owned instances. */\n unregister(\n name: string,\n options: { provider?: FabricProvider; generation?: number | string; keepProviderOpen?: boolean } = {},\n ): FabricProvider | undefined {\n const binding = this.#current.get(name);\n if (!binding) return undefined;\n if (options.provider !== undefined && binding.provider !== options.provider) return undefined;\n if (\n options.generation !== undefined &&\n (typeof options.generation === \"number\" ? binding.generation : binding.id) !== options.generation\n ) {\n return undefined;\n }\n if (options.keepProviderOpen) this.#excluded.add(binding.id);\n this.retire(binding.id);\n void this.releaseOwner(binding.id).catch(() => undefined);\n return binding.provider;\n }\n\n retire(id: string): void {\n const binding = this.#all.get(id);\n if (!binding) return;\n const withdrawing = this.#current.get(binding.name)?.id === id || this.#staged.get(binding.name)?.id === id;\n if (this.#current.get(binding.name)?.id === id) this.#current.delete(binding.name);\n if (this.#staged.get(binding.name)?.id === id) this.#staged.delete(binding.name);\n this.#step(binding, { $: \"Retire\" });\n if (withdrawing) this.#emit({ type: \"retiring\", binding: snapshot(binding) });\n void this.#maybeClose(binding).catch(() => undefined);\n }\n\n retain(ids: Iterable<string>, cleanup = false): () => Promise<void> {\n const retained: FabricProviderBinding[] = [];\n try {\n for (const id of new Set(ids)) {\n const binding = this.#all.get(id);\n if (!binding || this.#step(binding, { $: \"Retain\", cleanup }) !== \"Granted\") {\n throw new Error(`Unknown Fabric provider binding: ${id}`);\n }\n retained.push(binding);\n }\n } catch (error) {\n for (const binding of retained) this.#step(binding, { $: \"Release\" });\n throw error;\n }\n const takeRelease = useOnce();\n return async () => {\n if (!takeRelease()) return;\n await Promise.all(retained.map(async (binding) => {\n this.#step(binding, { $: \"Release\" });\n await this.#maybeClose(binding);\n }));\n };\n }\n\n beginInvocation(id: string, cleanup = false): () => Promise<void> {\n const binding = this.#all.get(id);\n if (!binding || this.#step(binding, { $: \"Begin\", cleanup }) !== \"Granted\") {\n throw new Error(`Unknown Fabric provider binding: ${id}`);\n }\n const takeEnd = useOnce();\n return async () => {\n if (!takeEnd()) return;\n this.#step(binding, { $: \"End\" });\n await this.#maybeClose(binding);\n };\n }\n\n signal(id: string): AbortSignal {\n const controller = this.#signals.get(id);\n if (!controller) throw new Error(\"Unknown provider authority\");\n return controller.signal;\n }\n\n revoke(id: string): void {\n const binding = this.#all.get(id);\n if (!binding) return;\n this.#step(binding, { $: \"Revoke\" });\n this.#signals.get(id)?.abort(new Error(\"Fabric provider authority revoked\"));\n this.retire(id);\n void this.#maybeClose(binding).catch(() => undefined);\n }\n\n quarantine(id: string, error: unknown): void {\n const binding = this.#all.get(id);\n if (!binding) return;\n binding.closeError = error instanceof Error ? error.message : String(error);\n this.#step(binding, { $: \"Abort\" });\n this.revoke(id);\n }\n\n /** Hold the real operation, not the caller's cancellation race. */\n track<T>(id: string, operation: () => T | PromiseLike<T>, cleanup = false): Promise<T> {\n if (!cleanup && !this.binding(id)) return Promise.reject(new Error(\"Fabric provider authority revoked or unavailable\"));\n let end: () => Promise<void>;\n try { end = this.beginInvocation(id, cleanup); }\n catch (error) { return Promise.reject(error); }\n let actual: Promise<T>;\n try { actual = Promise.resolve(operation()); }\n catch (error) { actual = Promise.reject(error); }\n this.#pending.add(actual);\n const settled = () => { this.#pending.delete(actual); return end(); };\n void actual.then(settled, settled).catch(() => undefined);\n return actual;\n }\n\n trackProvider<T>(provider: FabricProvider, operation: () => T | PromiseLike<T>, cleanup = false): Promise<T> {\n const binding = [...this.#all.values()].find(item => item.provider === provider && this.#canBegin(item.id, cleanup));\n if (!binding) return Promise.reject(new Error(\"Fabric provider binding is unavailable\"));\n return this.track(binding.id, operation, cleanup);\n }\n\n notifyCatalogChanged(provider: string): void {\n if (this.#current.has(provider)) this.#emit({ type: \"catalog\", provider });\n }\n\n async close(excludedProviderNames: Set<string> = new Set()): Promise<void> {\n const tasks: Promise<void>[] = [];\n for (const binding of this.#all.values()) {\n if (binding.state === \"closed\") continue;\n if (excludedProviderNames.has(binding.name)) this.#excluded.add(binding.id);\n this.revoke(binding.id);\n tasks.push(this.#maybeClose(binding));\n }\n const deadline = Date.now() + 1_000;\n await settleWithin([...tasks, ...this.#pending], 1_000);\n await settleWithin([...this.#all.values()].flatMap(binding => binding.closeTask ? [binding.closeTask] : []), Math.max(0, deadline - Date.now()));\n this.#current.clear();\n this.#staged.clear();\n }\n\n #activateOne(binding: FabricProviderBinding): FabricProviderBinding | undefined {\n const current = this.#current.get(binding.name);\n if (current?.id === binding.id && binding.state === \"active\") return current;\n if (current && current.id !== binding.id) this.retire(current.id);\n if (this.#staged.get(binding.name)?.id === binding.id) this.#staged.delete(binding.name);\n if (this.#step(binding, { $: \"Activate\" }) !== \"Granted\") throw new Error(\"Provider binding cannot be activated\");\n this.#current.set(binding.name, binding);\n this.#emit({ type: \"activated\", binding: snapshot(binding) });\n return current;\n }\n\n private async releaseOwner(id: string): Promise<void> {\n const binding = this.#all.get(id);\n if (!binding) return;\n this.retire(id);\n this.#step(binding, { $: \"DropOwner\" });\n await this.#maybeClose(binding);\n }\n\n async #maybeClose(binding: FabricProviderBinding): Promise<void> {\n if (binding.closeTask) return binding.closeTask;\n // The reducer reserves Closing synchronously, before arbitrary callbacks.\n if (this.#step(binding, { $: \"Shut\" }) !== \"StartClose\") return;\n binding.closeTask = Promise.resolve().then(async () => {\n try {\n const unsubscribe = binding.unsubscribeCatalog;\n delete binding.unsubscribeCatalog;\n await unsubscribe?.();\n const shared = [...this.#all.values()].some(other => other.id !== binding.id && other.provider === binding.provider && other.state !== \"closed\");\n if (!shared && !this.#excluded.has(binding.id)) await binding.provider.close?.();\n } catch (error) {\n this.quarantine(binding.id, error);\n throw error;\n }\n if (this.#step(binding, { $: \"Complete\" }) !== \"Granted\") {\n throw new Error(binding.closeError ?? \"Provider close completion refused\");\n }\n this.#all.delete(binding.id);\n this.#lifecycles.delete(binding.id);\n this.#signals.delete(binding.id);\n this.#excluded.delete(binding.id);\n this.#emit({ type: \"closed\", binding: snapshot(binding) });\n });\n return binding.closeTask;\n }\n\n #canBegin(id: string, cleanup: boolean): boolean {\n const life = this.#lifecycles.get(id);\n return !!life && life.calls < VERIFIED_NAT_MAX && bindingStep(life, { $: \"Begin\", cleanup }).command.$ === \"Granted\";\n }\n\n #step(binding: FabricProviderBinding, event: BindingEvent): BindingOutcome[\"command\"][\"$\"] {\n const life = this.#lifecycles.get(binding.id);\n if (!life) return \"Denied\";\n if ((event.$ === \"Begin\" && life.calls >= VERIFIED_NAT_MAX) || (event.$ === \"Retain\" && life.holds >= VERIFIED_NAT_MAX)) {\n throw new Error(\"Provider lifecycle accounting overflow\");\n }\n const outcome = bindingStep(life, event);\n if (outcome.next.holds > VERIFIED_NAT_MAX || outcome.next.calls > VERIFIED_NAT_MAX) {\n throw new Error(\"Provider lifecycle accounting overflow\");\n }\n this.#lifecycles.set(binding.id, outcome.next);\n binding.state = ({ Staged: \"staged\", Active: \"active\", Retiring: \"retiring\", Closing: \"retiring\", Closed: \"closed\", Failed: \"retiring\" } as const)[outcome.next.phase.$];\n binding.ownerRetained = outcome.next.owner;\n binding.retainers = Number(outcome.next.holds);\n binding.inFlight = Number(outcome.next.calls);\n return outcome.command.$;\n }\n\n #emit(event: FabricProviderBindingEvent): void {\n for (const listener of [...this.#listeners]) {\n try {\n listener(event);\n } catch {\n // Registry listeners are observations; one listener cannot break provider ownership.\n }\n }\n }\n}\n", "// Generated by scripts/verified-kernels.ts from proofs/lifecycle.ts with gdp-wired@0.30.1. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\n\nexport const bindingStep = /* @__PURE__ */ (() => {\n// Generated from the machine binding lifecycle. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"phase\": 0, \"owner\": 1, \"holds\": 0, \"calls\": 0, \"revoked\": 0, \"command\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"event\": $n(input[\"event\"], \"input event\"), \"cleanup\": $n(input[\"cleanup\"], \"input cleanup\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const flag0 = ((env[\"event\"] === 0) && (s[\"phase\"] <= 2) && (s[\"revoked\"] === 0));\n const flag1 = ((env[\"event\"] === 1) && (s[\"phase\"] <= 1));\n const flag2 = ((env[\"event\"] === 2) && (s[\"phase\"] <= 1));\n const flag3 = ((env[\"event\"] === 2) && (2 <= s[\"phase\"]));\n const flag4 = ((env[\"event\"] === 3) && (0 <= 0));\n const flag5 = ((env[\"event\"] === 4) && (s[\"phase\"] <= 1));\n const flag6 = ((env[\"event\"] === 4) && (2 <= s[\"phase\"]));\n const flag7 = ((env[\"event\"] === 5) && (s[\"phase\"] <= 2) && ((env[\"cleanup\"] === 1) || (s[\"revoked\"] === 0)));\n const flag8 = ((env[\"event\"] === 5) && (s[\"phase\"] === 5) && (env[\"cleanup\"] === 1));\n const flag9 = ((env[\"event\"] === 7) && (s[\"phase\"] <= 2) && ((env[\"cleanup\"] === 1) || (s[\"revoked\"] === 0)));\n const flag10 = ((env[\"event\"] === 7) && (s[\"phase\"] === 5) && (env[\"cleanup\"] === 1));\n const flag11 = ((env[\"event\"] === 6) && (0 <= 0) && (1 <= s[\"holds\"]));\n const flag12 = ((env[\"event\"] === 8) && (0 <= 0) && (1 <= s[\"calls\"]));\n const flag13 = ((env[\"event\"] === 9) && (s[\"phase\"] === 2) && ((s[\"owner\"] === 0) && (s[\"holds\"] === 0) && (s[\"calls\"] === 0)));\n const flag14 = ((env[\"event\"] === 10) && (s[\"phase\"] === 3));\n const flag15 = ((env[\"event\"] === 11) && ((s[\"phase\"] <= 3) || (s[\"phase\"] === 5)));\n const flag16 = flag0;\n const flag17 = flag1;\n const flag18 = flag2;\n const flag19 = flag3;\n const flag20 = flag4;\n const flag21 = flag5;\n const flag22 = flag6;\n const flag23 = flag7;\n const flag24 = flag8;\n const flag25 = flag9;\n const flag26 = flag10;\n const flag27 = flag11;\n const flag28 = flag12;\n const flag29 = flag13;\n const flag30 = flag14;\n const flag31 = flag15;\n if (!((env[\"event\"] < 12) && (env[\"cleanup\"] <= 1))) throw new RangeError(\"binding lifecycle: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"owner\": ((flag20 || flag21 || flag22 || flag31) ? 0 : s[\"owner\"]), \"holds\": ((flag23 || flag24) ? $x(s[\"holds\"] + 1) : (flag27 ? Math.max(0, s[\"holds\"] - 1) : s[\"holds\"])), \"calls\": ((flag25 || flag26) ? $x(s[\"calls\"] + 1) : (flag28 ? Math.max(0, s[\"calls\"] - 1) : s[\"calls\"])), \"revoked\": ((flag21 || flag22 || flag31) ? 1 : s[\"revoked\"]), \"phase\": (flag17 ? 1 : ((flag18 || flag21) ? 2 : (flag29 ? 3 : (flag30 ? 4 : (flag31 ? 5 : s[\"phase\"]))))), \"command\": ((flag16 || flag17 || flag18 || flag19 || flag20 || flag21 || flag22 || flag23 || flag24 || flag25 || flag26 || flag27 || flag28 || flag30 || flag31) ? 1 : (flag29 ? 2 : 0))};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { bit } from \"./machine.js\";\nimport { bindingStep as lifecycleMachine } from \"./generated/lifecycle.js\";\n\nconst PHASES = [\"Staged\", \"Active\", \"Retiring\", \"Closing\", \"Closed\", \"Failed\"] as const;\nconst EVENTS = [\"Inspect\", \"Activate\", \"Retire\", \"DropOwner\", \"Revoke\", \"Retain\", \"Release\", \"Begin\", \"End\", \"Shut\", \"Complete\", \"Abort\"] as const;\nconst COMMANDS = [\"Denied\", \"Granted\", \"StartClose\"] as const;\n\nexport type BindingPhase = { $: (typeof PHASES)[number] };\nexport interface BindingLife { $: \"Life\"; phase: BindingPhase; owner: boolean; holds: number; calls: number; revoked: boolean }\nexport type BindingEvent = { $: \"Inspect\" | \"Activate\" | \"Retire\" | \"DropOwner\" | \"Revoke\" | \"Release\" | \"End\" | \"Shut\" | \"Complete\" | \"Abort\" } | { $: \"Retain\" | \"Begin\"; cleanup: boolean };\nexport interface BindingOutcome { $: \"Outcome\"; next: BindingLife; command: { $: (typeof COMMANDS)[number] } }\n\nconst index = <T extends string>(values: readonly T[], value: T, what: string): number => {\n const i = values.indexOf(value);\n if (i < 0) throw new Error(`Invalid verified ${what}: ${value}`);\n return i;\n};\nconst named = <T extends string>(values: readonly T[], i: number | undefined, what: string): T => {\n const value = i === undefined ? undefined : values[i];\n if (value === undefined) throw new Error(`Invalid verified ${what} index ${i}`);\n return value;\n};\nconst flag = (value: number | undefined): boolean => {\n if (value !== 0 && value !== 1) throw new Error(\"Invalid verified lifecycle flag\");\n return value === 1;\n};\n\n/** Trusted codec around the compiled lifecycle reducer: the life record is the\n * machine state, and the event and its cleanup bit are the request. */\nexport const bindingStep = (life: BindingLife, event: BindingEvent): BindingOutcome => {\n const state = {\n scalars: {\n phase: index(PHASES, life.phase.$, \"phase\"), owner: bit(life.owner), holds: life.holds,\n calls: life.calls, revoked: bit(life.revoked), command: 0,\n },\n maps: {},\n };\n const next = lifecycleMachine.step({}, state, {\n event: index(EVENTS, event.$, \"event\"), cleanup: bit(\"cleanup\" in event && event.cleanup),\n }).scalars;\n return {\n $: \"Outcome\",\n next: {\n $: \"Life\", phase: { $: named(PHASES, next.phase, \"phase\") }, owner: flag(next.owner),\n holds: next.holds!, calls: next.calls!, revoked: flag(next.revoked),\n },\n command: { $: named(COMMANDS, next.command, \"command\") },\n };\n};\n"],
|
|
4
|
+
"sourcesContent": ["// Generated by scripts/verified-kernels.ts from proofs/authority.ts with gdp-wired@0.31.1. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $m(v, what) { if (!(v instanceof Map)) throw new RangeError(what + ' must be a Map of naturals'); for (const [key, x] of v) { $n(key, 'a key of ' + what); $n(x, 'a cell of ' + what); } return v; }\nfunction $keys(maps, names) { const keys = new Set(); let past = 0; for (const c of Object.values(maps)) for (const key of c.keys()) past = Math.max(past, key + 1); for (const n of names) for (const key of maps[n].keys()) keys.add(key); return [...keys, past]; }\nfunction $every(keys, f) { const past = keys[keys.length - 1], d = f(past), cells = new Map(); for (let i = 0; i < keys.length - 1; i++) { const v = f(keys[i]); if (v !== d) cells.set(keys[i], v); } return {cells, d}; }\n\nexport const capabilityAuthority = /* @__PURE__ */ (() => {\n// Generated from the machine capability authority. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"live\": 0, \"granted\": 0}, maps: {\"Grants\": new Map()}};\n}\nfunction step(params, state, input) {\n const env = {\"op\": $n(input[\"op\"], \"input op\"), \"name\": $n(input[\"name\"], \"input name\"), \"parentLive\": $n(input[\"parentLive\"], \"input parentLive\")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, \"Candidate\": $m(input[\"Candidate\"], \"input Candidate\"), \"Parent\": $m(input[\"Parent\"], \"input Parent\")};\n const flag0 = $keys(maps, [\"Candidate\",\"Parent\"]).every(k => (((maps[\"Candidate\"].get(k) ?? 0) <= 1) && ((maps[\"Parent\"].get(k) ?? 0) <= 1)));\n const flag1 = $keys(maps, [\"Candidate\",\"Parent\"]).every(k => ((!(1 <= (maps[\"Candidate\"].get(k) ?? 0))) || (1 <= (maps[\"Parent\"].get(k) ?? 0))));\n const flag2 = $keys(maps, [\"Candidate\",\"Parent\"]).every(k => ((maps[\"Candidate\"].get(k) ?? 0) <= (maps[\"Parent\"].get(k) ?? 0)));\n const flag3 = (env[\"op\"] === 0);\n const flag4 = ((env[\"op\"] === 1) && ((env[\"parentLive\"] === 1) && flag2));\n const flag5 = ((env[\"op\"] === 2) && ((s[\"live\"] === 1) && (1 <= (maps[\"Grants\"].get(env[\"name\"]) ?? dft[\"Grants\"] ?? 0))));\n if (!((env[\"op\"] < 4) && (env[\"parentLive\"] <= 1) && flag0)) throw new RangeError(\"capability authority: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"live\": ((flag3 || flag4) ? 1 : ((env[\"op\"] === 2) ? s[\"live\"] : 0)), \"granted\": (flag5 ? 1 : 0)};\n const write0 = $every($keys(maps, [\"Candidate\",\"Grants\"]), k => ((flag3 || flag4) ? (maps[\"Candidate\"].get(k) ?? 0) : ((env[\"op\"] === 2) ? (maps[\"Grants\"].get(k) ?? dft[\"Grants\"] ?? 0) : 0)));\n state.maps[\"Grants\"] = write0.cells; dft[\"Grants\"] = write0.d;\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { Interner, bit, idSet, members, type MachineState } from \"./machine.js\";\nimport { capabilityAuthority } from \"./generated/authority.js\";\nimport type { FabricCapabilityBindingView } from \"../protocol.js\";\n\nconst ISSUE = 0, DERIVE = 1, USE = 2, RELEASE = 3;\n\n/** Trusted codec: JSON's fixed-position string/number tuple preserves ref,\n * provider, binding identity, generation and descriptor identity, and one\n * injective table per authority tree turns each complete tuple into an id.\n * Descriptor hashing itself remains trusted; the kernel proves equality of\n * identities, not hash injectivity. */\nconst encodeGrant = (grant: Readonly<FabricCapabilityBindingView>): string => JSON.stringify([\n grant.ref, grant.provider, grant.providerBindingId, grant.generation, grant.descriptorHash,\n]);\n\n/** Private canonical state behind ActionRegistry's WeakMap-owned public views.\n * Root issuance is a trusted registry operation, not a caller-supplied permission\n * Boolean. The compiled kernel decides derivation/use/release over exact grants.\n * JS identity, WeakMap ownership, binding observations and abort delivery remain trusted.\n */\nexport class CapabilityAuthority {\n #state: MachineState;\n readonly #names: Interner;\n readonly #grants: ReadonlyMap<string, Readonly<FabricCapabilityBindingView>>;\n\n private constructor(grants: readonly FabricCapabilityBindingView[], parent?: CapabilityAuthority) {\n const canonical = grants.map(grant => Object.freeze({ ...grant }));\n this.#grants = new Map(canonical.map(grant => [grant.ref, grant]));\n this.#names = parent ? parent.#names : new Interner();\n const candidate = idSet(canonical.map(grant => this.#names.id(encodeGrant(grant))));\n const parentGrants = parent ? idSet(members(parent.#state, \"Grants\")) : new Map<number, number>();\n this.#state = capabilityAuthority.step({}, capabilityAuthority.init({}), {\n op: parent ? DERIVE : ISSUE, name: 0, parentLive: bit(parent?.active ?? false),\n Candidate: candidate, Parent: parentGrants,\n });\n }\n\n static issue(grants: readonly FabricCapabilityBindingView[]): CapabilityAuthority {\n return new CapabilityAuthority(grants);\n }\n\n derive(grants: readonly FabricCapabilityBindingView[]): CapabilityAuthority {\n return new CapabilityAuthority(grants, this);\n }\n\n get active(): boolean {\n return this.#state.scalars.live === 1;\n }\n\n release(): void {\n this.#state = capabilityAuthority.step({}, this.#state, { op: RELEASE, name: 0, parentLive: 0, Candidate: new Map(), Parent: new Map() });\n }\n\n resolve(ref: string): FabricCapabilityBindingView | undefined {\n const grant = this.#grants.get(ref);\n if (!grant) return undefined;\n this.#state = capabilityAuthority.step({}, this.#state, {\n op: USE, name: this.#names.id(encodeGrant(grant)), parentLive: 0, Candidate: new Map(), Parent: new Map(),\n });\n return this.#state.scalars.granted === 1 ? { ...grant } : undefined;\n }\n\n bindings(): FabricCapabilityBindingView[] {\n return this.active ? [...this.#grants.values()].map(grant => ({ ...grant })) : [];\n }\n}\n", "import type { ProviderOperations, ProviderOperation } from \"./provider-operations.js\";\nimport { CapabilityAuthority } from \"../verified/authority.js\";\nimport { randomUUID } from \"node:crypto\";\nimport { effectConflictsBetween, registrationEffect, summarizeEffects } from \"../components/effect-policy.js\";\n\n/** Effective page size for registry list(): caller default 100, hard cap 1000.\n * Exported so guest discovery surfaces slice identically to the registry. */\nexport const fabricActionListLimit = (limit?: number): number =>\n Math.max(1, Math.min(limit ?? 100, 1_000));\nimport { repairCatalogInput, validateCatalogArgs, validationMessage } from \"./action-arguments.js\";\nimport {\n MAX_AUDIT_VALUE_CHARS,\n boundedPreviewValue,\n boundedResult,\n strictDecisionResult,\n failedResultError,\n failedResultOutcome,\n previewArgs,\n previewResult,\n} from \"./action-result.js\";\nimport { runAbortable, settleWithin, throwIfAborted } from \"../async-settlement.js\";\nimport type {\n FabricCapabilityRequirement,\n FabricComponentProviderLease,\n} from \"../components/types.js\";\nimport {\n executionOutcomeFromError,\n FabricResolutionError,\n FabricTraceSafeError,\n type FabricExecutionTraceOperationHandle,\n type FabricExecutionTraceRecorder,\n} from \"../audit/trace.js\";\nimport {\n FABRIC_NESTED_TOOL_CALL_ID_PREFIX,\n type FabricActionDescriptor,\n type FabricActionEffect,\n type FabricCapabilityBindingView,\n type FabricCapabilityCatalog,\n type FabricCapabilityResolution,\n type FabricCommittedCapabilityView,\n type FabricGuestTypeSources,\n type FabricInvocationActivityUpdate,\n type FabricInvocationContext,\n type FabricMediaBlock,\n type FabricNamedActionTypeSource,\n type FabricProvider,\n type FabricProviderListRequest,\n type FabricProviderTypeSource,\n type FabricScope,\n type FabricScopedProviderResult,\n} from \"../protocol.js\";\nimport {\n formatUnknownActionMessage,\n repairActionName,\n} from \"./action-repair.js\";\nimport {\n applyActiveActionName,\n applyActiveArgRepairs,\n getActiveRepairCompiler,\n} from \"../repairs/active.js\";\nimport {\n activeQuarantinedRefNames,\n effectiveInputSchema,\n normalizeActiveArguments,\n isActiveQuarantine,\n} from \"../entropy/active.js\";\nimport { formatFabricEffectConflict } from \"./effect-conflict.js\";\nimport { providerGlobalNames } from \"../provider-globals.js\";\nimport { stableJsonHash } from \"./stable-hash.js\";\nimport type {\n FabricSpeculationReplay,\n FabricSpeculationRuntime,\n} from \"../speculation/types.js\";\nimport type { FabricNestedToolResultProxy } from \"./tool-result-proxy.js\";\nimport type { FabricHostPolicy } from \"./host-policy.js\";\nimport {\n FabricProviderBindings,\n type FabricProviderBinding,\n type FabricProviderBindingEvent,\n} from \"./provider-bindings.js\";\n\nexport interface ResolvedFabricAction extends FabricActionDescriptor {\n ref: string;\n provider: string;\n}\n\ninterface FabricEffectConflict {\n withRef: string;\n resources: string[];\n reason: \"shared_resource\" | \"unknown_resource\";\n}\n\nexport interface FabricCallAudit {\n ref: string;\n nestedToolCallId: string;\n startedAt: number;\n endedAt?: number;\n success?: boolean;\n error?: string;\n resultChars?: number;\n resultTruncated?: boolean;\n tool?: string;\n provider?: string;\n args?: Record<string, unknown>;\n result?: unknown;\n media?: FabricMediaBlock[];\n mediaNote?: string;\n preview?: unknown;\n effectConflicts?: FabricEffectConflict[];\n /** Result was pre-launched while the program streamed and served from the speculation store. */\n speculated?: boolean;\n /** Spelled action name that repaired to the canonical one at resolve (e.g. search \u2192 recall). */\n repairedFrom?: string;\n /** The provider reported a nested result with Pi's `terminate: true`. In memory only. */\n terminate?: true;\n}\n\nexport type FabricRegistryActivityEvent =\n | {\n type: \"call_start\";\n callId: string;\n ref: string;\n args: Record<string, unknown>;\n }\n | {\n type: \"call_update\";\n callId: string;\n update: FabricInvocationActivityUpdate;\n }\n | {\n type: \"call_args\";\n callId: string;\n args: Record<string, unknown>;\n }\n | {\n type: \"call_end\";\n callId: string;\n success: boolean;\n result?: unknown;\n preview?: unknown;\n error?: string;\n };\n\nexport interface FabricCapabilityViewLease extends FabricCapabilityResolution {\n release(): Promise<void>;\n}\n\nexport interface FabricRegistryInvocationContext extends FabricInvocationContext {\n authorize?(action: ResolvedFabricAction): Promise<void>;\n approve(\n action: ResolvedFabricAction,\n args: Record<string, unknown>,\n ): Promise<void>;\n audits: FabricCallAudit[];\n maxResultChars: number;\n trace?: FabricExecutionTraceRecorder;\n traceOperation?: FabricExecutionTraceOperationHandle;\n observeInvocation?(event: FabricRegistryActivityEvent): void;\n}\n\n/**\n * Prefix pi-fabric prepends to every nested tool-call id it generates inside a\n * fabric_exec run (one per pi., mcp., or agents. invocation). Extensions can\n * detect that a tool_call/tool_result event came from a nested fabric call \u2014\n * rather than a top-level call the LLM made directly \u2014 by checking\n * `event.toolCallId.startsWith(NESTED_TOOL_CALL_ID_PREFIX)`. The LLM's own\n * tool-call ids (e.g. openai \"call_\u2026\", anthropic \"toolu_\u2026\") never use this\n * prefix, so the signal is unambiguous.\n */\nexport const NESTED_TOOL_CALL_ID_PREFIX = FABRIC_NESTED_TOOL_CALL_ID_PREFIX;\n\nconst providerNamePattern = /^[a-z][a-z0-9_-]*$/;\n/** A provider whose catalog is slower than this keeps a loose program global for that execution. */\nconst PROVIDER_TYPE_SOURCE_TIMEOUT_MS = 500;\n\nconst isPlainRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === \"object\" && value !== null && !Array.isArray(value);\n\n/** Lexical, deliberately loose: a miss only leaves that global loosely typed. */\nconst usesProviderGlobal = (code: string, name: string): boolean =>\n new RegExp(`(?<![\\\\w$.])${name}\\\\s*(?:\\\\?\\\\.|\\\\.|\\\\[)`).test(code);\n\n/** Copies only the named fields the declaration builder reads; never the descriptor. */\nconst actionTypeSource = (name: unknown, inputSchema: unknown): FabricNamedActionTypeSource | undefined =>\n typeof name === \"string\" && name.length > 0 && name.length <= 256\n ? { name, inputSchema: isPlainRecord(inputSchema) ? inputSchema : {} }\n : undefined;\n/** Process-wide issuance record owned by src/scope.ts. */\nconst SCOPE_HOLDER = Symbol.for(\"pi-fabric:scope:v1\");\n\n/** structuredClone detaches ordinary nested references, but deliberately shares\n * SharedArrayBuffer backing memory. Such payloads cannot be approved as stable\n * snapshots, including when hidden in maps, views, cycles or Error.cause.\n */\nconst snapshotArguments = (args: Record<string, unknown>): Record<string, unknown> => {\n const snapshot = structuredClone(args);\n const pending: unknown[] = [snapshot];\n const seen = new WeakSet<object>();\n while (pending.length > 0) {\n const value = pending.pop();\n if (value === null || typeof value !== \"object\" || seen.has(value)) continue;\n seen.add(value);\n if (typeof SharedArrayBuffer !== \"undefined\" && value instanceof SharedArrayBuffer) {\n throw new FabricTraceSafeError(\"Fabric argument snapshots cannot contain shared memory\");\n }\n // WebAssembly.Memory has no own data properties; its backing buffer is\n // nevertheless shared by structuredClone and must be inspected explicitly.\n if (Object.prototype.toString.call(value) === \"[object WebAssembly.Memory]\") {\n pending.push((value as { buffer: unknown }).buffer);\n continue;\n }\n if (ArrayBuffer.isView(value)) {\n pending.push(value.buffer);\n continue;\n }\n if (value instanceof Map) for (const [key, entry] of value) pending.push(key, entry);\n if (value instanceof Set) for (const entry of value) pending.push(entry);\n for (const key of Reflect.ownKeys(value)) {\n const property = Object.getOwnPropertyDescriptor(value, key);\n if (property && \"value\" in property) pending.push(property.value);\n }\n }\n return snapshot;\n};\n\nconst resolveDescriptor = (\n provider: FabricProvider,\n descriptor: FabricActionDescriptor,\n): ResolvedFabricAction => ({\n ...descriptor,\n effect: descriptor.effect ?? (descriptor.risk === \"read\"\n ? { kind: \"none\", ordering: \"commutative\" }\n : { kind: \"emission\", ordering: \"unknown\" }),\n provider: provider.name,\n ref: `${provider.name}.${descriptor.name}`,\n});\n\nconst descriptorHash = stableJsonHash;\n\nconst actionDescriptorHash = (action: ResolvedFabricAction): string =>\n descriptorHash({\n ref: action.ref,\n description: action.description,\n inputSchema: action.inputSchema,\n outputSchema: action.outputSchema,\n risk: action.risk,\n namespace: action.namespace,\n effect: action.effect,\n });\n\nconst discoveryTerms = (value: string): string[] =>\n [...value.normalize(\"NFKC\").matchAll(/[\\p{L}\\p{N}_]+/gu)]\n .map((match) => match[0].toLowerCase());\n\nexport const scoreActionSearch = (\n query: string,\n action: {\n ref: string;\n name: string;\n description: string;\n provider: string;\n namespace?: string;\n inputSchema: unknown;\n },\n providerDescription = \"\",\n): number => {\n const normalizedQuery = query.normalize(\"NFKC\").trim().toLowerCase();\n if (!normalizedQuery) return 0;\n const queryTerms = [...new Set(discoveryTerms(normalizedQuery))];\n const ref = action.ref.normalize(\"NFKC\").toLowerCase();\n const name = action.name.normalize(\"NFKC\").toLowerCase();\n const description = action.description.normalize(\"NFKC\").toLowerCase();\n const provider = action.provider.normalize(\"NFKC\").toLowerCase();\n const providerBody = providerDescription.normalize(\"NFKC\").toLowerCase();\n const namespace = (action.namespace ?? \"\").normalize(\"NFKC\").toLowerCase();\n const schema = JSON.stringify(action.inputSchema ?? {}).normalize(\"NFKC\").toLowerCase();\n const tokenSets = {\n ref: new Set(discoveryTerms(ref)),\n name: new Set(discoveryTerms(name)),\n description: new Set(discoveryTerms(description)),\n provider: new Set(discoveryTerms(provider)),\n providerBody: new Set(discoveryTerms(providerBody)),\n namespace: new Set(discoveryTerms(namespace)),\n schema: new Set(discoveryTerms(schema)),\n };\n const fields = Object.values(tokenSets);\n let score = 0;\n if (ref === normalizedQuery) score += 1_000;\n if (name === normalizedQuery) score += 800;\n if (ref.startsWith(normalizedQuery)) score += 300;\n else if (ref.includes(normalizedQuery)) score += 120;\n if (description.includes(normalizedQuery)) score += 40;\n if (providerBody.includes(normalizedQuery)) score += 20;\n if (schema.includes(normalizedQuery)) score += 10;\n let matchedTerms = 0;\n for (const term of queryTerms) {\n const matched = fields.some((field) => field.has(term));\n if (!matched) continue;\n matchedTerms += 1;\n if (tokenSets.ref.has(term) || tokenSets.name.has(term)) score += 30;\n if (tokenSets.provider.has(term)) score += 20;\n if (tokenSets.description.has(term)) score += 8;\n if (tokenSets.providerBody.has(term)) score += 4;\n if (tokenSets.namespace.has(term)) score += 6;\n if (tokenSets.schema.has(term)) score += 2;\n }\n if (queryTerms.length > 0 && matchedTerms === queryTerms.length) score += 15;\n return score;\n};\n\nconst conflictBetween = (\n left: FabricActionEffect,\n right: FabricActionEffect,\n): { resources: string[]; reason: FabricEffectConflict[\"reason\"] } | undefined => {\n return effectConflictsBetween(\n summarizeEffects([registrationEffect({ label: \"left\", ...left })]),\n summarizeEffects([registrationEffect({ label: \"right\", ...right })]),\n )[0];\n};\n\nexport class ActionRegistry {\n readonly #shutdown = new AbortController();\n readonly #views = new WeakMap<FabricCommittedCapabilityView, { controller: AbortController; signal: AbortSignal; authority: CapabilityAuthority }>();\n #operations: Promise<ProviderOperations> | undefined;\n readonly #providerBindings = new FabricProviderBindings();\n readonly #activeEffects = new Map<string, { ref: string; effect: FabricActionEffect }>();\n readonly #unavailable = new Map<string, string>();\n #unavailableResolver: ((name: string) => string | undefined) | undefined;\n #hostPolicy: FabricHostPolicy | undefined;\n #speculation: FabricSpeculationRuntime | undefined;\n #speculationEligibility: ((action: ResolvedFabricAction) => boolean) | undefined;\n\n constructor(readonly toolResultProxy?: FabricNestedToolResultProxy) {\n this.#providerBindings.subscribe(() => this.#speculation?.reset?.());\n }\n\n /**\n * Attach the speculative-PTC runtime. Eligibility is re-checked against the\n * resolved descriptor at launch and replay, so a config/captured-tool change\n * cannot sneak a side-effecting ref into the store after the fact.\n */\n setSpeculation(\n runtime: FabricSpeculationRuntime | undefined,\n eligibility?: (action: ResolvedFabricAction) => boolean,\n ): void {\n this.#speculation = runtime;\n this.#speculationEligibility = eligibility;\n }\n\n #allowsSpeculation(action: ResolvedFabricAction): boolean {\n const localRead = action.risk === \"read\" && action.effect?.kind === \"none\";\n // MCP keeps its conservative network/effect classification. Only the live\n // eligibility callback can attest an allowlisted read; explicit unsafe\n // annotations still refuse even if a custom callback opts it in.\n const mcpRead = action.provider === \"mcp\" && action.risk === \"network\" &&\n action.annotations?.destructiveHint !== true && action.annotations?.readOnlyHint !== false;\n return (localRead || mcpRead) && this.#speculationEligibility?.(structuredClone(action)) === true;\n }\n\n register(provider: FabricProvider, options: { overwrite?: boolean } = {}): void {\n this.mount(provider, options);\n }\n\n mount(\n provider: FabricProvider,\n options: { overwrite?: boolean; staged?: boolean } = {},\n ): FabricComponentProviderLease {\n if (this.#shutdown.signal.aborted) throw new Error(\"Fabric registry is closed\");\n if (!providerNamePattern.test(provider.name)) {\n throw new Error(`Invalid Fabric provider name: ${provider.name}`);\n }\n const lease = this.#providerBindings.mount(provider, options);\n this.#unavailable.delete(provider.name);\n return lease;\n }\n\n activateProviderBindings(bindingIds: readonly string[]): string[] {\n return this.#providerBindings.activate(bindingIds);\n }\n\n subscribeProviderChanges(\n listener: (event: FabricProviderBindingEvent) => void,\n ): () => void {\n return this.#providerBindings.subscribe(listener);\n }\n\n notifyCatalogChanged(provider: string): void {\n this.#providerBindings.notifyCatalogChanged(provider);\n }\n\n has(name: string): boolean {\n return this.#providerBindings.has(name);\n }\n\n setUnavailableResolver(resolve: (name: string) => string | undefined): void {\n this.#unavailableResolver = resolve;\n }\n\n /** Host restrictions checked before any provider prepares or runs an action. */\n setHostPolicy(policy: FabricHostPolicy | undefined): void {\n this.#hostPolicy = policy;\n }\n\n get hostPolicy(): FabricHostPolicy | undefined {\n return this.#hostPolicy;\n }\n\n #policyProviders(providers: FabricProvider[]): FabricProvider[] {\n return providers.filter((provider) => !this.#hostPolicy?.previewProviderHidden(provider.name));\n }\n\n #listProvider(\n provider: FabricProvider,\n request: FabricProviderListRequest,\n context: FabricInvocationContext,\n ): Promise<FabricActionDescriptor[]> {\n return runAbortable(context.signal, () => {\n // Seal at actual admission, even without an active policy. Pure provider\n // previews and unused type globals must not seal an otherwise idle host.\n if (this.#hostPolicy?.providerHidden(provider.name)) return [];\n return this.#providerBindings.trackProvider(provider, () => provider.list(request, context));\n });\n }\n\n #policyRefs(refs: string[]): string[] {\n const policy = this.#hostPolicy;\n if (!policy?.active) return refs;\n return refs.filter((ref) => {\n const separator = ref.indexOf(\".\");\n return !policy.refDenial(ref.slice(0, separator), ref.slice(separator + 1));\n });\n }\n\n #policyActions<T extends { provider: string; name: string }>(actions: T[]): T[] {\n const policy = this.#hostPolicy;\n return policy?.active ? actions.filter((action) => !policy.refDenial(action.provider, action.name)) : actions;\n }\n\n /**\n * Decide again on the action that resolution produced. Name repair can turn\n * a ref the policy allowed as written (pi.Write, pi.save) into a denied\n * canonical action, so every caller checks the resolved name before it\n * prepares arguments or runs the provider.\n */\n #assertResolvedAllowed(action: { provider: string; name: string }): void {\n const denial = this.#hostPolicy?.refDenial(action.provider, action.name);\n if (denial) throw new FabricResolutionError(denial);\n }\n\n markUnavailable(name: string, reason: string): void {\n if (!providerNamePattern.test(name)) {\n throw new Error(`Invalid Fabric provider name: ${name}`);\n }\n if (this.#providerBindings.has(name)) {\n throw new Error(`Cannot mark a registered Fabric provider unavailable: ${name}`);\n }\n this.#unavailable.set(name, reason);\n }\n\n unavailableProviders(): Array<{ name: string; reason: string }> {\n return [...this.#unavailable.entries()]\n .map(([name, reason]) => ({ name, reason }))\n .sort((left, right) => left.name.localeCompare(right.name));\n }\n\n unregister(\n name: string,\n options?: { provider?: FabricProvider; generation?: number | string; keepProviderOpen?: boolean },\n ): FabricProvider | undefined {\n return this.#providerBindings.unregister(name, options);\n }\n\n #visibleProviders(context?: FabricInvocationContext): FabricProvider[] {\n if (context) this.#scopeContext(context);\n return context?.capabilityView\n ? [...new Set(this.#viewAuthority(context.capabilityView).bindings().map(value => this.#providerBindings.binding(value.providerBindingId)?.provider).filter((provider): provider is FabricProvider => Boolean(provider)))]\n : this.#policyProviders(this.#providerBindings.providers());\n }\n\n providers(context?: FabricInvocationContext): Array<{ name: string; description: string }> {\n return this.#visibleProviders(context)\n .map((provider) => ({ name: provider.name, description: provider.description }))\n .sort((left, right) => left.name.localeCompare(right.name));\n }\n\n async inspectCapabilities(\n requirements: readonly (string | FabricCapabilityRequirement)[],\n context: FabricInvocationContext,\n ): Promise<FabricCapabilityResolution> {\n return this.#resolveCapabilities(requirements, context, false);\n }\n\n async acquireCapabilityView(\n requirements: readonly (string | FabricCapabilityRequirement)[],\n context: FabricInvocationContext,\n ): Promise<FabricCapabilityViewLease> {\n return this.#resolveCapabilities(requirements, context, true);\n }\n\n /**\n * Names of the visible providers that get a program global (see\n * src/provider-globals.ts): sorted, capped, and never a Fabric global, a\n * built-in provider, or a language keyword or builtin. A committed view\n * limits the names to the providers it binds.\n */\n providerGlobals(context?: FabricInvocationContext): string[] {\n return providerGlobalNames(this.#visibleProviders(context).map((provider) => provider.name));\n }\n\n /**\n * Snapshot the tool schemas backing the dynamic guest surfaces (mcp,\n * extensions and provider globals) so the type gate can reject\n * argument-shape mistakes before the sandbox runs. Side-effect-free by\n * construction: MCP data comes from the provider's cache-warm descriptor\n * slice (listing would schedule background revalidation), extension data\n * from the captured-tool catalog, provider-global data from each provider's\n * own list(). Providers that cannot supply data yet simply contribute no\n * section, or a loose global, and the loose declarations stand for that\n * execution. With `code`, a provider's list() runs only when the program\n * uses its global (`name.` or `name[`); other provider globals stay loose,\n * so a program never waits on, or triggers, a catalog it does not use.\n */\n async guestTypeSources(\n context: FabricInvocationContext,\n options: { code?: string } = {},\n ): Promise<FabricGuestTypeSources> {\n context = this.#scopeContext(context);\n const sources: FabricGuestTypeSources = {};\n const globals = this.providerGlobals(context);\n if (context.capabilityView) {\n const actions = await this.list({ limit: 1_000 }, context);\n if (globals.length > 0) {\n sources.providers = globals.map((provider) => ({\n provider,\n actions: actions\n .filter((action) => action.provider === provider)\n .flatMap((action) => actionTypeSource(action.name, action.inputSchema) ?? []),\n }));\n }\n const byServer = new Map<string, FabricNamedActionTypeSource[]>();\n for (const action of actions.filter((candidate) => candidate.provider === \"mcp\")) {\n const server = action.namespace;\n if (!server || server === \"management\" || action.name.startsWith(\"$\")) continue;\n const prefix = `${server}.`;\n const name = action.name.startsWith(prefix)\n ? action.name.slice(prefix.length)\n : action.name;\n const tools = byServer.get(server) ?? [];\n tools.push({ name, inputSchema: action.inputSchema });\n byServer.set(server, tools);\n }\n if (byServer.size > 0) {\n sources.mcpServers = [...byServer.entries()].map(([server, tools]) => ({\n server,\n tools,\n }));\n }\n const extensionTools = actions\n .filter((action) => action.provider === \"extensions\")\n .map((action) => ({ name: action.name, inputSchema: action.inputSchema }));\n if (extensionTools.length > 0) sources.extensionTools = extensionTools;\n return sources;\n }\n const mcp = this.#providerBindings.current(\"mcp\")?.provider as\n | (FabricProvider & { sliceDescriptors?: () => FabricActionDescriptor[] })\n | undefined;\n const mcpDescriptors = this.#hostPolicy?.active\n ? mcp?.sliceDescriptors?.().filter((descriptor) => !this.#hostPolicy!.previewDenial(\"mcp\", descriptor.name))\n : mcp?.sliceDescriptors?.();\n if (mcpDescriptors && mcpDescriptors.length > 0) {\n const byServer = new Map<string, Map<string, FabricNamedActionTypeSource>>();\n for (const descriptor of mcpDescriptors) {\n const server = descriptor.namespace;\n if (!server || server === \"management\" || descriptor.name.startsWith(\"$\")) continue;\n const prefix = `${server}.`;\n const toolName = descriptor.name.startsWith(prefix)\n ? descriptor.name.slice(prefix.length)\n : descriptor.name;\n let tools = byServer.get(server);\n if (!tools) {\n tools = new Map();\n byServer.set(server, tools);\n }\n // Teaching: the type gate checks programs against the compiled\n // schema, the same shape invoke validates against, so shape\n // mistakes surface before the sandbox runs.\n tools.set(toolName, {\n name: toolName,\n inputSchema: effectiveInputSchema(\n `mcp.${descriptor.name}`,\n descriptor.inputSchema,\n ) as Record<string, unknown>,\n });\n }\n if (byServer.size > 0) {\n sources.mcpServers = [...byServer.entries()].map(([server, tools]) => ({\n server,\n tools: [...tools.values()],\n }));\n }\n }\n const extensions = this.#providerBindings.current(\"extensions\")?.provider;\n if (extensions) {\n try {\n const descriptors = this.#policyActions((await this.#listProvider(extensions, {}, context)).map((descriptor) => ({ ...descriptor, provider: \"extensions\" })));\n if (descriptors.length > 0) {\n sources.extensionTools = descriptors.map((descriptor) => ({\n name: descriptor.name,\n inputSchema: effectiveInputSchema(\n `extensions.${descriptor.name}`,\n descriptor.inputSchema,\n ) as Record<string, unknown>,\n }));\n }\n } catch {\n // Capture catalog not ready yet; the loose extensions surface stands\n // for this execution.\n }\n }\n if (globals.length > 0) {\n const { code } = options;\n sources.providers = await Promise.all(globals.map((name) =>\n code === undefined || usesProviderGlobal(code, name)\n ? this.#providerTypeSource(name, context)\n : { provider: name, actions: [] }));\n }\n return sources;\n }\n\n // A provider that fails, stalls past the bound, or lists nothing still gets\n // its global, declared loosely: the global's existence never depends on a\n // transient listing, and the registry validates every call at dispatch.\n async #providerTypeSource(name: string, context: FabricInvocationContext): Promise<FabricProviderTypeSource> {\n const provider = this.#providerBindings.current(name)?.provider;\n if (!provider) return { provider: name, actions: [] };\n let timer: ReturnType<typeof setTimeout> | undefined;\n try {\n const descriptors = await Promise.race([\n this.#listProvider(provider, {}, context),\n new Promise<undefined>((resolve) => {\n const handle = setTimeout(() => resolve(undefined), PROVIDER_TYPE_SOURCE_TIMEOUT_MS);\n (handle as { unref?: () => void }).unref?.();\n timer = handle;\n }),\n ]);\n if (!Array.isArray(descriptors)) return { provider: name, actions: [] };\n const quarantined = activeQuarantinedRefNames();\n return {\n provider: name,\n actions: descriptors.flatMap((descriptor) => {\n if (!isPlainRecord(descriptor) || quarantined.has(`${name}.${String(descriptor.name)}`)) return [];\n if (this.#hostPolicy?.active && this.#hostPolicy.refDenial(name, String(descriptor.name))) return [];\n // Teaching: the type gate checks against the compiled schema,\n // the same shape invoke validates against.\n return actionTypeSource(\n descriptor.name,\n isPlainRecord(descriptor.inputSchema)\n ? effectiveInputSchema(`${name}.${descriptor.name}`, descriptor.inputSchema)\n : undefined,\n ) ?? [];\n }),\n };\n } catch {\n return { provider: name, actions: [] };\n } finally {\n if (timer) clearTimeout(timer);\n }\n }\n\n // The model-facing discovery view: quarantined refs hide here, and the\n // compiled overlay teaches: listed schemas show the compiled shape so\n // tightened enums are visible before the first call. Pass `declared: true`\n // for the compile's base-surface truth, which keeps quarantined refs\n // visible and schemas declared so base-digest proofs and artifact\n // carry-forward read the live contract. Capability-view paths stay\n // declared everywhere (see describe): committed views pin declared\n // digests, and a surface activation must never invalidate them.\n async listDetailed(\n request: FabricProviderListRequest & { provider?: string; declared?: boolean },\n context: FabricInvocationContext,\n include: (action: ResolvedFabricAction) => boolean = () => true,\n ): Promise<{ actions: ResolvedFabricAction[]; total: number; truncated: boolean }> {\n context = this.#scopeContext(context);\n if (context.capabilityView) {\n const refs = this.#policyRefs(this.#viewAuthority(context.capabilityView).bindings().map(binding => binding.ref))\n .filter((ref) => !request.provider || ref.startsWith(`${request.provider}.`))\n .filter((ref) => request.declared || !activeQuarantinedRefNames().has(ref))\n .sort();\n const actions = await Promise.all(refs.map((ref) => this.describe(ref, context)));\n const query = request.query?.normalize(\"NFKC\").trim().toLowerCase();\n const filtered = actions\n .filter((action) => !request.namespace || action.namespace === request.namespace)\n .filter((action) =>\n !query || `${action.ref} ${action.description}`.toLowerCase().includes(query),\n )\n .filter(include);\n const page = filtered.slice(0, fabricActionListLimit(request.limit));\n return { actions: page, total: filtered.length, truncated: filtered.length > page.length };\n }\n const providers = this.#policyProviders(request.provider\n ? [this.#requireProvider(request.provider)]\n : this.#providerBindings.providers());\n const lists = await Promise.all(\n providers.map(async (provider) => {\n // Provider enumeration is exhaustive; only the registry applies the\n // presentation limit, after visibility filtering and total counting.\n const enumeration: FabricProviderListRequest = {\n ...(request.namespace === undefined ? {} : { namespace: request.namespace }),\n ...(request.query === undefined ? {} : { query: request.query }),\n };\n const descriptors = await this.#listProvider(provider, enumeration, context);\n return descriptors\n .filter(\n (descriptor) =>\n request.declared ||\n !activeQuarantinedRefNames().has(`${provider.name}.${descriptor.name}`),\n )\n .map((descriptor) => {\n const action = resolveDescriptor(provider, descriptor);\n // Teaching: the listing carries the compiled schema. Declared\n // requests (the compile snapshot) keep the live contract.\n return request.declared\n ? action\n : {\n ...action,\n inputSchema: effectiveInputSchema(\n action.ref,\n action.inputSchema,\n ) as Record<string, unknown>,\n };\n });\n }),\n );\n const all = this.#policyActions(lists.flat()).filter(include);\n const page = all.slice(0, fabricActionListLimit(request.limit));\n return { actions: page, total: all.length, truncated: all.length > page.length };\n }\n async list(\n request: FabricProviderListRequest & { provider?: string; declared?: boolean },\n context: FabricInvocationContext,\n ): Promise<ResolvedFabricAction[]> {\n const { actions } = await this.listDetailed(request, context);\n return actions;\n }\n\n async catalog(\n context: FabricInvocationContext,\n options: {\n provider?: string;\n limit?: number;\n includeProvider?: (provider: string) => boolean;\n } = {},\n ): Promise<FabricCapabilityCatalog> {\n context = this.#scopeContext(context);\n const providers = (context.capabilityView\n ? [...new Map(\n this.#viewAuthority(context.capabilityView).bindings().flatMap((pinned) => {\n const binding = this.#providerBindings.binding(pinned.providerBindingId);\n return binding ? [[binding.name, binding.provider] as const] : [];\n }),\n ).values()]\n : options.provider\n ? [this.#requireProvider(options.provider)]\n : this.#providerBindings.providers())\n .filter((provider) => !options.provider || provider.name === options.provider)\n .filter((provider) => options.includeProvider?.(provider.name) ?? true)\n .filter((provider) => !this.#hostPolicy?.previewProviderHidden(provider.name))\n .sort((left, right) => left.name.localeCompare(right.name));\n const lists = await Promise.all(\n providers.map(async (provider) => ({\n provider,\n actions: context.capabilityView\n ? await this.list({ provider: provider.name, limit: 1_000 }, context)\n : (await this.#listProvider(provider, {}, context))\n .filter(\n (descriptor) =>\n !activeQuarantinedRefNames().has(`${provider.name}.${descriptor.name}`),\n )\n .map((descriptor) => resolveDescriptor(provider, descriptor)),\n })),\n ).then((entries) => entries.map(({ provider, actions }) => ({ provider, actions: this.#policyActions(actions) })));\n const allActions = lists.flatMap(({ actions }) => actions)\n .sort((left, right) => left.ref.localeCompare(right.ref));\n const limit = Math.max(1, Math.min(Math.floor(options.limit ?? 1_000), 1_000));\n const retainedRefs = new Set(allActions.slice(0, limit).map((action) => action.ref));\n const providerHeads = lists.map(({ provider, actions }) => {\n const actionHeads = actions\n .filter((action) => retainedRefs.has(action.ref))\n .sort((left, right) => left.ref.localeCompare(right.ref))\n .map((action) => ({\n key: `action:${action.ref}`,\n parentKey: `provider:${provider.name}`,\n ref: action.ref,\n name: action.name,\n description: action.description,\n descriptorHash: actionDescriptorHash(action),\n risk: action.risk,\n ...(action.namespace === undefined ? {} : { namespace: action.namespace }),\n ...(action.effect === undefined ? {} : { effect: action.effect }),\n }));\n return {\n key: `provider:${provider.name}`,\n parentKey: \"capability:fabric\",\n name: provider.name,\n description: provider.description,\n descriptorHash: descriptorHash({\n name: provider.name,\n description: provider.description,\n actions: actionHeads.map((action) => action.descriptorHash),\n }),\n actions: actionHeads,\n };\n });\n const indexedActions = providerHeads.reduce((total, provider) => total + provider.actions.length, 0);\n const rootHash = descriptorHash(providerHeads.map((provider) => provider.descriptorHash));\n return {\n kind: \"pi-fabric.capability-catalog\",\n version: 1,\n root: {\n key: \"capability:fabric\",\n name: \"Fabric capabilities\",\n description: context.capabilityView\n ? \"Committed provider and action metadata for this execution; not historical session evidence.\"\n : \"Current registered provider and action metadata for navigation; not historical session evidence.\",\n descriptorHash: rootHash,\n },\n providers: providerHeads,\n totalActions: allActions.length,\n indexedActions,\n complete: indexedActions === allActions.length,\n reasons: indexedActions === allActions.length ? [] : [\"action_limit\"],\n };\n }\n\n async search(\n query: string,\n context: FabricInvocationContext,\n limit = 30,\n ): Promise<ResolvedFabricAction[]> {\n const normalizedQuery = query.normalize(\"NFKC\").trim().toLowerCase();\n if (!normalizedQuery) return [];\n const listed = await this.list({ limit: 1_000 }, context);\n return listed\n .map((action) => ({\n action,\n score: scoreActionSearch(\n normalizedQuery,\n action,\n this.#providerBindings.current(action.provider)?.provider.description ?? \"\",\n ),\n }))\n .filter((entry) => entry.score > 0)\n .sort(\n (left, right) =>\n right.score - left.score || left.action.ref.localeCompare(right.action.ref),\n )\n .slice(0, Math.max(1, Math.min(limit, 100)))\n .map((entry) => entry.action);\n }\n\n async describe(ref: string, context: FabricInvocationContext): Promise<ResolvedFabricAction> {\n context = this.#scopeContext(context);\n if (ref.includes(\".\")) {\n const { provider, actionName, expectedDescriptorHash } = this.#parseRef(\n ref,\n context.capabilityView,\n );\n const resolved = await this.#resolveActionDescriptor(\n provider,\n actionName,\n context,\n context.capabilityView === undefined,\n );\n if (!resolved.action) {\n throw new FabricResolutionError(formatUnknownActionMessage(ref, resolved.suggestions));\n }\n const action = resolved.action;\n this.#assertResolvedAllowed(action);\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) {\n throw new FabricResolutionError(`Fabric capability descriptor changed: ${ref}`);\n }\n return action;\n }\n if (context.capabilityView) {\n const pinned = await Promise.all(\n this.#policyRefs(this.#viewAuthority(context.capabilityView).bindings().map(binding => binding.ref)).map((candidate) =>\n this.describe(candidate, context),\n ),\n );\n const matches = pinned.filter((action) => action.name === ref);\n if (matches.length === 1) return matches[0]!;\n if (matches.length > 1) {\n throw new Error(\n `\"${ref}\" matches ${matches.length} committed Fabric actions; qualify with provider.action: ` +\n matches.map((match) => match.ref).sort().join(\", \"),\n );\n }\n throw new FabricResolutionError(`Unknown Fabric action in committed view: ${ref}`);\n }\n // Bare action names (what typed calls pragmatically use): walk every\n // provider for a unique action-name match.\n const matches: ResolvedFabricAction[] = [];\n const declaredNames: string[] = [];\n for (const provider of this.#policyProviders(this.#providerBindings.providers())) {\n let descriptors: FabricActionDescriptor[];\n try {\n descriptors = await this.#listProvider(provider, {}, context);\n } catch {\n continue;\n }\n for (const descriptor of descriptors) {\n declaredNames.push(descriptor.name);\n if (descriptor.name === ref) matches.push(resolveDescriptor(provider, descriptor));\n }\n }\n matches.splice(0, matches.length, ...this.#policyActions(matches));\n if (matches.length === 1) return matches[0]!;\n if (matches.length > 1) {\n throw new Error(\n `\"${ref}\" matches ${matches.length} Fabric actions; qualify with provider.action: ` +\n matches.map((match) => match.ref).sort().join(\", \"),\n );\n }\n const repair = repairActionName(declaredNames, ref);\n throw new FabricResolutionError(formatUnknownActionMessage(ref, repair.suggestions));\n }\n\n async acquireScoped(\n ref: string,\n args: Record<string, unknown>,\n context: FabricInvocationContext & Partial<Pick<FabricRegistryInvocationContext, \"authorize\" | \"approve\">>,\n adopt?: ProviderOperation[\"adopt\"],\n ): Promise<FabricScopedProviderResult> {\n context = this.#scopeContext(context);\n args = snapshotArguments(args);\n const { binding, provider, actionName, expectedDescriptorHash } = this.#parseRef(\n ref,\n context.capabilityView,\n );\n context = this.#bindingContext(binding, context);\n const endInvocation = this.#providerBindings.beginInvocation(binding.id);\n const releaseBinding = this.#providerBindings.retain([binding.id]);\n try {\n const resolved = await this.#resolveActionDescriptor(\n provider,\n actionName,\n context,\n context.capabilityView === undefined,\n );\n if (!resolved.action) {\n throw new FabricResolutionError(formatUnknownActionMessage(ref, resolved.suggestions));\n }\n const action = resolved.action;\n this.#assertResolvedAllowed(action);\n const providerActionName = resolved.repairedFrom === undefined ? actionName : action.name;\n const authority = { ref: action.ref, descriptor: actionDescriptorHash(action) };\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) {\n throw new FabricResolutionError(`Fabric capability descriptor changed: ${ref}`);\n }\n if (action.effect?.kind !== \"scoped\") {\n throw new Error(`Fabric action is not a scoped acquisition: ${ref}`);\n }\n if (!provider.acquire) {\n throw new Error(`Fabric provider does not implement scoped acquisition: ${provider.name}`);\n }\n // Supervised callers may supply the same policy hooks as invoke. Base\n // contexts remain supported; their host owns authorization/approval.\n if (context.authorize) {\n await runAbortable(context.signal, () => context.authorize!(structuredClone(action)));\n }\n const effectiveSchema = effectiveInputSchema(\n action.ref,\n action.inputSchema,\n ) as Record<string, unknown>;\n const catalogInput = repairCatalogInput(action.ref, effectiveSchema, args);\n const preparedArgs = provider.prepareArguments\n ? await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.prepareArguments!(providerActionName, catalogInput.args, context)),\n )\n : catalogInput.args;\n if (typeof preparedArgs !== \"object\" || preparedArgs === null || Array.isArray(preparedArgs)) {\n throw new Error(`Argument preparation for ${ref} did not return an object`);\n }\n const catalog = validateCatalogArgs(\n action.ref,\n effectiveSchema,\n // Preparation may return provider-held nested references. Detach before\n // validation and never expose this validated snapshot to policy hooks.\n snapshotArguments(preparedArgs),\n catalogInput.observedUnexpected,\n );\n if (catalog.invalid) throw new Error(`Invalid arguments for ${ref}: ${catalog.invalid}`);\n if (context.approve) {\n await runAbortable(context.signal, () => context.approve!(structuredClone(action), snapshotArguments(catalog.args)));\n }\n const acquired = await runAbortable(context.signal, () =>\n this.#runPlanned(binding, providerActionName, authority, \"acquire\", catalog.args, context, undefined, adopt),\n ) as FabricScopedProviderResult;\n throwIfAborted(context.signal);\n if (!acquired || typeof acquired.dispose !== \"function\") {\n throw new Error(`Scoped acquisition ${ref} did not return a disposer`);\n }\n return { value: acquired.value, dispose: acquired.dispose };\n } finally {\n void endInvocation().catch(() => undefined);\n // The interpreter owns the returned resource lease. This temporary hold\n // protects resolution/acquisition only; cancellation must not await close.\n void releaseBinding().catch(() => undefined);\n }\n }\n\n async invoke(\n ref: string,\n args: Record<string, unknown>,\n context: FabricRegistryInvocationContext,\n ): Promise<unknown> {\n context = this.#scopeContext(context);\n args = snapshotArguments(args);\n const traceOperation = context.traceOperation ?? context.trace?.issueCall(ref, snapshotArguments(args));\n let failureStage: \"resolve\" | \"guard\" | \"prepare\" | \"validate\" | \"approve\" | \"invoke\" = \"resolve\";\n let audit: FabricCallAudit | undefined;\n let invocationActive = false;\n let endBindingInvocation: (() => Promise<void>) | undefined;\n try {\n const { binding, provider, actionName, expectedDescriptorHash } = this.#parseRef(\n ref,\n context.capabilityView,\n );\n context = this.#bindingContext(binding, context);\n endBindingInvocation = this.#providerBindings.beginInvocation(binding.id);\n const resolved = await this.#resolveActionDescriptor(\n provider,\n actionName,\n context,\n context.capabilityView === undefined,\n );\n if (!resolved.action) {\n throw new FabricResolutionError(formatUnknownActionMessage(ref, resolved.suggestions));\n }\n const action = resolved.action;\n this.#assertResolvedAllowed(action);\n const providerActionName = resolved.repairedFrom === undefined ? actionName : action.name;\n const authority = { ref: action.ref, descriptor: actionDescriptorHash(action) };\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) {\n throw new FabricResolutionError(`Fabric capability descriptor changed: ${ref}`);\n }\n traceOperation?.resolved(action.provider, action.name);\n\n failureStage = \"guard\";\n if (action.effect?.kind === \"scoped\") {\n throw new FabricTraceSafeError(\n `Fabric scoped action ${ref} requires a supervised acquisition context`,\n );\n }\n if (context.authorize) {\n await runAbortable(context.signal, () => context.authorize!(structuredClone(action)));\n }\n\n failureStage = \"prepare\";\n const effectiveSchema = effectiveInputSchema(\n action.ref,\n action.inputSchema,\n ) as Record<string, unknown>;\n const catalogInput = repairCatalogInput(action.ref, effectiveSchema, args);\n const preparedArgs = provider.prepareArguments\n ? await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.prepareArguments!(providerActionName, catalogInput.args, context)),\n )\n : catalogInput.args;\n if (typeof preparedArgs !== \"object\" || preparedArgs === null || Array.isArray(preparedArgs)) {\n throw new FabricTraceSafeError(`Argument preparation for ${ref} did not return an object`);\n }\n\n failureStage = \"validate\";\n const catalog = validateCatalogArgs(\n action.ref,\n effectiveSchema,\n // Preparation may return provider-held nested references. Detach before\n // validation and never expose this validated snapshot to policy hooks.\n snapshotArguments(preparedArgs),\n catalogInput.observedUnexpected,\n );\n traceOperation?.prepared(snapshotArguments(catalog.args));\n if (catalog.normalization) traceOperation?.normalized(structuredClone(catalog.normalization));\n // TypeBox validator messages describe schema expectations only \u2014 they\n // never echo argument values \u2014 so they are safe for durable traces.\n if (catalog.invalid) {\n // A validate-rejected attempt is in-domain evidence against the\n // effective surface, but rejected argument values are untrusted\n // input and never enter the durable record. The trace-safe feed\n // persists only values the live schema's own enums declare: for a\n // closed-domain parameter the refused value is already the author's\n // public vocabulary, so the observation pool can carry it and a\n // later reset (base drift or review) re-derives with it included.\n // Values outside the declared enums (typos, payloads) drop here,\n // the same pre-birth rule the derivation applies.\n const declaredSchema = action.inputSchema;\n const declaredProperties =\n typeof declaredSchema === \"object\" &&\n declaredSchema !== null &&\n !Array.isArray(declaredSchema) &&\n typeof (declaredSchema as Record<string, unknown>).properties === \"object\" &&\n (declaredSchema as Record<string, unknown>).properties !== null\n ? ((declaredSchema as Record<string, unknown>).properties as Record<string, unknown>)\n : undefined;\n const attemptArgs: Record<string, unknown> = {};\n for (const [key, value] of Object.entries(catalog.args)) {\n const property = declaredProperties ? declaredProperties[key] : undefined;\n const declaredEnum =\n typeof property === \"object\" && property !== null\n ? (property as Record<string, unknown>).enum\n : undefined;\n if (!Array.isArray(declaredEnum)) continue;\n if (\n typeof value !== \"string\" &&\n typeof value !== \"number\" &&\n typeof value !== \"boolean\"\n ) {\n continue;\n }\n if (String(value).length > MAX_AUDIT_VALUE_CHARS) continue;\n if (!declaredEnum.includes(value)) continue;\n attemptArgs[key] = value;\n }\n if (Object.keys(attemptArgs).length > 0) {\n const attempt: FabricCallAudit = {\n ref,\n nestedToolCallId: `${NESTED_TOOL_CALL_ID_PREFIX}${randomUUID()}`,\n startedAt: Date.now(),\n tool: action.name,\n provider: action.provider,\n args: attemptArgs,\n success: false,\n error: `Invalid arguments for ${ref}: ${catalog.invalid}`,\n endedAt: Date.now(),\n ...(resolved.repairedFrom !== undefined\n ? { repairedFrom: resolved.repairedFrom }\n : {}),\n };\n context.audits.push(attempt);\n }\n throw new FabricTraceSafeError(`Invalid arguments for ${ref}: ${catalog.invalid}`);\n }\n\n failureStage = \"approve\";\n await runAbortable(context.signal, () => context.approve(structuredClone(action), snapshotArguments(catalog.args)));\n\n failureStage = \"invoke\";\n const nestedToolCallId = `${NESTED_TOOL_CALL_ID_PREFIX}${randomUUID()}`;\n const effect = action.effect!;\n const effectConflicts = [...this.#activeEffects.values()].flatMap((active) => {\n const conflict = conflictBetween(effect, active.effect);\n return conflict ? [{ withRef: active.ref, ...conflict }] : [];\n }).slice(0, 32);\n if (effectConflicts.length > 0 && context.effectPolicy === \"strict\") {\n failureStage = \"guard\";\n throw new FabricTraceSafeError(\n `Fabric effect conflict for ${ref}: ${effectConflicts\n .map((conflict) => formatFabricEffectConflict(\n conflict.withRef,\n conflict.resources,\n conflict.reason,\n ))\n .join(\"; \")}`,\n );\n }\n const argsPreview = previewArgs(ref, catalog.args);\n const activeAudit: FabricCallAudit = {\n ref,\n nestedToolCallId,\n startedAt: Date.now(),\n tool: action.name,\n provider: action.provider,\n args: boundedPreviewValue(\n argsPreview,\n MAX_AUDIT_VALUE_CHARS,\n ) as Record<string, unknown>,\n ...(effectConflicts.length > 0 ? { effectConflicts } : {}),\n ...(resolved.repairedFrom !== undefined\n ? { repairedFrom: resolved.repairedFrom }\n : {}),\n };\n audit = activeAudit;\n invocationActive = true;\n context.audits.push(activeAudit);\n context.observeInvocation?.({\n type: \"call_start\",\n callId: nestedToolCallId,\n ref,\n args: argsPreview,\n });\n context.update(`Calling ${ref}`);\n this.#activeEffects.set(nestedToolCallId, { ref, effect });\n let servedFromSpeculation = false;\n let providerValue: unknown;\n let providerInvoked = false;\n try {\n if (this.#speculation && this.#allowsSpeculation(action)) {\n const served = await runAbortable(context.signal, () =>\n this.#speculation!.tryServe(context.parentToolCallId, ref, snapshotArguments(catalog.args), JSON.stringify([binding.id, authority.descriptor, context.capabilityView?.id ?? null, context.scope?.digest ?? null, context.nativeToolResult === true])));\n if (served.hit) {\n providerValue = await runAbortable(context.signal, () => this.#runPlanned(binding, providerActionName, authority, \"replay\", catalog.args, context, served.value));\n servedFromSpeculation = true;\n activeAudit.speculated = true;\n if (served.replay.updatedArgs !== undefined) {\n const replayedPreview = previewArgs(ref, served.replay.updatedArgs);\n activeAudit.args = boundedPreviewValue(\n replayedPreview,\n MAX_AUDIT_VALUE_CHARS,\n ) as Record<string, unknown>;\n traceOperation?.prepared(snapshotArguments(served.replay.updatedArgs));\n context.observeInvocation?.({\n type: \"call_args\",\n callId: nestedToolCallId,\n args: replayedPreview,\n });\n }\n if (served.replay.media?.length) {\n activeAudit.media = [...(activeAudit.media ?? []), ...served.replay.media];\n if (served.replay.mediaNote) activeAudit.mediaNote = served.replay.mediaNote;\n }\n if (served.replay.preview !== undefined) activeAudit.preview = served.replay.preview;\n if (served.replay.terminate) activeAudit.terminate = true;\n }\n }\n if (!servedFromSpeculation) {\n providerInvoked = true;\n providerValue = await runAbortable(context.signal, () =>\n this.#runPlanned(binding, providerActionName, authority, \"invoke\", catalog.args, {\n ...context,\n nestedToolCallId,\n update(message) {\n if (!invocationActive) return;\n context.update(message);\n context.observeInvocation?.({\n type: \"call_update\",\n callId: nestedToolCallId,\n update: { type: \"progress\", message },\n });\n },\n activity(update) {\n if (!invocationActive) return;\n context.activity?.(update);\n context.observeInvocation?.({\n type: \"call_update\",\n callId: nestedToolCallId,\n update,\n });\n },\n attachMedia(blocks, note) {\n if (!invocationActive) return;\n if (!activeAudit.media) activeAudit.media = [];\n for (const block of blocks) activeAudit.media.push(block);\n if (note) activeAudit.mediaNote = note;\n },\n updateArguments(updatedArgs) {\n if (!invocationActive) return;\n const updatedPreview = previewArgs(ref, updatedArgs);\n activeAudit.args = boundedPreviewValue(\n updatedPreview,\n MAX_AUDIT_VALUE_CHARS,\n ) as Record<string, unknown>;\n traceOperation?.prepared(snapshotArguments(updatedArgs));\n context.observeInvocation?.({\n type: \"call_args\",\n callId: nestedToolCallId,\n args: updatedPreview,\n });\n },\n attachPreview(preview) {\n if (!invocationActive) return;\n activeAudit.preview = preview;\n },\n requestTerminate() {\n if (!invocationActive) return;\n activeAudit.terminate = true;\n },\n }).finally(() => {\n if (effect.kind !== \"none\") this.#speculation?.bumpEpoch();\n this.#activeEffects.delete(nestedToolCallId);\n }),\n );\n }\n } finally {\n if (!providerInvoked) this.#activeEffects.delete(nestedToolCallId);\n }\n const value = this.toolResultProxy\n ? await runAbortable(context.signal, () => this.toolResultProxy!.proxy({\n action,\n args: snapshotArguments(catalog.args),\n toolCallId: nestedToolCallId,\n parentToolCallId: context.parentToolCallId,\n value: providerValue,\n ...(context.signal ? { signal: context.signal } : {}),\n }))\n : providerValue;\n const bounded = action.ref === \"jev.decide\"\n ? strictDecisionResult(value)\n : boundedResult(value, context.maxResultChars);\n const resultError = failedResultError(value);\n activeAudit.success = resultError === undefined;\n if (resultError) activeAudit.error = resultError;\n activeAudit.resultChars = bounded.chars;\n activeAudit.resultTruncated = bounded.truncated;\n const resultPreview = previewResult(bounded.value);\n activeAudit.result = boundedPreviewValue(resultPreview, MAX_AUDIT_VALUE_CHARS);\n activeAudit.endedAt = Date.now();\n context.observeInvocation?.({\n type: \"call_end\",\n callId: nestedToolCallId,\n success: resultError === undefined,\n result: resultPreview,\n ...(activeAudit.preview !== undefined ? { preview: activeAudit.preview } : {}),\n ...(resultError ? { error: resultError } : {}),\n });\n if (resultError) {\n traceOperation?.fail(\"invoke\", resultError, failedResultOutcome(value), bounded.value, {\n resultTruncated: bounded.truncated,\n });\n } else {\n traceOperation?.succeed(bounded.value, { resultTruncated: bounded.truncated });\n }\n throwIfAborted(context.signal);\n return bounded.value;\n } catch (error) {\n const message = error instanceof Error ? error.message : String(error);\n traceOperation?.fail(failureStage, error, executionOutcomeFromError(error, context.signal));\n if (audit) {\n audit.success = false;\n audit.error = message;\n audit.endedAt = Date.now();\n context.observeInvocation?.({\n type: \"call_end\",\n callId: audit.nestedToolCallId,\n success: false,\n error: audit.error,\n });\n }\n throw error;\n } finally {\n invocationActive = false;\n if (audit) audit.endedAt ??= Date.now();\n void endBindingInvocation?.().catch(() => undefined);\n }\n }\n\n /**\n * Prepare + pre-launch a speculative call discovered in a partially\n * streamed program (see src/speculation). Pure pipeline only: descriptor\n * resolution, the eligibility gate on the resolved action, argument\n * preparation, and schema validation. The compiled entropy surface gates\n * launches too: quarantined refs never pre-launch and overlays validate\n * prepared arguments, so the store never warms a call the serve path\n * would reject. authorize/approve/audits are skipped\n * because the eligibility gate restricts this path to actions that never\n * prompt, and the real call re-runs the full pipeline on a serve miss.\n * Side-channel outputs are captured into `replay` so the serve path can\n * project them into the real audit.\n */\n async speculate(\n ref: string,\n args: Record<string, unknown>,\n context: FabricInvocationContext,\n replay: FabricSpeculationReplay,\n ): Promise<\n | {\n preparedArgs: Record<string, unknown>;\n bindingToken: string;\n execute(signal: AbortSignal | undefined): Promise<unknown>;\n }\n | undefined\n > {\n if (!this.#speculationEligibility) return undefined;\n try {\n context = this.#scopeContext(context);\n args = snapshotArguments(args);\n const { binding, provider, actionName, expectedDescriptorHash } = this.#parseRef(\n ref,\n context.capabilityView,\n );\n context = this.#bindingContext(binding, context);\n const descriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(actionName, context)));\n if (!descriptor) return undefined;\n const action = resolveDescriptor(provider, descriptor);\n if (this.#hostPolicy?.refDenial(action.provider, action.name)) return undefined;\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) {\n return undefined;\n }\n if (isActiveQuarantine(provider.name, actionName, descriptor.inputSchema)) {\n return undefined;\n }\n const authority = { ref: action.ref, descriptor: actionDescriptorHash(action) };\n if (!this.#allowsSpeculation(action)) return undefined;\n const effectiveSchema = effectiveInputSchema(\n action.ref,\n action.inputSchema,\n ) as Record<string, unknown>;\n const catalogInput = applyActiveArgRepairs(action.ref, args, effectiveSchema);\n const preparedArgs = provider.prepareArguments\n ? await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.prepareArguments!(action.name, catalogInput, context)))\n : catalogInput;\n if (\n typeof preparedArgs !== \"object\" ||\n preparedArgs === null ||\n Array.isArray(preparedArgs)\n ) {\n return undefined;\n }\n const repairedArgs = normalizeActiveArguments(action.ref, effectiveSchema,\n applyActiveArgRepairs(action.ref, snapshotArguments(preparedArgs), effectiveSchema),\n ).args;\n if (validationMessage(effectiveSchema, repairedArgs)) return undefined;\n const nestedToolCallId = `${NESTED_TOOL_CALL_ID_PREFIX}spec-${randomUUID()}`;\n const execute = await this.#preparePlanned(binding, action.name, authority, \"speculate\", repairedArgs, this.#bindingContext(binding, {\n ...context, nestedToolCallId, update() {}, activity() {},\n attachMedia(blocks, note) { replay.media = [...(replay.media ?? []), ...blocks]; if (note) replay.mediaNote = note; },\n updateArguments(updatedArgs) { replay.updatedArgs = updatedArgs; },\n attachPreview(preview) { replay.preview = preview; },\n requestTerminate() { replay.terminate = true; },\n }));\n return {\n get preparedArgs() { return snapshotArguments(repairedArgs); },\n bindingToken: JSON.stringify([binding.id, authority.descriptor, context.capabilityView?.id ?? null, context.scope?.digest ?? null, context.nativeToolResult === true]),\n execute: async signal => {\n const combined = AbortSignal.any([context.signal!, ...(signal ? [signal] : [])]);\n const actual = execute(combined);\n void actual.catch(() => undefined);\n return runAbortable(combined, () => actual);\n },\n };\n } catch {\n // Speculation degrades silently; the real call runs the full pipeline.\n return undefined;\n }\n }\n\n async endInvocation(parentToolCallId: string, timeoutMs = 1_000): Promise<void> {\n this.#speculation?.onInvocationEnd?.(parentToolCallId);\n const providers = new Set(\n this.#providerBindings.entries().map((binding) => binding.provider),\n );\n const finalizers = [...providers].flatMap((provider) =>\n provider.invocationEnded\n ? [this.#providerBindings.trackProvider(provider, () => provider.invocationEnded!(parentToolCallId), true)]\n : [],\n );\n await settleWithin(finalizers, timeoutMs);\n }\n\n /** Revocation is distinct from rolling withdrawal: pinned old generations may\n * survive retirement, but revoked bindings admit no further work. */\n revokeProvider(name: string): void {\n const binding = this.#providerBindings.current(name);\n if (binding) this.#providerBindings.revoke(binding.id);\n }\n\n providerStatus(): Array<{ name: string; generation: number; state: string; inFlight: number; revoked: boolean; error?: string }> {\n return this.#providerBindings.entries().map(binding => ({ name: binding.name, generation: binding.generation, state: binding.state,\n inFlight: binding.inFlight, revoked: this.#providerBindings.signal(binding.id).aborted,\n ...(binding.closeError ? { error: binding.closeError } : {}) }));\n }\n\n async close(excludedProviderNames: Set<string> = new Set()): Promise<void> {\n this.#shutdown.abort(new Error(\"Fabric registry closed\"));\n try {\n if (this.#operations) await (await this.#operations).close();\n } finally {\n await this.#providerBindings.close(excludedProviderNames);\n }\n }\n\n\n async #resolveCapabilities(\n requirements: readonly (string | FabricCapabilityRequirement)[],\n context: FabricInvocationContext,\n retain: boolean,\n ): Promise<FabricCapabilityViewLease> {\n context = this.#scopeContext(context);\n const normalized = new Map<string, boolean>();\n for (const requirement of requirements) {\n const ref = (typeof requirement === \"string\" ? requirement : requirement.ref).trim();\n if (!ref || ref.length > 256 || !ref.includes(\".\")) {\n throw new Error(`Fabric capability requirements must use provider.action: ${ref || \"<empty>\"}`);\n }\n const optional = typeof requirement === \"string\" ? false : requirement.optional === true;\n normalized.set(ref, (normalized.get(ref) ?? true) && optional);\n }\n\n const missing: string[] = [];\n const optionalMissing: string[] = [];\n const resolved = new Map<string, FabricCapabilityBindingView>();\n const temporaryReleases: Array<() => Promise<void>> = [];\n let permanentRelease: (() => Promise<void>) | undefined;\n try {\n for (const [ref, optional] of [...normalized].sort(([left], [right]) =>\n left.localeCompare(right),\n )) {\n try {\n const { binding, provider, actionName, expectedDescriptorHash } = this.#parseRef(ref, context.capabilityView);\n const release = this.#providerBindings.retain([binding.id]);\n temporaryReleases.push(release);\n const descriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(actionName, context)),\n );\n if (!descriptor) throw new FabricResolutionError(`Unknown Fabric action: ${ref}`);\n const action = resolveDescriptor(provider, descriptor);\n if (expectedDescriptorHash && actionDescriptorHash(action) !== expectedDescriptorHash) throw new FabricResolutionError(`Committed capability drifted: ${ref}`);\n resolved.set(ref, {\n ref,\n provider: provider.name,\n providerBindingId: binding.id,\n generation: binding.generation,\n descriptorHash: actionDescriptorHash(action),\n });\n } catch (error) {\n if (!(error instanceof FabricResolutionError)) throw error;\n (optional ? optionalMissing : missing).push(ref);\n }\n }\n\n let view: FabricCommittedCapabilityView | undefined;\n if (missing.length === 0) {\n // Resolution awaited provider code: recheck the parent immediately\n // before deriving, even for an empty/optional-only child. Never derive\n // from the public view's presentation fields.\n throwIfAborted(context.signal);\n const values = [...resolved.values()];\n const authority = context.capabilityView\n ? this.#viewAuthority(context.capabilityView).derive(values)\n : CapabilityAuthority.issue(values);\n if (!authority.active) throw new FabricResolutionError(\"Fabric capability view is unissued, released, or revoked\");\n const bindings = Object.fromEntries(authority.bindings().map(value => [value.ref, value]));\n if (retain) permanentRelease = this.#providerBindings.retain(\n values.map((binding) => binding.providerBindingId),\n );\n for (const value of Object.values(bindings)) Object.freeze(value);\n view = Object.freeze({\n id: randomUUID(),\n digest: descriptorHash(values),\n semanticDigest: descriptorHash(\n values.map(({ ref, provider, descriptorHash: hash }) => ({\n ref,\n provider,\n descriptorHash: hash,\n })),\n ),\n bindings: Object.freeze(bindings),\n });\n const controller = new AbortController();\n const parent = context.capabilityView ? this.#requireView(context.capabilityView) : undefined;\n const signal = AbortSignal.any([this.#shutdown.signal, controller.signal, ...(parent ? [parent] : [])]);\n this.#views.set(view, { controller, signal, authority });\n const revoked = () => {\n authority.release();\n const release = permanentRelease;\n permanentRelease = undefined;\n void release?.().catch(() => undefined);\n };\n signal.addEventListener(\"abort\", revoked, { once: true });\n if (signal.aborted) revoked();\n }\n return {\n satisfied: missing.length === 0,\n missing,\n optionalMissing,\n ...(view ? { view } : {}),\n release: async () => {\n const release = permanentRelease;\n permanentRelease = undefined;\n if (view) this.#views.get(view)?.controller.abort(new Error(\"Fabric capability view released\"));\n await release?.();\n },\n };\n } finally {\n await Promise.allSettled(temporaryReleases.map((release) => release()));\n }\n }\n\n async #declaredActionNames(\n provider: FabricProvider,\n context: FabricInvocationContext,\n ): Promise<string[]> {\n try {\n const descriptors = await this.#listProvider(provider, {}, context);\n return descriptors.map((descriptor) => descriptor.name);\n } catch {\n return [];\n }\n }\n\n // Resolve a provider action descriptor, repairing a near-miss action name\n // (mirroring arg-normalization's prepare-stage argument repair) when the\n // caller is not pinned to a committed capability view. Committed views are\n // exact contracts: a pinned miss keeps the plain resolution error.\n async #resolveActionDescriptor(\n provider: FabricProvider,\n actionName: string,\n context: FabricInvocationContext,\n allowRepair: boolean,\n ): Promise<{ action?: ResolvedFabricAction; suggestions: string[]; repairedFrom?: string }> {\n const descriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(actionName, context)),\n );\n // A quarantined ref resolves as unknown: the model-facing catalog never\n // shows it, and a direct call gets the standard not-found message with\n // suggestions, exactly like any retired action.\n if (descriptor && !isActiveQuarantine(provider.name, actionName, descriptor.inputSchema)) {\n return {\n action: resolveDescriptor(provider, descriptor),\n suggestions: [],\n ...(descriptor.name !== actionName ? { repairedFrom: actionName } : {}),\n };\n }\n if (!allowRepair) return { suggestions: [] };\n const declared = (await this.#declaredActionNames(provider, context)).filter(\n (name) => !activeQuarantinedRefNames().has(`${provider.name}.${name}`),\n );\n const catalogName = applyActiveActionName(provider.name, actionName, declared);\n if (catalogName !== actionName) {\n const catalogDescriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(catalogName, context)),\n );\n if (catalogDescriptor) {\n return {\n action: resolveDescriptor(provider, catalogDescriptor),\n suggestions: [],\n repairedFrom: actionName,\n };\n }\n }\n const repair = repairActionName(declared, actionName);\n const compiler = getActiveRepairCompiler();\n if (repair.repaired !== undefined) {\n compiler?.observeUnknownAction(provider.name, actionName, declared, {\n countError: false,\n });\n const repairedDescriptor = await runAbortable(context.signal, () =>\n this.#providerBindings.trackProvider(provider, () => provider.describe(repair.repaired!, context)),\n );\n if (repairedDescriptor) {\n return {\n action: resolveDescriptor(provider, repairedDescriptor),\n suggestions: [],\n repairedFrom: actionName,\n };\n }\n compiler?.recordInvocationError();\n } else {\n compiler?.observeUnknownAction(provider.name, actionName, declared);\n }\n return {\n suggestions: repair.suggestions.map((name) => `${provider.name}.${name}`),\n };\n }\n\n #parseRef(\n ref: string,\n view?: FabricCommittedCapabilityView,\n ): {\n binding: FabricProviderBinding;\n provider: FabricProvider;\n actionName: string;\n expectedDescriptorHash?: string;\n } {\n if (view) this.#requireView(view);\n const separator = ref.indexOf(\".\");\n if (separator <= 0 || separator === ref.length - 1) {\n throw new Error(`Fabric action references must use provider.action: ${ref}`);\n }\n const providerName = ref.slice(0, separator);\n // The sealed host policy decides from the ref as written, before any\n // provider code (describe, list or prepareArguments) runs for a refused\n // action. Callers decide again on the resolved name with\n // #assertResolvedAllowed, because resolution can repair the name.\n const hostDenial = this.#hostPolicy?.refDenial(providerName, ref.slice(separator + 1));\n if (hostDenial) throw new FabricResolutionError(hostDenial);\n const pinned = view ? this.#viewAuthority(view).resolve(ref) : undefined;\n if (view && !pinned) {\n throw new FabricResolutionError(`Fabric capability is outside the committed view: ${ref}`);\n }\n const binding = pinned\n ? this.#providerBindings.binding(pinned.providerBindingId)\n : this.#providerBindings.current(providerName);\n if (!binding || binding.name !== providerName || (pinned && (pinned.generation !== binding.generation || pinned.provider !== providerName || pinned.ref !== ref))) {\n if (pinned) {\n throw new FabricResolutionError(\n `Fabric capability binding is no longer available: ${ref} (${pinned.providerBindingId})`,\n );\n }\n this.#requireProvider(providerName);\n throw new FabricResolutionError(`Unknown Fabric provider: ${providerName}`);\n }\n return {\n binding,\n provider: binding.provider,\n actionName: ref.slice(separator + 1),\n ...(pinned ? { expectedDescriptorHash: pinned.descriptorHash } : {}),\n };\n }\n\n #requireView(view: FabricCommittedCapabilityView): AbortSignal {\n const owned = this.#views.get(view);\n if (!owned || owned.signal.aborted || !owned.authority.active) throw new FabricResolutionError(\"Fabric capability view is unissued, released, or revoked\");\n return owned.signal;\n }\n\n #viewAuthority(view: FabricCommittedCapabilityView): CapabilityAuthority {\n this.#requireView(view);\n return this.#views.get(view)!.authority;\n }\n\n #scopeContext<T extends FabricInvocationContext>(context: T): T {\n const view = context.capabilityView ? this.#requireView(context.capabilityView) : undefined;\n throwIfAborted(context.signal);\n if (this.#shutdown.signal.aborted) throw new FabricResolutionError(\"Fabric registry is closed\");\n // Host-issued scope (src/scope.ts) replaces any caller value; failed issuance refuses every call.\n const issued = (globalThis as Record<symbol, { scope?: FabricScope; error?: string } | undefined>)[SCOPE_HOLDER];\n if (issued?.error) throw new FabricResolutionError(`Fabric scope issuance failed; provider calls are refused: ${issued.error}`);\n const scoped = { ...context, signal: AbortSignal.any([this.#shutdown.signal, ...(context.signal ? [context.signal] : []), ...(view ? [view] : [])]) };\n if (issued?.scope) scoped.scope = issued.scope;\n else delete scoped.scope;\n return scoped;\n }\n\n #bindingContext<T extends FabricInvocationContext>(binding: FabricProviderBinding, context: T): T {\n return { ...context, signal: AbortSignal.any([this.#providerBindings.signal(binding.id), ...(context.signal ? [context.signal] : [])]) };\n }\n\n async #preparePlanned(binding: FabricProviderBinding, actionName: string, authority: { ref: string; descriptor: string }, mode: ProviderOperation[\"mode\"], args: Record<string, unknown>, context: FabricInvocationContext, replayValue?: unknown, adopt?: ProviderOperation[\"adopt\"]): Promise<(signal?: AbortSignal) => Promise<unknown>> {\n const payload = snapshotArguments(args);\n this.#operations ??= import(\"./provider-operations.js\").then(({ ProviderOperations }) => new ProviderOperations(this.#providerBindings));\n return (await this.#operations).prepare({ binding, action: actionName, ...authority, mode, args: payload, context, replayValue, ...(adopt ? { adopt } : {}),\n observe: async observedContext => {\n const descriptor = await binding.provider.describe(actionName, observedContext);\n if (!descriptor) return { ref: \"\", descriptor: \"\" };\n const action = resolveDescriptor(binding.provider, descriptor);\n return { ref: action.ref, descriptor: actionDescriptorHash(action) };\n },\n });\n }\n\n #runPlanned(binding: FabricProviderBinding, actionName: string, authority: { ref: string; descriptor: string }, mode: ProviderOperation[\"mode\"], args: Record<string, unknown>, context: FabricInvocationContext, replayValue?: unknown, adopt?: ProviderOperation[\"adopt\"]): Promise<unknown> {\n return this.#providerBindings.track(binding.id, async () => {\n const execute = await this.#preparePlanned(binding, actionName, authority, mode, args, context, replayValue, adopt);\n return execute();\n });\n }\n\n #requireProvider(name: string): FabricProvider {\n const provider = this.#providerBindings.current(name)?.provider;\n if (provider) return provider;\n const unavailableReason = this.#unavailable.get(name) ?? this.#unavailableResolver?.(name);\n if (unavailableReason) {\n throw new FabricResolutionError(\n `Fabric provider \"${name}\" is unavailable: ${unavailableReason}`,\n );\n }\n const registered = this.#providerBindings.providers()\n .map((provider) => provider.name)\n .sort((left, right) => left.localeCompare(right));\n throw new FabricResolutionError(\n `Unknown Fabric provider: ${name}` +\n (registered.length > 0 ? ` (registered providers: ${registered.join(\", \")})` : \"\"),\n );\n }\n}\n", "// Generated by scripts/verified-kernels.ts from proofs/resources.ts with gdp-wired@0.31.1. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $m(v, what) { if (!(v instanceof Map)) throw new RangeError(what + ' must be a Map of naturals'); for (const [key, x] of v) { $n(key, 'a key of ' + what); $n(x, 'a cell of ' + what); } return v; }\nfunction $keys(maps, names) { const keys = new Set(); let past = 0; for (const c of Object.values(maps)) for (const key of c.keys()) past = Math.max(past, key + 1); for (const n of names) for (const key of maps[n].keys()) keys.add(key); return [...keys, past]; }\nfunction $breaks(maps, reads, cmps) { const p = new Set([0]); for (const [n, d, minus] of reads) { for (const s of maps[n].keys()) { if (minus) p.add(s + d); else if (s >= d) p.add(s - d); } if (minus) p.add(d); } for (const [v, d, minus] of cmps) { if (minus) { p.add(v + d); p.add(d); } else if (v >= d) p.add(v - d); } const keys = new Set(); for (const q of p) for (let i = -1; i <= 2; i++) if (q + i >= 0) keys.add(q + i); const sorted = [...keys].sort((a, b) => a - b); sorted.push(sorted[sorted.length - 1] + 1); return sorted; }\nfunction $every(keys, f) { const past = keys[keys.length - 1], d = f(past), cells = new Map(); for (let i = 0; i < keys.length - 1; i++) { const v = f(keys[i]); if (v !== d) cells.set(keys[i], v); } return {cells, d}; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\nfunction $join(ks, x, y, f) { const by = new Map(); for (const k1 of ks) { const v = y(k1), l = by.get(v); if (l) l.push(k1); else by.set(v, [k1]); } return ks.every(k => { const l = by.get(x(k)); return l === undefined || l.every(k1 => f(k, k1)); }); }\nfunction $spread(keys, n) { const out = new Set(); for (const k of keys) for (let i = 0; i < n; i++) out.add(k + i); return [...out].sort((a, b) => a - b); }\n\nexport const resourceScope = /* @__PURE__ */ (() => {\n// Generated from the machine resource scope. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"exact\": 0}, maps: {\"Names\": new Map()}};\n}\nfunction step(params, state, input) {\n const env = {\"op\": $n(input[\"op\"], \"input op\"), \"first\": $n(input[\"first\"], \"input first\")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, \"Given\": $m(input[\"Given\"], \"input Given\"), \"Len\": $m(input[\"Len\"], \"input Len\")};\n const flag0 = $keys(maps, [\"Given\"]).every(k => ((maps[\"Given\"].get(k) ?? 0) <= 1));\n const flag1 = $breaks(maps, [[\"Given\", 0, false]], [[0, 0, false], [1, 0, false]]).every(k => ((!(1 <= (maps[\"Given\"].get(k) ?? 0))) || ((!(k === 0)) && (!(k === 1)))));\n const flag2 = $breaks(maps, [[\"Given\", 0, false], [\"Names\", 0, false], [\"Names\", 0, false], [\"Given\", 0, false], [\"Given\", 0, false], [\"Len\", 0, false]], [[0, 0, false], [1, 0, false], [66, 0, false]]).every(k => ((((!(1 <= (maps[\"Given\"].get(k) ?? 0))) || (1 <= (maps[\"Names\"].get(k) ?? dft[\"Names\"] ?? 0))) && ((!(1 <= (maps[\"Names\"].get(k) ?? dft[\"Names\"] ?? 0))) || (1 <= (maps[\"Given\"].get(k) ?? 0)))) && ((!(1 <= (maps[\"Given\"].get(k) ?? 0))) || ((!(k === 0)) && (!(k === 1)) && (k < 66) && ((maps[\"Len\"].get(k) ?? 0) <= 256)))));\n const flag3 = $keys(maps, [\"Given\",\"Names\"]).every(k => ((maps[\"Given\"].get(k) ?? 0) === (maps[\"Names\"].get(k) ?? dft[\"Names\"] ?? 0)));\n const flag4 = $keys(maps, [\"Given\",\"Len\"]).every(k => ((!(1 <= (maps[\"Given\"].get(k) ?? 0))) || ((maps[\"Len\"].get(k) ?? 0) <= 256)));\n const flag5 = ((1 <= (maps[\"Given\"].get(env[\"first\"]) ?? 0)) && (((env[\"op\"] === 0) && flag1) || ((env[\"op\"] === 1) && ((s[\"exact\"] === 1) && flag2))));\n if (!((env[\"op\"] < 2) && flag0)) throw new RangeError(\"resource scope: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"exact\": (flag5 ? 1 : 0)};\n const write0 = $every($keys(maps, [\"Given\"]), k => (flag5 ? (maps[\"Given\"].get(k) ?? 0) : 0));\n state.maps[\"Names\"] = write0.cells; dft[\"Names\"] = write0.d;\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const resourceConflict = /* @__PURE__ */ (() => {\n// Generated from the machine resource conflict. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"leftEffect\": $n(input[\"leftEffect\"], \"input leftEffect\"), \"rightEffect\": $n(input[\"rightEffect\"], \"input rightEffect\"), \"leftExact\": $n(input[\"leftExact\"], \"input leftExact\"), \"rightExact\": $n(input[\"rightExact\"], \"input rightExact\"), \"leftOrdered\": $n(input[\"leftOrdered\"], \"input leftOrdered\"), \"rightOrdered\": $n(input[\"rightOrdered\"], \"input rightOrdered\"), \"witness\": $n(input[\"witness\"], \"input witness\")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, \"Left\": $m(input[\"Left\"], \"input Left\"), \"Right\": $m(input[\"Right\"], \"input Right\")};\n const flag0 = $keys(maps, [\"Left\",\"Right\"]).every(k => (((maps[\"Left\"].get(k) ?? 0) <= 1) && ((maps[\"Right\"].get(k) ?? 0) <= 1)));\n const flag1 = $keys(maps, [\"Left\",\"Right\"]).every(k => ($x((maps[\"Left\"].get(k) ?? 0) + (maps[\"Right\"].get(k) ?? 0)) <= 1));\n const flag2 = (!flag1);\n const flag3 = $keys(maps, [\"Left\",\"Right\"]).every(k => ((!(1 <= (maps[\"Left\"].get(k) ?? 0))) || (!(1 <= (maps[\"Right\"].get(k) ?? 0)))));\n if (!((env[\"leftEffect\"] <= 1) && (env[\"rightEffect\"] <= 1) && (env[\"leftExact\"] <= 1) && (env[\"rightExact\"] <= 1) && (env[\"leftOrdered\"] <= 1) && (env[\"rightOrdered\"] <= 1) && flag0)) throw new RangeError(\"resource conflict: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"conflict\": (((env[\"leftEffect\"] === 1) && (env[\"rightEffect\"] === 1) && ((env[\"leftOrdered\"] === 1) || (env[\"rightOrdered\"] === 1)) && ((!((env[\"leftExact\"] === 1) && (env[\"rightExact\"] === 1))) || flag2)) ? 1 : 0)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n\nexport const resourceGroups = /* @__PURE__ */ (() => {\n// Generated from the machine resource groups. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"conflict\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"L_len\": $n(input[\"L_len\"], \"input L_len\"), \"R_len\": $n(input[\"R_len\"], \"input R_len\"), \"LN_len\": $n(input[\"LN_len\"], \"input LN_len\"), \"RN_len\": $n(input[\"RN_len\"], \"input RN_len\")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, \"L.effect\": $m(input[\"L.effect\"], \"input L.effect\"), \"L.ordered\": $m(input[\"L.ordered\"], \"input L.ordered\"), \"L.exact\": $m(input[\"L.exact\"], \"input L.exact\"), \"R.effect\": $m(input[\"R.effect\"], \"input R.effect\"), \"R.ordered\": $m(input[\"R.ordered\"], \"input R.ordered\"), \"R.exact\": $m(input[\"R.exact\"], \"input R.exact\"), \"LN.item\": $m(input[\"LN.item\"], \"input LN.item\"), \"LN.name\": $m(input[\"LN.name\"], \"input LN.name\"), \"RN.item\": $m(input[\"RN.item\"], \"input RN.item\"), \"RN.name\": $m(input[\"RN.name\"], \"input RN.name\")};\n const flag0 = $breaks(maps, [[\"LN.item\", 0, false]], [[env[\"LN_len\"], 0, false]]).every(k => ((!(k < env[\"LN_len\"])) || ((maps[\"LN.item\"].get(k) ?? 0) < env[\"L_len\"])));\n const flag1 = $breaks(maps, [[\"RN.item\", 0, false]], [[env[\"RN_len\"], 0, false]]).every(k => ((!(k < env[\"RN_len\"])) || ((maps[\"RN.item\"].get(k) ?? 0) < env[\"R_len\"])));\n const flag2 = (flag0 && flag1);\n const flag3 = (ks => ks.every(k => ks.every(k1 => ((!((k < env[\"L_len\"]) && (k1 < env[\"R_len\"]) && (0 <= 0))) || (!((((maps[\"L.effect\"].get(k) ?? 0) === 1) && ((maps[\"R.effect\"].get(k1) ?? 0) === 1) && (((maps[\"L.ordered\"].get(k) ?? 0) === 1) || ((maps[\"R.ordered\"].get(k1) ?? 0) === 1))) && (!(((maps[\"L.exact\"].get(k) ?? 0) === 1) && ((maps[\"R.exact\"].get(k1) ?? 0) === 1)))))))))($spread($breaks(maps, [[\"L.effect\", 0, false], [\"L.ordered\", 0, false], [\"L.exact\", 0, false], [\"R.effect\", 0, false], [\"R.ordered\", 0, false], [\"R.exact\", 0, false]], [[env[\"L_len\"], 0, false], [env[\"R_len\"], 0, false]]), 2));\n const flag4 = $join($spread($breaks(maps, [[\"LN.name\", 0, false], [\"LN.item\", 0, false], [\"LN.item\", 0, false], [\"RN.name\", 0, false], [\"RN.item\", 0, false], [\"RN.item\", 0, false]], [[env[\"LN_len\"], 0, false], [env[\"RN_len\"], 0, false]]), 2), k => (maps[\"LN.name\"].get(k) ?? 0), k1 => (maps[\"RN.name\"].get(k1) ?? 0), (k, k1) => ((!((k < env[\"LN_len\"]) && (k1 < env[\"RN_len\"]) && ((maps[\"LN.name\"].get(k) ?? 0) === (maps[\"RN.name\"].get(k1) ?? 0)) && (0 <= 0))) || (!(((maps[\"L.effect\"].get((maps[\"LN.item\"].get(k) ?? 0)) ?? 0) === 1) && ((maps[\"R.effect\"].get((maps[\"RN.item\"].get(k1) ?? 0)) ?? 0) === 1) && (((maps[\"L.ordered\"].get((maps[\"LN.item\"].get(k) ?? 0)) ?? 0) === 1) || ((maps[\"R.ordered\"].get((maps[\"RN.item\"].get(k1) ?? 0)) ?? 0) === 1))))));\n const flag5 = $breaks(maps, [[\"L.effect\", 0, false], [\"L.ordered\", 0, false], [\"L.exact\", 0, false]], [[env[\"L_len\"], 0, false]]).every(k => ((!(k < env[\"L_len\"])) || (((maps[\"L.effect\"].get(k) ?? 0) <= 1) && ((maps[\"L.ordered\"].get(k) ?? 0) <= 1) && ((maps[\"L.exact\"].get(k) ?? 0) <= 1))));\n const flag6 = $breaks(maps, [[\"R.effect\", 0, false], [\"R.ordered\", 0, false], [\"R.exact\", 0, false]], [[env[\"R_len\"], 0, false]]).every(k => ((!(k < env[\"R_len\"])) || (((maps[\"R.effect\"].get(k) ?? 0) <= 1) && ((maps[\"R.ordered\"].get(k) ?? 0) <= 1) && ((maps[\"R.exact\"].get(k) ?? 0) <= 1))));\n if (!(flag5 && flag6 && flag2)) throw new RangeError(\"resource groups: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"conflict\": ((flag3 && flag4) ? 0 : 1)};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { bit, idSet, members } from \"./machine.js\";\nimport { resourceScope, resourceConflict, resourceGroups as groupsMachine } from \"./generated/resources.js\";\n\n/** A resource scope as the host sees it: exact names, or unknown (\"*\"). */\nexport interface ResourceScope { readonly exact: boolean; readonly names: readonly string[] }\nexport interface ResourceEffect { readonly effect: boolean; readonly ordered: boolean; readonly scope: ResourceScope }\n\nconst EMPTY = 0, WILDCARD = 1, FIRST = 2;\nconst UNKNOWN: ResourceScope = Object.freeze({ exact: false, names: Object.freeze([]) as readonly string[] });\n\n/** Trusted codec: one injective table per decision. The empty name (and any\n * non-string resource) is 0, the wildcard is 1, and every other string,\n * NULs and lone surrogates included, gets its own id from 2. Never truncate,\n * hash or normalize Unicode here. */\nclass ResourceNames {\n readonly #ids = new Map<string, number>();\n readonly #names: string[] = [];\n id(value: unknown): number {\n if (typeof value !== \"string\" || value === \"\") return EMPTY;\n if (value === \"*\") return WILDCARD;\n let id = this.#ids.get(value);\n if (id === undefined) {\n id = FIRST + this.#names.length;\n this.#ids.set(value, id);\n this.#names.push(value);\n }\n return id;\n }\n name(id: number): string {\n const name = this.#names[id - FIRST];\n if (name === undefined) throw new Error(`Invalid verified resource id ${id}`);\n return name;\n }\n /** Each id's complete UTF-16 length, for the kernel's 256-unit bound. */\n lengths(ids: Iterable<number>): Map<number, number> {\n const cells = new Map<number, number>();\n for (const id of ids) if (id >= FIRST) cells.set(id, this.name(id).length);\n return cells;\n }\n}\n\nconst SOURCE = 0, NORMALIZE = 1;\nconst step = (names: ResourceNames, state: ReturnType<typeof resourceScope.init>, op: number, values: readonly unknown[]) => {\n const ids = values.map((value) => names.id(value));\n return resourceScope.step({}, state, { op, first: ids[0] ?? EMPTY, Given: idSet(ids), Len: names.lengths(ids) });\n};\n\nconst decode = (names: ResourceNames, state: ReturnType<typeof resourceScope.init>, order: readonly unknown[]): ResourceScope => {\n if (state.scalars.exact !== 1) return UNKNOWN;\n // Present the kernel's set in declaration order; membership is the kernel's.\n const held = new Set(members(state, \"Names\"));\n const listed = [...new Set(order.map((value) => names.id(value)))].filter((id) => held.delete(id));\n if (held.size > 0) throw new Error(\"Verified resource scope names an undeclared resource\");\n return { exact: true, names: listed.map((id) => names.name(id)) };\n};\n\n/** Interpret a complete declaration: exact when nonempty with no empty or wildcard identity. */\nexport const resourceSource = (values: readonly unknown[] | undefined): ResourceScope => {\n const declared: unknown[] = Array.isArray(values) ? Array.from(values) : [];\n const names = new ResourceNames();\n return decode(names, step(names, resourceScope.init({}), SOURCE, declared), declared);\n};\n\nexport const decodeResourceScope = (scope: ResourceScope): string[] => (scope.exact ? [...scope.names] : [\"*\"]);\n\n/** Check an untrusted proposal against the complete declaration: exact only when\n * the proposal names the same set, at most 64 valid names of at most 256 units. */\nexport const resourceNormalize = (values: readonly unknown[] | undefined, proposal: readonly unknown[]): ResourceScope => {\n const declared: unknown[] = Array.isArray(values) ? Array.from(values) : [];\n const candidate = Array.from(proposal);\n const names = new ResourceNames();\n // Intern the proposal first: its names take the ids the 64-name window covers.\n for (const value of candidate) names.id(value);\n const source = step(names, resourceScope.init({}), SOURCE, declared);\n return decode(names, step(names, source, NORMALIZE, candidate), candidate);\n};\n\nexport const boundedEffectResources = (resources: readonly string[] | undefined): string[] => {\n // Capture the entire declaration before running the untrusted proposer.\n const declared: unknown[] = Array.isArray(resources) ? Array.from(resources) : [];\n const proposal = new Set<unknown>();\n for (const resource of declared) {\n proposal.add(resource);\n if (proposal.size > 64) break;\n }\n return decodeResourceScope(resourceNormalize(declared, [...proposal]));\n};\n\nexport const encodeResourceEffects = (\n effects: readonly { kind: string; ordering: string; resources: readonly string[] }[],\n): ResourceEffect[] => effects.map((effect) => effect.kind === \"none\"\n ? { effect: false, ordered: false, scope: UNKNOWN }\n : { effect: true, ordered: effect.ordering !== \"commutative\", scope: resourceSource(effect.resources) });\n\nconst conflicts = (names: ResourceNames, left: ResourceEffect, right: ResourceEffect): boolean => {\n const state = resourceConflict.step({}, resourceConflict.init({}), {\n leftEffect: bit(left.effect), rightEffect: bit(right.effect),\n leftExact: bit(left.scope.exact), rightExact: bit(right.scope.exact),\n leftOrdered: bit(left.ordered), rightOrdered: bit(right.ordered), witness: EMPTY,\n Left: idSet(left.scope.names.map((name) => names.id(name))),\n Right: idSet(right.scope.names.map((name) => names.id(name))),\n });\n return state.scalars.conflict === 1;\n};\n\n/** Effect flags as list cells: one 0/1 map per field, keyed by position. */\nconst effectCells = (side: readonly ResourceEffect[]) => ({\n effect: new Map(side.map((e, i) => [i, bit(e.effect)])),\n ordered: new Map(side.map((e, i) => [i, bit(e.ordered)])),\n exact: new Map(side.map((e, i) => [i, bit(e.scope.exact)])),\n});\n\n/** Each exact scope's names as rows (item, name), where `item` is the effect's\n * position. Rows name an effect of their own side by construction. */\nconst rowCells = (names: ResourceNames, side: readonly ResourceEffect[]) => {\n const rows = side.flatMap((e, item) => (e.scope.exact ? e.scope.names : []).map((name) => [item, names.id(name)] as const));\n return { len: rows.length, item: new Map(rows.map(([item], p) => [p, item])), name: new Map(rows.map(([, name], p) => [p, name])) };\n};\n\n/** Whether any effect on the left conflicts with any effect on the right,\n * decided over every pair by the compiled groups kernel. Both sides' names\n * come from one table, so a name shared across them shares its id. */\nexport const resourceGroups = (left: readonly ResourceEffect[], right: readonly ResourceEffect[]): boolean => {\n const names = new ResourceNames();\n const L = effectCells(left), R = effectCells(right), LN = rowCells(names, left), RN = rowCells(names, right);\n const state = groupsMachine.step({}, groupsMachine.init({}), {\n L_len: left.length, R_len: right.length, LN_len: LN.len, RN_len: RN.len,\n \"L.effect\": L.effect, \"L.ordered\": L.ordered, \"L.exact\": L.exact,\n \"R.effect\": R.effect, \"R.ordered\": R.ordered, \"R.exact\": R.exact,\n \"LN.item\": LN.item, \"LN.name\": LN.name, \"RN.item\": RN.item, \"RN.name\": RN.name,\n });\n return state.scalars.conflict === 1;\n};\n\nexport const resourceConflictOf = (left: ResourceScope, right: ResourceScope, leftOrdered: boolean, rightOrdered: boolean): boolean =>\n conflicts(new ResourceNames(), { effect: true, ordered: leftOrdered, scope: left }, { effect: true, ordered: rightOrdered, scope: right });\n", "import { unknownConflict, knownConflict } from \"../verified/policy.js\";\nimport { boundedEffectResources, encodeResourceEffects, resourceGroups } from \"../verified/resources.js\";\nimport type { ResolvedFabricAction } from \"../core/action-registry.js\";\nimport type {\n FabricComponentEffectConflict,\n FabricComponentEffectInfo,\n FabricComponentEffectOptions,\n FabricComponentEffectRegistration,\n} from \"./types.js\";\n\nexport class FabricComponentIndependenceError extends Error {\n constructor(message: string) {\n super(message);\n this.name = \"FabricComponentIndependenceError\";\n }\n}\n\nconst normalizeResources = boundedEffectResources;\n\nexport const trackedRegistration = (\n registration: FabricComponentEffectRegistration | undefined,\n fallbackLabel: string,\n): FabricComponentEffectOptions => {\n if (typeof registration === \"string\") return { label: registration };\n return { label: fallbackLabel, ...registration };\n};\n\nexport const registrationEffect = (\n registration: FabricComponentEffectOptions,\n): FabricComponentEffectInfo => ({\n label: registration.label?.trim().slice(0, 256) || \"anonymous\",\n kind: registration.kind ?? \"transactional\",\n resources: normalizeResources(registration.resources),\n ordering: registration.ordering ?? \"unknown\",\n});\n\nexport const actionEffect = (\n action: ResolvedFabricAction,\n): FabricComponentEffectInfo | undefined => {\n if (!action.effect || action.effect.kind === \"none\") return undefined;\n return {\n label: action.ref,\n kind: action.effect.kind,\n resources: normalizeResources(action.effect.resources),\n ordering: action.effect.ordering ?? \"unknown\",\n };\n};\n\ninterface FabricComponentEffectSummary {\n declarations: ReturnType<typeof encodeResourceEffects>;\n hasEffects: boolean;\n hasNoncommutative: boolean;\n hasUnknown: boolean;\n hasUnknownNoncommutative: boolean;\n resourceNoncommutative: Map<string, boolean>;\n}\n\ntype FabricComponentConflictBasis = Omit<FabricComponentEffectConflict, \"withComponent\">;\n\nexport const summarizeEffects = (\n effects: readonly FabricComponentEffectInfo[],\n): FabricComponentEffectSummary => {\n const resourceNoncommutative = new Map<string, boolean>();\n let hasNoncommutative = false;\n let hasUnknown = false;\n let hasUnknownNoncommutative = false;\n let effectful = 0;\n for (const effect of effects) {\n if (effect.kind === \"none\") continue;\n effectful++;\n const noncommutative = effect.ordering !== \"commutative\";\n hasNoncommutative ||= noncommutative;\n for (const resource of effect.resources) {\n if (resource === \"*\") {\n hasUnknown = true;\n hasUnknownNoncommutative ||= noncommutative;\n } else {\n resourceNoncommutative.set(\n resource,\n (resourceNoncommutative.get(resource) ?? false) || noncommutative,\n );\n }\n }\n }\n return {\n declarations: encodeResourceEffects(effects),\n hasEffects: effectful > 0,\n hasNoncommutative,\n hasUnknown,\n hasUnknownNoncommutative,\n resourceNoncommutative,\n };\n};\n\nexport const effectConflictsBetween = (\n left: FabricComponentEffectSummary,\n right: FabricComponentEffectSummary,\n): FabricComponentConflictBasis[] => {\n // Only the compiled full-declaration decision can grant independence.\n // The summaries below explain a conflict; they cannot erase one.\n if (!resourceGroups(left.declarations, right.declarations)) return [];\n const conflicts: FabricComponentConflictBasis[] = [];\n if (\n unknownConflict(\n left.hasUnknown, left.hasUnknownNoncommutative, left.hasNoncommutative,\n right.hasUnknown, right.hasUnknownNoncommutative, right.hasNoncommutative,\n )\n ) {\n conflicts.push({ resources: [\"*\"], reason: \"unknown_resource\" });\n }\n const overlap = [...left.resourceNoncommutative.keys()]\n .filter((resource) =>\n knownConflict(\n right.resourceNoncommutative.has(resource),\n left.resourceNoncommutative.get(resource) ?? false,\n right.resourceNoncommutative.get(resource) ?? false,\n ),\n )\n .sort();\n if (overlap.length > 0) {\n conflicts.push({ resources: overlap, reason: \"shared_resource\" });\n }\n return conflicts.length > 0 ? conflicts : [{ resources: [\"*\"], reason: \"unknown_resource\" }];\n};\n\nexport const compareEffectInfo = (\n left: FabricComponentEffectInfo,\n right: FabricComponentEffectInfo,\n): number =>\n left.label.localeCompare(right.label) ||\n left.kind.localeCompare(right.kind) ||\n left.ordering.localeCompare(right.ordering) ||\n left.resources.join(\"\\0\").localeCompare(right.resources.join(\"\\0\"));\n\n", "// Action-name repair for Fabric registry resolution, mirroring the\n// argument-shape repair architecture in src/providers/arg-normalization.ts:\n//\n// 1. The registry resolve stage canonicalizes near-miss action spellings\n// (memory.search \u2192 memory.recall) before the provider descriptor is\n// demanded. The repair surface is mostly derived from the provider's\n// declared action names rather than maintained by hand. Exact casing and\n// separator forms and unique authored synonyms authorize repair; plural,\n// prefix, token-alignment, and edit-distance matches only suggest names.\n// 2. The resolution failure tier owns the didactic failure: ambiguous or\n// unmatched names fail with the closest declared candidates named, and\n// the original \"Unknown Fabric action\" prefix is preserved.\n//\n// As with KEY_SYNONYM_CLASSES in arg-normalization, only genuinely semantic\n// verb synonyms need explicit vocabulary, and a spilled name repairs only\n// when exactly one declared member fits: ambiguity (or absence) leaves the\n// name untouched so the failure tier can enumerate the honest choices.\n\ninterface ActionNameRepair {\n /** Canonical declared action name when exactly one candidate fits. */\n repaired?: string;\n /** Ranked declared candidates for the didactic failure message. */\n suggestions: string[];\n}\n\n// Verb/concept classes shared across the stable providers. Each class mixes\n// plausible spilled verbs with the canonical names providers actually\n// declare, so e.g. \"search\" repairs to memory.recall (sole recall-class\n// member declared by memory) while \"fetch\" on mesh stays ambiguous between\n// mesh.get and mesh.read. A class only fires when exactly one member is\n// declared by the target provider's catalog.\nconst ACTION_SYNONYM_CLASSES: ReadonlyArray<ReadonlyArray<string>> = [\n // memory.recall and its spilled search verbs.\n [\"recall\", \"search\", \"find\", \"query\", \"lookup\", \"grep\", \"scan\", \"locate\"],\n // memory.expand / read-one-entry verbs.\n [\"expand\", \"get\", \"read\", \"fetch\", \"load\", \"view\", \"show\"],\n // memory.sessions and list-style catalog reads.\n [\"sessions\", \"list\", \"ls\", \"enumerate\", \"index\"],\n // state.transition / mesh.put write verbs.\n [\"transition\", \"write\", \"put\", \"set\", \"save\", \"update\", \"store\", \"upsert\", \"append\", \"post\"],\n // agents.create family.\n [\"create\", \"spawn\", \"new\", \"add\", \"make\", \"register\"],\n // mesh.publish family (\"post\" deliberately also sits in the write class,\n // so mesh.post stays ambiguous between publish and put).\n [\"publish\", \"send\", \"emit\", \"notify\"],\n // teardown verbs.\n [\"delete\", \"remove\", \"rm\", \"destroy\", \"drop\", \"clear\"],\n // components.reload family.\n [\"reload\", \"restart\", \"refresh\", \"rebuild\", \"reboot\"],\n // status/introspection reads (\"get\" is deliberately shared with the\n // expand class: memory.get expands an entry, components.get is status).\n [\"status\", \"info\", \"inspect\", \"health\", \"describe\", \"get\"],\n // execution verbs.\n [\"run\", \"execute\", \"exec\", \"invoke\", \"call\", \"start\", \"go\"],\n // cancellation verbs.\n [\"cancel\", \"abort\", \"stop\", \"kill\", \"terminate\"],\n // verification verbs.\n [\"verify\", \"check\", \"validate\", \"assert\", \"confirm\", \"certify\"],\n // timeline reads.\n [\"history\", \"log\", \"journal\", \"events\", \"timeline\", \"transitions\"],\n // subscription verbs.\n [\"subscribe\", \"watch\", \"listen\", \"observe\", \"follow\"],\n // compact.request family.\n [\"request\", \"begin\", \"initiate\", \"trigger\", \"schedule\"],\n // schema.commit family.\n [\"commit\", \"apply\", \"finalize\"],\n // agents messaging pair (both declare, so spilled verbs here stay\n // ambiguous and the failure tier enumerates ask vs tell).\n [\"ask\", \"tell\", \"say\", \"chat\"],\n];\n\n// Casing/spacing/underscore/dollar-insensitive action form, mirroring\n// normalizeForm in arg-normalization: \"$servers\" and \"servers\" share a form.\nconst normalizeActionForm = (name: string): string =>\n name.toLowerCase().replace(/[^a-z0-9]/g, \"\");\n\nconst ACTION_CLASS_FORMS = ACTION_SYNONYM_CLASSES.map((cls) =>\n new Set(cls.map(normalizeActionForm)),\n);\n\nconst camelTokens = (name: string): string[] =>\n name\n .replace(/([a-z0-9])([A-Z])/g, \"$1 $2\")\n .replace(/([A-Z]+)([A-Z][a-z])/g, \"$1 $2\")\n .toLowerCase()\n .split(/[^a-z0-9]+/)\n .filter((token) => token.length > 0);\n\n// Singular/plural near-misses collapse to one form, mirroring the derived\n// plural handling of declared schema keys in arg-normalization.\nconst singularActionForm = (form: string): string =>\n form.length > 3 && form.endsWith(\"s\") ? form.slice(0, -1) : form;\n\nconst levenshtein = (left: string, right: string): number => {\n if (left === right) return 0;\n if (left.length === 0) return right.length;\n if (right.length === 0) return left.length;\n let previous = new Array<number>(right.length + 1);\n let current = new Array<number>(right.length + 1);\n for (let j = 0; j <= right.length; j++) previous[j] = j;\n for (let i = 1; i <= left.length; i++) {\n current[0] = i;\n for (let j = 1; j <= right.length; j++) {\n current[j] = Math.min(\n previous[j]! + 1,\n current[j - 1]! + 1,\n previous[j - 1]! + (left[i - 1] === right[j - 1] ? 0 : 1),\n );\n }\n const swap = previous;\n previous = current;\n current = swap;\n }\n return previous[right.length]!;\n};\n\n// Edit-distance budget scales with the spilled length; short names keep a\n// tight budget so \"get\" never quietly becomes \"set\".\nconst editThreshold = (form: string): number =>\n form.length <= 4 ? 1 : Math.max(2, Math.floor(form.length / 4));\n\nconst tokenAligned = (spilled: string[], declared: string[]): boolean => {\n if (spilled.length === 0 || spilled.length !== declared.length) return false;\n return spilled.every((token, index) => {\n const other = declared[index]!;\n if (token === other) return true;\n return token.length >= 3 && other.length >= 3 &&\n (token.startsWith(other) || other.startsWith(token));\n });\n};\n\nconst sortNames = (names: readonly string[]): string[] =>\n [...new Set(names)].sort((left, right) => left.localeCompare(right));\n\ninterface CatalogForm {\n name: string;\n form: string;\n singular: string;\n tokens: string[];\n}\n\n// Catalog identity is weakly held; validate its contents so mutable provider\n// registrations cannot retain stale names, ambiguity, or authorization targets.\ninterface CatalogSnapshot {\n forms: CatalogForm[];\n repairs: Map<string, ActionNameRepair>;\n}\n\nconst catalogCache = new WeakMap<readonly string[], CatalogSnapshot>();\nconst catalogSnapshot = (declared: readonly string[]): CatalogSnapshot => {\n const cached = catalogCache.get(declared);\n if (cached?.forms.length === declared.length && cached.forms.every((entry, index) => entry.name === declared[index])) {\n return cached;\n }\n const forms = declared.map((name) => {\n const form = normalizeActionForm(name);\n return { name, form, singular: singularActionForm(form), tokens: camelTokens(name) };\n });\n const snapshot = { forms, repairs: new Map<string, ActionNameRepair>() };\n catalogCache.set(declared, snapshot);\n return snapshot;\n};\n\n/**\n * Repair a spilled action name against the provider's declared names.\n * Returns the canonical name when exactly one declared candidate fits, or\n * ranked suggestions for the didactic failure message.\n */\nconst computeActionRepair = (\n catalog: readonly CatalogForm[],\n actionName: string,\n): ActionNameRepair => {\n const spilledForm = normalizeActionForm(actionName);\n if (spilledForm.length === 0) return { suggestions: [] };\n if (catalog.some((entry) => entry.name === actionName)) return { suggestions: [] };\n const forms = [...new Map(catalog.map((entry) => [entry.name, entry])).values()];\n\n // Exact case/separator forms prove identity before semantic aliases.\n const exact = forms.filter((entry) => entry.form === spilledForm).map((entry) => entry.name);\n if (exact.length === 1) return { repaired: exact[0]!, suggestions: exact };\n if (exact.length > 1) return { suggestions: sortNames(exact) };\n if (forms.length === 0) return { suggestions: [] };\n\n // Tier 1 \u2014 semantic verb classes: the spilled verb belongs to a shared\n // synonym class; repair only when exactly one class member is declared.\n const classCandidates = sortNames(ACTION_CLASS_FORMS\n .filter((classForms) => classForms.has(spilledForm))\n .flatMap((classForms) =>\n forms.filter((entry) => classForms.has(entry.form)).map((entry) => entry.name)\n ));\n if (classCandidates.length === 1) {\n return { repaired: classCandidates[0]!, suggestions: [classCandidates[0]!] };\n }\n if (classCandidates.length > 1) {\n return { suggestions: sortNames(classCandidates) };\n }\n\n // Similarity is only didactic evidence, even with a unique candidate.\n // Singular/plural, token alignment, and prefixes never authorize repair.\n const spilledTokens = camelTokens(actionName);\n const spilledSingular = singularActionForm(spilledForm);\n const derived: string[] = [];\n for (const entry of forms) {\n if (\n entry.form === spilledForm ||\n entry.singular === spilledSingular ||\n (spilledTokens.length > 0 && tokenAligned(spilledTokens, entry.tokens)) ||\n (spilledForm.length >= 4 && entry.form.startsWith(spilledForm))\n ) {\n derived.push(entry.name);\n }\n }\n if (derived.length > 0) return { suggestions: sortNames(derived) };\n\n // Bounded edit distance ranks suggestions, never semantic proof.\n const distances = forms.map((entry) => ({\n name: entry.name,\n distance: levenshtein(spilledForm, entry.form),\n }));\n const min = Math.min(...distances.map((entry) => entry.distance));\n const threshold = editThreshold(spilledForm);\n if (min <= threshold) {\n const nearest = sortNames(\n distances.filter((entry) => entry.distance === min).map((entry) => entry.name),\n );\n return { suggestions: nearest };\n }\n\n // Failure tier \u2014 rank a few close names so the error teaches the catalog.\n const suggestions = distances\n .filter((entry) => entry.distance <= Math.max(3, Math.floor(spilledForm.length / 2)))\n .sort((left, right) =>\n left.distance - right.distance || left.name.localeCompare(right.name)\n )\n .slice(0, 3)\n .map((entry) => entry.name);\n return { suggestions: sortNames(suggestions) };\n};\n\n// Bound memoized near-misses per live catalogue. Every call revalidates the\n// names above, so replacement/removal invalidates repairs as well as forms.\nexport const repairActionName = (declared: readonly string[], actionName: string): ActionNameRepair => {\n const catalog = catalogSnapshot(declared);\n let result = catalog.repairs.get(actionName);\n if (!result) {\n result = computeActionRepair(catalog.forms, actionName);\n if (actionName.length <= 512) {\n if (catalog.repairs.size >= 128) catalog.repairs.delete(catalog.repairs.keys().next().value!);\n catalog.repairs.set(actionName, result);\n }\n }\n // Callers own suggestions; never expose mutable cached values.\n return { ...result, suggestions: [...result.suggestions] };\n};\n\n/**\n * The didactic unknown-action failure message. The original\n * \"Unknown Fabric action: <ref>\" prefix is preserved verbatim; declared\n * candidates are appended only when repair found close misses.\n */\nexport const formatUnknownActionMessage = (\n ref: string,\n suggestions: readonly string[],\n): string =>\n suggestions.length > 0\n ? `Unknown Fabric action: ${ref} (did you mean: ${suggestions.slice(0, 3).join(\", \")}?)`\n : `Unknown Fabric action: ${ref}`;\n", "import { randomUUID } from \"node:crypto\";\nimport { settleWithin } from \"../async-settlement.js\";\nimport { VERIFIED_NAT_MAX } from \"../verified/nat.js\";\nimport { consume } from \"../verified/policy.js\";\nimport { bindingStep, type BindingLife, type BindingEvent, type BindingOutcome } from \"../verified/lifecycle.js\";\nimport type { FabricComponentProviderLease } from \"../components/types.js\";\nimport type { FabricProvider } from \"../protocol.js\";\n\ntype FabricProviderBindingState = \"staged\" | \"active\" | \"retiring\" | \"closed\";\n\nexport interface FabricProviderBinding {\n id: string;\n name: string;\n generation: number;\n provider: FabricProvider;\n state: FabricProviderBindingState;\n ownerRetained: boolean;\n allowReplace: boolean;\n retainers: number;\n inFlight: number;\n closeTask?: Promise<void>;\n closeError?: string;\n unsubscribeCatalog?: () => void;\n}\n\nexport type FabricProviderBindingEvent =\n | { type: \"staged\" | \"activated\" | \"retiring\" | \"closed\"; binding: FabricProviderBinding }\n | { type: \"catalog\"; provider: string };\n\nconst snapshot = (binding: FabricProviderBinding): FabricProviderBinding => ({\n ...binding,\n ...(binding.closeTask ? { closeTask: binding.closeTask } : {}),\n});\n\nconst useOnce = (): (() => boolean) => {\n let active = true;\n return () => {\n const next = consume(active);\n active = next.active;\n return next.released;\n };\n};\n\nexport class FabricProviderBindings {\n readonly #lifecycles = new Map<string, BindingLife>();\n readonly #current = new Map<string, FabricProviderBinding>();\n readonly #staged = new Map<string, FabricProviderBinding>();\n readonly #all = new Map<string, FabricProviderBinding>();\n readonly #generations = new Map<string, number>();\n readonly #pending = new Set<Promise<unknown>>();\n readonly #excluded = new Set<string>();\n readonly #signals = new Map<string, AbortController>();\n readonly #listeners = new Set<(event: FabricProviderBindingEvent) => void>();\n\n subscribe(listener: (event: FabricProviderBindingEvent) => void): () => void {\n this.#listeners.add(listener);\n return () => this.#listeners.delete(listener);\n }\n\n current(name: string): FabricProviderBinding | undefined {\n return this.#current.get(name);\n }\n\n binding(id: string): FabricProviderBinding | undefined {\n const binding = this.#all.get(id);\n const life = this.#lifecycles.get(id);\n return binding && life && bindingStep(life, { $: \"Inspect\" }).command.$ === \"Granted\" ? binding : undefined;\n }\n\n has(name: string): boolean {\n return this.#current.has(name);\n }\n\n providers(): FabricProvider[] {\n return [...this.#current.values()].map((binding) => binding.provider);\n }\n\n entries(): FabricProviderBinding[] {\n return [...this.#all.values()].filter((binding) => binding.state !== \"closed\");\n }\n\n mount(\n provider: FabricProvider,\n options: { overwrite?: boolean; staged?: boolean } = {},\n ): FabricComponentProviderLease {\n // A host-owned (excluded) generation never reaches provider.close(), so\n // its instance may be remounted while that generation finishes closing.\n if ([...this.#all.values()].some(binding =>\n binding.provider === provider && binding.closeTask && !this.#excluded.has(binding.id))) {\n throw new Error(\"Cannot mount a provider instance whose close has begun\");\n }\n const current = this.#current.get(provider.name);\n const staged = this.#staged.get(provider.name);\n if ((current || staged) && !options.overwrite) {\n throw new Error(`Fabric provider already registered: ${provider.name}`);\n }\n if (staged && options.overwrite) this.retire(staged.id);\n const generation = (this.#generations.get(provider.name) ?? 0) + 1;\n if (!Number.isSafeInteger(generation)) throw new Error(\"Provider generation overflow\");\n this.#generations.set(provider.name, generation);\n const binding: FabricProviderBinding = {\n id: randomUUID(),\n name: provider.name,\n generation,\n provider,\n state: options.staged ? \"staged\" : \"active\",\n ownerRetained: true,\n allowReplace: options.overwrite === true,\n retainers: 0,\n inFlight: 0,\n };\n if (provider.subscribeCatalog) {\n binding.unsubscribeCatalog = provider.subscribeCatalog(() =>\n this.notifyCatalogChanged(provider.name),\n );\n }\n this.#all.set(binding.id, binding);\n this.#lifecycles.set(binding.id, { $: \"Life\", phase: { $: options.staged ? \"Staged\" : \"Active\" }, owner: true, holds: 0, calls: 0, revoked: false });\n this.#signals.set(binding.id, new AbortController());\n if (options.staged) {\n this.#staged.set(binding.name, binding);\n this.#emit({ type: \"staged\", binding: snapshot(binding) });\n } else {\n const replaced = this.#activateOne(binding);\n if (replaced && options.overwrite) void this.releaseOwner(replaced.id).catch(() => undefined);\n }\n\n const takeRelease = useOnce();\n return {\n bindingId: binding.id,\n name: binding.name,\n generation: binding.generation,\n get active() {\n return binding.state === \"active\";\n },\n retire: () => this.retire(binding.id),\n release: async () => {\n if (!takeRelease()) return binding.closeTask;\n return this.releaseOwner(binding.id);\n },\n };\n }\n\n activate(bindingIds: readonly string[]): string[] {\n const bindings = bindingIds.map((id) => {\n const binding = this.#all.get(id);\n if (!binding || binding.state === \"closed\" || binding.closeTask) {\n throw new Error(`Unknown Fabric provider binding: ${id}`);\n }\n if (binding.state !== \"staged\" && binding.state !== \"active\") {\n throw new Error(`Fabric provider binding is ${binding.state}: ${binding.name}`);\n }\n return binding;\n });\n const names = new Set<string>();\n for (const binding of bindings) {\n if (names.has(binding.name)) {\n throw new Error(`Cannot activate multiple Fabric bindings for provider ${binding.name}`);\n }\n names.add(binding.name);\n const current = this.#current.get(binding.name);\n if (current && current.id !== binding.id && !binding.allowReplace) {\n throw new Error(`Fabric provider already registered: ${binding.name}`);\n }\n }\n const replaced: string[] = [];\n for (const binding of bindings) {\n const previous = this.#activateOne(binding);\n if (previous && previous.id !== binding.id) {\n replaced.push(previous.id);\n if (binding.allowReplace) void this.releaseOwner(previous.id).catch(() => undefined);\n }\n }\n return replaced;\n }\n\n /** Withdraw the current binding: retire it and drop its owner hold, so\n * retained generations drain under the normal lifecycle rules. `provider`\n * and `generation` (number = generation, string = binding id) pin the target;\n * a mismatch withdraws nothing. `keepProviderOpen` skips provider.close() for\n * host-owned instances. */\n unregister(\n name: string,\n options: { provider?: FabricProvider; generation?: number | string; keepProviderOpen?: boolean } = {},\n ): FabricProvider | undefined {\n const binding = this.#current.get(name);\n if (!binding) return undefined;\n if (options.provider !== undefined && binding.provider !== options.provider) return undefined;\n if (\n options.generation !== undefined &&\n (typeof options.generation === \"number\" ? binding.generation : binding.id) !== options.generation\n ) {\n return undefined;\n }\n if (options.keepProviderOpen) this.#excluded.add(binding.id);\n this.retire(binding.id);\n void this.releaseOwner(binding.id).catch(() => undefined);\n return binding.provider;\n }\n\n retire(id: string): void {\n const binding = this.#all.get(id);\n if (!binding) return;\n const withdrawing = this.#current.get(binding.name)?.id === id || this.#staged.get(binding.name)?.id === id;\n if (this.#current.get(binding.name)?.id === id) this.#current.delete(binding.name);\n if (this.#staged.get(binding.name)?.id === id) this.#staged.delete(binding.name);\n this.#step(binding, { $: \"Retire\" });\n if (withdrawing) this.#emit({ type: \"retiring\", binding: snapshot(binding) });\n void this.#maybeClose(binding).catch(() => undefined);\n }\n\n retain(ids: Iterable<string>, cleanup = false): () => Promise<void> {\n const retained: FabricProviderBinding[] = [];\n try {\n for (const id of new Set(ids)) {\n const binding = this.#all.get(id);\n if (!binding || this.#step(binding, { $: \"Retain\", cleanup }) !== \"Granted\") {\n throw new Error(`Unknown Fabric provider binding: ${id}`);\n }\n retained.push(binding);\n }\n } catch (error) {\n for (const binding of retained) this.#step(binding, { $: \"Release\" });\n throw error;\n }\n const takeRelease = useOnce();\n return async () => {\n if (!takeRelease()) return;\n await Promise.all(retained.map(async (binding) => {\n this.#step(binding, { $: \"Release\" });\n await this.#maybeClose(binding);\n }));\n };\n }\n\n beginInvocation(id: string, cleanup = false): () => Promise<void> {\n const binding = this.#all.get(id);\n if (!binding || this.#step(binding, { $: \"Begin\", cleanup }) !== \"Granted\") {\n throw new Error(`Unknown Fabric provider binding: ${id}`);\n }\n const takeEnd = useOnce();\n return async () => {\n if (!takeEnd()) return;\n this.#step(binding, { $: \"End\" });\n await this.#maybeClose(binding);\n };\n }\n\n signal(id: string): AbortSignal {\n const controller = this.#signals.get(id);\n if (!controller) throw new Error(\"Unknown provider authority\");\n return controller.signal;\n }\n\n revoke(id: string): void {\n const binding = this.#all.get(id);\n if (!binding) return;\n this.#step(binding, { $: \"Revoke\" });\n this.#signals.get(id)?.abort(new Error(\"Fabric provider authority revoked\"));\n this.retire(id);\n void this.#maybeClose(binding).catch(() => undefined);\n }\n\n quarantine(id: string, error: unknown): void {\n const binding = this.#all.get(id);\n if (!binding) return;\n binding.closeError = error instanceof Error ? error.message : String(error);\n this.#step(binding, { $: \"Abort\" });\n this.revoke(id);\n }\n\n /** Hold the real operation, not the caller's cancellation race. */\n track<T>(id: string, operation: () => T | PromiseLike<T>, cleanup = false): Promise<T> {\n if (!cleanup && !this.binding(id)) return Promise.reject(new Error(\"Fabric provider authority revoked or unavailable\"));\n let end: () => Promise<void>;\n try { end = this.beginInvocation(id, cleanup); }\n catch (error) { return Promise.reject(error); }\n let actual: Promise<T>;\n try { actual = Promise.resolve(operation()); }\n catch (error) { actual = Promise.reject(error); }\n this.#pending.add(actual);\n const settled = () => { this.#pending.delete(actual); return end(); };\n void actual.then(settled, settled).catch(() => undefined);\n return actual;\n }\n\n trackProvider<T>(provider: FabricProvider, operation: () => T | PromiseLike<T>, cleanup = false): Promise<T> {\n const binding = [...this.#all.values()].find(item => item.provider === provider && this.#canBegin(item.id, cleanup));\n if (!binding) return Promise.reject(new Error(\"Fabric provider binding is unavailable\"));\n return this.track(binding.id, operation, cleanup);\n }\n\n notifyCatalogChanged(provider: string): void {\n if (this.#current.has(provider)) this.#emit({ type: \"catalog\", provider });\n }\n\n async close(excludedProviderNames: Set<string> = new Set()): Promise<void> {\n const tasks: Promise<void>[] = [];\n for (const binding of this.#all.values()) {\n if (binding.state === \"closed\") continue;\n if (excludedProviderNames.has(binding.name)) this.#excluded.add(binding.id);\n this.revoke(binding.id);\n tasks.push(this.#maybeClose(binding));\n }\n const deadline = Date.now() + 1_000;\n await settleWithin([...tasks, ...this.#pending], 1_000);\n await settleWithin([...this.#all.values()].flatMap(binding => binding.closeTask ? [binding.closeTask] : []), Math.max(0, deadline - Date.now()));\n this.#current.clear();\n this.#staged.clear();\n }\n\n #activateOne(binding: FabricProviderBinding): FabricProviderBinding | undefined {\n const current = this.#current.get(binding.name);\n if (current?.id === binding.id && binding.state === \"active\") return current;\n if (current && current.id !== binding.id) this.retire(current.id);\n if (this.#staged.get(binding.name)?.id === binding.id) this.#staged.delete(binding.name);\n if (this.#step(binding, { $: \"Activate\" }) !== \"Granted\") throw new Error(\"Provider binding cannot be activated\");\n this.#current.set(binding.name, binding);\n this.#emit({ type: \"activated\", binding: snapshot(binding) });\n return current;\n }\n\n private async releaseOwner(id: string): Promise<void> {\n const binding = this.#all.get(id);\n if (!binding) return;\n this.retire(id);\n this.#step(binding, { $: \"DropOwner\" });\n await this.#maybeClose(binding);\n }\n\n async #maybeClose(binding: FabricProviderBinding): Promise<void> {\n if (binding.closeTask) return binding.closeTask;\n // The reducer reserves Closing synchronously, before arbitrary callbacks.\n if (this.#step(binding, { $: \"Shut\" }) !== \"StartClose\") return;\n binding.closeTask = Promise.resolve().then(async () => {\n try {\n const unsubscribe = binding.unsubscribeCatalog;\n delete binding.unsubscribeCatalog;\n await unsubscribe?.();\n const shared = [...this.#all.values()].some(other => other.id !== binding.id && other.provider === binding.provider && other.state !== \"closed\");\n if (!shared && !this.#excluded.has(binding.id)) await binding.provider.close?.();\n } catch (error) {\n this.quarantine(binding.id, error);\n throw error;\n }\n if (this.#step(binding, { $: \"Complete\" }) !== \"Granted\") {\n throw new Error(binding.closeError ?? \"Provider close completion refused\");\n }\n this.#all.delete(binding.id);\n this.#lifecycles.delete(binding.id);\n this.#signals.delete(binding.id);\n this.#excluded.delete(binding.id);\n this.#emit({ type: \"closed\", binding: snapshot(binding) });\n });\n return binding.closeTask;\n }\n\n #canBegin(id: string, cleanup: boolean): boolean {\n const life = this.#lifecycles.get(id);\n return !!life && life.calls < VERIFIED_NAT_MAX && bindingStep(life, { $: \"Begin\", cleanup }).command.$ === \"Granted\";\n }\n\n #step(binding: FabricProviderBinding, event: BindingEvent): BindingOutcome[\"command\"][\"$\"] {\n const life = this.#lifecycles.get(binding.id);\n if (!life) return \"Denied\";\n if ((event.$ === \"Begin\" && life.calls >= VERIFIED_NAT_MAX) || (event.$ === \"Retain\" && life.holds >= VERIFIED_NAT_MAX)) {\n throw new Error(\"Provider lifecycle accounting overflow\");\n }\n const outcome = bindingStep(life, event);\n if (outcome.next.holds > VERIFIED_NAT_MAX || outcome.next.calls > VERIFIED_NAT_MAX) {\n throw new Error(\"Provider lifecycle accounting overflow\");\n }\n this.#lifecycles.set(binding.id, outcome.next);\n binding.state = ({ Staged: \"staged\", Active: \"active\", Retiring: \"retiring\", Closing: \"retiring\", Closed: \"closed\", Failed: \"retiring\" } as const)[outcome.next.phase.$];\n binding.ownerRetained = outcome.next.owner;\n binding.retainers = Number(outcome.next.holds);\n binding.inFlight = Number(outcome.next.calls);\n return outcome.command.$;\n }\n\n #emit(event: FabricProviderBindingEvent): void {\n for (const listener of [...this.#listeners]) {\n try {\n listener(event);\n } catch {\n // Registry listeners are observations; one listener cannot break provider ownership.\n }\n }\n }\n}\n", "// Generated by scripts/verified-kernels.ts from proofs/lifecycle.ts with gdp-wired@0.31.1. Do not edit.\nfunction $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }\nfunction $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }\n\nexport const bindingStep = /* @__PURE__ */ (() => {\n// Generated from the machine binding lifecycle. step consumes its state: keep the one it returns (fork to branch).\nfunction init(params) {\n const env = {}, s = {};\n return {scalars: {\"phase\": 0, \"owner\": 1, \"holds\": 0, \"calls\": 0, \"revoked\": 0, \"command\": 0}, maps: {}};\n}\nfunction step(params, state, input) {\n const env = {\"event\": $n(input[\"event\"], \"input event\"), \"cleanup\": $n(input[\"cleanup\"], \"input cleanup\")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;\n const flag0 = ((env[\"event\"] === 0) && (s[\"phase\"] <= 2) && (s[\"revoked\"] === 0));\n const flag1 = ((env[\"event\"] === 1) && (s[\"phase\"] <= 1));\n const flag2 = ((env[\"event\"] === 2) && (s[\"phase\"] <= 1));\n const flag3 = ((env[\"event\"] === 2) && (2 <= s[\"phase\"]));\n const flag4 = ((env[\"event\"] === 3) && (0 <= 0));\n const flag5 = ((env[\"event\"] === 4) && (s[\"phase\"] <= 1));\n const flag6 = ((env[\"event\"] === 4) && (2 <= s[\"phase\"]));\n const flag7 = ((env[\"event\"] === 5) && (s[\"phase\"] <= 2) && ((env[\"cleanup\"] === 1) || (s[\"revoked\"] === 0)));\n const flag8 = ((env[\"event\"] === 5) && (s[\"phase\"] === 5) && (env[\"cleanup\"] === 1));\n const flag9 = ((env[\"event\"] === 7) && (s[\"phase\"] <= 2) && ((env[\"cleanup\"] === 1) || (s[\"revoked\"] === 0)));\n const flag10 = ((env[\"event\"] === 7) && (s[\"phase\"] === 5) && (env[\"cleanup\"] === 1));\n const flag11 = ((env[\"event\"] === 6) && (0 <= 0) && (1 <= s[\"holds\"]));\n const flag12 = ((env[\"event\"] === 8) && (0 <= 0) && (1 <= s[\"calls\"]));\n const flag13 = ((env[\"event\"] === 9) && (s[\"phase\"] === 2) && ((s[\"owner\"] === 0) && (s[\"holds\"] === 0) && (s[\"calls\"] === 0)));\n const flag14 = ((env[\"event\"] === 10) && (s[\"phase\"] === 3));\n const flag15 = ((env[\"event\"] === 11) && ((s[\"phase\"] <= 3) || (s[\"phase\"] === 5)));\n const flag16 = flag0;\n const flag17 = flag1;\n const flag18 = flag2;\n const flag19 = flag3;\n const flag20 = flag4;\n const flag21 = flag5;\n const flag22 = flag6;\n const flag23 = flag7;\n const flag24 = flag8;\n const flag25 = flag9;\n const flag26 = flag10;\n const flag27 = flag11;\n const flag28 = flag12;\n const flag29 = flag13;\n const flag30 = flag14;\n const flag31 = flag15;\n if (!((env[\"event\"] < 12) && (env[\"cleanup\"] <= 1))) throw new RangeError(\"binding lifecycle: the request fails the rule's assumption, so no proof covers the step it would take\");\n const scalars = {...s, \"owner\": ((flag20 || flag21 || flag22 || flag31) ? 0 : s[\"owner\"]), \"holds\": ((flag23 || flag24) ? $x(s[\"holds\"] + 1) : (flag27 ? Math.max(0, s[\"holds\"] - 1) : s[\"holds\"])), \"calls\": ((flag25 || flag26) ? $x(s[\"calls\"] + 1) : (flag28 ? Math.max(0, s[\"calls\"] - 1) : s[\"calls\"])), \"revoked\": ((flag21 || flag22 || flag31) ? 1 : s[\"revoked\"]), \"phase\": (flag17 ? 1 : ((flag18 || flag21) ? 2 : (flag29 ? 3 : (flag30 ? 4 : (flag31 ? 5 : s[\"phase\"]))))), \"command\": ((flag16 || flag17 || flag18 || flag19 || flag20 || flag21 || flag22 || flag23 || flag24 || flag25 || flag26 || flag27 || flag28 || flag30 || flag31) ? 1 : (flag29 ? 2 : 0))};\n return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};\n}\nreturn { init, step };\n})();\n", "import { bit } from \"./machine.js\";\nimport { bindingStep as lifecycleMachine } from \"./generated/lifecycle.js\";\n\nconst PHASES = [\"Staged\", \"Active\", \"Retiring\", \"Closing\", \"Closed\", \"Failed\"] as const;\nconst EVENTS = [\"Inspect\", \"Activate\", \"Retire\", \"DropOwner\", \"Revoke\", \"Retain\", \"Release\", \"Begin\", \"End\", \"Shut\", \"Complete\", \"Abort\"] as const;\nconst COMMANDS = [\"Denied\", \"Granted\", \"StartClose\"] as const;\n\nexport type BindingPhase = { $: (typeof PHASES)[number] };\nexport interface BindingLife { $: \"Life\"; phase: BindingPhase; owner: boolean; holds: number; calls: number; revoked: boolean }\nexport type BindingEvent = { $: \"Inspect\" | \"Activate\" | \"Retire\" | \"DropOwner\" | \"Revoke\" | \"Release\" | \"End\" | \"Shut\" | \"Complete\" | \"Abort\" } | { $: \"Retain\" | \"Begin\"; cleanup: boolean };\nexport interface BindingOutcome { $: \"Outcome\"; next: BindingLife; command: { $: (typeof COMMANDS)[number] } }\n\nconst index = <T extends string>(values: readonly T[], value: T, what: string): number => {\n const i = values.indexOf(value);\n if (i < 0) throw new Error(`Invalid verified ${what}: ${value}`);\n return i;\n};\nconst named = <T extends string>(values: readonly T[], i: number | undefined, what: string): T => {\n const value = i === undefined ? undefined : values[i];\n if (value === undefined) throw new Error(`Invalid verified ${what} index ${i}`);\n return value;\n};\nconst flag = (value: number | undefined): boolean => {\n if (value !== 0 && value !== 1) throw new Error(\"Invalid verified lifecycle flag\");\n return value === 1;\n};\n\n/** Trusted codec around the compiled lifecycle reducer: the life record is the\n * machine state, and the event and its cleanup bit are the request. */\nexport const bindingStep = (life: BindingLife, event: BindingEvent): BindingOutcome => {\n const state = {\n scalars: {\n phase: index(PHASES, life.phase.$, \"phase\"), owner: bit(life.owner), holds: life.holds,\n calls: life.calls, revoked: bit(life.revoked), command: 0,\n },\n maps: {},\n };\n const next = lifecycleMachine.step({}, state, {\n event: index(EVENTS, event.$, \"event\"), cleanup: bit(\"cleanup\" in event && event.cleanup),\n }).scalars;\n return {\n $: \"Outcome\",\n next: {\n $: \"Life\", phase: { $: named(PHASES, next.phase, \"phase\") }, owner: flag(next.owner),\n holds: next.holds!, calls: next.calls!, revoked: flag(next.revoked),\n },\n command: { $: named(COMMANDS, next.command, \"command\") },\n };\n};\n"],
|
|
5
5
|
"mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA,SAAS,GAAG,GAAG,MAAM;AAAE,MAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,OAAO,wCAAwC,CAAC;AAAG,SAAO;AAAG;AACzK,SAAS,GAAG,GAAG,MAAM;AAAE,MAAI,EAAE,aAAa,KAAM,OAAM,IAAI,WAAW,OAAO,4BAA4B;AAAG,aAAW,CAAC,KAAK,CAAC,KAAK,GAAG;AAAE,OAAG,KAAK,cAAc,IAAI;AAAG,OAAG,GAAG,eAAe,IAAI;AAAA,EAAG;AAAE,SAAO;AAAG;AAC5M,SAAS,MAAM,MAAM,OAAO;AAAE,QAAM,OAAO,oBAAI,IAAI;AAAG,MAAI,OAAO;AAAG,aAAW,KAAK,OAAO,OAAO,IAAI,EAAG,YAAW,OAAO,EAAE,KAAK,EAAG,QAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAAG,aAAW,KAAK,MAAO,YAAW,OAAO,KAAK,CAAC,EAAE,KAAK,EAAG,MAAK,IAAI,GAAG;AAAG,SAAO,CAAC,GAAG,MAAM,IAAI;AAAG;AACrQ,SAAS,OAAO,MAAM,GAAG;AAAE,QAAM,OAAO,KAAK,KAAK,SAAS,CAAC,GAAG,IAAI,EAAE,IAAI,GAAG,QAAQ,oBAAI,IAAI;AAAG,WAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;AAAE,UAAM,IAAI,EAAE,KAAK,CAAC,CAAC;AAAG,QAAI,MAAM,EAAG,OAAM,IAAI,KAAK,CAAC,GAAG,CAAC;AAAA,EAAG;AAAE,SAAO,EAAC,OAAO,EAAC;AAAG;AAEnN,IAAM,sBAAuC,uBAAM;AAE1D,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,QAAQ,GAAG,WAAW,EAAC,GAAG,MAAM,EAAC,UAAU,oBAAI,IAAI,EAAC,EAAC;AAAA,EACzE;AACA,WAASA,MAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,MAAM,GAAG,MAAM,IAAI,GAAG,UAAU,GAAG,QAAQ,GAAG,MAAM,MAAM,GAAG,YAAY,GAAG,cAAc,GAAG,MAAM,YAAY,GAAG,kBAAkB,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,EAAC,GAAG,MAAM,MAAM,aAAa,GAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,UAAU,GAAG,MAAM,QAAQ,GAAG,cAAc,EAAC;AAC/T,UAAM,QAAQ,MAAM,MAAM,CAAC,aAAY,QAAQ,CAAC,EAAE,MAAM,QAAQ,KAAK,WAAW,EAAE,IAAI,CAAC,KAAK,MAAM,MAAQ,KAAK,QAAQ,EAAE,IAAI,CAAC,KAAK,MAAM,CAAG;AAC5I,UAAM,QAAQ,MAAM,MAAM,CAAC,aAAY,QAAQ,CAAC,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,WAAW,EAAE,IAAI,CAAC,KAAK,OAAS,MAAM,KAAK,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAI;AAC/I,UAAM,QAAQ,MAAM,MAAM,CAAC,aAAY,QAAQ,CAAC,EAAE,MAAM,QAAO,KAAK,WAAW,EAAE,IAAI,CAAC,KAAK,OAAO,KAAK,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAG;AAC9H,UAAM,QAAS,IAAI,IAAI,MAAM;AAC7B,UAAM,QAAU,IAAI,IAAI,MAAM,MAAQ,IAAI,YAAY,MAAM,KAAM;AAClE,UAAM,QAAU,IAAI,IAAI,MAAM,MAAQ,EAAE,MAAM,MAAM,KAAO,MAAM,KAAK,QAAQ,EAAE,IAAI,IAAI,MAAM,CAAC,KAAK,IAAI,QAAQ,KAAK;AACrH,QAAI,EAAG,IAAI,IAAI,IAAI,KAAO,IAAI,YAAY,KAAK,KAAM,OAAQ,OAAM,IAAI,WAAW,0GAA0G;AAC5L,UAAM,UAAU,EAAC,GAAG,GAAG,QAAU,SAAS,QAAS,IAAM,IAAI,IAAI,MAAM,IAAK,EAAE,MAAM,IAAI,GAAK,WAAY,QAAQ,IAAI,EAAE;AACvH,UAAM,SAAS,OAAO,MAAM,MAAM,CAAC,aAAY,QAAQ,CAAC,GAAG,OAAO,SAAS,QAAU,KAAK,WAAW,EAAE,IAAI,CAAC,KAAK,IAAO,IAAI,IAAI,MAAM,IAAM,KAAK,QAAQ,EAAE,IAAI,CAAC,KAAK,IAAI,QAAQ,KAAK,IAAK,CAAG;AAC9L,UAAM,KAAK,QAAQ,IAAI,OAAO;AAAO,QAAI,QAAQ,IAAI,OAAO;AAC5D,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,MAAAA,MAAK;AACpB,GAAG;;;ACvBH,IAAM,QAAQ;AAAd,IAAiB,SAAS;AAA1B,IAA6B,MAAM;AAAnC,IAAsC,UAAU;AAOhD,IAAM,cAAc,CAAC,UAAyD,KAAK,UAAU;AAAA,EAC3F,MAAM;AAAA,EAAK,MAAM;AAAA,EAAU,MAAM;AAAA,EAAmB,MAAM;AAAA,EAAY,MAAM;AAC9E,CAAC;AAOM,IAAM,sBAAN,MAAM,qBAAoB;AAAA,EAC/B;AAAA,EACS;AAAA,EACA;AAAA,EAED,YAAY,QAAgD,QAA8B;AAChG,UAAM,YAAY,OAAO,IAAI,WAAS,OAAO,OAAO,EAAE,GAAG,MAAM,CAAC,CAAC;AACjE,SAAK,UAAU,IAAI,IAAI,UAAU,IAAI,WAAS,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC;AACjE,SAAK,SAAS,SAAS,OAAO,SAAS,IAAI,SAAS;AACpD,UAAM,YAAY,MAAM,UAAU,IAAI,WAAS,KAAK,OAAO,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC;AAClF,UAAM,eAAe,SAAS,MAAM,QAAQ,OAAO,QAAQ,QAAQ,CAAC,IAAI,oBAAI,IAAoB;AAChG,SAAK,SAAS,oBAAoB,KAAK,CAAC,GAAG,oBAAoB,KAAK,CAAC,CAAC,GAAG;AAAA,MACvE,IAAI,SAAS,SAAS;AAAA,MAAO,MAAM;AAAA,MAAG,YAAY,IAAI,QAAQ,UAAU,KAAK;AAAA,MAC7E,WAAW;AAAA,MAAW,QAAQ;AAAA,IAChC,CAAC;AAAA,EACH;AAAA,EAEA,OAAO,MAAM,QAAqE;AAChF,WAAO,IAAI,qBAAoB,MAAM;AAAA,EACvC;AAAA,EAEA,OAAO,QAAqE;AAC1E,WAAO,IAAI,qBAAoB,QAAQ,IAAI;AAAA,EAC7C;AAAA,EAEA,IAAI,SAAkB;AACpB,WAAO,KAAK,OAAO,QAAQ,SAAS;AAAA,EACtC;AAAA,EAEA,UAAgB;AACd,SAAK,SAAS,oBAAoB,KAAK,CAAC,GAAG,KAAK,QAAQ,EAAE,IAAI,SAAS,MAAM,GAAG,YAAY,GAAG,WAAW,oBAAI,IAAI,GAAG,QAAQ,oBAAI,IAAI,EAAE,CAAC;AAAA,EAC1I;AAAA,EAEA,QAAQ,KAAsD;AAC5D,UAAM,QAAQ,KAAK,QAAQ,IAAI,GAAG;AAClC,QAAI,CAAC,MAAO,QAAO;AACnB,SAAK,SAAS,oBAAoB,KAAK,CAAC,GAAG,KAAK,QAAQ;AAAA,MACtD,IAAI;AAAA,MAAK,MAAM,KAAK,OAAO,GAAG,YAAY,KAAK,CAAC;AAAA,MAAG,YAAY;AAAA,MAAG,WAAW,oBAAI,IAAI;AAAA,MAAG,QAAQ,oBAAI,IAAI;AAAA,IAC1G,CAAC;AACD,WAAO,KAAK,OAAO,QAAQ,YAAY,IAAI,EAAE,GAAG,MAAM,IAAI;AAAA,EAC5D;AAAA,EAEA,WAA0C;AACxC,WAAO,KAAK,SAAS,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,EAAE,IAAI,YAAU,EAAE,GAAG,MAAM,EAAE,IAAI,CAAC;AAAA,EAClF;AACF;;;AC/DA,SAAS,cAAAC,mBAAkB;;;ACD3B,SAASC,IAAG,GAAG,MAAM;AAAE,MAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,OAAO,wCAAwC,CAAC;AAAG,SAAO;AAAG;AACzK,SAASC,IAAG,GAAG,MAAM;AAAE,MAAI,EAAE,aAAa,KAAM,OAAM,IAAI,WAAW,OAAO,4BAA4B;AAAG,aAAW,CAAC,KAAK,CAAC,KAAK,GAAG;AAAE,IAAAD,IAAG,KAAK,cAAc,IAAI;AAAG,IAAAA,IAAG,GAAG,eAAe,IAAI;AAAA,EAAG;AAAE,SAAO;AAAG;AAC5M,SAASE,OAAM,MAAM,OAAO;AAAE,QAAM,OAAO,oBAAI,IAAI;AAAG,MAAI,OAAO;AAAG,aAAW,KAAK,OAAO,OAAO,IAAI,EAAG,YAAW,OAAO,EAAE,KAAK,EAAG,QAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAAG,aAAW,KAAK,MAAO,YAAW,OAAO,KAAK,CAAC,EAAE,KAAK,EAAG,MAAK,IAAI,GAAG;AAAG,SAAO,CAAC,GAAG,MAAM,IAAI;AAAG;AACrQ,SAAS,QAAQ,MAAM,OAAO,MAAM;AAAE,QAAM,IAAI,oBAAI,IAAI,CAAC,CAAC,CAAC;AAAG,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,OAAO;AAAE,eAAW,KAAK,KAAK,CAAC,EAAE,KAAK,GAAG;AAAE,UAAI,MAAO,GAAE,IAAI,IAAI,CAAC;AAAA,eAAY,KAAK,EAAG,GAAE,IAAI,IAAI,CAAC;AAAA,IAAG;AAAE,QAAI,MAAO,GAAE,IAAI,CAAC;AAAA,EAAG;AAAE,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,MAAM;AAAE,QAAI,OAAO;AAAE,QAAE,IAAI,IAAI,CAAC;AAAG,QAAE,IAAI,CAAC;AAAA,IAAG,WAAW,KAAK,EAAG,GAAE,IAAI,IAAI,CAAC;AAAA,EAAG;AAAE,QAAM,OAAO,oBAAI,IAAI;AAAG,aAAW,KAAK,EAAG,UAAS,IAAI,IAAI,KAAK,GAAG,IAAK,KAAI,IAAI,KAAK,EAAG,MAAK,IAAI,IAAI,CAAC;AAAG,QAAM,SAAS,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAAG,SAAO,KAAK,OAAO,OAAO,SAAS,CAAC,IAAI,CAAC;AAAG,SAAO;AAAQ;AACvhB,SAASC,QAAO,MAAM,GAAG;AAAE,QAAM,OAAO,KAAK,KAAK,SAAS,CAAC,GAAG,IAAI,EAAE,IAAI,GAAG,QAAQ,oBAAI,IAAI;AAAG,WAAS,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;AAAE,UAAM,IAAI,EAAE,KAAK,CAAC,CAAC;AAAG,QAAI,MAAM,EAAG,OAAM,IAAI,KAAK,CAAC,GAAG,CAAC;AAAA,EAAG;AAAE,SAAO,EAAC,OAAO,EAAC;AAAG;AAE1N,SAAS,MAAM,IAAI,GAAG,GAAG,GAAG;AAAE,QAAM,KAAK,oBAAI,IAAI;AAAG,aAAW,MAAM,IAAI;AAAE,UAAM,IAAI,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAAG,QAAI,EAAG,GAAE,KAAK,EAAE;AAAA,QAAQ,IAAG,IAAI,GAAG,CAAC,EAAE,CAAC;AAAA,EAAG;AAAE,SAAO,GAAG,MAAM,OAAK;AAAE,UAAM,IAAI,GAAG,IAAI,EAAE,CAAC,CAAC;AAAG,WAAO,MAAM,UAAa,EAAE,MAAM,QAAM,EAAE,GAAG,EAAE,CAAC;AAAA,EAAG,CAAC;AAAG;AAC5P,SAAS,QAAQ,MAAM,GAAG;AAAE,QAAM,MAAM,oBAAI,IAAI;AAAG,aAAW,KAAK,KAAM,UAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,IAAI,IAAI,CAAC;AAAG,SAAO,CAAC,GAAG,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAAG;AAErJ,IAAM,gBAAiC,uBAAM;AAEpD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,SAAS,EAAC,GAAG,MAAM,EAAC,SAAS,oBAAI,IAAI,EAAC,EAAC;AAAA,EAC3D;AACA,WAASC,MAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,MAAMC,IAAG,MAAM,IAAI,GAAG,UAAU,GAAG,SAASA,IAAG,MAAM,OAAO,GAAG,aAAa,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,EAAC,GAAG,MAAM,MAAM,SAASC,IAAG,MAAM,OAAO,GAAG,aAAa,GAAG,OAAOA,IAAG,MAAM,KAAK,GAAG,WAAW,EAAC;AAClP,UAAM,QAAQC,OAAM,MAAM,CAAC,OAAO,CAAC,EAAE,MAAM,QAAO,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,MAAM,CAAE;AAClF,UAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,OAAU,EAAE,MAAM,MAAQ,EAAE,MAAM,EAAK;AACvK,UAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,SAAS,GAAG,KAAK,GAAG,CAAC,SAAS,GAAG,KAAK,GAAG,CAAC,SAAS,GAAG,KAAK,GAAG,CAAC,SAAS,GAAG,KAAK,GAAG,CAAC,SAAS,GAAG,KAAK,GAAG,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,GAAG,CAAC,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,QAAS,EAAE,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,OAAS,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,QAAU,EAAE,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,OAAS,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,QAAW,EAAE,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,OAAU,EAAE,MAAM,MAAQ,EAAE,MAAM,MAAQ,IAAI,OAAS,KAAK,KAAK,EAAE,IAAI,CAAC,KAAK,MAAM,IAAO;AACthB,UAAM,QAAQA,OAAM,MAAM,CAAC,SAAQ,OAAO,CAAC,EAAE,MAAM,QAAO,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,QAAQ,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,EAAG;AACrI,UAAM,QAAQA,OAAM,MAAM,CAAC,SAAQ,KAAK,CAAC,EAAE,MAAM,OAAO,EAAE,MAAM,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,QAAU,KAAK,KAAK,EAAE,IAAI,CAAC,KAAK,MAAM,GAAK;AACnI,UAAM,QAAU,MAAM,KAAK,OAAO,EAAE,IAAI,IAAI,OAAO,CAAC,KAAK,OAAU,IAAI,IAAI,MAAM,KAAM,SAAY,IAAI,IAAI,MAAM,MAAQ,EAAE,OAAO,MAAM,KAAM;AAC9I,QAAI,EAAG,IAAI,IAAI,IAAI,KAAM,OAAQ,OAAM,IAAI,WAAW,oGAAoG;AAC1J,UAAM,UAAU,EAAC,GAAG,GAAG,SAAU,QAAQ,IAAI,EAAE;AAC/C,UAAM,SAASC,QAAOD,OAAM,MAAM,CAAC,OAAO,CAAC,GAAG,OAAM,QAAS,KAAK,OAAO,EAAE,IAAI,CAAC,KAAK,IAAK,CAAE;AAC5F,UAAM,KAAK,OAAO,IAAI,OAAO;AAAO,QAAI,OAAO,IAAI,OAAO;AAC1D,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,MAAAH,MAAK;AACpB,GAAG;AAqBI,IAAM,iBAAkC,uBAAM;AAErD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,YAAY,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EAC5C;AACA,WAASK,MAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,SAASC,IAAG,MAAM,OAAO,GAAG,aAAa,GAAG,SAASA,IAAG,MAAM,OAAO,GAAG,aAAa,GAAG,UAAUA,IAAG,MAAM,QAAQ,GAAG,cAAc,GAAG,UAAUA,IAAG,MAAM,QAAQ,GAAG,cAAc,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,EAAC,GAAG,MAAM,MAAM,YAAYC,IAAG,MAAM,UAAU,GAAG,gBAAgB,GAAG,aAAaA,IAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,WAAWA,IAAG,MAAM,SAAS,GAAG,eAAe,GAAG,YAAYA,IAAG,MAAM,UAAU,GAAG,gBAAgB,GAAG,aAAaA,IAAG,MAAM,WAAW,GAAG,iBAAiB,GAAG,WAAWA,IAAG,MAAM,SAAS,GAAG,eAAe,GAAG,WAAWA,IAAG,MAAM,SAAS,GAAG,eAAe,GAAG,WAAWA,IAAG,MAAM,SAAS,GAAG,eAAe,GAAG,WAAWA,IAAG,MAAM,SAAS,GAAG,eAAe,GAAG,WAAWA,IAAG,MAAM,SAAS,GAAG,eAAe,EAAC;AAC7wB,UAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,OAAO,EAAE,IAAI,IAAI,QAAQ,OAAS,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,KAAK,IAAI,OAAO,CAAG;AACvK,UAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,OAAO,EAAE,IAAI,IAAI,QAAQ,OAAS,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,KAAK,IAAI,OAAO,CAAG;AACvK,UAAM,QAAS,SAAS;AACxB,UAAM,SAAS,QAAM,GAAG,MAAM,OAAK,GAAG,MAAM,QAAQ,EAAG,IAAI,IAAI,OAAO,KAAO,KAAK,IAAI,OAAO,KAAO,KAAK,MAAS,GAAK,KAAK,UAAU,EAAE,IAAI,CAAC,KAAK,OAAO,MAAQ,KAAK,UAAU,EAAE,IAAI,EAAE,KAAK,OAAO,OAAS,KAAK,WAAW,EAAE,IAAI,CAAC,KAAK,OAAO,MAAQ,KAAK,WAAW,EAAE,IAAI,EAAE,KAAK,OAAO,MAAS,GAAI,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,OAAO,MAAQ,KAAK,SAAS,EAAE,IAAI,EAAE,KAAK,OAAO,GAAO,CAAC,GAAG,QAAQ,QAAQ,MAAM,CAAC,CAAC,YAAY,GAAG,KAAK,GAAG,CAAC,aAAa,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,GAAG,CAAC,YAAY,GAAG,KAAK,GAAG,CAAC,aAAa,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,OAAO,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,OAAO,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;AAChmB,UAAM,QAAQ,MAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,WAAW,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,OAAM,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,GAAI,QAAO,KAAK,SAAS,EAAE,IAAI,EAAE,KAAK,GAAI,CAAC,GAAG,OAAS,EAAG,IAAI,IAAI,QAAQ,KAAO,KAAK,IAAI,QAAQ,MAAQ,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,QAAQ,KAAK,SAAS,EAAE,IAAI,EAAE,KAAK,MAAQ,KAAK,MAAS,GAAI,KAAK,UAAU,EAAE,IAAK,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,CAAE,KAAK,OAAO,MAAQ,KAAK,UAAU,EAAE,IAAK,KAAK,SAAS,EAAE,IAAI,EAAE,KAAK,CAAE,KAAK,OAAO,OAAS,KAAK,WAAW,EAAE,IAAK,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,CAAE,KAAK,OAAO,MAAQ,KAAK,WAAW,EAAE,IAAK,KAAK,SAAS,EAAE,IAAI,EAAE,KAAK,CAAE,KAAK,OAAO,GAAM;AAC/uB,UAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,YAAY,GAAG,KAAK,GAAG,CAAC,aAAa,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,OAAO,GAAG,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,OAAO,EAAE,IAAI,IAAI,OAAO,OAAU,KAAK,UAAU,EAAE,IAAI,CAAC,KAAK,MAAM,MAAQ,KAAK,WAAW,EAAE,IAAI,CAAC,KAAK,MAAM,MAAQ,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,MAAM,CAAI;AACjS,UAAM,QAAQ,QAAQ,MAAM,CAAC,CAAC,YAAY,GAAG,KAAK,GAAG,CAAC,aAAa,GAAG,KAAK,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,OAAO,GAAG,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,OAAO,EAAE,IAAI,IAAI,OAAO,OAAU,KAAK,UAAU,EAAE,IAAI,CAAC,KAAK,MAAM,MAAQ,KAAK,WAAW,EAAE,IAAI,CAAC,KAAK,MAAM,MAAQ,KAAK,SAAS,EAAE,IAAI,CAAC,KAAK,MAAM,CAAI;AACjS,QAAI,EAAE,SAAS,SAAS,OAAQ,OAAM,IAAI,WAAW,qGAAqG;AAC1J,UAAM,UAAU,EAAC,GAAG,GAAG,YAAc,SAAS,QAAS,IAAI,EAAE;AAC7D,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,MAAAF,MAAK;AACpB,GAAG;;;ACjEH,IAAM,QAAQ;AAAd,IAAiB,WAAW;AAA5B,IAA+B,QAAQ;AACvC,IAAM,UAAyB,OAAO,OAAO,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,CAAC,CAAC,EAAuB,CAAC;AAM5G,IAAM,gBAAN,MAAoB;AAAA,EACT,OAAO,oBAAI,IAAoB;AAAA,EAC/B,SAAmB,CAAC;AAAA,EAC7B,GAAG,OAAwB;AACzB,QAAI,OAAO,UAAU,YAAY,UAAU,GAAI,QAAO;AACtD,QAAI,UAAU,IAAK,QAAO;AAC1B,QAAI,KAAK,KAAK,KAAK,IAAI,KAAK;AAC5B,QAAI,OAAO,QAAW;AACpB,WAAK,QAAQ,KAAK,OAAO;AACzB,WAAK,KAAK,IAAI,OAAO,EAAE;AACvB,WAAK,OAAO,KAAK,KAAK;AAAA,IACxB;AACA,WAAO;AAAA,EACT;AAAA,EACA,KAAK,IAAoB;AACvB,UAAM,OAAO,KAAK,OAAO,KAAK,KAAK;AACnC,QAAI,SAAS,OAAW,OAAM,IAAI,MAAM,gCAAgC,EAAE,EAAE;AAC5E,WAAO;AAAA,EACT;AAAA;AAAA,EAEA,QAAQ,KAA4C;AAClD,UAAM,QAAQ,oBAAI,IAAoB;AACtC,eAAW,MAAM,IAAK,KAAI,MAAM,MAAO,OAAM,IAAI,IAAI,KAAK,KAAK,EAAE,EAAE,MAAM;AACzE,WAAO;AAAA,EACT;AACF;AAEA,IAAM,SAAS;AAAf,IAAkB,YAAY;AAC9B,IAAM,OAAO,CAAC,OAAsB,OAA8C,IAAY,WAA+B;AAC3H,QAAM,MAAM,OAAO,IAAI,CAAC,UAAU,MAAM,GAAG,KAAK,CAAC;AACjD,SAAO,cAAc,KAAK,CAAC,GAAG,OAAO,EAAE,IAAI,OAAO,IAAI,CAAC,KAAK,OAAO,OAAO,MAAM,GAAG,GAAG,KAAK,MAAM,QAAQ,GAAG,EAAE,CAAC;AACjH;AAEA,IAAM,SAAS,CAAC,OAAsB,OAA8C,UAA6C;AAC/H,MAAI,MAAM,QAAQ,UAAU,EAAG,QAAO;AAEtC,QAAM,OAAO,IAAI,IAAI,QAAQ,OAAO,OAAO,CAAC;AAC5C,QAAM,SAAS,CAAC,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,UAAU,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;AACjG,MAAI,KAAK,OAAO,EAAG,OAAM,IAAI,MAAM,sDAAsD;AACzF,SAAO,EAAE,OAAO,MAAM,OAAO,OAAO,IAAI,CAAC,OAAO,MAAM,KAAK,EAAE,CAAC,EAAE;AAClE;AAGO,IAAM,iBAAiB,CAAC,WAA0D;AACvF,QAAM,WAAsB,MAAM,QAAQ,MAAM,IAAI,MAAM,KAAK,MAAM,IAAI,CAAC;AAC1E,QAAM,QAAQ,IAAI,cAAc;AAChC,SAAO,OAAO,OAAO,KAAK,OAAO,cAAc,KAAK,CAAC,CAAC,GAAG,QAAQ,QAAQ,GAAG,QAAQ;AACtF;AAEO,IAAM,sBAAsB,CAAC,UAAoC,MAAM,QAAQ,CAAC,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG;AAItG,IAAM,oBAAoB,CAAC,QAAwC,aAAgD;AACxH,QAAM,WAAsB,MAAM,QAAQ,MAAM,IAAI,MAAM,KAAK,MAAM,IAAI,CAAC;AAC1E,QAAM,YAAY,MAAM,KAAK,QAAQ;AACrC,QAAM,QAAQ,IAAI,cAAc;AAEhC,aAAW,SAAS,UAAW,OAAM,GAAG,KAAK;AAC7C,QAAM,SAAS,KAAK,OAAO,cAAc,KAAK,CAAC,CAAC,GAAG,QAAQ,QAAQ;AACnE,SAAO,OAAO,OAAO,KAAK,OAAO,QAAQ,WAAW,SAAS,GAAG,SAAS;AAC3E;AAEO,IAAM,yBAAyB,CAAC,cAAuD;AAE5F,QAAM,WAAsB,MAAM,QAAQ,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC;AAChF,QAAM,WAAW,oBAAI,IAAa;AAClC,aAAW,YAAY,UAAU;AAC/B,aAAS,IAAI,QAAQ;AACrB,QAAI,SAAS,OAAO,GAAI;AAAA,EAC1B;AACA,SAAO,oBAAoB,kBAAkB,UAAU,CAAC,GAAG,QAAQ,CAAC,CAAC;AACvE;AAEO,IAAM,wBAAwB,CACnC,YACqB,QAAQ,IAAI,CAAC,WAAW,OAAO,SAAS,SAC3D,EAAE,QAAQ,OAAO,SAAS,OAAO,OAAO,QAAQ,IAChD,EAAE,QAAQ,MAAM,SAAS,OAAO,aAAa,eAAe,OAAO,eAAe,OAAO,SAAS,EAAE,CAAC;AAczG,IAAM,cAAc,CAAC,UAAqC;AAAA,EACxD,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAAA,EACtD,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;AAAA,EACxD,OAAO,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC;AAC5D;AAIA,IAAM,WAAW,CAAC,OAAsB,SAAoC;AAC1E,QAAM,OAAO,KAAK,QAAQ,CAAC,GAAG,UAAU,EAAE,MAAM,QAAQ,EAAE,MAAM,QAAQ,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAU,CAAC;AAC1H,SAAO,EAAE,KAAK,KAAK,QAAQ,MAAM,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,MAAM,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE;AACpI;AAKO,IAAMG,kBAAiB,CAAC,MAAiC,UAA8C;AAC5G,QAAM,QAAQ,IAAI,cAAc;AAChC,QAAM,IAAI,YAAY,IAAI,GAAG,IAAI,YAAY,KAAK,GAAG,KAAK,SAAS,OAAO,IAAI,GAAG,KAAK,SAAS,OAAO,KAAK;AAC3G,QAAM,QAAQ,eAAc,KAAK,CAAC,GAAG,eAAc,KAAK,CAAC,CAAC,GAAG;AAAA,IAC3D,OAAO,KAAK;AAAA,IAAQ,OAAO,MAAM;AAAA,IAAQ,QAAQ,GAAG;AAAA,IAAK,QAAQ,GAAG;AAAA,IACpE,YAAY,EAAE;AAAA,IAAQ,aAAa,EAAE;AAAA,IAAS,WAAW,EAAE;AAAA,IAC3D,YAAY,EAAE;AAAA,IAAQ,aAAa,EAAE;AAAA,IAAS,WAAW,EAAE;AAAA,IAC3D,WAAW,GAAG;AAAA,IAAM,WAAW,GAAG;AAAA,IAAM,WAAW,GAAG;AAAA,IAAM,WAAW,GAAG;AAAA,EAC5E,CAAC;AACD,SAAO,MAAM,QAAQ,aAAa;AACpC;;;AC1HO,IAAM,mCAAN,cAA+C,MAAM;AAAA,EAC1D,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAEA,IAAM,qBAAqB;AAEpB,IAAM,sBAAsB,CACjC,cACA,kBACiC;AACjC,MAAI,OAAO,iBAAiB,SAAU,QAAO,EAAE,OAAO,aAAa;AACnE,SAAO,EAAE,OAAO,eAAe,GAAG,aAAa;AACjD;AAEO,IAAM,qBAAqB,CAChC,kBAC+B;AAAA,EAC/B,OAAO,aAAa,OAAO,KAAK,EAAE,MAAM,GAAG,GAAG,KAAK;AAAA,EACnD,MAAM,aAAa,QAAQ;AAAA,EAC3B,WAAW,mBAAmB,aAAa,SAAS;AAAA,EACpD,UAAU,aAAa,YAAY;AACrC;AAEO,IAAM,eAAe,CAC1B,WAC0C;AAC1C,MAAI,CAAC,OAAO,UAAU,OAAO,OAAO,SAAS,OAAQ,QAAO;AAC5D,SAAO;AAAA,IACL,OAAO,OAAO;AAAA,IACd,MAAM,OAAO,OAAO;AAAA,IACpB,WAAW,mBAAmB,OAAO,OAAO,SAAS;AAAA,IACrD,UAAU,OAAO,OAAO,YAAY;AAAA,EACtC;AACF;AAaO,IAAM,mBAAmB,CAC9B,YACiC;AACjC,QAAM,yBAAyB,oBAAI,IAAqB;AACxD,MAAI,oBAAoB;AACxB,MAAI,aAAa;AACjB,MAAI,2BAA2B;AAC/B,MAAI,YAAY;AAChB,aAAW,UAAU,SAAS;AAC5B,QAAI,OAAO,SAAS,OAAQ;AAC5B;AACA,UAAM,iBAAiB,OAAO,aAAa;AAC3C,0BAAsB;AACtB,eAAW,YAAY,OAAO,WAAW;AACvC,UAAI,aAAa,KAAK;AACpB,qBAAa;AACb,qCAA6B;AAAA,MAC/B,OAAO;AACL,+BAAuB;AAAA,UACrB;AAAA,WACC,uBAAuB,IAAI,QAAQ,KAAK,UAAU;AAAA,QACrD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AAAA,IACL,cAAc,sBAAsB,OAAO;AAAA,IAC3C,YAAY,YAAY;AAAA,IACxB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,IAAM,yBAAyB,CACpC,MACA,UACmC;AAGnC,MAAI,CAACC,gBAAe,KAAK,cAAc,MAAM,YAAY,EAAG,QAAO,CAAC;AACpE,QAAM,YAA4C,CAAC;AACnD,MACE;AAAA,IACE,KAAK;AAAA,IAAY,KAAK;AAAA,IAA0B,KAAK;AAAA,IACrD,MAAM;AAAA,IAAY,MAAM;AAAA,IAA0B,MAAM;AAAA,EAC1D,GACA;AACA,cAAU,KAAK,EAAE,WAAW,CAAC,GAAG,GAAG,QAAQ,mBAAmB,CAAC;AAAA,EACjE;AACA,QAAM,UAAU,CAAC,GAAG,KAAK,uBAAuB,KAAK,CAAC,EACnD;AAAA,IAAO,CAAC,aACP;AAAA,MACE,MAAM,uBAAuB,IAAI,QAAQ;AAAA,MACzC,KAAK,uBAAuB,IAAI,QAAQ,KAAK;AAAA,MAC7C,MAAM,uBAAuB,IAAI,QAAQ,KAAK;AAAA,IAChD;AAAA,EACF,EACC,KAAK;AACR,MAAI,QAAQ,SAAS,GAAG;AACtB,cAAU,KAAK,EAAE,WAAW,SAAS,QAAQ,kBAAkB,CAAC;AAAA,EAClE;AACA,SAAO,UAAU,SAAS,IAAI,YAAY,CAAC,EAAE,WAAW,CAAC,GAAG,GAAG,QAAQ,mBAAmB,CAAC;AAC7F;AAEO,IAAM,oBAAoB,CAC/B,MACA,UAEA,KAAK,MAAM,cAAc,MAAM,KAAK,KACpC,KAAK,KAAK,cAAc,MAAM,IAAI,KAClC,KAAK,SAAS,cAAc,MAAM,QAAQ,KAC1C,KAAK,UAAU,KAAK,IAAI,EAAE,cAAc,MAAM,UAAU,KAAK,IAAI,CAAC;;;ACrGpE,IAAM,yBAA+D;AAAA;AAAA,EAEnE,CAAC,UAAU,UAAU,QAAQ,SAAS,UAAU,QAAQ,QAAQ,QAAQ;AAAA;AAAA,EAExE,CAAC,UAAU,OAAO,QAAQ,SAAS,QAAQ,QAAQ,MAAM;AAAA;AAAA,EAEzD,CAAC,YAAY,QAAQ,MAAM,aAAa,OAAO;AAAA;AAAA,EAE/C,CAAC,cAAc,SAAS,OAAO,OAAO,QAAQ,UAAU,SAAS,UAAU,UAAU,MAAM;AAAA;AAAA,EAE3F,CAAC,UAAU,SAAS,OAAO,OAAO,QAAQ,UAAU;AAAA;AAAA;AAAA,EAGpD,CAAC,WAAW,QAAQ,QAAQ,QAAQ;AAAA;AAAA,EAEpC,CAAC,UAAU,UAAU,MAAM,WAAW,QAAQ,OAAO;AAAA;AAAA,EAErD,CAAC,UAAU,WAAW,WAAW,WAAW,QAAQ;AAAA;AAAA;AAAA,EAGpD,CAAC,UAAU,QAAQ,WAAW,UAAU,YAAY,KAAK;AAAA;AAAA,EAEzD,CAAC,OAAO,WAAW,QAAQ,UAAU,QAAQ,SAAS,IAAI;AAAA;AAAA,EAE1D,CAAC,UAAU,SAAS,QAAQ,QAAQ,WAAW;AAAA;AAAA,EAE/C,CAAC,UAAU,SAAS,YAAY,UAAU,WAAW,SAAS;AAAA;AAAA,EAE9D,CAAC,WAAW,OAAO,WAAW,UAAU,YAAY,aAAa;AAAA;AAAA,EAEjE,CAAC,aAAa,SAAS,UAAU,WAAW,QAAQ;AAAA;AAAA,EAEpD,CAAC,WAAW,SAAS,YAAY,WAAW,UAAU;AAAA;AAAA,EAEtD,CAAC,UAAU,SAAS,UAAU;AAAA;AAAA;AAAA,EAG9B,CAAC,OAAO,QAAQ,OAAO,MAAM;AAC/B;AAIA,IAAM,sBAAsB,CAAC,SAC3B,KAAK,YAAY,EAAE,QAAQ,cAAc,EAAE;AAE7C,IAAM,qBAAqB,uBAAuB;AAAA,EAAI,CAAC,QACrD,IAAI,IAAI,IAAI,IAAI,mBAAmB,CAAC;AACtC;AAEA,IAAM,cAAc,CAAC,SACnB,KACG,QAAQ,sBAAsB,OAAO,EACrC,QAAQ,yBAAyB,OAAO,EACxC,YAAY,EACZ,MAAM,YAAY,EAClB,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC;AAIvC,IAAM,qBAAqB,CAAC,SAC1B,KAAK,SAAS,KAAK,KAAK,SAAS,GAAG,IAAI,KAAK,MAAM,GAAG,EAAE,IAAI;AAE9D,IAAM,cAAc,CAAC,MAAc,UAA0B;AAC3D,MAAI,SAAS,MAAO,QAAO;AAC3B,MAAI,KAAK,WAAW,EAAG,QAAO,MAAM;AACpC,MAAI,MAAM,WAAW,EAAG,QAAO,KAAK;AACpC,MAAI,WAAW,IAAI,MAAc,MAAM,SAAS,CAAC;AACjD,MAAI,UAAU,IAAI,MAAc,MAAM,SAAS,CAAC;AAChD,WAAS,IAAI,GAAG,KAAK,MAAM,QAAQ,IAAK,UAAS,CAAC,IAAI;AACtD,WAAS,IAAI,GAAG,KAAK,KAAK,QAAQ,KAAK;AACrC,YAAQ,CAAC,IAAI;AACb,aAAS,IAAI,GAAG,KAAK,MAAM,QAAQ,KAAK;AACtC,cAAQ,CAAC,IAAI,KAAK;AAAA,QAChB,SAAS,CAAC,IAAK;AAAA,QACf,QAAQ,IAAI,CAAC,IAAK;AAAA,QAClB,SAAS,IAAI,CAAC,KAAM,KAAK,IAAI,CAAC,MAAM,MAAM,IAAI,CAAC,IAAI,IAAI;AAAA,MACzD;AAAA,IACF;AACA,UAAM,OAAO;AACb,eAAW;AACX,cAAU;AAAA,EACZ;AACA,SAAO,SAAS,MAAM,MAAM;AAC9B;AAIA,IAAM,gBAAgB,CAAC,SACrB,KAAK,UAAU,IAAI,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,SAAS,CAAC,CAAC;AAEhE,IAAM,eAAe,CAAC,SAAmB,aAAgC;AACvE,MAAI,QAAQ,WAAW,KAAK,QAAQ,WAAW,SAAS,OAAQ,QAAO;AACvE,SAAO,QAAQ,MAAM,CAAC,OAAOC,WAAU;AACrC,UAAM,QAAQ,SAASA,MAAK;AAC5B,QAAI,UAAU,MAAO,QAAO;AAC5B,WAAO,MAAM,UAAU,KAAK,MAAM,UAAU,MACzC,MAAM,WAAW,KAAK,KAAK,MAAM,WAAW,KAAK;AAAA,EACtD,CAAC;AACH;AAEA,IAAM,YAAY,CAAC,UACjB,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAgBrE,IAAM,eAAe,oBAAI,QAA4C;AACrE,IAAM,kBAAkB,CAAC,aAAiD;AACxE,QAAM,SAAS,aAAa,IAAI,QAAQ;AACxC,MAAI,QAAQ,MAAM,WAAW,SAAS,UAAU,OAAO,MAAM,MAAM,CAAC,OAAOA,WAAU,MAAM,SAAS,SAASA,MAAK,CAAC,GAAG;AACpH,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,SAAS,IAAI,CAAC,SAAS;AACnC,UAAM,OAAO,oBAAoB,IAAI;AACrC,WAAO,EAAE,MAAM,MAAM,UAAU,mBAAmB,IAAI,GAAG,QAAQ,YAAY,IAAI,EAAE;AAAA,EACrF,CAAC;AACD,QAAMC,YAAW,EAAE,OAAO,SAAS,oBAAI,IAA8B,EAAE;AACvE,eAAa,IAAI,UAAUA,SAAQ;AACnC,SAAOA;AACT;AAOA,IAAM,sBAAsB,CAC1B,SACA,eACqB;AACrB,QAAM,cAAc,oBAAoB,UAAU;AAClD,MAAI,YAAY,WAAW,EAAG,QAAO,EAAE,aAAa,CAAC,EAAE;AACvD,MAAI,QAAQ,KAAK,CAAC,UAAU,MAAM,SAAS,UAAU,EAAG,QAAO,EAAE,aAAa,CAAC,EAAE;AACjF,QAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC;AAG/E,QAAM,QAAQ,MAAM,OAAO,CAAC,UAAU,MAAM,SAAS,WAAW,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AAC3F,MAAI,MAAM,WAAW,EAAG,QAAO,EAAE,UAAU,MAAM,CAAC,GAAI,aAAa,MAAM;AACzE,MAAI,MAAM,SAAS,EAAG,QAAO,EAAE,aAAa,UAAU,KAAK,EAAE;AAC7D,MAAI,MAAM,WAAW,EAAG,QAAO,EAAE,aAAa,CAAC,EAAE;AAIjD,QAAM,kBAAkB,UAAU,mBAC/B,OAAO,CAAC,eAAe,WAAW,IAAI,WAAW,CAAC,EAClD;AAAA,IAAQ,CAAC,eACR,MAAM,OAAO,CAAC,UAAU,WAAW,IAAI,MAAM,IAAI,CAAC,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AAAA,EAC/E,CAAC;AACH,MAAI,gBAAgB,WAAW,GAAG;AAChC,WAAO,EAAE,UAAU,gBAAgB,CAAC,GAAI,aAAa,CAAC,gBAAgB,CAAC,CAAE,EAAE;AAAA,EAC7E;AACA,MAAI,gBAAgB,SAAS,GAAG;AAC9B,WAAO,EAAE,aAAa,UAAU,eAAe,EAAE;AAAA,EACnD;AAIA,QAAM,gBAAgB,YAAY,UAAU;AAC5C,QAAM,kBAAkB,mBAAmB,WAAW;AACtD,QAAM,UAAoB,CAAC;AAC3B,aAAW,SAAS,OAAO;AACzB,QACE,MAAM,SAAS,eACf,MAAM,aAAa,mBAClB,cAAc,SAAS,KAAK,aAAa,eAAe,MAAM,MAAM,KACpE,YAAY,UAAU,KAAK,MAAM,KAAK,WAAW,WAAW,GAC7D;AACA,cAAQ,KAAK,MAAM,IAAI;AAAA,IACzB;AAAA,EACF;AACA,MAAI,QAAQ,SAAS,EAAG,QAAO,EAAE,aAAa,UAAU,OAAO,EAAE;AAGjE,QAAM,YAAY,MAAM,IAAI,CAAC,WAAW;AAAA,IACtC,MAAM,MAAM;AAAA,IACZ,UAAU,YAAY,aAAa,MAAM,IAAI;AAAA,EAC/C,EAAE;AACF,QAAM,MAAM,KAAK,IAAI,GAAG,UAAU,IAAI,CAAC,UAAU,MAAM,QAAQ,CAAC;AAChE,QAAM,YAAY,cAAc,WAAW;AAC3C,MAAI,OAAO,WAAW;AACpB,UAAM,UAAU;AAAA,MACd,UAAU,OAAO,CAAC,UAAU,MAAM,aAAa,GAAG,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AAAA,IAC/E;AACA,WAAO,EAAE,aAAa,QAAQ;AAAA,EAChC;AAGA,QAAM,cAAc,UACjB,OAAO,CAAC,UAAU,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK,MAAM,YAAY,SAAS,CAAC,CAAC,CAAC,EACnF;AAAA,IAAK,CAAC,MAAM,UACX,KAAK,WAAW,MAAM,YAAY,KAAK,KAAK,cAAc,MAAM,IAAI;AAAA,EACtE,EACC,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,UAAU,MAAM,IAAI;AAC5B,SAAO,EAAE,aAAa,UAAU,WAAW,EAAE;AAC/C;AAIO,IAAM,mBAAmB,CAAC,UAA6B,eAAyC;AACrG,QAAM,UAAU,gBAAgB,QAAQ;AACxC,MAAI,SAAS,QAAQ,QAAQ,IAAI,UAAU;AAC3C,MAAI,CAAC,QAAQ;AACX,aAAS,oBAAoB,QAAQ,OAAO,UAAU;AACtD,QAAI,WAAW,UAAU,KAAK;AAC5B,UAAI,QAAQ,QAAQ,QAAQ,IAAK,SAAQ,QAAQ,OAAO,QAAQ,QAAQ,KAAK,EAAE,KAAK,EAAE,KAAM;AAC5F,cAAQ,QAAQ,IAAI,YAAY,MAAM;AAAA,IACxC;AAAA,EACF;AAEA,SAAO,EAAE,GAAG,QAAQ,aAAa,CAAC,GAAG,OAAO,WAAW,EAAE;AAC3D;AAOO,IAAM,6BAA6B,CACxC,KACA,gBAEA,YAAY,SAAS,IACjB,0BAA0B,GAAG,mBAAmB,YAAY,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,OAClF,0BAA0B,GAAG;;;AC1QnC,SAAS,kBAAkB;;;ACC3B,SAASC,IAAG,GAAG,MAAM;AAAE,MAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,EAAG,OAAM,IAAI,WAAW,OAAO,wCAAwC,CAAC;AAAG,SAAO;AAAG;AACzK,SAAS,GAAG,GAAG;AAAE,MAAI,IAAI,iBAAkB,OAAM,IAAI,WAAW,6FAA6F;AAAG,SAAO;AAAG;AAEnK,IAAM,cAA+B,uBAAM;AAElD,WAAS,KAAK,QAAQ;AACpB,UAAM,MAAM,CAAC,GAAG,IAAI,CAAC;AACrB,WAAO,EAAC,SAAS,EAAC,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,WAAW,EAAC,GAAG,MAAM,CAAC,EAAC;AAAA,EACzG;AACA,WAASC,MAAK,QAAQ,OAAO,OAAO;AAClC,UAAM,MAAM,EAAC,SAASD,IAAG,MAAM,OAAO,GAAG,aAAa,GAAG,WAAWA,IAAG,MAAM,SAAS,GAAG,eAAe,EAAC,GAAG,IAAI,MAAM,SAAS,MAAM,EAAC,GAAG,MAAM,SAAQ,GAAG,OAAO,MAAM;AACvK,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,KAAK,KAAO,EAAE,SAAS,MAAM;AAC9E,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,KAAK;AACtD,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,KAAK;AACtD,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,KAAK,EAAE,OAAO;AACtD,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,KAAK;AAC7C,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,KAAK;AACtD,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,KAAK,EAAE,OAAO;AACtD,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,KAAK,MAAQ,IAAI,SAAS,MAAM,KAAO,EAAE,SAAS,MAAM;AACzG,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,MAAM,KAAO,IAAI,SAAS,MAAM;AACjF,UAAM,QAAU,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,KAAK,MAAQ,IAAI,SAAS,MAAM,KAAO,EAAE,SAAS,MAAM;AACzG,UAAM,SAAW,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,MAAM,KAAO,IAAI,SAAS,MAAM;AAClF,UAAM,SAAW,IAAI,OAAO,MAAM,KAAO,KAAK,KAAO,KAAK,EAAE,OAAO;AACnE,UAAM,SAAW,IAAI,OAAO,MAAM,KAAO,KAAK,KAAO,KAAK,EAAE,OAAO;AACnE,UAAM,SAAW,IAAI,OAAO,MAAM,KAAO,EAAE,OAAO,MAAM,MAAQ,EAAE,OAAO,MAAM,KAAO,EAAE,OAAO,MAAM,KAAO,EAAE,OAAO,MAAM;AAC3H,UAAM,SAAW,IAAI,OAAO,MAAM,MAAQ,EAAE,OAAO,MAAM;AACzD,UAAM,SAAW,IAAI,OAAO,MAAM,OAAS,EAAE,OAAO,KAAK,KAAO,EAAE,OAAO,MAAM;AAC/E,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,UAAM,SAAS;AACf,QAAI,EAAG,IAAI,OAAO,IAAI,MAAQ,IAAI,SAAS,KAAK,GAAK,OAAM,IAAI,WAAW,uGAAuG;AACjL,UAAM,UAAU,EAAC,GAAG,GAAG,SAAW,UAAU,UAAU,UAAU,SAAU,IAAI,EAAE,OAAO,GAAI,SAAW,UAAU,SAAU,GAAG,EAAE,OAAO,IAAI,CAAC,IAAK,SAAS,KAAK,IAAI,GAAG,EAAE,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,GAAK,SAAW,UAAU,SAAU,GAAG,EAAE,OAAO,IAAI,CAAC,IAAK,SAAS,KAAK,IAAI,GAAG,EAAE,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,GAAK,WAAa,UAAU,UAAU,SAAU,IAAI,EAAE,SAAS,GAAI,SAAU,SAAS,IAAM,UAAU,SAAU,IAAK,SAAS,IAAK,SAAS,IAAK,SAAS,IAAI,EAAE,OAAO,GAAQ,WAAa,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,SAAU,IAAK,SAAS,IAAI,EAAG;AACjpB,WAAO,OAAO,KAAK,GAAG,EAAE,SAAS,EAAC,SAAS,MAAM,MAAM,MAAM,UAAU,IAAG,IAAI,EAAC,SAAS,MAAM,MAAM,KAAI;AAAA,EAC1G;AACA,SAAO,EAAE,MAAM,MAAAC,MAAK;AACpB,GAAG;;;AC9CH,IAAM,SAAS,CAAC,UAAU,UAAU,YAAY,WAAW,UAAU,QAAQ;AAC7E,IAAM,SAAS,CAAC,WAAW,YAAY,UAAU,aAAa,UAAU,UAAU,WAAW,SAAS,OAAO,QAAQ,YAAY,OAAO;AACxI,IAAM,WAAW,CAAC,UAAU,WAAW,YAAY;AAOnD,IAAM,QAAQ,CAAmB,QAAsB,OAAU,SAAyB;AACxF,QAAM,IAAI,OAAO,QAAQ,KAAK;AAC9B,MAAI,IAAI,EAAG,OAAM,IAAI,MAAM,oBAAoB,IAAI,KAAK,KAAK,EAAE;AAC/D,SAAO;AACT;AACA,IAAM,QAAQ,CAAmB,QAAsB,GAAuB,SAAoB;AAChG,QAAM,QAAQ,MAAM,SAAY,SAAY,OAAO,CAAC;AACpD,MAAI,UAAU,OAAW,OAAM,IAAI,MAAM,oBAAoB,IAAI,UAAU,CAAC,EAAE;AAC9E,SAAO;AACT;AACA,IAAM,OAAO,CAAC,UAAuC;AACnD,MAAI,UAAU,KAAK,UAAU,EAAG,OAAM,IAAI,MAAM,iCAAiC;AACjF,SAAO,UAAU;AACnB;AAIO,IAAMC,eAAc,CAAC,MAAmB,UAAwC;AACrF,QAAM,QAAQ;AAAA,IACZ,SAAS;AAAA,MACP,OAAO,MAAM,QAAQ,KAAK,MAAM,GAAG,OAAO;AAAA,MAAG,OAAO,IAAI,KAAK,KAAK;AAAA,MAAG,OAAO,KAAK;AAAA,MACjF,OAAO,KAAK;AAAA,MAAO,SAAS,IAAI,KAAK,OAAO;AAAA,MAAG,SAAS;AAAA,IAC1D;AAAA,IACA,MAAM,CAAC;AAAA,EACT;AACA,QAAM,OAAO,YAAiB,KAAK,CAAC,GAAG,OAAO;AAAA,IAC5C,OAAO,MAAM,QAAQ,MAAM,GAAG,OAAO;AAAA,IAAG,SAAS,IAAI,aAAa,SAAS,MAAM,OAAO;AAAA,EAC1F,CAAC,EAAE;AACH,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,MACJ,GAAG;AAAA,MAAQ,OAAO,EAAE,GAAG,MAAM,QAAQ,KAAK,OAAO,OAAO,EAAE;AAAA,MAAG,OAAO,KAAK,KAAK,KAAK;AAAA,MACnF,OAAO,KAAK;AAAA,MAAQ,OAAO,KAAK;AAAA,MAAQ,SAAS,KAAK,KAAK,OAAO;AAAA,IACpE;AAAA,IACA,SAAS,EAAE,GAAG,MAAM,UAAU,KAAK,SAAS,SAAS,EAAE;AAAA,EACzD;AACF;;;AFnBA,IAAM,WAAW,CAAC,aAA2D;AAAA,EAC3E,GAAG;AAAA,EACH,GAAI,QAAQ,YAAY,EAAE,WAAW,QAAQ,UAAU,IAAI,CAAC;AAC9D;AAEA,IAAM,UAAU,MAAuB;AACrC,MAAI,SAAS;AACb,SAAO,MAAM;AACX,UAAM,OAAO,QAAQ,MAAM;AAC3B,aAAS,KAAK;AACd,WAAO,KAAK;AAAA,EACd;AACF;AAEO,IAAM,yBAAN,MAA6B;AAAA,EACzB,cAAc,oBAAI,IAAyB;AAAA,EAC3C,WAAW,oBAAI,IAAmC;AAAA,EAClD,UAAU,oBAAI,IAAmC;AAAA,EACjD,OAAO,oBAAI,IAAmC;AAAA,EAC9C,eAAe,oBAAI,IAAoB;AAAA,EACvC,WAAW,oBAAI,IAAsB;AAAA,EACrC,YAAY,oBAAI,IAAY;AAAA,EAC5B,WAAW,oBAAI,IAA6B;AAAA,EAC5C,aAAa,oBAAI,IAAiD;AAAA,EAE3E,UAAU,UAAmE;AAC3E,SAAK,WAAW,IAAI,QAAQ;AAC5B,WAAO,MAAM,KAAK,WAAW,OAAO,QAAQ;AAAA,EAC9C;AAAA,EAEA,QAAQ,MAAiD;AACvD,WAAO,KAAK,SAAS,IAAI,IAAI;AAAA,EAC/B;AAAA,EAEA,QAAQ,IAA+C;AACrD,UAAM,UAAU,KAAK,KAAK,IAAI,EAAE;AAChC,UAAM,OAAO,KAAK,YAAY,IAAI,EAAE;AACpC,WAAO,WAAW,QAAQC,aAAY,MAAM,EAAE,GAAG,UAAU,CAAC,EAAE,QAAQ,MAAM,YAAY,UAAU;AAAA,EACpG;AAAA,EAEA,IAAI,MAAuB;AACzB,WAAO,KAAK,SAAS,IAAI,IAAI;AAAA,EAC/B;AAAA,EAEA,YAA8B;AAC5B,WAAO,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC,YAAY,QAAQ,QAAQ;AAAA,EACtE;AAAA,EAEA,UAAmC;AACjC,WAAO,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,EAAE,OAAO,CAAC,YAAY,QAAQ,UAAU,QAAQ;AAAA,EAC/E;AAAA,EAEA,MACE,UACA,UAAqD,CAAC,GACxB;AAG9B,QAAI,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,EAAE,KAAK,CAAAC,aAC/BA,SAAQ,aAAa,YAAYA,SAAQ,aAAa,CAAC,KAAK,UAAU,IAAIA,SAAQ,EAAE,CAAC,GAAG;AACxF,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AACA,UAAM,UAAU,KAAK,SAAS,IAAI,SAAS,IAAI;AAC/C,UAAM,SAAS,KAAK,QAAQ,IAAI,SAAS,IAAI;AAC7C,SAAK,WAAW,WAAW,CAAC,QAAQ,WAAW;AAC7C,YAAM,IAAI,MAAM,uCAAuC,SAAS,IAAI,EAAE;AAAA,IACxE;AACA,QAAI,UAAU,QAAQ,UAAW,MAAK,OAAO,OAAO,EAAE;AACtD,UAAM,cAAc,KAAK,aAAa,IAAI,SAAS,IAAI,KAAK,KAAK;AACjE,QAAI,CAAC,OAAO,cAAc,UAAU,EAAG,OAAM,IAAI,MAAM,8BAA8B;AACrF,SAAK,aAAa,IAAI,SAAS,MAAM,UAAU;AAC/C,UAAM,UAAiC;AAAA,MACrC,IAAI,WAAW;AAAA,MACf,MAAM,SAAS;AAAA,MACf;AAAA,MACA;AAAA,MACA,OAAO,QAAQ,SAAS,WAAW;AAAA,MACnC,eAAe;AAAA,MACf,cAAc,QAAQ,cAAc;AAAA,MACpC,WAAW;AAAA,MACX,UAAU;AAAA,IACZ;AACA,QAAI,SAAS,kBAAkB;AAC7B,cAAQ,qBAAqB,SAAS;AAAA,QAAiB,MACrD,KAAK,qBAAqB,SAAS,IAAI;AAAA,MACzC;AAAA,IACF;AACA,SAAK,KAAK,IAAI,QAAQ,IAAI,OAAO;AACjC,SAAK,YAAY,IAAI,QAAQ,IAAI,EAAE,GAAG,QAAQ,OAAO,EAAE,GAAG,QAAQ,SAAS,WAAW,SAAS,GAAG,OAAO,MAAM,OAAO,GAAG,OAAO,GAAG,SAAS,MAAM,CAAC;AACnJ,SAAK,SAAS,IAAI,QAAQ,IAAI,IAAI,gBAAgB,CAAC;AACnD,QAAI,QAAQ,QAAQ;AAClB,WAAK,QAAQ,IAAI,QAAQ,MAAM,OAAO;AACtC,WAAK,MAAM,EAAE,MAAM,UAAU,SAAS,SAAS,OAAO,EAAE,CAAC;AAAA,IAC3D,OAAO;AACL,YAAM,WAAW,KAAK,aAAa,OAAO;AAC1C,UAAI,YAAY,QAAQ,UAAW,MAAK,KAAK,aAAa,SAAS,EAAE,EAAE,MAAM,MAAM,MAAS;AAAA,IAC9F;AAEA,UAAM,cAAc,QAAQ;AAC5B,WAAO;AAAA,MACL,WAAW,QAAQ;AAAA,MACnB,MAAM,QAAQ;AAAA,MACd,YAAY,QAAQ;AAAA,MACpB,IAAI,SAAS;AACX,eAAO,QAAQ,UAAU;AAAA,MAC3B;AAAA,MACA,QAAQ,MAAM,KAAK,OAAO,QAAQ,EAAE;AAAA,MACpC,SAAS,YAAY;AACnB,YAAI,CAAC,YAAY,EAAG,QAAO,QAAQ;AACnC,eAAO,KAAK,aAAa,QAAQ,EAAE;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,SAAS,YAAyC;AAChD,UAAM,WAAW,WAAW,IAAI,CAAC,OAAO;AACtC,YAAM,UAAU,KAAK,KAAK,IAAI,EAAE;AAChC,UAAI,CAAC,WAAW,QAAQ,UAAU,YAAY,QAAQ,WAAW;AAC/D,cAAM,IAAI,MAAM,oCAAoC,EAAE,EAAE;AAAA,MAC1D;AACA,UAAI,QAAQ,UAAU,YAAY,QAAQ,UAAU,UAAU;AAC5D,cAAM,IAAI,MAAM,8BAA8B,QAAQ,KAAK,KAAK,QAAQ,IAAI,EAAE;AAAA,MAChF;AACA,aAAO;AAAA,IACT,CAAC;AACD,UAAM,QAAQ,oBAAI,IAAY;AAC9B,eAAW,WAAW,UAAU;AAC9B,UAAI,MAAM,IAAI,QAAQ,IAAI,GAAG;AAC3B,cAAM,IAAI,MAAM,yDAAyD,QAAQ,IAAI,EAAE;AAAA,MACzF;AACA,YAAM,IAAI,QAAQ,IAAI;AACtB,YAAM,UAAU,KAAK,SAAS,IAAI,QAAQ,IAAI;AAC9C,UAAI,WAAW,QAAQ,OAAO,QAAQ,MAAM,CAAC,QAAQ,cAAc;AACjE,cAAM,IAAI,MAAM,uCAAuC,QAAQ,IAAI,EAAE;AAAA,MACvE;AAAA,IACF;AACA,UAAM,WAAqB,CAAC;AAC5B,eAAW,WAAW,UAAU;AAC9B,YAAM,WAAW,KAAK,aAAa,OAAO;AAC1C,UAAI,YAAY,SAAS,OAAO,QAAQ,IAAI;AAC1C,iBAAS,KAAK,SAAS,EAAE;AACzB,YAAI,QAAQ,aAAc,MAAK,KAAK,aAAa,SAAS,EAAE,EAAE,MAAM,MAAM,MAAS;AAAA,MACrF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WACE,MACA,UAAmG,CAAC,GACxE;AAC5B,UAAM,UAAU,KAAK,SAAS,IAAI,IAAI;AACtC,QAAI,CAAC,QAAS,QAAO;AACrB,QAAI,QAAQ,aAAa,UAAa,QAAQ,aAAa,QAAQ,SAAU,QAAO;AACpF,QACE,QAAQ,eAAe,WACtB,OAAO,QAAQ,eAAe,WAAW,QAAQ,aAAa,QAAQ,QAAQ,QAAQ,YACvF;AACA,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,iBAAkB,MAAK,UAAU,IAAI,QAAQ,EAAE;AAC3D,SAAK,OAAO,QAAQ,EAAE;AACtB,SAAK,KAAK,aAAa,QAAQ,EAAE,EAAE,MAAM,MAAM,MAAS;AACxD,WAAO,QAAQ;AAAA,EACjB;AAAA,EAEA,OAAO,IAAkB;AACvB,UAAM,UAAU,KAAK,KAAK,IAAI,EAAE;AAChC,QAAI,CAAC,QAAS;AACd,UAAM,cAAc,KAAK,SAAS,IAAI,QAAQ,IAAI,GAAG,OAAO,MAAM,KAAK,QAAQ,IAAI,QAAQ,IAAI,GAAG,OAAO;AACzG,QAAI,KAAK,SAAS,IAAI,QAAQ,IAAI,GAAG,OAAO,GAAI,MAAK,SAAS,OAAO,QAAQ,IAAI;AACjF,QAAI,KAAK,QAAQ,IAAI,QAAQ,IAAI,GAAG,OAAO,GAAI,MAAK,QAAQ,OAAO,QAAQ,IAAI;AAC/E,SAAK,MAAM,SAAS,EAAE,GAAG,SAAS,CAAC;AACnC,QAAI,YAAa,MAAK,MAAM,EAAE,MAAM,YAAY,SAAS,SAAS,OAAO,EAAE,CAAC;AAC5E,SAAK,KAAK,YAAY,OAAO,EAAE,MAAM,MAAM,MAAS;AAAA,EACtD;AAAA,EAEA,OAAO,KAAuB,UAAU,OAA4B;AAClE,UAAM,WAAoC,CAAC;AAC3C,QAAI;AACF,iBAAW,MAAM,IAAI,IAAI,GAAG,GAAG;AAC7B,cAAM,UAAU,KAAK,KAAK,IAAI,EAAE;AAChC,YAAI,CAAC,WAAW,KAAK,MAAM,SAAS,EAAE,GAAG,UAAU,QAAQ,CAAC,MAAM,WAAW;AAC3E,gBAAM,IAAI,MAAM,oCAAoC,EAAE,EAAE;AAAA,QAC1D;AACA,iBAAS,KAAK,OAAO;AAAA,MACvB;AAAA,IACF,SAAS,OAAO;AACd,iBAAW,WAAW,SAAU,MAAK,MAAM,SAAS,EAAE,GAAG,UAAU,CAAC;AACpE,YAAM;AAAA,IACR;AACA,UAAM,cAAc,QAAQ;AAC5B,WAAO,YAAY;AACjB,UAAI,CAAC,YAAY,EAAG;AACpB,YAAM,QAAQ,IAAI,SAAS,IAAI,OAAO,YAAY;AAChD,aAAK,MAAM,SAAS,EAAE,GAAG,UAAU,CAAC;AACpC,cAAM,KAAK,YAAY,OAAO;AAAA,MAChC,CAAC,CAAC;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,gBAAgB,IAAY,UAAU,OAA4B;AAChE,UAAM,UAAU,KAAK,KAAK,IAAI,EAAE;AAChC,QAAI,CAAC,WAAW,KAAK,MAAM,SAAS,EAAE,GAAG,SAAS,QAAQ,CAAC,MAAM,WAAW;AAC1E,YAAM,IAAI,MAAM,oCAAoC,EAAE,EAAE;AAAA,IAC1D;AACA,UAAM,UAAU,QAAQ;AACxB,WAAO,YAAY;AACjB,UAAI,CAAC,QAAQ,EAAG;AAChB,WAAK,MAAM,SAAS,EAAE,GAAG,MAAM,CAAC;AAChC,YAAM,KAAK,YAAY,OAAO;AAAA,IAChC;AAAA,EACF;AAAA,EAEA,OAAO,IAAyB;AAC9B,UAAM,aAAa,KAAK,SAAS,IAAI,EAAE;AACvC,QAAI,CAAC,WAAY,OAAM,IAAI,MAAM,4BAA4B;AAC7D,WAAO,WAAW;AAAA,EACpB;AAAA,EAEA,OAAO,IAAkB;AACvB,UAAM,UAAU,KAAK,KAAK,IAAI,EAAE;AAChC,QAAI,CAAC,QAAS;AACd,SAAK,MAAM,SAAS,EAAE,GAAG,SAAS,CAAC;AACnC,SAAK,SAAS,IAAI,EAAE,GAAG,MAAM,IAAI,MAAM,mCAAmC,CAAC;AAC3E,SAAK,OAAO,EAAE;AACd,SAAK,KAAK,YAAY,OAAO,EAAE,MAAM,MAAM,MAAS;AAAA,EACtD;AAAA,EAEA,WAAW,IAAY,OAAsB;AAC3C,UAAM,UAAU,KAAK,KAAK,IAAI,EAAE;AAChC,QAAI,CAAC,QAAS;AACd,YAAQ,aAAa,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC1E,SAAK,MAAM,SAAS,EAAE,GAAG,QAAQ,CAAC;AAClC,SAAK,OAAO,EAAE;AAAA,EAChB;AAAA;AAAA,EAGA,MAAS,IAAY,WAAqC,UAAU,OAAmB;AACrF,QAAI,CAAC,WAAW,CAAC,KAAK,QAAQ,EAAE,EAAG,QAAO,QAAQ,OAAO,IAAI,MAAM,kDAAkD,CAAC;AACtH,QAAI;AACJ,QAAI;AAAE,YAAM,KAAK,gBAAgB,IAAI,OAAO;AAAA,IAAG,SACxC,OAAO;AAAE,aAAO,QAAQ,OAAO,KAAK;AAAA,IAAG;AAC9C,QAAI;AACJ,QAAI;AAAE,eAAS,QAAQ,QAAQ,UAAU,CAAC;AAAA,IAAG,SACtC,OAAO;AAAE,eAAS,QAAQ,OAAO,KAAK;AAAA,IAAG;AAChD,SAAK,SAAS,IAAI,MAAM;AACxB,UAAM,UAAU,MAAM;AAAE,WAAK,SAAS,OAAO,MAAM;AAAG,aAAO,IAAI;AAAA,IAAG;AACpE,SAAK,OAAO,KAAK,SAAS,OAAO,EAAE,MAAM,MAAM,MAAS;AACxD,WAAO;AAAA,EACT;AAAA,EAEA,cAAiB,UAA0B,WAAqC,UAAU,OAAmB;AAC3G,UAAM,UAAU,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,EAAE,KAAK,UAAQ,KAAK,aAAa,YAAY,KAAK,UAAU,KAAK,IAAI,OAAO,CAAC;AACnH,QAAI,CAAC,QAAS,QAAO,QAAQ,OAAO,IAAI,MAAM,wCAAwC,CAAC;AACvF,WAAO,KAAK,MAAM,QAAQ,IAAI,WAAW,OAAO;AAAA,EAClD;AAAA,EAEA,qBAAqB,UAAwB;AAC3C,QAAI,KAAK,SAAS,IAAI,QAAQ,EAAG,MAAK,MAAM,EAAE,MAAM,WAAW,SAAS,CAAC;AAAA,EAC3E;AAAA,EAEA,MAAM,MAAM,wBAAqC,oBAAI,IAAI,GAAkB;AACzE,UAAM,QAAyB,CAAC;AAChC,eAAW,WAAW,KAAK,KAAK,OAAO,GAAG;AACxC,UAAI,QAAQ,UAAU,SAAU;AAChC,UAAI,sBAAsB,IAAI,QAAQ,IAAI,EAAG,MAAK,UAAU,IAAI,QAAQ,EAAE;AAC1E,WAAK,OAAO,QAAQ,EAAE;AACtB,YAAM,KAAK,KAAK,YAAY,OAAO,CAAC;AAAA,IACtC;AACA,UAAM,WAAW,KAAK,IAAI,IAAI;AAC9B,UAAM,aAAa,CAAC,GAAG,OAAO,GAAG,KAAK,QAAQ,GAAG,GAAK;AACtD,UAAM,aAAa,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,EAAE,QAAQ,aAAW,QAAQ,YAAY,CAAC,QAAQ,SAAS,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI,GAAG,WAAW,KAAK,IAAI,CAAC,CAAC;AAC/I,SAAK,SAAS,MAAM;AACpB,SAAK,QAAQ,MAAM;AAAA,EACrB;AAAA,EAEA,aAAa,SAAmE;AAC9E,UAAM,UAAU,KAAK,SAAS,IAAI,QAAQ,IAAI;AAC9C,QAAI,SAAS,OAAO,QAAQ,MAAM,QAAQ,UAAU,SAAU,QAAO;AACrE,QAAI,WAAW,QAAQ,OAAO,QAAQ,GAAI,MAAK,OAAO,QAAQ,EAAE;AAChE,QAAI,KAAK,QAAQ,IAAI,QAAQ,IAAI,GAAG,OAAO,QAAQ,GAAI,MAAK,QAAQ,OAAO,QAAQ,IAAI;AACvF,QAAI,KAAK,MAAM,SAAS,EAAE,GAAG,WAAW,CAAC,MAAM,UAAW,OAAM,IAAI,MAAM,sCAAsC;AAChH,SAAK,SAAS,IAAI,QAAQ,MAAM,OAAO;AACvC,SAAK,MAAM,EAAE,MAAM,aAAa,SAAS,SAAS,OAAO,EAAE,CAAC;AAC5D,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,aAAa,IAA2B;AACpD,UAAM,UAAU,KAAK,KAAK,IAAI,EAAE;AAChC,QAAI,CAAC,QAAS;AACd,SAAK,OAAO,EAAE;AACd,SAAK,MAAM,SAAS,EAAE,GAAG,YAAY,CAAC;AACtC,UAAM,KAAK,YAAY,OAAO;AAAA,EAChC;AAAA,EAEA,MAAM,YAAY,SAA+C;AAC/D,QAAI,QAAQ,UAAW,QAAO,QAAQ;AAEtC,QAAI,KAAK,MAAM,SAAS,EAAE,GAAG,OAAO,CAAC,MAAM,aAAc;AACzD,YAAQ,YAAY,QAAQ,QAAQ,EAAE,KAAK,YAAY;AACrD,UAAI;AACF,cAAM,cAAc,QAAQ;AAC5B,eAAO,QAAQ;AACf,cAAM,cAAc;AACpB,cAAM,SAAS,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,EAAE,KAAK,WAAS,MAAM,OAAO,QAAQ,MAAM,MAAM,aAAa,QAAQ,YAAY,MAAM,UAAU,QAAQ;AAC/I,YAAI,CAAC,UAAU,CAAC,KAAK,UAAU,IAAI,QAAQ,EAAE,EAAG,OAAM,QAAQ,SAAS,QAAQ;AAAA,MACjF,SAAS,OAAO;AACd,aAAK,WAAW,QAAQ,IAAI,KAAK;AACjC,cAAM;AAAA,MACR;AACA,UAAI,KAAK,MAAM,SAAS,EAAE,GAAG,WAAW,CAAC,MAAM,WAAW;AACxD,cAAM,IAAI,MAAM,QAAQ,cAAc,mCAAmC;AAAA,MAC3E;AACA,WAAK,KAAK,OAAO,QAAQ,EAAE;AAC3B,WAAK,YAAY,OAAO,QAAQ,EAAE;AAClC,WAAK,SAAS,OAAO,QAAQ,EAAE;AAC/B,WAAK,UAAU,OAAO,QAAQ,EAAE;AAChC,WAAK,MAAM,EAAE,MAAM,UAAU,SAAS,SAAS,OAAO,EAAE,CAAC;AAAA,IAC3D,CAAC;AACD,WAAO,QAAQ;AAAA,EACjB;AAAA,EAEA,UAAU,IAAY,SAA2B;AAC/C,UAAM,OAAO,KAAK,YAAY,IAAI,EAAE;AACpC,WAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,oBAAoBD,aAAY,MAAM,EAAE,GAAG,SAAS,QAAQ,CAAC,EAAE,QAAQ,MAAM;AAAA,EAC7G;AAAA,EAEA,MAAM,SAAgC,OAAqD;AACzF,UAAM,OAAO,KAAK,YAAY,IAAI,QAAQ,EAAE;AAC5C,QAAI,CAAC,KAAM,QAAO;AAClB,QAAK,MAAM,MAAM,WAAW,KAAK,SAAS,oBAAsB,MAAM,MAAM,YAAY,KAAK,SAAS,kBAAmB;AACvH,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AACA,UAAM,UAAUA,aAAY,MAAM,KAAK;AACvC,QAAI,QAAQ,KAAK,QAAQ,oBAAoB,QAAQ,KAAK,QAAQ,kBAAkB;AAClF,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AACA,SAAK,YAAY,IAAI,QAAQ,IAAI,QAAQ,IAAI;AAC7C,YAAQ,QAAS,EAAE,QAAQ,UAAU,QAAQ,UAAU,UAAU,YAAY,SAAS,YAAY,QAAQ,UAAU,QAAQ,WAAW,EAAY,QAAQ,KAAK,MAAM,CAAC;AACvK,YAAQ,gBAAgB,QAAQ,KAAK;AACrC,YAAQ,YAAY,OAAO,QAAQ,KAAK,KAAK;AAC7C,YAAQ,WAAW,OAAO,QAAQ,KAAK,KAAK;AAC5C,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAAA,EAEA,MAAM,OAAyC;AAC7C,eAAW,YAAY,CAAC,GAAG,KAAK,UAAU,GAAG;AAC3C,UAAI;AACF,iBAAS,KAAK;AAAA,MAChB,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AACF;;;AL9XO,IAAM,wBAAwB,CAAC,UACpC,KAAK,IAAI,GAAG,KAAK,IAAI,SAAS,KAAK,GAAK,CAAC;AAiKpC,IAAM,6BAA6B;AAE1C,IAAM,sBAAsB;AAE5B,IAAM,kCAAkC;AAExC,IAAM,gBAAgB,CAAC,UACrB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAGrE,IAAM,qBAAqB,CAAC,MAAc,SACxC,IAAI,OAAO,eAAe,IAAI,wBAAwB,EAAE,KAAK,IAAI;AAGnE,IAAM,mBAAmB,CAAC,MAAe,gBACvC,OAAO,SAAS,YAAY,KAAK,SAAS,KAAK,KAAK,UAAU,MAC1D,EAAE,MAAM,aAAa,cAAc,WAAW,IAAI,cAAc,CAAC,EAAE,IACnE;AAEN,IAAM,eAAe,OAAO,IAAI,oBAAoB;AAMpD,IAAM,oBAAoB,CAAC,SAA2D;AACpF,QAAME,YAAW,gBAAgB,IAAI;AACrC,QAAM,UAAqB,CAACA,SAAQ;AACpC,QAAM,OAAO,oBAAI,QAAgB;AACjC,SAAO,QAAQ,SAAS,GAAG;AACzB,UAAM,QAAQ,QAAQ,IAAI;AAC1B,QAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,KAAK,IAAI,KAAK,EAAG;AACpE,SAAK,IAAI,KAAK;AACd,QAAI,OAAO,sBAAsB,eAAe,iBAAiB,mBAAmB;AAClF,YAAM,IAAI,qBAAqB,wDAAwD;AAAA,IACzF;AAGA,QAAI,OAAO,UAAU,SAAS,KAAK,KAAK,MAAM,+BAA+B;AAC3E,cAAQ,KAAM,MAA8B,MAAM;AAClD;AAAA,IACF;AACA,QAAI,YAAY,OAAO,KAAK,GAAG;AAC7B,cAAQ,KAAK,MAAM,MAAM;AACzB;AAAA,IACF;AACA,QAAI,iBAAiB,IAAK,YAAW,CAAC,KAAK,KAAK,KAAK,MAAO,SAAQ,KAAK,KAAK,KAAK;AACnF,QAAI,iBAAiB,IAAK,YAAW,SAAS,MAAO,SAAQ,KAAK,KAAK;AACvE,eAAW,OAAO,QAAQ,QAAQ,KAAK,GAAG;AACxC,YAAM,WAAW,OAAO,yBAAyB,OAAO,GAAG;AAC3D,UAAI,YAAY,WAAW,SAAU,SAAQ,KAAK,SAAS,KAAK;AAAA,IAClE;AAAA,EACF;AACA,SAAOA;AACT;AAEA,IAAM,oBAAoB,CACxB,UACA,gBAC0B;AAAA,EAC1B,GAAG;AAAA,EACH,QAAQ,WAAW,WAAW,WAAW,SAAS,SAC9C,EAAE,MAAM,QAAQ,UAAU,cAAc,IACxC,EAAE,MAAM,YAAY,UAAU,UAAU;AAAA,EAC5C,UAAU,SAAS;AAAA,EACnB,KAAK,GAAG,SAAS,IAAI,IAAI,WAAW,IAAI;AAC1C;AAEA,IAAM,iBAAiB;AAEvB,IAAM,uBAAuB,CAAC,WAC5B,eAAe;AAAA,EACb,KAAK,OAAO;AAAA,EACZ,aAAa,OAAO;AAAA,EACpB,aAAa,OAAO;AAAA,EACpB,cAAc,OAAO;AAAA,EACrB,MAAM,OAAO;AAAA,EACb,WAAW,OAAO;AAAA,EAClB,QAAQ,OAAO;AACjB,CAAC;AAEH,IAAM,iBAAiB,CAAC,UACtB,CAAC,GAAG,MAAM,UAAU,MAAM,EAAE,SAAS,kBAAkB,CAAC,EACrD,IAAI,CAAC,UAAU,MAAM,CAAC,EAAE,YAAY,CAAC;AAEnC,IAAM,oBAAoB,CAC/B,OACA,QAQA,sBAAsB,OACX;AACX,QAAM,kBAAkB,MAAM,UAAU,MAAM,EAAE,KAAK,EAAE,YAAY;AACnE,MAAI,CAAC,gBAAiB,QAAO;AAC7B,QAAM,aAAa,CAAC,GAAG,IAAI,IAAI,eAAe,eAAe,CAAC,CAAC;AAC/D,QAAM,MAAM,OAAO,IAAI,UAAU,MAAM,EAAE,YAAY;AACrD,QAAM,OAAO,OAAO,KAAK,UAAU,MAAM,EAAE,YAAY;AACvD,QAAM,cAAc,OAAO,YAAY,UAAU,MAAM,EAAE,YAAY;AACrE,QAAM,WAAW,OAAO,SAAS,UAAU,MAAM,EAAE,YAAY;AAC/D,QAAM,eAAe,oBAAoB,UAAU,MAAM,EAAE,YAAY;AACvE,QAAM,aAAa,OAAO,aAAa,IAAI,UAAU,MAAM,EAAE,YAAY;AACzE,QAAM,SAAS,KAAK,UAAU,OAAO,eAAe,CAAC,CAAC,EAAE,UAAU,MAAM,EAAE,YAAY;AACtF,QAAM,YAAY;AAAA,IAChB,KAAK,IAAI,IAAI,eAAe,GAAG,CAAC;AAAA,IAChC,MAAM,IAAI,IAAI,eAAe,IAAI,CAAC;AAAA,IAClC,aAAa,IAAI,IAAI,eAAe,WAAW,CAAC;AAAA,IAChD,UAAU,IAAI,IAAI,eAAe,QAAQ,CAAC;AAAA,IAC1C,cAAc,IAAI,IAAI,eAAe,YAAY,CAAC;AAAA,IAClD,WAAW,IAAI,IAAI,eAAe,SAAS,CAAC;AAAA,IAC5C,QAAQ,IAAI,IAAI,eAAe,MAAM,CAAC;AAAA,EACxC;AACA,QAAM,SAAS,OAAO,OAAO,SAAS;AACtC,MAAI,QAAQ;AACZ,MAAI,QAAQ,gBAAiB,UAAS;AACtC,MAAI,SAAS,gBAAiB,UAAS;AACvC,MAAI,IAAI,WAAW,eAAe,EAAG,UAAS;AAAA,WACrC,IAAI,SAAS,eAAe,EAAG,UAAS;AACjD,MAAI,YAAY,SAAS,eAAe,EAAG,UAAS;AACpD,MAAI,aAAa,SAAS,eAAe,EAAG,UAAS;AACrD,MAAI,OAAO,SAAS,eAAe,EAAG,UAAS;AAC/C,MAAI,eAAe;AACnB,aAAW,QAAQ,YAAY;AAC7B,UAAM,UAAU,OAAO,KAAK,CAAC,UAAU,MAAM,IAAI,IAAI,CAAC;AACtD,QAAI,CAAC,QAAS;AACd,oBAAgB;AAChB,QAAI,UAAU,IAAI,IAAI,IAAI,KAAK,UAAU,KAAK,IAAI,IAAI,EAAG,UAAS;AAClE,QAAI,UAAU,SAAS,IAAI,IAAI,EAAG,UAAS;AAC3C,QAAI,UAAU,YAAY,IAAI,IAAI,EAAG,UAAS;AAC9C,QAAI,UAAU,aAAa,IAAI,IAAI,EAAG,UAAS;AAC/C,QAAI,UAAU,UAAU,IAAI,IAAI,EAAG,UAAS;AAC5C,QAAI,UAAU,OAAO,IAAI,IAAI,EAAG,UAAS;AAAA,EAC3C;AACA,MAAI,WAAW,SAAS,KAAK,iBAAiB,WAAW,OAAQ,UAAS;AAC1E,SAAO;AACT;AAEA,IAAM,kBAAkB,CACtB,MACA,UACgF;AAChF,SAAO;AAAA,IACL,iBAAiB,CAAC,mBAAmB,EAAE,OAAO,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC;AAAA,IACjE,iBAAiB,CAAC,mBAAmB,EAAE,OAAO,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC;AAAA,EACrE,EAAE,CAAC;AACL;AAEO,IAAM,iBAAN,MAAqB;AAAA,EAY1B,YAAqB,iBAA+C;AAA/C;AACnB,SAAK,kBAAkB,UAAU,MAAM,KAAK,cAAc,QAAQ,CAAC;AAAA,EACrE;AAAA,EAbS,YAAY,IAAI,gBAAgB;AAAA,EAChC,SAAS,oBAAI,QAA6H;AAAA,EACnJ;AAAA,EACS,oBAAoB,IAAI,uBAAuB;AAAA,EAC/C,iBAAiB,oBAAI,IAAyD;AAAA,EAC9E,eAAe,oBAAI,IAAoB;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,eACE,SACA,aACM;AACN,SAAK,eAAe;AACpB,SAAK,0BAA0B;AAAA,EACjC;AAAA,EAEA,mBAAmB,QAAuC;AACxD,UAAM,YAAY,OAAO,SAAS,UAAU,OAAO,QAAQ,SAAS;AAIpE,UAAM,UAAU,OAAO,aAAa,SAAS,OAAO,SAAS,aAC3D,OAAO,aAAa,oBAAoB,QAAQ,OAAO,aAAa,iBAAiB;AACvF,YAAQ,aAAa,YAAY,KAAK,0BAA0B,gBAAgB,MAAM,CAAC,MAAM;AAAA,EAC/F;AAAA,EAEA,SAAS,UAA0B,UAAmC,CAAC,GAAS;AAC9E,SAAK,MAAM,UAAU,OAAO;AAAA,EAC9B;AAAA,EAEA,MACE,UACA,UAAqD,CAAC,GACxB;AAC9B,QAAI,KAAK,UAAU,OAAO,QAAS,OAAM,IAAI,MAAM,2BAA2B;AAC9E,QAAI,CAAC,oBAAoB,KAAK,SAAS,IAAI,GAAG;AAC5C,YAAM,IAAI,MAAM,iCAAiC,SAAS,IAAI,EAAE;AAAA,IAClE;AACA,UAAM,QAAQ,KAAK,kBAAkB,MAAM,UAAU,OAAO;AAC5D,SAAK,aAAa,OAAO,SAAS,IAAI;AACtC,WAAO;AAAA,EACT;AAAA,EAEA,yBAAyB,YAAyC;AAChE,WAAO,KAAK,kBAAkB,SAAS,UAAU;AAAA,EACnD;AAAA,EAEA,yBACE,UACY;AACZ,WAAO,KAAK,kBAAkB,UAAU,QAAQ;AAAA,EAClD;AAAA,EAEA,qBAAqB,UAAwB;AAC3C,SAAK,kBAAkB,qBAAqB,QAAQ;AAAA,EACtD;AAAA,EAEA,IAAI,MAAuB;AACzB,WAAO,KAAK,kBAAkB,IAAI,IAAI;AAAA,EACxC;AAAA,EAEA,uBAAuB,SAAqD;AAC1E,SAAK,uBAAuB;AAAA,EAC9B;AAAA;AAAA,EAGA,cAAc,QAA4C;AACxD,SAAK,cAAc;AAAA,EACrB;AAAA,EAEA,IAAI,aAA2C;AAC7C,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,iBAAiB,WAA+C;AAC9D,WAAO,UAAU,OAAO,CAAC,aAAa,CAAC,KAAK,aAAa,sBAAsB,SAAS,IAAI,CAAC;AAAA,EAC/F;AAAA,EAEA,cACE,UACA,SACA,SACmC;AACnC,WAAO,aAAa,QAAQ,QAAQ,MAAM;AAGxC,UAAI,KAAK,aAAa,eAAe,SAAS,IAAI,EAAG,QAAO,CAAC;AAC7D,aAAO,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,KAAK,SAAS,OAAO,CAAC;AAAA,IAC7F,CAAC;AAAA,EACH;AAAA,EAEA,YAAY,MAA0B;AACpC,UAAM,SAAS,KAAK;AACpB,QAAI,CAAC,QAAQ,OAAQ,QAAO;AAC5B,WAAO,KAAK,OAAO,CAAC,QAAQ;AAC1B,YAAM,YAAY,IAAI,QAAQ,GAAG;AACjC,aAAO,CAAC,OAAO,UAAU,IAAI,MAAM,GAAG,SAAS,GAAG,IAAI,MAAM,YAAY,CAAC,CAAC;AAAA,IAC5E,CAAC;AAAA,EACH;AAAA,EAEA,eAA6D,SAAmB;AAC9E,UAAM,SAAS,KAAK;AACpB,WAAO,QAAQ,SAAS,QAAQ,OAAO,CAAC,WAAW,CAAC,OAAO,UAAU,OAAO,UAAU,OAAO,IAAI,CAAC,IAAI;AAAA,EACxG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,uBAAuB,QAAkD;AACvE,UAAM,SAAS,KAAK,aAAa,UAAU,OAAO,UAAU,OAAO,IAAI;AACvE,QAAI,OAAQ,OAAM,IAAI,sBAAsB,MAAM;AAAA,EACpD;AAAA,EAEA,gBAAgB,MAAc,QAAsB;AAClD,QAAI,CAAC,oBAAoB,KAAK,IAAI,GAAG;AACnC,YAAM,IAAI,MAAM,iCAAiC,IAAI,EAAE;AAAA,IACzD;AACA,QAAI,KAAK,kBAAkB,IAAI,IAAI,GAAG;AACpC,YAAM,IAAI,MAAM,yDAAyD,IAAI,EAAE;AAAA,IACjF;AACA,SAAK,aAAa,IAAI,MAAM,MAAM;AAAA,EACpC;AAAA,EAEA,uBAAgE;AAC9D,WAAO,CAAC,GAAG,KAAK,aAAa,QAAQ,CAAC,EACnC,IAAI,CAAC,CAAC,MAAM,MAAM,OAAO,EAAE,MAAM,OAAO,EAAE,EAC1C,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAAA,EAC9D;AAAA,EAEA,WACE,MACA,SAC4B;AAC5B,WAAO,KAAK,kBAAkB,WAAW,MAAM,OAAO;AAAA,EACxD;AAAA,EAEA,kBAAkB,SAAqD;AACrE,QAAI,QAAS,MAAK,cAAc,OAAO;AACvC,WAAO,SAAS,iBACZ,CAAC,GAAG,IAAI,IAAI,KAAK,eAAe,QAAQ,cAAc,EAAE,SAAS,EAAE,IAAI,WAAS,KAAK,kBAAkB,QAAQ,MAAM,iBAAiB,GAAG,QAAQ,EAAE,OAAO,CAAC,aAAyC,QAAQ,QAAQ,CAAC,CAAC,CAAC,IACvN,KAAK,iBAAiB,KAAK,kBAAkB,UAAU,CAAC;AAAA,EAC9D;AAAA,EAEA,UAAU,SAAiF;AACzF,WAAO,KAAK,kBAAkB,OAAO,EAClC,IAAI,CAAC,cAAc,EAAE,MAAM,SAAS,MAAM,aAAa,SAAS,YAAY,EAAE,EAC9E,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAAA,EAC9D;AAAA,EAEA,MAAM,oBACJ,cACA,SACqC;AACrC,WAAO,KAAK,qBAAqB,cAAc,SAAS,KAAK;AAAA,EAC/D;AAAA,EAEA,MAAM,sBACJ,cACA,SACoC;AACpC,WAAO,KAAK,qBAAqB,cAAc,SAAS,IAAI;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,gBAAgB,SAA6C;AAC3D,WAAO,oBAAoB,KAAK,kBAAkB,OAAO,EAAE,IAAI,CAAC,aAAa,SAAS,IAAI,CAAC;AAAA,EAC7F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,iBACJ,SACA,UAA6B,CAAC,GACG;AACjC,cAAU,KAAK,cAAc,OAAO;AACpC,UAAM,UAAkC,CAAC;AACzC,UAAM,UAAU,KAAK,gBAAgB,OAAO;AAC5C,QAAI,QAAQ,gBAAgB;AAC1B,YAAM,UAAU,MAAM,KAAK,KAAK,EAAE,OAAO,IAAM,GAAG,OAAO;AACzD,UAAI,QAAQ,SAAS,GAAG;AACtB,gBAAQ,YAAY,QAAQ,IAAI,CAAC,cAAc;AAAA,UAC7C;AAAA,UACA,SAAS,QACN,OAAO,CAAC,WAAW,OAAO,aAAa,QAAQ,EAC/C,QAAQ,CAAC,WAAW,iBAAiB,OAAO,MAAM,OAAO,WAAW,KAAK,CAAC,CAAC;AAAA,QAChF,EAAE;AAAA,MACJ;AACA,YAAM,WAAW,oBAAI,IAA2C;AAChE,iBAAW,UAAU,QAAQ,OAAO,CAAC,cAAc,UAAU,aAAa,KAAK,GAAG;AAChF,cAAM,SAAS,OAAO;AACtB,YAAI,CAAC,UAAU,WAAW,gBAAgB,OAAO,KAAK,WAAW,GAAG,EAAG;AACvE,cAAM,SAAS,GAAG,MAAM;AACxB,cAAM,OAAO,OAAO,KAAK,WAAW,MAAM,IACtC,OAAO,KAAK,MAAM,OAAO,MAAM,IAC/B,OAAO;AACX,cAAM,QAAQ,SAAS,IAAI,MAAM,KAAK,CAAC;AACvC,cAAM,KAAK,EAAE,MAAM,aAAa,OAAO,YAAY,CAAC;AACpD,iBAAS,IAAI,QAAQ,KAAK;AAAA,MAC5B;AACA,UAAI,SAAS,OAAO,GAAG;AACrB,gBAAQ,aAAa,CAAC,GAAG,SAAS,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,KAAK,OAAO;AAAA,UACrE;AAAA,UACA;AAAA,QACF,EAAE;AAAA,MACJ;AACA,YAAM,iBAAiB,QACpB,OAAO,CAAC,WAAW,OAAO,aAAa,YAAY,EACnD,IAAI,CAAC,YAAY,EAAE,MAAM,OAAO,MAAM,aAAa,OAAO,YAAY,EAAE;AAC3E,UAAI,eAAe,SAAS,EAAG,SAAQ,iBAAiB;AACxD,aAAO;AAAA,IACT;AACA,UAAM,MAAM,KAAK,kBAAkB,QAAQ,KAAK,GAAG;AAGnD,UAAM,iBAAiB,KAAK,aAAa,SACrC,KAAK,mBAAmB,EAAE,OAAO,CAAC,eAAe,CAAC,KAAK,YAAa,cAAc,OAAO,WAAW,IAAI,CAAC,IACzG,KAAK,mBAAmB;AAC5B,QAAI,kBAAkB,eAAe,SAAS,GAAG;AAC/C,YAAM,WAAW,oBAAI,IAAsD;AAC3E,iBAAW,cAAc,gBAAgB;AACvC,cAAM,SAAS,WAAW;AAC1B,YAAI,CAAC,UAAU,WAAW,gBAAgB,WAAW,KAAK,WAAW,GAAG,EAAG;AAC3E,cAAM,SAAS,GAAG,MAAM;AACxB,cAAM,WAAW,WAAW,KAAK,WAAW,MAAM,IAC9C,WAAW,KAAK,MAAM,OAAO,MAAM,IACnC,WAAW;AACf,YAAI,QAAQ,SAAS,IAAI,MAAM;AAC/B,YAAI,CAAC,OAAO;AACV,kBAAQ,oBAAI,IAAI;AAChB,mBAAS,IAAI,QAAQ,KAAK;AAAA,QAC5B;AAIA,cAAM,IAAI,UAAU;AAAA,UAClB,MAAM;AAAA,UACN,aAAa;AAAA,YACX,OAAO,WAAW,IAAI;AAAA,YACtB,WAAW;AAAA,UACb;AAAA,QACF,CAAC;AAAA,MACH;AACA,UAAI,SAAS,OAAO,GAAG;AACrB,gBAAQ,aAAa,CAAC,GAAG,SAAS,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,KAAK,OAAO;AAAA,UACrE;AAAA,UACA,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC;AAAA,QAC3B,EAAE;AAAA,MACJ;AAAA,IACF;AACA,UAAM,aAAa,KAAK,kBAAkB,QAAQ,YAAY,GAAG;AACjE,QAAI,YAAY;AACd,UAAI;AACF,cAAM,cAAc,KAAK,gBAAgB,MAAM,KAAK,cAAc,YAAY,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,GAAG,YAAY,UAAU,aAAa,EAAE,CAAC;AAC5J,YAAI,YAAY,SAAS,GAAG;AAC1B,kBAAQ,iBAAiB,YAAY,IAAI,CAAC,gBAAgB;AAAA,YACxD,MAAM,WAAW;AAAA,YACjB,aAAa;AAAA,cACX,cAAc,WAAW,IAAI;AAAA,cAC7B,WAAW;AAAA,YACb;AAAA,UACF,EAAE;AAAA,QACJ;AAAA,MACF,QAAQ;AAAA,MAGR;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,EAAE,KAAK,IAAI;AACjB,cAAQ,YAAY,MAAM,QAAQ,IAAI,QAAQ,IAAI,CAAC,SACjD,SAAS,UAAa,mBAAmB,MAAM,IAAI,IAC/C,KAAK,oBAAoB,MAAM,OAAO,IACtC,EAAE,UAAU,MAAM,SAAS,CAAC,EAAE,CAAC,CAAC;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,oBAAoB,MAAc,SAAqE;AAC3G,UAAM,WAAW,KAAK,kBAAkB,QAAQ,IAAI,GAAG;AACvD,QAAI,CAAC,SAAU,QAAO,EAAE,UAAU,MAAM,SAAS,CAAC,EAAE;AACpD,QAAI;AACJ,QAAI;AACF,YAAM,cAAc,MAAM,QAAQ,KAAK;AAAA,QACrC,KAAK,cAAc,UAAU,CAAC,GAAG,OAAO;AAAA,QACxC,IAAI,QAAmB,CAAC,YAAY;AAClC,gBAAM,SAAS,WAAW,MAAM,QAAQ,MAAS,GAAG,+BAA+B;AACnF,UAAC,OAAkC,QAAQ;AAC3C,kBAAQ;AAAA,QACV,CAAC;AAAA,MACH,CAAC;AACD,UAAI,CAAC,MAAM,QAAQ,WAAW,EAAG,QAAO,EAAE,UAAU,MAAM,SAAS,CAAC,EAAE;AACtE,YAAM,cAAc,0BAA0B;AAC9C,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS,YAAY,QAAQ,CAAC,eAAe;AAC3C,cAAI,CAAC,cAAc,UAAU,KAAK,YAAY,IAAI,GAAG,IAAI,IAAI,OAAO,WAAW,IAAI,CAAC,EAAE,EAAG,QAAO,CAAC;AACjG,cAAI,KAAK,aAAa,UAAU,KAAK,YAAY,UAAU,MAAM,OAAO,WAAW,IAAI,CAAC,EAAG,QAAO,CAAC;AAGnG,iBAAO;AAAA,YACL,WAAW;AAAA,YACX,cAAc,WAAW,WAAW,IAChC,qBAAqB,GAAG,IAAI,IAAI,WAAW,IAAI,IAAI,WAAW,WAAW,IACzE;AAAA,UACN,KAAK,CAAC;AAAA,QACR,CAAC;AAAA,MACH;AAAA,IACF,QAAQ;AACN,aAAO,EAAE,UAAU,MAAM,SAAS,CAAC,EAAE;AAAA,IACvC,UAAE;AACA,UAAI,MAAO,cAAa,KAAK;AAAA,IAC/B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,aACJ,SACA,SACA,UAAqD,MAAM,MACsB;AACjF,cAAU,KAAK,cAAc,OAAO;AACpC,QAAI,QAAQ,gBAAgB;AAC1B,YAAM,OAAO,KAAK,YAAY,KAAK,eAAe,QAAQ,cAAc,EAAE,SAAS,EAAE,IAAI,aAAW,QAAQ,GAAG,CAAC,EAC7G,OAAO,CAAC,QAAQ,CAAC,QAAQ,YAAY,IAAI,WAAW,GAAG,QAAQ,QAAQ,GAAG,CAAC,EAC3E,OAAO,CAAC,QAAQ,QAAQ,YAAY,CAAC,0BAA0B,EAAE,IAAI,GAAG,CAAC,EACzE,KAAK;AACR,YAAM,UAAU,MAAM,QAAQ,IAAI,KAAK,IAAI,CAAC,QAAQ,KAAK,SAAS,KAAK,OAAO,CAAC,CAAC;AAChF,YAAM,QAAQ,QAAQ,OAAO,UAAU,MAAM,EAAE,KAAK,EAAE,YAAY;AAClE,YAAM,WAAW,QACd,OAAO,CAAC,WAAW,CAAC,QAAQ,aAAa,OAAO,cAAc,QAAQ,SAAS,EAC/E;AAAA,QAAO,CAAC,WACP,CAAC,SAAS,GAAG,OAAO,GAAG,IAAI,OAAO,WAAW,GAAG,YAAY,EAAE,SAAS,KAAK;AAAA,MAC9E,EACC,OAAO,OAAO;AACjB,YAAMC,QAAO,SAAS,MAAM,GAAG,sBAAsB,QAAQ,KAAK,CAAC;AACnE,aAAO,EAAE,SAASA,OAAM,OAAO,SAAS,QAAQ,WAAW,SAAS,SAASA,MAAK,OAAO;AAAA,IAC3F;AACA,UAAM,YAAY,KAAK,iBAAiB,QAAQ,WAC5C,CAAC,KAAK,iBAAiB,QAAQ,QAAQ,CAAC,IACxC,KAAK,kBAAkB,UAAU,CAAC;AACtC,UAAM,QAAQ,MAAM,QAAQ;AAAA,MAC1B,UAAU,IAAI,OAAO,aAAa;AAGhC,cAAM,cAAyC;AAAA,UAC7C,GAAI,QAAQ,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,QAAQ,UAAU;AAAA,UAC1E,GAAI,QAAQ,UAAU,SAAY,CAAC,IAAI,EAAE,OAAO,QAAQ,MAAM;AAAA,QAChE;AACA,cAAM,cAAc,MAAM,KAAK,cAAc,UAAU,aAAa,OAAO;AAC3E,eAAO,YACJ;AAAA,UACC,CAAC,eACC,QAAQ,YACR,CAAC,0BAA0B,EAAE,IAAI,GAAG,SAAS,IAAI,IAAI,WAAW,IAAI,EAAE;AAAA,QAC1E,EACC,IAAI,CAAC,eAAe;AACnB,gBAAM,SAAS,kBAAkB,UAAU,UAAU;AAGrD,iBAAO,QAAQ,WACX,SACA;AAAA,YACE,GAAG;AAAA,YACH,aAAa;AAAA,cACX,OAAO;AAAA,cACP,OAAO;AAAA,YACT;AAAA,UACF;AAAA,QACN,CAAC;AAAA,MACL,CAAC;AAAA,IACH;AACA,UAAM,MAAM,KAAK,eAAe,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO;AAC5D,UAAM,OAAO,IAAI,MAAM,GAAG,sBAAsB,QAAQ,KAAK,CAAC;AAC9D,WAAO,EAAE,SAAS,MAAM,OAAO,IAAI,QAAQ,WAAW,IAAI,SAAS,KAAK,OAAO;AAAA,EACjF;AAAA,EACA,MAAM,KACJ,SACA,SACiC;AACjC,UAAM,EAAE,QAAQ,IAAI,MAAM,KAAK,aAAa,SAAS,OAAO;AAC5D,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,QACJ,SACA,UAII,CAAC,GAC6B;AAClC,cAAU,KAAK,cAAc,OAAO;AACpC,UAAM,aAAa,QAAQ,iBACvB,CAAC,GAAG,IAAI;AAAA,MACN,KAAK,eAAe,QAAQ,cAAc,EAAE,SAAS,EAAE,QAAQ,CAAC,WAAW;AACzE,cAAM,UAAU,KAAK,kBAAkB,QAAQ,OAAO,iBAAiB;AACvE,eAAO,UAAU,CAAC,CAAC,QAAQ,MAAM,QAAQ,QAAQ,CAAU,IAAI,CAAC;AAAA,MAClE,CAAC;AAAA,IACH,EAAE,OAAO,CAAC,IACV,QAAQ,WACN,CAAC,KAAK,iBAAiB,QAAQ,QAAQ,CAAC,IACxC,KAAK,kBAAkB,UAAU,GACpC,OAAO,CAAC,aAAa,CAAC,QAAQ,YAAY,SAAS,SAAS,QAAQ,QAAQ,EAC5E,OAAO,CAAC,aAAa,QAAQ,kBAAkB,SAAS,IAAI,KAAK,IAAI,EACrE,OAAO,CAAC,aAAa,CAAC,KAAK,aAAa,sBAAsB,SAAS,IAAI,CAAC,EAC5E,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AAC5D,UAAM,QAAQ,MAAM,QAAQ;AAAA,MAC1B,UAAU,IAAI,OAAO,cAAc;AAAA,QACjC;AAAA,QACA,SAAS,QAAQ,iBACb,MAAM,KAAK,KAAK,EAAE,UAAU,SAAS,MAAM,OAAO,IAAM,GAAG,OAAO,KACjE,MAAM,KAAK,cAAc,UAAU,CAAC,GAAG,OAAO,GAC5C;AAAA,UACC,CAAC,eACC,CAAC,0BAA0B,EAAE,IAAI,GAAG,SAAS,IAAI,IAAI,WAAW,IAAI,EAAE;AAAA,QAC1E,EACC,IAAI,CAAC,eAAe,kBAAkB,UAAU,UAAU,CAAC;AAAA,MACpE,EAAE;AAAA,IACJ,EAAE,KAAK,CAAC,YAAY,QAAQ,IAAI,CAAC,EAAE,UAAU,QAAQ,OAAO,EAAE,UAAU,SAAS,KAAK,eAAe,OAAO,EAAE,EAAE,CAAC;AACjH,UAAM,aAAa,MAAM,QAAQ,CAAC,EAAE,QAAQ,MAAM,OAAO,EACtD,KAAK,CAAC,MAAM,UAAU,KAAK,IAAI,cAAc,MAAM,GAAG,CAAC;AAC1D,UAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,MAAM,QAAQ,SAAS,GAAK,GAAG,GAAK,CAAC;AAC7E,UAAM,eAAe,IAAI,IAAI,WAAW,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,WAAW,OAAO,GAAG,CAAC;AACnF,UAAM,gBAAgB,MAAM,IAAI,CAAC,EAAE,UAAU,QAAQ,MAAM;AACzD,YAAM,cAAc,QACjB,OAAO,CAAC,WAAW,aAAa,IAAI,OAAO,GAAG,CAAC,EAC/C,KAAK,CAAC,MAAM,UAAU,KAAK,IAAI,cAAc,MAAM,GAAG,CAAC,EACvD,IAAI,CAAC,YAAY;AAAA,QAChB,KAAK,UAAU,OAAO,GAAG;AAAA,QACzB,WAAW,YAAY,SAAS,IAAI;AAAA,QACpC,KAAK,OAAO;AAAA,QACZ,MAAM,OAAO;AAAA,QACb,aAAa,OAAO;AAAA,QACpB,gBAAgB,qBAAqB,MAAM;AAAA,QAC3C,MAAM,OAAO;AAAA,QACb,GAAI,OAAO,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,OAAO,UAAU;AAAA,QACxE,GAAI,OAAO,WAAW,SAAY,CAAC,IAAI,EAAE,QAAQ,OAAO,OAAO;AAAA,MACjE,EAAE;AACJ,aAAO;AAAA,QACL,KAAK,YAAY,SAAS,IAAI;AAAA,QAC9B,WAAW;AAAA,QACX,MAAM,SAAS;AAAA,QACf,aAAa,SAAS;AAAA,QACtB,gBAAgB,eAAe;AAAA,UAC7B,MAAM,SAAS;AAAA,UACf,aAAa,SAAS;AAAA,UACtB,SAAS,YAAY,IAAI,CAAC,WAAW,OAAO,cAAc;AAAA,QAC5D,CAAC;AAAA,QACD,SAAS;AAAA,MACX;AAAA,IACF,CAAC;AACD,UAAM,iBAAiB,cAAc,OAAO,CAAC,OAAO,aAAa,QAAQ,SAAS,QAAQ,QAAQ,CAAC;AACnG,UAAM,WAAW,eAAe,cAAc,IAAI,CAAC,aAAa,SAAS,cAAc,CAAC;AACxF,WAAO;AAAA,MACL,MAAM;AAAA,MACN,SAAS;AAAA,MACT,MAAM;AAAA,QACJ,KAAK;AAAA,QACL,MAAM;AAAA,QACN,aAAa,QAAQ,iBACjB,gGACA;AAAA,QACJ,gBAAgB;AAAA,MAClB;AAAA,MACA,WAAW;AAAA,MACX,cAAc,WAAW;AAAA,MACzB;AAAA,MACA,UAAU,mBAAmB,WAAW;AAAA,MACxC,SAAS,mBAAmB,WAAW,SAAS,CAAC,IAAI,CAAC,cAAc;AAAA,IACtE;AAAA,EACF;AAAA,EAEA,MAAM,OACJ,OACA,SACA,QAAQ,IACyB;AACjC,UAAM,kBAAkB,MAAM,UAAU,MAAM,EAAE,KAAK,EAAE,YAAY;AACnE,QAAI,CAAC,gBAAiB,QAAO,CAAC;AAC9B,UAAM,SAAS,MAAM,KAAK,KAAK,EAAE,OAAO,IAAM,GAAG,OAAO;AACxD,WAAO,OACJ,IAAI,CAAC,YAAY;AAAA,MAChB;AAAA,MACA,OAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK,kBAAkB,QAAQ,OAAO,QAAQ,GAAG,SAAS,eAAe;AAAA,MAC3E;AAAA,IACF,EAAE,EACD,OAAO,CAAC,UAAU,MAAM,QAAQ,CAAC,EACjC;AAAA,MACC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SAAS,KAAK,OAAO,IAAI,cAAc,MAAM,OAAO,GAAG;AAAA,IAC9E,EACC,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,GAAG,CAAC,CAAC,EAC1C,IAAI,CAAC,UAAU,MAAM,MAAM;AAAA,EAChC;AAAA,EAEA,MAAM,SAAS,KAAa,SAAiE;AAC3F,cAAU,KAAK,cAAc,OAAO;AACpC,QAAI,IAAI,SAAS,GAAG,GAAG;AACrB,YAAM,EAAE,UAAU,YAAY,uBAAuB,IAAI,KAAK;AAAA,QAC5D;AAAA,QACA,QAAQ;AAAA,MACV;AACA,YAAM,WAAW,MAAM,KAAK;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ,mBAAmB;AAAA,MAC7B;AACA,UAAI,CAAC,SAAS,QAAQ;AACpB,cAAM,IAAI,sBAAsB,2BAA2B,KAAK,SAAS,WAAW,CAAC;AAAA,MACvF;AACA,YAAM,SAAS,SAAS;AACxB,WAAK,uBAAuB,MAAM;AAClC,UAAI,0BAA0B,qBAAqB,MAAM,MAAM,wBAAwB;AACrF,cAAM,IAAI,sBAAsB,yCAAyC,GAAG,EAAE;AAAA,MAChF;AACA,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,gBAAgB;AAC1B,YAAM,SAAS,MAAM,QAAQ;AAAA,QAC3B,KAAK,YAAY,KAAK,eAAe,QAAQ,cAAc,EAAE,SAAS,EAAE,IAAI,aAAW,QAAQ,GAAG,CAAC,EAAE;AAAA,UAAI,CAAC,cACxG,KAAK,SAAS,WAAW,OAAO;AAAA,QAClC;AAAA,MACF;AACA,YAAMC,WAAU,OAAO,OAAO,CAAC,WAAW,OAAO,SAAS,GAAG;AAC7D,UAAIA,SAAQ,WAAW,EAAG,QAAOA,SAAQ,CAAC;AAC1C,UAAIA,SAAQ,SAAS,GAAG;AACtB,cAAM,IAAI;AAAA,UACR,IAAI,GAAG,aAAaA,SAAQ,MAAM,8DAChCA,SAAQ,IAAI,CAAC,UAAU,MAAM,GAAG,EAAE,KAAK,EAAE,KAAK,IAAI;AAAA,QACtD;AAAA,MACF;AACA,YAAM,IAAI,sBAAsB,4CAA4C,GAAG,EAAE;AAAA,IACnF;AAGA,UAAM,UAAkC,CAAC;AACzC,UAAM,gBAA0B,CAAC;AACjC,eAAW,YAAY,KAAK,iBAAiB,KAAK,kBAAkB,UAAU,CAAC,GAAG;AAChF,UAAI;AACJ,UAAI;AACF,sBAAc,MAAM,KAAK,cAAc,UAAU,CAAC,GAAG,OAAO;AAAA,MAC9D,QAAQ;AACN;AAAA,MACF;AACA,iBAAW,cAAc,aAAa;AACpC,sBAAc,KAAK,WAAW,IAAI;AAClC,YAAI,WAAW,SAAS,IAAK,SAAQ,KAAK,kBAAkB,UAAU,UAAU,CAAC;AAAA,MACnF;AAAA,IACF;AACA,YAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,KAAK,eAAe,OAAO,CAAC;AACjE,QAAI,QAAQ,WAAW,EAAG,QAAO,QAAQ,CAAC;AAC1C,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,IAAI,GAAG,aAAa,QAAQ,MAAM,oDAChC,QAAQ,IAAI,CAAC,UAAU,MAAM,GAAG,EAAE,KAAK,EAAE,KAAK,IAAI;AAAA,MACtD;AAAA,IACF;AACA,UAAM,SAAS,iBAAiB,eAAe,GAAG;AAClD,UAAM,IAAI,sBAAsB,2BAA2B,KAAK,OAAO,WAAW,CAAC;AAAA,EACrF;AAAA,EAEA,MAAM,cACJ,KACA,MACA,SACA,OACqC;AACrC,cAAU,KAAK,cAAc,OAAO;AACpC,WAAO,kBAAkB,IAAI;AAC7B,UAAM,EAAE,SAAS,UAAU,YAAY,uBAAuB,IAAI,KAAK;AAAA,MACrE;AAAA,MACA,QAAQ;AAAA,IACV;AACA,cAAU,KAAK,gBAAgB,SAAS,OAAO;AAC/C,UAAM,gBAAgB,KAAK,kBAAkB,gBAAgB,QAAQ,EAAE;AACvE,UAAM,iBAAiB,KAAK,kBAAkB,OAAO,CAAC,QAAQ,EAAE,CAAC;AACjE,QAAI;AACF,YAAM,WAAW,MAAM,KAAK;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ,mBAAmB;AAAA,MAC7B;AACA,UAAI,CAAC,SAAS,QAAQ;AACpB,cAAM,IAAI,sBAAsB,2BAA2B,KAAK,SAAS,WAAW,CAAC;AAAA,MACvF;AACA,YAAM,SAAS,SAAS;AACxB,WAAK,uBAAuB,MAAM;AAClC,YAAM,qBAAqB,SAAS,iBAAiB,SAAY,aAAa,OAAO;AACrF,YAAM,YAAY,EAAE,KAAK,OAAO,KAAK,YAAY,qBAAqB,MAAM,EAAE;AAC9E,UAAI,0BAA0B,qBAAqB,MAAM,MAAM,wBAAwB;AACrF,cAAM,IAAI,sBAAsB,yCAAyC,GAAG,EAAE;AAAA,MAChF;AACA,UAAI,OAAO,QAAQ,SAAS,UAAU;AACpC,cAAM,IAAI,MAAM,8CAA8C,GAAG,EAAE;AAAA,MACrE;AACA,UAAI,CAAC,SAAS,SAAS;AACrB,cAAM,IAAI,MAAM,0DAA0D,SAAS,IAAI,EAAE;AAAA,MAC3F;AAGA,UAAI,QAAQ,WAAW;AACrB,cAAM,aAAa,QAAQ,QAAQ,MAAM,QAAQ,UAAW,gBAAgB,MAAM,CAAC,CAAC;AAAA,MACtF;AACA,YAAM,kBAAkB;AAAA,QACtB,OAAO;AAAA,QACP,OAAO;AAAA,MACT;AACA,YAAM,eAAe,mBAAmB,OAAO,KAAK,iBAAiB,IAAI;AACzE,YAAM,eAAe,SAAS,mBAC1B,MAAM;AAAA,QAAa,QAAQ;AAAA,QAAQ,MACjC,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,iBAAkB,oBAAoB,aAAa,MAAM,OAAO,CAAC;AAAA,MACjI,IACA,aAAa;AACjB,UAAI,OAAO,iBAAiB,YAAY,iBAAiB,QAAQ,MAAM,QAAQ,YAAY,GAAG;AAC5F,cAAM,IAAI,MAAM,4BAA4B,GAAG,2BAA2B;AAAA,MAC5E;AACA,YAAM,UAAU;AAAA,QACd,OAAO;AAAA,QACP;AAAA;AAAA;AAAA,QAGA,kBAAkB,YAAY;AAAA,QAC9B,aAAa;AAAA,MACf;AACA,UAAI,QAAQ,QAAS,OAAM,IAAI,MAAM,yBAAyB,GAAG,KAAK,QAAQ,OAAO,EAAE;AACvF,UAAI,QAAQ,SAAS;AACnB,cAAM,aAAa,QAAQ,QAAQ,MAAM,QAAQ,QAAS,gBAAgB,MAAM,GAAG,kBAAkB,QAAQ,IAAI,CAAC,CAAC;AAAA,MACrH;AACA,YAAM,WAAW,MAAM;AAAA,QAAa,QAAQ;AAAA,QAAQ,MAClD,KAAK,YAAY,SAAS,oBAAoB,WAAW,WAAW,QAAQ,MAAM,SAAS,QAAW,KAAK;AAAA,MAC7G;AACA,qBAAe,QAAQ,MAAM;AAC7B,UAAI,CAAC,YAAY,OAAO,SAAS,YAAY,YAAY;AACvD,cAAM,IAAI,MAAM,sBAAsB,GAAG,4BAA4B;AAAA,MACvE;AACA,aAAO,EAAE,OAAO,SAAS,OAAO,SAAS,SAAS,QAAQ;AAAA,IAC5D,UAAE;AACA,WAAK,cAAc,EAAE,MAAM,MAAM,MAAS;AAG1C,WAAK,eAAe,EAAE,MAAM,MAAM,MAAS;AAAA,IAC7C;AAAA,EACF;AAAA,EAEA,MAAM,OACJ,KACA,MACA,SACkB;AAClB,cAAU,KAAK,cAAc,OAAO;AACpC,WAAO,kBAAkB,IAAI;AAC7B,UAAM,iBAAiB,QAAQ,kBAAkB,QAAQ,OAAO,UAAU,KAAK,kBAAkB,IAAI,CAAC;AACtG,QAAI,eAAoF;AACxF,QAAI;AACJ,QAAI,mBAAmB;AACvB,QAAI;AACJ,QAAI;AACF,YAAM,EAAE,SAAS,UAAU,YAAY,uBAAuB,IAAI,KAAK;AAAA,QACrE;AAAA,QACA,QAAQ;AAAA,MACV;AACA,gBAAU,KAAK,gBAAgB,SAAS,OAAO;AAC/C,6BAAuB,KAAK,kBAAkB,gBAAgB,QAAQ,EAAE;AACxE,YAAM,WAAW,MAAM,KAAK;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ,mBAAmB;AAAA,MAC7B;AACA,UAAI,CAAC,SAAS,QAAQ;AACpB,cAAM,IAAI,sBAAsB,2BAA2B,KAAK,SAAS,WAAW,CAAC;AAAA,MACvF;AACA,YAAM,SAAS,SAAS;AACxB,WAAK,uBAAuB,MAAM;AAClC,YAAM,qBAAqB,SAAS,iBAAiB,SAAY,aAAa,OAAO;AACrF,YAAM,YAAY,EAAE,KAAK,OAAO,KAAK,YAAY,qBAAqB,MAAM,EAAE;AAC9E,UAAI,0BAA0B,qBAAqB,MAAM,MAAM,wBAAwB;AACrF,cAAM,IAAI,sBAAsB,yCAAyC,GAAG,EAAE;AAAA,MAChF;AACA,sBAAgB,SAAS,OAAO,UAAU,OAAO,IAAI;AAErD,qBAAe;AACf,UAAI,OAAO,QAAQ,SAAS,UAAU;AACpC,cAAM,IAAI;AAAA,UACR,wBAAwB,GAAG;AAAA,QAC7B;AAAA,MACF;AACA,UAAI,QAAQ,WAAW;AACrB,cAAM,aAAa,QAAQ,QAAQ,MAAM,QAAQ,UAAW,gBAAgB,MAAM,CAAC,CAAC;AAAA,MACtF;AAEA,qBAAe;AACf,YAAM,kBAAkB;AAAA,QACtB,OAAO;AAAA,QACP,OAAO;AAAA,MACT;AACA,YAAM,eAAe,mBAAmB,OAAO,KAAK,iBAAiB,IAAI;AACzE,YAAM,eAAe,SAAS,mBAC1B,MAAM;AAAA,QAAa,QAAQ;AAAA,QAAQ,MACjC,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,iBAAkB,oBAAoB,aAAa,MAAM,OAAO,CAAC;AAAA,MACjI,IACA,aAAa;AACjB,UAAI,OAAO,iBAAiB,YAAY,iBAAiB,QAAQ,MAAM,QAAQ,YAAY,GAAG;AAC5F,cAAM,IAAI,qBAAqB,4BAA4B,GAAG,2BAA2B;AAAA,MAC3F;AAEA,qBAAe;AACf,YAAM,UAAU;AAAA,QACd,OAAO;AAAA,QACP;AAAA;AAAA;AAAA,QAGA,kBAAkB,YAAY;AAAA,QAC9B,aAAa;AAAA,MACf;AACA,sBAAgB,SAAS,kBAAkB,QAAQ,IAAI,CAAC;AACxD,UAAI,QAAQ,cAAe,iBAAgB,WAAW,gBAAgB,QAAQ,aAAa,CAAC;AAG5F,UAAI,QAAQ,SAAS;AAUnB,cAAM,iBAAiB,OAAO;AAC9B,cAAM,qBACJ,OAAO,mBAAmB,YAC1B,mBAAmB,QACnB,CAAC,MAAM,QAAQ,cAAc,KAC7B,OAAQ,eAA2C,eAAe,YACjE,eAA2C,eAAe,OACrD,eAA2C,aAC7C;AACN,cAAM,cAAuC,CAAC;AAC9C,mBAAW,CAAC,KAAKC,MAAK,KAAK,OAAO,QAAQ,QAAQ,IAAI,GAAG;AACvD,gBAAM,WAAW,qBAAqB,mBAAmB,GAAG,IAAI;AAChE,gBAAM,eACJ,OAAO,aAAa,YAAY,aAAa,OACxC,SAAqC,OACtC;AACN,cAAI,CAAC,MAAM,QAAQ,YAAY,EAAG;AAClC,cACE,OAAOA,WAAU,YACjB,OAAOA,WAAU,YACjB,OAAOA,WAAU,WACjB;AACA;AAAA,UACF;AACA,cAAI,OAAOA,MAAK,EAAE,SAAS,sBAAuB;AAClD,cAAI,CAAC,aAAa,SAASA,MAAK,EAAG;AACnC,sBAAY,GAAG,IAAIA;AAAA,QACrB;AACA,YAAI,OAAO,KAAK,WAAW,EAAE,SAAS,GAAG;AACvC,gBAAM,UAA2B;AAAA,YAC/B;AAAA,YACA,kBAAkB,GAAG,0BAA0B,GAAGC,YAAW,CAAC;AAAA,YAC9D,WAAW,KAAK,IAAI;AAAA,YACpB,MAAM,OAAO;AAAA,YACb,UAAU,OAAO;AAAA,YACjB,MAAM;AAAA,YACN,SAAS;AAAA,YACT,OAAO,yBAAyB,GAAG,KAAK,QAAQ,OAAO;AAAA,YACvD,SAAS,KAAK,IAAI;AAAA,YAClB,GAAI,SAAS,iBAAiB,SAC1B,EAAE,cAAc,SAAS,aAAa,IACtC,CAAC;AAAA,UACP;AACA,kBAAQ,OAAO,KAAK,OAAO;AAAA,QAC7B;AACA,cAAM,IAAI,qBAAqB,yBAAyB,GAAG,KAAK,QAAQ,OAAO,EAAE;AAAA,MACnF;AAEA,qBAAe;AACf,YAAM,aAAa,QAAQ,QAAQ,MAAM,QAAQ,QAAQ,gBAAgB,MAAM,GAAG,kBAAkB,QAAQ,IAAI,CAAC,CAAC;AAElH,qBAAe;AACf,YAAM,mBAAmB,GAAG,0BAA0B,GAAGA,YAAW,CAAC;AACrE,YAAM,SAAS,OAAO;AACtB,YAAM,kBAAkB,CAAC,GAAG,KAAK,eAAe,OAAO,CAAC,EAAE,QAAQ,CAAC,WAAW;AAC5E,cAAM,WAAW,gBAAgB,QAAQ,OAAO,MAAM;AACtD,eAAO,WAAW,CAAC,EAAE,SAAS,OAAO,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC;AAAA,MAC9D,CAAC,EAAE,MAAM,GAAG,EAAE;AACd,UAAI,gBAAgB,SAAS,KAAK,QAAQ,iBAAiB,UAAU;AACnE,uBAAe;AACf,cAAM,IAAI;AAAA,UACR,8BAA8B,GAAG,KAAK,gBACnC,IAAI,CAAC,aAAa;AAAA,YACjB,SAAS;AAAA,YACT,SAAS;AAAA,YACT,SAAS;AAAA,UACX,CAAC,EACA,KAAK,IAAI,CAAC;AAAA,QACf;AAAA,MACF;AACA,YAAM,cAAc,YAAY,KAAK,QAAQ,IAAI;AACjD,YAAM,cAA+B;AAAA,QACnC;AAAA,QACA;AAAA,QACA,WAAW,KAAK,IAAI;AAAA,QACpB,MAAM,OAAO;AAAA,QACb,UAAU,OAAO;AAAA,QACjB,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,QACF;AAAA,QACA,GAAI,gBAAgB,SAAS,IAAI,EAAE,gBAAgB,IAAI,CAAC;AAAA,QACxD,GAAI,SAAS,iBAAiB,SAC1B,EAAE,cAAc,SAAS,aAAa,IACtC,CAAC;AAAA,MACP;AACA,cAAQ;AACR,yBAAmB;AACnB,cAAQ,OAAO,KAAK,WAAW;AAC/B,cAAQ,oBAAoB;AAAA,QAC1B,MAAM;AAAA,QACN,QAAQ;AAAA,QACR;AAAA,QACA,MAAM;AAAA,MACR,CAAC;AACD,cAAQ,OAAO,WAAW,GAAG,EAAE;AAC/B,WAAK,eAAe,IAAI,kBAAkB,EAAE,KAAK,OAAO,CAAC;AACzD,UAAI,wBAAwB;AAC5B,UAAI;AACJ,UAAI,kBAAkB;AACtB,UAAI;AACJ,YAAI,KAAK,gBAAgB,KAAK,mBAAmB,MAAM,GAAG;AACxD,gBAAM,SAAS,MAAM,aAAa,QAAQ,QAAQ,MAChD,KAAK,aAAc,SAAS,QAAQ,kBAAkB,KAAK,kBAAkB,QAAQ,IAAI,GAAG,KAAK,UAAU,CAAC,QAAQ,IAAI,UAAU,YAAY,QAAQ,gBAAgB,MAAM,MAAM,QAAQ,OAAO,UAAU,MAAM,QAAQ,qBAAqB,IAAI,CAAC,CAAC,CAAC;AACvP,cAAI,OAAO,KAAK;AACd,4BAAgB,MAAM,aAAa,QAAQ,QAAQ,MAAM,KAAK,YAAY,SAAS,oBAAoB,WAAW,UAAU,QAAQ,MAAM,SAAS,OAAO,KAAK,CAAC;AAChK,oCAAwB;AACxB,wBAAY,aAAa;AACzB,gBAAI,OAAO,OAAO,gBAAgB,QAAW;AAC3C,oBAAM,kBAAkB,YAAY,KAAK,OAAO,OAAO,WAAW;AAClE,0BAAY,OAAO;AAAA,gBACjB;AAAA,gBACA;AAAA,cACF;AACA,8BAAgB,SAAS,kBAAkB,OAAO,OAAO,WAAW,CAAC;AACrE,sBAAQ,oBAAoB;AAAA,gBAC1B,MAAM;AAAA,gBACN,QAAQ;AAAA,gBACR,MAAM;AAAA,cACR,CAAC;AAAA,YACH;AACA,gBAAI,OAAO,OAAO,OAAO,QAAQ;AAC/B,0BAAY,QAAQ,CAAC,GAAI,YAAY,SAAS,CAAC,GAAI,GAAG,OAAO,OAAO,KAAK;AACzE,kBAAI,OAAO,OAAO,UAAW,aAAY,YAAY,OAAO,OAAO;AAAA,YACrE;AACA,gBAAI,OAAO,OAAO,YAAY,OAAW,aAAY,UAAU,OAAO,OAAO;AAC7E,gBAAI,OAAO,OAAO,UAAW,aAAY,YAAY;AAAA,UACvD;AAAA,QACF;AACE,YAAI,CAAC,uBAAuB;AAC5B,4BAAkB;AAClB,0BAAgB,MAAM;AAAA,YAAa,QAAQ;AAAA,YAAQ,MACjD,KAAK,YAAY,SAAS,oBAAoB,WAAW,UAAU,QAAQ,MAAM;AAAA,cACjF,GAAG;AAAA,cACH;AAAA,cACA,OAAO,SAAS;AACd,oBAAI,CAAC,iBAAkB;AACvB,wBAAQ,OAAO,OAAO;AACtB,wBAAQ,oBAAoB;AAAA,kBAC1B,MAAM;AAAA,kBACN,QAAQ;AAAA,kBACR,QAAQ,EAAE,MAAM,YAAY,QAAQ;AAAA,gBACtC,CAAC;AAAA,cACH;AAAA,cACA,SAAS,QAAQ;AACf,oBAAI,CAAC,iBAAkB;AACvB,wBAAQ,WAAW,MAAM;AACzB,wBAAQ,oBAAoB;AAAA,kBAC1B,MAAM;AAAA,kBACN,QAAQ;AAAA,kBACR;AAAA,gBACF,CAAC;AAAA,cACH;AAAA,cACA,YAAY,QAAQ,MAAM;AACxB,oBAAI,CAAC,iBAAkB;AACvB,oBAAI,CAAC,YAAY,MAAO,aAAY,QAAQ,CAAC;AAC7C,2BAAW,SAAS,OAAQ,aAAY,MAAM,KAAK,KAAK;AACxD,oBAAI,KAAM,aAAY,YAAY;AAAA,cACpC;AAAA,cACA,gBAAgB,aAAa;AAC3B,oBAAI,CAAC,iBAAkB;AACvB,sBAAM,iBAAiB,YAAY,KAAK,WAAW;AACnD,4BAAY,OAAO;AAAA,kBACjB;AAAA,kBACA;AAAA,gBACF;AACA,gCAAgB,SAAS,kBAAkB,WAAW,CAAC;AACvD,wBAAQ,oBAAoB;AAAA,kBAC1B,MAAM;AAAA,kBACN,QAAQ;AAAA,kBACR,MAAM;AAAA,gBACR,CAAC;AAAA,cACH;AAAA,cACA,cAAc,SAAS;AACrB,oBAAI,CAAC,iBAAkB;AACvB,4BAAY,UAAU;AAAA,cACxB;AAAA,cACA,mBAAmB;AACjB,oBAAI,CAAC,iBAAkB;AACvB,4BAAY,YAAY;AAAA,cAC1B;AAAA,YACA,CAAC,EAAE,QAAQ,MAAM;AACf,kBAAI,OAAO,SAAS,OAAQ,MAAK,cAAc,UAAU;AACzD,mBAAK,eAAe,OAAO,gBAAgB;AAAA,YAC7C,CAAC;AAAA,UACH;AAAA,QACA;AAAA,MACF,UAAE;AACA,YAAI,CAAC,gBAAiB,MAAK,eAAe,OAAO,gBAAgB;AAAA,MACnE;AACA,YAAM,QAAQ,KAAK,kBACf,MAAM,aAAa,QAAQ,QAAQ,MAAM,KAAK,gBAAiB,MAAM;AAAA,QACnE;AAAA,QACA,MAAM,kBAAkB,QAAQ,IAAI;AAAA,QACpC,YAAY;AAAA,QACZ,kBAAkB,QAAQ;AAAA,QAC1B,OAAO;AAAA,QACP,GAAI,QAAQ,SAAS,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;AAAA,MACrD,CAAC,CAAC,IACF;AACJ,YAAM,UAAU,OAAO,QAAQ,eAC3B,qBAAqB,KAAK,IAC1B,cAAc,OAAO,QAAQ,cAAc;AAC/C,YAAM,cAAc,kBAAkB,KAAK;AAC3C,kBAAY,UAAU,gBAAgB;AACtC,UAAI,YAAa,aAAY,QAAQ;AACrC,kBAAY,cAAc,QAAQ;AAClC,kBAAY,kBAAkB,QAAQ;AACtC,YAAM,gBAAgB,cAAc,QAAQ,KAAK;AACjD,kBAAY,SAAS,oBAAoB,eAAe,qBAAqB;AAC7E,kBAAY,UAAU,KAAK,IAAI;AAC/B,cAAQ,oBAAoB;AAAA,QAC1B,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,SAAS,gBAAgB;AAAA,QACzB,QAAQ;AAAA,QACR,GAAI,YAAY,YAAY,SAAY,EAAE,SAAS,YAAY,QAAQ,IAAI,CAAC;AAAA,QAC5E,GAAI,cAAc,EAAE,OAAO,YAAY,IAAI,CAAC;AAAA,MAC9C,CAAC;AACD,UAAI,aAAa;AACf,wBAAgB,KAAK,UAAU,aAAa,oBAAoB,KAAK,GAAG,QAAQ,OAAO;AAAA,UACrF,iBAAiB,QAAQ;AAAA,QAC3B,CAAC;AAAA,MACH,OAAO;AACL,wBAAgB,QAAQ,QAAQ,OAAO,EAAE,iBAAiB,QAAQ,UAAU,CAAC;AAAA,MAC/E;AACA,qBAAe,QAAQ,MAAM;AAC7B,aAAO,QAAQ;AAAA,IACjB,SAAS,OAAO;AACd,YAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,sBAAgB,KAAK,cAAc,OAAO,0BAA0B,OAAO,QAAQ,MAAM,CAAC;AAC1F,UAAI,OAAO;AACT,cAAM,UAAU;AAChB,cAAM,QAAQ;AACd,cAAM,UAAU,KAAK,IAAI;AACzB,gBAAQ,oBAAoB;AAAA,UAC1B,MAAM;AAAA,UACN,QAAQ,MAAM;AAAA,UACd,SAAS;AAAA,UACT,OAAO,MAAM;AAAA,QACf,CAAC;AAAA,MACH;AACA,YAAM;AAAA,IACR,UAAE;AACA,yBAAmB;AACnB,UAAI,MAAO,OAAM,YAAY,KAAK,IAAI;AACtC,WAAK,uBAAuB,EAAE,MAAM,MAAM,MAAS;AAAA,IACrD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,UACJ,KACA,MACA,SACA,QAQA;AACA,QAAI,CAAC,KAAK,wBAAyB,QAAO;AAC1C,QAAI;AACF,gBAAU,KAAK,cAAc,OAAO;AACpC,aAAO,kBAAkB,IAAI;AAC7B,YAAM,EAAE,SAAS,UAAU,YAAY,uBAAuB,IAAI,KAAK;AAAA,QACrE;AAAA,QACA,QAAQ;AAAA,MACV;AACA,gBAAU,KAAK,gBAAgB,SAAS,OAAO;AAC/C,YAAM,aAAa,MAAM,aAAa,QAAQ,QAAQ,MACpD,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,SAAS,YAAY,OAAO,CAAC,CAAC;AAC9F,UAAI,CAAC,WAAY,QAAO;AACxB,YAAM,SAAS,kBAAkB,UAAU,UAAU;AACrD,UAAI,KAAK,aAAa,UAAU,OAAO,UAAU,OAAO,IAAI,EAAG,QAAO;AACtE,UAAI,0BAA0B,qBAAqB,MAAM,MAAM,wBAAwB;AACrF,eAAO;AAAA,MACT;AACA,UAAI,mBAAmB,SAAS,MAAM,YAAY,WAAW,WAAW,GAAG;AACzE,eAAO;AAAA,MACT;AACA,YAAM,YAAY,EAAE,KAAK,OAAO,KAAK,YAAY,qBAAqB,MAAM,EAAE;AAC9E,UAAI,CAAC,KAAK,mBAAmB,MAAM,EAAG,QAAO;AAC7C,YAAM,kBAAkB;AAAA,QACtB,OAAO;AAAA,QACP,OAAO;AAAA,MACT;AACA,YAAM,eAAe,sBAAsB,OAAO,KAAK,MAAM,eAAe;AAC5E,YAAM,eAAe,SAAS,mBAC1B,MAAM,aAAa,QAAQ,QAAQ,MACjC,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,iBAAkB,OAAO,MAAM,cAAc,OAAO,CAAC,CAAC,IACtH;AACJ,UACE,OAAO,iBAAiB,YACxB,iBAAiB,QACjB,MAAM,QAAQ,YAAY,GAC1B;AACA,eAAO;AAAA,MACT;AACA,YAAM,eAAe;AAAA,QAAyB,OAAO;AAAA,QAAK;AAAA,QACxD,sBAAsB,OAAO,KAAK,kBAAkB,YAAY,GAAG,eAAe;AAAA,MACpF,EAAE;AACF,UAAI,kBAAkB,iBAAiB,YAAY,EAAG,QAAO;AAC7D,YAAM,mBAAmB,GAAG,0BAA0B,QAAQA,YAAW,CAAC;AAC1E,YAAM,UAAU,MAAM,KAAK,gBAAgB,SAAS,OAAO,MAAM,WAAW,aAAa,cAAc,KAAK,gBAAgB,SAAS;AAAA,QACnI,GAAG;AAAA,QAAS;AAAA,QAAkB,SAAS;AAAA,QAAC;AAAA,QAAG,WAAW;AAAA,QAAC;AAAA,QACvD,YAAY,QAAQ,MAAM;AAAE,iBAAO,QAAQ,CAAC,GAAI,OAAO,SAAS,CAAC,GAAI,GAAG,MAAM;AAAG,cAAI,KAAM,QAAO,YAAY;AAAA,QAAM;AAAA,QACpH,gBAAgB,aAAa;AAAE,iBAAO,cAAc;AAAA,QAAa;AAAA,QACjE,cAAc,SAAS;AAAE,iBAAO,UAAU;AAAA,QAAS;AAAA,QACnD,mBAAmB;AAAE,iBAAO,YAAY;AAAA,QAAM;AAAA,MAChD,CAAC,CAAC;AACF,aAAO;AAAA,QACL,IAAI,eAAe;AAAE,iBAAO,kBAAkB,YAAY;AAAA,QAAG;AAAA,QAC7D,cAAc,KAAK,UAAU,CAAC,QAAQ,IAAI,UAAU,YAAY,QAAQ,gBAAgB,MAAM,MAAM,QAAQ,OAAO,UAAU,MAAM,QAAQ,qBAAqB,IAAI,CAAC;AAAA,QACrK,SAAS,OAAM,WAAU;AACvB,gBAAM,WAAW,YAAY,IAAI,CAAC,QAAQ,QAAS,GAAI,SAAS,CAAC,MAAM,IAAI,CAAC,CAAE,CAAC;AAC/E,gBAAM,SAAS,QAAQ,QAAQ;AAC/B,eAAK,OAAO,MAAM,MAAM,MAAS;AACjC,iBAAO,aAAa,UAAU,MAAM,MAAM;AAAA,QAC5C;AAAA,MACF;AAAA,IACF,QAAQ;AAEN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,cAAc,kBAA0B,YAAY,KAAsB;AAC9E,SAAK,cAAc,kBAAkB,gBAAgB;AACrD,UAAM,YAAY,IAAI;AAAA,MACpB,KAAK,kBAAkB,QAAQ,EAAE,IAAI,CAAC,YAAY,QAAQ,QAAQ;AAAA,IACpE;AACA,UAAM,aAAa,CAAC,GAAG,SAAS,EAAE;AAAA,MAAQ,CAAC,aACzC,SAAS,kBACL,CAAC,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,gBAAiB,gBAAgB,GAAG,IAAI,CAAC,IACxG,CAAC;AAAA,IACP;AACA,UAAM,aAAa,YAAY,SAAS;AAAA,EAC1C;AAAA;AAAA;AAAA,EAIA,eAAe,MAAoB;AACjC,UAAM,UAAU,KAAK,kBAAkB,QAAQ,IAAI;AACnD,QAAI,QAAS,MAAK,kBAAkB,OAAO,QAAQ,EAAE;AAAA,EACvD;AAAA,EAEA,iBAAiI;AAC/H,WAAO,KAAK,kBAAkB,QAAQ,EAAE,IAAI,cAAY;AAAA,MAAE,MAAM,QAAQ;AAAA,MAAM,YAAY,QAAQ;AAAA,MAAY,OAAO,QAAQ;AAAA,MAC3H,UAAU,QAAQ;AAAA,MAAU,SAAS,KAAK,kBAAkB,OAAO,QAAQ,EAAE,EAAE;AAAA,MAC/E,GAAI,QAAQ,aAAa,EAAE,OAAO,QAAQ,WAAW,IAAI,CAAC;AAAA,IAAG,EAAE;AAAA,EACnE;AAAA,EAEA,MAAM,MAAM,wBAAqC,oBAAI,IAAI,GAAkB;AACzE,SAAK,UAAU,MAAM,IAAI,MAAM,wBAAwB,CAAC;AACxD,QAAI;AACF,UAAI,KAAK,YAAa,QAAO,MAAM,KAAK,aAAa,MAAM;AAAA,IAC7D,UAAE;AACA,YAAM,KAAK,kBAAkB,MAAM,qBAAqB;AAAA,IAC1D;AAAA,EACF;AAAA,EAGA,MAAM,qBACJ,cACA,SACA,QACoC;AACpC,cAAU,KAAK,cAAc,OAAO;AACpC,UAAM,aAAa,oBAAI,IAAqB;AAC5C,eAAW,eAAe,cAAc;AACtC,YAAM,OAAO,OAAO,gBAAgB,WAAW,cAAc,YAAY,KAAK,KAAK;AACnF,UAAI,CAAC,OAAO,IAAI,SAAS,OAAO,CAAC,IAAI,SAAS,GAAG,GAAG;AAClD,cAAM,IAAI,MAAM,4DAA4D,OAAO,SAAS,EAAE;AAAA,MAChG;AACA,YAAM,WAAW,OAAO,gBAAgB,WAAW,QAAQ,YAAY,aAAa;AACpF,iBAAW,IAAI,MAAM,WAAW,IAAI,GAAG,KAAK,SAAS,QAAQ;AAAA,IAC/D;AAEA,UAAM,UAAoB,CAAC;AAC3B,UAAM,kBAA4B,CAAC;AACnC,UAAM,WAAW,oBAAI,IAAyC;AAC9D,UAAM,oBAAgD,CAAC;AACvD,QAAI;AACJ,QAAI;AACF,iBAAW,CAAC,KAAK,QAAQ,KAAK,CAAC,GAAG,UAAU,EAAE;AAAA,QAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAChE,KAAK,cAAc,KAAK;AAAA,MAC1B,GAAG;AACD,YAAI;AACF,gBAAM,EAAE,SAAS,UAAU,YAAY,uBAAuB,IAAI,KAAK,UAAU,KAAK,QAAQ,cAAc;AAC5G,gBAAM,UAAU,KAAK,kBAAkB,OAAO,CAAC,QAAQ,EAAE,CAAC;AAC1D,4BAAkB,KAAK,OAAO;AAC9B,gBAAM,aAAa,MAAM;AAAA,YAAa,QAAQ;AAAA,YAAQ,MACpD,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,SAAS,YAAY,OAAO,CAAC;AAAA,UAC7F;AACA,cAAI,CAAC,WAAY,OAAM,IAAI,sBAAsB,0BAA0B,GAAG,EAAE;AAChF,gBAAM,SAAS,kBAAkB,UAAU,UAAU;AACrD,cAAI,0BAA0B,qBAAqB,MAAM,MAAM,uBAAwB,OAAM,IAAI,sBAAsB,iCAAiC,GAAG,EAAE;AAC7J,mBAAS,IAAI,KAAK;AAAA,YAChB;AAAA,YACA,UAAU,SAAS;AAAA,YACnB,mBAAmB,QAAQ;AAAA,YAC3B,YAAY,QAAQ;AAAA,YACpB,gBAAgB,qBAAqB,MAAM;AAAA,UAC7C,CAAC;AAAA,QACH,SAAS,OAAO;AACd,cAAI,EAAE,iBAAiB,uBAAwB,OAAM;AACrD,WAAC,WAAW,kBAAkB,SAAS,KAAK,GAAG;AAAA,QACjD;AAAA,MACF;AAEA,UAAI;AACJ,UAAI,QAAQ,WAAW,GAAG;AAIxB,uBAAe,QAAQ,MAAM;AAC7B,cAAM,SAAS,CAAC,GAAG,SAAS,OAAO,CAAC;AACpC,cAAM,YAAY,QAAQ,iBACtB,KAAK,eAAe,QAAQ,cAAc,EAAE,OAAO,MAAM,IACzD,oBAAoB,MAAM,MAAM;AACpC,YAAI,CAAC,UAAU,OAAQ,OAAM,IAAI,sBAAsB,0DAA0D;AACjH,cAAM,WAAW,OAAO,YAAY,UAAU,SAAS,EAAE,IAAI,WAAS,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC;AACzF,YAAI,OAAQ,oBAAmB,KAAK,kBAAkB;AAAA,UACpD,OAAO,IAAI,CAAC,YAAY,QAAQ,iBAAiB;AAAA,QACnD;AACA,mBAAW,SAAS,OAAO,OAAO,QAAQ,EAAG,QAAO,OAAO,KAAK;AAChE,eAAO,OAAO,OAAO;AAAA,UACnB,IAAIA,YAAW;AAAA,UACf,QAAQ,eAAe,MAAM;AAAA,UAC7B,gBAAgB;AAAA,YACd,OAAO,IAAI,CAAC,EAAE,KAAK,UAAU,gBAAgB,KAAK,OAAO;AAAA,cACvD;AAAA,cACA;AAAA,cACA,gBAAgB;AAAA,YAClB,EAAE;AAAA,UACJ;AAAA,UACA,UAAU,OAAO,OAAO,QAAQ;AAAA,QAClC,CAAC;AACD,cAAM,aAAa,IAAI,gBAAgB;AACvC,cAAM,SAAS,QAAQ,iBAAiB,KAAK,aAAa,QAAQ,cAAc,IAAI;AACpF,cAAM,SAAS,YAAY,IAAI,CAAC,KAAK,UAAU,QAAQ,WAAW,QAAQ,GAAI,SAAS,CAAC,MAAM,IAAI,CAAC,CAAE,CAAC;AACtG,aAAK,OAAO,IAAI,MAAM,EAAE,YAAY,QAAQ,UAAU,CAAC;AACvD,cAAM,UAAU,MAAM;AACpB,oBAAU,QAAQ;AAClB,gBAAM,UAAU;AAChB,6BAAmB;AACnB,eAAK,UAAU,EAAE,MAAM,MAAM,MAAS;AAAA,QACxC;AACA,eAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACxD,YAAI,OAAO,QAAS,SAAQ;AAAA,MAC9B;AACA,aAAO;AAAA,QACL,WAAW,QAAQ,WAAW;AAAA,QAC9B;AAAA,QACA;AAAA,QACA,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,QACvB,SAAS,YAAY;AACnB,gBAAM,UAAU;AAChB,6BAAmB;AACnB,cAAI,KAAM,MAAK,OAAO,IAAI,IAAI,GAAG,WAAW,MAAM,IAAI,MAAM,iCAAiC,CAAC;AAC9F,gBAAM,UAAU;AAAA,QAClB;AAAA,MACF;AAAA,IACF,UAAE;AACA,YAAM,QAAQ,WAAW,kBAAkB,IAAI,CAAC,YAAY,QAAQ,CAAC,CAAC;AAAA,IACxE;AAAA,EACF;AAAA,EAEA,MAAM,qBACJ,UACA,SACmB;AACnB,QAAI;AACF,YAAM,cAAc,MAAM,KAAK,cAAc,UAAU,CAAC,GAAG,OAAO;AAClE,aAAO,YAAY,IAAI,CAAC,eAAe,WAAW,IAAI;AAAA,IACxD,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,yBACJ,UACA,YACA,SACA,aAC0F;AAC1F,UAAM,aAAa,MAAM;AAAA,MAAa,QAAQ;AAAA,MAAQ,MACpD,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,SAAS,YAAY,OAAO,CAAC;AAAA,IAC7F;AAIA,QAAI,cAAc,CAAC,mBAAmB,SAAS,MAAM,YAAY,WAAW,WAAW,GAAG;AACxF,aAAO;AAAA,QACL,QAAQ,kBAAkB,UAAU,UAAU;AAAA,QAC9C,aAAa,CAAC;AAAA,QACd,GAAI,WAAW,SAAS,aAAa,EAAE,cAAc,WAAW,IAAI,CAAC;AAAA,MACvE;AAAA,IACF;AACA,QAAI,CAAC,YAAa,QAAO,EAAE,aAAa,CAAC,EAAE;AAC3C,UAAM,YAAY,MAAM,KAAK,qBAAqB,UAAU,OAAO,GAAG;AAAA,MACpE,CAAC,SAAS,CAAC,0BAA0B,EAAE,IAAI,GAAG,SAAS,IAAI,IAAI,IAAI,EAAE;AAAA,IACvE;AACA,UAAM,cAAc,sBAAsB,SAAS,MAAM,YAAY,QAAQ;AAC7E,QAAI,gBAAgB,YAAY;AAC9B,YAAM,oBAAoB,MAAM;AAAA,QAAa,QAAQ;AAAA,QAAQ,MAC3D,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,SAAS,aAAa,OAAO,CAAC;AAAA,MAC9F;AACA,UAAI,mBAAmB;AACrB,eAAO;AAAA,UACL,QAAQ,kBAAkB,UAAU,iBAAiB;AAAA,UACrD,aAAa,CAAC;AAAA,UACd,cAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AACA,UAAM,SAAS,iBAAiB,UAAU,UAAU;AACpD,UAAM,WAAW,wBAAwB;AACzC,QAAI,OAAO,aAAa,QAAW;AACjC,gBAAU,qBAAqB,SAAS,MAAM,YAAY,UAAU;AAAA,QAClE,YAAY;AAAA,MACd,CAAC;AACD,YAAM,qBAAqB,MAAM;AAAA,QAAa,QAAQ;AAAA,QAAQ,MAC5D,KAAK,kBAAkB,cAAc,UAAU,MAAM,SAAS,SAAS,OAAO,UAAW,OAAO,CAAC;AAAA,MACnG;AACA,UAAI,oBAAoB;AACtB,eAAO;AAAA,UACL,QAAQ,kBAAkB,UAAU,kBAAkB;AAAA,UACtD,aAAa,CAAC;AAAA,UACd,cAAc;AAAA,QAChB;AAAA,MACF;AACA,gBAAU,sBAAsB;AAAA,IAClC,OAAO;AACL,gBAAU,qBAAqB,SAAS,MAAM,YAAY,QAAQ;AAAA,IACpE;AACA,WAAO;AAAA,MACL,aAAa,OAAO,YAAY,IAAI,CAAC,SAAS,GAAG,SAAS,IAAI,IAAI,IAAI,EAAE;AAAA,IAC1E;AAAA,EACF;AAAA,EAEA,UACE,KACA,MAMA;AACA,QAAI,KAAM,MAAK,aAAa,IAAI;AAChC,UAAM,YAAY,IAAI,QAAQ,GAAG;AACjC,QAAI,aAAa,KAAK,cAAc,IAAI,SAAS,GAAG;AAClD,YAAM,IAAI,MAAM,sDAAsD,GAAG,EAAE;AAAA,IAC7E;AACA,UAAM,eAAe,IAAI,MAAM,GAAG,SAAS;AAK3C,UAAM,aAAa,KAAK,aAAa,UAAU,cAAc,IAAI,MAAM,YAAY,CAAC,CAAC;AACrF,QAAI,WAAY,OAAM,IAAI,sBAAsB,UAAU;AAC1D,UAAM,SAAS,OAAO,KAAK,eAAe,IAAI,EAAE,QAAQ,GAAG,IAAI;AAC/D,QAAI,QAAQ,CAAC,QAAQ;AACnB,YAAM,IAAI,sBAAsB,oDAAoD,GAAG,EAAE;AAAA,IAC3F;AACA,UAAM,UAAU,SACZ,KAAK,kBAAkB,QAAQ,OAAO,iBAAiB,IACvD,KAAK,kBAAkB,QAAQ,YAAY;AAC/C,QAAI,CAAC,WAAW,QAAQ,SAAS,gBAAiB,WAAW,OAAO,eAAe,QAAQ,cAAc,OAAO,aAAa,gBAAgB,OAAO,QAAQ,MAAO;AACjK,UAAI,QAAQ;AACV,cAAM,IAAI;AAAA,UACR,qDAAqD,GAAG,KAAK,OAAO,iBAAiB;AAAA,QACvF;AAAA,MACF;AACA,WAAK,iBAAiB,YAAY;AAClC,YAAM,IAAI,sBAAsB,4BAA4B,YAAY,EAAE;AAAA,IAC5E;AACA,WAAO;AAAA,MACL;AAAA,MACA,UAAU,QAAQ;AAAA,MAClB,YAAY,IAAI,MAAM,YAAY,CAAC;AAAA,MACnC,GAAI,SAAS,EAAE,wBAAwB,OAAO,eAAe,IAAI,CAAC;AAAA,IACpE;AAAA,EACF;AAAA,EAEA,aAAa,MAAkD;AAC7D,UAAM,QAAQ,KAAK,OAAO,IAAI,IAAI;AAClC,QAAI,CAAC,SAAS,MAAM,OAAO,WAAW,CAAC,MAAM,UAAU,OAAQ,OAAM,IAAI,sBAAsB,0DAA0D;AACzJ,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,eAAe,MAA0D;AACvE,SAAK,aAAa,IAAI;AACtB,WAAO,KAAK,OAAO,IAAI,IAAI,EAAG;AAAA,EAChC;AAAA,EAEA,cAAiD,SAAe;AAC9D,UAAM,OAAO,QAAQ,iBAAiB,KAAK,aAAa,QAAQ,cAAc,IAAI;AAClF,mBAAe,QAAQ,MAAM;AAC7B,QAAI,KAAK,UAAU,OAAO,QAAS,OAAM,IAAI,sBAAsB,2BAA2B;AAE9F,UAAM,SAAU,WAAmF,YAAY;AAC/G,QAAI,QAAQ,MAAO,OAAM,IAAI,sBAAsB,6DAA6D,OAAO,KAAK,EAAE;AAC9H,UAAM,SAAS,EAAE,GAAG,SAAS,QAAQ,YAAY,IAAI,CAAC,KAAK,UAAU,QAAQ,GAAI,QAAQ,SAAS,CAAC,QAAQ,MAAM,IAAI,CAAC,GAAI,GAAI,OAAO,CAAC,IAAI,IAAI,CAAC,CAAE,CAAC,EAAE;AACpJ,QAAI,QAAQ,MAAO,QAAO,QAAQ,OAAO;AAAA,QACpC,QAAO,OAAO;AACnB,WAAO;AAAA,EACT;AAAA,EAEA,gBAAmD,SAAgC,SAAe;AAChG,WAAO,EAAE,GAAG,SAAS,QAAQ,YAAY,IAAI,CAAC,KAAK,kBAAkB,OAAO,QAAQ,EAAE,GAAG,GAAI,QAAQ,SAAS,CAAC,QAAQ,MAAM,IAAI,CAAC,CAAE,CAAC,EAAE;AAAA,EACzI;AAAA,EAEA,MAAM,gBAAgB,SAAgC,YAAoB,WAAgD,MAAiC,MAA+B,SAAkC,aAAuB,OAAyF;AAC1U,UAAM,UAAU,kBAAkB,IAAI;AACtC,SAAK,gBAAgB,OAAO,gCAA0B,EAAE,KAAK,CAAC,EAAE,mBAAmB,MAAM,IAAI,mBAAmB,KAAK,iBAAiB,CAAC;AACvI,YAAQ,MAAM,KAAK,aAAa,QAAQ;AAAA,MAAE;AAAA,MAAS,QAAQ;AAAA,MAAY,GAAG;AAAA,MAAW;AAAA,MAAM,MAAM;AAAA,MAAS;AAAA,MAAS;AAAA,MAAa,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,MACvJ,SAAS,OAAM,oBAAmB;AAChC,cAAM,aAAa,MAAM,QAAQ,SAAS,SAAS,YAAY,eAAe;AAC9E,YAAI,CAAC,WAAY,QAAO,EAAE,KAAK,IAAI,YAAY,GAAG;AAClD,cAAM,SAAS,kBAAkB,QAAQ,UAAU,UAAU;AAC7D,eAAO,EAAE,KAAK,OAAO,KAAK,YAAY,qBAAqB,MAAM,EAAE;AAAA,MACrE;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,YAAY,SAAgC,YAAoB,WAAgD,MAAiC,MAA+B,SAAkC,aAAuB,OAAsD;AAC7R,WAAO,KAAK,kBAAkB,MAAM,QAAQ,IAAI,YAAY;AAC1D,YAAM,UAAU,MAAM,KAAK,gBAAgB,SAAS,YAAY,WAAW,MAAM,MAAM,SAAS,aAAa,KAAK;AAClH,aAAO,QAAQ;AAAA,IACjB,CAAC;AAAA,EACH;AAAA,EAEA,iBAAiB,MAA8B;AAC7C,UAAM,WAAW,KAAK,kBAAkB,QAAQ,IAAI,GAAG;AACvD,QAAI,SAAU,QAAO;AACrB,UAAM,oBAAoB,KAAK,aAAa,IAAI,IAAI,KAAK,KAAK,uBAAuB,IAAI;AACzF,QAAI,mBAAmB;AACrB,YAAM,IAAI;AAAA,QACR,oBAAoB,IAAI,qBAAqB,iBAAiB;AAAA,MAChE;AAAA,IACF;AACA,UAAM,aAAa,KAAK,kBAAkB,UAAU,EACjD,IAAI,CAACC,cAAaA,UAAS,IAAI,EAC/B,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AAClD,UAAM,IAAI;AAAA,MACR,4BAA4B,IAAI,MAC7B,WAAW,SAAS,IAAI,2BAA2B,WAAW,KAAK,IAAI,CAAC,MAAM;AAAA,IACnF;AAAA,EACF;AACF;",
|
|
6
6
|
"names": ["step", "randomUUID", "$n", "$m", "$keys", "$every", "step", "$n", "$m", "$keys", "$every", "step", "$n", "$m", "resourceGroups", "resourceGroups", "index", "snapshot", "$n", "step", "bindingStep", "bindingStep", "binding", "snapshot", "page", "matches", "value", "randomUUID", "provider"]
|
|
7
7
|
}
|