pi-fabric 0.135.0 → 0.135.1

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.
Files changed (38) hide show
  1. package/dist/chunks/{chunk-6BDBTLKC.js → chunk-KIPZ5XKZ.js} +65 -10
  2. package/dist/chunks/chunk-KIPZ5XKZ.js.map +7 -0
  3. package/dist/chunks/{chunk-FHCT5TCH.js → chunk-Q5ICW2VE.js} +1 -1
  4. package/dist/chunks/{chunk-USID2V4D.js → chunk-SVQ7ZHEQ.js} +2 -2
  5. package/dist/chunks/{chunk-NNKNO6AA.js → chunk-T7T5W3OP.js} +35 -13
  6. package/dist/chunks/chunk-T7T5W3OP.js.map +7 -0
  7. package/dist/chunks/{chunk-QGTD3LAZ.js → chunk-UYS5VZUU.js} +9 -3
  8. package/dist/chunks/chunk-UYS5VZUU.js.map +7 -0
  9. package/dist/chunks/{chunk-QNMQJNXE.js → chunk-X4HDI7RT.js} +14 -4
  10. package/dist/chunks/chunk-X4HDI7RT.js.map +7 -0
  11. package/dist/durable-extension.js +1 -1
  12. package/dist/durable-extension.js.map +1 -1
  13. package/dist/entropy/index.js +3 -1
  14. package/dist/entropy/pool.d.ts.map +1 -1
  15. package/dist/entropy/sessions.d.ts +5 -0
  16. package/dist/entropy/sessions.d.ts.map +1 -1
  17. package/dist/extension-bootstrap.js +3 -3
  18. package/dist/index.js +6 -4
  19. package/dist/index.js.map +1 -1
  20. package/dist/jev.js +1 -1
  21. package/dist/providers/jev-provider.js +1 -1
  22. package/dist/runtime/node-process-runtime.js +1 -1
  23. package/dist/runtime/type-checker.d.ts.map +1 -1
  24. package/dist/runtime/type-checker.js +1 -1
  25. package/dist/runtime/typescript-kernel.js +1 -1
  26. package/dist/ui/conversation.js +1 -1
  27. package/dist/ui/dashboard.js +2 -2
  28. package/dist/ui/highlight.d.ts.map +1 -1
  29. package/dist/ui/tool-display.d.ts +18 -2
  30. package/dist/ui/tool-display.d.ts.map +1 -1
  31. package/docs/session-memory-investigation.md +49 -0
  32. package/package.json +1 -1
  33. package/dist/chunks/chunk-6BDBTLKC.js.map +0 -7
  34. package/dist/chunks/chunk-NNKNO6AA.js.map +0 -7
  35. package/dist/chunks/chunk-QGTD3LAZ.js.map +0 -7
  36. package/dist/chunks/chunk-QNMQJNXE.js.map +0 -7
  37. /package/dist/chunks/{chunk-FHCT5TCH.js.map → chunk-Q5ICW2VE.js.map} +0 -0
  38. /package/dist/chunks/{chunk-USID2V4D.js.map → chunk-SVQ7ZHEQ.js.map} +0 -0
@@ -815,6 +815,7 @@ var mergeObservationWindow = (pool, windows) => mergeObservationSummaries(
815
815
  summary: summarizeObservations(window.observations)
816
816
  }))
817
817
  );
818
+ var extendsSummarized = (cached, observations) => cached.length <= observations.length && (cached.length === 0 || observations[0] === cached.first && observations[cached.length - 1] === cached.last);
818
819
  var SessionObservationCache = class {
819
820
  #windows = /* @__PURE__ */ new Map();
820
821
  async merge(pool, windows) {
@@ -825,11 +826,11 @@ var SessionObservationCache = class {
825
826
  const summarized = [];
826
827
  for (const window of windows) {
827
828
  let cached = this.#windows.get(window.file);
828
- if (cached?.observations !== window.observations) {
829
- const append = cached && cached.observations.length <= window.observations.length && cached.observations.every((observation, index) => observation === window.observations[index]);
829
+ const append = cached !== void 0 && extendsSummarized(cached, window.observations);
830
+ if (!append || cached.length !== window.observations.length) {
830
831
  const counts = append ? { ...cached.counts } : {};
831
832
  const digestCounts = append ? { ...cached.digestCounts } : {};
832
- const start = append ? cached.observations.length : 0;
833
+ const start = append ? cached.length : 0;
833
834
  for (let index = start; index < window.observations.length; index++) {
834
835
  const observation = window.observations[index];
835
836
  const identity = observationIdentity(observation);
@@ -837,8 +838,15 @@ var SessionObservationCache = class {
837
838
  digestCounts[identity] = (digestCounts[identity] ?? 0) + 1;
838
839
  if ((index + 1) % COOPERATIVE_OBSERVATION_CHUNK === 0) await yieldToLoop2();
839
840
  }
840
- const digest = append && start === window.observations.length ? cached.summary.digest : await digestFromIdentityCountsAsync(digestCounts);
841
- cached = { observations: window.observations, counts, digestCounts, summary: { counts, digest } };
841
+ const digest = await digestFromIdentityCountsAsync(digestCounts);
842
+ cached = {
843
+ length: window.observations.length,
844
+ first: window.observations[0],
845
+ last: window.observations.at(-1),
846
+ counts,
847
+ digestCounts,
848
+ summary: { counts, digest }
849
+ };
842
850
  }
843
851
  this.#windows.delete(window.file);
844
852
  this.#windows.set(window.file, cached);
@@ -1517,7 +1525,33 @@ var DEFAULT_SESSION_WINDOW = 8;
1517
1525
  var SESSION_STAT_CONCURRENCY = 32;
1518
1526
  var SESSION_READ_CONCURRENCY = 4;
1519
1527
  var SESSION_EVIDENCE_CACHE_LIMIT = 16;
1528
+ var SESSION_EVIDENCE_CACHE_BYTES = 16 * 1024 * 1024;
1520
1529
  var asyncEvidenceCache = /* @__PURE__ */ new Map();
1530
+ var asyncEvidenceCacheBytes = 0;
1531
+ var OBJECT_BYTES = 32;
1532
+ var SLOT_BYTES = 8;
1533
+ var STRING_BYTES = 16;
1534
+ var OBSERVATION_BYTES = 48;
1535
+ var ESTIMATE_CHUNK = 4096;
1536
+ var estimateEvidenceBytesAsync = async (evidence) => {
1537
+ let bytes = OBJECT_BYTES * 3 + evidence.valueObservations.length * (OBSERVATION_BYTES + SLOT_BYTES);
1538
+ const stack = [evidence.traces, evidence.auditCalls];
1539
+ let visited = 0;
1540
+ while (stack.length > 0) {
1541
+ const value = stack.pop();
1542
+ if (typeof value === "string") bytes += STRING_BYTES + value.length;
1543
+ else if (Array.isArray(value)) {
1544
+ bytes += OBJECT_BYTES + value.length * SLOT_BYTES;
1545
+ for (const item of value) stack.push(item);
1546
+ } else if (value !== null && typeof value === "object") {
1547
+ const entries = Object.entries(value);
1548
+ bytes += OBJECT_BYTES + entries.length * SLOT_BYTES * 2;
1549
+ for (const [, item] of entries) stack.push(item);
1550
+ } else bytes += SLOT_BYTES;
1551
+ if (++visited % ESTIMATE_CHUNK === 0) await new Promise((resolve) => setImmediate(resolve));
1552
+ }
1553
+ return bytes;
1554
+ };
1521
1555
  var mapConcurrent = async (items, limit, fn) => {
1522
1556
  const results = new Array(items.length);
1523
1557
  let cursor = 0;
@@ -1776,13 +1810,29 @@ var evidenceWindow = (file, evidence) => ({
1776
1810
  auditCalls: evidence.auditCalls,
1777
1811
  observationWindows: [{ file, observations: evidence.valueObservations }]
1778
1812
  });
1779
- var cacheSessionEvidence = (file, cached) => {
1813
+ var forgetSessionEvidence = (file) => {
1814
+ const cached = asyncEvidenceCache.get(file);
1815
+ if (!cached) return;
1780
1816
  asyncEvidenceCache.delete(file);
1817
+ asyncEvidenceCacheBytes -= cached.bytes;
1818
+ };
1819
+ var cacheSessionEvidence = (file, cached) => {
1820
+ forgetSessionEvidence(file);
1781
1821
  asyncEvidenceCache.set(file, cached);
1822
+ asyncEvidenceCacheBytes += cached.bytes;
1782
1823
  while (asyncEvidenceCache.size > SESSION_EVIDENCE_CACHE_LIMIT) {
1783
- asyncEvidenceCache.delete(asyncEvidenceCache.keys().next().value);
1824
+ forgetSessionEvidence(asyncEvidenceCache.keys().next().value);
1825
+ }
1826
+ };
1827
+ var trimSessionEvidenceCache = () => {
1828
+ while (asyncEvidenceCache.size > DEFAULT_SESSION_WINDOW && asyncEvidenceCacheBytes > SESSION_EVIDENCE_CACHE_BYTES) {
1829
+ forgetSessionEvidence(asyncEvidenceCache.keys().next().value);
1784
1830
  }
1785
1831
  };
1832
+ var sessionEvidenceCacheUsage = () => ({
1833
+ files: asyncEvidenceCache.size,
1834
+ bytes: asyncEvidenceCacheBytes
1835
+ });
1786
1836
  var sameSessionFile = (cached, metadata) => cached.dev === metadata.dev && cached.ino === metadata.ino;
1787
1837
  var readSessionEvidenceAsync = async (file) => {
1788
1838
  const metadata = await sessionMetadata(file);
@@ -1817,18 +1867,21 @@ var readSessionEvidenceAsync = async (file) => {
1817
1867
  auditCalls: [...append.evidence.auditCalls, ...scan.evidence.auditCalls]
1818
1868
  } : scan.evidence;
1819
1869
  if (await endsAtLineBoundary(file, metadata)) {
1870
+ const bytes = (append?.bytes ?? 0) + await estimateEvidenceBytesAsync(scan.evidence);
1820
1871
  cacheSessionEvidence(file, {
1821
1872
  ...metadata,
1822
1873
  ...scan.currentModel ? { currentModel: scan.currentModel } : {},
1823
- evidence
1874
+ evidence,
1875
+ bytes
1824
1876
  });
1825
1877
  } else {
1826
- asyncEvidenceCache.delete(file);
1878
+ forgetSessionEvidence(file);
1827
1879
  }
1828
1880
  return evidenceWindow(file, evidence);
1829
1881
  };
1830
1882
  var sessionWindowEvidenceAsync = async (files, options = {}) => {
1831
1883
  const windows = await mapConcurrent(files, SESSION_READ_CONCURRENCY, readSessionEvidenceAsync);
1884
+ trimSessionEvidenceCache();
1832
1885
  const traces = [];
1833
1886
  const valueObservations = [];
1834
1887
  const auditCalls = [];
@@ -1852,6 +1905,7 @@ var measureSessionCorpusAsync = async (input) => {
1852
1905
  SESSION_READ_CONCURRENCY,
1853
1906
  readSessionEvidenceAsync
1854
1907
  );
1908
+ trimSessionEvidenceCache();
1855
1909
  const sessions = [];
1856
1910
  for (let index = 0; index < input.files.length; index++) {
1857
1911
  const window = windows[index];
@@ -2038,9 +2092,10 @@ export {
2038
2092
  machineSessionFilesAsync,
2039
2093
  measureSessionCorpus,
2040
2094
  BackgroundSessionSelector,
2095
+ sessionEvidenceCacheUsage,
2041
2096
  sessionWindowEvidenceAsync,
2042
2097
  measureSessionCorpusAsync,
2043
2098
  sessionWindowEvidence,
2044
2099
  runEntropyTrial
2045
2100
  };
2046
- //# sourceMappingURL=chunk-6BDBTLKC.js.map
2101
+ //# sourceMappingURL=chunk-KIPZ5XKZ.js.map
@@ -0,0 +1,7 @@
1
+ {
2
+ "version": 3,
3
+ "sources": ["../../src/entropy/meter.ts", "../../src/entropy/passes.ts", "../../src/entropy/pool.ts", "../../src/entropy/pool-store.ts", "../../src/entropy/pool-writer.ts", "../../src/entropy/pool-worker.ts", "../../src/entropy/surface.ts", "../../src/entropy/compiler.ts", "../../src/entropy/presentation.ts", "../../src/entropy/corpus.ts", "../../src/entropy/sessions.ts", "../../src/entropy/trial.ts"],
4
+ "sourcesContent": ["import {\n ENTROPY_INVOCATION_STAGES,\n ENTROPY_METRIC_VERSION,\n ENTROPY_WEIGHTS,\n type EntropyModelReport,\n type EntropyRefReport,\n type EntropyRepairRowInput,\n type EntropyReport,\n type EntropyShapeSignature,\n type EntropySurfaceSnapshot,\n type EntropyTotals,\n type EntropyTraceInput,\n} from \"./types.js\";\nimport {\n compareCodeUnits,\n roundMetric,\n shannonEntropyBits,\n shapeSignature,\n signatureDistance,\n staticFreedomFromSchema,\n} from \"./fingerprint.js\";\n\n// The meter is a pure function of its inputs: typed trace operations, an\n// optional surface snapshot, and the normalized repair table. It reads no\n// clocks, no randomness, and no prose \u2014 only the residues of non-canonical\n// behavior Fabric already records. Same inputs and metric version, same\n// report, on every run.\n\nexport interface EntropyMeterInput {\n traces: readonly EntropyTraceInput[];\n surface?: EntropySurfaceSnapshot;\n repairs?: readonly EntropyRepairRowInput[];\n catalogDigest?: string;\n}\n\nexport interface EntropyTraceWindow {\n file: string;\n /** Session-reader snapshots are immutable; appends retain existing trace identities. */\n traces: readonly EntropyTraceInput[];\n}\n\nconst DISCOVERY_PREFIX = \"fabric.discovery.\";\nconst WORKFLOW_PREFIX = \"fabric.workflow.\";\nconst DEFAULT_TASK_KEY = \"(none)\";\nconst TOP_SIGNATURES = 8;\n\ninterface RefAccumulator {\n calls: number;\n succeeded: number;\n failed: number;\n signatures: Map<string, number>;\n stages: Map<string, number>;\n churnPairs: number;\n churnSum: number;\n}\n\n// The core pass without per-model attribution; measureEntropy wraps it so\n// each model's behavioral terms come from the same formula over its own\n// traces, measured against the same surface.\ntype EntropyReportCore = Omit<EntropyReport, \"byModel\">;\n\ninterface MeasureState {\n surfaceByRef: Map<string, unknown>;\n lexiconByRef: Map<string, number>;\n lexiconRows: number;\n totals: EntropyTotals;\n refs: Map<string, RefAccumulator>;\n taskSequences: Map<string, Map<string, number>>;\n churnPairs: number;\n churnSum: number;\n}\n\nconst createMeasureState = (input: EntropyMeterInput): MeasureState => {\n const surfaceByRef = new Map<string, unknown>();\n if (input.surface) {\n for (const action of input.surface.actions) surfaceByRef.set(action.ref, action.inputSchema);\n }\n const lexiconByRef = new Map<string, number>();\n let lexiconRows = 0;\n for (const row of input.repairs ?? []) {\n lexiconByRef.set(row.ref, (lexiconByRef.get(row.ref) ?? 0) + 1);\n lexiconRows += 1;\n }\n return {\n surfaceByRef,\n lexiconByRef,\n lexiconRows,\n totals: {\n traces: input.traces.length,\n operations: 0,\n actionOperations: 0,\n discoveryOperations: 0,\n workflowOperations: 0,\n succeeded: 0,\n failed: 0,\n aborted: 0,\n timedOut: 0,\n invocationRejections: 0,\n invocationRejectionsPer1k: 0,\n },\n refs: new Map(),\n taskSequences: new Map(),\n churnPairs: 0,\n churnSum: 0,\n };\n};\n\nconst accumulatorFor = (state: MeasureState, ref: string): RefAccumulator => {\n const existing = state.refs.get(ref);\n if (existing) return existing;\n const created: RefAccumulator = {\n calls: 0,\n succeeded: 0,\n failed: 0,\n signatures: new Map<string, number>(),\n stages: new Map<string, number>(),\n churnPairs: 0,\n churnSum: 0,\n };\n state.refs.set(ref, created);\n return created;\n};\n\nconst accumulateTrace = (state: MeasureState, sourceTrace: EntropyTraceInput): void => {\n const taskKey = sourceTrace.taskKey ?? DEFAULT_TASK_KEY;\n const sequence: string[] = [];\n const pendingFailed = new Map<string, string>();\n for (const operation of sourceTrace.operations) {\n state.totals.operations += 1;\n if (operation.ref.startsWith(DISCOVERY_PREFIX)) {\n state.totals.discoveryOperations += 1;\n continue;\n }\n if (operation.ref.startsWith(WORKFLOW_PREFIX)) {\n state.totals.workflowOperations += 1;\n continue;\n }\n state.totals.actionOperations += 1;\n sequence.push(operation.ref);\n const acc = accumulatorFor(state, operation.ref);\n acc.calls += 1;\n if (operation.outcome === \"succeeded\") {\n state.totals.succeeded += 1;\n acc.succeeded += 1;\n } else if (operation.outcome === \"failed\") {\n state.totals.failed += 1;\n acc.failed += 1;\n } else if (operation.outcome === \"aborted\") {\n state.totals.aborted += 1;\n } else {\n state.totals.timedOut += 1;\n }\n const signature = shapeSignature(operation.args);\n acc.signatures.set(signature, (acc.signatures.get(signature) ?? 0) + 1);\n if (operation.outcome === \"failed\") {\n const stage = operation.failureStage ?? \"unknown\";\n acc.stages.set(stage, (acc.stages.get(stage) ?? 0) + 1);\n if (ENTROPY_INVOCATION_STAGES.includes(stage)) state.totals.invocationRejections += 1;\n }\n const pending = pendingFailed.get(operation.ref);\n if (pending !== undefined) {\n const distance = signatureDistance(pending, signature);\n acc.churnPairs += 1;\n acc.churnSum += distance;\n state.churnPairs += 1;\n state.churnSum += distance;\n pendingFailed.delete(operation.ref);\n }\n if (operation.outcome === \"failed\") pendingFailed.set(operation.ref, signature);\n }\n if (sequence.length > 0) {\n const key = sequence.join(\"\u2192\");\n const perTask = state.taskSequences.get(taskKey) ?? new Map<string, number>();\n perTask.set(key, (perTask.get(key) ?? 0) + 1);\n state.taskSequences.set(taskKey, perTask);\n }\n};\n\nconst finalizeMeasure = (\n input: EntropyMeterInput,\n state: MeasureState,\n): EntropyReportCore => {\n const refEntries = [...state.refs.entries()].sort(([left], [right]) =>\n compareCodeUnits(left, right),\n );\n const refReports: EntropyRefReport[] = [];\n let staticFreedomTotal = 0;\n let staticWeighted = 0;\n let shapeWeighted = 0;\n let failureStageWeighted = 0;\n for (const [ref, acc] of refEntries) {\n const shapeEntropyBits = shannonEntropyBits([...acc.signatures.values()]);\n const failureStageEntropyBits = shannonEntropyBits([...acc.stages.values()]);\n const refChurnRate = acc.churnPairs > 0 ? roundMetric(acc.churnSum / acc.churnPairs) : 0;\n const lexicon = state.lexiconByRef.get(ref) ?? 0;\n const staticFreedom = state.surfaceByRef.has(ref)\n ? staticFreedomFromSchema(state.surfaceByRef.get(ref))\n : 0;\n staticFreedomTotal += staticFreedom;\n staticWeighted += ENTROPY_WEIGHTS.staticFreedom * staticFreedom * acc.calls;\n shapeWeighted += shapeEntropyBits * acc.calls;\n failureStageWeighted += failureStageEntropyBits * acc.failed;\n const invocationRejections = ENTROPY_INVOCATION_STAGES.reduce(\n (sum, stage) => sum + (acc.stages.get(stage) ?? 0),\n 0,\n );\n const score = roundMetric(invocationRejections / acc.calls);\n const shapeSignatures: EntropyShapeSignature[] = [...acc.signatures.entries()]\n .map(([signature, count]) => ({ signature, count }))\n .sort(\n (left, right) => right.count - left.count || compareCodeUnits(left.signature, right.signature),\n )\n .slice(0, TOP_SIGNATURES);\n refReports.push({\n ref,\n calls: acc.calls,\n succeeded: acc.succeeded,\n failed: acc.failed,\n shapeSignatures,\n shapeEntropyBits,\n failureStageEntropyBits,\n churnRate: refChurnRate,\n lexiconRows: lexicon,\n staticFreedom,\n score,\n });\n }\n\n const navigationRatio = state.totals.actionOperations > 0\n ? roundMetric(state.totals.discoveryOperations / state.totals.actionOperations)\n : 0;\n let flowWeighted = 0;\n let flowOccurrences = 0;\n for (const perTask of state.taskSequences.values()) {\n const counts = [...perTask.values()];\n const occurrences = counts.reduce((sum, value) => sum + value, 0);\n flowWeighted += shannonEntropyBits(counts) * occurrences;\n flowOccurrences += occurrences;\n }\n const flowEntropyBits = flowOccurrences > 0\n ? roundMetric(flowWeighted / flowOccurrences)\n : 0;\n state.totals.invocationRejectionsPer1k = state.totals.actionOperations > 0\n ? roundMetric((state.totals.invocationRejections / state.totals.actionOperations) * 1000)\n : 0;\n // Operational burden is a rejection fraction, not entropy or capability size.\n const score = state.totals.actionOperations > 0\n ? roundMetric(state.totals.invocationRejections / state.totals.actionOperations)\n : 0;\n // Call-weighted schema freedom is diagnostic only, independent of corpus size.\n const staticScore = state.totals.actionOperations > 0\n ? roundMetric(staticWeighted / state.totals.actionOperations)\n : 0;\n const behavioralScore = score;\n const sortedRefs = [...refReports].sort(\n (left, right) => right.score - left.score || compareCodeUnits(left.ref, right.ref),\n );\n\n return {\n metricVersion: ENTROPY_METRIC_VERSION,\n catalogDigest: input.catalogDigest ?? \"\",\n totals: state.totals,\n shapeEntropyBits: state.totals.actionOperations > 0\n ? roundMetric(shapeWeighted / state.totals.actionOperations)\n : 0,\n failureStageEntropyBits: state.totals.failed > 0\n ? roundMetric(failureStageWeighted / state.totals.failed)\n : 0,\n churnRate: state.churnPairs > 0 ? roundMetric(state.churnSum / state.churnPairs) : 0,\n navigationRatio,\n flowEntropyBits,\n lexiconRows: state.lexiconRows,\n staticFreedom: roundMetric(staticFreedomTotal),\n staticScore,\n behavioralScore,\n score,\n refs: sortedRefs,\n };\n};\n\ninterface CachedTraceWindow {\n traces: readonly EntropyTraceInput[];\n state: MeasureState;\n models: Map<string, MeasureState>;\n}\n\nconst mergeCounts = (target: Map<string, number>, source: Map<string, number>): void => {\n for (const [key, count] of source) target.set(key, (target.get(key) ?? 0) + count);\n};\n\nconst mergeMeasureState = (target: MeasureState, source: MeasureState): void => {\n for (const key of Object.keys(source.totals) as (keyof EntropyTotals)[]) {\n target.totals[key] += source.totals[key];\n }\n target.churnPairs += source.churnPairs;\n target.churnSum += source.churnSum;\n for (const [ref, acc] of source.refs) {\n const into = accumulatorFor(target, ref);\n for (const key of [\"calls\", \"succeeded\", \"failed\", \"churnPairs\", \"churnSum\"] as const) into[key] += acc[key];\n mergeCounts(into.signatures, acc.signatures);\n mergeCounts(into.stages, acc.stages);\n }\n for (const [task, sequences] of source.taskSequences) {\n let into = target.taskSequences.get(task);\n if (!into) target.taskSequences.set(task, into = new Map());\n mergeCounts(into, sequences);\n }\n};\n\n/** Bounded, session-owned cache. Never pass mutable caller-owned traces here. */\nexport class SessionEntropyMeter {\n readonly #windows = new Map<string, CachedTraceWindow>();\n\n async measure(\n windows: readonly EntropyTraceWindow[],\n input: Omit<EntropyMeterInput, \"traces\">,\n ): Promise<EntropyReport> {\n const reportInput = { ...input, traces: [] };\n const combined = createMeasureState(reportInput);\n const models = new Map<string, MeasureState>();\n for (const window of windows) {\n let cached = this.#windows.get(window.file);\n if (cached?.traces !== window.traces) {\n const append = cached && cached.traces.length <= window.traces.length &&\n cached.traces.every((trace, index) => trace === window.traces[index]);\n if (!append) cached = { traces: [], state: createMeasureState({ traces: [] }), models: new Map() };\n const entry = cached!;\n // Publish only a complete update; a failed accumulation cannot leave a\n // half-applied append available for the next turn.\n this.#windows.delete(window.file);\n for (let index = entry.traces.length; index < window.traces.length; index++) {\n const trace = window.traces[index]!;\n accumulateTrace(entry.state, trace);\n entry.state.totals.traces++;\n if (trace.model) {\n let model = entry.models.get(trace.model);\n if (!model) entry.models.set(trace.model, model = createMeasureState({ traces: [] }));\n accumulateTrace(model, trace);\n model.totals.traces++;\n }\n if ((index + 1) % COOPERATIVE_TRACE_CHUNK === 0) await yieldToLoop();\n }\n entry.traces = window.traces;\n }\n const entry = cached!;\n this.#windows.delete(window.file);\n this.#windows.set(window.file, entry);\n while (this.#windows.size > 16) this.#windows.delete(this.#windows.keys().next().value!);\n mergeMeasureState(combined, entry.state);\n for (const [name, source] of entry.models) {\n let model = models.get(name);\n if (!model) models.set(name, model = createMeasureState(reportInput));\n mergeMeasureState(model, source);\n }\n await yieldToLoop();\n }\n const report = finalizeMeasure(reportInput, combined);\n const byModel = [...models.entries()].sort(([a], [b]) => compareCodeUnits(a, b)).map(([model, state]) => {\n const scoped = finalizeMeasure(reportInput, state);\n return { model, operations: scoped.totals.operations, actionOperations: scoped.totals.actionOperations,\n succeeded: scoped.totals.succeeded, invocationRejections: scoped.totals.invocationRejections,\n invocationRejectionsPer1k: scoped.totals.invocationRejectionsPer1k, behavioralScore: scoped.behavioralScore };\n });\n return { ...report, byModel };\n }\n}\n\nconst measureOnce = (input: EntropyMeterInput): EntropyReportCore => {\n const state = createMeasureState(input);\n for (const trace of input.traces) accumulateTrace(state, trace);\n return finalizeMeasure(input, state);\n};\n\nexport const measureEntropy = (input: EntropyMeterInput): EntropyReport => {\n const report = measureOnce(input);\n const groups = new Map<string, EntropyTraceInput[]>();\n for (const sourceTrace of input.traces) {\n if (!sourceTrace.model) continue;\n const group = groups.get(sourceTrace.model) ?? [];\n group.push(sourceTrace);\n groups.set(sourceTrace.model, group);\n }\n // Only stamped traces attribute; everything else stays in the global\n // report. Sorted iteration keeps the breakdown order stable.\n const byModel: EntropyModelReport[] = [...groups.entries()]\n .sort(([left], [right]) => compareCodeUnits(left, right))\n .map(([model, traces]) => {\n const scoped = measureOnce({ ...input, traces });\n return {\n model,\n operations: scoped.totals.operations,\n actionOperations: scoped.totals.actionOperations,\n succeeded: scoped.totals.succeeded,\n invocationRejections: scoped.totals.invocationRejections,\n invocationRejectionsPer1k: scoped.totals.invocationRejectionsPer1k,\n behavioralScore: scoped.behavioralScore,\n };\n });\n return { ...report, byModel };\n};\n\nconst yieldToLoop = (): Promise<void> =>\n new Promise((resolve) => setImmediate(resolve));\n\nconst COOPERATIVE_TRACE_CHUNK = 64;\n\nconst measureOnceAsync = async (\n input: EntropyMeterInput,\n): Promise<EntropyReportCore> => {\n const state = createMeasureState(input);\n await yieldToLoop();\n for (let index = 0; index < input.traces.length; index += 1) {\n accumulateTrace(state, input.traces[index]!);\n if ((index + 1) % COOPERATIVE_TRACE_CHUNK === 0) await yieldToLoop();\n }\n return finalizeMeasure(input, state);\n};\n\n// Cooperative meter for extension hooks. Trace accumulation yields in fixed\n// chunks in both the global and per-model passes, preserving exact synchronous\n// results while letting Pi repaint and process input during a large corpus.\nexport const measureEntropyAsync = async (\n input: EntropyMeterInput,\n): Promise<EntropyReport> => {\n const report = await measureOnceAsync(input);\n const groups = new Map<string, EntropyTraceInput[]>();\n for (const sourceTrace of input.traces) {\n if (!sourceTrace.model) continue;\n const group = groups.get(sourceTrace.model) ?? [];\n group.push(sourceTrace);\n groups.set(sourceTrace.model, group);\n }\n const byModel: EntropyModelReport[] = [];\n for (const [model, traces] of [...groups.entries()].sort(([left], [right]) =>\n compareCodeUnits(left, right),\n )) {\n const scoped = await measureOnceAsync({ ...input, traces });\n byModel.push({\n model,\n operations: scoped.totals.operations,\n actionOperations: scoped.totals.actionOperations,\n succeeded: scoped.totals.succeeded,\n invocationRejections: scoped.totals.invocationRejections,\n invocationRejectionsPer1k: scoped.totals.invocationRejectionsPer1k,\n behavioralScore: scoped.behavioralScore,\n });\n }\n return { ...report, byModel };\n};\n", "import type {\n EntropyGateResult,\n EntropyProposal,\n EntropyRefReport,\n EntropyReport,\n EntropyRepairRowInput,\n EntropySurfaceSnapshot,\n EntropyTraceInput,\n EntropyValueObservation,\n} from \"./types.js\";\nimport { compareCodeUnits, roundMetric } from \"./fingerprint.js\";\nimport { deriveNormalFormPlan, MAX_NORMAL_FORM_PLANS } from \"./normal-form.js\";\n\n// Normal forms are statically proved against declarations. Observations can\n// suggest authored abstractions, but cannot remove enum values or actions.\n// The schema surface itself is an invariant, not an optimization variable.\n\nexport interface EntropyProposalInput {\n report: EntropyReport;\n traces: readonly EntropyTraceInput[];\n surface?: EntropySurfaceSnapshot;\n repairs?: readonly EntropyRepairRowInput[];\n valueObservations?: readonly EntropyValueObservation[];\n}\n\nconst ENUM_MIN_OBSERVATIONS = 8;\nconst ENUM_MAX_DISTINCT = 8;\nconst ENUM_MIN_TOP_SHARE = 0.5;\nconst SPLIT_MIN_SHAPE_ENTROPY_BITS = 1;\nconst SPLIT_MIN_CLUSTER_CALLS = 2;\nconst FUSE_MIN_SEQUENCE_LENGTH = 3;\nconst FUSE_MAX_SEQUENCE_LENGTH = 6;\nconst FUSE_MIN_OCCURRENCES = 3;\nconst FUSE_MIN_EXECUTIONS = 3;\nconst MAX_PROPOSALS_PER_KIND = 8;\n\nexport const ENTROPY_ENUM_CANDIDATE_ANNOTATION = \"x-fabric-enum-candidate\";\n\nconst isPlainRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === \"object\" && value !== null && !Array.isArray(value);\n\nconst valueKey = (value: string | number | boolean): string => `${typeof value}:${String(value)}`;\n\nconst schemaProperties = (schema: unknown): Record<string, unknown> | undefined => {\n if (!isPlainRecord(schema)) return undefined;\n const properties = schema.properties;\n return isPlainRecord(properties) ? properties : undefined;\n};\n\nconst contains = (outer: readonly string[], inner: readonly string[]): boolean => {\n if (outer.length < inner.length) return false;\n for (let start = 0; start + inner.length <= outer.length; start++) {\n let matches = true;\n for (let index = 0; index < inner.length; index++) {\n if (outer[start + index] !== inner[index]) {\n matches = false;\n break;\n }\n }\n if (matches) return true;\n }\n return false;\n};\n\ninterface EnumCandidate {\n entry: {\n ref: string;\n key: string;\n counts: Map<string, { value: string | number | boolean; count: number }>;\n total: number;\n };\n ranked: { value: string | number | boolean; count: number }[];\n topShare: number;\n}\n\nexport const proposeEntropyReductions = (input: EntropyProposalInput): EntropyProposal[] => {\n const calledRefs = new Map<string, EntropyRefReport>();\n for (const ref of input.report.refs) calledRefs.set(ref.ref, ref);\n const surfaceByRef = new Map<string, unknown>();\n if (input.surface) {\n for (const action of input.surface.actions) {\n surfaceByRef.set(action.ref, action.inputSchema);\n }\n }\n\n const proposals: EntropyProposal[] = [];\n for (const action of [...(input.surface?.actions ?? [])].sort((a, b) => compareCodeUnits(a.ref, b.ref)).slice(0, MAX_NORMAL_FORM_PLANS)) {\n const plan = deriveNormalFormPlan(action.ref, action.inputSchema);\n if (plan) proposals.push({ kind: \"normal-form\", ref: plan.ref, baseSchemaDigest: plan.baseSchemaDigest, rules: plan.rules });\n }\n\n // Open vocabulary observations are advisory only, and require an author's\n // explicit annotation. Finite declared domains are never pruned by usage.\n const observations = new Map<\n string,\n {\n ref: string;\n key: string;\n counts: Map<string, { value: string | number | boolean; count: number }>;\n total: number;\n }\n >();\n const observeValue = (\n ref: string,\n key: string,\n value: string | number | boolean,\n weight = 1,\n ): void => {\n const id = `${ref}\\u0000${key}`;\n const entry =\n observations.get(id) ??\n {\n ref,\n key,\n counts: new Map<string, { value: string | number | boolean; count: number }>(),\n total: 0,\n };\n const valueId = valueKey(value);\n const existing = entry.counts.get(valueId);\n entry.counts.set(valueId, { value, count: (existing?.count ?? 0) + weight });\n entry.total += weight;\n observations.set(id, entry);\n };\n // Verbatim audit observations are the authoritative value corpus when\n // supplied: audits carry every argument, including the parameters the\n // trace projection drops. Without them the scan uses the projected trace\n // args.\n if (input.valueObservations) {\n for (const observation of input.valueObservations) {\n observeValue(observation.ref, observation.key, observation.value, observation.count ?? 1);\n }\n } else {\n for (const sourceTrace of input.traces) {\n for (const operation of sourceTrace.operations) {\n if (operation.ref.startsWith(\"fabric.\")) continue;\n for (const [key, value] of Object.entries(operation.args)) {\n if (typeof value !== \"string\" && typeof value !== \"number\" && typeof value !== \"boolean\") {\n continue;\n }\n observeValue(operation.ref, key, value);\n }\n }\n }\n }\n const eligibleCandidates = [...observations.values()]\n .filter((entry) => entry.total >= ENUM_MIN_OBSERVATIONS)\n .filter((entry) => entry.counts.size >= 2 && entry.counts.size <= ENUM_MAX_DISTINCT)\n .map((entry): EnumCandidate => {\n const ranked = [...entry.counts.values()].sort(\n (left, right) =>\n right.count - left.count || compareCodeUnits(valueKey(left.value), valueKey(right.value)),\n );\n return { entry, ranked, topShare: roundMetric(ranked[0]!.count / entry.total) };\n })\n .filter((candidate) => candidate.topShare >= ENUM_MIN_TOP_SHARE);\n const openCandidates = eligibleCandidates.filter((candidate) => {\n const target = schemaProperties(surfaceByRef.get(candidate.entry.ref))?.[candidate.entry.key];\n return isPlainRecord(target) && target.type !== \"boolean\" && !Array.isArray(target.enum) &&\n target[ENTROPY_ENUM_CANDIDATE_ANNOTATION] === true;\n });\n const byRefKey = (left: EnumCandidate, right: EnumCandidate): number =>\n compareCodeUnits(`${left.entry.ref}\\u0000${left.entry.key}`, `${right.entry.ref}\\u0000${right.entry.key}`);\n for (const candidate of openCandidates.sort(byRefKey).slice(0, MAX_PROPOSALS_PER_KIND)) {\n proposals.push({\n kind: \"declare-enum\",\n ref: candidate.entry.ref,\n key: candidate.entry.key,\n values: candidate.ranked.map((item) => item.value),\n calls: candidate.entry.total,\n distinct: candidate.entry.counts.size,\n topShare: candidate.topShare,\n });\n }\n\n // Repair rows are already guarded aliases from a spilled spelling to the\n // canonical schema. Their existence proves compatibility is useful, not\n // that the alias should replace the canonical name. They contribute to the\n // lexicon metric but never become surface rewrite proposals.\n\n // overload-split: one ref carrying two disjoint parameter key-sets is an\n // overloaded action; splitting removes the per-call either/or freedom.\n const overloadRefs = new Set(\n input.report.refs\n .filter((ref) => ref.shapeEntropyBits >= SPLIT_MIN_SHAPE_ENTROPY_BITS)\n .map((ref) => ref.ref),\n );\n if (overloadRefs.size > 0) {\n const keySets = new Map<string, Map<string, { keys: string[]; calls: number }>>();\n for (const sourceTrace of input.traces) {\n for (const operation of sourceTrace.operations) {\n if (!overloadRefs.has(operation.ref)) continue;\n const keys = Object.keys(operation.args).sort();\n const id = keys.join(\"\\u0000\");\n const perRef = keySets.get(operation.ref) ?? new Map<string, { keys: string[]; calls: number }>();\n const cluster = perRef.get(id) ?? { keys, calls: 0 };\n cluster.calls += 1;\n perRef.set(id, cluster);\n keySets.set(operation.ref, perRef);\n }\n }\n let overloadCount = 0;\n for (const [ref, perRef] of [...keySets.entries()].sort(([left], [right]) =>\n compareCodeUnits(left, right),\n )) {\n if (overloadCount >= MAX_PROPOSALS_PER_KIND) break;\n const clusters = [...perRef.values()]\n .filter((cluster) => cluster.calls >= SPLIT_MIN_CLUSTER_CALLS)\n .sort(\n (left, right) =>\n right.calls - left.calls || compareCodeUnits(left.keys.join(\",\"), right.keys.join(\",\")),\n );\n const disjoint: { keys: string[]; calls: number }[] = [];\n for (const cluster of clusters) {\n const keys = new Set(cluster.keys);\n if (disjoint.every((candidate) => candidate.keys.every((key) => !keys.has(key)))) {\n disjoint.push(cluster);\n }\n }\n if (disjoint.length >= 2) {\n overloadCount += 1;\n const report = calledRefs.get(ref);\n proposals.push({\n kind: \"overload-split\",\n ref,\n shapeEntropyBits: report?.shapeEntropyBits ?? 0,\n clusters: disjoint.slice(0, MAX_PROPOSALS_PER_KIND).map((cluster) => ({\n keys: cluster.keys,\n calls: cluster.calls,\n })),\n });\n }\n }\n }\n\n // sequence-fuse: only successful high-level action sequences repeated in\n // independent fabric_exec executions can imply a reusable composite. Pi\n // primitives are implementation steps (and should be batched instead),\n // while failed or ignored operations break contiguity rather than being\n // silently bridged. Every ref must be distinct and three executions must\n // agree before action names alone are strong enough to warrant review.\n const sequenceCounts = new Map<\n string,\n { sequence: string[]; occurrences: number; executions: Set<number> }\n >();\n const recordSequenceSegment = (refs: readonly string[], execution: number): void => {\n for (\n let length = FUSE_MIN_SEQUENCE_LENGTH;\n length <= Math.min(FUSE_MAX_SEQUENCE_LENGTH, refs.length);\n length++\n ) {\n for (let start = 0; start + length <= refs.length; start++) {\n const sequence = refs.slice(start, start + length);\n if (new Set(sequence).size !== sequence.length) continue;\n const id = sequence.join(\"\u2192\");\n const entry = sequenceCounts.get(id) ?? {\n sequence,\n occurrences: 0,\n executions: new Set<number>(),\n };\n entry.occurrences += 1;\n entry.executions.add(execution);\n sequenceCounts.set(id, entry);\n }\n }\n };\n input.traces.forEach((sourceTrace, execution) => {\n let segment: string[] = [];\n const flush = (): void => {\n recordSequenceSegment(segment, execution);\n segment = [];\n };\n for (const operation of sourceTrace.operations) {\n if (\n operation.outcome !== \"succeeded\" ||\n operation.ref.startsWith(\"fabric.\") ||\n operation.ref.startsWith(\"pi.\")\n ) {\n flush();\n } else {\n segment.push(operation.ref);\n }\n }\n flush();\n });\n const fuseCandidates = [...sequenceCounts.values()]\n .filter(\n (entry) =>\n entry.occurrences >= FUSE_MIN_OCCURRENCES &&\n entry.executions.size >= FUSE_MIN_EXECUTIONS,\n )\n .sort(\n (left, right) =>\n right.sequence.length - left.sequence.length ||\n right.occurrences - left.occurrences ||\n compareCodeUnits(left.sequence.join(\"\u2192\"), right.sequence.join(\"\u2192\")),\n );\n const selected: { sequence: string[]; occurrences: number }[] = [];\n for (const candidate of fuseCandidates) {\n if (selected.length >= MAX_PROPOSALS_PER_KIND) break;\n const redundant = selected.some(\n (chosen) =>\n contains(candidate.sequence, chosen.sequence) || contains(chosen.sequence, candidate.sequence),\n );\n if (redundant) continue;\n selected.push(candidate);\n }\n for (const candidate of selected) {\n proposals.push({\n kind: \"sequence-fuse\",\n sequence: candidate.sequence,\n occurrences: candidate.occurrences,\n });\n }\n\n return proposals;\n};\n\n// Compatibility normal forms live behind the registry. This API no longer\n// interprets legacy restriction proposals, even when explicitly supplied.\nexport const applyProposalsToSurface = (\n surface: EntropySurfaceSnapshot,\n _proposals: readonly EntropyProposal[],\n): EntropySurfaceSnapshot => surface;\n\n// The ratchet: a compiled surface must not increase the measured score and\n// must preserve every successful call. Monotonicity is measured, never\n// argued.\nexport const evaluateGate = (before: EntropyReport, after: EntropyReport): EntropyGateResult => {\n const reasons: string[] = [];\n if (after.score > before.score) {\n reasons.push(`score increased ${before.score} \u2192 ${after.score}`);\n }\n if (after.totals.succeeded < before.totals.succeeded) {\n reasons.push(\n `successful calls dropped ${before.totals.succeeded} \u2192 ${after.totals.succeeded}`,\n );\n }\n return {\n passed: reasons.length === 0,\n beforeScore: before.score,\n afterScore: after.score,\n delta: roundMetric(after.score - before.score),\n reasons,\n };\n};\n", "// Machine-wide value-observation pooling for the entropy compiler. The\n// session window stays small by design (gate-local, always fresh), but\n// sparse closed domains never reach the derivation thresholds inside one\n// window. The pool accumulates per-(ref, key, value) counts across every\n// window the compiler reads, with exact per-session deltas so a growing\n// session file is never counted twice and a rewritten one retracts its old\n// contribution before adding the new one. Bounded by construction: each\n// entry tracks at most POOL_TRACKED_VALUES distinct values (above the\n// derivation's ENUM_MAX_DISTINCT, so an overflowed domain stays provably\n// ineligible instead of silently re-qualifying after eviction),\n// POOL_TRACKED_SESSIONS files carry per-session counts for exact deltas,\n// and evicted sessions bake into the totals with their digest remembered\n// so the same evidence never merges twice.\n\nimport { createHash } from \"node:crypto\";\nimport { compareCodeUnits } from \"./fingerprint.js\";\nimport type { EntropyValueObservation } from \"./types.js\";\n\nexport const OBSERVATION_POOL_VERSION = 1 as const;\nexport const POOL_TRACKED_VALUES = 16;\nexport const POOL_TRACKED_SESSIONS = 16;\nexport const POOL_BAKED_DIGESTS = 512;\n\nexport interface EntropyPoolValueCount {\n value: string | number | boolean;\n count: number;\n}\n\nexport interface EntropyObservationPoolEntry {\n ref: string;\n key: string;\n values: EntropyPoolValueCount[];\n total: number;\n}\n\nexport interface EntropyPoolTrackedSession {\n file: string;\n digest: string;\n counts: Record<string, number>;\n}\n\nexport interface EntropyObservationPoolFile {\n version: typeof OBSERVATION_POOL_VERSION;\n entries: EntropyObservationPoolEntry[];\n tracked: EntropyPoolTrackedSession[];\n baked: string[];\n}\n\nexport interface EntropyObservationWindow {\n file: string;\n observations: readonly EntropyValueObservation[];\n}\n\nexport interface MergedObservationPool {\n file: EntropyObservationPoolFile;\n mergedSessions: number;\n skippedSessions: number;\n}\n\nconst SEPARATOR = \"\\u0000\";\n\n// Identity of one observation: ref, key, and the typed value, so `1`\n// (number) and \"1\" (string) stay distinct evidence.\nexport const observationIdentity = (\n observation: EntropyValueObservation,\n): string =>\n `${observation.ref}${SEPARATOR}${observation.key}${SEPARATOR}${typeof observation.value}:${String(observation.value)}`;\n\nconst entryValueKey = (value: string | number | boolean): string =>\n `${typeof value}:${String(value)}`;\n\nconst valueFromKey = (valueKey: string): string | number | boolean => {\n const separator = valueKey.indexOf(\":\");\n const type = valueKey.slice(0, separator);\n const raw = valueKey.slice(separator + 1);\n if (type === \"number\") return Number(raw);\n if (type === \"boolean\") return raw === \"true\";\n return raw;\n};\n\nconst parseIdentity = (identity: string): { ref: string; key: string; valueKey: string } => {\n const first = identity.indexOf(SEPARATOR);\n const second = identity.indexOf(SEPARATOR, first + 1);\n return {\n ref: identity.slice(0, first),\n key: identity.slice(first + 1, second),\n valueKey: identity.slice(second + 1),\n };\n};\n\nexport interface ObservationSummary {\n digest: string;\n counts: Record<string, number>;\n}\n\nconst digestFromIdentityCounts = (counts: Readonly<Record<string, number>>): string => {\n const hash = createHash(\"sha256\");\n hash.update(\"[\");\n let first = true;\n for (const [identity, count] of Object.entries(counts).sort(([left], [right]) =>\n compareCodeUnits(left, right),\n )) {\n const encoded = JSON.stringify(identity);\n const repeated = Array.from({ length: count }, () => encoded).join(\",\");\n hash.update(first ? repeated : `,${repeated}`);\n first = false;\n }\n hash.update(\"]\");\n return hash.digest(\"hex\");\n};\n\nconst summarizeObservations = (\n observations: readonly EntropyValueObservation[],\n): ObservationSummary => {\n const counts: Record<string, number> = {};\n const digestCounts: Record<string, number> = {};\n for (const observation of observations) {\n const identity = observationIdentity(observation);\n counts[identity] = (counts[identity] ?? 0) + (observation.count ?? 1);\n digestCounts[identity] = (digestCounts[identity] ?? 0) + 1;\n }\n return { counts, digest: digestFromIdentityCounts(digestCounts) };\n};\n\n// Digest of one window's observation multiset. The hash input is byte-for-byte\n// compatible with the former sorted identity array, but sorting distinct keys\n// avoids an O(n log n) sweep over every repeated observation.\nexport const observationWindowDigest = (\n observations: readonly EntropyValueObservation[],\n): string => summarizeObservations(observations).digest;\n\nconst COOPERATIVE_OBSERVATION_CHUNK = 256;\nconst COOPERATIVE_DIGEST_CHUNK = 512;\n\nconst yieldToLoop = (): Promise<void> =>\n new Promise((resolve) => setImmediate(resolve));\n\nconst digestFromIdentityCountsAsync = async (\n counts: Readonly<Record<string, number>>,\n): Promise<string> => {\n const hash = createHash(\"sha256\");\n hash.update(\"[\");\n let first = true;\n let processed = 0;\n for (const [identity, count] of Object.entries(counts).sort(([left], [right]) =>\n compareCodeUnits(left, right),\n )) {\n const encoded = JSON.stringify(identity);\n // Hash repeated identities in native string batches, not one JS array\n // element per historical observation. Preserve the v1 digest bytes.\n const batchSize = Math.max(1, Math.floor(32_768 / (encoded.length + 1)));\n for (let remaining = count; remaining > 0;) {\n const size = Math.min(remaining, batchSize, COOPERATIVE_DIGEST_CHUNK - processed);\n hash.update(`${first ? \"\" : \",\"}${encoded}${(`,${encoded}`).repeat(size - 1)}`);\n first = false;\n remaining -= size;\n processed += size;\n if (processed >= COOPERATIVE_DIGEST_CHUNK) {\n processed = 0;\n await yieldToLoop();\n }\n }\n }\n hash.update(\"]\");\n return hash.digest(\"hex\");\n};\n\nconst summarizeObservationsAsync = async (\n observations: readonly EntropyValueObservation[],\n): Promise<ObservationSummary> => {\n const counts: Record<string, number> = {};\n const digestCounts: Record<string, number> = {};\n for (let index = 0; index < observations.length; index += 1) {\n const observation = observations[index]!;\n const identity = observationIdentity(observation);\n counts[identity] = (counts[identity] ?? 0) + (observation.count ?? 1);\n digestCounts[identity] = (digestCounts[identity] ?? 0) + 1;\n if ((index + 1) % COOPERATIVE_OBSERVATION_CHUNK === 0) await yieldToLoop();\n }\n return { counts, digest: await digestFromIdentityCountsAsync(digestCounts) };\n};\n\ninterface WorkingEntry {\n ref: string;\n key: string;\n values: Map<string, { value: string | number | boolean; count: number }>;\n}\n\nconst workingFromPool = (\n pool: EntropyObservationPoolFile | undefined,\n): Map<string, WorkingEntry> => {\n const working = new Map<string, WorkingEntry>();\n if (!pool) return working;\n for (const entry of pool.entries) {\n const values = new Map<string, { value: string | number | boolean; count: number }>();\n for (const item of entry.values) {\n values.set(entryValueKey(item.value), { value: item.value, count: item.count });\n }\n working.set(`${entry.ref}${SEPARATOR}${entry.key}`, {\n ref: entry.ref,\n key: entry.key,\n values,\n });\n }\n return working;\n};\n\nconst applyEntryDelta = (\n working: Map<string, WorkingEntry>,\n identity: string,\n weight: number,\n): string => {\n const { ref, key, valueKey } = parseIdentity(identity);\n const entryId = `${ref}${SEPARATOR}${key}`;\n let entry = working.get(entryId);\n if (!entry) {\n entry = { ref, key, values: new Map() };\n working.set(entryId, entry);\n }\n const current = entry.values.get(valueKey);\n // A tracked session's snapshot can still hold values the cap already\n // evicted, so a retraction only removes what the entry still retains.\n const nextCount = (current?.count ?? 0) + weight;\n if (nextCount > 0) {\n entry.values.set(valueKey, {\n value: current?.value ?? valueFromKey(valueKey),\n count: nextCount,\n });\n } else {\n entry.values.delete(valueKey);\n }\n if (entry.values.size === 0) working.delete(entryId);\n return entryId;\n};\n\n// The tracked-value cap bounds the pool file. Eviction only ever touches\n// entries already past the derivation's distinct guard (16 tracked values\n// exceed the 8-value eligibility), so it can never flip an eligible\n// parameter ineligible, and an overflowed domain stays provably open.\nconst enforceValueCap = (entry: WorkingEntry): void => {\n while (entry.values.size > POOL_TRACKED_VALUES) {\n let evictKey: string | undefined;\n let evictCount = Number.POSITIVE_INFINITY;\n for (const [valueKey, item] of entry.values) {\n if (\n evictKey === undefined ||\n item.count < evictCount ||\n (item.count === evictCount && compareCodeUnits(valueKey, evictKey) > 0)\n ) {\n evictKey = valueKey;\n evictCount = item.count;\n }\n }\n if (evictKey === undefined) return;\n entry.values.delete(evictKey);\n }\n};\n\nconst serializePool = (\n working: Map<string, WorkingEntry>,\n tracked: EntropyPoolTrackedSession[],\n baked: string[],\n): EntropyObservationPoolFile => ({\n version: OBSERVATION_POOL_VERSION,\n entries: [...working.values()]\n .map((entry) => ({\n ref: entry.ref,\n key: entry.key,\n // Derived, never accumulated: the total always equals the retained\n // counts, whatever deltas and evictions the merge applied.\n total: [...entry.values.values()].reduce((sum, item) => sum + item.count, 0),\n values: [...entry.values.values()]\n .map((item) => ({ value: item.value, count: item.count }))\n .sort(\n (left, right) =>\n right.count - left.count ||\n compareCodeUnits(entryValueKey(left.value), entryValueKey(right.value)),\n ),\n }))\n .sort((left, right) =>\n compareCodeUnits(\n `${left.ref}${SEPARATOR}${left.key}`,\n `${right.ref}${SEPARATOR}${right.key}`,\n ),\n ),\n tracked,\n baked,\n});\n\nexport interface SummarizedObservationWindow {\n file: string;\n summary: ObservationSummary;\n}\n\nexport const mergeObservationSummaries = (\n pool: EntropyObservationPoolFile | undefined,\n windows: readonly SummarizedObservationWindow[],\n): MergedObservationPool => {\n const working = workingFromPool(pool);\n const tracked = [...(pool?.tracked ?? [])];\n const baked = [...(pool?.baked ?? [])];\n const bakedSet = new Set(baked);\n const trackedDigests = new Set(tracked.map((session) => session.digest));\n let mergedSessions = 0;\n let skippedSessions = 0;\n for (const window of windows) {\n const { digest, counts: fresh } = window.summary;\n if (bakedSet.has(digest) || trackedDigests.has(digest)) {\n skippedSessions += 1;\n continue;\n }\n const existingIndex = tracked.findIndex((session) => session.file === window.file);\n const existing = existingIndex >= 0 ? tracked[existingIndex] : undefined;\n const delta: Record<string, number> = { ...fresh };\n if (existing) {\n for (const [identity, count] of Object.entries(existing.counts)) {\n delta[identity] = (delta[identity] ?? 0) - count;\n }\n }\n const touched = new Set<string>();\n for (const [identity, weight] of Object.entries(delta)) {\n if (weight === 0) continue;\n touched.add(applyEntryDelta(working, identity, weight));\n }\n for (const entryId of touched) {\n const entry = working.get(entryId);\n if (entry) enforceValueCap(entry);\n }\n const trackedSession = { file: window.file, digest, counts: { ...fresh } };\n if (existing) {\n tracked[existingIndex] = trackedSession;\n } else {\n tracked.push(trackedSession);\n if (tracked.length > POOL_TRACKED_SESSIONS) {\n const oldest = tracked.shift()!;\n if (!bakedSet.has(oldest.digest)) {\n baked.push(oldest.digest);\n bakedSet.add(oldest.digest);\n while (baked.length > POOL_BAKED_DIGESTS) {\n bakedSet.delete(baked.shift()!);\n }\n }\n }\n }\n trackedDigests.add(digest);\n mergedSessions += 1;\n }\n return {\n file: serializePool(working, tracked, baked),\n mergedSessions,\n skippedSessions,\n };\n};\n\n// Merge one session-window scan into the pool. A session contributes exactly\n// once per content. The async form performs the expensive observation summary\n// in deterministic chunks for extension hooks; the pure form remains the\n// certification API.\nexport const mergeObservationWindow = (\n pool: EntropyObservationPoolFile | undefined,\n windows: readonly EntropyObservationWindow[],\n): MergedObservationPool => mergeObservationSummaries(\n pool,\n windows.map((window) => ({\n file: window.file,\n summary: summarizeObservations(window.observations),\n })),\n);\n\n// The cache keeps only the ends of the array it summarized, not the array.\n// Session snapshots are immutable and an appended snapshot reuses the earlier\n// observation objects, so the ends identify the summarized prefix. Holding the\n// arrays here would pin every session's observations after the session reader\n// has evicted them.\ninterface CachedObservationWindow {\n length: number;\n first: EntropyValueObservation | undefined;\n last: EntropyValueObservation | undefined;\n counts: Record<string, number>;\n digestCounts: Record<string, number>;\n summary: ObservationSummary;\n}\n\nconst extendsSummarized = (\n cached: CachedObservationWindow,\n observations: readonly EntropyValueObservation[],\n): boolean =>\n cached.length <= observations.length &&\n (cached.length === 0 ||\n (observations[0] === cached.first && observations[cached.length - 1] === cached.last));\n\n/** For immutable session-reader snapshots only; ordinary public merges stay pure. */\nexport class SessionObservationCache {\n readonly #windows = new Map<string, CachedObservationWindow>();\n\n async merge(\n pool: EntropyObservationPoolFile | undefined,\n windows: readonly EntropyObservationWindow[],\n ): Promise<MergedObservationPool> {\n return mergeObservationSummaries(pool, await this.summarize(windows));\n }\n\n /** Per-window summaries, reusing unchanged and appended windows by identity. */\n async summarize(windows: readonly EntropyObservationWindow[]): Promise<SummarizedObservationWindow[]> {\n const summarized: SummarizedObservationWindow[] = [];\n for (const window of windows) {\n let cached = this.#windows.get(window.file);\n const append = cached !== undefined && extendsSummarized(cached, window.observations);\n if (!append || cached!.length !== window.observations.length) {\n const counts = append ? { ...cached!.counts } : {};\n const digestCounts = append ? { ...cached!.digestCounts } : {};\n const start = append ? cached!.length : 0;\n for (let index = start; index < window.observations.length; index++) {\n const observation = window.observations[index]!;\n const identity = observationIdentity(observation);\n counts[identity] = (counts[identity] ?? 0) + (observation.count ?? 1);\n digestCounts[identity] = (digestCounts[identity] ?? 0) + 1;\n if ((index + 1) % COOPERATIVE_OBSERVATION_CHUNK === 0) await yieldToLoop();\n }\n const digest = await digestFromIdentityCountsAsync(digestCounts);\n cached = {\n length: window.observations.length,\n first: window.observations[0],\n last: window.observations.at(-1),\n counts,\n digestCounts,\n summary: { counts, digest },\n };\n }\n this.#windows.delete(window.file);\n this.#windows.set(window.file, cached!);\n while (this.#windows.size > 16) this.#windows.delete(this.#windows.keys().next().value!);\n summarized.push({ file: window.file, summary: cached!.summary });\n await yieldToLoop();\n }\n return summarized;\n }\n}\n\nexport const mergeObservationWindowAsync = async (\n pool: EntropyObservationPoolFile | undefined,\n windows: readonly EntropyObservationWindow[],\n): Promise<MergedObservationPool> => {\n const summarized: SummarizedObservationWindow[] = [];\n for (const window of windows) {\n summarized.push({\n file: window.file,\n summary: await summarizeObservationsAsync(window.observations),\n });\n }\n await yieldToLoop();\n return mergeObservationSummaries(pool, summarized);\n};\n\n// Expand the pool into the flat value-observation corpus the derivation\n// consumes. Counts travel as multiplicity, so pooled evidence costs one\n// observation per distinct value instead of one per recorded call.\nexport const poolToValueObservations = (\n pool: EntropyObservationPoolFile | undefined,\n): EntropyValueObservation[] => {\n if (!pool) return [];\n const observations: EntropyValueObservation[] = [];\n for (const entry of pool.entries) {\n for (const item of entry.values) {\n observations.push({ ref: entry.ref, key: entry.key, value: item.value, count: item.count });\n }\n }\n return observations;\n};\n", "// Persistence for the machine-wide observation pool: <agent\n// dir>/fabric/entropy/observation-pool.json, locked across Pi processes\n// sharing the agent directory. A damaged pool surfaces as an error and\n// blocks merges from overwriting it, the same discipline as the compiled\n// surface. The pool is pure derived evidence (session audits are the\n// source of truth), so it never gates enforcement, only thresholds.\n\nimport fs from \"node:fs\";\nimport path from \"node:path\";\nimport { writeFileAtomicAsync, writeJsonAtomic } from \"../core/atomic-write.js\";\nimport { withExclusiveFileLock, withExclusiveFileLockAsync } from \"../core/file-lock.js\";\nimport {\n OBSERVATION_POOL_VERSION,\n SessionObservationCache,\n mergeObservationSummaries,\n type SummarizedObservationWindow,\n type EntropyObservationWindow,\n type EntropyObservationPoolEntry,\n type EntropyObservationPoolFile,\n type EntropyPoolTrackedSession,\n type EntropyPoolValueCount,\n} from \"./pool.js\";\n\nconst POOL_LOCK_ATTEMPTS = 50;\nconst POOL_LOCK_DELAY_MS = 5;\nconst POOL_STALE_LOCK_MS = 30_000;\n\n// Parse bounds: generous over the merge's own caps so a future cap change\n// never bricks an existing pool, tight enough that a damaged file cannot\n// claim unbounded memory.\nconst POOL_MAX_ENTRIES = 8_192;\nconst POOL_MAX_VALUES_PER_ENTRY = 64;\nconst POOL_MAX_TRACKED = 64;\nconst POOL_MAX_BAKED = 2_048;\n\nexport const observationPoolDirectory = (agentDir: string): string =>\n path.join(agentDir, \"fabric\", \"entropy\");\n\nconst poolPath = (directory: string): string => path.join(directory, \"observation-pool.json\");\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === \"object\" && value !== null && !Array.isArray(value);\n\nconst errorCode = (error: unknown): string | undefined =>\n isRecord(error) && typeof error.code === \"string\" ? error.code : undefined;\n\nconst errorText = (error: unknown): string =>\n (error instanceof Error ? error.message : String(error)).slice(0, 200);\n\nconst isPrimitive = (value: unknown): value is string | number | boolean =>\n typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\";\n\nconst parseValueCount = (value: unknown): EntropyPoolValueCount | undefined => {\n if (!isRecord(value) || !isPrimitive(value.value)) return undefined;\n if (!Number.isSafeInteger(value.count) || (value.count as number) < 1) return undefined;\n return { value: value.value, count: value.count as number };\n};\n\nconst parseEntry = (value: unknown): EntropyObservationPoolEntry | undefined => {\n if (!isRecord(value) || typeof value.ref !== \"string\" || !value.ref.trim()) return undefined;\n if (typeof value.key !== \"string\" || !value.key.trim()) return undefined;\n // The total is a derived aggregate, recomputed below from the retained\n // counts. Earlier releases could persist a negative or short total\n // after value eviction (#273), so a stale total must not brick the pool.\n if (!Number.isSafeInteger(value.total)) return undefined;\n if (!Array.isArray(value.values) || value.values.length > POOL_MAX_VALUES_PER_ENTRY) {\n return undefined;\n }\n const values: EntropyPoolValueCount[] = [];\n for (const item of value.values) {\n const parsed = parseValueCount(item);\n if (!parsed) return undefined;\n values.push(parsed);\n }\n const seen = new Set<string>();\n for (const item of values) {\n const key = `${typeof item.value}:${String(item.value)}`;\n if (seen.has(key)) return undefined;\n seen.add(key);\n }\n const total = values.reduce((sum, item) => sum + item.count, 0);\n return { ref: value.ref.trim(), key: value.key.trim(), total, values };\n};\n\nconst parseTrackedSession = (value: unknown): EntropyPoolTrackedSession | undefined => {\n if (!isRecord(value) || typeof value.file !== \"string\" || !value.file.trim()) return undefined;\n if (typeof value.digest !== \"string\" || !value.digest.trim()) return undefined;\n if (!isRecord(value.counts)) return undefined;\n const counts: Record<string, number> = {};\n for (const [identity, count] of Object.entries(value.counts)) {\n if (!Number.isSafeInteger(count) || (count as number) < 1) return undefined;\n counts[identity] = count as number;\n }\n return { file: value.file.trim(), digest: value.digest.trim(), counts };\n};\n\nconst parsePoolFile = (value: unknown): EntropyObservationPoolFile | undefined => {\n if (!isRecord(value) || value.version !== OBSERVATION_POOL_VERSION) return undefined;\n if (!Array.isArray(value.entries) || value.entries.length > POOL_MAX_ENTRIES) return undefined;\n if (!Array.isArray(value.tracked) || value.tracked.length > POOL_MAX_TRACKED) return undefined;\n if (!Array.isArray(value.baked) || value.baked.length > POOL_MAX_BAKED) return undefined;\n if (!value.baked.every((digest) => typeof digest === \"string\" && digest.trim())) {\n return undefined;\n }\n const entries: EntropyObservationPoolEntry[] = []\n for (const entry of value.entries) {\n const parsed = parseEntry(entry);\n if (!parsed) return undefined;\n entries.push(parsed);\n }\n const tracked: EntropyPoolTrackedSession[] = [];\n const trackedFiles = new Set<string>();\n for (const session of value.tracked) {\n const parsed = parseTrackedSession(session);\n if (!parsed) return undefined;\n if (trackedFiles.has(parsed.file)) return undefined;\n trackedFiles.add(parsed.file);\n tracked.push(parsed);\n }\n const entrySeen = new Set<string>();\n for (const entry of entries) {\n const id = `${entry.ref}\\u0000${entry.key}`;\n if (entrySeen.has(id)) return undefined;\n entrySeen.add(id);\n }\n return {\n version: OBSERVATION_POOL_VERSION,\n entries,\n tracked,\n baked: value.baked.map((digest) => (digest as string).trim()),\n };\n};\n\nexport interface LoadedObservationPool {\n file?: EntropyObservationPoolFile;\n error?: string;\n}\n\nexport const loadObservationPool = (agentDir: string): LoadedObservationPool => {\n const file = poolPath(observationPoolDirectory(agentDir));\n let raw: string;\n try {\n raw = fs.readFileSync(file, \"utf8\");\n } catch (error) {\n // A missing pool means evidence simply starts accumulating now.\n if (errorCode(error) === \"ENOENT\") return {};\n return { error: `observation pool is unreadable: ${errorText(error)}` };\n }\n let parsed: unknown;\n try {\n parsed = JSON.parse(raw);\n } catch {\n return { error: \"observation pool is malformed JSON\" };\n }\n const parsedFile = parsePoolFile(parsed);\n if (!parsedFile) return { error: \"observation pool is invalid\" };\n return { file: parsedFile };\n};\n\n// The pool text as read, so a locked rewrite can compare against it without\n// reading the whole file a second time.\nconst readObservationPoolAsync = async (\n agentDir: string,\n): Promise<LoadedObservationPool & { raw?: string }> => {\n const file = poolPath(observationPoolDirectory(agentDir));\n let raw: string;\n try {\n raw = await fs.promises.readFile(file, \"utf8\");\n } catch (error) {\n if (errorCode(error) === \"ENOENT\") return {};\n return { error: `observation pool is unreadable: ${errorText(error)}` };\n }\n let parsed: unknown;\n try {\n parsed = JSON.parse(raw);\n } catch {\n return { error: \"observation pool is malformed JSON\" };\n }\n const parsedFile = parsePoolFile(parsed);\n return parsedFile ? { file: parsedFile, raw } : { error: \"observation pool is invalid\" };\n};\n\nexport const loadObservationPoolAsync = async (\n agentDir: string,\n): Promise<LoadedObservationPool> => {\n const { raw: _raw, ...loaded } = await readObservationPoolAsync(agentDir);\n return loaded;\n};\n\nexport interface SavedObservationPool {\n file: EntropyObservationPoolFile;\n written: boolean;\n}\n\nexport const saveObservationPool = (\n agentDir: string,\n file: EntropyObservationPoolFile,\n): SavedObservationPool =>\n withExclusiveFileLock(\n {\n directory: observationPoolDirectory(agentDir),\n lockName: \"observation-pool.lock\",\n timeoutMessage: \"Timed out waiting for the observation pool lock\",\n attempts: POOL_LOCK_ATTEMPTS,\n delayMs: POOL_LOCK_DELAY_MS,\n staleMs: POOL_STALE_LOCK_MS,\n },\n () => {\n // A damaged pool must never be silently rebuilt; fail so the tick\n // records the skip and leaves the file for recovery.\n const loaded = loadObservationPool(agentDir);\n if (loaded.error) throw new Error(loaded.error);\n const target = poolPath(observationPoolDirectory(agentDir));\n const serialized = `${JSON.stringify(file, null, 2)}\\n`;\n try {\n if (fs.readFileSync(target, \"utf8\") === serialized) return { file, written: false };\n } catch {\n // Missing file: proceed to write.\n }\n writeJsonAtomic(target, file, { space: 2, newline: true, mode: 0o600, dirMode: 0o700 });\n return { file, written: true };\n },\n );\n\n// `current` is the pool text read under the same lock, when the caller has it.\nconst writeObservationPoolAsync = async (\n agentDir: string,\n file: EntropyObservationPoolFile,\n current?: string,\n): Promise<SavedObservationPool> => {\n const target = poolPath(observationPoolDirectory(agentDir));\n const serialized = `${JSON.stringify(file, null, 2)}\\n`;\n if (current !== undefined) {\n if (current === serialized) return { file, written: false };\n } else {\n try {\n if (await fs.promises.readFile(target, \"utf8\") === serialized) {\n return { file, written: false };\n }\n } catch (error) {\n if (errorCode(error) !== \"ENOENT\") throw error;\n }\n }\n // Write the bytes just compared: the pool can be tens of megabytes, and a\n // second serialization doubled the time this update held the thread.\n await writeFileAtomicAsync(target, serialized, { mode: 0o600, dirMode: 0o700 });\n return { file, written: true };\n};\n\n/**\n * The locked half of an update: rebase per-window summaries on the latest\n * pool, read inside the lock so writes from other Pi processes survive. This\n * is the part that parses, merges and rewrites the whole machine-wide pool,\n * so the extension runs it on a worker thread (pool-writer.ts).\n */\nexport const updateObservationPoolFromSummariesAsync = async (\n agentDir: string,\n summarized: readonly SummarizedObservationWindow[],\n): Promise<SavedObservationPool> =>\n withExclusiveFileLockAsync(\n {\n directory: observationPoolDirectory(agentDir),\n lockName: \"observation-pool.lock\",\n timeoutMessage: \"Timed out waiting for the observation pool lock\",\n attempts: 2,\n delayMs: POOL_LOCK_DELAY_MS,\n staleMs: POOL_STALE_LOCK_MS,\n },\n async () => {\n const loaded = await readObservationPoolAsync(agentDir);\n if (loaded.error) throw new Error(loaded.error);\n const merged = mergeObservationSummaries(loaded.file, summarized);\n if (loaded.file && merged.mergedSessions === 0) {\n return { file: loaded.file, written: false };\n }\n return writeObservationPoolAsync(agentDir, merged.file, loaded.raw);\n },\n );\n\n/** Rebase observations on the latest pool while holding the cross-process lock. */\nexport const updateObservationPoolAsync = async (\n agentDir: string,\n windows: readonly EntropyObservationWindow[],\n cache = new SessionObservationCache(),\n): Promise<SavedObservationPool> =>\n // Summarize expensive windows outside the critical section; the cache\n // reuses unchanged and appended windows across turns.\n updateObservationPoolFromSummariesAsync(agentDir, await cache.summarize(windows));\n\nexport const saveObservationPoolAsync = async (\n agentDir: string,\n file: EntropyObservationPoolFile,\n): Promise<SavedObservationPool> =>\n withExclusiveFileLockAsync(\n {\n directory: observationPoolDirectory(agentDir),\n lockName: \"observation-pool.lock\",\n timeoutMessage: \"Timed out waiting for the observation pool lock\",\n attempts: POOL_LOCK_ATTEMPTS,\n delayMs: POOL_LOCK_DELAY_MS,\n staleMs: POOL_STALE_LOCK_MS,\n },\n async () => {\n const loaded = await loadObservationPoolAsync(agentDir);\n if (loaded.error) throw new Error(loaded.error);\n return writeObservationPoolAsync(agentDir, file);\n },\n );\n", "import fs from \"node:fs\";\nimport { fileURLToPath } from \"node:url\";\nimport { Worker } from \"node:worker_threads\";\nimport { FileLockTimeoutError } from \"../core/file-lock.js\";\nimport type { EntropyObservationWindow, SessionObservationCache } from \"./pool.js\";\nimport { updateObservationPoolAsync } from \"./pool-store.js\";\nimport {\n OBSERVATION_POOL_WORKER_ROLE,\n type ObservationPoolWorkerReply,\n type ObservationPoolWorkerRequest,\n} from \"./pool-worker.js\";\n\nconst IDLE_MS = 30_000;\n\ninterface Pending {\n id: number;\n resolve(value: { written: boolean }): void;\n reject(error: Error): void;\n}\n\nconst replyError = (error: { name: string; message: string }): Error => {\n // Contention stays retryable across the thread boundary.\n if (error.name === \"FileLockTimeoutError\") return new FileLockTimeoutError(error.message);\n const rebuilt = new Error(error.message);\n rebuilt.name = error.name;\n return rebuilt;\n};\n\n/**\n * Persists observation-pool updates on a worker thread, one at a time. This\n * thread summarizes the windows (cooperatively, reusing the cache); the\n * worker parses, merges and rewrites the pool. The thread starts at the\n * first update, is released after it, and exits once idle. Without a built\n * worker entry (source checkouts), or when a worker fails before replying,\n * the update runs in this thread instead: the pool is advisory evidence and\n * every update is an idempotent rebase under the cross-process lock.\n */\nexport class ObservationPoolWriter {\n #worker: Worker | undefined;\n #pending: Pending | undefined;\n #nextId = 0;\n #replies = 0;\n #inProcess = false;\n #idle: NodeJS.Timeout | undefined;\n #queue: Promise<unknown> = Promise.resolve();\n\n constructor(\n // The built lazy entropy entry; see pool-worker.ts.\n readonly workerUrl: URL = new URL(\"../entropy/index.js\", import.meta.url),\n readonly idleMs = IDLE_MS,\n ) {}\n\n /** True while updates run in this thread because the worker is unavailable. */\n get inProcess(): boolean {\n return this.#inProcess;\n }\n\n update(\n agentDir: string,\n windows: readonly EntropyObservationWindow[],\n cache: SessionObservationCache,\n ): Promise<{ written: boolean }> {\n const run = this.#queue.then(() => this.#update(agentDir, windows, cache));\n this.#queue = run.catch(() => undefined);\n return run;\n }\n\n async close(): Promise<void> {\n if (this.#idle) clearTimeout(this.#idle);\n this.#idle = undefined;\n const worker = this.#worker;\n this.#worker = undefined;\n await worker?.terminate();\n }\n\n async #update(\n agentDir: string,\n windows: readonly EntropyObservationWindow[],\n cache: SessionObservationCache,\n ): Promise<{ written: boolean }> {\n const local = async () => ({ written: (await updateObservationPoolAsync(agentDir, windows, cache)).written });\n if (this.#inProcess) return local();\n let worker: Worker;\n try {\n if (!this.#worker && this.workerUrl.protocol === \"file:\" && !fs.existsSync(fileURLToPath(this.workerUrl))) {\n throw new Error(\"No built observation pool worker entry\");\n }\n worker = this.#start();\n } catch {\n this.#inProcess = true;\n return local();\n }\n const summaries = await cache.summarize(windows);\n if (this.#idle) clearTimeout(this.#idle);\n this.#idle = undefined;\n worker.ref();\n try {\n return await new Promise<{ written: boolean }>((resolve, reject) => {\n const id = ++this.#nextId;\n this.#pending = { id, resolve, reject };\n worker.postMessage({ id, agentDir, summaries } satisfies ObservationPoolWorkerRequest);\n });\n } catch (error) {\n if (!(error instanceof WorkerFailure)) throw error;\n // A worker that never answered cannot run here (no built entry, or no\n // worker support); stay in this thread. A later failure only respawns.\n if (this.#replies === 0) this.#inProcess = true;\n return local();\n } finally {\n this.#pending = undefined;\n if (this.#worker === worker) {\n worker.unref();\n this.#idle = setTimeout(() => void this.close(), this.idleMs);\n this.#idle.unref();\n }\n }\n }\n\n #start(): Worker {\n if (this.#worker) return this.#worker;\n const worker = new Worker(this.workerUrl, {\n workerData: { role: OBSERVATION_POOL_WORKER_ROLE },\n // Eval/stdin-only flags are invalid when Node starts this compiled module file.\n execArgv: process.execArgv.filter((value, index, args) =>\n value !== \"--input-type\" && args[index - 1] !== \"--input-type\" && !value.startsWith(\"--input-type=\")),\n });\n worker.unref();\n this.#worker = worker;\n const fail = (error: Error): void => {\n if (this.#worker !== worker) return;\n this.#worker = undefined;\n void worker.terminate();\n this.#pending?.reject(new WorkerFailure(error.message));\n };\n worker.on(\"message\", (reply: ObservationPoolWorkerReply) => {\n const pending = this.#pending;\n if (this.#worker !== worker || !pending || reply?.id !== pending.id) return;\n this.#replies++;\n if (\"error\" in reply) pending.reject(replyError(reply.error));\n else pending.resolve({ written: reply.written === true });\n });\n worker.once(\"error\", fail);\n worker.once(\"exit\", (code) => fail(new Error(`Observation pool worker exited (code ${code})`)));\n return worker;\n }\n}\n\nclass WorkerFailure extends Error {\n override name = \"ObservationPoolWorkerFailure\";\n}\n", "// Worker thread for the machine-wide observation pool. The pool is shared by\n// every Pi session under one agent directory and grows to tens of megabytes;\n// parsing, merging and rewriting it after each fabric_exec turn held Pi's\n// interactive thread for hundreds of milliseconds. Only per-window summaries\n// cross into this thread, and only a written flag comes back.\n//\n// The thread runs the existing lazy entropy entry (entropy/index.js) rather\n// than an entry of its own: a separate entry sharing the atomic-write and\n// lock modules split a new chunk into the eager startup graph. The listener\n// starts only in a worker that carries this role.\nimport { isMainThread, parentPort, workerData } from \"node:worker_threads\";\nimport { updateObservationPoolFromSummariesAsync } from \"./pool-store.js\";\nimport type { SummarizedObservationWindow } from \"./pool.js\";\n\nexport const OBSERVATION_POOL_WORKER_ROLE = \"pi-fabric:observation-pool\";\n\nexport interface ObservationPoolWorkerRequest {\n id: number;\n agentDir: string;\n summaries: SummarizedObservationWindow[];\n}\n\nexport type ObservationPoolWorkerReply =\n | { id: number; written: boolean }\n | { id: number; error: { name: string; message: string } };\n\nconst port = parentPort;\nif (!isMainThread && port &&\n (workerData as { role?: unknown } | null | undefined)?.role === OBSERVATION_POOL_WORKER_ROLE) {\n // Requests arrive one at a time: the writer awaits each reply first.\n port.on(\"message\", (request: ObservationPoolWorkerRequest) => {\n void updateObservationPoolFromSummariesAsync(request.agentDir, request.summaries).then(\n (saved) => port.postMessage({ id: request.id, written: saved.written } satisfies ObservationPoolWorkerReply),\n (error: unknown) => port.postMessage({\n id: request.id,\n error: {\n name: error instanceof Error ? error.name : \"Error\",\n message: error instanceof Error ? error.message : String(error),\n },\n } satisfies ObservationPoolWorkerReply),\n );\n });\n}\n", "// Live surface snapshots for the entropy meter. Discovery is Fabric's\n// authorization-free read path (read-only, no approval budget, no side\n// effects): providers answer `list` from static descriptors, in-memory\n// catalogs, or the MCP descriptor cache, so a minimal synthetic invocation\n// context is safe for command-time surface listing.\n\nimport type { ExtensionContext } from \"@earendil-works/pi-coding-agent\";\nimport type { FabricInvocationContext } from \"../protocol.js\";\nimport { stableJsonHash } from \"../core/stable-hash.js\";\nimport { compareCodeUnits, roundMetric, staticFreedomFromSchema } from \"./fingerprint.js\";\nimport type { EntropySurfaceSnapshot } from \"./types.js\";\n\nconst SURFACE_LIST_LIMIT = 1_000;\n\nexport interface EntropySurfaceListAction {\n ref: string;\n inputSchema: unknown;\n}\n\nexport interface EntropySurfaceRegistry {\n list(\n request: { limit?: number; declared?: boolean },\n context: FabricInvocationContext,\n ): Promise<readonly EntropySurfaceListAction[]>;\n}\n\nconst surfaceInvocationContext = (input: {\n extensionContext: ExtensionContext;\n cwd: string;\n}): FabricInvocationContext => ({\n cwd: input.cwd,\n signal: undefined,\n parentToolCallId: \"fabric-entropy-surface\",\n nestedToolCallId: \"fabric-entropy-surface\",\n extensionContext: input.extensionContext,\n update: () => {},\n});\n\n// Snapshot the live action surface (ref + input schema per action) through\n// the registry's discovery path. Sorted by ref so the snapshot hashes and\n// diffs deterministically.\nexport const liveSurfaceSnapshot = async (input: {\n registry: EntropySurfaceRegistry;\n extensionContext: ExtensionContext;\n cwd: string;\n}): Promise<EntropySurfaceSnapshot> => {\n // Snapshot the declaration, which remains the public capability contract.\n // Normal forms live behind it and never remove actions or enum members.\n const actions = await input.registry.list(\n { limit: SURFACE_LIST_LIMIT, declared: true },\n surfaceInvocationContext(input),\n );\n return {\n version: 1,\n actions: actions\n .map((action) => ({ ref: action.ref, inputSchema: action.inputSchema }))\n .sort((left, right) => compareCodeUnits(left.ref, right.ref)),\n };\n};\n\nexport const entropySurfaceHash = (surface: EntropySurfaceSnapshot): string =>\n stableJsonHash(surface);\n\nexport interface EntropySurfaceFreedomEntry {\n ref: string;\n freedom: number;\n}\n\nexport interface EntropySurfaceFreedomReport {\n actions: EntropySurfaceFreedomEntry[];\n total: number;\n mean: number;\n}\n\n// Static freedom of a whole surface: per-action scores sorted worst-first,\n// with the total and mean the ratchet tracks. Computable with no corpus at\n// all, which is what lets a candidate surface be scored before any session\n// runs against it.\nexport const surfaceFreedomReport = (\n surface: EntropySurfaceSnapshot,\n): EntropySurfaceFreedomReport => {\n const actions = surface.actions\n .map((action) => ({ ref: action.ref, freedom: staticFreedomFromSchema(action.inputSchema) }))\n .sort((left, right) => right.freedom - left.freedom || compareCodeUnits(left.ref, right.ref));\n const total = roundMetric(actions.reduce((sum, entry) => sum + entry.freedom, 0));\n return {\n actions,\n total,\n mean: actions.length > 0 ? roundMetric(total / actions.length) : 0,\n };\n};\n", "// Static normal-form compilation. Observations diagnose friction but cannot\n// authorize capability loss. Rule derivation preserves the declared surface\n// for every input, rather than only preserving a retained replay window.\nimport { stableJsonHash } from \"../core/stable-hash.js\";\nimport { measureEntropy, measureEntropyAsync, SessionEntropyMeter, type EntropyTraceWindow } from \"./meter.js\";\nimport { proposeEntropyReductions, type EntropyProposalInput } from \"./passes.js\";\nimport {\n COMPILED_SURFACE_VERSION, MAX_COMPILED_SURFACE_PROPOSALS,\n emptyCompiledSurface, type CompiledSurfaceFile,\n} from \"./compiled-surface.js\";\nimport { deriveNormalFormPlan, MAX_NORMAL_FORM_PLANS, type NormalFormPlan } from \"./normal-form.js\";\nimport { entropySurfaceHash } from \"./surface.js\";\nimport type {\n EntropyAuditCall, EntropyGateResult, EntropyProposal, EntropyRepairRowInput,\n EntropyReport, EntropySurfaceSnapshot, EntropyTraceInput, EntropyValueObservation,\n} from \"./types.js\";\n\nexport const AUTO_APPLY_PROPOSAL_KINDS: readonly string[] = [\"normal-form\"];\nexport const entropyReviewSignals = (input: EntropyProposalInput): EntropyProposal[] =>\n proposeEntropyReductions(input).filter((proposal) =>\n [\"declare-enum\", \"overload-split\", \"sequence-fuse\"].includes(proposal.kind));\nexport const formatEntropyReviewSignal = (proposal: EntropyProposal): string => {\n if (proposal.kind === \"declare-enum\") {\n const values = proposal.values.slice(0, 4).map(String).join(\", \");\n return `declare-enum ${proposal.ref}.${proposal.key} (${values}${proposal.values.length > 4 ? \", ...\" : \"\"})`;\n }\n if (proposal.kind === \"overload-split\") return `overload-split ${proposal.ref} (${proposal.clusters.length} key-set clusters)`;\n if (proposal.kind === \"sequence-fuse\") return `sequence-fuse ${proposal.sequence.join(\" -> \")}`;\n return `${proposal.kind} ${proposal.ref}`;\n};\nexport interface CompileEntropyInput {\n traces: readonly EntropyTraceInput[];\n surface: EntropySurfaceSnapshot;\n repairs?: readonly EntropyRepairRowInput[];\n valueObservations?: readonly EntropyValueObservation[];\n auditCalls?: readonly EntropyAuditCall[];\n artifact?: CompiledSurfaceFile;\n catalogDigest?: string;\n}\nexport type CompileEntropyStatus = \"compiled\" | \"converged\" | \"rejected\";\nexport interface CompileEntropyOutcome {\n status: CompileEntropyStatus;\n artifact?: CompiledSurfaceFile;\n report: EntropyReport;\n after?: EntropyReport;\n proposals: EntropyProposal[];\n gate?: EntropyGateResult;\n}\nconst sortedActions = (surface: EntropySurfaceSnapshot) =>\n [...surface.actions].sort((a, b) => a.ref < b.ref ? -1 : a.ref > b.ref ? 1 : 0);\nconst finishCompile = (input: CompileEntropyInput, report: EntropyReport, plans: NormalFormPlan[], reviewSignals = true): CompileEntropyOutcome => {\n const review = reviewSignals ? entropyReviewSignals({ ...input, report }) : [];\n const previous = input.artifact;\n const current = previous?.version === COMPILED_SURFACE_VERSION &&\n previous.actions.length === 0 && previous.quarantined.length === 0 &&\n stableJsonHash(previous.normalizations ?? []) === stableJsonHash(plans);\n if (current || (!previous && plans.length === 0)) {\n return { status: \"converged\", ...(previous ? { artifact: previous } : {}), report, proposals: review };\n }\n const proposals: EntropyProposal[] = plans.map((plan) => ({\n kind: \"normal-form\", ref: plan.ref, baseSchemaDigest: plan.baseSchemaDigest, rules: plan.rules,\n }));\n // Historical outcomes are not rewritten into counterfactual successes.\n // A static proof preserves capability; future witness counts measure use.\n const gate: EntropyGateResult = { passed: true, beforeScore: report.score, afterScore: report.score, delta: 0, reasons: [] };\n const artifact: CompiledSurfaceFile = {\n ...emptyCompiledSurface(), normalizations: plans,\n applied: plans.slice(0, MAX_COMPILED_SURFACE_PROPOSALS).map((plan) => ({ kind: \"normal-form\", ref: plan.ref, detail: `${plan.rules.length} proven rules` })),\n gate: { passed: true, beforeScore: report.score, afterScore: report.score, reasons: [] },\n evidenceDigest: stableJsonHash({ surface: entropySurfaceHash(input.surface), plans }),\n };\n return { status: \"compiled\", artifact, report, after: report, proposals: [...proposals, ...review], gate };\n};\n/** Per-session compiler: cache exact schema plans and incrementally meter immutable evidence. */\nexport class BackgroundEntropyCompiler {\n readonly #meter = new SessionEntropyMeter();\n #plans: { digest: string; plans: NormalFormPlan[] } | undefined;\n\n async compile(input: Omit<CompileEntropyInput, \"traces\" | \"valueObservations\" | \"auditCalls\"> & {\n windows: readonly EntropyTraceWindow[];\n }): Promise<CompileEntropyOutcome> {\n const digest = entropySurfaceHash(input.surface);\n if (this.#plans?.digest !== digest) {\n const plans: NormalFormPlan[] = [];\n let processed = 0;\n for (const action of sortedActions(input.surface)) {\n const plan = deriveNormalFormPlan(action.ref, action.inputSchema);\n if (plan && plans.length < MAX_NORMAL_FORM_PLANS) plans.push(plan);\n if (++processed % 32 === 0) await new Promise<void>((resolve) => setImmediate(resolve));\n }\n this.#plans = { digest, plans };\n }\n const plans = this.#plans.plans;\n const report = await this.#meter.measure(input.windows, {\n surface: input.surface, ...(input.repairs ? { repairs: input.repairs } : {}),\n catalogDigest: input.catalogDigest ?? digest,\n });\n // Background callers never consume advisory proposals. Keep those scans\n // on the explicit inspection path, not in an unyielding turn-end tail.\n return finishCompile({ ...input, traces: [] }, report, structuredClone(plans), false);\n }\n}\n\nexport const compileEntropySurface = (input: CompileEntropyInput): CompileEntropyOutcome => {\n const report = measureEntropy({ ...input, catalogDigest: input.catalogDigest ?? entropySurfaceHash(input.surface) });\n const plans: NormalFormPlan[] = [];\n for (const action of sortedActions(input.surface)) {\n const plan = deriveNormalFormPlan(action.ref, action.inputSchema);\n if (plan && plans.length < MAX_NORMAL_FORM_PLANS) plans.push(plan);\n }\n return finishCompile(input, report, plans);\n};\nexport const compileEntropySurfaceAsync = async (input: CompileEntropyInput): Promise<CompileEntropyOutcome> => {\n const report = await measureEntropyAsync({ ...input, catalogDigest: input.catalogDigest ?? entropySurfaceHash(input.surface) });\n const plans: NormalFormPlan[] = [];\n let processed = 0;\n for (const action of sortedActions(input.surface)) {\n const plan = deriveNormalFormPlan(action.ref, action.inputSchema);\n if (plan && plans.length < MAX_NORMAL_FORM_PLANS) plans.push(plan);\n if (++processed % 32 === 0) await new Promise<void>((resolve) => setImmediate(resolve));\n }\n return finishCompile(input, report, plans);\n};\n", "import type { EntropyProposal } from \"./types.js\";\n\nconst METRIC_PRECISION = 6;\n\nconst ENTROPY_COMMAND_HINTS = [\n {\n label: \"export\",\n command: \"/fabric entropy export [path]\",\n comment: \"snapshot the live surface (default <agent dir>/fabric/entropy/surface.json)\",\n },\n {\n label: \"share\",\n command: \"/fabric entropy export-artifact [path]\",\n comment: \"write the compiled artifact (default <agent dir>/fabric/entropy/artifact.json)\",\n },\n {\n label: \"merge\",\n command: \"/fabric entropy import <path>\",\n comment: \"merge a peer artifact (digest-proven entries only)\",\n },\n] as const;\n\nexport const formatEntropyMetric = (value: number): string => value.toFixed(METRIC_PRECISION);\n\nexport const formatEntropyCommandHints = (): string[] => {\n const heads = ENTROPY_COMMAND_HINTS.map((hint) => `${hint.label}: ${hint.command}`);\n const commentColumn = Math.max(...heads.map((head) => head.length)) + 2;\n return ENTROPY_COMMAND_HINTS.map(\n (hint, index) => `${heads[index]!.padEnd(commentColumn)}# ${hint.comment}`,\n );\n};\n\nconst scoreChange = (before: number, after: number): string => {\n if (before === after) {\n return `entropy score unchanged at ${formatEntropyMetric(before)} (lower is better)`;\n }\n let precision = METRIC_PRECISION;\n while (precision < 12 && before.toFixed(precision) === after.toFixed(precision)) precision += 1;\n const delta = after - before;\n const format = (value: number): string => value.toFixed(precision);\n const absoluteDelta = format(Math.abs(delta));\n const renderedDelta = Number(absoluteDelta) === 0\n ? Math.abs(delta).toExponential(2)\n : absoluteDelta;\n return `entropy score ${delta < 0 ? \"improved\" : \"changed\"} ${format(before)} \u2192 ${format(after)} (${delta > 0 ? \"+\" : \"\u2212\"}${renderedDelta}; lower is better)`;\n};\n\nexport const entropyReviewKey = (proposals: readonly EntropyProposal[]): string => {\n const identities = proposals.map((proposal): string => {\n if (proposal.kind === \"declare-enum\") {\n return JSON.stringify([\n proposal.kind,\n proposal.ref,\n proposal.key,\n proposal.values.map((value) => [typeof value, value]),\n ]);\n }\n if (proposal.kind === \"overload-split\") {\n return JSON.stringify([\n proposal.kind,\n proposal.ref,\n proposal.clusters.map((cluster) => cluster.keys),\n ]);\n }\n if (proposal.kind === \"sequence-fuse\") {\n return JSON.stringify([proposal.kind, proposal.sequence]);\n }\n return JSON.stringify([proposal.kind, proposal.ref]);\n });\n identities.sort();\n return JSON.stringify(identities);\n};\n\nconst reviewLabel = (kind: EntropyProposal[\"kind\"], count: number): string => {\n const noun = kind === \"declare-enum\"\n ? \"enum declaration\"\n : kind === \"overload-split\"\n ? \"action split\"\n : kind === \"sequence-fuse\"\n ? \"sequence fusion\"\n : kind;\n return `${count} ${noun}${count === 1 ? \"\" : \"s\"}`;\n};\n\nexport const formatEntropyReviewNotice = (\n proposals: readonly EntropyProposal[],\n): string => {\n const counts = new Map<EntropyProposal[\"kind\"], number>();\n for (const proposal of proposals) counts.set(proposal.kind, (counts.get(proposal.kind) ?? 0) + 1);\n const summary = [...counts.entries()].map(([kind, count]) => reviewLabel(kind, count)).join(\" \u00B7 \");\n return `entropy: ${proposals.length} suggestion${proposals.length === 1 ? \"\" : \"s\"} await review${summary ? ` \u00B7 ${summary}` : \"\"} \u00B7 inspect with /fabric entropy`;\n};\n\nexport const formatEntropyCompileNotice = (input: {\n beforeScore: number;\n afterScore: number;\n reviewCount?: number;\n normalizations?: number;\n}): string => {\n const review = input.reviewCount\n ? ` \u00B7 ${input.reviewCount} suggestion${input.reviewCount === 1 ? \"\" : \"s\"} await review (/fabric entropy)`\n : \"\";\n return `entropy: background optimization complete \u00B7 ${input.normalizations ?? 0} normal-form plans \u00B7 canonical capabilities preserved \u00B7 ${scoreChange(input.beforeScore, input.afterScore)} \u00B7 safety checks passed${review}`;\n};\n", "// Corpus shaping for the entropy meter: turn persisted Fabric execution\n// traces and session JSONL into meter traces, and normalize catalog repair\n// rows. Only guarded, typed records are consumed \u2014 never rendered prose.\n\nimport {\n FABRIC_EXECUTION_TRACE_KIND,\n readFabricExecutionTraceV1,\n type FabricExecutionTraceV1,\n} from \"../audit/trace.js\";\nimport { stableJsonHash } from \"../core/stable-hash.js\";\nimport type { CatalogRepair } from \"../repairs/types.js\";\nimport type {\n EntropyAuditCall,\n EntropyReport,\n EntropyRepairRowInput,\n EntropyTraceInput,\n EntropyValueObservation,\n} from \"./types.js\";\n\nconst DEFAULT_TASK_KEY = \"(none)\";\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === \"object\" && value !== null && !Array.isArray(value);\n\n// One Fabric execution trace becomes one meter trace. The first persisted\n// workflow phase is the deterministic task key for flow entropy.\nexport const entropyTraceFromFabricTrace = (\n trace: FabricExecutionTraceV1,\n model?: string,\n): EntropyTraceInput => ({\n operations: trace.operations.map((operation) => ({\n ref: operation.ref,\n args: operation.args,\n outcome: operation.outcome,\n ...(operation.failureStage !== undefined ? { failureStage: operation.failureStage } : {}),\n ...(operation.normalization ? { normalization: operation.normalization } : {}),\n })),\n taskKey: trace.phases[0] ?? DEFAULT_TASK_KEY,\n ...(model ? { model } : {}),\n});\n\nconst MODEL_CHANGE_FILTER = /\"type\"\\s*:\\s*\"model_change\"/;\nconst ASSISTANT_FILTER = /\"role\"\\s*:\\s*\"assistant\"/;\n\n// Model identity for one parsed session record: `model_change` entries name\n// the provider/model from that point on, and assistant messages carry the\n// provider/model that produced the turn. A toolResult's producing model is\n// the one active at its line, so the scan tracks it in order.\nconst modelFromRecord = (parsed: Record<string, unknown>): string | undefined => {\n if (parsed.type === \"model_change\") {\n const provider = typeof parsed.provider === \"string\" ? parsed.provider : \"\";\n const modelId = typeof parsed.modelId === \"string\" ? parsed.modelId : \"\";\n return provider && modelId ? `${provider}/${modelId}` : undefined;\n }\n const message = isRecord(parsed.message) ? parsed.message : undefined;\n if (!message || message.role !== \"assistant\") return undefined;\n const provider = typeof message.provider === \"string\" ? message.provider : \"\";\n const modelId = typeof message.model === \"string\" ? message.model : \"\";\n return provider && modelId ? `${provider}/${modelId}` : undefined;\n};\n\ninterface ScannedSessionRecord {\n details: Record<string, unknown>;\n model?: string;\n}\n\ninterface SessionScanState {\n currentModel?: string;\n}\n\n// Cheap pre-filters keep multi-session scans fast on large logs. Filtering\n// happens before trim so a large prose-only JSONL record is never copied.\nconst scanSessionLine = (\n line: string,\n state: SessionScanState,\n): ScannedSessionRecord | undefined => {\n if (line === \"\") return undefined;\n const traceLine = line.includes(FABRIC_EXECUTION_TRACE_KIND);\n const modelLine =\n !traceLine && (MODEL_CHANGE_FILTER.test(line) || ASSISTANT_FILTER.test(line));\n if (!traceLine && !modelLine) return undefined;\n let parsed: unknown;\n try {\n parsed = JSON.parse(line.trim());\n } catch {\n return undefined;\n }\n if (!isRecord(parsed)) return undefined;\n const model = modelFromRecord(parsed);\n if (model) state.currentModel = model;\n if (!traceLine) return undefined;\n const details = isRecord(parsed.details)\n ? parsed.details\n : isRecord(parsed.message) && isRecord(parsed.message.details)\n ? parsed.message.details\n : undefined;\n return isRecord(details)\n ? { details, ...(state.currentModel ? { model: state.currentModel } : {}) }\n : undefined;\n};\n\n// One scan yields all three evidence corpora. The async form consumes a\n// readline stream record-by-record, so large session files never monopolize\n// Pi's TUI event loop or require a whole-file string allocation.\nexport interface EntropySessionEvidence {\n traces: EntropyTraceInput[];\n valueObservations: EntropyValueObservation[];\n auditCalls: EntropyAuditCall[];\n}\n\nconst emptySessionEvidence = (): EntropySessionEvidence => ({\n traces: [],\n valueObservations: [],\n auditCalls: [],\n});\n\nconst appendSessionRecord = (\n evidence: EntropySessionEvidence,\n record: ScannedSessionRecord,\n): void => {\n const trace = readFabricExecutionTraceV1(record.details.trace);\n if (!trace) return;\n evidence.traces.push(entropyTraceFromFabricTrace(trace, record.model));\n const audits = record.details.audits;\n if (!Array.isArray(audits)) return;\n for (const audit of audits) {\n if (!isRecord(audit)) continue;\n const ref = typeof audit.ref === \"string\" ? audit.ref : undefined;\n const args = isRecord(audit.args) ? audit.args : undefined;\n if (!ref || !args) continue;\n evidence.auditCalls.push({ ref, args });\n for (const [key, value] of Object.entries(args)) {\n if (typeof value === \"string\" || typeof value === \"number\" || typeof value === \"boolean\") {\n evidence.valueObservations.push({ ref, key, value });\n }\n }\n }\n};\n\nexport const entropySessionEvidenceFromJsonl = (\n lines: readonly string[],\n): EntropySessionEvidence => {\n const evidence = emptySessionEvidence();\n const state: SessionScanState = {};\n for (const line of lines) {\n const record = scanSessionLine(line, state);\n if (record) appendSessionRecord(evidence, record);\n }\n return evidence;\n};\n\nexport interface EntropySessionEvidenceScan {\n evidence: EntropySessionEvidence;\n currentModel?: string;\n}\n\nexport const scanEntropySessionJsonlAsync = async (\n lines: AsyncIterable<string>,\n initialModel?: string,\n): Promise<EntropySessionEvidenceScan> => {\n const evidence = emptySessionEvidence();\n const state: SessionScanState = {\n ...(initialModel ? { currentModel: initialModel } : {}),\n };\n for await (const line of lines) {\n const record = scanSessionLine(line, state);\n if (record) appendSessionRecord(evidence, record);\n }\n return {\n evidence,\n ...(state.currentModel ? { currentModel: state.currentModel } : {}),\n };\n};\n\nexport const entropySessionEvidenceFromJsonlAsync = async (\n lines: AsyncIterable<string>,\n): Promise<EntropySessionEvidence> => (await scanEntropySessionJsonlAsync(lines)).evidence;\n\n// Extract meter traces from Pi session JSONL lines. Malformed lines, non-trace\n// entries, and envelopes that fail the trace guard are skipped without\n// throwing; only typed, guarded trace V1 envelopes count.\nexport const entropyTracesFromSessionJsonl = (lines: readonly string[]): EntropyTraceInput[] =>\n entropySessionEvidenceFromJsonl(lines).traces;\n\n// Verbatim audit arguments are the authoritative value corpus for\n// enum-tighten. The observations stay local to the session record, exactly\n// like the audits.\nexport const entropyValueObservationsFromSessionJsonl = (\n lines: readonly string[],\n): EntropyValueObservation[] => entropySessionEvidenceFromJsonl(lines).valueObservations;\n\n// One verbatim call per persisted audit: the authoritative replay corpus.\n// Trace V1 projects values away per ref (external and MCP calls keep none),\n// so replay validation consults these whenever a touched ref has them.\nexport const entropyAuditCallsFromSessionJsonl = (\n lines: readonly string[],\n): EntropyAuditCall[] => entropySessionEvidenceFromJsonl(lines).auditCalls;\n\n// Normalize catalog repair rows for the meter. `ref` is the target the row\n// repairs toward: the declared key's action for key aliases, or\n// provider.declared-action for action aliases.\nexport const entropyRepairRows = (repairs: readonly CatalogRepair[]): EntropyRepairRowInput[] =>\n repairs.map((repair) =>\n repair.kind === \"keyAlias\"\n ? { kind: \"keyAlias\", ref: repair.ref, from: repair.from, to: repair.to }\n : {\n kind: \"actionAlias\",\n ref: `${repair.provider}.${repair.to}`,\n from: repair.from,\n to: repair.to,\n },\n );\n\n// Stable hash of a report \u2014 the determinism check compares these.\nexport const entropyReportHash = (report: EntropyReport): string => stableJsonHash(report);\n", "// On-demand session measurement. Session JSONL is the source of truth, so\n// entropy is never recorded: the newest machine sessions are read live\n// across every project under the agent dir, measured against the current\n// surface, and the trend is the per-session slope. Evidence breadth matches\n// enforcement breadth: the compiled surface governs the whole machine, so\n// it learns from the whole machine. The repair table, compiled surface, and\n// bounded observation pool are the only durable derived artifacts; only the\n// first two change runtime behavior.\n\nimport fs from \"node:fs\";\nimport path from \"node:path\";\nimport { createInterface } from \"node:readline\";\nimport { sessionDirForCwd, sessionsDirRoot } from \"../memory/discovery.js\";\nimport {\n entropySessionEvidenceFromJsonl,\n entropyTracesFromSessionJsonl,\n scanEntropySessionJsonlAsync,\n type EntropySessionEvidence,\n} from \"./corpus.js\";\nimport { measureEntropy, measureEntropyAsync, type EntropyTraceWindow } from \"./meter.js\";\nimport { compareCodeUnits, trendFromScores } from \"./fingerprint.js\";\nimport type {\n EntropyAuditCall,\n EntropyModelReport,\n EntropyReport,\n EntropySurfaceSnapshot,\n EntropyTraceInput,\n EntropyTrend,\n EntropyValueObservation,\n} from \"./types.js\";\n\nconst DEFAULT_SESSION_WINDOW = 8;\n\nconst SESSION_STAT_CONCURRENCY = 32;\nconst SESSION_READ_CONCURRENCY = 4;\nconst SESSION_EVIDENCE_CACHE_LIMIT = 16;\n// Estimated bytes the evidence cache may hold beyond the active window. The\n// DEFAULT_SESSION_WINDOW most recently read files are always kept, so the\n// background compile never rescans a session it read on the previous turn;\n// older entries (files that left the window, or a `/fabric` sweep across the\n// machine) stay only while the total fits.\nconst SESSION_EVIDENCE_CACHE_BYTES = 16 * 1024 * 1024;\n\ninterface StampedSessionFile {\n file: string;\n mtime: number;\n}\n\ninterface CachedSessionEvidence {\n size: number;\n mtimeMs: number;\n dev: number;\n ino: number;\n currentModel?: string;\n evidence: EntropySessionEvidence;\n /** Estimated retained bytes of `evidence`. */\n bytes: number;\n}\n\nconst asyncEvidenceCache = new Map<string, CachedSessionEvidence>();\nlet asyncEvidenceCacheBytes = 0;\n\n// Rough V8 retained size: headers, slots and string payloads. Observation\n// values are the audit argument strings themselves, so an observation counts\n// only its own object. The walk yields between chunks so a first scan of a\n// large session never blocks Pi's event loop on the estimate.\nconst OBJECT_BYTES = 32;\nconst SLOT_BYTES = 8;\nconst STRING_BYTES = 16;\nconst OBSERVATION_BYTES = 48;\nconst ESTIMATE_CHUNK = 4_096;\n\nconst estimateEvidenceBytesAsync = async (evidence: EntropySessionEvidence): Promise<number> => {\n let bytes = OBJECT_BYTES * 3 + evidence.valueObservations.length * (OBSERVATION_BYTES + SLOT_BYTES);\n const stack: unknown[] = [evidence.traces, evidence.auditCalls];\n let visited = 0;\n while (stack.length > 0) {\n const value = stack.pop();\n if (typeof value === \"string\") bytes += STRING_BYTES + value.length;\n else if (Array.isArray(value)) {\n bytes += OBJECT_BYTES + value.length * SLOT_BYTES;\n for (const item of value) stack.push(item);\n } else if (value !== null && typeof value === \"object\") {\n const entries = Object.entries(value);\n bytes += OBJECT_BYTES + entries.length * SLOT_BYTES * 2;\n for (const [, item] of entries) stack.push(item);\n } else bytes += SLOT_BYTES;\n if (++visited % ESTIMATE_CHUNK === 0) await new Promise<void>((resolve) => setImmediate(resolve));\n }\n return bytes;\n};\n\nconst mapConcurrent = async <T, R>(\n items: readonly T[],\n limit: number,\n fn: (item: T) => Promise<R>,\n): Promise<R[]> => {\n const results = new Array<R>(items.length);\n let cursor = 0;\n const worker = async (): Promise<void> => {\n for (;;) {\n const index = cursor++;\n if (index >= items.length) return;\n results[index] = await fn(items[index]!);\n }\n };\n await Promise.all(\n Array.from({ length: Math.min(limit, items.length) }, () => worker()),\n );\n return results;\n};\n\nconst byNewestSession = (left: StampedSessionFile, right: StampedSessionFile): number =>\n right.mtime - left.mtime ||\n (left.file < right.file ? -1 : left.file > right.file ? 1 : 0);\n\nconst stampSessionFiles = async (files: readonly string[]): Promise<StampedSessionFile[]> =>\n mapConcurrent(files, SESSION_STAT_CONCURRENCY, async (file) => {\n let mtime = 0;\n try {\n mtime = (await fs.promises.stat(file)).mtimeMs;\n } catch {\n // Preserve the synchronous selector's race behavior: an unreadable file\n // sorts last and the later stream open decides whether it contributes.\n }\n return { file, mtime };\n });\n\nexport interface SessionCorpusEntry {\n file: string;\n operations: number;\n report: EntropyReport;\n}\n\n// Per-model trend across the session window: the attribution that names\n// which model's behavior moved, with the surface share staying global.\nexport interface SessionModelTrend {\n model: string;\n sessions: number;\n latestBehavioralScore: number;\n slopePerSession: number;\n latestRejectionsPer1k: number;\n}\n\nexport interface SessionCorpusResult {\n files: readonly string[];\n sessions: SessionCorpusEntry[];\n latest?: EntropyReport;\n trend: EntropyTrend;\n models: SessionModelTrend[];\n}\n\n// Newest-first session JSONL files for one project cwd, bounded by `limit`.\n// Mtime ties break by path so the ordering is stable.\nexport const projectSessionFiles = (\n agentDir: string,\n cwd: string,\n limit = DEFAULT_SESSION_WINDOW,\n): string[] => {\n const dir = sessionDirForCwd(cwd, agentDir);\n let entries: fs.Dirent[] = [];\n try {\n entries = fs.readdirSync(dir, { withFileTypes: true });\n } catch {\n return [];\n }\n const stamped = entries\n .filter((entry) => entry.isFile() && entry.name.endsWith(\".jsonl\"))\n .map((entry) => {\n const file = path.join(dir, entry.name);\n let mtime = 0;\n try {\n mtime = fs.statSync(file).mtimeMs;\n } catch {\n mtime = 0;\n }\n return { file, mtime };\n });\n stamped.sort(\n (left, right) =>\n right.mtime - left.mtime || (left.file < right.file ? -1 : left.file > right.file ? 1 : 0),\n );\n return stamped.slice(0, Math.max(1, limit)).map((entry) => entry.file);\n};\n\n// Machine-wide session window: newest sessions across every project under\n// the agent dir, bounded by `limit` in total. The current project's newest\n// session is always included even when quieter projects would crowd it\n// out, because the live session produced this turn's evidence. Ordering\n// matches projectSessionFiles: mtime descending, path tiebreak, stable.\nexport const machineSessionFiles = (\n agentDir: string,\n cwd: string | undefined,\n limit = DEFAULT_SESSION_WINDOW,\n): string[] => {\n const root = sessionsDirRoot(agentDir);\n let projectDirs: fs.Dirent[] = [];\n try {\n projectDirs = fs.readdirSync(root, { withFileTypes: true });\n } catch {\n return [];\n }\n const byNewest = (\n left: { file: string; mtime: number },\n right: { file: string; mtime: number },\n ) =>\n right.mtime - left.mtime ||\n (left.file < right.file ? -1 : left.file > right.file ? 1 : 0);\n const stamped: { file: string; mtime: number }[] = [];\n const directories = projectDirs\n .filter((entry) => entry.isDirectory())\n .sort((left, right) => (left.name < right.name ? -1 : left.name > right.name ? 1 : 0));\n for (const directory of directories) {\n let entries: fs.Dirent[] = [];\n try {\n entries = fs.readdirSync(path.join(root, directory.name), { withFileTypes: true });\n } catch {\n continue;\n }\n for (const entry of entries.filter(\n (candidate) => candidate.isFile() && candidate.name.endsWith(\".jsonl\"),\n )) {\n const file = path.join(root, directory.name, entry.name);\n let mtime = 0;\n try {\n mtime = fs.statSync(file).mtimeMs;\n } catch {\n mtime = 0;\n }\n stamped.push({ file, mtime });\n }\n }\n stamped.sort(byNewest);\n const window = Math.max(1, limit);\n let selected = stamped.slice(0, window);\n if (cwd) {\n const current = projectSessionFiles(agentDir, cwd, 1)[0];\n if (current !== undefined && !selected.some((entry) => entry.file === current)) {\n const kept = [...selected];\n if (kept.length >= window) kept.length = window - 1;\n let mtime = 0;\n try {\n mtime = fs.statSync(current).mtimeMs;\n } catch {\n mtime = 0;\n }\n kept.push({ file: current, mtime });\n kept.sort(byNewest);\n selected = kept;\n }\n }\n return selected.map((entry) => entry.file);\n};\n\nexport const projectSessionFilesAsync = async (\n agentDir: string,\n cwd: string,\n limit = DEFAULT_SESSION_WINDOW,\n): Promise<string[]> => {\n const dir = sessionDirForCwd(cwd, agentDir);\n let entries: fs.Dirent[];\n try {\n entries = await fs.promises.readdir(dir, { withFileTypes: true });\n } catch {\n return [];\n }\n const files = entries\n .filter((entry) => entry.isFile() && entry.name.endsWith(\".jsonl\"))\n .map((entry) => path.join(dir, entry.name));\n const stamped = await stampSessionFiles(files);\n stamped.sort(byNewestSession);\n return stamped.slice(0, Math.max(1, limit)).map((entry) => entry.file);\n};\n\nexport const machineSessionFilesAsync = async (\n agentDir: string,\n cwd: string | undefined,\n limit = DEFAULT_SESSION_WINDOW,\n): Promise<string[]> => {\n const root = sessionsDirRoot(agentDir);\n let projectDirs: fs.Dirent[];\n try {\n projectDirs = await fs.promises.readdir(root, { withFileTypes: true });\n } catch {\n return [];\n }\n const directories = projectDirs\n .filter((entry) => entry.isDirectory())\n .sort((left, right) => (left.name < right.name ? -1 : left.name > right.name ? 1 : 0));\n const filesByDirectory = await mapConcurrent(\n directories,\n SESSION_STAT_CONCURRENCY,\n async (directory): Promise<string[]> => {\n const dir = path.join(root, directory.name);\n try {\n return (await fs.promises.readdir(dir, { withFileTypes: true }))\n .filter((entry) => entry.isFile() && entry.name.endsWith(\".jsonl\"))\n .map((entry) => path.join(dir, entry.name));\n } catch {\n return [];\n }\n },\n );\n const stamped = await stampSessionFiles(filesByDirectory.flat());\n stamped.sort(byNewestSession);\n const window = Math.max(1, limit);\n let selected = stamped.slice(0, window);\n if (cwd) {\n const current = (await projectSessionFilesAsync(agentDir, cwd, 1))[0];\n if (current !== undefined && !selected.some((entry) => entry.file === current)) {\n const kept = [...selected];\n if (kept.length >= window) kept.length = window - 1;\n const [stampedCurrent] = await stampSessionFiles([current]);\n if (stampedCurrent) kept.push(stampedCurrent);\n kept.sort(byNewestSession);\n selected = kept;\n }\n }\n return selected.map((entry) => entry.file);\n};\n\nconst finalizeSessionCorpus = (\n files: readonly string[],\n sessions: SessionCorpusEntry[],\n): SessionCorpusResult => {\n const chronological = [...sessions].reverse();\n const modelScores = new Map<string, { behavioral: number[]; latest: EntropyModelReport }>();\n for (const session of chronological) {\n for (const model of session.report.byModel) {\n const entry = modelScores.get(model.model) ?? { behavioral: [], latest: model };\n entry.behavioral.push(model.behavioralScore);\n entry.latest = model;\n modelScores.set(model.model, entry);\n }\n }\n const models: SessionModelTrend[] = [...modelScores.entries()]\n .sort(([left], [right]) => compareCodeUnits(left, right))\n .map(([model, entry]) => ({\n model,\n sessions: entry.behavioral.length,\n latestBehavioralScore: entry.latest.behavioralScore,\n slopePerSession: trendFromScores(entry.behavioral).slopePerStep,\n latestRejectionsPer1k: entry.latest.invocationRejectionsPer1k,\n }));\n return {\n files,\n sessions,\n ...(sessions.length > 0 ? { latest: sessions[0]!.report } : {}),\n trend: trendFromScores(chronological.map((session) => session.report.score)),\n models,\n };\n};\n\n// Measure each session file independently against the same surface; sessions\n// without fabric_exec traces contribute nothing. `files` must be newest\n// first; the trend runs oldest to newest.\nexport const measureSessionCorpus = (input: {\n files: readonly string[];\n surface?: EntropySurfaceSnapshot;\n catalogDigest?: string;\n}): SessionCorpusResult => {\n const sessions: SessionCorpusEntry[] = [];\n for (const file of input.files) {\n let text: string;\n try {\n text = fs.readFileSync(file, \"utf8\");\n } catch {\n continue;\n }\n const traces = entropyTracesFromSessionJsonl(text.split(\"\\n\"));\n if (traces.length === 0) continue;\n const report = measureEntropy({\n traces,\n ...(input.surface ? { surface: input.surface } : {}),\n ...(input.catalogDigest !== undefined ? { catalogDigest: input.catalogDigest } : {}),\n });\n if (report.totals.operations === 0) continue;\n sessions.push({ file, operations: report.totals.operations, report });\n }\n return finalizeSessionCorpus(input.files, sessions);\n};\n\n// One read per file yields the meter traces, the verbatim audit value\n// corpus, the verbatim audit calls, and the per-file observation windows\n// the machine-wide pool consumes with exact deltas, so the autonomous\n// compile and the command share a single window scan.\n/** Background-only discovery cadence; explicit inspection continues to scan immediately. */\nexport class BackgroundSessionSelector {\n #cached: { agentDir: string; cwd: string | undefined; files: string[]; until: number } | undefined;\n\n constructor(readonly scan = machineSessionFilesAsync) {}\n\n async select(agentDir: string, cwd: string | undefined, currentFile?: string): Promise<string[]> {\n const cached = this.#cached;\n let files: string[];\n if (cached && cached.agentDir === agentDir && cached.cwd === cwd && Date.now() < cached.until) {\n files = cached.files;\n } else {\n files = await this.scan(agentDir, cwd);\n // Do not cache an absent session root: it may be created by this turn.\n this.#cached = files.length > 0 ? { agentDir, cwd, files, until: Date.now() + 30_000 } : undefined;\n }\n // The active file is fresh on every compile, including forks and switches\n // which occurred inside the machine-wide discovery window.\n return currentFile\n ? [currentFile, ...files.filter((file) => file !== currentFile)].slice(0, DEFAULT_SESSION_WINDOW)\n : [...files];\n }\n}\n\nexport interface SessionObservationWindow {\n file: string;\n observations: EntropyValueObservation[];\n}\n\nexport interface SessionWindowEvidence {\n traceWindows: EntropyTraceWindow[];\n traces: EntropyTraceInput[];\n valueObservations: EntropyValueObservation[];\n auditCalls: EntropyAuditCall[];\n observationWindows: SessionObservationWindow[];\n}\n\ninterface SessionFileMetadata {\n size: number;\n mtimeMs: number;\n dev: number;\n ino: number;\n}\n\nconst sessionMetadata = async (file: string): Promise<SessionFileMetadata | undefined> => {\n try {\n const entry = await fs.promises.stat(file);\n return {\n size: entry.size,\n mtimeMs: entry.mtimeMs,\n dev: entry.dev,\n ino: entry.ino,\n };\n } catch {\n return undefined;\n }\n};\n\nconst endsAtLineBoundary = async (\n file: string,\n metadata: SessionFileMetadata,\n): Promise<boolean> => {\n if (metadata.size === 0) return true;\n let handle: fs.promises.FileHandle | undefined;\n try {\n handle = await fs.promises.open(file, \"r\");\n const byte = Buffer.allocUnsafe(1);\n const { bytesRead } = await handle.read(byte, 0, 1, metadata.size - 1);\n return bytesRead === 1 && byte[0] === 0x0a;\n } catch {\n return false;\n } finally {\n await handle?.close().catch(() => undefined);\n }\n};\n\nconst scanSessionRange = async (\n file: string,\n start: number,\n end: number,\n initialModel?: string,\n): ReturnType<typeof scanEntropySessionJsonlAsync> => {\n const input = fs.createReadStream(file, { encoding: \"utf8\", start, end });\n const lines = createInterface({ input, crlfDelay: Infinity });\n try {\n return await scanEntropySessionJsonlAsync(lines, initialModel);\n } finally {\n lines.close();\n input.destroy();\n }\n};\n\nconst evidenceWindow = (\n file: string,\n evidence: EntropySessionEvidence,\n): SessionWindowEvidence => ({\n traceWindows: [{ file, traces: evidence.traces }],\n traces: evidence.traces,\n valueObservations: evidence.valueObservations,\n auditCalls: evidence.auditCalls,\n observationWindows: [{ file, observations: evidence.valueObservations }],\n});\n\nconst forgetSessionEvidence = (file: string): void => {\n const cached = asyncEvidenceCache.get(file);\n if (!cached) return;\n asyncEvidenceCache.delete(file);\n asyncEvidenceCacheBytes -= cached.bytes;\n};\n\nconst cacheSessionEvidence = (file: string, cached: CachedSessionEvidence): void => {\n forgetSessionEvidence(file);\n asyncEvidenceCache.set(file, cached);\n asyncEvidenceCacheBytes += cached.bytes;\n while (asyncEvidenceCache.size > SESSION_EVIDENCE_CACHE_LIMIT) {\n forgetSessionEvidence(asyncEvidenceCache.keys().next().value!);\n }\n};\n\n// Runs after a batch of reads, when every file of the batch is among the most\n// recently read: trimming mid-batch could evict a window file the same batch\n// has yet to read and force a full rescan of it.\nconst trimSessionEvidenceCache = (): void => {\n while (\n asyncEvidenceCache.size > DEFAULT_SESSION_WINDOW &&\n asyncEvidenceCacheBytes > SESSION_EVIDENCE_CACHE_BYTES\n ) {\n forgetSessionEvidence(asyncEvidenceCache.keys().next().value!);\n }\n};\n\n/** Cached session evidence: entry count and estimated bytes. For diagnostics and tests. */\nexport const sessionEvidenceCacheUsage = (): { files: number; bytes: number } => ({\n files: asyncEvidenceCache.size,\n bytes: asyncEvidenceCacheBytes,\n});\n\nconst sameSessionFile = (\n cached: CachedSessionEvidence,\n metadata: SessionFileMetadata,\n): boolean => cached.dev === metadata.dev && cached.ino === metadata.ino;\n\nconst readSessionEvidenceAsync = async (\n file: string,\n): Promise<SessionWindowEvidence | undefined> => {\n const metadata = await sessionMetadata(file);\n if (!metadata) return undefined;\n const cached = asyncEvidenceCache.get(file);\n if (\n cached &&\n sameSessionFile(cached, metadata) &&\n cached.size === metadata.size &&\n Math.abs(cached.mtimeMs - metadata.mtimeMs) <= 1e-6\n ) {\n cacheSessionEvidence(file, cached);\n return evidenceWindow(file, cached.evidence);\n }\n\n const append =\n cached && sameSessionFile(cached, metadata) && metadata.size > cached.size\n ? cached\n : undefined;\n const start = append ? append.size : 0;\n let scan: Awaited<ReturnType<typeof scanEntropySessionJsonlAsync>>;\n try {\n scan = metadata.size === start\n ? {\n evidence: { traces: [], valueObservations: [], auditCalls: [] },\n ...(append?.currentModel ? { currentModel: append.currentModel } : {}),\n }\n : await scanSessionRange(\n file,\n start,\n metadata.size - 1,\n append?.currentModel,\n );\n } catch {\n return undefined;\n }\n const evidence: EntropySessionEvidence = append\n ? {\n traces: [...append.evidence.traces, ...scan.evidence.traces],\n valueObservations: [\n ...append.evidence.valueObservations,\n ...scan.evidence.valueObservations,\n ],\n auditCalls: [...append.evidence.auditCalls, ...scan.evidence.auditCalls],\n }\n : scan.evidence;\n if (await endsAtLineBoundary(file, metadata)) {\n const bytes = (append?.bytes ?? 0) + await estimateEvidenceBytesAsync(scan.evidence);\n cacheSessionEvidence(file, {\n ...metadata,\n ...(scan.currentModel ? { currentModel: scan.currentModel } : {}),\n evidence,\n bytes,\n });\n } else {\n forgetSessionEvidence(file);\n }\n return evidenceWindow(file, evidence);\n};\n\nexport const sessionWindowEvidenceAsync = async (\n files: readonly string[],\n options: { windowsOnly?: boolean } = {},\n): Promise<SessionWindowEvidence> => {\n const windows = await mapConcurrent(files, SESSION_READ_CONCURRENCY, readSessionEvidenceAsync);\n trimSessionEvidenceCache();\n const traces: EntropyTraceInput[] = [];\n const valueObservations: EntropyValueObservation[] = [];\n const auditCalls: EntropyAuditCall[] = [];\n const observationWindows: SessionObservationWindow[] = [];\n const traceWindows: EntropyTraceWindow[] = [];\n for (const window of windows) {\n if (!window) continue;\n // Background consumers only need immutable per-file snapshots. Avoid\n // copying the full historical corpus into unused flattened arrays.\n if (!options.windowsOnly) {\n for (const trace of window.traces) traces.push(trace);\n for (const observation of window.valueObservations) valueObservations.push(observation);\n for (const call of window.auditCalls) auditCalls.push(call);\n }\n observationWindows.push(...window.observationWindows);\n traceWindows.push(...window.traceWindows);\n }\n return { traces, valueObservations, auditCalls, observationWindows, traceWindows };\n};\n\nexport const measureSessionCorpusAsync = async (input: {\n files: readonly string[];\n surface?: EntropySurfaceSnapshot;\n catalogDigest?: string;\n}): Promise<SessionCorpusResult> => {\n const windows = await mapConcurrent(\n input.files,\n SESSION_READ_CONCURRENCY,\n readSessionEvidenceAsync,\n );\n trimSessionEvidenceCache();\n const sessions: SessionCorpusEntry[] = [];\n for (let index = 0; index < input.files.length; index++) {\n const window = windows[index];\n const file = input.files[index];\n if (!window || !file || window.traces.length === 0) continue;\n const report = await measureEntropyAsync({\n traces: window.traces,\n ...(input.surface ? { surface: input.surface } : {}),\n ...(input.catalogDigest !== undefined ? { catalogDigest: input.catalogDigest } : {}),\n });\n if (report.totals.operations === 0) continue;\n sessions.push({ file, operations: report.totals.operations, report });\n }\n return finalizeSessionCorpus(input.files, sessions);\n};\n\nexport const sessionWindowEvidence = (\n files: readonly string[],\n): SessionWindowEvidence => {\n const traces: EntropyTraceInput[] = [];\n const valueObservations: EntropyValueObservation[] = [];\n const auditCalls: EntropyAuditCall[] = [];\n const observationWindows: SessionObservationWindow[] = [];\n const traceWindows: EntropyTraceWindow[] = [];\n for (const file of files) {\n let text: string;\n try {\n text = fs.readFileSync(file, \"utf8\");\n } catch {\n continue;\n }\n const evidence = entropySessionEvidenceFromJsonl(text.split(\"\\n\"));\n traces.push(...evidence.traces);\n valueObservations.push(...evidence.valueObservations);\n auditCalls.push(...evidence.auditCalls);\n observationWindows.push({ file, observations: evidence.valueObservations });\n traceWindows.push({ file, traces: evidence.traces });\n }\n return { traces, valueObservations, auditCalls, observationWindows, traceWindows };\n};\n", "// Offline representation replay, not execution: a validation win says nothing\n// about whether the historical operation would have succeeded.\nimport { Value } from \"typebox/value\";\nimport { COMPILED_SURFACE_VERSION, type CompiledSurfaceFile } from \"./compiled-surface.js\";\nimport { compareCodeUnits } from \"./fingerprint.js\";\nimport { measureEntropy } from \"./meter.js\";\nimport { applyNormalFormPlan, provesNormalFormPlan, type NormalFormPlan } from \"./normal-form.js\";\nimport { entropySurfaceHash } from \"./surface.js\";\nimport type { EntropyAuditCall, EntropySurfaceSnapshot, EntropyTraceInput } from \"./types.js\";\n\n// Legacy classes/fields remain readable; restriction wins are never emitted.\nexport type EntropyTrialClass =\n | \"both-accept\" | \"both-reject\" | \"normalization-win\"\n | \"tightening-cost\" | \"typed-failure-win\" | \"quarantine-win\" | \"quarantine-cost\";\nexport interface EntropyTrialTotals {\n operations: number;\n bothAccept: number;\n bothReject: number;\n normalizationWin: number;\n canonicalIdentityChecks: number;\n canonicalIdentityCost: number;\n idempotenceCost: number;\n tighteningCost: number;\n typedFailureWin: number;\n quarantineWin: number;\n quarantineCost: number;\n}\nexport interface EntropyTrialDivergence { ref: string; trialClass: EntropyTrialClass; count: number }\nexport type EntropyTrialVerdict = \"no-evidence\" | \"clean\" | \"costly\";\nexport interface EntropyTrialReport {\n verdict: EntropyTrialVerdict;\n /** Historical invocation rejection rate; normalization never rewrites outcomes. */\n declaredScore: number;\n effectiveScore: number;\n delta: number;\n totals: EntropyTrialTotals;\n divergences: EntropyTrialDivergence[];\n}\nconst accepts = (schema: unknown, args: Record<string, unknown>): boolean => {\n try { return typeof schema === \"object\" && schema !== null && Value.Check(schema, args); }\n catch { return false; }\n};\n\nexport const runEntropyTrial = (input: {\n traces: readonly EntropyTraceInput[];\n live: EntropySurfaceSnapshot;\n artifact?: CompiledSurfaceFile;\n auditCalls?: readonly EntropyAuditCall[];\n}): EntropyTrialReport => {\n const schemas = new Map(input.live.actions.map((action) => [action.ref, action.inputSchema]));\n const plans = new Map<string, NormalFormPlan>();\n if (input.artifact?.version === COMPILED_SURFACE_VERSION) {\n for (const plan of input.artifact.normalizations ?? []) {\n if (provesNormalFormPlan(plan, schemas.get(plan.ref))) plans.set(plan.ref, plan);\n }\n }\n const report = measureEntropy({ traces: input.traces, surface: input.live, catalogDigest: entropySurfaceHash(input.live) });\n const totals: EntropyTrialTotals = {\n operations: 0, bothAccept: 0, bothReject: 0, normalizationWin: 0,\n canonicalIdentityChecks: 0, canonicalIdentityCost: 0, idempotenceCost: 0,\n tighteningCost: 0, typedFailureWin: 0, quarantineWin: 0, quarantineCost: 0,\n };\n const divergences = new Map<string, EntropyTrialDivergence>();\n let plannedOperations = 0;\n const record = (ref: string, args: Record<string, unknown>): void => {\n if (ref.startsWith(\"fabric.discovery.\") || ref.startsWith(\"fabric.workflow.\")) return;\n const schema = schemas.get(ref);\n if (schema === undefined) return;\n const plan = plans.get(ref);\n if (plan) plannedOperations++;\n const before = accepts(schema, args);\n const normalized = applyNormalFormPlan(ref, schema, args, plan);\n const after = accepts(schema, normalized.args);\n totals.operations++;\n if (before) {\n totals.canonicalIdentityChecks++;\n if (normalized.args !== args || normalized.witness) totals.canonicalIdentityCost++;\n }\n const twice = applyNormalFormPlan(ref, schema, normalized.args, plan);\n if (twice.args !== normalized.args || twice.witness) totals.idempotenceCost++;\n let trialClass: EntropyTrialClass;\n if (before && !after) { totals.tighteningCost++; trialClass = \"tightening-cost\"; }\n else if (before) { totals.bothAccept++; trialClass = \"both-accept\"; }\n else if (after && normalized.witness) { totals.normalizationWin++; trialClass = \"normalization-win\"; }\n else { totals.bothReject++; trialClass = \"both-reject\"; }\n if (trialClass !== \"both-accept\" && trialClass !== \"both-reject\") {\n const key = JSON.stringify([ref, trialClass]);\n const entry = divergences.get(key) ?? { ref, trialClass, count: 0 };\n entry.count++;\n divergences.set(key, entry);\n }\n };\n // Prefer the complete verbatim corpus by ref, not by position or outcome.\n // Audits have no execution outcome; projected traces are only a fallback.\n const auditedRefs = new Set<string>();\n for (const call of input.auditCalls ?? []) {\n auditedRefs.add(call.ref);\n record(call.ref, call.args);\n }\n for (const trace of input.traces) {\n for (const operation of trace.operations) {\n if (!auditedRefs.has(operation.ref)) record(operation.ref, operation.args);\n }\n }\n const costs = totals.tighteningCost + totals.canonicalIdentityCost + totals.idempotenceCost;\n return {\n verdict: costs > 0 ? \"costly\" : plannedOperations === 0 ? \"no-evidence\" : \"clean\",\n declaredScore: report.score, effectiveScore: report.score, delta: 0, totals,\n divergences: [...divergences.values()].sort((a, b) => compareCodeUnits(a.ref, b.ref) || compareCodeUnits(a.trialClass, b.trialClass)),\n };\n};\n"],
5
+ "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyCA,IAAM,mBAAmB;AACzB,IAAM,kBAAkB;AACxB,IAAM,mBAAmB;AACzB,IAAM,iBAAiB;AA4BvB,IAAM,qBAAqB,CAAC,UAA2C;AACrE,QAAM,eAAe,oBAAI,IAAqB;AAC9C,MAAI,MAAM,SAAS;AACjB,eAAW,UAAU,MAAM,QAAQ,QAAS,cAAa,IAAI,OAAO,KAAK,OAAO,WAAW;AAAA,EAC7F;AACA,QAAM,eAAe,oBAAI,IAAoB;AAC7C,MAAI,cAAc;AAClB,aAAW,OAAO,MAAM,WAAW,CAAC,GAAG;AACrC,iBAAa,IAAI,IAAI,MAAM,aAAa,IAAI,IAAI,GAAG,KAAK,KAAK,CAAC;AAC9D,mBAAe;AAAA,EACjB;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,MACN,QAAQ,MAAM,OAAO;AAAA,MACrB,YAAY;AAAA,MACZ,kBAAkB;AAAA,MAClB,qBAAqB;AAAA,MACrB,oBAAoB;AAAA,MACpB,WAAW;AAAA,MACX,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,UAAU;AAAA,MACV,sBAAsB;AAAA,MACtB,2BAA2B;AAAA,IAC7B;AAAA,IACA,MAAM,oBAAI,IAAI;AAAA,IACd,eAAe,oBAAI,IAAI;AAAA,IACvB,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AACF;AAEA,IAAM,iBAAiB,CAAC,OAAqB,QAAgC;AAC3E,QAAM,WAAW,MAAM,KAAK,IAAI,GAAG;AACnC,MAAI,SAAU,QAAO;AACrB,QAAM,UAA0B;AAAA,IAC9B,OAAO;AAAA,IACP,WAAW;AAAA,IACX,QAAQ;AAAA,IACR,YAAY,oBAAI,IAAoB;AAAA,IACpC,QAAQ,oBAAI,IAAoB;AAAA,IAChC,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AACA,QAAM,KAAK,IAAI,KAAK,OAAO;AAC3B,SAAO;AACT;AAEA,IAAM,kBAAkB,CAAC,OAAqB,gBAAyC;AACrF,QAAM,UAAU,YAAY,WAAW;AACvC,QAAM,WAAqB,CAAC;AAC5B,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,aAAW,aAAa,YAAY,YAAY;AAC9C,UAAM,OAAO,cAAc;AAC3B,QAAI,UAAU,IAAI,WAAW,gBAAgB,GAAG;AAC9C,YAAM,OAAO,uBAAuB;AACpC;AAAA,IACF;AACA,QAAI,UAAU,IAAI,WAAW,eAAe,GAAG;AAC7C,YAAM,OAAO,sBAAsB;AACnC;AAAA,IACF;AACA,UAAM,OAAO,oBAAoB;AACjC,aAAS,KAAK,UAAU,GAAG;AAC3B,UAAM,MAAM,eAAe,OAAO,UAAU,GAAG;AAC/C,QAAI,SAAS;AACb,QAAI,UAAU,YAAY,aAAa;AACrC,YAAM,OAAO,aAAa;AAC1B,UAAI,aAAa;AAAA,IACnB,WAAW,UAAU,YAAY,UAAU;AACzC,YAAM,OAAO,UAAU;AACvB,UAAI,UAAU;AAAA,IAChB,WAAW,UAAU,YAAY,WAAW;AAC1C,YAAM,OAAO,WAAW;AAAA,IAC1B,OAAO;AACL,YAAM,OAAO,YAAY;AAAA,IAC3B;AACA,UAAM,YAAY,eAAe,UAAU,IAAI;AAC/C,QAAI,WAAW,IAAI,YAAY,IAAI,WAAW,IAAI,SAAS,KAAK,KAAK,CAAC;AACtE,QAAI,UAAU,YAAY,UAAU;AAClC,YAAM,QAAQ,UAAU,gBAAgB;AACxC,UAAI,OAAO,IAAI,QAAQ,IAAI,OAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AACtD,UAAI,0BAA0B,SAAS,KAAK,EAAG,OAAM,OAAO,wBAAwB;AAAA,IACtF;AACA,UAAM,UAAU,cAAc,IAAI,UAAU,GAAG;AAC/C,QAAI,YAAY,QAAW;AACzB,YAAM,WAAW,kBAAkB,SAAS,SAAS;AACrD,UAAI,cAAc;AAClB,UAAI,YAAY;AAChB,YAAM,cAAc;AACpB,YAAM,YAAY;AAClB,oBAAc,OAAO,UAAU,GAAG;AAAA,IACpC;AACA,QAAI,UAAU,YAAY,SAAU,eAAc,IAAI,UAAU,KAAK,SAAS;AAAA,EAChF;AACA,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,MAAM,SAAS,KAAK,QAAG;AAC7B,UAAM,UAAU,MAAM,cAAc,IAAI,OAAO,KAAK,oBAAI,IAAoB;AAC5E,YAAQ,IAAI,MAAM,QAAQ,IAAI,GAAG,KAAK,KAAK,CAAC;AAC5C,UAAM,cAAc,IAAI,SAAS,OAAO;AAAA,EAC1C;AACF;AAEA,IAAM,kBAAkB,CACtB,OACA,UACsB;AACtB,QAAM,aAAa,CAAC,GAAG,MAAM,KAAK,QAAQ,CAAC,EAAE;AAAA,IAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAC/D,iBAAiB,MAAM,KAAK;AAAA,EAC9B;AACA,QAAM,aAAiC,CAAC;AACxC,MAAI,qBAAqB;AACzB,MAAI,iBAAiB;AACrB,MAAI,gBAAgB;AACpB,MAAI,uBAAuB;AAC3B,aAAW,CAAC,KAAK,GAAG,KAAK,YAAY;AACnC,UAAM,mBAAmB,mBAAmB,CAAC,GAAG,IAAI,WAAW,OAAO,CAAC,CAAC;AACxE,UAAM,0BAA0B,mBAAmB,CAAC,GAAG,IAAI,OAAO,OAAO,CAAC,CAAC;AAC3E,UAAM,eAAe,IAAI,aAAa,IAAI,YAAY,IAAI,WAAW,IAAI,UAAU,IAAI;AACvF,UAAM,UAAU,MAAM,aAAa,IAAI,GAAG,KAAK;AAC/C,UAAM,gBAAgB,MAAM,aAAa,IAAI,GAAG,IAC5C,wBAAwB,MAAM,aAAa,IAAI,GAAG,CAAC,IACnD;AACJ,0BAAsB;AACtB,sBAAkB,gBAAgB,gBAAgB,gBAAgB,IAAI;AACtE,qBAAiB,mBAAmB,IAAI;AACxC,4BAAwB,0BAA0B,IAAI;AACtD,UAAM,uBAAuB,0BAA0B;AAAA,MACrD,CAAC,KAAK,UAAU,OAAO,IAAI,OAAO,IAAI,KAAK,KAAK;AAAA,MAChD;AAAA,IACF;AACA,UAAMA,SAAQ,YAAY,uBAAuB,IAAI,KAAK;AAC1D,UAAM,kBAA2C,CAAC,GAAG,IAAI,WAAW,QAAQ,CAAC,EAC1E,IAAI,CAAC,CAAC,WAAW,KAAK,OAAO,EAAE,WAAW,MAAM,EAAE,EAClD;AAAA,MACC,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,SAAS,iBAAiB,KAAK,WAAW,MAAM,SAAS;AAAA,IAC/F,EACC,MAAM,GAAG,cAAc;AAC1B,eAAW,KAAK;AAAA,MACd;AAAA,MACA,OAAO,IAAI;AAAA,MACX,WAAW,IAAI;AAAA,MACf,QAAQ,IAAI;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW;AAAA,MACX,aAAa;AAAA,MACb;AAAA,MACA,OAAAA;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,kBAAkB,MAAM,OAAO,mBAAmB,IACpD,YAAY,MAAM,OAAO,sBAAsB,MAAM,OAAO,gBAAgB,IAC5E;AACJ,MAAI,eAAe;AACnB,MAAI,kBAAkB;AACtB,aAAW,WAAW,MAAM,cAAc,OAAO,GAAG;AAClD,UAAM,SAAS,CAAC,GAAG,QAAQ,OAAO,CAAC;AACnC,UAAM,cAAc,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC;AAChE,oBAAgB,mBAAmB,MAAM,IAAI;AAC7C,uBAAmB;AAAA,EACrB;AACA,QAAM,kBAAkB,kBAAkB,IACtC,YAAY,eAAe,eAAe,IAC1C;AACJ,QAAM,OAAO,4BAA4B,MAAM,OAAO,mBAAmB,IACrE,YAAa,MAAM,OAAO,uBAAuB,MAAM,OAAO,mBAAoB,GAAI,IACtF;AAEJ,QAAM,QAAQ,MAAM,OAAO,mBAAmB,IAC1C,YAAY,MAAM,OAAO,uBAAuB,MAAM,OAAO,gBAAgB,IAC7E;AAEJ,QAAM,cAAc,MAAM,OAAO,mBAAmB,IAChD,YAAY,iBAAiB,MAAM,OAAO,gBAAgB,IAC1D;AACJ,QAAM,kBAAkB;AACxB,QAAM,aAAa,CAAC,GAAG,UAAU,EAAE;AAAA,IACjC,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,SAAS,iBAAiB,KAAK,KAAK,MAAM,GAAG;AAAA,EACnF;AAEA,SAAO;AAAA,IACL,eAAe;AAAA,IACf,eAAe,MAAM,iBAAiB;AAAA,IACtC,QAAQ,MAAM;AAAA,IACd,kBAAkB,MAAM,OAAO,mBAAmB,IAC9C,YAAY,gBAAgB,MAAM,OAAO,gBAAgB,IACzD;AAAA,IACJ,yBAAyB,MAAM,OAAO,SAAS,IAC3C,YAAY,uBAAuB,MAAM,OAAO,MAAM,IACtD;AAAA,IACJ,WAAW,MAAM,aAAa,IAAI,YAAY,MAAM,WAAW,MAAM,UAAU,IAAI;AAAA,IACnF;AAAA,IACA;AAAA,IACA,aAAa,MAAM;AAAA,IACnB,eAAe,YAAY,kBAAkB;AAAA,IAC7C;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM;AAAA,EACR;AACF;AAQA,IAAM,cAAc,CAAC,QAA6B,WAAsC;AACtF,aAAW,CAAC,KAAK,KAAK,KAAK,OAAQ,QAAO,IAAI,MAAM,OAAO,IAAI,GAAG,KAAK,KAAK,KAAK;AACnF;AAEA,IAAM,oBAAoB,CAAC,QAAsB,WAA+B;AAC9E,aAAW,OAAO,OAAO,KAAK,OAAO,MAAM,GAA8B;AACvE,WAAO,OAAO,GAAG,KAAK,OAAO,OAAO,GAAG;AAAA,EACzC;AACA,SAAO,cAAc,OAAO;AAC5B,SAAO,YAAY,OAAO;AAC1B,aAAW,CAAC,KAAK,GAAG,KAAK,OAAO,MAAM;AACpC,UAAM,OAAO,eAAe,QAAQ,GAAG;AACvC,eAAW,OAAO,CAAC,SAAS,aAAa,UAAU,cAAc,UAAU,EAAY,MAAK,GAAG,KAAK,IAAI,GAAG;AAC3G,gBAAY,KAAK,YAAY,IAAI,UAAU;AAC3C,gBAAY,KAAK,QAAQ,IAAI,MAAM;AAAA,EACrC;AACA,aAAW,CAAC,MAAM,SAAS,KAAK,OAAO,eAAe;AACpD,QAAI,OAAO,OAAO,cAAc,IAAI,IAAI;AACxC,QAAI,CAAC,KAAM,QAAO,cAAc,IAAI,MAAM,OAAO,oBAAI,IAAI,CAAC;AAC1D,gBAAY,MAAM,SAAS;AAAA,EAC7B;AACF;AAGO,IAAM,sBAAN,MAA0B;AAAA,EACtB,WAAW,oBAAI,IAA+B;AAAA,EAEvD,MAAM,QACJ,SACA,OACwB;AACxB,UAAM,cAAc,EAAE,GAAG,OAAO,QAAQ,CAAC,EAAE;AAC3C,UAAM,WAAW,mBAAmB,WAAW;AAC/C,UAAM,SAAS,oBAAI,IAA0B;AAC7C,eAAW,UAAU,SAAS;AAC5B,UAAI,SAAS,KAAK,SAAS,IAAI,OAAO,IAAI;AAC1C,UAAI,QAAQ,WAAW,OAAO,QAAQ;AACpC,cAAM,SAAS,UAAU,OAAO,OAAO,UAAU,OAAO,OAAO,UAC7D,OAAO,OAAO,MAAM,CAAC,OAAO,UAAU,UAAU,OAAO,OAAO,KAAK,CAAC;AACtE,YAAI,CAAC,OAAQ,UAAS,EAAE,QAAQ,CAAC,GAAG,OAAO,mBAAmB,EAAE,QAAQ,CAAC,EAAE,CAAC,GAAG,QAAQ,oBAAI,IAAI,EAAE;AACjG,cAAMC,SAAQ;AAGd,aAAK,SAAS,OAAO,OAAO,IAAI;AAChC,iBAAS,QAAQA,OAAM,OAAO,QAAQ,QAAQ,OAAO,OAAO,QAAQ,SAAS;AAC3E,gBAAM,QAAQ,OAAO,OAAO,KAAK;AACjC,0BAAgBA,OAAM,OAAO,KAAK;AAClC,UAAAA,OAAM,MAAM,OAAO;AACnB,cAAI,MAAM,OAAO;AACf,gBAAI,QAAQA,OAAM,OAAO,IAAI,MAAM,KAAK;AACxC,gBAAI,CAAC,MAAO,CAAAA,OAAM,OAAO,IAAI,MAAM,OAAO,QAAQ,mBAAmB,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;AACpF,4BAAgB,OAAO,KAAK;AAC5B,kBAAM,OAAO;AAAA,UACf;AACA,eAAK,QAAQ,KAAK,4BAA4B,EAAG,OAAM,YAAY;AAAA,QACrE;AACA,QAAAA,OAAM,SAAS,OAAO;AAAA,MACxB;AACA,YAAM,QAAQ;AACd,WAAK,SAAS,OAAO,OAAO,IAAI;AAChC,WAAK,SAAS,IAAI,OAAO,MAAM,KAAK;AACpC,aAAO,KAAK,SAAS,OAAO,GAAI,MAAK,SAAS,OAAO,KAAK,SAAS,KAAK,EAAE,KAAK,EAAE,KAAM;AACvF,wBAAkB,UAAU,MAAM,KAAK;AACvC,iBAAW,CAAC,MAAM,MAAM,KAAK,MAAM,QAAQ;AACzC,YAAI,QAAQ,OAAO,IAAI,IAAI;AAC3B,YAAI,CAAC,MAAO,QAAO,IAAI,MAAM,QAAQ,mBAAmB,WAAW,CAAC;AACpE,0BAAkB,OAAO,MAAM;AAAA,MACjC;AACA,YAAM,YAAY;AAAA,IACpB;AACA,UAAM,SAAS,gBAAgB,aAAa,QAAQ;AACpD,UAAM,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,OAAO,KAAK,MAAM;AACvG,YAAM,SAAS,gBAAgB,aAAa,KAAK;AACjD,aAAO;AAAA,QAAE;AAAA,QAAO,YAAY,OAAO,OAAO;AAAA,QAAY,kBAAkB,OAAO,OAAO;AAAA,QACpF,WAAW,OAAO,OAAO;AAAA,QAAW,sBAAsB,OAAO,OAAO;AAAA,QACxE,2BAA2B,OAAO,OAAO;AAAA,QAA2B,iBAAiB,OAAO;AAAA,MAAgB;AAAA,IAChH,CAAC;AACD,WAAO,EAAE,GAAG,QAAQ,QAAQ;AAAA,EAC9B;AACF;AAEA,IAAM,cAAc,CAAC,UAAgD;AACnE,QAAM,QAAQ,mBAAmB,KAAK;AACtC,aAAW,SAAS,MAAM,OAAQ,iBAAgB,OAAO,KAAK;AAC9D,SAAO,gBAAgB,OAAO,KAAK;AACrC;AAEO,IAAM,iBAAiB,CAAC,UAA4C;AACzE,QAAM,SAAS,YAAY,KAAK;AAChC,QAAM,SAAS,oBAAI,IAAiC;AACpD,aAAW,eAAe,MAAM,QAAQ;AACtC,QAAI,CAAC,YAAY,MAAO;AACxB,UAAM,QAAQ,OAAO,IAAI,YAAY,KAAK,KAAK,CAAC;AAChD,UAAM,KAAK,WAAW;AACtB,WAAO,IAAI,YAAY,OAAO,KAAK;AAAA,EACrC;AAGA,QAAM,UAAgC,CAAC,GAAG,OAAO,QAAQ,CAAC,EACvD,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,iBAAiB,MAAM,KAAK,CAAC,EACvD,IAAI,CAAC,CAAC,OAAO,MAAM,MAAM;AACxB,UAAM,SAAS,YAAY,EAAE,GAAG,OAAO,OAAO,CAAC;AAC/C,WAAO;AAAA,MACL;AAAA,MACA,YAAY,OAAO,OAAO;AAAA,MAC1B,kBAAkB,OAAO,OAAO;AAAA,MAChC,WAAW,OAAO,OAAO;AAAA,MACzB,sBAAsB,OAAO,OAAO;AAAA,MACpC,2BAA2B,OAAO,OAAO;AAAA,MACzC,iBAAiB,OAAO;AAAA,IAC1B;AAAA,EACF,CAAC;AACH,SAAO,EAAE,GAAG,QAAQ,QAAQ;AAC9B;AAEA,IAAM,cAAc,MAClB,IAAI,QAAQ,CAAC,YAAY,aAAa,OAAO,CAAC;AAEhD,IAAM,0BAA0B;AAEhC,IAAM,mBAAmB,OACvB,UAC+B;AAC/B,QAAM,QAAQ,mBAAmB,KAAK;AACtC,QAAM,YAAY;AAClB,WAAS,QAAQ,GAAG,QAAQ,MAAM,OAAO,QAAQ,SAAS,GAAG;AAC3D,oBAAgB,OAAO,MAAM,OAAO,KAAK,CAAE;AAC3C,SAAK,QAAQ,KAAK,4BAA4B,EAAG,OAAM,YAAY;AAAA,EACrE;AACA,SAAO,gBAAgB,OAAO,KAAK;AACrC;AAKO,IAAM,sBAAsB,OACjC,UAC2B;AAC3B,QAAM,SAAS,MAAM,iBAAiB,KAAK;AAC3C,QAAM,SAAS,oBAAI,IAAiC;AACpD,aAAW,eAAe,MAAM,QAAQ;AACtC,QAAI,CAAC,YAAY,MAAO;AACxB,UAAM,QAAQ,OAAO,IAAI,YAAY,KAAK,KAAK,CAAC;AAChD,UAAM,KAAK,WAAW;AACtB,WAAO,IAAI,YAAY,OAAO,KAAK;AAAA,EACrC;AACA,QAAM,UAAgC,CAAC;AACvC,aAAW,CAAC,OAAO,MAAM,KAAK,CAAC,GAAG,OAAO,QAAQ,CAAC,EAAE;AAAA,IAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MACtE,iBAAiB,MAAM,KAAK;AAAA,EAC9B,GAAG;AACD,UAAM,SAAS,MAAM,iBAAiB,EAAE,GAAG,OAAO,OAAO,CAAC;AAC1D,YAAQ,KAAK;AAAA,MACX;AAAA,MACA,YAAY,OAAO,OAAO;AAAA,MAC1B,kBAAkB,OAAO,OAAO;AAAA,MAChC,WAAW,OAAO,OAAO;AAAA,MACzB,sBAAsB,OAAO,OAAO;AAAA,MACpC,2BAA2B,OAAO,OAAO;AAAA,MACzC,iBAAiB,OAAO;AAAA,IAC1B,CAAC;AAAA,EACH;AACA,SAAO,EAAE,GAAG,QAAQ,QAAQ;AAC9B;;;ACvaA,IAAM,wBAAwB;AAC9B,IAAM,oBAAoB;AAC1B,IAAM,qBAAqB;AAC3B,IAAM,+BAA+B;AACrC,IAAM,0BAA0B;AAChC,IAAM,2BAA2B;AACjC,IAAM,2BAA2B;AACjC,IAAM,uBAAuB;AAC7B,IAAM,sBAAsB;AAC5B,IAAM,yBAAyB;AAExB,IAAM,oCAAoC;AAEjD,IAAM,gBAAgB,CAAC,UACrB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAErE,IAAM,WAAW,CAAC,UAA6C,GAAG,OAAO,KAAK,IAAI,OAAO,KAAK,CAAC;AAE/F,IAAM,mBAAmB,CAAC,WAAyD;AACjF,MAAI,CAAC,cAAc,MAAM,EAAG,QAAO;AACnC,QAAM,aAAa,OAAO;AAC1B,SAAO,cAAc,UAAU,IAAI,aAAa;AAClD;AAEA,IAAM,WAAW,CAAC,OAA0B,UAAsC;AAChF,MAAI,MAAM,SAAS,MAAM,OAAQ,QAAO;AACxC,WAAS,QAAQ,GAAG,QAAQ,MAAM,UAAU,MAAM,QAAQ,SAAS;AACjE,QAAI,UAAU;AACd,aAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,UAAI,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK,GAAG;AACzC,kBAAU;AACV;AAAA,MACF;AAAA,IACF;AACA,QAAI,QAAS,QAAO;AAAA,EACtB;AACA,SAAO;AACT;AAaO,IAAM,2BAA2B,CAAC,UAAmD;AAC1F,QAAM,aAAa,oBAAI,IAA8B;AACrD,aAAW,OAAO,MAAM,OAAO,KAAM,YAAW,IAAI,IAAI,KAAK,GAAG;AAChE,QAAM,eAAe,oBAAI,IAAqB;AAC9C,MAAI,MAAM,SAAS;AACjB,eAAW,UAAU,MAAM,QAAQ,SAAS;AAC1C,mBAAa,IAAI,OAAO,KAAK,OAAO,WAAW;AAAA,IACjD;AAAA,EACF;AAEA,QAAM,YAA+B,CAAC;AACtC,aAAW,UAAU,CAAC,GAAI,MAAM,SAAS,WAAW,CAAC,CAAE,EAAE,KAAK,CAAC,GAAG,MAAM,iBAAiB,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,qBAAqB,GAAG;AACvI,UAAM,OAAO,qBAAqB,OAAO,KAAK,OAAO,WAAW;AAChE,QAAI,KAAM,WAAU,KAAK,EAAE,MAAM,eAAe,KAAK,KAAK,KAAK,kBAAkB,KAAK,kBAAkB,OAAO,KAAK,MAAM,CAAC;AAAA,EAC7H;AAIA,QAAM,eAAe,oBAAI,IAQvB;AACF,QAAM,eAAe,CACnB,KACA,KACA,OACA,SAAS,MACA;AACT,UAAM,KAAK,GAAG,GAAG,KAAS,GAAG;AAC7B,UAAM,QACJ,aAAa,IAAI,EAAE,KACnB;AAAA,MACE;AAAA,MACA;AAAA,MACA,QAAQ,oBAAI,IAAiE;AAAA,MAC7E,OAAO;AAAA,IACT;AACF,UAAM,UAAU,SAAS,KAAK;AAC9B,UAAM,WAAW,MAAM,OAAO,IAAI,OAAO;AACzC,UAAM,OAAO,IAAI,SAAS,EAAE,OAAO,QAAQ,UAAU,SAAS,KAAK,OAAO,CAAC;AAC3E,UAAM,SAAS;AACf,iBAAa,IAAI,IAAI,KAAK;AAAA,EAC5B;AAKA,MAAI,MAAM,mBAAmB;AAC3B,eAAW,eAAe,MAAM,mBAAmB;AACjD,mBAAa,YAAY,KAAK,YAAY,KAAK,YAAY,OAAO,YAAY,SAAS,CAAC;AAAA,IAC1F;AAAA,EACF,OAAO;AACL,eAAW,eAAe,MAAM,QAAQ;AACtC,iBAAW,aAAa,YAAY,YAAY;AAC9C,YAAI,UAAU,IAAI,WAAW,SAAS,EAAG;AACzC,mBAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,UAAU,IAAI,GAAG;AACzD,cAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AACxF;AAAA,UACF;AACA,uBAAa,UAAU,KAAK,KAAK,KAAK;AAAA,QACxC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,qBAAqB,CAAC,GAAG,aAAa,OAAO,CAAC,EACjD,OAAO,CAAC,UAAU,MAAM,SAAS,qBAAqB,EACtD,OAAO,CAAC,UAAU,MAAM,OAAO,QAAQ,KAAK,MAAM,OAAO,QAAQ,iBAAiB,EAClF,IAAI,CAAC,UAAyB;AAC7B,UAAM,SAAS,CAAC,GAAG,MAAM,OAAO,OAAO,CAAC,EAAE;AAAA,MACxC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SAAS,iBAAiB,SAAS,KAAK,KAAK,GAAG,SAAS,MAAM,KAAK,CAAC;AAAA,IAC5F;AACA,WAAO,EAAE,OAAO,QAAQ,UAAU,YAAY,OAAO,CAAC,EAAG,QAAQ,MAAM,KAAK,EAAE;AAAA,EAChF,CAAC,EACA,OAAO,CAAC,cAAc,UAAU,YAAY,kBAAkB;AACjE,QAAM,iBAAiB,mBAAmB,OAAO,CAAC,cAAc;AAC9D,UAAM,SAAS,iBAAiB,aAAa,IAAI,UAAU,MAAM,GAAG,CAAC,IAAI,UAAU,MAAM,GAAG;AAC5F,WAAO,cAAc,MAAM,KAAK,OAAO,SAAS,aAAa,CAAC,MAAM,QAAQ,OAAO,IAAI,KACrF,OAAO,iCAAiC,MAAM;AAAA,EAClD,CAAC;AACD,QAAM,WAAW,CAAC,MAAqB,UACrC,iBAAiB,GAAG,KAAK,MAAM,GAAG,KAAS,KAAK,MAAM,GAAG,IAAI,GAAG,MAAM,MAAM,GAAG,KAAS,MAAM,MAAM,GAAG,EAAE;AAC3G,aAAW,aAAa,eAAe,KAAK,QAAQ,EAAE,MAAM,GAAG,sBAAsB,GAAG;AACtF,cAAU,KAAK;AAAA,MACb,MAAM;AAAA,MACN,KAAK,UAAU,MAAM;AAAA,MACrB,KAAK,UAAU,MAAM;AAAA,MACrB,QAAQ,UAAU,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK;AAAA,MACjD,OAAO,UAAU,MAAM;AAAA,MACvB,UAAU,UAAU,MAAM,OAAO;AAAA,MACjC,UAAU,UAAU;AAAA,IACtB,CAAC;AAAA,EACH;AASA,QAAM,eAAe,IAAI;AAAA,IACvB,MAAM,OAAO,KACV,OAAO,CAAC,QAAQ,IAAI,oBAAoB,4BAA4B,EACpE,IAAI,CAAC,QAAQ,IAAI,GAAG;AAAA,EACzB;AACA,MAAI,aAAa,OAAO,GAAG;AACzB,UAAM,UAAU,oBAAI,IAA4D;AAChF,eAAW,eAAe,MAAM,QAAQ;AACtC,iBAAW,aAAa,YAAY,YAAY;AAC9C,YAAI,CAAC,aAAa,IAAI,UAAU,GAAG,EAAG;AACtC,cAAM,OAAO,OAAO,KAAK,UAAU,IAAI,EAAE,KAAK;AAC9C,cAAM,KAAK,KAAK,KAAK,IAAQ;AAC7B,cAAM,SAAS,QAAQ,IAAI,UAAU,GAAG,KAAK,oBAAI,IAA+C;AAChG,cAAM,UAAU,OAAO,IAAI,EAAE,KAAK,EAAE,MAAM,OAAO,EAAE;AACnD,gBAAQ,SAAS;AACjB,eAAO,IAAI,IAAI,OAAO;AACtB,gBAAQ,IAAI,UAAU,KAAK,MAAM;AAAA,MACnC;AAAA,IACF;AACA,QAAI,gBAAgB;AACpB,eAAW,CAAC,KAAK,MAAM,KAAK,CAAC,GAAG,QAAQ,QAAQ,CAAC,EAAE;AAAA,MAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MACrE,iBAAiB,MAAM,KAAK;AAAA,IAC9B,GAAG;AACD,UAAI,iBAAiB,uBAAwB;AAC7C,YAAM,WAAW,CAAC,GAAG,OAAO,OAAO,CAAC,EACjC,OAAO,CAAC,YAAY,QAAQ,SAAS,uBAAuB,EAC5D;AAAA,QACC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SAAS,iBAAiB,KAAK,KAAK,KAAK,GAAG,GAAG,MAAM,KAAK,KAAK,GAAG,CAAC;AAAA,MAC1F;AACF,YAAM,WAAgD,CAAC;AACvD,iBAAW,WAAW,UAAU;AAC9B,cAAM,OAAO,IAAI,IAAI,QAAQ,IAAI;AACjC,YAAI,SAAS,MAAM,CAAC,cAAc,UAAU,KAAK,MAAM,CAAC,QAAQ,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC,GAAG;AAChF,mBAAS,KAAK,OAAO;AAAA,QACvB;AAAA,MACF;AACA,UAAI,SAAS,UAAU,GAAG;AACxB,yBAAiB;AACjB,cAAM,SAAS,WAAW,IAAI,GAAG;AACjC,kBAAU,KAAK;AAAA,UACb,MAAM;AAAA,UACN;AAAA,UACA,kBAAkB,QAAQ,oBAAoB;AAAA,UAC9C,UAAU,SAAS,MAAM,GAAG,sBAAsB,EAAE,IAAI,CAAC,aAAa;AAAA,YACpE,MAAM,QAAQ;AAAA,YACd,OAAO,QAAQ;AAAA,UACjB,EAAE;AAAA,QACJ,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAQA,QAAM,iBAAiB,oBAAI,IAGzB;AACF,QAAM,wBAAwB,CAAC,MAAyB,cAA4B;AAClF,aACM,SAAS,0BACb,UAAU,KAAK,IAAI,0BAA0B,KAAK,MAAM,GACxD,UACA;AACA,eAAS,QAAQ,GAAG,QAAQ,UAAU,KAAK,QAAQ,SAAS;AAC1D,cAAM,WAAW,KAAK,MAAM,OAAO,QAAQ,MAAM;AACjD,YAAI,IAAI,IAAI,QAAQ,EAAE,SAAS,SAAS,OAAQ;AAChD,cAAM,KAAK,SAAS,KAAK,QAAG;AAC5B,cAAM,QAAQ,eAAe,IAAI,EAAE,KAAK;AAAA,UACtC;AAAA,UACA,aAAa;AAAA,UACb,YAAY,oBAAI,IAAY;AAAA,QAC9B;AACA,cAAM,eAAe;AACrB,cAAM,WAAW,IAAI,SAAS;AAC9B,uBAAe,IAAI,IAAI,KAAK;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AACA,QAAM,OAAO,QAAQ,CAAC,aAAa,cAAc;AAC/C,QAAI,UAAoB,CAAC;AACzB,UAAM,QAAQ,MAAY;AACxB,4BAAsB,SAAS,SAAS;AACxC,gBAAU,CAAC;AAAA,IACb;AACA,eAAW,aAAa,YAAY,YAAY;AAC9C,UACE,UAAU,YAAY,eACtB,UAAU,IAAI,WAAW,SAAS,KAClC,UAAU,IAAI,WAAW,KAAK,GAC9B;AACA,cAAM;AAAA,MACR,OAAO;AACL,gBAAQ,KAAK,UAAU,GAAG;AAAA,MAC5B;AAAA,IACF;AACA,UAAM;AAAA,EACR,CAAC;AACD,QAAM,iBAAiB,CAAC,GAAG,eAAe,OAAO,CAAC,EAC/C;AAAA,IACC,CAAC,UACC,MAAM,eAAe,wBACrB,MAAM,WAAW,QAAQ;AAAA,EAC7B,EACC;AAAA,IACC,CAAC,MAAM,UACL,MAAM,SAAS,SAAS,KAAK,SAAS,UACtC,MAAM,cAAc,KAAK,eACzB,iBAAiB,KAAK,SAAS,KAAK,QAAG,GAAG,MAAM,SAAS,KAAK,QAAG,CAAC;AAAA,EACtE;AACF,QAAM,WAA0D,CAAC;AACjE,aAAW,aAAa,gBAAgB;AACtC,QAAI,SAAS,UAAU,uBAAwB;AAC/C,UAAM,YAAY,SAAS;AAAA,MACzB,CAAC,WACC,SAAS,UAAU,UAAU,OAAO,QAAQ,KAAK,SAAS,OAAO,UAAU,UAAU,QAAQ;AAAA,IACjG;AACA,QAAI,UAAW;AACf,aAAS,KAAK,SAAS;AAAA,EACzB;AACA,aAAW,aAAa,UAAU;AAChC,cAAU,KAAK;AAAA,MACb,MAAM;AAAA,MACN,UAAU,UAAU;AAAA,MACpB,aAAa,UAAU;AAAA,IACzB,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAIO,IAAM,0BAA0B,CACrC,SACA,eAC2B;AAKtB,IAAM,eAAe,CAAC,QAAuB,UAA4C;AAC9F,QAAM,UAAoB,CAAC;AAC3B,MAAI,MAAM,QAAQ,OAAO,OAAO;AAC9B,YAAQ,KAAK,mBAAmB,OAAO,KAAK,WAAM,MAAM,KAAK,EAAE;AAAA,EACjE;AACA,MAAI,MAAM,OAAO,YAAY,OAAO,OAAO,WAAW;AACpD,YAAQ;AAAA,MACN,4BAA4B,OAAO,OAAO,SAAS,WAAM,MAAM,OAAO,SAAS;AAAA,IACjF;AAAA,EACF;AACA,SAAO;AAAA,IACL,QAAQ,QAAQ,WAAW;AAAA,IAC3B,aAAa,OAAO;AAAA,IACpB,YAAY,MAAM;AAAA,IAClB,OAAO,YAAY,MAAM,QAAQ,OAAO,KAAK;AAAA,IAC7C;AAAA,EACF;AACF;;;AC1UA,SAAS,kBAAkB;AAIpB,IAAM,2BAA2B;AACjC,IAAM,sBAAsB;AAC5B,IAAM,wBAAwB;AAC9B,IAAM,qBAAqB;AAsClC,IAAM,YAAY;AAIX,IAAM,sBAAsB,CACjC,gBAEA,GAAG,YAAY,GAAG,GAAG,SAAS,GAAG,YAAY,GAAG,GAAG,SAAS,GAAG,OAAO,YAAY,KAAK,IAAI,OAAO,YAAY,KAAK,CAAC;AAEtH,IAAM,gBAAgB,CAAC,UACrB,GAAG,OAAO,KAAK,IAAI,OAAO,KAAK,CAAC;AAElC,IAAM,eAAe,CAACC,cAAgD;AACpE,QAAM,YAAYA,UAAS,QAAQ,GAAG;AACtC,QAAM,OAAOA,UAAS,MAAM,GAAG,SAAS;AACxC,QAAM,MAAMA,UAAS,MAAM,YAAY,CAAC;AACxC,MAAI,SAAS,SAAU,QAAO,OAAO,GAAG;AACxC,MAAI,SAAS,UAAW,QAAO,QAAQ;AACvC,SAAO;AACT;AAEA,IAAM,gBAAgB,CAAC,aAAqE;AAC1F,QAAM,QAAQ,SAAS,QAAQ,SAAS;AACxC,QAAM,SAAS,SAAS,QAAQ,WAAW,QAAQ,CAAC;AACpD,SAAO;AAAA,IACL,KAAK,SAAS,MAAM,GAAG,KAAK;AAAA,IAC5B,KAAK,SAAS,MAAM,QAAQ,GAAG,MAAM;AAAA,IACrC,UAAU,SAAS,MAAM,SAAS,CAAC;AAAA,EACrC;AACF;AAOA,IAAM,2BAA2B,CAAC,WAAqD;AACrF,QAAM,OAAO,WAAW,QAAQ;AAChC,OAAK,OAAO,GAAG;AACf,MAAI,QAAQ;AACZ,aAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,MAAM,EAAE;AAAA,IAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MACzE,iBAAiB,MAAM,KAAK;AAAA,EAC9B,GAAG;AACD,UAAM,UAAU,KAAK,UAAU,QAAQ;AACvC,UAAM,WAAW,MAAM,KAAK,EAAE,QAAQ,MAAM,GAAG,MAAM,OAAO,EAAE,KAAK,GAAG;AACtE,SAAK,OAAO,QAAQ,WAAW,IAAI,QAAQ,EAAE;AAC7C,YAAQ;AAAA,EACV;AACA,OAAK,OAAO,GAAG;AACf,SAAO,KAAK,OAAO,KAAK;AAC1B;AAEA,IAAM,wBAAwB,CAC5B,iBACuB;AACvB,QAAM,SAAiC,CAAC;AACxC,QAAM,eAAuC,CAAC;AAC9C,aAAW,eAAe,cAAc;AACtC,UAAM,WAAW,oBAAoB,WAAW;AAChD,WAAO,QAAQ,KAAK,OAAO,QAAQ,KAAK,MAAM,YAAY,SAAS;AACnE,iBAAa,QAAQ,KAAK,aAAa,QAAQ,KAAK,KAAK;AAAA,EAC3D;AACA,SAAO,EAAE,QAAQ,QAAQ,yBAAyB,YAAY,EAAE;AAClE;AAKO,IAAM,0BAA0B,CACrC,iBACW,sBAAsB,YAAY,EAAE;AAEjD,IAAM,gCAAgC;AACtC,IAAM,2BAA2B;AAEjC,IAAMC,eAAc,MAClB,IAAI,QAAQ,CAAC,YAAY,aAAa,OAAO,CAAC;AAEhD,IAAM,gCAAgC,OACpC,WACoB;AACpB,QAAM,OAAO,WAAW,QAAQ;AAChC,OAAK,OAAO,GAAG;AACf,MAAI,QAAQ;AACZ,MAAI,YAAY;AAChB,aAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,MAAM,EAAE;AAAA,IAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MACzE,iBAAiB,MAAM,KAAK;AAAA,EAC9B,GAAG;AACD,UAAM,UAAU,KAAK,UAAU,QAAQ;AAGvC,UAAM,YAAY,KAAK,IAAI,GAAG,KAAK,MAAM,SAAU,QAAQ,SAAS,EAAE,CAAC;AACvE,aAAS,YAAY,OAAO,YAAY,KAAI;AAC1C,YAAM,OAAO,KAAK,IAAI,WAAW,WAAW,2BAA2B,SAAS;AAChF,WAAK,OAAO,GAAG,QAAQ,KAAK,GAAG,GAAG,OAAO,GAAI,IAAI,OAAO,GAAI,OAAO,OAAO,CAAC,CAAC,EAAE;AAC9E,cAAQ;AACR,mBAAa;AACb,mBAAa;AACb,UAAI,aAAa,0BAA0B;AACzC,oBAAY;AACZ,cAAMA,aAAY;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AACA,OAAK,OAAO,GAAG;AACf,SAAO,KAAK,OAAO,KAAK;AAC1B;AAEA,IAAM,6BAA6B,OACjC,iBACgC;AAChC,QAAM,SAAiC,CAAC;AACxC,QAAM,eAAuC,CAAC;AAC9C,WAAS,QAAQ,GAAG,QAAQ,aAAa,QAAQ,SAAS,GAAG;AAC3D,UAAM,cAAc,aAAa,KAAK;AACtC,UAAM,WAAW,oBAAoB,WAAW;AAChD,WAAO,QAAQ,KAAK,OAAO,QAAQ,KAAK,MAAM,YAAY,SAAS;AACnE,iBAAa,QAAQ,KAAK,aAAa,QAAQ,KAAK,KAAK;AACzD,SAAK,QAAQ,KAAK,kCAAkC,EAAG,OAAMA,aAAY;AAAA,EAC3E;AACA,SAAO,EAAE,QAAQ,QAAQ,MAAM,8BAA8B,YAAY,EAAE;AAC7E;AAQA,IAAM,kBAAkB,CACtB,SAC8B;AAC9B,QAAM,UAAU,oBAAI,IAA0B;AAC9C,MAAI,CAAC,KAAM,QAAO;AAClB,aAAW,SAAS,KAAK,SAAS;AAChC,UAAM,SAAS,oBAAI,IAAiE;AACpF,eAAW,QAAQ,MAAM,QAAQ;AAC/B,aAAO,IAAI,cAAc,KAAK,KAAK,GAAG,EAAE,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM,CAAC;AAAA,IAChF;AACA,YAAQ,IAAI,GAAG,MAAM,GAAG,GAAG,SAAS,GAAG,MAAM,GAAG,IAAI;AAAA,MAClD,KAAK,MAAM;AAAA,MACX,KAAK,MAAM;AAAA,MACX;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,IAAM,kBAAkB,CACtB,SACA,UACA,WACW;AACX,QAAM,EAAE,KAAK,KAAK,UAAAD,UAAS,IAAI,cAAc,QAAQ;AACrD,QAAM,UAAU,GAAG,GAAG,GAAG,SAAS,GAAG,GAAG;AACxC,MAAI,QAAQ,QAAQ,IAAI,OAAO;AAC/B,MAAI,CAAC,OAAO;AACV,YAAQ,EAAE,KAAK,KAAK,QAAQ,oBAAI,IAAI,EAAE;AACtC,YAAQ,IAAI,SAAS,KAAK;AAAA,EAC5B;AACA,QAAM,UAAU,MAAM,OAAO,IAAIA,SAAQ;AAGzC,QAAM,aAAa,SAAS,SAAS,KAAK;AAC1C,MAAI,YAAY,GAAG;AACjB,UAAM,OAAO,IAAIA,WAAU;AAAA,MACzB,OAAO,SAAS,SAAS,aAAaA,SAAQ;AAAA,MAC9C,OAAO;AAAA,IACT,CAAC;AAAA,EACH,OAAO;AACL,UAAM,OAAO,OAAOA,SAAQ;AAAA,EAC9B;AACA,MAAI,MAAM,OAAO,SAAS,EAAG,SAAQ,OAAO,OAAO;AACnD,SAAO;AACT;AAMA,IAAM,kBAAkB,CAAC,UAA8B;AACrD,SAAO,MAAM,OAAO,OAAO,qBAAqB;AAC9C,QAAI;AACJ,QAAI,aAAa,OAAO;AACxB,eAAW,CAACA,WAAU,IAAI,KAAK,MAAM,QAAQ;AAC3C,UACE,aAAa,UACb,KAAK,QAAQ,cACZ,KAAK,UAAU,cAAc,iBAAiBA,WAAU,QAAQ,IAAI,GACrE;AACA,mBAAWA;AACX,qBAAa,KAAK;AAAA,MACpB;AAAA,IACF;AACA,QAAI,aAAa,OAAW;AAC5B,UAAM,OAAO,OAAO,QAAQ;AAAA,EAC9B;AACF;AAEA,IAAM,gBAAgB,CACpB,SACA,SACA,WACgC;AAAA,EAChC,SAAS;AAAA,EACT,SAAS,CAAC,GAAG,QAAQ,OAAO,CAAC,EAC1B,IAAI,CAAC,WAAW;AAAA,IACf,KAAK,MAAM;AAAA,IACX,KAAK,MAAM;AAAA;AAAA;AAAA,IAGX,OAAO,CAAC,GAAG,MAAM,OAAO,OAAO,CAAC,EAAE,OAAO,CAAC,KAAK,SAAS,MAAM,KAAK,OAAO,CAAC;AAAA,IAC3E,QAAQ,CAAC,GAAG,MAAM,OAAO,OAAO,CAAC,EAC9B,IAAI,CAAC,UAAU,EAAE,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM,EAAE,EACxD;AAAA,MACC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SACnB,iBAAiB,cAAc,KAAK,KAAK,GAAG,cAAc,MAAM,KAAK,CAAC;AAAA,IAC1E;AAAA,EACJ,EAAE,EACD;AAAA,IAAK,CAAC,MAAM,UACX;AAAA,MACE,GAAG,KAAK,GAAG,GAAG,SAAS,GAAG,KAAK,GAAG;AAAA,MAClC,GAAG,MAAM,GAAG,GAAG,SAAS,GAAG,MAAM,GAAG;AAAA,IACtC;AAAA,EACF;AAAA,EACF;AAAA,EACA;AACF;AAOO,IAAM,4BAA4B,CACvC,MACA,YAC0B;AAC1B,QAAM,UAAU,gBAAgB,IAAI;AACpC,QAAM,UAAU,CAAC,GAAI,MAAM,WAAW,CAAC,CAAE;AACzC,QAAM,QAAQ,CAAC,GAAI,MAAM,SAAS,CAAC,CAAE;AACrC,QAAM,WAAW,IAAI,IAAI,KAAK;AAC9B,QAAM,iBAAiB,IAAI,IAAI,QAAQ,IAAI,CAAC,YAAY,QAAQ,MAAM,CAAC;AACvE,MAAI,iBAAiB;AACrB,MAAI,kBAAkB;AACtB,aAAW,UAAU,SAAS;AAC5B,UAAM,EAAE,QAAQ,QAAQ,MAAM,IAAI,OAAO;AACzC,QAAI,SAAS,IAAI,MAAM,KAAK,eAAe,IAAI,MAAM,GAAG;AACtD,yBAAmB;AACnB;AAAA,IACF;AACA,UAAM,gBAAgB,QAAQ,UAAU,CAAC,YAAY,QAAQ,SAAS,OAAO,IAAI;AACjF,UAAM,WAAW,iBAAiB,IAAI,QAAQ,aAAa,IAAI;AAC/D,UAAM,QAAgC,EAAE,GAAG,MAAM;AACjD,QAAI,UAAU;AACZ,iBAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,SAAS,MAAM,GAAG;AAC/D,cAAM,QAAQ,KAAK,MAAM,QAAQ,KAAK,KAAK;AAAA,MAC7C;AAAA,IACF;AACA,UAAM,UAAU,oBAAI,IAAY;AAChC,eAAW,CAAC,UAAU,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG;AACtD,UAAI,WAAW,EAAG;AAClB,cAAQ,IAAI,gBAAgB,SAAS,UAAU,MAAM,CAAC;AAAA,IACxD;AACA,eAAW,WAAW,SAAS;AAC7B,YAAM,QAAQ,QAAQ,IAAI,OAAO;AACjC,UAAI,MAAO,iBAAgB,KAAK;AAAA,IAClC;AACA,UAAM,iBAAiB,EAAE,MAAM,OAAO,MAAM,QAAQ,QAAQ,EAAE,GAAG,MAAM,EAAE;AACzE,QAAI,UAAU;AACZ,cAAQ,aAAa,IAAI;AAAA,IAC3B,OAAO;AACL,cAAQ,KAAK,cAAc;AAC3B,UAAI,QAAQ,SAAS,uBAAuB;AAC1C,cAAM,SAAS,QAAQ,MAAM;AAC7B,YAAI,CAAC,SAAS,IAAI,OAAO,MAAM,GAAG;AAChC,gBAAM,KAAK,OAAO,MAAM;AACxB,mBAAS,IAAI,OAAO,MAAM;AAC1B,iBAAO,MAAM,SAAS,oBAAoB;AACxC,qBAAS,OAAO,MAAM,MAAM,CAAE;AAAA,UAChC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,mBAAe,IAAI,MAAM;AACzB,sBAAkB;AAAA,EACpB;AACA,SAAO;AAAA,IACL,MAAM,cAAc,SAAS,SAAS,KAAK;AAAA,IAC3C;AAAA,IACA;AAAA,EACF;AACF;AAMO,IAAM,yBAAyB,CACpC,MACA,YAC0B;AAAA,EAC1B;AAAA,EACA,QAAQ,IAAI,CAAC,YAAY;AAAA,IACvB,MAAM,OAAO;AAAA,IACb,SAAS,sBAAsB,OAAO,YAAY;AAAA,EACpD,EAAE;AACJ;AAgBA,IAAM,oBAAoB,CACxB,QACA,iBAEA,OAAO,UAAU,aAAa,WAC7B,OAAO,WAAW,KAChB,aAAa,CAAC,MAAM,OAAO,SAAS,aAAa,OAAO,SAAS,CAAC,MAAM,OAAO;AAG7E,IAAM,0BAAN,MAA8B;AAAA,EAC1B,WAAW,oBAAI,IAAqC;AAAA,EAE7D,MAAM,MACJ,MACA,SACgC;AAChC,WAAO,0BAA0B,MAAM,MAAM,KAAK,UAAU,OAAO,CAAC;AAAA,EACtE;AAAA;AAAA,EAGA,MAAM,UAAU,SAAsF;AACpG,UAAM,aAA4C,CAAC;AACnD,eAAW,UAAU,SAAS;AAC5B,UAAI,SAAS,KAAK,SAAS,IAAI,OAAO,IAAI;AAC1C,YAAM,SAAS,WAAW,UAAa,kBAAkB,QAAQ,OAAO,YAAY;AACpF,UAAI,CAAC,UAAU,OAAQ,WAAW,OAAO,aAAa,QAAQ;AAC5D,cAAM,SAAS,SAAS,EAAE,GAAG,OAAQ,OAAO,IAAI,CAAC;AACjD,cAAM,eAAe,SAAS,EAAE,GAAG,OAAQ,aAAa,IAAI,CAAC;AAC7D,cAAM,QAAQ,SAAS,OAAQ,SAAS;AACxC,iBAAS,QAAQ,OAAO,QAAQ,OAAO,aAAa,QAAQ,SAAS;AACnE,gBAAM,cAAc,OAAO,aAAa,KAAK;AAC7C,gBAAM,WAAW,oBAAoB,WAAW;AAChD,iBAAO,QAAQ,KAAK,OAAO,QAAQ,KAAK,MAAM,YAAY,SAAS;AACnE,uBAAa,QAAQ,KAAK,aAAa,QAAQ,KAAK,KAAK;AACzD,eAAK,QAAQ,KAAK,kCAAkC,EAAG,OAAMC,aAAY;AAAA,QAC3E;AACA,cAAM,SAAS,MAAM,8BAA8B,YAAY;AAC/D,iBAAS;AAAA,UACP,QAAQ,OAAO,aAAa;AAAA,UAC5B,OAAO,OAAO,aAAa,CAAC;AAAA,UAC5B,MAAM,OAAO,aAAa,GAAG,EAAE;AAAA,UAC/B;AAAA,UACA;AAAA,UACA,SAAS,EAAE,QAAQ,OAAO;AAAA,QAC5B;AAAA,MACF;AACA,WAAK,SAAS,OAAO,OAAO,IAAI;AAChC,WAAK,SAAS,IAAI,OAAO,MAAM,MAAO;AACtC,aAAO,KAAK,SAAS,OAAO,GAAI,MAAK,SAAS,OAAO,KAAK,SAAS,KAAK,EAAE,KAAK,EAAE,KAAM;AACvF,iBAAW,KAAK,EAAE,MAAM,OAAO,MAAM,SAAS,OAAQ,QAAQ,CAAC;AAC/D,YAAMA,aAAY;AAAA,IACpB;AACA,WAAO;AAAA,EACT;AACF;AAEO,IAAM,8BAA8B,OACzC,MACA,YACmC;AACnC,QAAM,aAA4C,CAAC;AACnD,aAAW,UAAU,SAAS;AAC5B,eAAW,KAAK;AAAA,MACd,MAAM,OAAO;AAAA,MACb,SAAS,MAAM,2BAA2B,OAAO,YAAY;AAAA,IAC/D,CAAC;AAAA,EACH;AACA,QAAMA,aAAY;AAClB,SAAO,0BAA0B,MAAM,UAAU;AACnD;AAKO,IAAM,0BAA0B,CACrC,SAC8B;AAC9B,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,QAAM,eAA0C,CAAC;AACjD,aAAW,SAAS,KAAK,SAAS;AAChC,eAAW,QAAQ,MAAM,QAAQ;AAC/B,mBAAa,KAAK,EAAE,KAAK,MAAM,KAAK,KAAK,MAAM,KAAK,OAAO,KAAK,OAAO,OAAO,KAAK,MAAM,CAAC;AAAA,IAC5F;AAAA,EACF;AACA,SAAO;AACT;;;AC7cA,OAAO,QAAQ;AACf,OAAO,UAAU;AAejB,IAAM,qBAAqB;AAC3B,IAAM,qBAAqB;AAC3B,IAAM,qBAAqB;AAK3B,IAAM,mBAAmB;AACzB,IAAM,4BAA4B;AAClC,IAAM,mBAAmB;AACzB,IAAM,iBAAiB;AAEhB,IAAM,2BAA2B,CAAC,aACvC,KAAK,KAAK,UAAU,UAAU,SAAS;AAEzC,IAAM,WAAW,CAAC,cAA8B,KAAK,KAAK,WAAW,uBAAuB;AAE5F,IAAM,WAAW,CAAC,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAErE,IAAM,YAAY,CAAC,UACjB,SAAS,KAAK,KAAK,OAAO,MAAM,SAAS,WAAW,MAAM,OAAO;AAEnE,IAAM,YAAY,CAAC,WAChB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAAG,MAAM,GAAG,GAAG;AAEvE,IAAM,cAAc,CAAC,UACnB,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU;AAE7E,IAAM,kBAAkB,CAAC,UAAsD;AAC7E,MAAI,CAAC,SAAS,KAAK,KAAK,CAAC,YAAY,MAAM,KAAK,EAAG,QAAO;AAC1D,MAAI,CAAC,OAAO,cAAc,MAAM,KAAK,KAAM,MAAM,QAAmB,EAAG,QAAO;AAC9E,SAAO,EAAE,OAAO,MAAM,OAAO,OAAO,MAAM,MAAgB;AAC5D;AAEA,IAAM,aAAa,CAAC,UAA4D;AAC9E,MAAI,CAAC,SAAS,KAAK,KAAK,OAAO,MAAM,QAAQ,YAAY,CAAC,MAAM,IAAI,KAAK,EAAG,QAAO;AACnF,MAAI,OAAO,MAAM,QAAQ,YAAY,CAAC,MAAM,IAAI,KAAK,EAAG,QAAO;AAI/D,MAAI,CAAC,OAAO,cAAc,MAAM,KAAK,EAAG,QAAO;AAC/C,MAAI,CAAC,MAAM,QAAQ,MAAM,MAAM,KAAK,MAAM,OAAO,SAAS,2BAA2B;AACnF,WAAO;AAAA,EACT;AACA,QAAM,SAAkC,CAAC;AACzC,aAAW,QAAQ,MAAM,QAAQ;AAC/B,UAAM,SAAS,gBAAgB,IAAI;AACnC,QAAI,CAAC,OAAQ,QAAO;AACpB,WAAO,KAAK,MAAM;AAAA,EACpB;AACA,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,QAAQ,QAAQ;AACzB,UAAM,MAAM,GAAG,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,KAAK,CAAC;AACtD,QAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,SAAK,IAAI,GAAG;AAAA,EACd;AACA,QAAM,QAAQ,OAAO,OAAO,CAAC,KAAK,SAAS,MAAM,KAAK,OAAO,CAAC;AAC9D,SAAO,EAAE,KAAK,MAAM,IAAI,KAAK,GAAG,KAAK,MAAM,IAAI,KAAK,GAAG,OAAO,OAAO;AACvE;AAEA,IAAM,sBAAsB,CAAC,UAA0D;AACrF,MAAI,CAAC,SAAS,KAAK,KAAK,OAAO,MAAM,SAAS,YAAY,CAAC,MAAM,KAAK,KAAK,EAAG,QAAO;AACrF,MAAI,OAAO,MAAM,WAAW,YAAY,CAAC,MAAM,OAAO,KAAK,EAAG,QAAO;AACrE,MAAI,CAAC,SAAS,MAAM,MAAM,EAAG,QAAO;AACpC,QAAM,SAAiC,CAAC;AACxC,aAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,MAAM,MAAM,GAAG;AAC5D,QAAI,CAAC,OAAO,cAAc,KAAK,KAAM,QAAmB,EAAG,QAAO;AAClE,WAAO,QAAQ,IAAI;AAAA,EACrB;AACA,SAAO,EAAE,MAAM,MAAM,KAAK,KAAK,GAAG,QAAQ,MAAM,OAAO,KAAK,GAAG,OAAO;AACxE;AAEA,IAAM,gBAAgB,CAAC,UAA2D;AAChF,MAAI,CAAC,SAAS,KAAK,KAAK,MAAM,YAAY,yBAA0B,QAAO;AAC3E,MAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,KAAK,MAAM,QAAQ,SAAS,iBAAkB,QAAO;AACrF,MAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,KAAK,MAAM,QAAQ,SAAS,iBAAkB,QAAO;AACrF,MAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,SAAS,eAAgB,QAAO;AAC/E,MAAI,CAAC,MAAM,MAAM,MAAM,CAAC,WAAW,OAAO,WAAW,YAAY,OAAO,KAAK,CAAC,GAAG;AAC/E,WAAO;AAAA,EACT;AACA,QAAM,UAAyC,CAAC;AAChD,aAAW,SAAS,MAAM,SAAS;AACjC,UAAM,SAAS,WAAW,KAAK;AAC/B,QAAI,CAAC,OAAQ,QAAO;AACpB,YAAQ,KAAK,MAAM;AAAA,EACrB;AACA,QAAM,UAAuC,CAAC;AAC9C,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,WAAW,MAAM,SAAS;AACnC,UAAM,SAAS,oBAAoB,OAAO;AAC1C,QAAI,CAAC,OAAQ,QAAO;AACpB,QAAI,aAAa,IAAI,OAAO,IAAI,EAAG,QAAO;AAC1C,iBAAa,IAAI,OAAO,IAAI;AAC5B,YAAQ,KAAK,MAAM;AAAA,EACrB;AACA,QAAM,YAAY,oBAAI,IAAY;AAClC,aAAW,SAAS,SAAS;AAC3B,UAAM,KAAK,GAAG,MAAM,GAAG,KAAS,MAAM,GAAG;AACzC,QAAI,UAAU,IAAI,EAAE,EAAG,QAAO;AAC9B,cAAU,IAAI,EAAE;AAAA,EAClB;AACA,SAAO;AAAA,IACL,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA,OAAO,MAAM,MAAM,IAAI,CAAC,WAAY,OAAkB,KAAK,CAAC;AAAA,EAC9D;AACF;AAOO,IAAM,sBAAsB,CAAC,aAA4C;AAC9E,QAAM,OAAO,SAAS,yBAAyB,QAAQ,CAAC;AACxD,MAAI;AACJ,MAAI;AACF,UAAM,GAAG,aAAa,MAAM,MAAM;AAAA,EACpC,SAAS,OAAO;AAEd,QAAI,UAAU,KAAK,MAAM,SAAU,QAAO,CAAC;AAC3C,WAAO,EAAE,OAAO,mCAAmC,UAAU,KAAK,CAAC,GAAG;AAAA,EACxE;AACA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,GAAG;AAAA,EACzB,QAAQ;AACN,WAAO,EAAE,OAAO,qCAAqC;AAAA,EACvD;AACA,QAAM,aAAa,cAAc,MAAM;AACvC,MAAI,CAAC,WAAY,QAAO,EAAE,OAAO,8BAA8B;AAC/D,SAAO,EAAE,MAAM,WAAW;AAC5B;AAIA,IAAM,2BAA2B,OAC/B,aACsD;AACtD,QAAM,OAAO,SAAS,yBAAyB,QAAQ,CAAC;AACxD,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,GAAG,SAAS,SAAS,MAAM,MAAM;AAAA,EAC/C,SAAS,OAAO;AACd,QAAI,UAAU,KAAK,MAAM,SAAU,QAAO,CAAC;AAC3C,WAAO,EAAE,OAAO,mCAAmC,UAAU,KAAK,CAAC,GAAG;AAAA,EACxE;AACA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,GAAG;AAAA,EACzB,QAAQ;AACN,WAAO,EAAE,OAAO,qCAAqC;AAAA,EACvD;AACA,QAAM,aAAa,cAAc,MAAM;AACvC,SAAO,aAAa,EAAE,MAAM,YAAY,IAAI,IAAI,EAAE,OAAO,8BAA8B;AACzF;AAEO,IAAM,2BAA2B,OACtC,aACmC;AACnC,QAAM,EAAE,KAAK,MAAM,GAAG,OAAO,IAAI,MAAM,yBAAyB,QAAQ;AACxE,SAAO;AACT;AAOO,IAAM,sBAAsB,CACjC,UACA,SAEA;AAAA,EACE;AAAA,IACE,WAAW,yBAAyB,QAAQ;AAAA,IAC5C,UAAU;AAAA,IACV,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AAAA,EACA,MAAM;AAGJ,UAAM,SAAS,oBAAoB,QAAQ;AAC3C,QAAI,OAAO,MAAO,OAAM,IAAI,MAAM,OAAO,KAAK;AAC9C,UAAM,SAAS,SAAS,yBAAyB,QAAQ,CAAC;AAC1D,UAAM,aAAa,GAAG,KAAK,UAAU,MAAM,MAAM,CAAC,CAAC;AAAA;AACnD,QAAI;AACF,UAAI,GAAG,aAAa,QAAQ,MAAM,MAAM,WAAY,QAAO,EAAE,MAAM,SAAS,MAAM;AAAA,IACpF,QAAQ;AAAA,IAER;AACA,oBAAgB,QAAQ,MAAM,EAAE,OAAO,GAAG,SAAS,MAAM,MAAM,KAAO,SAAS,IAAM,CAAC;AACtF,WAAO,EAAE,MAAM,SAAS,KAAK;AAAA,EAC/B;AACF;AAGF,IAAM,4BAA4B,OAChC,UACA,MACA,YACkC;AAClC,QAAM,SAAS,SAAS,yBAAyB,QAAQ,CAAC;AAC1D,QAAM,aAAa,GAAG,KAAK,UAAU,MAAM,MAAM,CAAC,CAAC;AAAA;AACnD,MAAI,YAAY,QAAW;AACzB,QAAI,YAAY,WAAY,QAAO,EAAE,MAAM,SAAS,MAAM;AAAA,EAC5D,OAAO;AACL,QAAI;AACF,UAAI,MAAM,GAAG,SAAS,SAAS,QAAQ,MAAM,MAAM,YAAY;AAC7D,eAAO,EAAE,MAAM,SAAS,MAAM;AAAA,MAChC;AAAA,IACF,SAAS,OAAO;AACd,UAAI,UAAU,KAAK,MAAM,SAAU,OAAM;AAAA,IAC3C;AAAA,EACF;AAGA,QAAM,qBAAqB,QAAQ,YAAY,EAAE,MAAM,KAAO,SAAS,IAAM,CAAC;AAC9E,SAAO,EAAE,MAAM,SAAS,KAAK;AAC/B;AAQO,IAAM,0CAA0C,OACrD,UACA,eAEA;AAAA,EACE;AAAA,IACE,WAAW,yBAAyB,QAAQ;AAAA,IAC5C,UAAU;AAAA,IACV,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AAAA,EACA,YAAY;AACV,UAAM,SAAS,MAAM,yBAAyB,QAAQ;AACtD,QAAI,OAAO,MAAO,OAAM,IAAI,MAAM,OAAO,KAAK;AAC9C,UAAM,SAAS,0BAA0B,OAAO,MAAM,UAAU;AAChE,QAAI,OAAO,QAAQ,OAAO,mBAAmB,GAAG;AAC9C,aAAO,EAAE,MAAM,OAAO,MAAM,SAAS,MAAM;AAAA,IAC7C;AACA,WAAO,0BAA0B,UAAU,OAAO,MAAM,OAAO,GAAG;AAAA,EACpE;AACF;AAGK,IAAM,6BAA6B,OACxC,UACA,SACA,QAAQ,IAAI,wBAAwB;AAAA;AAAA;AAAA,EAIpC,wCAAwC,UAAU,MAAM,MAAM,UAAU,OAAO,CAAC;AAAA;AAE3E,IAAM,2BAA2B,OACtC,UACA,SAEA;AAAA,EACE;AAAA,IACE,WAAW,yBAAyB,QAAQ;AAAA,IAC5C,UAAU;AAAA,IACV,gBAAgB;AAAA,IAChB,UAAU;AAAA,IACV,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AAAA,EACA,YAAY;AACV,UAAM,SAAS,MAAM,yBAAyB,QAAQ;AACtD,QAAI,OAAO,MAAO,OAAM,IAAI,MAAM,OAAO,KAAK;AAC9C,WAAO,0BAA0B,UAAU,IAAI;AAAA,EACjD;AACF;;;ACnTF,OAAOC,SAAQ;AACf,SAAS,qBAAqB;AAC9B,SAAS,cAAc;;;ACQvB,SAAS,cAAc,YAAY,kBAAkB;AAI9C,IAAM,+BAA+B;AAY5C,IAAM,OAAO;AACb,IAAI,CAAC,gBAAgB,QAClB,YAAsD,SAAS,8BAA8B;AAE9F,OAAK,GAAG,WAAW,CAAC,YAA0C;AAC5D,SAAK,wCAAwC,QAAQ,UAAU,QAAQ,SAAS,EAAE;AAAA,MAChF,CAAC,UAAU,KAAK,YAAY,EAAE,IAAI,QAAQ,IAAI,SAAS,MAAM,QAAQ,CAAsC;AAAA,MAC3G,CAAC,UAAmB,KAAK,YAAY;AAAA,QACnC,IAAI,QAAQ;AAAA,QACZ,OAAO;AAAA,UACL,MAAM,iBAAiB,QAAQ,MAAM,OAAO;AAAA,UAC5C,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,QAChE;AAAA,MACF,CAAsC;AAAA,IACxC;AAAA,EACF,CAAC;AACH;;;AD9BA,IAAM,UAAU;AAQhB,IAAM,aAAa,CAAC,UAAoD;AAEtE,MAAI,MAAM,SAAS,uBAAwB,QAAO,IAAI,qBAAqB,MAAM,OAAO;AACxF,QAAM,UAAU,IAAI,MAAM,MAAM,OAAO;AACvC,UAAQ,OAAO,MAAM;AACrB,SAAO;AACT;AAWO,IAAM,wBAAN,MAA4B;AAAA,EASjC,YAEW,YAAiB,IAAI,IAAI,uBAAuB,YAAY,GAAG,GAC/D,SAAS,SAClB;AAFS;AACA;AAAA,EACR;AAAA,EAZH;AAAA,EACA;AAAA,EACA,UAAU;AAAA,EACV,WAAW;AAAA,EACX,aAAa;AAAA,EACb;AAAA,EACA,SAA2B,QAAQ,QAAQ;AAAA;AAAA,EAS3C,IAAI,YAAqB;AACvB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,OACE,UACA,SACA,OAC+B;AAC/B,UAAM,MAAM,KAAK,OAAO,KAAK,MAAM,KAAK,QAAQ,UAAU,SAAS,KAAK,CAAC;AACzE,SAAK,SAAS,IAAI,MAAM,MAAM,MAAS;AACvC,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,QAAuB;AAC3B,QAAI,KAAK,MAAO,cAAa,KAAK,KAAK;AACvC,SAAK,QAAQ;AACb,UAAM,SAAS,KAAK;AACpB,SAAK,UAAU;AACf,UAAM,QAAQ,UAAU;AAAA,EAC1B;AAAA,EAEA,MAAM,QACJ,UACA,SACA,OAC+B;AAC/B,UAAM,QAAQ,aAAa,EAAE,UAAU,MAAM,2BAA2B,UAAU,SAAS,KAAK,GAAG,QAAQ;AAC3G,QAAI,KAAK,WAAY,QAAO,MAAM;AAClC,QAAI;AACJ,QAAI;AACF,UAAI,CAAC,KAAK,WAAW,KAAK,UAAU,aAAa,WAAW,CAACC,IAAG,WAAW,cAAc,KAAK,SAAS,CAAC,GAAG;AACzG,cAAM,IAAI,MAAM,wCAAwC;AAAA,MAC1D;AACA,eAAS,KAAK,OAAO;AAAA,IACvB,QAAQ;AACN,WAAK,aAAa;AAClB,aAAO,MAAM;AAAA,IACf;AACA,UAAM,YAAY,MAAM,MAAM,UAAU,OAAO;AAC/C,QAAI,KAAK,MAAO,cAAa,KAAK,KAAK;AACvC,SAAK,QAAQ;AACb,WAAO,IAAI;AACX,QAAI;AACF,aAAO,MAAM,IAAI,QAA8B,CAAC,SAAS,WAAW;AAClE,cAAM,KAAK,EAAE,KAAK;AAClB,aAAK,WAAW,EAAE,IAAI,SAAS,OAAO;AACtC,eAAO,YAAY,EAAE,IAAI,UAAU,UAAU,CAAwC;AAAA,MACvF,CAAC;AAAA,IACH,SAAS,OAAO;AACd,UAAI,EAAE,iBAAiB,eAAgB,OAAM;AAG7C,UAAI,KAAK,aAAa,EAAG,MAAK,aAAa;AAC3C,aAAO,MAAM;AAAA,IACf,UAAE;AACA,WAAK,WAAW;AAChB,UAAI,KAAK,YAAY,QAAQ;AAC3B,eAAO,MAAM;AACb,aAAK,QAAQ,WAAW,MAAM,KAAK,KAAK,MAAM,GAAG,KAAK,MAAM;AAC5D,aAAK,MAAM,MAAM;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAAA,EAEA,SAAiB;AACf,QAAI,KAAK,QAAS,QAAO,KAAK;AAC9B,UAAM,SAAS,IAAI,OAAO,KAAK,WAAW;AAAA,MACxC,YAAY,EAAE,MAAM,6BAA6B;AAAA;AAAA,MAEjD,UAAU,QAAQ,SAAS,OAAO,CAAC,OAAO,OAAO,SAC/C,UAAU,kBAAkB,KAAK,QAAQ,CAAC,MAAM,kBAAkB,CAAC,MAAM,WAAW,eAAe,CAAC;AAAA,IACxG,CAAC;AACD,WAAO,MAAM;AACb,SAAK,UAAU;AACf,UAAM,OAAO,CAAC,UAAuB;AACnC,UAAI,KAAK,YAAY,OAAQ;AAC7B,WAAK,UAAU;AACf,WAAK,OAAO,UAAU;AACtB,WAAK,UAAU,OAAO,IAAI,cAAc,MAAM,OAAO,CAAC;AAAA,IACxD;AACA,WAAO,GAAG,WAAW,CAAC,UAAsC;AAC1D,YAAM,UAAU,KAAK;AACrB,UAAI,KAAK,YAAY,UAAU,CAAC,WAAW,OAAO,OAAO,QAAQ,GAAI;AACrE,WAAK;AACL,UAAI,WAAW,MAAO,SAAQ,OAAO,WAAW,MAAM,KAAK,CAAC;AAAA,UACvD,SAAQ,QAAQ,EAAE,SAAS,MAAM,YAAY,KAAK,CAAC;AAAA,IAC1D,CAAC;AACD,WAAO,KAAK,SAAS,IAAI;AACzB,WAAO,KAAK,QAAQ,CAAC,SAAS,KAAK,IAAI,MAAM,wCAAwC,IAAI,GAAG,CAAC,CAAC;AAC9F,WAAO;AAAA,EACT;AACF;AAEA,IAAM,gBAAN,cAA4B,MAAM;AAAA,EACvB,OAAO;AAClB;;;AEzIA,IAAM,qBAAqB;AAc3B,IAAM,2BAA2B,CAAC,WAGF;AAAA,EAC9B,KAAK,MAAM;AAAA,EACX,QAAQ;AAAA,EACR,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,kBAAkB,MAAM;AAAA,EACxB,QAAQ,MAAM;AAAA,EAAC;AACjB;AAKO,IAAM,sBAAsB,OAAO,UAIH;AAGrC,QAAM,UAAU,MAAM,MAAM,SAAS;AAAA,IACnC,EAAE,OAAO,oBAAoB,UAAU,KAAK;AAAA,IAC5C,yBAAyB,KAAK;AAAA,EAChC;AACA,SAAO;AAAA,IACL,SAAS;AAAA,IACT,SAAS,QACN,IAAI,CAAC,YAAY,EAAE,KAAK,OAAO,KAAK,aAAa,OAAO,YAAY,EAAE,EACtE,KAAK,CAAC,MAAM,UAAU,iBAAiB,KAAK,KAAK,MAAM,GAAG,CAAC;AAAA,EAChE;AACF;AAEO,IAAM,qBAAqB,CAAC,YACjC,eAAe,OAAO;AAiBjB,IAAM,uBAAuB,CAClC,YACgC;AAChC,QAAM,UAAU,QAAQ,QACrB,IAAI,CAAC,YAAY,EAAE,KAAK,OAAO,KAAK,SAAS,wBAAwB,OAAO,WAAW,EAAE,EAAE,EAC3F,KAAK,CAAC,MAAM,UAAU,MAAM,UAAU,KAAK,WAAW,iBAAiB,KAAK,KAAK,MAAM,GAAG,CAAC;AAC9F,QAAM,QAAQ,YAAY,QAAQ,OAAO,CAAC,KAAK,UAAU,MAAM,MAAM,SAAS,CAAC,CAAC;AAChF,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,MAAM,QAAQ,SAAS,IAAI,YAAY,QAAQ,QAAQ,MAAM,IAAI;AAAA,EACnE;AACF;;;ACzEO,IAAM,4BAA+C,CAAC,aAAa;AACnE,IAAM,uBAAuB,CAAC,UACnC,yBAAyB,KAAK,EAAE,OAAO,CAAC,aACtC,CAAC,gBAAgB,kBAAkB,eAAe,EAAE,SAAS,SAAS,IAAI,CAAC;AACxE,IAAM,4BAA4B,CAAC,aAAsC;AAC9E,MAAI,SAAS,SAAS,gBAAgB;AACpC,UAAM,SAAS,SAAS,OAAO,MAAM,GAAG,CAAC,EAAE,IAAI,MAAM,EAAE,KAAK,IAAI;AAChE,WAAO,gBAAgB,SAAS,GAAG,IAAI,SAAS,GAAG,KAAK,MAAM,GAAG,SAAS,OAAO,SAAS,IAAI,UAAU,EAAE;AAAA,EAC5G;AACA,MAAI,SAAS,SAAS,iBAAkB,QAAO,kBAAkB,SAAS,GAAG,KAAK,SAAS,SAAS,MAAM;AAC1G,MAAI,SAAS,SAAS,gBAAiB,QAAO,iBAAiB,SAAS,SAAS,KAAK,MAAM,CAAC;AAC7F,SAAO,GAAG,SAAS,IAAI,IAAI,SAAS,GAAG;AACzC;AAmBA,IAAM,gBAAgB,CAAC,YACrB,CAAC,GAAG,QAAQ,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AAChF,IAAM,gBAAgB,CAAC,OAA4B,QAAuB,OAAyB,gBAAgB,SAAgC;AACjJ,QAAM,SAAS,gBAAgB,qBAAqB,EAAE,GAAG,OAAO,OAAO,CAAC,IAAI,CAAC;AAC7E,QAAM,WAAW,MAAM;AACvB,QAAM,UAAU,UAAU,YAAY,4BACpC,SAAS,QAAQ,WAAW,KAAK,SAAS,YAAY,WAAW,KACjE,eAAe,SAAS,kBAAkB,CAAC,CAAC,MAAM,eAAe,KAAK;AACxE,MAAI,WAAY,CAAC,YAAY,MAAM,WAAW,GAAI;AAChD,WAAO,EAAE,QAAQ,aAAa,GAAI,WAAW,EAAE,UAAU,SAAS,IAAI,CAAC,GAAI,QAAQ,WAAW,OAAO;AAAA,EACvG;AACA,QAAM,YAA+B,MAAM,IAAI,CAAC,UAAU;AAAA,IACxD,MAAM;AAAA,IAAe,KAAK,KAAK;AAAA,IAAK,kBAAkB,KAAK;AAAA,IAAkB,OAAO,KAAK;AAAA,EAC3F,EAAE;AAGF,QAAM,OAA0B,EAAE,QAAQ,MAAM,aAAa,OAAO,OAAO,YAAY,OAAO,OAAO,OAAO,GAAG,SAAS,CAAC,EAAE;AAC3H,QAAM,WAAgC;AAAA,IACpC,GAAG,qBAAqB;AAAA,IAAG,gBAAgB;AAAA,IAC3C,SAAS,MAAM,MAAM,GAAG,8BAA8B,EAAE,IAAI,CAAC,UAAU,EAAE,MAAM,eAAe,KAAK,KAAK,KAAK,QAAQ,GAAG,KAAK,MAAM,MAAM,gBAAgB,EAAE;AAAA,IAC3J,MAAM,EAAE,QAAQ,MAAM,aAAa,OAAO,OAAO,YAAY,OAAO,OAAO,SAAS,CAAC,EAAE;AAAA,IACvF,gBAAgB,eAAe,EAAE,SAAS,mBAAmB,MAAM,OAAO,GAAG,MAAM,CAAC;AAAA,EACtF;AACA,SAAO,EAAE,QAAQ,YAAY,UAAU,QAAQ,OAAO,QAAQ,WAAW,CAAC,GAAG,WAAW,GAAG,MAAM,GAAG,KAAK;AAC3G;AAEO,IAAM,4BAAN,MAAgC;AAAA,EAC5B,SAAS,IAAI,oBAAoB;AAAA,EAC1C;AAAA,EAEA,MAAM,QAAQ,OAEqB;AACjC,UAAM,SAAS,mBAAmB,MAAM,OAAO;AAC/C,QAAI,KAAK,QAAQ,WAAW,QAAQ;AAClC,YAAMC,SAA0B,CAAC;AACjC,UAAI,YAAY;AAChB,iBAAW,UAAU,cAAc,MAAM,OAAO,GAAG;AACjD,cAAM,OAAO,qBAAqB,OAAO,KAAK,OAAO,WAAW;AAChE,YAAI,QAAQA,OAAM,SAAS,sBAAuB,CAAAA,OAAM,KAAK,IAAI;AACjE,YAAI,EAAE,YAAY,OAAO,EAAG,OAAM,IAAI,QAAc,CAAC,YAAY,aAAa,OAAO,CAAC;AAAA,MACxF;AACA,WAAK,SAAS,EAAE,QAAQ,OAAAA,OAAM;AAAA,IAChC;AACA,UAAM,QAAQ,KAAK,OAAO;AAC1B,UAAM,SAAS,MAAM,KAAK,OAAO,QAAQ,MAAM,SAAS;AAAA,MACtD,SAAS,MAAM;AAAA,MAAS,GAAI,MAAM,UAAU,EAAE,SAAS,MAAM,QAAQ,IAAI,CAAC;AAAA,MAC1E,eAAe,MAAM,iBAAiB;AAAA,IACxC,CAAC;AAGD,WAAO,cAAc,EAAE,GAAG,OAAO,QAAQ,CAAC,EAAE,GAAG,QAAQ,gBAAgB,KAAK,GAAG,KAAK;AAAA,EACtF;AACF;AAEO,IAAM,wBAAwB,CAAC,UAAsD;AAC1F,QAAM,SAAS,eAAe,EAAE,GAAG,OAAO,eAAe,MAAM,iBAAiB,mBAAmB,MAAM,OAAO,EAAE,CAAC;AACnH,QAAM,QAA0B,CAAC;AACjC,aAAW,UAAU,cAAc,MAAM,OAAO,GAAG;AACjD,UAAM,OAAO,qBAAqB,OAAO,KAAK,OAAO,WAAW;AAChE,QAAI,QAAQ,MAAM,SAAS,sBAAuB,OAAM,KAAK,IAAI;AAAA,EACnE;AACA,SAAO,cAAc,OAAO,QAAQ,KAAK;AAC3C;AACO,IAAM,6BAA6B,OAAO,UAA+D;AAC9G,QAAM,SAAS,MAAM,oBAAoB,EAAE,GAAG,OAAO,eAAe,MAAM,iBAAiB,mBAAmB,MAAM,OAAO,EAAE,CAAC;AAC9H,QAAM,QAA0B,CAAC;AACjC,MAAI,YAAY;AAChB,aAAW,UAAU,cAAc,MAAM,OAAO,GAAG;AACjD,UAAM,OAAO,qBAAqB,OAAO,KAAK,OAAO,WAAW;AAChE,QAAI,QAAQ,MAAM,SAAS,sBAAuB,OAAM,KAAK,IAAI;AACjE,QAAI,EAAE,YAAY,OAAO,EAAG,OAAM,IAAI,QAAc,CAAC,YAAY,aAAa,OAAO,CAAC;AAAA,EACxF;AACA,SAAO,cAAc,OAAO,QAAQ,KAAK;AAC3C;;;ACxHA,IAAM,mBAAmB;AAEzB,IAAM,wBAAwB;AAAA,EAC5B;AAAA,IACE,OAAO;AAAA,IACP,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AAAA,EACA;AAAA,IACE,OAAO;AAAA,IACP,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AACF;AAEO,IAAM,sBAAsB,CAAC,UAA0B,MAAM,QAAQ,gBAAgB;AAErF,IAAM,4BAA4B,MAAgB;AACvD,QAAM,QAAQ,sBAAsB,IAAI,CAAC,SAAS,GAAG,KAAK,KAAK,KAAK,KAAK,OAAO,EAAE;AAClF,QAAM,gBAAgB,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC,SAAS,KAAK,MAAM,CAAC,IAAI;AACtE,SAAO,sBAAsB;AAAA,IAC3B,CAAC,MAAM,UAAU,GAAG,MAAM,KAAK,EAAG,OAAO,aAAa,CAAC,KAAK,KAAK,OAAO;AAAA,EAC1E;AACF;AAEA,IAAM,cAAc,CAAC,QAAgB,UAA0B;AAC7D,MAAI,WAAW,OAAO;AACpB,WAAO,8BAA8B,oBAAoB,MAAM,CAAC;AAAA,EAClE;AACA,MAAI,YAAY;AAChB,SAAO,YAAY,MAAM,OAAO,QAAQ,SAAS,MAAM,MAAM,QAAQ,SAAS,EAAG,cAAa;AAC9F,QAAM,QAAQ,QAAQ;AACtB,QAAM,SAAS,CAAC,UAA0B,MAAM,QAAQ,SAAS;AACjE,QAAM,gBAAgB,OAAO,KAAK,IAAI,KAAK,CAAC;AAC5C,QAAM,gBAAgB,OAAO,aAAa,MAAM,IAC5C,KAAK,IAAI,KAAK,EAAE,cAAc,CAAC,IAC/B;AACJ,SAAO,iBAAiB,QAAQ,IAAI,aAAa,SAAS,IAAI,OAAO,MAAM,CAAC,WAAM,OAAO,KAAK,CAAC,KAAK,QAAQ,IAAI,MAAM,QAAG,GAAG,aAAa;AAC3I;AAEO,IAAM,mBAAmB,CAAC,cAAkD;AACjF,QAAM,aAAa,UAAU,IAAI,CAAC,aAAqB;AACrD,QAAI,SAAS,SAAS,gBAAgB;AACpC,aAAO,KAAK,UAAU;AAAA,QACpB,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,OAAO,KAAK,CAAC;AAAA,MACtD,CAAC;AAAA,IACH;AACA,QAAI,SAAS,SAAS,kBAAkB;AACtC,aAAO,KAAK,UAAU;AAAA,QACpB,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI;AAAA,MACjD,CAAC;AAAA,IACH;AACA,QAAI,SAAS,SAAS,iBAAiB;AACrC,aAAO,KAAK,UAAU,CAAC,SAAS,MAAM,SAAS,QAAQ,CAAC;AAAA,IAC1D;AACA,WAAO,KAAK,UAAU,CAAC,SAAS,MAAM,SAAS,GAAG,CAAC;AAAA,EACrD,CAAC;AACD,aAAW,KAAK;AAChB,SAAO,KAAK,UAAU,UAAU;AAClC;AAEA,IAAM,cAAc,CAAC,MAA+B,UAA0B;AAC5E,QAAM,OAAO,SAAS,iBAClB,qBACA,SAAS,mBACP,iBACA,SAAS,kBACP,oBACA;AACR,SAAO,GAAG,KAAK,IAAI,IAAI,GAAG,UAAU,IAAI,KAAK,GAAG;AAClD;AAEO,IAAM,4BAA4B,CACvC,cACW;AACX,QAAM,SAAS,oBAAI,IAAqC;AACxD,aAAW,YAAY,UAAW,QAAO,IAAI,SAAS,OAAO,OAAO,IAAI,SAAS,IAAI,KAAK,KAAK,CAAC;AAChG,QAAM,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,YAAY,MAAM,KAAK,CAAC,EAAE,KAAK,QAAK;AACjG,SAAO,YAAY,UAAU,MAAM,cAAc,UAAU,WAAW,IAAI,KAAK,GAAG,gBAAgB,UAAU,SAAM,OAAO,KAAK,EAAE;AAClI;AAEO,IAAM,6BAA6B,CAAC,UAK7B;AACZ,QAAM,SAAS,MAAM,cACjB,SAAM,MAAM,WAAW,cAAc,MAAM,gBAAgB,IAAI,KAAK,GAAG,oCACvE;AACJ,SAAO,kDAA+C,MAAM,kBAAkB,CAAC,iEAA2D,YAAY,MAAM,aAAa,MAAM,UAAU,CAAC,6BAA0B,MAAM;AAC5N;;;ACpFA,IAAMC,oBAAmB;AAEzB,IAAMC,YAAW,CAAC,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAI9D,IAAM,8BAA8B,CACzC,OACA,WACuB;AAAA,EACvB,YAAY,MAAM,WAAW,IAAI,CAAC,eAAe;AAAA,IAC/C,KAAK,UAAU;AAAA,IACf,MAAM,UAAU;AAAA,IAChB,SAAS,UAAU;AAAA,IACnB,GAAI,UAAU,iBAAiB,SAAY,EAAE,cAAc,UAAU,aAAa,IAAI,CAAC;AAAA,IACvF,GAAI,UAAU,gBAAgB,EAAE,eAAe,UAAU,cAAc,IAAI,CAAC;AAAA,EAC9E,EAAE;AAAA,EACF,SAAS,MAAM,OAAO,CAAC,KAAKD;AAAA,EAC5B,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAC3B;AAEA,IAAM,sBAAsB;AAC5B,IAAM,mBAAmB;AAMzB,IAAM,kBAAkB,CAAC,WAAwD;AAC/E,MAAI,OAAO,SAAS,gBAAgB;AAClC,UAAME,YAAW,OAAO,OAAO,aAAa,WAAW,OAAO,WAAW;AACzE,UAAMC,WAAU,OAAO,OAAO,YAAY,WAAW,OAAO,UAAU;AACtE,WAAOD,aAAYC,WAAU,GAAGD,SAAQ,IAAIC,QAAO,KAAK;AAAA,EAC1D;AACA,QAAM,UAAUF,UAAS,OAAO,OAAO,IAAI,OAAO,UAAU;AAC5D,MAAI,CAAC,WAAW,QAAQ,SAAS,YAAa,QAAO;AACrD,QAAM,WAAW,OAAO,QAAQ,aAAa,WAAW,QAAQ,WAAW;AAC3E,QAAM,UAAU,OAAO,QAAQ,UAAU,WAAW,QAAQ,QAAQ;AACpE,SAAO,YAAY,UAAU,GAAG,QAAQ,IAAI,OAAO,KAAK;AAC1D;AAaA,IAAM,kBAAkB,CACtB,MACA,UACqC;AACrC,MAAI,SAAS,GAAI,QAAO;AACxB,QAAM,YAAY,KAAK,SAAS,2BAA2B;AAC3D,QAAM,YACJ,CAAC,cAAc,oBAAoB,KAAK,IAAI,KAAK,iBAAiB,KAAK,IAAI;AAC7E,MAAI,CAAC,aAAa,CAAC,UAAW,QAAO;AACrC,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,KAAK,KAAK,CAAC;AAAA,EACjC,QAAQ;AACN,WAAO;AAAA,EACT;AACA,MAAI,CAACA,UAAS,MAAM,EAAG,QAAO;AAC9B,QAAM,QAAQ,gBAAgB,MAAM;AACpC,MAAI,MAAO,OAAM,eAAe;AAChC,MAAI,CAAC,UAAW,QAAO;AACvB,QAAM,UAAUA,UAAS,OAAO,OAAO,IACnC,OAAO,UACPA,UAAS,OAAO,OAAO,KAAKA,UAAS,OAAO,QAAQ,OAAO,IACzD,OAAO,QAAQ,UACf;AACN,SAAOA,UAAS,OAAO,IACnB,EAAE,SAAS,GAAI,MAAM,eAAe,EAAE,OAAO,MAAM,aAAa,IAAI,CAAC,EAAG,IACxE;AACN;AAWA,IAAM,uBAAuB,OAA+B;AAAA,EAC1D,QAAQ,CAAC;AAAA,EACT,mBAAmB,CAAC;AAAA,EACpB,YAAY,CAAC;AACf;AAEA,IAAM,sBAAsB,CAC1B,UACA,WACS;AACT,QAAM,QAAQ,2BAA2B,OAAO,QAAQ,KAAK;AAC7D,MAAI,CAAC,MAAO;AACZ,WAAS,OAAO,KAAK,4BAA4B,OAAO,OAAO,KAAK,CAAC;AACrE,QAAM,SAAS,OAAO,QAAQ;AAC9B,MAAI,CAAC,MAAM,QAAQ,MAAM,EAAG;AAC5B,aAAW,SAAS,QAAQ;AAC1B,QAAI,CAACA,UAAS,KAAK,EAAG;AACtB,UAAM,MAAM,OAAO,MAAM,QAAQ,WAAW,MAAM,MAAM;AACxD,UAAM,OAAOA,UAAS,MAAM,IAAI,IAAI,MAAM,OAAO;AACjD,QAAI,CAAC,OAAO,CAAC,KAAM;AACnB,aAAS,WAAW,KAAK,EAAE,KAAK,KAAK,CAAC;AACtC,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC/C,UAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AACxF,iBAAS,kBAAkB,KAAK,EAAE,KAAK,KAAK,MAAM,CAAC;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AACF;AAEO,IAAM,kCAAkC,CAC7C,UAC2B;AAC3B,QAAM,WAAW,qBAAqB;AACtC,QAAM,QAA0B,CAAC;AACjC,aAAW,QAAQ,OAAO;AACxB,UAAM,SAAS,gBAAgB,MAAM,KAAK;AAC1C,QAAI,OAAQ,qBAAoB,UAAU,MAAM;AAAA,EAClD;AACA,SAAO;AACT;AAOO,IAAM,+BAA+B,OAC1C,OACA,iBACwC;AACxC,QAAM,WAAW,qBAAqB;AACtC,QAAM,QAA0B;AAAA,IAC9B,GAAI,eAAe,EAAE,cAAc,aAAa,IAAI,CAAC;AAAA,EACvD;AACA,mBAAiB,QAAQ,OAAO;AAC9B,UAAM,SAAS,gBAAgB,MAAM,KAAK;AAC1C,QAAI,OAAQ,qBAAoB,UAAU,MAAM;AAAA,EAClD;AACA,SAAO;AAAA,IACL;AAAA,IACA,GAAI,MAAM,eAAe,EAAE,cAAc,MAAM,aAAa,IAAI,CAAC;AAAA,EACnE;AACF;AAEO,IAAM,uCAAuC,OAClD,WACqC,MAAM,6BAA6B,KAAK,GAAG;AAK3E,IAAM,gCAAgC,CAAC,UAC5C,gCAAgC,KAAK,EAAE;AAKlC,IAAM,2CAA2C,CACtD,UAC8B,gCAAgC,KAAK,EAAE;AAKhE,IAAM,oCAAoC,CAC/C,UACuB,gCAAgC,KAAK,EAAE;AAKzD,IAAM,oBAAoB,CAAC,YAChC,QAAQ;AAAA,EAAI,CAAC,WACX,OAAO,SAAS,aACZ,EAAE,MAAM,YAAY,KAAK,OAAO,KAAK,MAAM,OAAO,MAAM,IAAI,OAAO,GAAG,IACtE;AAAA,IACE,MAAM;AAAA,IACN,KAAK,GAAG,OAAO,QAAQ,IAAI,OAAO,EAAE;AAAA,IACpC,MAAM,OAAO;AAAA,IACb,IAAI,OAAO;AAAA,EACb;AACN;AAGK,IAAM,oBAAoB,CAAC,WAAkC,eAAe,MAAM;;;AC7MzF,OAAOG,SAAQ;AACf,OAAOC,WAAU;AACjB,SAAS,uBAAuB;AAoBhC,IAAM,yBAAyB;AAE/B,IAAM,2BAA2B;AACjC,IAAM,2BAA2B;AACjC,IAAM,+BAA+B;AAMrC,IAAM,+BAA+B,KAAK,OAAO;AAkBjD,IAAM,qBAAqB,oBAAI,IAAmC;AAClE,IAAI,0BAA0B;AAM9B,IAAM,eAAe;AACrB,IAAM,aAAa;AACnB,IAAM,eAAe;AACrB,IAAM,oBAAoB;AAC1B,IAAM,iBAAiB;AAEvB,IAAM,6BAA6B,OAAO,aAAsD;AAC9F,MAAI,QAAQ,eAAe,IAAI,SAAS,kBAAkB,UAAU,oBAAoB;AACxF,QAAM,QAAmB,CAAC,SAAS,QAAQ,SAAS,UAAU;AAC9D,MAAI,UAAU;AACd,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,QAAQ,MAAM,IAAI;AACxB,QAAI,OAAO,UAAU,SAAU,UAAS,eAAe,MAAM;AAAA,aACpD,MAAM,QAAQ,KAAK,GAAG;AAC7B,eAAS,eAAe,MAAM,SAAS;AACvC,iBAAW,QAAQ,MAAO,OAAM,KAAK,IAAI;AAAA,IAC3C,WAAW,UAAU,QAAQ,OAAO,UAAU,UAAU;AACtD,YAAM,UAAU,OAAO,QAAQ,KAAK;AACpC,eAAS,eAAe,QAAQ,SAAS,aAAa;AACtD,iBAAW,CAAC,EAAE,IAAI,KAAK,QAAS,OAAM,KAAK,IAAI;AAAA,IACjD,MAAO,UAAS;AAChB,QAAI,EAAE,UAAU,mBAAmB,EAAG,OAAM,IAAI,QAAc,CAAC,YAAY,aAAa,OAAO,CAAC;AAAA,EAClG;AACA,SAAO;AACT;AAEA,IAAM,gBAAgB,OACpB,OACA,OACA,OACiB;AACjB,QAAM,UAAU,IAAI,MAAS,MAAM,MAAM;AACzC,MAAI,SAAS;AACb,QAAM,SAAS,YAA2B;AACxC,eAAS;AACP,YAAM,QAAQ;AACd,UAAI,SAAS,MAAM,OAAQ;AAC3B,cAAQ,KAAK,IAAI,MAAM,GAAG,MAAM,KAAK,CAAE;AAAA,IACzC;AAAA,EACF;AACA,QAAM,QAAQ;AAAA,IACZ,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,OAAO,MAAM,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC;AAAA,EACtE;AACA,SAAO;AACT;AAEA,IAAM,kBAAkB,CAAC,MAA0B,UACjD,MAAM,QAAQ,KAAK,UAClB,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI;AAE9D,IAAM,oBAAoB,OAAO,UAC/B,cAAc,OAAO,0BAA0B,OAAO,SAAS;AAC7D,MAAI,QAAQ;AACZ,MAAI;AACF,aAAS,MAAMC,IAAG,SAAS,KAAK,IAAI,GAAG;AAAA,EACzC,QAAQ;AAAA,EAGR;AACA,SAAO,EAAE,MAAM,MAAM;AACvB,CAAC;AA4BI,IAAM,sBAAsB,CACjC,UACA,KACA,QAAQ,2BACK;AACb,QAAM,MAAM,iBAAiB,KAAK,QAAQ;AAC1C,MAAI,UAAuB,CAAC;AAC5B,MAAI;AACF,cAAUA,IAAG,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,EACvD,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,QAAM,UAAU,QACb,OAAO,CAAC,UAAU,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,QAAQ,CAAC,EACjE,IAAI,CAAC,UAAU;AACd,UAAM,OAAOC,MAAK,KAAK,KAAK,MAAM,IAAI;AACtC,QAAI,QAAQ;AACZ,QAAI;AACF,cAAQD,IAAG,SAAS,IAAI,EAAE;AAAA,IAC5B,QAAQ;AACN,cAAQ;AAAA,IACV;AACA,WAAO,EAAE,MAAM,MAAM;AAAA,EACvB,CAAC;AACH,UAAQ;AAAA,IACN,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,UAAU,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI;AAAA,EAC5F;AACA,SAAO,QAAQ,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AACvE;AAOO,IAAM,sBAAsB,CACjC,UACA,KACA,QAAQ,2BACK;AACb,QAAM,OAAO,gBAAgB,QAAQ;AACrC,MAAI,cAA2B,CAAC;AAChC,MAAI;AACF,kBAAcA,IAAG,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC;AAAA,EAC5D,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,QAAM,WAAW,CACf,MACA,UAEA,MAAM,QAAQ,KAAK,UAClB,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI;AAC9D,QAAM,UAA6C,CAAC;AACpD,QAAM,cAAc,YACjB,OAAO,CAAC,UAAU,MAAM,YAAY,CAAC,EACrC,KAAK,CAAC,MAAM,UAAW,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI,CAAE;AACvF,aAAW,aAAa,aAAa;AACnC,QAAI,UAAuB,CAAC;AAC5B,QAAI;AACF,gBAAUA,IAAG,YAAYC,MAAK,KAAK,MAAM,UAAU,IAAI,GAAG,EAAE,eAAe,KAAK,CAAC;AAAA,IACnF,QAAQ;AACN;AAAA,IACF;AACA,eAAW,SAAS,QAAQ;AAAA,MAC1B,CAAC,cAAc,UAAU,OAAO,KAAK,UAAU,KAAK,SAAS,QAAQ;AAAA,IACvE,GAAG;AACD,YAAM,OAAOA,MAAK,KAAK,MAAM,UAAU,MAAM,MAAM,IAAI;AACvD,UAAI,QAAQ;AACZ,UAAI;AACF,gBAAQD,IAAG,SAAS,IAAI,EAAE;AAAA,MAC5B,QAAQ;AACN,gBAAQ;AAAA,MACV;AACA,cAAQ,KAAK,EAAE,MAAM,MAAM,CAAC;AAAA,IAC9B;AAAA,EACF;AACA,UAAQ,KAAK,QAAQ;AACrB,QAAM,SAAS,KAAK,IAAI,GAAG,KAAK;AAChC,MAAI,WAAW,QAAQ,MAAM,GAAG,MAAM;AACtC,MAAI,KAAK;AACP,UAAM,UAAU,oBAAoB,UAAU,KAAK,CAAC,EAAE,CAAC;AACvD,QAAI,YAAY,UAAa,CAAC,SAAS,KAAK,CAAC,UAAU,MAAM,SAAS,OAAO,GAAG;AAC9E,YAAM,OAAO,CAAC,GAAG,QAAQ;AACzB,UAAI,KAAK,UAAU,OAAQ,MAAK,SAAS,SAAS;AAClD,UAAI,QAAQ;AACZ,UAAI;AACF,gBAAQA,IAAG,SAAS,OAAO,EAAE;AAAA,MAC/B,QAAQ;AACN,gBAAQ;AAAA,MACV;AACA,WAAK,KAAK,EAAE,MAAM,SAAS,MAAM,CAAC;AAClC,WAAK,KAAK,QAAQ;AAClB,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO,SAAS,IAAI,CAAC,UAAU,MAAM,IAAI;AAC3C;AAEO,IAAM,2BAA2B,OACtC,UACA,KACA,QAAQ,2BACc;AACtB,QAAM,MAAM,iBAAiB,KAAK,QAAQ;AAC1C,MAAI;AACJ,MAAI;AACF,cAAU,MAAMA,IAAG,SAAS,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,EAClE,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,QAAM,QAAQ,QACX,OAAO,CAAC,UAAU,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,QAAQ,CAAC,EACjE,IAAI,CAAC,UAAUC,MAAK,KAAK,KAAK,MAAM,IAAI,CAAC;AAC5C,QAAM,UAAU,MAAM,kBAAkB,KAAK;AAC7C,UAAQ,KAAK,eAAe;AAC5B,SAAO,QAAQ,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AACvE;AAEO,IAAM,2BAA2B,OACtC,UACA,KACA,QAAQ,2BACc;AACtB,QAAM,OAAO,gBAAgB,QAAQ;AACrC,MAAI;AACJ,MAAI;AACF,kBAAc,MAAMD,IAAG,SAAS,QAAQ,MAAM,EAAE,eAAe,KAAK,CAAC;AAAA,EACvE,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,QAAM,cAAc,YACjB,OAAO,CAAC,UAAU,MAAM,YAAY,CAAC,EACrC,KAAK,CAAC,MAAM,UAAW,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI,CAAE;AACvF,QAAM,mBAAmB,MAAM;AAAA,IAC7B;AAAA,IACA;AAAA,IACA,OAAO,cAAiC;AACtC,YAAM,MAAMC,MAAK,KAAK,MAAM,UAAU,IAAI;AAC1C,UAAI;AACF,gBAAQ,MAAMD,IAAG,SAAS,QAAQ,KAAK,EAAE,eAAe,KAAK,CAAC,GAC3D,OAAO,CAAC,UAAU,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,QAAQ,CAAC,EACjE,IAAI,CAAC,UAAUC,MAAK,KAAK,KAAK,MAAM,IAAI,CAAC;AAAA,MAC9C,QAAQ;AACN,eAAO,CAAC;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,QAAM,UAAU,MAAM,kBAAkB,iBAAiB,KAAK,CAAC;AAC/D,UAAQ,KAAK,eAAe;AAC5B,QAAM,SAAS,KAAK,IAAI,GAAG,KAAK;AAChC,MAAI,WAAW,QAAQ,MAAM,GAAG,MAAM;AACtC,MAAI,KAAK;AACP,UAAM,WAAW,MAAM,yBAAyB,UAAU,KAAK,CAAC,GAAG,CAAC;AACpE,QAAI,YAAY,UAAa,CAAC,SAAS,KAAK,CAAC,UAAU,MAAM,SAAS,OAAO,GAAG;AAC9E,YAAM,OAAO,CAAC,GAAG,QAAQ;AACzB,UAAI,KAAK,UAAU,OAAQ,MAAK,SAAS,SAAS;AAClD,YAAM,CAAC,cAAc,IAAI,MAAM,kBAAkB,CAAC,OAAO,CAAC;AAC1D,UAAI,eAAgB,MAAK,KAAK,cAAc;AAC5C,WAAK,KAAK,eAAe;AACzB,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO,SAAS,IAAI,CAAC,UAAU,MAAM,IAAI;AAC3C;AAEA,IAAM,wBAAwB,CAC5B,OACA,aACwB;AACxB,QAAM,gBAAgB,CAAC,GAAG,QAAQ,EAAE,QAAQ;AAC5C,QAAM,cAAc,oBAAI,IAAkE;AAC1F,aAAW,WAAW,eAAe;AACnC,eAAW,SAAS,QAAQ,OAAO,SAAS;AAC1C,YAAM,QAAQ,YAAY,IAAI,MAAM,KAAK,KAAK,EAAE,YAAY,CAAC,GAAG,QAAQ,MAAM;AAC9E,YAAM,WAAW,KAAK,MAAM,eAAe;AAC3C,YAAM,SAAS;AACf,kBAAY,IAAI,MAAM,OAAO,KAAK;AAAA,IACpC;AAAA,EACF;AACA,QAAM,SAA8B,CAAC,GAAG,YAAY,QAAQ,CAAC,EAC1D,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,iBAAiB,MAAM,KAAK,CAAC,EACvD,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO;AAAA,IACxB;AAAA,IACA,UAAU,MAAM,WAAW;AAAA,IAC3B,uBAAuB,MAAM,OAAO;AAAA,IACpC,iBAAiB,gBAAgB,MAAM,UAAU,EAAE;AAAA,IACnD,uBAAuB,MAAM,OAAO;AAAA,EACtC,EAAE;AACJ,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,GAAI,SAAS,SAAS,IAAI,EAAE,QAAQ,SAAS,CAAC,EAAG,OAAO,IAAI,CAAC;AAAA,IAC7D,OAAO,gBAAgB,cAAc,IAAI,CAAC,YAAY,QAAQ,OAAO,KAAK,CAAC;AAAA,IAC3E;AAAA,EACF;AACF;AAKO,IAAM,uBAAuB,CAAC,UAIV;AACzB,QAAM,WAAiC,CAAC;AACxC,aAAW,QAAQ,MAAM,OAAO;AAC9B,QAAI;AACJ,QAAI;AACF,aAAOD,IAAG,aAAa,MAAM,MAAM;AAAA,IACrC,QAAQ;AACN;AAAA,IACF;AACA,UAAM,SAAS,8BAA8B,KAAK,MAAM,IAAI,CAAC;AAC7D,QAAI,OAAO,WAAW,EAAG;AACzB,UAAM,SAAS,eAAe;AAAA,MAC5B;AAAA,MACA,GAAI,MAAM,UAAU,EAAE,SAAS,MAAM,QAAQ,IAAI,CAAC;AAAA,MAClD,GAAI,MAAM,kBAAkB,SAAY,EAAE,eAAe,MAAM,cAAc,IAAI,CAAC;AAAA,IACpF,CAAC;AACD,QAAI,OAAO,OAAO,eAAe,EAAG;AACpC,aAAS,KAAK,EAAE,MAAM,YAAY,OAAO,OAAO,YAAY,OAAO,CAAC;AAAA,EACtE;AACA,SAAO,sBAAsB,MAAM,OAAO,QAAQ;AACpD;AAOO,IAAM,4BAAN,MAAgC;AAAA,EAGrC,YAAqB,OAAO,0BAA0B;AAAjC;AAAA,EAAkC;AAAA,EAFvD;AAAA,EAIA,MAAM,OAAO,UAAkB,KAAyB,aAAyC;AAC/F,UAAM,SAAS,KAAK;AACpB,QAAI;AACJ,QAAI,UAAU,OAAO,aAAa,YAAY,OAAO,QAAQ,OAAO,KAAK,IAAI,IAAI,OAAO,OAAO;AAC7F,cAAQ,OAAO;AAAA,IACjB,OAAO;AACL,cAAQ,MAAM,KAAK,KAAK,UAAU,GAAG;AAErC,WAAK,UAAU,MAAM,SAAS,IAAI,EAAE,UAAU,KAAK,OAAO,OAAO,KAAK,IAAI,IAAI,IAAO,IAAI;AAAA,IAC3F;AAGA,WAAO,cACH,CAAC,aAAa,GAAG,MAAM,OAAO,CAAC,SAAS,SAAS,WAAW,CAAC,EAAE,MAAM,GAAG,sBAAsB,IAC9F,CAAC,GAAG,KAAK;AAAA,EACf;AACF;AAsBA,IAAM,kBAAkB,OAAO,SAA2D;AACxF,MAAI;AACF,UAAM,QAAQ,MAAMA,IAAG,SAAS,KAAK,IAAI;AACzC,WAAO;AAAA,MACL,MAAM,MAAM;AAAA,MACZ,SAAS,MAAM;AAAA,MACf,KAAK,MAAM;AAAA,MACX,KAAK,MAAM;AAAA,IACb;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,qBAAqB,OACzB,MACA,aACqB;AACrB,MAAI,SAAS,SAAS,EAAG,QAAO;AAChC,MAAI;AACJ,MAAI;AACF,aAAS,MAAMA,IAAG,SAAS,KAAK,MAAM,GAAG;AACzC,UAAM,OAAO,OAAO,YAAY,CAAC;AACjC,UAAM,EAAE,UAAU,IAAI,MAAM,OAAO,KAAK,MAAM,GAAG,GAAG,SAAS,OAAO,CAAC;AACrE,WAAO,cAAc,KAAK,KAAK,CAAC,MAAM;AAAA,EACxC,QAAQ;AACN,WAAO;AAAA,EACT,UAAE;AACA,UAAM,QAAQ,MAAM,EAAE,MAAM,MAAM,MAAS;AAAA,EAC7C;AACF;AAEA,IAAM,mBAAmB,OACvB,MACA,OACA,KACA,iBACoD;AACpD,QAAM,QAAQA,IAAG,iBAAiB,MAAM,EAAE,UAAU,QAAQ,OAAO,IAAI,CAAC;AACxE,QAAM,QAAQ,gBAAgB,EAAE,OAAO,WAAW,SAAS,CAAC;AAC5D,MAAI;AACF,WAAO,MAAM,6BAA6B,OAAO,YAAY;AAAA,EAC/D,UAAE;AACA,UAAM,MAAM;AACZ,UAAM,QAAQ;AAAA,EAChB;AACF;AAEA,IAAM,iBAAiB,CACrB,MACA,cAC2B;AAAA,EAC3B,cAAc,CAAC,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,EAChD,QAAQ,SAAS;AAAA,EACjB,mBAAmB,SAAS;AAAA,EAC5B,YAAY,SAAS;AAAA,EACrB,oBAAoB,CAAC,EAAE,MAAM,cAAc,SAAS,kBAAkB,CAAC;AACzE;AAEA,IAAM,wBAAwB,CAAC,SAAuB;AACpD,QAAM,SAAS,mBAAmB,IAAI,IAAI;AAC1C,MAAI,CAAC,OAAQ;AACb,qBAAmB,OAAO,IAAI;AAC9B,6BAA2B,OAAO;AACpC;AAEA,IAAM,uBAAuB,CAAC,MAAc,WAAwC;AAClF,wBAAsB,IAAI;AAC1B,qBAAmB,IAAI,MAAM,MAAM;AACnC,6BAA2B,OAAO;AAClC,SAAO,mBAAmB,OAAO,8BAA8B;AAC7D,0BAAsB,mBAAmB,KAAK,EAAE,KAAK,EAAE,KAAM;AAAA,EAC/D;AACF;AAKA,IAAM,2BAA2B,MAAY;AAC3C,SACE,mBAAmB,OAAO,0BAC1B,0BAA0B,8BAC1B;AACA,0BAAsB,mBAAmB,KAAK,EAAE,KAAK,EAAE,KAAM;AAAA,EAC/D;AACF;AAGO,IAAM,4BAA4B,OAAyC;AAAA,EAChF,OAAO,mBAAmB;AAAA,EAC1B,OAAO;AACT;AAEA,IAAM,kBAAkB,CACtB,QACA,aACY,OAAO,QAAQ,SAAS,OAAO,OAAO,QAAQ,SAAS;AAErE,IAAM,2BAA2B,OAC/B,SAC+C;AAC/C,QAAM,WAAW,MAAM,gBAAgB,IAAI;AAC3C,MAAI,CAAC,SAAU,QAAO;AACtB,QAAM,SAAS,mBAAmB,IAAI,IAAI;AAC1C,MACE,UACA,gBAAgB,QAAQ,QAAQ,KAChC,OAAO,SAAS,SAAS,QACzB,KAAK,IAAI,OAAO,UAAU,SAAS,OAAO,KAAK,MAC/C;AACA,yBAAqB,MAAM,MAAM;AACjC,WAAO,eAAe,MAAM,OAAO,QAAQ;AAAA,EAC7C;AAEA,QAAM,SACJ,UAAU,gBAAgB,QAAQ,QAAQ,KAAK,SAAS,OAAO,OAAO,OAClE,SACA;AACN,QAAM,QAAQ,SAAS,OAAO,OAAO;AACrC,MAAI;AACJ,MAAI;AACF,WAAO,SAAS,SAAS,QACrB;AAAA,MACE,UAAU,EAAE,QAAQ,CAAC,GAAG,mBAAmB,CAAC,GAAG,YAAY,CAAC,EAAE;AAAA,MAC9D,GAAI,QAAQ,eAAe,EAAE,cAAc,OAAO,aAAa,IAAI,CAAC;AAAA,IACtE,IACA,MAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA,SAAS,OAAO;AAAA,MAChB,QAAQ;AAAA,IACV;AAAA,EACN,QAAQ;AACN,WAAO;AAAA,EACT;AACA,QAAM,WAAmC,SACrC;AAAA,IACE,QAAQ,CAAC,GAAG,OAAO,SAAS,QAAQ,GAAG,KAAK,SAAS,MAAM;AAAA,IAC3D,mBAAmB;AAAA,MACjB,GAAG,OAAO,SAAS;AAAA,MACnB,GAAG,KAAK,SAAS;AAAA,IACnB;AAAA,IACA,YAAY,CAAC,GAAG,OAAO,SAAS,YAAY,GAAG,KAAK,SAAS,UAAU;AAAA,EACzE,IACA,KAAK;AACT,MAAI,MAAM,mBAAmB,MAAM,QAAQ,GAAG;AAC5C,UAAM,SAAS,QAAQ,SAAS,KAAK,MAAM,2BAA2B,KAAK,QAAQ;AACnF,yBAAqB,MAAM;AAAA,MACzB,GAAG;AAAA,MACH,GAAI,KAAK,eAAe,EAAE,cAAc,KAAK,aAAa,IAAI,CAAC;AAAA,MAC/D;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH,OAAO;AACL,0BAAsB,IAAI;AAAA,EAC5B;AACA,SAAO,eAAe,MAAM,QAAQ;AACtC;AAEO,IAAM,6BAA6B,OACxC,OACA,UAAqC,CAAC,MACH;AACnC,QAAM,UAAU,MAAM,cAAc,OAAO,0BAA0B,wBAAwB;AAC7F,2BAAyB;AACzB,QAAM,SAA8B,CAAC;AACrC,QAAM,oBAA+C,CAAC;AACtD,QAAM,aAAiC,CAAC;AACxC,QAAM,qBAAiD,CAAC;AACxD,QAAM,eAAqC,CAAC;AAC5C,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,OAAQ;AAGb,QAAI,CAAC,QAAQ,aAAa;AACxB,iBAAW,SAAS,OAAO,OAAQ,QAAO,KAAK,KAAK;AACpD,iBAAW,eAAe,OAAO,kBAAmB,mBAAkB,KAAK,WAAW;AACtF,iBAAW,QAAQ,OAAO,WAAY,YAAW,KAAK,IAAI;AAAA,IAC5D;AACA,uBAAmB,KAAK,GAAG,OAAO,kBAAkB;AACpD,iBAAa,KAAK,GAAG,OAAO,YAAY;AAAA,EAC1C;AACA,SAAO,EAAE,QAAQ,mBAAmB,YAAY,oBAAoB,aAAa;AACnF;AAEO,IAAM,4BAA4B,OAAO,UAIZ;AAClC,QAAM,UAAU,MAAM;AAAA,IACpB,MAAM;AAAA,IACN;AAAA,IACA;AAAA,EACF;AACA,2BAAyB;AACzB,QAAM,WAAiC,CAAC;AACxC,WAAS,QAAQ,GAAG,QAAQ,MAAM,MAAM,QAAQ,SAAS;AACvD,UAAM,SAAS,QAAQ,KAAK;AAC5B,UAAM,OAAO,MAAM,MAAM,KAAK;AAC9B,QAAI,CAAC,UAAU,CAAC,QAAQ,OAAO,OAAO,WAAW,EAAG;AACpD,UAAM,SAAS,MAAM,oBAAoB;AAAA,MACvC,QAAQ,OAAO;AAAA,MACf,GAAI,MAAM,UAAU,EAAE,SAAS,MAAM,QAAQ,IAAI,CAAC;AAAA,MAClD,GAAI,MAAM,kBAAkB,SAAY,EAAE,eAAe,MAAM,cAAc,IAAI,CAAC;AAAA,IACpF,CAAC;AACD,QAAI,OAAO,OAAO,eAAe,EAAG;AACpC,aAAS,KAAK,EAAE,MAAM,YAAY,OAAO,OAAO,YAAY,OAAO,CAAC;AAAA,EACtE;AACA,SAAO,sBAAsB,MAAM,OAAO,QAAQ;AACpD;AAEO,IAAM,wBAAwB,CACnC,UAC0B;AAC1B,QAAM,SAA8B,CAAC;AACrC,QAAM,oBAA+C,CAAC;AACtD,QAAM,aAAiC,CAAC;AACxC,QAAM,qBAAiD,CAAC;AACxD,QAAM,eAAqC,CAAC;AAC5C,aAAW,QAAQ,OAAO;AACxB,QAAI;AACJ,QAAI;AACF,aAAOA,IAAG,aAAa,MAAM,MAAM;AAAA,IACrC,QAAQ;AACN;AAAA,IACF;AACA,UAAM,WAAW,gCAAgC,KAAK,MAAM,IAAI,CAAC;AACjE,WAAO,KAAK,GAAG,SAAS,MAAM;AAC9B,sBAAkB,KAAK,GAAG,SAAS,iBAAiB;AACpD,eAAW,KAAK,GAAG,SAAS,UAAU;AACtC,uBAAmB,KAAK,EAAE,MAAM,cAAc,SAAS,kBAAkB,CAAC;AAC1E,iBAAa,KAAK,EAAE,MAAM,QAAQ,SAAS,OAAO,CAAC;AAAA,EACrD;AACA,SAAO,EAAE,QAAQ,mBAAmB,YAAY,oBAAoB,aAAa;AACnF;;;ACvpBA,SAAS,aAAa;AAoCtB,IAAM,UAAU,CAAC,QAAiB,SAA2C;AAC3E,MAAI;AAAE,WAAO,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,MAAM,QAAQ,IAAI;AAAA,EAAG,QACnF;AAAE,WAAO;AAAA,EAAO;AACxB;AAEO,IAAM,kBAAkB,CAAC,UAKN;AACxB,QAAM,UAAU,IAAI,IAAI,MAAM,KAAK,QAAQ,IAAI,CAAC,WAAW,CAAC,OAAO,KAAK,OAAO,WAAW,CAAC,CAAC;AAC5F,QAAM,QAAQ,oBAAI,IAA4B;AAC9C,MAAI,MAAM,UAAU,YAAY,0BAA0B;AACxD,eAAW,QAAQ,MAAM,SAAS,kBAAkB,CAAC,GAAG;AACtD,UAAI,qBAAqB,MAAM,QAAQ,IAAI,KAAK,GAAG,CAAC,EAAG,OAAM,IAAI,KAAK,KAAK,IAAI;AAAA,IACjF;AAAA,EACF;AACA,QAAM,SAAS,eAAe,EAAE,QAAQ,MAAM,QAAQ,SAAS,MAAM,MAAM,eAAe,mBAAmB,MAAM,IAAI,EAAE,CAAC;AAC1H,QAAM,SAA6B;AAAA,IACjC,YAAY;AAAA,IAAG,YAAY;AAAA,IAAG,YAAY;AAAA,IAAG,kBAAkB;AAAA,IAC/D,yBAAyB;AAAA,IAAG,uBAAuB;AAAA,IAAG,iBAAiB;AAAA,IACvE,gBAAgB;AAAA,IAAG,iBAAiB;AAAA,IAAG,eAAe;AAAA,IAAG,gBAAgB;AAAA,EAC3E;AACA,QAAM,cAAc,oBAAI,IAAoC;AAC5D,MAAI,oBAAoB;AACxB,QAAM,SAAS,CAAC,KAAa,SAAwC;AACnE,QAAI,IAAI,WAAW,mBAAmB,KAAK,IAAI,WAAW,kBAAkB,EAAG;AAC/E,UAAM,SAAS,QAAQ,IAAI,GAAG;AAC9B,QAAI,WAAW,OAAW;AAC1B,UAAM,OAAO,MAAM,IAAI,GAAG;AAC1B,QAAI,KAAM;AACV,UAAM,SAAS,QAAQ,QAAQ,IAAI;AACnC,UAAM,aAAa,oBAAoB,KAAK,QAAQ,MAAM,IAAI;AAC9D,UAAM,QAAQ,QAAQ,QAAQ,WAAW,IAAI;AAC7C,WAAO;AACP,QAAI,QAAQ;AACV,aAAO;AACP,UAAI,WAAW,SAAS,QAAQ,WAAW,QAAS,QAAO;AAAA,IAC7D;AACA,UAAM,QAAQ,oBAAoB,KAAK,QAAQ,WAAW,MAAM,IAAI;AACpE,QAAI,MAAM,SAAS,WAAW,QAAQ,MAAM,QAAS,QAAO;AAC5D,QAAI;AACJ,QAAI,UAAU,CAAC,OAAO;AAAE,aAAO;AAAkB,mBAAa;AAAA,IAAmB,WACxE,QAAQ;AAAE,aAAO;AAAc,mBAAa;AAAA,IAAe,WAC3D,SAAS,WAAW,SAAS;AAAE,aAAO;AAAoB,mBAAa;AAAA,IAAqB,OAChG;AAAE,aAAO;AAAc,mBAAa;AAAA,IAAe;AACxD,QAAI,eAAe,iBAAiB,eAAe,eAAe;AAChE,YAAM,MAAM,KAAK,UAAU,CAAC,KAAK,UAAU,CAAC;AAC5C,YAAM,QAAQ,YAAY,IAAI,GAAG,KAAK,EAAE,KAAK,YAAY,OAAO,EAAE;AAClE,YAAM;AACN,kBAAY,IAAI,KAAK,KAAK;AAAA,IAC5B;AAAA,EACF;AAGA,QAAM,cAAc,oBAAI,IAAY;AACpC,aAAW,QAAQ,MAAM,cAAc,CAAC,GAAG;AACzC,gBAAY,IAAI,KAAK,GAAG;AACxB,WAAO,KAAK,KAAK,KAAK,IAAI;AAAA,EAC5B;AACA,aAAW,SAAS,MAAM,QAAQ;AAChC,eAAW,aAAa,MAAM,YAAY;AACxC,UAAI,CAAC,YAAY,IAAI,UAAU,GAAG,EAAG,QAAO,UAAU,KAAK,UAAU,IAAI;AAAA,IAC3E;AAAA,EACF;AACA,QAAM,QAAQ,OAAO,iBAAiB,OAAO,wBAAwB,OAAO;AAC5E,SAAO;AAAA,IACL,SAAS,QAAQ,IAAI,WAAW,sBAAsB,IAAI,gBAAgB;AAAA,IAC1E,eAAe,OAAO;AAAA,IAAO,gBAAgB,OAAO;AAAA,IAAO,OAAO;AAAA,IAAG;AAAA,IACrE,aAAa,CAAC,GAAG,YAAY,OAAO,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,iBAAiB,EAAE,KAAK,EAAE,GAAG,KAAK,iBAAiB,EAAE,YAAY,EAAE,UAAU,CAAC;AAAA,EACtI;AACF;",
6
+ "names": ["score", "entry", "valueKey", "yieldToLoop", "fs", "fs", "plans", "DEFAULT_TASK_KEY", "isRecord", "provider", "modelId", "fs", "path", "fs", "path"]
7
+ }
@@ -867,4 +867,4 @@ export {
867
867
  JEV_ACTION_DESCRIPTORS,
868
868
  JevProvider
869
869
  };
870
- //# sourceMappingURL=chunk-FHCT5TCH.js.map
870
+ //# sourceMappingURL=chunk-Q5ICW2VE.js.map
@@ -13,7 +13,7 @@ import {
13
13
  observePiTheme,
14
14
  observedThemeVariant,
15
15
  shikiLanguages
16
- } from "./chunk-QNMQJNXE.js";
16
+ } from "./chunk-X4HDI7RT.js";
17
17
  import {
18
18
  countContentLines,
19
19
  headlineArg,
@@ -2647,4 +2647,4 @@ export {
2647
2647
  formatJsonAsYaml,
2648
2648
  formatFabricValue
2649
2649
  };
2650
- //# sourceMappingURL=chunk-USID2V4D.js.map
2650
+ //# sourceMappingURL=chunk-SVQ7ZHEQ.js.map