@e4779/pi-fabric 0.92.41-fork.6 → 0.96.4-fork.10

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 (300) hide show
  1. package/LAWS.bend +502 -0
  2. package/PROOF.bend +452 -0
  3. package/README.md +5 -1
  4. package/THIRD_PARTY_NOTICES.md +9 -0
  5. package/dist/agents/handoff.d.ts +2 -1
  6. package/dist/agents/handoff.d.ts.map +1 -1
  7. package/dist/agents/manager.d.ts +2 -0
  8. package/dist/agents/manager.d.ts.map +1 -1
  9. package/dist/agents.js +6 -5
  10. package/dist/agents.js.map +1 -1
  11. package/dist/chunks/{chunk-3TXOQ5MG.js → chunk-3CJETB4S.js} +828 -204
  12. package/dist/chunks/chunk-3CJETB4S.js.map +7 -0
  13. package/dist/chunks/{chunk-IUCVOZRX.js → chunk-3SIXBW6A.js} +2 -2
  14. package/dist/chunks/chunk-4E63LJDD.js +468 -0
  15. package/dist/chunks/chunk-4E63LJDD.js.map +7 -0
  16. package/dist/chunks/{chunk-AAHHYDTO.js → chunk-4NF3S3NM.js} +1 -1
  17. package/dist/chunks/{chunk-AAHHYDTO.js.map → chunk-4NF3S3NM.js.map} +2 -2
  18. package/dist/chunks/{chunk-2SWRVIYJ.js → chunk-754HA6KO.js} +2 -2
  19. package/dist/chunks/{chunk-K6DHXXF5.js → chunk-B2IVWASP.js} +2 -2
  20. package/dist/chunks/{chunk-ZDNGXLEC.js → chunk-B4HECUJI.js} +2 -2
  21. package/dist/chunks/{chunk-H6DDV6E2.js → chunk-CSJSHBAT.js} +5 -5
  22. package/dist/chunks/{chunk-MW5VI7IW.js → chunk-D4B4CCTA.js} +2 -2
  23. package/dist/chunks/{chunk-EDL4JDW7.js → chunk-EBWMC3OO.js} +2 -2
  24. package/dist/chunks/{chunk-4NUTVNS2.js → chunk-F72MAIQY.js} +31 -368
  25. package/dist/chunks/chunk-F72MAIQY.js.map +7 -0
  26. package/dist/chunks/{chunk-W3FRE4VI.js → chunk-FDIEQEXS.js} +2 -2
  27. package/dist/chunks/{chunk-7A6NVHB5.js → chunk-FJSHRHOR.js} +7 -4
  28. package/dist/chunks/chunk-FJSHRHOR.js.map +7 -0
  29. package/dist/chunks/{chunk-PSNXUZMY.js → chunk-G2F2RDZI.js} +5 -47
  30. package/dist/chunks/chunk-G2F2RDZI.js.map +7 -0
  31. package/dist/chunks/{chunk-3WIGAX56.js → chunk-JCV54SSP.js} +2 -2
  32. package/dist/chunks/chunk-KS44WKJJ.js +51 -0
  33. package/dist/chunks/chunk-KS44WKJJ.js.map +7 -0
  34. package/dist/chunks/{chunk-3H7SDWZI.js → chunk-LNLQ2LX3.js} +22 -1
  35. package/dist/chunks/chunk-LNLQ2LX3.js.map +7 -0
  36. package/dist/chunks/{chunk-G4LADAYY.js → chunk-OINADFEF.js} +8 -3
  37. package/dist/chunks/chunk-OINADFEF.js.map +7 -0
  38. package/dist/chunks/{chunk-UQ4LTUH4.js → chunk-OUAC6O5C.js} +36 -9
  39. package/dist/chunks/chunk-OUAC6O5C.js.map +7 -0
  40. package/dist/chunks/{chunk-MQG5QKGI.js → chunk-Q5BMTL6A.js} +217 -95
  41. package/dist/chunks/chunk-Q5BMTL6A.js.map +7 -0
  42. package/dist/chunks/{chunk-IK6PPFWG.js → chunk-QFKHAAZA.js} +11 -11
  43. package/dist/chunks/chunk-QFKHAAZA.js.map +7 -0
  44. package/dist/chunks/{chunk-RTXZHKMS.js → chunk-QNMQJNXE.js} +7 -3
  45. package/dist/chunks/chunk-QNMQJNXE.js.map +7 -0
  46. package/dist/chunks/{chunk-U5FYOMG5.js → chunk-UBPFGMDQ.js} +6 -2
  47. package/dist/chunks/chunk-UBPFGMDQ.js.map +7 -0
  48. package/dist/chunks/{chunk-FLKGJPCN.js → chunk-ULQFHZJE.js} +4 -1
  49. package/dist/chunks/chunk-ULQFHZJE.js.map +7 -0
  50. package/dist/chunks/{chunk-7VAZ4N43.js → chunk-V3PIO7QL.js} +2 -2
  51. package/dist/chunks/{chunk-MGDLRV2R.js → chunk-VQGO4P7C.js} +2 -2
  52. package/dist/chunks/{chunk-XT4346N7.js → chunk-WXSELMFV.js} +9 -3
  53. package/dist/chunks/chunk-WXSELMFV.js.map +7 -0
  54. package/dist/chunks/{chunk-D5WKZONW.js → chunk-X3IRR7CV.js} +2 -2
  55. package/dist/chunks/{chunk-IJL3QK3J.js → chunk-Y57UHPIK.js} +1 -1
  56. package/dist/chunks/{chunk-IJL3QK3J.js.map → chunk-Y57UHPIK.js.map} +1 -1
  57. package/dist/chunks/{chunk-RKRVOBVO.js → chunk-YC3QQDZ3.js} +2 -2
  58. package/dist/chunks/{chunk-Q4XJ4PYL.js → chunk-ZRI433JP.js} +299 -83
  59. package/dist/chunks/chunk-ZRI433JP.js.map +7 -0
  60. package/dist/chunks/{chunk-36B4AIRT.js → chunk-ZTXZ6JDO.js} +2 -2
  61. package/dist/commands/fabric.d.ts.map +1 -1
  62. package/dist/compaction/bounds.d.ts +4 -0
  63. package/dist/compaction/bounds.d.ts.map +1 -1
  64. package/dist/compaction/branch-summary.d.ts.map +1 -1
  65. package/dist/compaction/dialogue.d.ts +24 -0
  66. package/dist/compaction/dialogue.d.ts.map +1 -0
  67. package/dist/compaction/hook.d.ts +6 -2
  68. package/dist/compaction/hook.d.ts.map +1 -1
  69. package/dist/compaction/hook.js +6 -5
  70. package/dist/compaction/instructions.d.ts +1 -0
  71. package/dist/compaction/instructions.d.ts.map +1 -1
  72. package/dist/compaction/projections.d.ts +3 -3
  73. package/dist/compaction/projections.d.ts.map +1 -1
  74. package/dist/compaction/qa.d.ts.map +1 -1
  75. package/dist/compaction/render.d.ts +11 -0
  76. package/dist/compaction/render.d.ts.map +1 -1
  77. package/dist/components/configuration.js +2 -3
  78. package/dist/components/effect-policy.d.ts +2 -0
  79. package/dist/components/effect-policy.d.ts.map +1 -1
  80. package/dist/components/effect-scope.d.ts.map +1 -1
  81. package/dist/components/supervisor.d.ts +1 -1
  82. package/dist/components/supervisor.d.ts.map +1 -1
  83. package/dist/core/action-registry.d.ts +14 -2
  84. package/dist/core/action-registry.d.ts.map +1 -1
  85. package/dist/core/action-registry.js +7 -5
  86. package/dist/core/provider-bindings.d.ts +8 -2
  87. package/dist/core/provider-bindings.d.ts.map +1 -1
  88. package/dist/core/provider-operations.d.ts +28 -0
  89. package/dist/core/provider-operations.d.ts.map +1 -0
  90. package/dist/core/provider-operations.js +201 -0
  91. package/dist/core/provider-operations.js.map +7 -0
  92. package/dist/core/shell-inbox.d.ts +13 -0
  93. package/dist/core/shell-inbox.d.ts.map +1 -0
  94. package/dist/core/shell-jobs.d.ts +51 -7
  95. package/dist/core/shell-jobs.d.ts.map +1 -1
  96. package/dist/core/shell-limits.d.ts +3 -0
  97. package/dist/core/shell-limits.d.ts.map +1 -0
  98. package/dist/core/shell-monitor.d.ts +51 -0
  99. package/dist/core/shell-monitor.d.ts.map +1 -0
  100. package/dist/entropy/index.js +8 -7
  101. package/dist/entropy/normal-form.d.ts.map +1 -1
  102. package/dist/execution-service.d.ts +1 -1
  103. package/dist/execution-service.d.ts.map +1 -1
  104. package/dist/fabric-runtime-state.d.ts +1 -1
  105. package/dist/fabric-runtime-state.d.ts.map +1 -1
  106. package/dist/fabric-runtime-state.js +1124 -325
  107. package/dist/fabric-runtime-state.js.map +4 -4
  108. package/dist/index.js +155 -44
  109. package/dist/index.js.map +3 -3
  110. package/dist/jev/observation.js +5 -3
  111. package/dist/jev.d.ts +0 -1
  112. package/dist/jev.d.ts.map +1 -1
  113. package/dist/jev.js +9 -13
  114. package/dist/memory/digest.d.ts.map +1 -1
  115. package/dist/memory/digest.js +2 -1
  116. package/dist/memory/discovery.js +6 -5
  117. package/dist/memory/expand-service.d.ts.map +1 -1
  118. package/dist/memory/file-worker.js +9 -8
  119. package/dist/memory/file-worker.js.map +1 -1
  120. package/dist/memory/index.d.ts.map +1 -1
  121. package/dist/memory/normalize.d.ts.map +1 -1
  122. package/dist/memory/normalize.js +5 -4
  123. package/dist/memory/search.js +7 -6
  124. package/dist/memory/worker-provider.js +10 -9
  125. package/dist/memory.js +9 -8
  126. package/dist/memory.js.map +1 -1
  127. package/dist/mesh/store.d.ts.map +1 -1
  128. package/dist/prewalk/handoff.d.ts +1 -1
  129. package/dist/prewalk/handoff.d.ts.map +1 -1
  130. package/dist/protocol.d.ts +2 -0
  131. package/dist/protocol.d.ts.map +1 -1
  132. package/dist/protocol.js +1 -1
  133. package/dist/providers/jev-provider.d.ts +1 -1
  134. package/dist/providers/jev-provider.d.ts.map +1 -1
  135. package/dist/providers/jev-provider.js +9 -7
  136. package/dist/providers/memory-provider.js +9 -8
  137. package/dist/providers/pi-tools-provider.d.ts.map +1 -1
  138. package/dist/providers/tasks-provider.d.ts +12 -0
  139. package/dist/providers/tasks-provider.d.ts.map +1 -0
  140. package/dist/residency/host.js +10 -9
  141. package/dist/residency/pi-entry.js +10 -9
  142. package/dist/residency/pi-entry.js.map +1 -1
  143. package/dist/runtime/core-override-guest-types.js +2 -2
  144. package/dist/runtime/guest-types.d.ts +1 -1
  145. package/dist/runtime/guest-types.d.ts.map +1 -1
  146. package/dist/runtime/guest-types.js +1 -1
  147. package/dist/runtime/monty-runtime.js +1 -2
  148. package/dist/runtime/monty-runtime.js.map +1 -1
  149. package/dist/runtime/typescript-kernel.js +2 -2
  150. package/dist/runtime-state-builtins.d.ts +1 -1
  151. package/dist/runtime-state-builtins.d.ts.map +1 -1
  152. package/dist/schema/controller.d.ts.map +1 -1
  153. package/dist/state/store.d.ts.map +1 -1
  154. package/dist/ui/controller.d.ts +1 -0
  155. package/dist/ui/controller.d.ts.map +1 -1
  156. package/dist/ui/conversation-targets.js +2 -2
  157. package/dist/ui/conversation.js +7 -7
  158. package/dist/ui/dashboard.js +9 -9
  159. package/dist/ui/highlight.d.ts.map +1 -1
  160. package/dist/ui/languages/bend.d.ts +4 -0
  161. package/dist/ui/languages/bend.d.ts.map +1 -0
  162. package/dist/ui/languages/bend.js +73 -0
  163. package/dist/ui/languages/bend.js.map +7 -0
  164. package/dist/ui/settings.js +1 -2
  165. package/dist/ui/settings.js.map +1 -1
  166. package/dist/ui/shell-hang-keys.d.ts.map +1 -1
  167. package/dist/ui/shell-tasks.d.ts +22 -0
  168. package/dist/ui/shell-tasks.d.ts.map +1 -0
  169. package/dist/ui/shell-tasks.js +161 -0
  170. package/dist/ui/shell-tasks.js.map +7 -0
  171. package/dist/ui/shiki-catalog.d.ts +2 -1
  172. package/dist/ui/shiki-catalog.d.ts.map +1 -1
  173. package/dist/ui/snapshot.d.ts.map +1 -1
  174. package/dist/ui/types.d.ts +1 -0
  175. package/dist/ui/types.d.ts.map +1 -1
  176. package/dist/ui/widget.d.ts.map +1 -1
  177. package/dist/verified/authority.d.ts +17 -0
  178. package/dist/verified/authority.d.ts.map +1 -0
  179. package/dist/verified/generated/authority-kernel.d.ts +10 -0
  180. package/dist/verified/generated/authority-kernel.js +116 -0
  181. package/dist/verified/generated/kernel.d.ts +31 -0
  182. package/dist/verified/generated/kernel.js +351 -0
  183. package/dist/verified/generated/lifecycle-kernel.d.ts +7 -0
  184. package/dist/verified/generated/lifecycle-kernel.js +155 -0
  185. package/dist/verified/generated/manifest.json +54 -0
  186. package/dist/verified/generated/provider-kernel.d.ts +9 -0
  187. package/dist/verified/generated/provider-kernel.js +80 -0
  188. package/dist/verified/generated/storage-kernel.d.ts +11 -0
  189. package/dist/verified/generated/storage-kernel.js +98 -0
  190. package/dist/verified/memory.d.ts +11 -0
  191. package/dist/verified/memory.d.ts.map +1 -0
  192. package/dist/verified/nat.d.ts +2 -0
  193. package/dist/verified/nat.d.ts.map +1 -0
  194. package/dist/verified/policy.d.ts +37 -0
  195. package/dist/verified/policy.d.ts.map +1 -0
  196. package/dist/verified/resources.d.ts +14 -0
  197. package/dist/verified/resources.d.ts.map +1 -0
  198. package/dist/verified/storage.d.ts +32 -0
  199. package/dist/verified/storage.d.ts.map +1 -0
  200. package/dist/worker/event-projection.d.ts +6 -0
  201. package/dist/worker/event-projection.d.ts.map +1 -0
  202. package/dist/worker/event-projection.js +99 -0
  203. package/dist/worker/event-projection.js.map +7 -0
  204. package/dist/worker/recovery-watchdog.d.ts +12 -0
  205. package/dist/worker/recovery-watchdog.d.ts.map +1 -0
  206. package/dist/worker/recovery-watchdog.js +41 -0
  207. package/dist/worker/recovery-watchdog.js.map +7 -0
  208. package/dist/worker.js +80 -22
  209. package/dist/worker.js.map +2 -2
  210. package/docs/agents.md +26 -14
  211. package/docs/architecture.md +1 -1
  212. package/docs/background-tasks.md +140 -0
  213. package/docs/compaction.md +91 -28
  214. package/docs/components.md +5 -1
  215. package/docs/configuration.md +6 -6
  216. package/docs/foreman.md +4 -4
  217. package/docs/harnesses.md +95 -0
  218. package/docs/interface.md +7 -0
  219. package/docs/jev.md +59 -52
  220. package/docs/kernels.md +2 -2
  221. package/docs/licenses/bend-apache-2.0.txt +202 -0
  222. package/docs/memory-recall.md +1 -1
  223. package/docs/programmatic-compaction.md +13 -2
  224. package/docs/provider-capabilities.md +197 -0
  225. package/docs/shell-middleware.md +3 -3
  226. package/docs/skills.md +1 -1
  227. package/docs/verified-kernels.md +278 -0
  228. package/package.json +14 -4
  229. package/proofs/abi.json +308 -0
  230. package/proofs/authority-abi.json +7 -0
  231. package/proofs/authority-kernel.bend +23 -0
  232. package/proofs/authority-proof.bend +74 -0
  233. package/proofs/authority-spec.bend +30 -0
  234. package/proofs/authority-state.bend +43 -0
  235. package/proofs/authority-types.d.ts +3 -0
  236. package/proofs/kernel.bend +139 -0
  237. package/proofs/lifecycle-abi.json +3 -0
  238. package/proofs/lifecycle-kernel.bend +11 -0
  239. package/proofs/lifecycle-proof.bend +249 -0
  240. package/proofs/lifecycle-spec.bend +261 -0
  241. package/proofs/lifecycle-types.d.ts +4 -0
  242. package/proofs/lifecycle.bend +119 -0
  243. package/proofs/provider-abi.json +4 -0
  244. package/proofs/provider-kernel.bend +14 -0
  245. package/proofs/provider-plans.bend +28 -0
  246. package/proofs/provider-spec.bend +14 -0
  247. package/proofs/provider-types.d.ts +5 -0
  248. package/proofs/resource-proof.bend +633 -0
  249. package/proofs/resource-spec.bend +133 -0
  250. package/proofs/resources.bend +160 -0
  251. package/proofs/state-kernel.bend +17 -0
  252. package/proofs/state-plans.bend +40 -0
  253. package/proofs/state-proof.bend +42 -0
  254. package/proofs/state-spec.bend +26 -0
  255. package/proofs/storage-abi.json +3 -0
  256. package/proofs/storage-kernel.bend +11 -0
  257. package/proofs/storage-plans.bend +100 -0
  258. package/proofs/storage-proof.bend +176 -0
  259. package/proofs/storage-spec.bend +70 -0
  260. package/proofs/storage-types.d.ts +8 -0
  261. package/proofs/types.d.ts +7 -0
  262. package/scripts/test-verified-kernels.mjs +107 -0
  263. package/scripts/verified-kernels.mjs +136 -0
  264. package/skillsets/python/fabric-jev/SKILL.md +13 -9
  265. package/skillsets/typescript/fabric-exec/SKILL.md +4 -2
  266. package/skillsets/typescript/fabric-jev/SKILL.md +13 -9
  267. package/dist/chunks/chunk-3H7SDWZI.js.map +0 -7
  268. package/dist/chunks/chunk-3TXOQ5MG.js.map +0 -7
  269. package/dist/chunks/chunk-4NUTVNS2.js.map +0 -7
  270. package/dist/chunks/chunk-77PDIBK2.js +0 -129
  271. package/dist/chunks/chunk-77PDIBK2.js.map +0 -7
  272. package/dist/chunks/chunk-7A6NVHB5.js.map +0 -7
  273. package/dist/chunks/chunk-FLKGJPCN.js.map +0 -7
  274. package/dist/chunks/chunk-G4LADAYY.js.map +0 -7
  275. package/dist/chunks/chunk-IK6PPFWG.js.map +0 -7
  276. package/dist/chunks/chunk-MQG5QKGI.js.map +0 -7
  277. package/dist/chunks/chunk-PSNXUZMY.js.map +0 -7
  278. package/dist/chunks/chunk-Q4XJ4PYL.js.map +0 -7
  279. package/dist/chunks/chunk-RTXZHKMS.js.map +0 -7
  280. package/dist/chunks/chunk-U5FYOMG5.js.map +0 -7
  281. package/dist/chunks/chunk-UQ4LTUH4.js.map +0 -7
  282. package/dist/chunks/chunk-XT4346N7.js.map +0 -7
  283. package/dist/jev/browser.d.ts +0 -37
  284. package/dist/jev/browser.d.ts.map +0 -1
  285. package/dist/jev/browser.js +0 -13
  286. package/dist/jev/browser.js.map +0 -7
  287. /package/dist/chunks/{chunk-IUCVOZRX.js.map → chunk-3SIXBW6A.js.map} +0 -0
  288. /package/dist/chunks/{chunk-2SWRVIYJ.js.map → chunk-754HA6KO.js.map} +0 -0
  289. /package/dist/chunks/{chunk-K6DHXXF5.js.map → chunk-B2IVWASP.js.map} +0 -0
  290. /package/dist/chunks/{chunk-ZDNGXLEC.js.map → chunk-B4HECUJI.js.map} +0 -0
  291. /package/dist/chunks/{chunk-H6DDV6E2.js.map → chunk-CSJSHBAT.js.map} +0 -0
  292. /package/dist/chunks/{chunk-MW5VI7IW.js.map → chunk-D4B4CCTA.js.map} +0 -0
  293. /package/dist/chunks/{chunk-EDL4JDW7.js.map → chunk-EBWMC3OO.js.map} +0 -0
  294. /package/dist/chunks/{chunk-W3FRE4VI.js.map → chunk-FDIEQEXS.js.map} +0 -0
  295. /package/dist/chunks/{chunk-3WIGAX56.js.map → chunk-JCV54SSP.js.map} +0 -0
  296. /package/dist/chunks/{chunk-7VAZ4N43.js.map → chunk-V3PIO7QL.js.map} +0 -0
  297. /package/dist/chunks/{chunk-MGDLRV2R.js.map → chunk-VQGO4P7C.js.map} +0 -0
  298. /package/dist/chunks/{chunk-D5WKZONW.js.map → chunk-X3IRR7CV.js.map} +0 -0
  299. /package/dist/chunks/{chunk-RKRVOBVO.js.map → chunk-YC3QQDZ3.js.map} +0 -0
  300. /package/dist/chunks/{chunk-36B4AIRT.js.map → chunk-ZTXZ6JDO.js.map} +0 -0
@@ -1,7 +0,0 @@
1
- {
2
- "version": 3,
3
- "sources": ["../../src/memory/index.ts", "../../src/memory/lineage.ts", "../../src/memory/regex.ts", "../../src/memory/search.ts"],
4
- "sourcesContent": ["import crypto from \"node:crypto\";\nimport fs from \"node:fs\";\nimport path from \"node:path\";\nimport { foldSessionDigest, type SessionDigest } from \"./digest.js\";\nimport type { SessionRef } from \"./discovery.js\";\nimport type { LiveSessionBranch, MemoryBranches, SessionLineage } from \"./lineage.js\";\nimport { reconstructSessionLineage } from \"./lineage.js\";\nimport type { NormalizedEntry } from \"./normalize.js\";\nimport { DEFAULT_MEMORY_INDEX_PRIVACY, normalizeSession } from \"./normalize.js\";\nimport { compareLexical, lexicalTermCounts, tokenizeLexical } from \"./tokenize.js\";\n\nexport const MEMORY_CACHE_VERSION = 6;\nexport const DEFAULT_HOT_SESSIONS = 50;\nconst DEFAULT_MAX_COLD_VOCABULARY_BYTES = 512 * 1024;\nconst DEFAULT_MAX_COLD_CACHE_BYTES = 1024 * 1024;\nconst DEFAULT_MAX_SYNC_SESSIONS = 10_000;\nconst DEFAULT_MAX_SYNC_SOURCE_BYTES = 512 * 1024 * 1024;\nconst DEFAULT_MAX_CACHE_CLEANUP_FILES = 100_000;\n\ntype MemoryTier = \"hot\" | \"cold\";\n\ninterface CacheRecord {\n cacheVersion: typeof MEMORY_CACHE_VERSION;\n kind: \"shard\" | \"digest\";\n mtime: number;\n size: number;\n sourceHash: string;\n branches: MemoryBranches;\n lineageFingerprint: string;\n policy: string;\n cacheBytes: number;\n cacheSourceRatio: number;\n}\n\nexport interface Shard extends CacheRecord {\n kind: \"shard\";\n sessionFile: string;\n sessionId: string;\n entries: NormalizedEntry[];\n totalEntryCount: number;\n indexCoverage: { complete: boolean; reasons: string[] };\n tier?: MemoryTier;\n indexReason?: string;\n}\n\nexport interface DigestShard extends SessionDigest, CacheRecord {\n kind: \"digest\";\n}\n\nexport interface MemoryIndexOptions {\n indexDir: string;\n maxEntryChars: number;\n hotSessions?: number;\n digestTerms?: number;\n maxColdVocabularyBytes?: number;\n maxColdCacheBytes?: number;\n maxSyncSessions?: number;\n maxSyncSourceBytes?: number;\n maxCacheCleanupFiles?: number;\n branches?: MemoryBranches;\n indexThinking?: boolean;\n indexToolOutput?: boolean;\n liveBranchForFile?: (sessionFile: string) => LiveSessionBranch | undefined;\n}\n\nexport interface EntryRange {\n first: number;\n last: number;\n}\n\nconst cacheBaseName = (sessionFile: string): string => {\n const hash = crypto.createHash(\"sha1\").update(sessionFile).digest(\"hex\").slice(0, 16);\n const safeBase = path.basename(sessionFile).replace(/[^a-zA-Z0-9._-]/g, \"_\");\n return `${hash}-${safeBase}`;\n};\n\nconst cacheModeSuffix = (branches: MemoryBranches): string => branches === \"all\" ? \".all\" : \"\";\n\nexport const shardPathForSession = (\n sessionFile: string,\n indexDir: string,\n branches: MemoryBranches = \"active\",\n): string => path.join(indexDir, `${cacheBaseName(sessionFile)}${cacheModeSuffix(branches)}.json`);\n\nexport const digestPathForSession = (\n sessionFile: string,\n indexDir: string,\n branches: MemoryBranches = \"active\",\n): string => path.join(indexDir, `${cacheBaseName(sessionFile)}${cacheModeSuffix(branches)}.digest.json`);\n\nconst policyPrivacy = (options: MemoryIndexOptions): string =>\n `thinking:${options.indexThinking ?? DEFAULT_MEMORY_INDEX_PRIVACY.indexThinking};tool-output:${options.indexToolOutput ?? DEFAULT_MEMORY_INDEX_PRIVACY.indexToolOutput}`;\nexport const shardPolicy = (options: MemoryIndexOptions, lineage: SessionLineage): string =>\n `entry:${options.maxEntryChars};branches:${lineage.branches};lineage:${lineage.fingerprint};${policyPrivacy(options)}`;\nexport const digestPolicy = (options: MemoryIndexOptions, lineage: SessionLineage): string =>\n `vocab:${options.maxColdVocabularyBytes ?? DEFAULT_MAX_COLD_VOCABULARY_BYTES};cache:${options.maxColdCacheBytes ?? DEFAULT_MAX_COLD_CACHE_BYTES};branches:${lineage.branches};lineage:${lineage.fingerprint};${policyPrivacy(options)}`;\n\nconst resolveLineage = (sessionFile: string, options: MemoryIndexOptions): SessionLineage =>\n reconstructSessionLineage(\n sessionFile,\n options.branches ?? \"active\",\n options.liveBranchForFile?.(sessionFile),\n );\n\nconst normalizationOptions = (options: MemoryIndexOptions, lineage: SessionLineage) => ({\n lineage,\n indexThinking: options.indexThinking ?? DEFAULT_MEMORY_INDEX_PRIVACY.indexThinking,\n indexToolOutput: options.indexToolOutput ?? DEFAULT_MEMORY_INDEX_PRIVACY.indexToolOutput,\n});\n\nconst readShardFile = (\n filePath: string,\n maxBytes = DEFAULT_MAX_SYNC_SOURCE_BYTES,\n): Shard | null => {\n try {\n const stat = fs.statSync(filePath);\n if (!stat.isFile() || stat.size > maxBytes) return null;\n const parsed = JSON.parse(fs.readFileSync(filePath, \"utf8\")) as Shard;\n if (\n parsed.cacheVersion !== MEMORY_CACHE_VERSION ||\n parsed.kind !== \"shard\" ||\n typeof parsed.sessionFile !== \"string\" ||\n typeof parsed.sessionId !== \"string\" ||\n typeof parsed.sourceHash !== \"string\" ||\n parsed.sourceHash.length !== 64 ||\n (parsed.branches !== \"active\" && parsed.branches !== \"all\") ||\n typeof parsed.lineageFingerprint !== \"string\" ||\n parsed.lineageFingerprint.length !== 64 ||\n typeof parsed.policy !== \"string\" ||\n typeof parsed.cacheBytes !== \"number\" ||\n parsed.cacheBytes !== stat.size ||\n typeof parsed.cacheSourceRatio !== \"number\" ||\n typeof parsed.totalEntryCount !== \"number\" ||\n typeof parsed.indexCoverage !== \"object\" ||\n parsed.indexCoverage === null ||\n typeof parsed.indexCoverage.complete !== \"boolean\" ||\n !Array.isArray(parsed.indexCoverage.reasons) ||\n !parsed.indexCoverage.reasons.every((reason) => typeof reason === \"string\") ||\n !Array.isArray(parsed.entries) ||\n !parsed.entries.every((entry) =>\n entry !== null &&\n typeof entry === \"object\" &&\n typeof entry.index === \"number\" &&\n typeof entry.sessionFile === \"string\" &&\n typeof entry.text === \"string\")\n ) return null;\n return parsed;\n } catch {\n return null;\n }\n};\n\nconst readDigestFile = (\n filePath: string,\n maxBytes = DEFAULT_MAX_COLD_CACHE_BYTES,\n): DigestShard | null => {\n try {\n const stat = fs.statSync(filePath);\n if (!stat.isFile() || stat.size > maxBytes) return null;\n const parsed = JSON.parse(fs.readFileSync(filePath, \"utf8\")) as DigestShard;\n if (\n parsed.cacheVersion !== MEMORY_CACHE_VERSION ||\n parsed.kind !== \"digest\" ||\n typeof parsed.sessionId !== \"string\" ||\n typeof parsed.file !== \"string\" ||\n typeof parsed.sourceHash !== \"string\" ||\n parsed.sourceHash.length !== 64 ||\n (parsed.branches !== \"active\" && parsed.branches !== \"all\") ||\n typeof parsed.lineageFingerprint !== \"string\" ||\n parsed.lineageFingerprint.length !== 64 ||\n typeof parsed.policy !== \"string\" ||\n typeof parsed.cacheBytes !== \"number\" ||\n parsed.cacheBytes !== stat.size ||\n typeof parsed.cacheSourceRatio !== \"number\" ||\n !Array.isArray(parsed.filesTouched) ||\n !Array.isArray(parsed.vocabulary) ||\n !parsed.vocabulary.every((term, index) =>\n typeof term === \"string\" && (index === 0 || parsed.vocabulary[index - 1]! < term)) ||\n !Array.isArray(parsed.addresses) ||\n !parsed.addresses.every((address) =>\n Array.isArray(address) &&\n address.length === 10 &&\n typeof address[0] === \"number\" &&\n (address[1] === null || typeof address[1] === \"string\") &&\n (address[2] === null || typeof address[2] === \"string\") &&\n (address[3] === null || typeof address[3] === \"string\") &&\n (address[4] === null || typeof address[4] === \"string\") &&\n (address[5] === null || typeof address[5] === \"number\") &&\n (address[6] === null || typeof address[6] === \"string\") &&\n (address[7] === null || typeof address[7] === \"string\") &&\n (address[8] === null || typeof address[8] === \"string\") &&\n (address[9] === null ||\n address[9] === \"succeeded\" ||\n address[9] === \"failed\" ||\n address[9] === \"aborted\" ||\n address[9] === \"timed_out\")) ||\n typeof parsed.indexCoverage !== \"object\" ||\n parsed.indexCoverage === null ||\n typeof parsed.indexCoverage.complete !== \"boolean\" ||\n typeof parsed.indexCoverage.vocabularyBytes !== \"number\" ||\n !Array.isArray(parsed.indexCoverage.reasons) ||\n !parsed.indexCoverage.reasons.every((reason) => typeof reason === \"string\") ||\n typeof parsed.mtime !== \"number\" ||\n typeof parsed.size !== \"number\"\n ) return null;\n return parsed;\n } catch {\n return null;\n }\n};\n\nconst serializedBytes = (value: unknown): number =>\n Buffer.byteLength(JSON.stringify(value), \"utf8\");\n\nconst applyCacheMetrics = <T extends CacheRecord>(value: T): T => {\n let previous = -1;\n for (let iteration = 0; iteration < 5; iteration += 1) {\n const bytes = serializedBytes(value);\n value.cacheBytes = bytes;\n value.cacheSourceRatio = value.size === 0 ? 0 : Number((bytes / value.size).toFixed(6));\n if (bytes === previous) break;\n previous = bytes;\n }\n value.cacheBytes = serializedBytes(value);\n value.cacheSourceRatio = value.size === 0\n ? 0\n : Number((value.cacheBytes / value.size).toFixed(6));\n return value;\n};\n\nconst writeCacheFile = (filePath: string, value: Shard | DigestShard): boolean => {\n try {\n fs.mkdirSync(path.dirname(filePath), { recursive: true, mode: 0o700 });\n try { fs.chmodSync(path.dirname(filePath), 0o700); } catch {}\n fs.writeFileSync(filePath, JSON.stringify(value), { encoding: \"utf8\", mode: 0o600 });\n try { fs.chmodSync(filePath, 0o600); } catch {}\n return true;\n } catch {\n return false;\n }\n};\n\nconst removeCacheFile = (filePath: string): void => {\n try {\n fs.rmSync(filePath, { force: true, recursive: true });\n } catch {\n // Cache cleanup is best effort.\n }\n};\n\nexport interface SourceState {\n mtime: number;\n size: number;\n sourceHash: string;\n}\n\nexport const fingerprintSource = (file: string): SourceState | null => {\n try {\n const content = fs.readFileSync(file);\n const stat = fs.statSync(file);\n if (!stat.isFile()) return null;\n return {\n mtime: stat.mtimeMs,\n size: stat.size,\n sourceHash: crypto.createHash(\"sha256\").update(content).digest(\"hex\"),\n };\n } catch {\n return null;\n }\n};\n\nconst isCacheFresh = (\n cache: CacheRecord | null,\n state: SourceState,\n policy: string,\n): boolean =>\n cache !== null &&\n cache.mtime === state.mtime &&\n cache.size === state.size &&\n cache.sourceHash === state.sourceHash &&\n cache.policy === policy;\n\nexport const missingShard = (\n ref: SessionRef,\n lineage: SessionLineage,\n reason = \"source_unavailable\",\n): Shard => ({\n cacheVersion: MEMORY_CACHE_VERSION,\n kind: \"shard\",\n sessionFile: ref.file,\n sessionId: ref.id,\n mtime: 0,\n size: 0,\n sourceHash: \"\",\n branches: lineage.branches,\n lineageFingerprint: lineage.fingerprint,\n policy: reason,\n cacheBytes: 0,\n cacheSourceRatio: 0,\n entries: [],\n totalEntryCount: 0,\n indexCoverage: { complete: false, reasons: [reason] },\n tier: \"hot\",\n indexReason: reason,\n});\n\nexport const loadShard = (ref: SessionRef, options: MemoryIndexOptions): Shard => {\n const lineage = resolveLineage(ref.file, options);\n const filePath = shardPathForSession(ref.file, options.indexDir, lineage.branches);\n const state = fingerprintSource(ref.file);\n if (!state) {\n removeCacheFile(filePath);\n return missingShard(ref, lineage);\n }\n const policy = shardPolicy(options, lineage);\n const cached = readShardFile(\n filePath,\n options.maxSyncSourceBytes ?? DEFAULT_MAX_SYNC_SOURCE_BYTES,\n );\n if (isCacheFresh(cached, state, policy) && cached?.sessionFile === ref.file) return cached;\n if (fs.existsSync(filePath)) removeCacheFile(filePath);\n const { entries, header, indexCoverage } = normalizeSession(\n ref.file,\n options.maxEntryChars,\n normalizationOptions(options, lineage),\n );\n const finalState = fingerprintSource(ref.file);\n const finalLineage = resolveLineage(ref.file, options);\n if (\n !finalState ||\n finalState.sourceHash !== state.sourceHash ||\n finalLineage.fingerprint !== lineage.fingerprint\n ) {\n removeCacheFile(filePath);\n return missingShard(\n ref,\n finalLineage,\n finalState?.sourceHash === state.sourceHash\n ? \"lineage_changed_during_index\"\n : \"source_changed_during_index\",\n );\n }\n const shard = applyCacheMetrics<Shard>({\n cacheVersion: MEMORY_CACHE_VERSION,\n kind: \"shard\",\n sessionFile: ref.file,\n sessionId: header?.sessionId ?? ref.id,\n ...state,\n branches: lineage.branches,\n lineageFingerprint: lineage.fingerprint,\n policy,\n cacheBytes: 0,\n cacheSourceRatio: 0,\n entries,\n totalEntryCount: entries.length,\n indexCoverage,\n tier: \"hot\",\n });\n writeCacheFile(filePath, shard);\n return shard;\n};\n\nconst hydrateShard = (\n ref: SessionRef,\n options: MemoryIndexOptions,\n entryRange?: EntryRange,\n): Shard => {\n const lineage = resolveLineage(ref.file, options);\n const state = fingerprintSource(ref.file);\n if (!state) return { ...missingShard(ref, lineage), tier: \"cold\" };\n const { entries, header, indexCoverage } = normalizeSession(\n ref.file,\n options.maxEntryChars,\n normalizationOptions(options, lineage),\n );\n const finalState = fingerprintSource(ref.file);\n const finalLineage = resolveLineage(ref.file, options);\n if (\n !finalState ||\n finalState.sourceHash !== state.sourceHash ||\n finalLineage.fingerprint !== lineage.fingerprint\n ) {\n return {\n ...missingShard(\n ref,\n finalLineage,\n finalState?.sourceHash === state.sourceHash\n ? \"lineage_changed_during_index\"\n : \"source_changed_during_index\",\n ),\n tier: \"cold\",\n };\n }\n const selected = entryRange\n ? entries.filter((entry) => entry.index >= entryRange.first && entry.index <= entryRange.last)\n : entries;\n return {\n cacheVersion: MEMORY_CACHE_VERSION,\n kind: \"shard\",\n sessionFile: ref.file,\n sessionId: header?.sessionId ?? ref.id,\n ...state,\n branches: lineage.branches,\n lineageFingerprint: lineage.fingerprint,\n policy: shardPolicy(options, lineage),\n cacheBytes: 0,\n cacheSourceRatio: 0,\n entries: selected,\n totalEntryCount: entries.length,\n indexCoverage,\n tier: \"cold\",\n };\n};\n\nexport const missingDigest = (\n ref: SessionRef,\n lineage: SessionLineage,\n reason = \"source_unavailable\",\n): DigestShard => ({\n cacheVersion: MEMORY_CACHE_VERSION,\n kind: \"digest\",\n sessionId: ref.id,\n file: ref.file,\n cwd: ref.cwd,\n firstTs: null,\n lastTs: null,\n entryCount: 0,\n filesTouched: [],\n toolHistogram: {},\n errorCount: 0,\n vocabulary: [],\n addresses: [],\n indexCoverage: { complete: false, vocabularyBytes: 2, reasons: [reason] },\n mtime: 0,\n size: 0,\n sourceHash: \"\",\n branches: lineage.branches,\n lineageFingerprint: lineage.fingerprint,\n policy: reason,\n cacheBytes: 0,\n cacheSourceRatio: 0,\n});\n\nconst maxFittingPrefix = <T>(\n values: T[],\n fits: (candidate: T[]) => boolean,\n): T[] => {\n let low = 0;\n let high = values.length;\n while (low < high) {\n const middle = Math.ceil((low + high) / 2);\n if (fits(values.slice(0, middle))) low = middle;\n else high = middle - 1;\n }\n return values.slice(0, low);\n};\n\nexport const fitDigestCache = (digest: DigestShard, maxBytes: number): DigestShard => {\n applyCacheMetrics(digest);\n if (digest.cacheBytes <= maxBytes) return digest;\n\n digest.indexCoverage.complete = false;\n if (!digest.indexCoverage.reasons.includes(\"max_cold_cache_bytes\")) {\n digest.indexCoverage.reasons.push(\"max_cold_cache_bytes\");\n }\n digest.addresses = maxFittingPrefix(digest.addresses, (addresses) => {\n digest.addresses = addresses;\n applyCacheMetrics(digest);\n return digest.cacheBytes <= maxBytes;\n });\n applyCacheMetrics(digest);\n if (digest.cacheBytes <= maxBytes) return digest;\n\n digest.vocabulary = maxFittingPrefix(digest.vocabulary, (vocabulary) => {\n digest.vocabulary = vocabulary;\n digest.indexCoverage.vocabularyBytes = serializedBytes(vocabulary);\n applyCacheMetrics(digest);\n return digest.cacheBytes <= maxBytes;\n });\n digest.indexCoverage.vocabularyBytes = serializedBytes(digest.vocabulary);\n return applyCacheMetrics(digest);\n};\n\nexport const loadDigest = (ref: SessionRef, options: MemoryIndexOptions): DigestShard => {\n const lineage = resolveLineage(ref.file, options);\n const filePath = digestPathForSession(ref.file, options.indexDir, lineage.branches);\n const state = fingerprintSource(ref.file);\n if (!state) {\n removeCacheFile(filePath);\n return missingDigest(ref, lineage);\n }\n const policy = digestPolicy(options, lineage);\n const maxCacheBytes = options.maxColdCacheBytes ?? DEFAULT_MAX_COLD_CACHE_BYTES;\n const cached = readDigestFile(filePath, maxCacheBytes);\n if (\n isCacheFresh(cached, state, policy) &&\n cached?.file === ref.file &&\n serializedBytes(cached) <= maxCacheBytes\n ) return cached;\n if (fs.existsSync(filePath)) removeCacheFile(filePath);\n\n const { entries, header, indexCoverage } = normalizeSession(\n ref.file,\n Number.MAX_SAFE_INTEGER,\n normalizationOptions(options, lineage),\n );\n const finalState = fingerprintSource(ref.file);\n const finalLineage = resolveLineage(ref.file, options);\n if (\n !finalState ||\n finalState.sourceHash !== state.sourceHash ||\n finalLineage.fingerprint !== lineage.fingerprint\n ) {\n removeCacheFile(filePath);\n return missingDigest(\n ref,\n finalLineage,\n finalState?.sourceHash === state.sourceHash\n ? \"lineage_changed_during_index\"\n : \"source_changed_during_index\",\n );\n }\n const digest = foldSessionDigest({\n sessionId: header?.sessionId ?? ref.id,\n file: ref.file,\n cwd: header?.cwd ?? ref.cwd,\n entries,\n maxVocabularyBytes:\n options.maxColdVocabularyBytes ?? DEFAULT_MAX_COLD_VOCABULARY_BYTES,\n normalizationCoverage: indexCoverage,\n });\n const persisted = fitDigestCache({\n cacheVersion: MEMORY_CACHE_VERSION,\n kind: \"digest\",\n ...digest,\n ...state,\n branches: lineage.branches,\n lineageFingerprint: lineage.fingerprint,\n policy,\n cacheBytes: 0,\n cacheSourceRatio: 0,\n }, maxCacheBytes);\n if (persisted.cacheBytes <= maxCacheBytes) writeCacheFile(filePath, persisted);\n return persisted;\n};\n\nconst compareRefsByRecency = (left: SessionRef, right: SessionRef): number => {\n if (right.mtime !== left.mtime) return right.mtime - left.mtime;\n return compareLexical(left.file, right.file);\n};\n\nexport const classifySessionTiers = (\n refs: SessionRef[],\n hotSessions = DEFAULT_HOT_SESSIONS,\n): Map<string, MemoryTier> => {\n const sorted = [...refs].sort(compareRefsByRecency);\n const hot = new Set(sorted.slice(0, Math.max(0, Math.floor(hotSessions))).map((ref) => ref.file));\n return new Map(sorted.map((ref) => [ref.file, hot.has(ref.file) ? \"hot\" : \"cold\"]));\n};\n\nexport interface MemoryCoverage {\n complete: boolean;\n indexedSessions: number;\n eligibleSessions: number;\n staleSessions: number;\n incompleteSessions: number;\n reasons: string[];\n}\n\nexport interface TieredIndexBundle {\n shards: Shard[];\n digests: DigestShard[];\n refs: SessionRef[];\n tiers: Map<string, MemoryTier>;\n coverage: MemoryCoverage;\n}\n\nconst cleanupCacheDirectory = (\n indexDir: string,\n branchesToClean: MemoryBranches,\n maxFiles: number,\n maxBytes: number,\n): { complete: boolean; reasons: string[] } => {\n let directory: fs.Dir;\n try {\n directory = fs.opendirSync(indexDir);\n } catch {\n return { complete: true, reasons: [] };\n }\n let inspected = 0;\n let inspectedBytes = 0;\n try {\n while (true) {\n const entry = directory.readSync();\n if (!entry) return { complete: true, reasons: [] };\n if (!entry.name.endsWith(\".json\")) continue;\n if (inspected >= maxFiles) {\n return { complete: false, reasons: [\"cache_cleanup_budget\"] };\n }\n inspected += 1;\n const cacheFile = path.join(indexDir, entry.name);\n if (!entry.isFile()) {\n removeCacheFile(cacheFile);\n continue;\n }\n let cacheBytes: number;\n try {\n cacheBytes = fs.statSync(cacheFile).size;\n } catch {\n removeCacheFile(cacheFile);\n continue;\n }\n if (inspectedBytes + cacheBytes > maxBytes) {\n return { complete: false, reasons: [\"cache_cleanup_budget\"] };\n }\n inspectedBytes += cacheBytes;\n try {\n const parsed = JSON.parse(fs.readFileSync(cacheFile, \"utf8\")) as Record<string, unknown>;\n const kind = parsed.kind;\n const source = kind === \"shard\" && typeof parsed.sessionFile === \"string\"\n ? parsed.sessionFile\n : kind === \"digest\" && typeof parsed.file === \"string\" ? parsed.file : null;\n const branches = parsed.branches === \"active\" || parsed.branches === \"all\"\n ? parsed.branches\n : null;\n if (branches !== null && branches !== branchesToClean) continue;\n const expected = source && branches && kind === \"shard\"\n ? shardPathForSession(source, indexDir, branches)\n : source && branches && kind === \"digest\"\n ? digestPathForSession(source, indexDir, branches)\n : null;\n const structurallyValid = kind === \"shard\"\n ? readShardFile(cacheFile, cacheBytes) !== null\n : kind === \"digest\" ? readDigestFile(cacheFile, cacheBytes) !== null : false;\n if (\n parsed.cacheVersion !== MEMORY_CACHE_VERSION ||\n source === null ||\n expected !== cacheFile ||\n !fs.existsSync(source) ||\n !structurallyValid\n ) removeCacheFile(cacheFile);\n } catch {\n removeCacheFile(cacheFile);\n }\n }\n } finally {\n directory.closeSync();\n }\n};\n\nconst sourceSize = (file: string): number | null => {\n try {\n const stat = fs.statSync(file);\n return stat.isFile() ? stat.size : null;\n } catch {\n return null;\n }\n};\n\nexport const loadTieredIndex = (\n refs: SessionRef[],\n allRefs: SessionRef[],\n options: MemoryIndexOptions,\n hydrate = false,\n entryRange?: EntryRange,\n): TieredIndexBundle => {\n const cleanup = cleanupCacheDirectory(\n options.indexDir,\n options.branches ?? \"active\",\n options.maxCacheCleanupFiles ?? DEFAULT_MAX_CACHE_CLEANUP_FILES,\n options.maxSyncSourceBytes ?? DEFAULT_MAX_SYNC_SOURCE_BYTES,\n );\n const tierRefs = allRefs.length > 0 ? allRefs : refs;\n const tiers = classifySessionTiers(tierRefs, options.hotSessions ?? DEFAULT_HOT_SESSIONS);\n const maxSessions = options.maxSyncSessions ?? DEFAULT_MAX_SYNC_SESSIONS;\n const maxSourceBytes = options.maxSyncSourceBytes ?? DEFAULT_MAX_SYNC_SOURCE_BYTES;\n const shards: Shard[] = [];\n const digests: DigestShard[] = [];\n const reasons = new Set(cleanup.reasons);\n let indexedSessions = 0;\n let incompleteSessions = 0;\n let processedSessions = 0;\n let processedSourceBytes = 0;\n\n for (const ref of refs) {\n const size = sourceSize(ref.file);\n if (size === null) {\n reasons.add(\"source_unavailable\");\n continue;\n }\n if (processedSessions >= maxSessions) {\n reasons.add(\"max_sync_sessions\");\n continue;\n }\n const tier = tiers.get(ref.file) ?? \"cold\";\n const sourceWorkBytes = size * (hydrate && tier === \"cold\" ? 6 : 3);\n if (processedSourceBytes + sourceWorkBytes > maxSourceBytes) {\n reasons.add(\"max_sync_source_bytes\");\n continue;\n }\n processedSessions += 1;\n processedSourceBytes += sourceWorkBytes;\n try {\n if (hydrate) {\n if (tier === \"cold\") loadDigest(ref, options);\n const shard = hydrateShard(ref, options, entryRange);\n shards.push(shard);\n if (shard.sourceHash) indexedSessions += 1;\n else reasons.add(shard.indexReason ?? \"source_unavailable\");\n if (shard.sourceHash && !shard.indexCoverage.complete) {\n incompleteSessions += 1;\n for (const reason of shard.indexCoverage.reasons) reasons.add(reason);\n }\n } else if (tier === \"hot\") {\n const shard = loadShard(ref, options);\n removeCacheFile(digestPathForSession(\n ref.file,\n options.indexDir,\n options.branches ?? \"active\",\n ));\n shards.push(shard);\n if (shard.sourceHash) indexedSessions += 1;\n else reasons.add(shard.indexReason ?? \"source_unavailable\");\n if (shard.sourceHash && !shard.indexCoverage.complete) {\n incompleteSessions += 1;\n for (const reason of shard.indexCoverage.reasons) reasons.add(reason);\n }\n } else {\n const digest = loadDigest(ref, options);\n removeCacheFile(shardPathForSession(\n ref.file,\n options.indexDir,\n options.branches ?? \"active\",\n ));\n digests.push(digest);\n if (digest.sourceHash) indexedSessions += 1;\n if (!digest.indexCoverage.complete) {\n incompleteSessions += 1;\n for (const reason of digest.indexCoverage.reasons) reasons.add(reason);\n }\n }\n } catch {\n reasons.add(\"index_error\");\n }\n }\n\n const eligibleSessions = refs.length;\n const staleSessions = eligibleSessions - indexedSessions;\n return {\n shards,\n digests,\n refs,\n tiers,\n coverage: {\n complete: cleanup.complete && staleSessions === 0 && incompleteSessions === 0,\n indexedSessions,\n eligibleSessions,\n staleSessions,\n incompleteSessions,\n reasons: [...reasons].sort(compareLexical),\n },\n };\n};\n\nexport interface SearchFilters {\n role?: string;\n tool?: string;\n ref?: string;\n provider?: string;\n action?: string;\n outcome?: NonNullable<NormalizedEntry[\"outcome\"]>;\n since?: number;\n until?: number;\n}\n\nconst matchesFilters = (entry: NormalizedEntry, filters: SearchFilters): boolean => {\n if (filters.role !== undefined && entry.role !== filters.role) return false;\n if (filters.tool !== undefined && entry.toolName !== filters.tool) return false;\n if (filters.ref !== undefined && entry.ref !== filters.ref) return false;\n if (filters.provider !== undefined && entry.provider !== filters.provider) return false;\n if (filters.action !== undefined && entry.action !== filters.action) return false;\n if (filters.outcome !== undefined && entry.outcome !== filters.outcome) return false;\n if (filters.since !== undefined && entry.timestamp !== null && entry.timestamp < filters.since) return false;\n if (filters.until !== undefined && entry.timestamp !== null && entry.timestamp > filters.until) return false;\n return true;\n};\n\nexport interface IndexedEntry {\n entry: NormalizedEntry;\n sessionMtime: number;\n}\n\nexport interface ScoredEntry extends IndexedEntry {\n score: number;\n matchedTerms: number;\n}\n\nexport interface ShardBundle {\n shards: Shard[];\n refs: SessionRef[];\n}\n\nexport const loadShards = (refs: SessionRef[], options: MemoryIndexOptions): ShardBundle => ({\n shards: refs.map((ref) => loadShard(ref, options)),\n refs,\n});\n\nexport const bm25Score = (\n shards: Shard[],\n terms: string[],\n filters: SearchFilters,\n candidateLimit = Number.MAX_SAFE_INTEGER,\n): ScoredEntry[] => {\n const queryTerms = [...new Set(terms.flatMap((term) => tokenizeLexical(term)))];\n const matching: { entry: NormalizedEntry; mtime: number; counts: Map<string, number> }[] = [];\n for (const shard of shards) {\n for (const entry of shard.entries) {\n if (matchesFilters(entry, filters) && matching.length < candidateLimit) {\n matching.push({ entry, mtime: shard.mtime, counts: lexicalTermCounts(entry.text) });\n }\n }\n }\n if (matching.length === 0 || queryTerms.length === 0) return [];\n\n const lengths = matching.map((item) => Math.max(1, [...item.counts.values()].reduce((a, b) => a + b, 0)));\n const averageLength = lengths.reduce((sum, length) => sum + length, 0) / matching.length;\n const documentFrequency = new Map<string, number>();\n for (const item of matching) {\n for (const term of queryTerms) {\n if ((item.counts.get(term) ?? 0) > 0) {\n documentFrequency.set(term, (documentFrequency.get(term) ?? 0) + 1);\n }\n }\n }\n\n const K = 1.2;\n const B = 0.75;\n const results: ScoredEntry[] = [];\n for (let index = 0; index < matching.length; index += 1) {\n const item = matching[index]!;\n let score = 0;\n let matchedTerms = 0;\n for (const term of queryTerms) {\n const tf = item.counts.get(term) ?? 0;\n if (tf === 0) continue;\n matchedTerms += 1;\n const df = documentFrequency.get(term) ?? 0;\n const idf = Math.log((matching.length - df + 0.5) / (df + 0.5) + 1);\n const normalized = (tf * (K + 1)) /\n (tf + K * (1 - B + B * (lengths[index]! / averageLength)));\n score += idf * normalized;\n }\n if (score > 0) {\n results.push({ entry: item.entry, sessionMtime: item.mtime, score, matchedTerms });\n }\n }\n\n results.sort((left, right) => {\n if (right.score !== left.score) return right.score - left.score;\n if (right.sessionMtime !== left.sessionMtime) return right.sessionMtime - left.sessionMtime;\n if (left.entry.index !== right.entry.index) return left.entry.index - right.entry.index;\n return compareLexical(left.entry.sessionFile, right.entry.sessionFile);\n });\n return results;\n};\n\nexport const recentEntries = (\n shards: Shard[],\n filters: SearchFilters,\n limit: number,\n): IndexedEntry[] => {\n const all: IndexedEntry[] = [];\n for (const shard of shards) {\n for (const entry of shard.entries) {\n if (matchesFilters(entry, filters)) all.push({ entry, sessionMtime: shard.mtime });\n }\n }\n all.sort((left, right) => {\n if (right.sessionMtime !== left.sessionMtime) return right.sessionMtime - left.sessionMtime;\n if (left.entry.index !== right.entry.index) return left.entry.index - right.entry.index;\n return compareLexical(left.entry.sessionFile, right.entry.sessionFile);\n });\n return all.slice(0, Math.max(0, limit));\n};\n", "import crypto from \"node:crypto\";\nimport fs from \"node:fs\";\n\nexport type MemoryBranches = \"active\" | \"all\";\n\nexport interface LiveSessionBranch {\n entries: readonly unknown[];\n leafId: string | null;\n}\n\nexport interface SessionLineage {\n branches: MemoryBranches;\n leafId: string | null;\n entryOrdinals: ReadonlySet<number> | null;\n fingerprint: string;\n coverageReasons: string[];\n}\n\ninterface PersistedNode {\n id: string;\n parentId: string | null;\n ordinal: number;\n}\n\ninterface PersistedRecord {\n type?: unknown;\n id?: unknown;\n parentId?: unknown;\n}\n\nconst asPersistedRecord = (value: unknown): PersistedRecord | null =>\n value !== null && typeof value === \"object\" && !Array.isArray(value)\n ? value as PersistedRecord\n : null;\n\nconst isHeaderRecord = (record: PersistedRecord): boolean => record.type === \"session\";\n\nconst hasParentLink = (\n record: PersistedRecord,\n): record is PersistedRecord & { id: string; parentId: string | null } =>\n typeof record.id === \"string\" && (record.parentId === null || typeof record.parentId === \"string\");\n\nconst persistedNodesFromRecords = (records: readonly unknown[]): PersistedNode[] => {\n const nodes: PersistedNode[] = [];\n let ordinal = 0;\n for (const value of records) {\n const record = asPersistedRecord(value);\n if (!record || isHeaderRecord(record)) continue;\n if (hasParentLink(record)) nodes.push({ id: record.id, parentId: record.parentId, ordinal });\n ordinal += 1;\n }\n return nodes;\n};\n\nconst fingerprint = (branches: MemoryBranches, leafId: string | null, ids: string[]): string =>\n crypto.createHash(\"sha256\").update(JSON.stringify({ branches, leafId, ids })).digest(\"hex\");\n\nconst readPersistedNodes = (sessionFile: string): PersistedNode[] => {\n let content: string;\n try {\n content = fs.readFileSync(sessionFile, \"utf8\");\n } catch {\n return [];\n }\n const records: unknown[] = [];\n for (const line of content.split(\"\\n\")) {\n if (!line.trim()) continue;\n try {\n records.push(JSON.parse(line));\n } catch {\n continue;\n }\n }\n return persistedNodesFromRecords(records);\n};\n\nconst allLineage = (): SessionLineage => ({\n branches: \"all\",\n leafId: null,\n entryOrdinals: null,\n fingerprint: fingerprint(\"all\", null, []),\n coverageReasons: [],\n});\n\n/**\n * Reconstruct Pi 0.80.6's persisted leaf semantics without treating append\n * order as a transcript: the final persisted entry is the leaf, duplicate IDs\n * resolve to their last record in the ID map, and parent links are walked to a\n * root. Cycles are stopped defensively and reported as incomplete coverage.\n */\nexport const reconstructSessionLineage = (\n sessionFile: string,\n branches: MemoryBranches,\n liveBranch?: LiveSessionBranch,\n): SessionLineage =>\n branches === \"all\" ? allLineage() : buildActiveLineage(readPersistedNodes(sessionFile), liveBranch);\n\nconst buildActiveLineage = (nodes: PersistedNode[], liveBranch?: LiveSessionBranch, selectedLeafId?: string | null): SessionLineage => {\n const byId = new Map(nodes.map((node) => [node.id, node]));\n const liveIds = liveBranch?.entries.flatMap((entry) => {\n if (entry === null || typeof entry !== \"object\" || Array.isArray(entry)) return [];\n const id = (entry as Record<string, unknown>).id;\n return typeof id === \"string\" ? [id] : [];\n });\n const leafId = liveBranch ? liveBranch.leafId : selectedLeafId !== undefined ? selectedLeafId : (nodes[nodes.length - 1]?.id ?? null);\n const path: PersistedNode[] = [];\n const reasons = new Set<string>();\n\n if (liveIds) {\n for (const id of liveIds) {\n const node = byId.get(id);\n if (node) path.push(node);\n }\n } else {\n const seen = new Set<string>();\n let current = leafId ? byId.get(leafId) : undefined;\n while (current) {\n if (seen.has(current.id)) {\n reasons.add(\"invalid_parent_graph\");\n break;\n }\n seen.add(current.id);\n path.push(current);\n current = current.parentId ? byId.get(current.parentId) : undefined;\n }\n path.reverse();\n }\n\n const ids = liveIds ?? path.map((node) => node.id);\n return {\n branches: \"active\",\n leafId,\n entryOrdinals: new Set(path.map((node) => node.ordinal)),\n fingerprint: fingerprint(\"active\", leafId, ids),\n coverageReasons: [...reasons].sort(),\n };\n};\n\n/**\n * Records variant of {@link reconstructSessionLineage}: identical Pi 0.80.6\n * leaf semantics applied to already-parsed session records instead of a file.\n */\nexport const reconstructRecordsLineage = (\n records: readonly unknown[],\n branches: MemoryBranches,\n liveBranch?: LiveSessionBranch,\n selectedLeafId?: string | null,\n): SessionLineage =>\n branches === \"all\" ? allLineage() : buildActiveLineage(persistedNodesFromRecords(records), liveBranch, selectedLeafId);\n", "import { Worker } from \"node:worker_threads\";\n\nexport interface RegexLimits {\n maxPatternBytes: number;\n timeoutMs: number;\n}\n\nexport interface RegexExecutionError {\n code: \"invalid_regex\" | \"regex_pattern_too_large\" | \"regex_timeout\" | \"regex_worker_error\";\n message: string;\n}\n\nexport type RegexExecutionResult =\n | { complete: true; matched: number[] }\n | { complete: false; matched: []; error: RegexExecutionError };\n\nconst WORKER_SOURCE = String.raw`\nconst { parentPort } = require(\"node:worker_threads\");\nparentPort.on(\"message\", ({ pattern, haystacks }) => {\n try {\n const regex = new RegExp(pattern, \"iu\");\n const matched = [];\n for (let index = 0; index < haystacks.length; index += 1) {\n if (regex.test(haystacks[index])) matched.push(index);\n }\n parentPort.postMessage({ matched });\n } catch (error) {\n parentPort.postMessage({\n error: {\n code: \"invalid_regex\",\n message: error instanceof Error ? error.message : String(error),\n },\n });\n }\n});\n`;\n\n/** Execute untrusted regex in a disposable worker that can be forcibly terminated. */\nexport const executeBoundedRegex = async (\n pattern: string,\n haystacks: string[],\n limits: RegexLimits,\n): Promise<RegexExecutionResult> => {\n const patternBytes = Buffer.byteLength(pattern, \"utf8\");\n if (patternBytes > limits.maxPatternBytes) {\n return {\n complete: false,\n matched: [],\n error: {\n code: \"regex_pattern_too_large\",\n message: `Regex pattern is ${patternBytes} bytes; limit is ${limits.maxPatternBytes}.`,\n },\n };\n }\n\n return new Promise((resolve) => {\n let worker: Worker;\n try {\n worker = new Worker(WORKER_SOURCE, {\n eval: true,\n resourceLimits: { maxOldGenerationSizeMb: 16, maxYoungGenerationSizeMb: 4 },\n });\n } catch (error) {\n resolve({\n complete: false,\n matched: [],\n error: {\n code: \"regex_worker_error\",\n message: error instanceof Error ? error.message : String(error),\n },\n });\n return;\n }\n let settled = false;\n const finish = (result: RegexExecutionResult): void => {\n if (settled) return;\n settled = true;\n clearTimeout(timer);\n void worker.terminate();\n resolve(result);\n };\n const timer = setTimeout(() => {\n finish({\n complete: false,\n matched: [],\n error: {\n code: \"regex_timeout\",\n message: `Regex execution exceeded ${limits.timeoutMs} ms.`,\n },\n });\n }, limits.timeoutMs);\n worker.once(\"message\", (message: unknown) => {\n const record = message as { matched?: unknown; error?: RegexExecutionError };\n if (record.error) {\n finish({ complete: false, matched: [], error: record.error });\n return;\n }\n if (Array.isArray(record.matched) && record.matched.every((value) => Number.isInteger(value))) {\n finish({ complete: true, matched: record.matched as number[] });\n return;\n }\n finish({\n complete: false,\n matched: [],\n error: { code: \"regex_worker_error\", message: \"Regex worker returned an invalid result.\" },\n });\n });\n worker.once(\"error\", (error: unknown) => {\n finish({\n complete: false,\n matched: [],\n error: {\n code: \"regex_worker_error\",\n message: error instanceof Error ? error.message : String(error),\n },\n });\n });\n worker.postMessage({ pattern, haystacks });\n });\n};\n", "import type { DigestEntryAddress } from \"./digest.js\";\nimport type { MemoryBranches } from \"./lineage.js\";\nimport type { NormalizedEntry } from \"./normalize.js\";\nimport type { DigestShard, SearchFilters, Shard } from \"./index.js\";\nimport { bm25Score, recentEntries, type ScoredEntry } from \"./index.js\";\nimport { executeBoundedRegex, type RegexExecutionError } from \"./regex.js\";\nimport {\n compareLexical,\n normalizeMemoryPhrase,\n planMemoryQuery,\n type MemoryQueryMatch,\n type MemoryQueryMode,\n} from \"./tokenize.js\";\n\nexport const DEFAULT_REGEX_MAX_PATTERN_BYTES = 1_024;\nexport const DEFAULT_REGEX_MAX_HAYSTACK_TERMS = 20_000;\nexport const DEFAULT_REGEX_MAX_HAYSTACK_BYTES = 2 * 1024 * 1024;\nexport const DEFAULT_REGEX_TIMEOUT_MS = 250;\nconst DEFAULT_SEARCH_MAX_CANDIDATE_ENTRIES = 50_000;\nconst DEFAULT_SEARCH_MAX_CANDIDATE_DIGESTS = 10_000;\nconst DEFAULT_SEARCH_MAX_CANDIDATE_ITEMS = 10_000;\n\nexport interface SearchQuery {\n query?: string;\n queryMode?: MemoryQueryMode;\n queryMatch?: MemoryQueryMatch;\n filters?: SearchFilters;\n limit?: number;\n candidateLimits?: {\n maxEntries: number;\n maxDigests: number;\n maxItems: number;\n };\n regexLimits?: {\n maxPatternBytes: number;\n maxHaystackTerms: number;\n maxHaystackBytes: number;\n timeoutMs: number;\n };\n}\n\nexport interface SearchSegmentEntry {\n entry: NormalizedEntry;\n matched: boolean;\n marker: \">\" | \" \";\n score: number;\n}\n\ninterface ExactEntryAddress {\n index: number;\n entryId: string | null;\n operationAddress: string | null;\n}\n\nexport interface SearchSegment {\n sessionId: string;\n sessionFile: string;\n sourceHash: string;\n branches: MemoryBranches;\n lineageFingerprint: string;\n sessionMtime: number;\n range: string;\n entryRange: { first: number; last: number };\n entries: SearchSegmentEntry[];\n exactMatches: ExactEntryAddress[];\n matchedCount: number;\n score: number;\n tier: \"hot\" | \"cold\";\n}\n\nexport interface DigestHit {\n sessionId: string;\n sessionFile: string;\n sourceHash: string;\n branches: MemoryBranches;\n lineageFingerprint: string;\n cwd: string;\n lastTs: number | null;\n sessionMtime: number;\n score: number;\n tier: \"cold\";\n matchedTerms: number;\n matchedStructuralEntries: number;\n}\n\ntype SearchItem =\n | { kind: \"entry\"; segment: SearchSegment }\n | { kind: \"digest\"; digest: DigestHit };\n\ninterface QueryCoverage {\n complete: boolean;\n reasons: string[];\n error?: RegexExecutionError;\n}\n\ntype MemoryMatchMode = \"browse\" | \"lexical\" | \"phrase\" | \"regex\" | \"structural\" | \"combined\";\n\nexport interface SearchResult {\n matchMode: MemoryMatchMode;\n matchedCount: number;\n totalMatches: number;\n totalItems: number;\n segmentCount: number;\n segments: SearchSegment[];\n digestHits: DigestHit[];\n items: SearchItem[];\n queryCoverage: QueryCoverage;\n}\n\nconst segmentStartRoles = new Set([\"user\", \"bashExecution\", \"compaction\"]);\n\nconst matchesFilters = (entry: NormalizedEntry, filters: SearchFilters): boolean => {\n if (filters.role !== undefined && entry.role !== filters.role) return false;\n if (filters.tool !== undefined && entry.toolName !== filters.tool) return false;\n if (filters.ref !== undefined && entry.ref !== filters.ref) return false;\n if (filters.provider !== undefined && entry.provider !== filters.provider) return false;\n if (filters.action !== undefined && entry.action !== filters.action) return false;\n if (filters.outcome !== undefined && entry.outcome !== filters.outcome) return false;\n if (filters.since !== undefined && entry.timestamp !== null && entry.timestamp < filters.since) return false;\n if (filters.until !== undefined && entry.timestamp !== null && entry.timestamp > filters.until) return false;\n return true;\n};\n\nconst addressMatchesFilters = (address: DigestEntryAddress, filters: SearchFilters): boolean => {\n if (filters.role !== undefined && address[3] !== filters.role) return false;\n if (filters.tool !== undefined && address[4] !== filters.tool) return false;\n if (filters.ref !== undefined && address[6] !== filters.ref) return false;\n if (filters.provider !== undefined && address[7] !== filters.provider) return false;\n if (filters.action !== undefined && address[8] !== filters.action) return false;\n if (filters.outcome !== undefined && address[9] !== filters.outcome) return false;\n if (filters.since !== undefined && address[5] !== null && address[5] < filters.since) return false;\n if (filters.until !== undefined && address[5] !== null && address[5] > filters.until) return false;\n return true;\n};\n\nconst hasFilters = (filters: SearchFilters): boolean => Object.keys(filters).length > 0;\n\nconst lexicalProvenanceWeight = (entry: NormalizedEntry, filters: SearchFilters): number => {\n if (\n filters.tool !== undefined ||\n filters.ref !== undefined ||\n filters.provider !== undefined ||\n filters.action !== undefined ||\n filters.outcome !== undefined\n ) return 1;\n if (entry.toolName === null && entry.role === \"assistant\") return 2.5;\n if (entry.toolName === null && entry.role === \"user\") return 2.25;\n if (entry.toolName === null && (entry.role === \"compactionSummary\" || entry.role === \"custom\")) return 1.5;\n if (entry.role === \"toolResult\" || entry.role === \"fabricOperation\") return 0.75;\n if (entry.toolName !== null) return 0.7;\n return 1;\n};\n\ninterface LocatedEntry {\n entry: NormalizedEntry;\n matched: boolean;\n sessionMtime: number;\n score: number;\n}\n\nconst sortLocated = (located: LocatedEntry[]): void => {\n located.sort((left, right) => {\n if (right.score !== left.score) return right.score - left.score;\n if (right.sessionMtime !== left.sessionMtime) return right.sessionMtime - left.sessionMtime;\n if (left.entry.index !== right.entry.index) return left.entry.index - right.entry.index;\n return compareLexical(left.entry.sessionFile, right.entry.sessionFile);\n });\n};\n\nconst filteredEntryCount = (shards: Shard[], filters: SearchFilters): number => {\n let count = 0;\n for (const shard of shards) {\n for (const entry of shard.entries) if (matchesFilters(entry, filters)) count += 1;\n }\n return count;\n};\n\nconst collectTermMatches = (\n shards: Shard[],\n terms: string[],\n filters: SearchFilters,\n maxEntries: number,\n match: MemoryQueryMatch,\n): LocatedEntry[] => {\n const scored: ScoredEntry[] = bm25Score(shards, terms, filters, maxEntries);\n const selected = match === \"all\"\n ? scored.filter((item) => item.matchedTerms === terms.length)\n : scored;\n return selected.map((item) => ({\n entry: item.entry,\n matched: true,\n sessionMtime: item.sessionMtime,\n score: item.score * lexicalProvenanceWeight(item.entry, filters),\n }));\n};\n\nconst collectPhraseMatches = (\n shards: Shard[],\n phrase: string,\n filters: SearchFilters,\n maxEntries: number,\n): LocatedEntry[] => {\n const located: LocatedEntry[] = [];\n let inspected = 0;\n outer: for (const shard of shards) {\n for (const entry of shard.entries) {\n if (!matchesFilters(entry, filters)) continue;\n if (inspected >= maxEntries) break outer;\n inspected += 1;\n if (!normalizeMemoryPhrase(entry.text).includes(phrase)) continue;\n located.push({\n entry,\n matched: true,\n sessionMtime: shard.mtime,\n score: lexicalProvenanceWeight(entry, filters),\n });\n }\n }\n sortLocated(located);\n return located;\n};\n\nconst collectRecent = (\n shards: Shard[],\n filters: SearchFilters,\n maxEntries: number,\n score = 0,\n): LocatedEntry[] =>\n recentEntries(shards, filters, maxEntries).map((item) => ({\n entry: item.entry,\n matched: true,\n sessionMtime: item.sessionMtime,\n score,\n }));\n\nconst digestStructuralMatchCount = (digest: DigestShard, filters: SearchFilters): number =>\n hasFilters(filters)\n ? digest.addresses.filter((address) => addressMatchesFilters(address, filters)).length\n : 0;\n\nconst digestCanMatchFilters = (digest: DigestShard, filters: SearchFilters): boolean =>\n !hasFilters(filters) || digestStructuralMatchCount(digest, filters) > 0;\n\nconst toDigestHit = (\n digest: DigestShard,\n score: number,\n matchedTerms: number,\n matchedStructuralEntries = 0,\n): DigestHit => ({\n sessionId: digest.sessionId,\n sessionFile: digest.file,\n sourceHash: digest.sourceHash,\n branches: digest.branches,\n lineageFingerprint: digest.lineageFingerprint,\n cwd: digest.cwd,\n lastTs: digest.lastTs,\n sessionMtime: digest.mtime,\n score,\n tier: \"cold\",\n matchedTerms,\n matchedStructuralEntries,\n});\n\nconst scoreDigestTerms = (\n digests: DigestShard[],\n terms: string[],\n filters: SearchFilters,\n maxDigests: number,\n match: MemoryQueryMatch,\n): { hits: DigestHit[]; complete: boolean } => {\n if (digests.length === 0 || terms.length === 0) return { hits: [], complete: true };\n const candidates: Array<{ digest: DigestShard; matches: string[]; structuralMatches: number }> = [];\n let matchingDigests = 0;\n for (const digest of digests) {\n if (!digestCanMatchFilters(digest, filters)) continue;\n const vocabulary = new Set(digest.vocabulary);\n const matches = terms.filter((term) => vocabulary.has(term));\n if (matches.length === 0 || (match === \"all\" && matches.length !== terms.length)) continue;\n matchingDigests += 1;\n if (candidates.length < maxDigests) {\n candidates.push({\n digest,\n matches,\n structuralMatches: digestStructuralMatchCount(digest, filters),\n });\n }\n }\n const documentFrequency = new Map<string, number>();\n for (const candidate of candidates) {\n for (const term of candidate.matches) {\n documentFrequency.set(term, (documentFrequency.get(term) ?? 0) + 1);\n }\n }\n\n const hits = candidates.map((candidate) => {\n const score = candidate.matches.reduce((total, term) => {\n const df = documentFrequency.get(term) ?? 0;\n return total + Math.log((candidates.length - df + 0.5) / (df + 0.5) + 1);\n }, 0);\n return toDigestHit(\n candidate.digest,\n score,\n candidate.matches.length,\n candidate.structuralMatches,\n );\n });\n return { hits, complete: matchingDigests <= maxDigests };\n};\n\ninterface RegexHotTarget {\n kind: \"hot\";\n shard: Shard;\n entry: NormalizedEntry;\n}\n\ninterface RegexColdTarget {\n kind: \"cold\";\n digest: DigestShard;\n}\n\ntype RegexTarget = RegexHotTarget | RegexColdTarget;\n\nconst collectRegexTargets = (\n shards: Shard[],\n digests: DigestShard[],\n filters: SearchFilters,\n maxTerms: number,\n maxBytes: number,\n): { haystacks: string[]; targets: RegexTarget[]; complete: boolean; reasons: string[] } => {\n const haystacks: string[] = [];\n const targets: RegexTarget[] = [];\n let bytes = 0;\n let complete = true;\n const reasons = new Set<string>();\n const append = (haystack: string, target: RegexTarget): boolean => {\n const nextBytes = Buffer.byteLength(haystack, \"utf8\");\n if (haystacks.length >= maxTerms) {\n complete = false;\n reasons.add(\"regex_max_haystack_terms\");\n return false;\n }\n if (bytes + nextBytes > maxBytes) {\n complete = false;\n reasons.add(\"regex_max_haystack_bytes\");\n return false;\n }\n haystacks.push(haystack);\n targets.push(target);\n bytes += nextBytes;\n return true;\n };\n\n outer: for (const shard of shards) {\n for (const entry of shard.entries) {\n if (!matchesFilters(entry, filters)) continue;\n if (!append(entry.text, { kind: \"hot\", shard, entry })) break outer;\n }\n }\n if (complete) {\n outer: for (const digest of digests) {\n if (!digestCanMatchFilters(digest, filters)) continue;\n for (const term of digest.vocabulary) {\n if (!append(term, { kind: \"cold\", digest })) break outer;\n }\n }\n }\n return { haystacks, targets, complete, reasons: [...reasons].sort(compareLexical) };\n};\n\nconst searchRegex = async (\n shards: Shard[],\n digests: DigestShard[],\n pattern: string,\n filters: SearchFilters,\n query: SearchQuery,\n): Promise<{ located: LocatedEntry[]; digestHits: DigestHit[]; coverage: QueryCoverage }> => {\n const limits = query.regexLimits ?? {\n maxPatternBytes: DEFAULT_REGEX_MAX_PATTERN_BYTES,\n maxHaystackTerms: DEFAULT_REGEX_MAX_HAYSTACK_TERMS,\n maxHaystackBytes: DEFAULT_REGEX_MAX_HAYSTACK_BYTES,\n timeoutMs: DEFAULT_REGEX_TIMEOUT_MS,\n };\n const collected = collectRegexTargets(\n shards,\n digests,\n filters,\n limits.maxHaystackTerms,\n limits.maxHaystackBytes,\n );\n const execution = await executeBoundedRegex(pattern, collected.haystacks, {\n maxPatternBytes: limits.maxPatternBytes,\n timeoutMs: limits.timeoutMs,\n });\n if (!execution.complete) {\n return {\n located: [],\n digestHits: [],\n coverage: { complete: false, reasons: [execution.error.code], error: execution.error },\n };\n }\n\n const located: LocatedEntry[] = [];\n const coldMatches = new Map<DigestShard, number>();\n for (const index of execution.matched) {\n const target = collected.targets[index];\n if (!target) continue;\n if (target.kind === \"hot\") {\n located.push({\n entry: target.entry,\n matched: true,\n sessionMtime: target.shard.mtime,\n score: lexicalProvenanceWeight(target.entry, filters),\n });\n } else {\n coldMatches.set(target.digest, (coldMatches.get(target.digest) ?? 0) + 1);\n }\n }\n const reasons = new Set(collected.reasons);\n if (coldMatches.size > 0 && hasFilters(filters)) {\n reasons.add(\"cold_structural_filter_requires_hydration\");\n }\n return {\n located,\n digestHits: [...coldMatches].map(([digest, count]) =>\n toDigestHit(digest, count, count, digestStructuralMatchCount(digest, filters))),\n coverage: {\n complete: collected.complete && reasons.size === 0,\n reasons: [...reasons].sort(compareLexical),\n },\n };\n};\n\nconst sortDigestHits = (hits: DigestHit[]): void => {\n hits.sort((left, right) => {\n if (right.score !== left.score) return right.score - left.score;\n if (right.sessionMtime !== left.sessionMtime) return right.sessionMtime - left.sessionMtime;\n return compareLexical(left.sessionFile, right.sessionFile);\n });\n};\n\nexport const searchMemoryIndex = async (\n shards: Shard[],\n digests: DigestShard[],\n query: SearchQuery,\n): Promise<SearchResult> => {\n const filters: SearchFilters = query.filters ?? {};\n const plan = planMemoryQuery(\n query.query,\n query.queryMode ?? \"literal\",\n query.queryMatch ?? \"any\",\n );\n const limits = query.candidateLimits ?? {\n maxEntries: DEFAULT_SEARCH_MAX_CANDIDATE_ENTRIES,\n maxDigests: DEFAULT_SEARCH_MAX_CANDIDATE_DIGESTS,\n maxItems: DEFAULT_SEARCH_MAX_CANDIDATE_ITEMS,\n };\n const maxEntries = Math.max(1, Math.floor(limits.maxEntries));\n const maxDigests = Math.max(1, Math.floor(limits.maxDigests));\n const maxItems = Math.max(1, Math.floor(limits.maxItems));\n let located: LocatedEntry[];\n let digestHits: DigestHit[] = [];\n let queryCoverage: QueryCoverage = { complete: true, reasons: [] };\n const structurallyFiltered = hasFilters(filters);\n const matchMode: MemoryMatchMode = plan.kind === \"browse\"\n ? structurallyFiltered ? \"structural\" : \"browse\"\n : structurallyFiltered\n ? \"combined\"\n : plan.kind === \"regex\"\n ? \"regex\"\n : plan.kind === \"phrase\"\n ? \"phrase\"\n : \"lexical\";\n const markOnlyMatches = plan.kind !== \"browse\" || structurallyFiltered;\n const coverageReasons = new Set<string>();\n\n if (plan.kind === \"browse\") {\n const eligibleEntries = filteredEntryCount(shards, filters);\n located = collectRecent(shards, filters, maxEntries, structurallyFiltered ? 1 : 0);\n if (eligibleEntries > maxEntries) coverageReasons.add(\"candidate_entry_budget\");\n let eligibleDigests = 0;\n for (const digest of digests) {\n if (!digestCanMatchFilters(digest, filters)) continue;\n eligibleDigests += 1;\n if (digestHits.length < maxDigests) {\n const structuralMatches = digestStructuralMatchCount(digest, filters);\n digestHits.push(toDigestHit(\n digest,\n structurallyFiltered ? 1 : 0,\n 0,\n structuralMatches,\n ));\n }\n }\n if (eligibleDigests > maxDigests) coverageReasons.add(\"candidate_digest_budget\");\n } else if (plan.kind === \"regex\") {\n const regexResult = await searchRegex(shards, digests, plan.pattern, filters, query);\n located = regexResult.located.slice(0, maxEntries);\n digestHits = regexResult.digestHits.slice(0, maxDigests);\n queryCoverage = regexResult.coverage;\n if (regexResult.located.length > maxEntries) coverageReasons.add(\"candidate_entry_budget\");\n if (regexResult.digestHits.length > maxDigests) coverageReasons.add(\"candidate_digest_budget\");\n sortLocated(located);\n } else if (plan.kind === \"phrase\") {\n const eligibleEntries = filteredEntryCount(shards, filters);\n located = collectPhraseMatches(shards, plan.phrase, filters, maxEntries);\n if (eligibleEntries > maxEntries) coverageReasons.add(\"candidate_entry_budget\");\n const digestResult = scoreDigestTerms(digests, plan.terms, filters, maxDigests, \"all\");\n digestHits = digestResult.hits;\n if (!digestResult.complete) coverageReasons.add(\"candidate_digest_budget\");\n if (digestHits.length > 0) coverageReasons.add(\"cold_phrase_requires_hydration\");\n if (digestHits.length > 0 && hasFilters(filters)) {\n coverageReasons.add(\"cold_structural_filter_requires_hydration\");\n }\n } else {\n const eligibleEntries = filteredEntryCount(shards, filters);\n located = collectTermMatches(shards, plan.terms, filters, maxEntries, plan.match);\n if (eligibleEntries > maxEntries) coverageReasons.add(\"candidate_entry_budget\");\n const digestResult = scoreDigestTerms(digests, plan.terms, filters, maxDigests, plan.match);\n digestHits = digestResult.hits;\n if (!digestResult.complete) coverageReasons.add(\"candidate_digest_budget\");\n if (digestHits.length > 0 && plan.match === \"all\" && plan.terms.length > 1) {\n coverageReasons.add(\"cold_all_terms_requires_hydration\");\n }\n if (digestHits.length > 0 && hasFilters(filters)) {\n coverageReasons.add(\"cold_structural_filter_requires_hydration\");\n }\n }\n\n sortDigestHits(digestHits);\n for (const reason of queryCoverage.reasons) coverageReasons.add(reason);\n queryCoverage = {\n ...queryCoverage,\n complete: queryCoverage.complete && coverageReasons.size === 0,\n reasons: [...coverageReasons].sort(compareLexical),\n };\n return groupIntoResults(\n shards,\n located,\n digestHits,\n markOnlyMatches,\n matchMode,\n maxItems,\n queryCoverage,\n );\n};\n\nexport const searchShards = (shards: Shard[], query: SearchQuery): Promise<SearchResult> =>\n searchMemoryIndex(shards, [], query);\n\nconst groupIntoResults = (\n shards: Shard[],\n located: LocatedEntry[],\n digestHits: DigestHit[],\n markOnlyMatches: boolean,\n matchMode: MemoryMatchMode,\n maxItems: number,\n queryCoverage: QueryCoverage,\n): SearchResult => {\n if (located.length === 0 && digestHits.length === 0) {\n return {\n matchMode,\n matchedCount: 0,\n totalMatches: 0,\n totalItems: 0,\n segmentCount: 0,\n segments: [],\n digestHits: [],\n items: [],\n queryCoverage,\n };\n }\n\n const shardsByFile = new Map(shards.map((shard) => [shard.sessionFile, shard]));\n const sessionOrder: string[] = [];\n const matchedBySession = new Map<string, Set<number>>();\n const scores = new Map<string, number>();\n for (const item of located) {\n if (!matchedBySession.has(item.entry.sessionFile)) sessionOrder.push(item.entry.sessionFile);\n const set = matchedBySession.get(item.entry.sessionFile) ?? new Set<number>();\n set.add(item.entry.index);\n matchedBySession.set(item.entry.sessionFile, set);\n scores.set(`${item.entry.sessionFile}\\0${item.entry.index}`, item.score);\n }\n\n const segments: SearchSegment[] = [];\n for (const file of sessionOrder) {\n const shard = shardsByFile.get(file);\n const matchedSet = matchedBySession.get(file);\n if (!shard || !matchedSet) continue;\n let current: NormalizedEntry[] = [];\n let currentStart = 0;\n const flush = (): void => {\n if (current.length === 0) return;\n const entries: SearchSegmentEntry[] = current.map((entry) => {\n const matched = matchedSet.has(entry.index);\n return {\n entry,\n matched,\n marker: markOnlyMatches ? (matched ? \">\" : \" \") : \">\",\n score: matched ? scores.get(`${file}\\0${entry.index}`) ?? 0 : 0,\n };\n });\n const matchedEntries = entries.filter((entry) => entry.matched);\n if (markOnlyMatches && matchedEntries.length === 0) {\n current = [];\n return;\n }\n const lastIndex = current[current.length - 1]!.index;\n const range = lastIndex === currentStart ? `#${currentStart}` : `#${currentStart}-#${lastIndex}`;\n const score = Math.max(\n 0,\n ...matchedEntries.map((item) => scores.get(`${file}\\0${item.entry.index}`) ?? 0),\n );\n segments.push({\n sessionId: shard.sessionId,\n sessionFile: shard.sessionFile,\n sourceHash: shard.sourceHash,\n branches: shard.branches,\n lineageFingerprint: shard.lineageFingerprint,\n sessionMtime: shard.mtime,\n range,\n entryRange: { first: currentStart, last: lastIndex },\n entries,\n exactMatches: matchedEntries.map(({ entry }) => ({\n index: entry.index,\n entryId: entry.entryId,\n operationAddress: entry.operationAddress ?? null,\n })),\n matchedCount: matchedEntries.length,\n score,\n tier: shard.tier ?? \"hot\",\n });\n current = [];\n };\n\n for (const entry of shard.entries) {\n if (current.length > 0 && entry.role !== null && segmentStartRoles.has(entry.role)) flush();\n if (current.length === 0) currentStart = entry.index;\n current.push(entry);\n }\n flush();\n }\n\n const items: SearchItem[] = [\n ...segments.map((segment): SearchItem => ({ kind: \"entry\", segment })),\n ...digestHits.map((digest): SearchItem => ({ kind: \"digest\", digest })),\n ];\n items.sort(compareSearchItems);\n const candidateItemsExceeded = items.length > maxItems;\n const limitedItems = items.slice(0, maxItems);\n const limitedSegments = limitedItems\n .filter((item): item is { kind: \"entry\"; segment: SearchSegment } => item.kind === \"entry\")\n .map((item) => item.segment);\n const limitedDigests = limitedItems\n .filter((item): item is { kind: \"digest\"; digest: DigestHit } => item.kind === \"digest\")\n .map((item) => item.digest);\n const matchedCount = limitedSegments.reduce((sum, segment) => sum + segment.matchedCount, 0)\n + limitedDigests.length;\n const finalCoverage = candidateItemsExceeded\n ? {\n ...queryCoverage,\n complete: false,\n reasons: [...new Set([...queryCoverage.reasons, \"candidate_item_budget\"])].sort(compareLexical),\n }\n : queryCoverage;\n return {\n matchMode,\n matchedCount,\n totalMatches: matchedCount,\n totalItems: limitedItems.length,\n segmentCount: limitedSegments.length,\n segments: limitedSegments,\n digestHits: limitedDigests,\n items: limitedItems,\n queryCoverage: finalCoverage,\n };\n};\n\nconst compareSearchItems = (left: SearchItem, right: SearchItem): number => {\n const leftValue = left.kind === \"entry\" ? left.segment : left.digest;\n const rightValue = right.kind === \"entry\" ? right.segment : right.digest;\n if (rightValue.score !== leftValue.score) return rightValue.score - leftValue.score;\n if (rightValue.sessionMtime !== leftValue.sessionMtime) return rightValue.sessionMtime - leftValue.sessionMtime;\n if (left.kind !== right.kind) return left.kind === \"entry\" ? -1 : 1;\n if (left.kind === \"entry\" && right.kind === \"entry\") {\n const leftIndex = left.segment.entries[0]?.entry.index ?? 0;\n const rightIndex = right.segment.entries[0]?.entry.index ?? 0;\n if (leftIndex !== rightIndex) return leftIndex - rightIndex;\n return compareLexical(left.segment.sessionFile, right.segment.sessionFile);\n }\n if (left.kind === \"digest\" && right.kind === \"digest\") {\n return compareLexical(left.digest.sessionFile, right.digest.sessionFile);\n }\n return 0;\n};\n"],
5
- "mappings": ";;;;;;;;;;;;;;AAAA,OAAOA,aAAY;AACnB,OAAOC,SAAQ;AACf,OAAO,UAAU;;;ACFjB,OAAO,YAAY;AACnB,OAAO,QAAQ;AA6Bf,IAAM,oBAAoB,CAAC,UACzB,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK,IAC/D,QACA;AAEN,IAAM,iBAAiB,CAAC,WAAqC,OAAO,SAAS;AAE7E,IAAM,gBAAgB,CACpB,WAEA,OAAO,OAAO,OAAO,aAAa,OAAO,aAAa,QAAQ,OAAO,OAAO,aAAa;AAE3F,IAAM,4BAA4B,CAAC,YAAiD;AAClF,QAAM,QAAyB,CAAC;AAChC,MAAI,UAAU;AACd,aAAW,SAAS,SAAS;AAC3B,UAAM,SAAS,kBAAkB,KAAK;AACtC,QAAI,CAAC,UAAU,eAAe,MAAM,EAAG;AACvC,QAAI,cAAc,MAAM,EAAG,OAAM,KAAK,EAAE,IAAI,OAAO,IAAI,UAAU,OAAO,UAAU,QAAQ,CAAC;AAC3F,eAAW;AAAA,EACb;AACA,SAAO;AACT;AAEA,IAAM,cAAc,CAAC,UAA0B,QAAuB,QACpE,OAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,UAAU,EAAE,UAAU,QAAQ,IAAI,CAAC,CAAC,EAAE,OAAO,KAAK;AAE5F,IAAM,qBAAqB,CAAC,gBAAyC;AACnE,MAAI;AACJ,MAAI;AACF,cAAU,GAAG,aAAa,aAAa,MAAM;AAAA,EAC/C,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,QAAM,UAAqB,CAAC;AAC5B,aAAW,QAAQ,QAAQ,MAAM,IAAI,GAAG;AACtC,QAAI,CAAC,KAAK,KAAK,EAAG;AAClB,QAAI;AACF,cAAQ,KAAK,KAAK,MAAM,IAAI,CAAC;AAAA,IAC/B,QAAQ;AACN;AAAA,IACF;AAAA,EACF;AACA,SAAO,0BAA0B,OAAO;AAC1C;AAEA,IAAM,aAAa,OAAuB;AAAA,EACxC,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,aAAa,YAAY,OAAO,MAAM,CAAC,CAAC;AAAA,EACxC,iBAAiB,CAAC;AACpB;AAQO,IAAM,4BAA4B,CACvC,aACA,UACA,eAEA,aAAa,QAAQ,WAAW,IAAI,mBAAmB,mBAAmB,WAAW,GAAG,UAAU;AAEpG,IAAM,qBAAqB,CAAC,OAAwB,YAAgC,mBAAmD;AACrI,QAAM,OAAO,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;AACzD,QAAM,UAAU,YAAY,QAAQ,QAAQ,CAAC,UAAU;AACrD,QAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO,CAAC;AACjF,UAAM,KAAM,MAAkC;AAC9C,WAAO,OAAO,OAAO,WAAW,CAAC,EAAE,IAAI,CAAC;AAAA,EAC1C,CAAC;AACD,QAAM,SAAS,aAAa,WAAW,SAAS,mBAAmB,SAAY,iBAAkB,MAAM,MAAM,SAAS,CAAC,GAAG,MAAM;AAChI,QAAMC,QAAwB,CAAC;AAC/B,QAAM,UAAU,oBAAI,IAAY;AAEhC,MAAI,SAAS;AACX,eAAW,MAAM,SAAS;AACxB,YAAM,OAAO,KAAK,IAAI,EAAE;AACxB,UAAI,KAAM,CAAAA,MAAK,KAAK,IAAI;AAAA,IAC1B;AAAA,EACF,OAAO;AACL,UAAM,OAAO,oBAAI,IAAY;AAC7B,QAAI,UAAU,SAAS,KAAK,IAAI,MAAM,IAAI;AAC1C,WAAO,SAAS;AACd,UAAI,KAAK,IAAI,QAAQ,EAAE,GAAG;AACxB,gBAAQ,IAAI,sBAAsB;AAClC;AAAA,MACF;AACA,WAAK,IAAI,QAAQ,EAAE;AACnB,MAAAA,MAAK,KAAK,OAAO;AACjB,gBAAU,QAAQ,WAAW,KAAK,IAAI,QAAQ,QAAQ,IAAI;AAAA,IAC5D;AACA,IAAAA,MAAK,QAAQ;AAAA,EACf;AAEA,QAAM,MAAM,WAAWA,MAAK,IAAI,CAAC,SAAS,KAAK,EAAE;AACjD,SAAO;AAAA,IACL,UAAU;AAAA,IACV;AAAA,IACA,eAAe,IAAI,IAAIA,MAAK,IAAI,CAAC,SAAS,KAAK,OAAO,CAAC;AAAA,IACvD,aAAa,YAAY,UAAU,QAAQ,GAAG;AAAA,IAC9C,iBAAiB,CAAC,GAAG,OAAO,EAAE,KAAK;AAAA,EACrC;AACF;AAMO,IAAM,4BAA4B,CACvC,SACA,UACA,YACA,mBAEA,aAAa,QAAQ,WAAW,IAAI,mBAAmB,0BAA0B,OAAO,GAAG,YAAY,cAAc;;;ADzIhH,IAAM,uBAAuB;AAC7B,IAAM,uBAAuB;AACpC,IAAM,oCAAoC,MAAM;AAChD,IAAM,+BAA+B,OAAO;AAC5C,IAAM,4BAA4B;AAClC,IAAM,gCAAgC,MAAM,OAAO;AACnD,IAAM,kCAAkC;AAqDxC,IAAM,gBAAgB,CAAC,gBAAgC;AACrD,QAAM,OAAOC,QAAO,WAAW,MAAM,EAAE,OAAO,WAAW,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACpF,QAAM,WAAW,KAAK,SAAS,WAAW,EAAE,QAAQ,oBAAoB,GAAG;AAC3E,SAAO,GAAG,IAAI,IAAI,QAAQ;AAC5B;AAEA,IAAM,kBAAkB,CAAC,aAAqC,aAAa,QAAQ,SAAS;AAErF,IAAM,sBAAsB,CACjC,aACA,UACA,WAA2B,aAChB,KAAK,KAAK,UAAU,GAAG,cAAc,WAAW,CAAC,GAAG,gBAAgB,QAAQ,CAAC,OAAO;AAE1F,IAAM,uBAAuB,CAClC,aACA,UACA,WAA2B,aAChB,KAAK,KAAK,UAAU,GAAG,cAAc,WAAW,CAAC,GAAG,gBAAgB,QAAQ,CAAC,cAAc;AAExG,IAAM,gBAAgB,CAAC,YACrB,YAAY,QAAQ,iBAAiB,6BAA6B,aAAa,gBAAgB,QAAQ,mBAAmB,6BAA6B,eAAe;AACjK,IAAM,cAAc,CAAC,SAA6B,YACvD,SAAS,QAAQ,aAAa,aAAa,QAAQ,QAAQ,YAAY,QAAQ,WAAW,IAAI,cAAc,OAAO,CAAC;AAC/G,IAAM,eAAe,CAAC,SAA6B,YACxD,SAAS,QAAQ,0BAA0B,iCAAiC,UAAU,QAAQ,qBAAqB,4BAA4B,aAAa,QAAQ,QAAQ,YAAY,QAAQ,WAAW,IAAI,cAAc,OAAO,CAAC;AAEvO,IAAM,iBAAiB,CAAC,aAAqB,YAC3C;AAAA,EACE;AAAA,EACA,QAAQ,YAAY;AAAA,EACpB,QAAQ,oBAAoB,WAAW;AACzC;AAEF,IAAM,uBAAuB,CAAC,SAA6B,aAA6B;AAAA,EACtF;AAAA,EACA,eAAe,QAAQ,iBAAiB,6BAA6B;AAAA,EACrE,iBAAiB,QAAQ,mBAAmB,6BAA6B;AAC3E;AAEA,IAAM,gBAAgB,CACpB,UACA,WAAW,kCACM;AACjB,MAAI;AACF,UAAM,OAAOC,IAAG,SAAS,QAAQ;AACjC,QAAI,CAAC,KAAK,OAAO,KAAK,KAAK,OAAO,SAAU,QAAO;AACnD,UAAM,SAAS,KAAK,MAAMA,IAAG,aAAa,UAAU,MAAM,CAAC;AAC3D,QACE,OAAO,iBAAiB,wBACxB,OAAO,SAAS,WAChB,OAAO,OAAO,gBAAgB,YAC9B,OAAO,OAAO,cAAc,YAC5B,OAAO,OAAO,eAAe,YAC7B,OAAO,WAAW,WAAW,MAC5B,OAAO,aAAa,YAAY,OAAO,aAAa,SACrD,OAAO,OAAO,uBAAuB,YACrC,OAAO,mBAAmB,WAAW,MACrC,OAAO,OAAO,WAAW,YACzB,OAAO,OAAO,eAAe,YAC7B,OAAO,eAAe,KAAK,QAC3B,OAAO,OAAO,qBAAqB,YACnC,OAAO,OAAO,oBAAoB,YAClC,OAAO,OAAO,kBAAkB,YAChC,OAAO,kBAAkB,QACzB,OAAO,OAAO,cAAc,aAAa,aACzC,CAAC,MAAM,QAAQ,OAAO,cAAc,OAAO,KAC3C,CAAC,OAAO,cAAc,QAAQ,MAAM,CAAC,WAAW,OAAO,WAAW,QAAQ,KAC1E,CAAC,MAAM,QAAQ,OAAO,OAAO,KAC7B,CAAC,OAAO,QAAQ,MAAM,CAAC,UACrB,UAAU,QACV,OAAO,UAAU,YACjB,OAAO,MAAM,UAAU,YACvB,OAAO,MAAM,gBAAgB,YAC7B,OAAO,MAAM,SAAS,QAAQ,EAChC,QAAO;AACT,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,iBAAiB,CACrB,UACA,WAAW,iCACY;AACvB,MAAI;AACF,UAAM,OAAOA,IAAG,SAAS,QAAQ;AACjC,QAAI,CAAC,KAAK,OAAO,KAAK,KAAK,OAAO,SAAU,QAAO;AACnD,UAAM,SAAS,KAAK,MAAMA,IAAG,aAAa,UAAU,MAAM,CAAC;AAC3D,QACE,OAAO,iBAAiB,wBACxB,OAAO,SAAS,YAChB,OAAO,OAAO,cAAc,YAC5B,OAAO,OAAO,SAAS,YACvB,OAAO,OAAO,eAAe,YAC7B,OAAO,WAAW,WAAW,MAC5B,OAAO,aAAa,YAAY,OAAO,aAAa,SACrD,OAAO,OAAO,uBAAuB,YACrC,OAAO,mBAAmB,WAAW,MACrC,OAAO,OAAO,WAAW,YACzB,OAAO,OAAO,eAAe,YAC7B,OAAO,eAAe,KAAK,QAC3B,OAAO,OAAO,qBAAqB,YACnC,CAAC,MAAM,QAAQ,OAAO,YAAY,KAClC,CAAC,MAAM,QAAQ,OAAO,UAAU,KAChC,CAAC,OAAO,WAAW,MAAM,CAAC,MAAM,UAC9B,OAAO,SAAS,aAAa,UAAU,KAAK,OAAO,WAAW,QAAQ,CAAC,IAAK,KAAK,KACnF,CAAC,MAAM,QAAQ,OAAO,SAAS,KAC/B,CAAC,OAAO,UAAU,MAAM,CAAC,YACvB,MAAM,QAAQ,OAAO,KACrB,QAAQ,WAAW,MACnB,OAAO,QAAQ,CAAC,MAAM,aACrB,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,cAC7C,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,cAC7C,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,cAC7C,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,cAC7C,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,cAC7C,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,cAC7C,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,cAC7C,QAAQ,CAAC,MAAM,QAAQ,OAAO,QAAQ,CAAC,MAAM,cAC7C,QAAQ,CAAC,MAAM,QACd,QAAQ,CAAC,MAAM,eACf,QAAQ,CAAC,MAAM,YACf,QAAQ,CAAC,MAAM,aACf,QAAQ,CAAC,MAAM,YAAY,KAC/B,OAAO,OAAO,kBAAkB,YAChC,OAAO,kBAAkB,QACzB,OAAO,OAAO,cAAc,aAAa,aACzC,OAAO,OAAO,cAAc,oBAAoB,YAChD,CAAC,MAAM,QAAQ,OAAO,cAAc,OAAO,KAC3C,CAAC,OAAO,cAAc,QAAQ,MAAM,CAAC,WAAW,OAAO,WAAW,QAAQ,KAC1E,OAAO,OAAO,UAAU,YACxB,OAAO,OAAO,SAAS,SACvB,QAAO;AACT,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,kBAAkB,CAAC,UACvB,OAAO,WAAW,KAAK,UAAU,KAAK,GAAG,MAAM;AAEjD,IAAM,oBAAoB,CAAwB,UAAgB;AAChE,MAAI,WAAW;AACf,WAAS,YAAY,GAAG,YAAY,GAAG,aAAa,GAAG;AACrD,UAAM,QAAQ,gBAAgB,KAAK;AACnC,UAAM,aAAa;AACnB,UAAM,mBAAmB,MAAM,SAAS,IAAI,IAAI,QAAQ,QAAQ,MAAM,MAAM,QAAQ,CAAC,CAAC;AACtF,QAAI,UAAU,SAAU;AACxB,eAAW;AAAA,EACb;AACA,QAAM,aAAa,gBAAgB,KAAK;AACxC,QAAM,mBAAmB,MAAM,SAAS,IACpC,IACA,QAAQ,MAAM,aAAa,MAAM,MAAM,QAAQ,CAAC,CAAC;AACrD,SAAO;AACT;AAEA,IAAM,iBAAiB,CAAC,UAAkB,UAAwC;AAChF,MAAI;AACF,IAAAA,IAAG,UAAU,KAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AACrE,QAAI;AAAE,MAAAA,IAAG,UAAU,KAAK,QAAQ,QAAQ,GAAG,GAAK;AAAA,IAAG,QAAQ;AAAA,IAAC;AAC5D,IAAAA,IAAG,cAAc,UAAU,KAAK,UAAU,KAAK,GAAG,EAAE,UAAU,QAAQ,MAAM,IAAM,CAAC;AACnF,QAAI;AAAE,MAAAA,IAAG,UAAU,UAAU,GAAK;AAAA,IAAG,QAAQ;AAAA,IAAC;AAC9C,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,kBAAkB,CAAC,aAA2B;AAClD,MAAI;AACF,IAAAA,IAAG,OAAO,UAAU,EAAE,OAAO,MAAM,WAAW,KAAK,CAAC;AAAA,EACtD,QAAQ;AAAA,EAER;AACF;AAQO,IAAM,oBAAoB,CAAC,SAAqC;AACrE,MAAI;AACF,UAAM,UAAUA,IAAG,aAAa,IAAI;AACpC,UAAM,OAAOA,IAAG,SAAS,IAAI;AAC7B,QAAI,CAAC,KAAK,OAAO,EAAG,QAAO;AAC3B,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,YAAYD,QAAO,WAAW,QAAQ,EAAE,OAAO,OAAO,EAAE,OAAO,KAAK;AAAA,IACtE;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,eAAe,CACnB,OACA,OACA,WAEA,UAAU,QACV,MAAM,UAAU,MAAM,SACtB,MAAM,SAAS,MAAM,QACrB,MAAM,eAAe,MAAM,cAC3B,MAAM,WAAW;AAEZ,IAAM,eAAe,CAC1B,KACA,SACA,SAAS,0BACE;AAAA,EACX,cAAc;AAAA,EACd,MAAM;AAAA,EACN,aAAa,IAAI;AAAA,EACjB,WAAW,IAAI;AAAA,EACf,OAAO;AAAA,EACP,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,UAAU,QAAQ;AAAA,EAClB,oBAAoB,QAAQ;AAAA,EAC5B,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,kBAAkB;AAAA,EAClB,SAAS,CAAC;AAAA,EACV,iBAAiB;AAAA,EACjB,eAAe,EAAE,UAAU,OAAO,SAAS,CAAC,MAAM,EAAE;AAAA,EACpD,MAAM;AAAA,EACN,aAAa;AACf;AAEO,IAAM,YAAY,CAAC,KAAiB,YAAuC;AAChF,QAAM,UAAU,eAAe,IAAI,MAAM,OAAO;AAChD,QAAM,WAAW,oBAAoB,IAAI,MAAM,QAAQ,UAAU,QAAQ,QAAQ;AACjF,QAAM,QAAQ,kBAAkB,IAAI,IAAI;AACxC,MAAI,CAAC,OAAO;AACV,oBAAgB,QAAQ;AACxB,WAAO,aAAa,KAAK,OAAO;AAAA,EAClC;AACA,QAAM,SAAS,YAAY,SAAS,OAAO;AAC3C,QAAM,SAAS;AAAA,IACb;AAAA,IACA,QAAQ,sBAAsB;AAAA,EAChC;AACA,MAAI,aAAa,QAAQ,OAAO,MAAM,KAAK,QAAQ,gBAAgB,IAAI,KAAM,QAAO;AACpF,MAAIC,IAAG,WAAW,QAAQ,EAAG,iBAAgB,QAAQ;AACrD,QAAM,EAAE,SAAS,QAAQ,cAAc,IAAI;AAAA,IACzC,IAAI;AAAA,IACJ,QAAQ;AAAA,IACR,qBAAqB,SAAS,OAAO;AAAA,EACvC;AACA,QAAM,aAAa,kBAAkB,IAAI,IAAI;AAC7C,QAAM,eAAe,eAAe,IAAI,MAAM,OAAO;AACrD,MACE,CAAC,cACD,WAAW,eAAe,MAAM,cAChC,aAAa,gBAAgB,QAAQ,aACrC;AACA,oBAAgB,QAAQ;AACxB,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,YAAY,eAAe,MAAM,aAC7B,iCACA;AAAA,IACN;AAAA,EACF;AACA,QAAM,QAAQ,kBAAyB;AAAA,IACrC,cAAc;AAAA,IACd,MAAM;AAAA,IACN,aAAa,IAAI;AAAA,IACjB,WAAW,QAAQ,aAAa,IAAI;AAAA,IACpC,GAAG;AAAA,IACH,UAAU,QAAQ;AAAA,IAClB,oBAAoB,QAAQ;AAAA,IAC5B;AAAA,IACA,YAAY;AAAA,IACZ,kBAAkB;AAAA,IAClB;AAAA,IACA,iBAAiB,QAAQ;AAAA,IACzB;AAAA,IACA,MAAM;AAAA,EACR,CAAC;AACD,iBAAe,UAAU,KAAK;AAC9B,SAAO;AACT;AAEA,IAAM,eAAe,CACnB,KACA,SACA,eACU;AACV,QAAM,UAAU,eAAe,IAAI,MAAM,OAAO;AAChD,QAAM,QAAQ,kBAAkB,IAAI,IAAI;AACxC,MAAI,CAAC,MAAO,QAAO,EAAE,GAAG,aAAa,KAAK,OAAO,GAAG,MAAM,OAAO;AACjE,QAAM,EAAE,SAAS,QAAQ,cAAc,IAAI;AAAA,IACzC,IAAI;AAAA,IACJ,QAAQ;AAAA,IACR,qBAAqB,SAAS,OAAO;AAAA,EACvC;AACA,QAAM,aAAa,kBAAkB,IAAI,IAAI;AAC7C,QAAM,eAAe,eAAe,IAAI,MAAM,OAAO;AACrD,MACE,CAAC,cACD,WAAW,eAAe,MAAM,cAChC,aAAa,gBAAgB,QAAQ,aACrC;AACA,WAAO;AAAA,MACL,GAAG;AAAA,QACD;AAAA,QACA;AAAA,QACA,YAAY,eAAe,MAAM,aAC7B,iCACA;AAAA,MACN;AAAA,MACA,MAAM;AAAA,IACR;AAAA,EACF;AACA,QAAM,WAAW,aACb,QAAQ,OAAO,CAAC,UAAU,MAAM,SAAS,WAAW,SAAS,MAAM,SAAS,WAAW,IAAI,IAC3F;AACJ,SAAO;AAAA,IACL,cAAc;AAAA,IACd,MAAM;AAAA,IACN,aAAa,IAAI;AAAA,IACjB,WAAW,QAAQ,aAAa,IAAI;AAAA,IACpC,GAAG;AAAA,IACH,UAAU,QAAQ;AAAA,IAClB,oBAAoB,QAAQ;AAAA,IAC5B,QAAQ,YAAY,SAAS,OAAO;AAAA,IACpC,YAAY;AAAA,IACZ,kBAAkB;AAAA,IAClB,SAAS;AAAA,IACT,iBAAiB,QAAQ;AAAA,IACzB;AAAA,IACA,MAAM;AAAA,EACR;AACF;AAEO,IAAM,gBAAgB,CAC3B,KACA,SACA,SAAS,0BACQ;AAAA,EACjB,cAAc;AAAA,EACd,MAAM;AAAA,EACN,WAAW,IAAI;AAAA,EACf,MAAM,IAAI;AAAA,EACV,KAAK,IAAI;AAAA,EACT,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,cAAc,CAAC;AAAA,EACf,eAAe,CAAC;AAAA,EAChB,YAAY;AAAA,EACZ,YAAY,CAAC;AAAA,EACb,WAAW,CAAC;AAAA,EACZ,eAAe,EAAE,UAAU,OAAO,iBAAiB,GAAG,SAAS,CAAC,MAAM,EAAE;AAAA,EACxE,OAAO;AAAA,EACP,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,UAAU,QAAQ;AAAA,EAClB,oBAAoB,QAAQ;AAAA,EAC5B,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,kBAAkB;AACpB;AAEA,IAAM,mBAAmB,CACvB,QACA,SACQ;AACR,MAAI,MAAM;AACV,MAAI,OAAO,OAAO;AAClB,SAAO,MAAM,MAAM;AACjB,UAAM,SAAS,KAAK,MAAM,MAAM,QAAQ,CAAC;AACzC,QAAI,KAAK,OAAO,MAAM,GAAG,MAAM,CAAC,EAAG,OAAM;AAAA,QACpC,QAAO,SAAS;AAAA,EACvB;AACA,SAAO,OAAO,MAAM,GAAG,GAAG;AAC5B;AAEO,IAAM,iBAAiB,CAAC,QAAqB,aAAkC;AACpF,oBAAkB,MAAM;AACxB,MAAI,OAAO,cAAc,SAAU,QAAO;AAE1C,SAAO,cAAc,WAAW;AAChC,MAAI,CAAC,OAAO,cAAc,QAAQ,SAAS,sBAAsB,GAAG;AAClE,WAAO,cAAc,QAAQ,KAAK,sBAAsB;AAAA,EAC1D;AACA,SAAO,YAAY,iBAAiB,OAAO,WAAW,CAAC,cAAc;AACnE,WAAO,YAAY;AACnB,sBAAkB,MAAM;AACxB,WAAO,OAAO,cAAc;AAAA,EAC9B,CAAC;AACD,oBAAkB,MAAM;AACxB,MAAI,OAAO,cAAc,SAAU,QAAO;AAE1C,SAAO,aAAa,iBAAiB,OAAO,YAAY,CAAC,eAAe;AACtE,WAAO,aAAa;AACpB,WAAO,cAAc,kBAAkB,gBAAgB,UAAU;AACjE,sBAAkB,MAAM;AACxB,WAAO,OAAO,cAAc;AAAA,EAC9B,CAAC;AACD,SAAO,cAAc,kBAAkB,gBAAgB,OAAO,UAAU;AACxE,SAAO,kBAAkB,MAAM;AACjC;AAEO,IAAM,aAAa,CAAC,KAAiB,YAA6C;AACvF,QAAM,UAAU,eAAe,IAAI,MAAM,OAAO;AAChD,QAAM,WAAW,qBAAqB,IAAI,MAAM,QAAQ,UAAU,QAAQ,QAAQ;AAClF,QAAM,QAAQ,kBAAkB,IAAI,IAAI;AACxC,MAAI,CAAC,OAAO;AACV,oBAAgB,QAAQ;AACxB,WAAO,cAAc,KAAK,OAAO;AAAA,EACnC;AACA,QAAM,SAAS,aAAa,SAAS,OAAO;AAC5C,QAAM,gBAAgB,QAAQ,qBAAqB;AACnD,QAAM,SAAS,eAAe,UAAU,aAAa;AACrD,MACE,aAAa,QAAQ,OAAO,MAAM,KAClC,QAAQ,SAAS,IAAI,QACrB,gBAAgB,MAAM,KAAK,cAC3B,QAAO;AACT,MAAIA,IAAG,WAAW,QAAQ,EAAG,iBAAgB,QAAQ;AAErD,QAAM,EAAE,SAAS,QAAQ,cAAc,IAAI;AAAA,IACzC,IAAI;AAAA,IACJ,OAAO;AAAA,IACP,qBAAqB,SAAS,OAAO;AAAA,EACvC;AACA,QAAM,aAAa,kBAAkB,IAAI,IAAI;AAC7C,QAAM,eAAe,eAAe,IAAI,MAAM,OAAO;AACrD,MACE,CAAC,cACD,WAAW,eAAe,MAAM,cAChC,aAAa,gBAAgB,QAAQ,aACrC;AACA,oBAAgB,QAAQ;AACxB,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,YAAY,eAAe,MAAM,aAC7B,iCACA;AAAA,IACN;AAAA,EACF;AACA,QAAM,SAAS,kBAAkB;AAAA,IAC/B,WAAW,QAAQ,aAAa,IAAI;AAAA,IACpC,MAAM,IAAI;AAAA,IACV,KAAK,QAAQ,OAAO,IAAI;AAAA,IACxB;AAAA,IACA,oBACE,QAAQ,0BAA0B;AAAA,IACpC,uBAAuB;AAAA,EACzB,CAAC;AACD,QAAM,YAAY,eAAe;AAAA,IAC/B,cAAc;AAAA,IACd,MAAM;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,IACH,UAAU,QAAQ;AAAA,IAClB,oBAAoB,QAAQ;AAAA,IAC5B;AAAA,IACA,YAAY;AAAA,IACZ,kBAAkB;AAAA,EACpB,GAAG,aAAa;AAChB,MAAI,UAAU,cAAc,cAAe,gBAAe,UAAU,SAAS;AAC7E,SAAO;AACT;AAEA,IAAM,uBAAuB,CAAC,MAAkB,UAA8B;AAC5E,MAAI,MAAM,UAAU,KAAK,MAAO,QAAO,MAAM,QAAQ,KAAK;AAC1D,SAAO,eAAe,KAAK,MAAM,MAAM,IAAI;AAC7C;AAEO,IAAM,uBAAuB,CAClC,MACA,cAAc,yBACc;AAC5B,QAAM,SAAS,CAAC,GAAG,IAAI,EAAE,KAAK,oBAAoB;AAClD,QAAM,MAAM,IAAI,IAAI,OAAO,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,MAAM,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;AAChG,SAAO,IAAI,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI,QAAQ,MAAM,CAAC,CAAC;AACpF;AAmBA,IAAM,wBAAwB,CAC5B,UACA,iBACA,UACA,aAC6C;AAC7C,MAAI;AACJ,MAAI;AACF,gBAAYA,IAAG,YAAY,QAAQ;AAAA,EACrC,QAAQ;AACN,WAAO,EAAE,UAAU,MAAM,SAAS,CAAC,EAAE;AAAA,EACvC;AACA,MAAI,YAAY;AAChB,MAAI,iBAAiB;AACrB,MAAI;AACF,WAAO,MAAM;AACX,YAAM,QAAQ,UAAU,SAAS;AACjC,UAAI,CAAC,MAAO,QAAO,EAAE,UAAU,MAAM,SAAS,CAAC,EAAE;AACjD,UAAI,CAAC,MAAM,KAAK,SAAS,OAAO,EAAG;AACnC,UAAI,aAAa,UAAU;AACzB,eAAO,EAAE,UAAU,OAAO,SAAS,CAAC,sBAAsB,EAAE;AAAA,MAC9D;AACA,mBAAa;AACb,YAAM,YAAY,KAAK,KAAK,UAAU,MAAM,IAAI;AAChD,UAAI,CAAC,MAAM,OAAO,GAAG;AACnB,wBAAgB,SAAS;AACzB;AAAA,MACF;AACA,UAAI;AACJ,UAAI;AACF,qBAAaA,IAAG,SAAS,SAAS,EAAE;AAAA,MACtC,QAAQ;AACN,wBAAgB,SAAS;AACzB;AAAA,MACF;AACA,UAAI,iBAAiB,aAAa,UAAU;AAC1C,eAAO,EAAE,UAAU,OAAO,SAAS,CAAC,sBAAsB,EAAE;AAAA,MAC9D;AACA,wBAAkB;AAClB,UAAI;AACF,cAAM,SAAS,KAAK,MAAMA,IAAG,aAAa,WAAW,MAAM,CAAC;AAC5D,cAAM,OAAO,OAAO;AACpB,cAAM,SAAS,SAAS,WAAW,OAAO,OAAO,gBAAgB,WAC7D,OAAO,cACP,SAAS,YAAY,OAAO,OAAO,SAAS,WAAW,OAAO,OAAO;AACzE,cAAM,WAAW,OAAO,aAAa,YAAY,OAAO,aAAa,QACjE,OAAO,WACP;AACJ,YAAI,aAAa,QAAQ,aAAa,gBAAiB;AACvD,cAAM,WAAW,UAAU,YAAY,SAAS,UAC5C,oBAAoB,QAAQ,UAAU,QAAQ,IAC9C,UAAU,YAAY,SAAS,WAC7B,qBAAqB,QAAQ,UAAU,QAAQ,IAC/C;AACN,cAAM,oBAAoB,SAAS,UAC/B,cAAc,WAAW,UAAU,MAAM,OACzC,SAAS,WAAW,eAAe,WAAW,UAAU,MAAM,OAAO;AACzE,YACE,OAAO,iBAAiB,wBACxB,WAAW,QACX,aAAa,aACb,CAACA,IAAG,WAAW,MAAM,KACrB,CAAC,kBACD,iBAAgB,SAAS;AAAA,MAC7B,QAAQ;AACN,wBAAgB,SAAS;AAAA,MAC3B;AAAA,IACF;AAAA,EACF,UAAE;AACA,cAAU,UAAU;AAAA,EACtB;AACF;AAEA,IAAM,aAAa,CAAC,SAAgC;AAClD,MAAI;AACF,UAAM,OAAOA,IAAG,SAAS,IAAI;AAC7B,WAAO,KAAK,OAAO,IAAI,KAAK,OAAO;AAAA,EACrC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,IAAM,kBAAkB,CAC7B,MACA,SACA,SACA,UAAU,OACV,eACsB;AACtB,QAAM,UAAU;AAAA,IACd,QAAQ;AAAA,IACR,QAAQ,YAAY;AAAA,IACpB,QAAQ,wBAAwB;AAAA,IAChC,QAAQ,sBAAsB;AAAA,EAChC;AACA,QAAM,WAAW,QAAQ,SAAS,IAAI,UAAU;AAChD,QAAM,QAAQ,qBAAqB,UAAU,QAAQ,eAAe,oBAAoB;AACxF,QAAM,cAAc,QAAQ,mBAAmB;AAC/C,QAAM,iBAAiB,QAAQ,sBAAsB;AACrD,QAAM,SAAkB,CAAC;AACzB,QAAM,UAAyB,CAAC;AAChC,QAAM,UAAU,IAAI,IAAI,QAAQ,OAAO;AACvC,MAAI,kBAAkB;AACtB,MAAI,qBAAqB;AACzB,MAAI,oBAAoB;AACxB,MAAI,uBAAuB;AAE3B,aAAW,OAAO,MAAM;AACtB,UAAM,OAAO,WAAW,IAAI,IAAI;AAChC,QAAI,SAAS,MAAM;AACjB,cAAQ,IAAI,oBAAoB;AAChC;AAAA,IACF;AACA,QAAI,qBAAqB,aAAa;AACpC,cAAQ,IAAI,mBAAmB;AAC/B;AAAA,IACF;AACA,UAAM,OAAO,MAAM,IAAI,IAAI,IAAI,KAAK;AACpC,UAAM,kBAAkB,QAAQ,WAAW,SAAS,SAAS,IAAI;AACjE,QAAI,uBAAuB,kBAAkB,gBAAgB;AAC3D,cAAQ,IAAI,uBAAuB;AACnC;AAAA,IACF;AACA,yBAAqB;AACrB,4BAAwB;AACxB,QAAI;AACF,UAAI,SAAS;AACX,YAAI,SAAS,OAAQ,YAAW,KAAK,OAAO;AAC5C,cAAM,QAAQ,aAAa,KAAK,SAAS,UAAU;AACnD,eAAO,KAAK,KAAK;AACjB,YAAI,MAAM,WAAY,oBAAmB;AAAA,YACpC,SAAQ,IAAI,MAAM,eAAe,oBAAoB;AAC1D,YAAI,MAAM,cAAc,CAAC,MAAM,cAAc,UAAU;AACrD,gCAAsB;AACtB,qBAAW,UAAU,MAAM,cAAc,QAAS,SAAQ,IAAI,MAAM;AAAA,QACtE;AAAA,MACF,WAAW,SAAS,OAAO;AACzB,cAAM,QAAQ,UAAU,KAAK,OAAO;AACpC,wBAAgB;AAAA,UACd,IAAI;AAAA,UACJ,QAAQ;AAAA,UACR,QAAQ,YAAY;AAAA,QACtB,CAAC;AACD,eAAO,KAAK,KAAK;AACjB,YAAI,MAAM,WAAY,oBAAmB;AAAA,YACpC,SAAQ,IAAI,MAAM,eAAe,oBAAoB;AAC1D,YAAI,MAAM,cAAc,CAAC,MAAM,cAAc,UAAU;AACrD,gCAAsB;AACtB,qBAAW,UAAU,MAAM,cAAc,QAAS,SAAQ,IAAI,MAAM;AAAA,QACtE;AAAA,MACF,OAAO;AACL,cAAM,SAAS,WAAW,KAAK,OAAO;AACtC,wBAAgB;AAAA,UACd,IAAI;AAAA,UACJ,QAAQ;AAAA,UACR,QAAQ,YAAY;AAAA,QACtB,CAAC;AACD,gBAAQ,KAAK,MAAM;AACnB,YAAI,OAAO,WAAY,oBAAmB;AAC1C,YAAI,CAAC,OAAO,cAAc,UAAU;AAClC,gCAAsB;AACtB,qBAAW,UAAU,OAAO,cAAc,QAAS,SAAQ,IAAI,MAAM;AAAA,QACvE;AAAA,MACF;AAAA,IACF,QAAQ;AACN,cAAQ,IAAI,aAAa;AAAA,IAC3B;AAAA,EACF;AAEA,QAAM,mBAAmB,KAAK;AAC9B,QAAM,gBAAgB,mBAAmB;AACzC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU;AAAA,MACR,UAAU,QAAQ,YAAY,kBAAkB,KAAK,uBAAuB;AAAA,MAC5E;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,cAAc;AAAA,IAC3C;AAAA,EACF;AACF;AAaA,IAAM,iBAAiB,CAAC,OAAwB,YAAoC;AAClF,MAAI,QAAQ,SAAS,UAAa,MAAM,SAAS,QAAQ,KAAM,QAAO;AACtE,MAAI,QAAQ,SAAS,UAAa,MAAM,aAAa,QAAQ,KAAM,QAAO;AAC1E,MAAI,QAAQ,QAAQ,UAAa,MAAM,QAAQ,QAAQ,IAAK,QAAO;AACnE,MAAI,QAAQ,aAAa,UAAa,MAAM,aAAa,QAAQ,SAAU,QAAO;AAClF,MAAI,QAAQ,WAAW,UAAa,MAAM,WAAW,QAAQ,OAAQ,QAAO;AAC5E,MAAI,QAAQ,YAAY,UAAa,MAAM,YAAY,QAAQ,QAAS,QAAO;AAC/E,MAAI,QAAQ,UAAU,UAAa,MAAM,cAAc,QAAQ,MAAM,YAAY,QAAQ,MAAO,QAAO;AACvG,MAAI,QAAQ,UAAU,UAAa,MAAM,cAAc,QAAQ,MAAM,YAAY,QAAQ,MAAO,QAAO;AACvG,SAAO;AACT;AAsBO,IAAM,YAAY,CACvB,QACA,OACA,SACA,iBAAiB,OAAO,qBACN;AAClB,QAAM,aAAa,CAAC,GAAG,IAAI,IAAI,MAAM,QAAQ,CAAC,SAAS,gBAAgB,IAAI,CAAC,CAAC,CAAC;AAC9E,QAAM,WAAqF,CAAC;AAC5F,aAAW,SAAS,QAAQ;AAC1B,eAAW,SAAS,MAAM,SAAS;AACjC,UAAI,eAAe,OAAO,OAAO,KAAK,SAAS,SAAS,gBAAgB;AACtE,iBAAS,KAAK,EAAE,OAAO,OAAO,MAAM,OAAO,QAAQ,kBAAkB,MAAM,IAAI,EAAE,CAAC;AAAA,MACpF;AAAA,IACF;AAAA,EACF;AACA,MAAI,SAAS,WAAW,KAAK,WAAW,WAAW,EAAG,QAAO,CAAC;AAE9D,QAAM,UAAU,SAAS,IAAI,CAAC,SAAS,KAAK,IAAI,GAAG,CAAC,GAAG,KAAK,OAAO,OAAO,CAAC,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC;AACxG,QAAM,gBAAgB,QAAQ,OAAO,CAAC,KAAK,WAAW,MAAM,QAAQ,CAAC,IAAI,SAAS;AAClF,QAAM,oBAAoB,oBAAI,IAAoB;AAClD,aAAW,QAAQ,UAAU;AAC3B,eAAW,QAAQ,YAAY;AAC7B,WAAK,KAAK,OAAO,IAAI,IAAI,KAAK,KAAK,GAAG;AACpC,0BAAkB,IAAI,OAAO,kBAAkB,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,MACpE;AAAA,IACF;AAAA,EACF;AAEA,QAAM,IAAI;AACV,QAAM,IAAI;AACV,QAAM,UAAyB,CAAC;AAChC,WAAS,QAAQ,GAAG,QAAQ,SAAS,QAAQ,SAAS,GAAG;AACvD,UAAM,OAAO,SAAS,KAAK;AAC3B,QAAI,QAAQ;AACZ,QAAI,eAAe;AACnB,eAAW,QAAQ,YAAY;AAC7B,YAAM,KAAK,KAAK,OAAO,IAAI,IAAI,KAAK;AACpC,UAAI,OAAO,EAAG;AACd,sBAAgB;AAChB,YAAM,KAAK,kBAAkB,IAAI,IAAI,KAAK;AAC1C,YAAM,MAAM,KAAK,KAAK,SAAS,SAAS,KAAK,QAAQ,KAAK,OAAO,CAAC;AAClE,YAAM,aAAc,MAAM,IAAI,MAC3B,KAAK,KAAK,IAAI,IAAI,KAAK,QAAQ,KAAK,IAAK;AAC5C,eAAS,MAAM;AAAA,IACjB;AACA,QAAI,QAAQ,GAAG;AACb,cAAQ,KAAK,EAAE,OAAO,KAAK,OAAO,cAAc,KAAK,OAAO,OAAO,aAAa,CAAC;AAAA,IACnF;AAAA,EACF;AAEA,UAAQ,KAAK,CAAC,MAAM,UAAU;AAC5B,QAAI,MAAM,UAAU,KAAK,MAAO,QAAO,MAAM,QAAQ,KAAK;AAC1D,QAAI,MAAM,iBAAiB,KAAK,aAAc,QAAO,MAAM,eAAe,KAAK;AAC/E,QAAI,KAAK,MAAM,UAAU,MAAM,MAAM,MAAO,QAAO,KAAK,MAAM,QAAQ,MAAM,MAAM;AAClF,WAAO,eAAe,KAAK,MAAM,aAAa,MAAM,MAAM,WAAW;AAAA,EACvE,CAAC;AACD,SAAO;AACT;AAEO,IAAM,gBAAgB,CAC3B,QACA,SACA,UACmB;AACnB,QAAM,MAAsB,CAAC;AAC7B,aAAW,SAAS,QAAQ;AAC1B,eAAW,SAAS,MAAM,SAAS;AACjC,UAAI,eAAe,OAAO,OAAO,EAAG,KAAI,KAAK,EAAE,OAAO,cAAc,MAAM,MAAM,CAAC;AAAA,IACnF;AAAA,EACF;AACA,MAAI,KAAK,CAAC,MAAM,UAAU;AACxB,QAAI,MAAM,iBAAiB,KAAK,aAAc,QAAO,MAAM,eAAe,KAAK;AAC/E,QAAI,KAAK,MAAM,UAAU,MAAM,MAAM,MAAO,QAAO,KAAK,MAAM,QAAQ,MAAM,MAAM;AAClF,WAAO,eAAe,KAAK,MAAM,aAAa,MAAM,MAAM,WAAW;AAAA,EACvE,CAAC;AACD,SAAO,IAAI,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACxC;;;AEn3BA,SAAS,cAAc;AAgBvB,IAAM,gBAAgB,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsBtB,IAAM,sBAAsB,OACjC,SACA,WACA,WACkC;AAClC,QAAM,eAAe,OAAO,WAAW,SAAS,MAAM;AACtD,MAAI,eAAe,OAAO,iBAAiB;AACzC,WAAO;AAAA,MACL,UAAU;AAAA,MACV,SAAS,CAAC;AAAA,MACV,OAAO;AAAA,QACL,MAAM;AAAA,QACN,SAAS,oBAAoB,YAAY,oBAAoB,OAAO,eAAe;AAAA,MACrF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,QAAI;AACJ,QAAI;AACF,eAAS,IAAI,OAAO,eAAe;AAAA,QACjC,MAAM;AAAA,QACN,gBAAgB,EAAE,wBAAwB,IAAI,0BAA0B,EAAE;AAAA,MAC5E,CAAC;AAAA,IACH,SAAS,OAAO;AACd,cAAQ;AAAA,QACN,UAAU;AAAA,QACV,SAAS,CAAC;AAAA,QACV,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,QAChE;AAAA,MACF,CAAC;AACD;AAAA,IACF;AACA,QAAI,UAAU;AACd,UAAM,SAAS,CAAC,WAAuC;AACrD,UAAI,QAAS;AACb,gBAAU;AACV,mBAAa,KAAK;AAClB,WAAK,OAAO,UAAU;AACtB,cAAQ,MAAM;AAAA,IAChB;AACA,UAAM,QAAQ,WAAW,MAAM;AAC7B,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS,CAAC;AAAA,QACV,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS,4BAA4B,OAAO,SAAS;AAAA,QACvD;AAAA,MACF,CAAC;AAAA,IACH,GAAG,OAAO,SAAS;AACnB,WAAO,KAAK,WAAW,CAAC,YAAqB;AAC3C,YAAM,SAAS;AACf,UAAI,OAAO,OAAO;AAChB,eAAO,EAAE,UAAU,OAAO,SAAS,CAAC,GAAG,OAAO,OAAO,MAAM,CAAC;AAC5D;AAAA,MACF;AACA,UAAI,MAAM,QAAQ,OAAO,OAAO,KAAK,OAAO,QAAQ,MAAM,CAAC,UAAU,OAAO,UAAU,KAAK,CAAC,GAAG;AAC7F,eAAO,EAAE,UAAU,MAAM,SAAS,OAAO,QAAoB,CAAC;AAC9D;AAAA,MACF;AACA,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS,CAAC;AAAA,QACV,OAAO,EAAE,MAAM,sBAAsB,SAAS,2CAA2C;AAAA,MAC3F,CAAC;AAAA,IACH,CAAC;AACD,WAAO,KAAK,SAAS,CAAC,UAAmB;AACvC,aAAO;AAAA,QACL,UAAU;AAAA,QACV,SAAS,CAAC;AAAA,QACV,OAAO;AAAA,UACL,MAAM;AAAA,UACN,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,QAChE;AAAA,MACF,CAAC;AAAA,IACH,CAAC;AACD,WAAO,YAAY,EAAE,SAAS,UAAU,CAAC;AAAA,EAC3C,CAAC;AACH;;;ACzGO,IAAM,kCAAkC;AACxC,IAAM,mCAAmC;AACzC,IAAM,mCAAmC,IAAI,OAAO;AACpD,IAAM,2BAA2B;AACxC,IAAM,uCAAuC;AAC7C,IAAM,uCAAuC;AAC7C,IAAM,qCAAqC;AAyF3C,IAAM,oBAAoB,oBAAI,IAAI,CAAC,QAAQ,iBAAiB,YAAY,CAAC;AAEzE,IAAMC,kBAAiB,CAAC,OAAwB,YAAoC;AAClF,MAAI,QAAQ,SAAS,UAAa,MAAM,SAAS,QAAQ,KAAM,QAAO;AACtE,MAAI,QAAQ,SAAS,UAAa,MAAM,aAAa,QAAQ,KAAM,QAAO;AAC1E,MAAI,QAAQ,QAAQ,UAAa,MAAM,QAAQ,QAAQ,IAAK,QAAO;AACnE,MAAI,QAAQ,aAAa,UAAa,MAAM,aAAa,QAAQ,SAAU,QAAO;AAClF,MAAI,QAAQ,WAAW,UAAa,MAAM,WAAW,QAAQ,OAAQ,QAAO;AAC5E,MAAI,QAAQ,YAAY,UAAa,MAAM,YAAY,QAAQ,QAAS,QAAO;AAC/E,MAAI,QAAQ,UAAU,UAAa,MAAM,cAAc,QAAQ,MAAM,YAAY,QAAQ,MAAO,QAAO;AACvG,MAAI,QAAQ,UAAU,UAAa,MAAM,cAAc,QAAQ,MAAM,YAAY,QAAQ,MAAO,QAAO;AACvG,SAAO;AACT;AAEA,IAAM,wBAAwB,CAAC,SAA6B,YAAoC;AAC9F,MAAI,QAAQ,SAAS,UAAa,QAAQ,CAAC,MAAM,QAAQ,KAAM,QAAO;AACtE,MAAI,QAAQ,SAAS,UAAa,QAAQ,CAAC,MAAM,QAAQ,KAAM,QAAO;AACtE,MAAI,QAAQ,QAAQ,UAAa,QAAQ,CAAC,MAAM,QAAQ,IAAK,QAAO;AACpE,MAAI,QAAQ,aAAa,UAAa,QAAQ,CAAC,MAAM,QAAQ,SAAU,QAAO;AAC9E,MAAI,QAAQ,WAAW,UAAa,QAAQ,CAAC,MAAM,QAAQ,OAAQ,QAAO;AAC1E,MAAI,QAAQ,YAAY,UAAa,QAAQ,CAAC,MAAM,QAAQ,QAAS,QAAO;AAC5E,MAAI,QAAQ,UAAU,UAAa,QAAQ,CAAC,MAAM,QAAQ,QAAQ,CAAC,IAAI,QAAQ,MAAO,QAAO;AAC7F,MAAI,QAAQ,UAAU,UAAa,QAAQ,CAAC,MAAM,QAAQ,QAAQ,CAAC,IAAI,QAAQ,MAAO,QAAO;AAC7F,SAAO;AACT;AAEA,IAAM,aAAa,CAAC,YAAoC,OAAO,KAAK,OAAO,EAAE,SAAS;AAEtF,IAAM,0BAA0B,CAAC,OAAwB,YAAmC;AAC1F,MACE,QAAQ,SAAS,UACjB,QAAQ,QAAQ,UAChB,QAAQ,aAAa,UACrB,QAAQ,WAAW,UACnB,QAAQ,YAAY,OACpB,QAAO;AACT,MAAI,MAAM,aAAa,QAAQ,MAAM,SAAS,YAAa,QAAO;AAClE,MAAI,MAAM,aAAa,QAAQ,MAAM,SAAS,OAAQ,QAAO;AAC7D,MAAI,MAAM,aAAa,SAAS,MAAM,SAAS,uBAAuB,MAAM,SAAS,UAAW,QAAO;AACvG,MAAI,MAAM,SAAS,gBAAgB,MAAM,SAAS,kBAAmB,QAAO;AAC5E,MAAI,MAAM,aAAa,KAAM,QAAO;AACpC,SAAO;AACT;AASA,IAAM,cAAc,CAAC,YAAkC;AACrD,UAAQ,KAAK,CAAC,MAAM,UAAU;AAC5B,QAAI,MAAM,UAAU,KAAK,MAAO,QAAO,MAAM,QAAQ,KAAK;AAC1D,QAAI,MAAM,iBAAiB,KAAK,aAAc,QAAO,MAAM,eAAe,KAAK;AAC/E,QAAI,KAAK,MAAM,UAAU,MAAM,MAAM,MAAO,QAAO,KAAK,MAAM,QAAQ,MAAM,MAAM;AAClF,WAAO,eAAe,KAAK,MAAM,aAAa,MAAM,MAAM,WAAW;AAAA,EACvE,CAAC;AACH;AAEA,IAAM,qBAAqB,CAAC,QAAiB,YAAmC;AAC9E,MAAI,QAAQ;AACZ,aAAW,SAAS,QAAQ;AAC1B,eAAW,SAAS,MAAM,QAAS,KAAIA,gBAAe,OAAO,OAAO,EAAG,UAAS;AAAA,EAClF;AACA,SAAO;AACT;AAEA,IAAM,qBAAqB,CACzB,QACA,OACA,SACA,YACA,UACmB;AACnB,QAAM,SAAwB,UAAU,QAAQ,OAAO,SAAS,UAAU;AAC1E,QAAM,WAAW,UAAU,QACvB,OAAO,OAAO,CAAC,SAAS,KAAK,iBAAiB,MAAM,MAAM,IAC1D;AACJ,SAAO,SAAS,IAAI,CAAC,UAAU;AAAA,IAC7B,OAAO,KAAK;AAAA,IACZ,SAAS;AAAA,IACT,cAAc,KAAK;AAAA,IACnB,OAAO,KAAK,QAAQ,wBAAwB,KAAK,OAAO,OAAO;AAAA,EACjE,EAAE;AACJ;AAEA,IAAM,uBAAuB,CAC3B,QACA,QACA,SACA,eACmB;AACnB,QAAM,UAA0B,CAAC;AACjC,MAAI,YAAY;AAChB,QAAO,YAAW,SAAS,QAAQ;AACjC,eAAW,SAAS,MAAM,SAAS;AACjC,UAAI,CAACA,gBAAe,OAAO,OAAO,EAAG;AACrC,UAAI,aAAa,WAAY,OAAM;AACnC,mBAAa;AACb,UAAI,CAAC,sBAAsB,MAAM,IAAI,EAAE,SAAS,MAAM,EAAG;AACzD,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,SAAS;AAAA,QACT,cAAc,MAAM;AAAA,QACpB,OAAO,wBAAwB,OAAO,OAAO;AAAA,MAC/C,CAAC;AAAA,IACH;AAAA,EACF;AACA,cAAY,OAAO;AACnB,SAAO;AACT;AAEA,IAAM,gBAAgB,CACpB,QACA,SACA,YACA,QAAQ,MAER,cAAc,QAAQ,SAAS,UAAU,EAAE,IAAI,CAAC,UAAU;AAAA,EACxD,OAAO,KAAK;AAAA,EACZ,SAAS;AAAA,EACT,cAAc,KAAK;AAAA,EACnB;AACF,EAAE;AAEJ,IAAM,6BAA6B,CAAC,QAAqB,YACvD,WAAW,OAAO,IACd,OAAO,UAAU,OAAO,CAAC,YAAY,sBAAsB,SAAS,OAAO,CAAC,EAAE,SAC9E;AAEN,IAAM,wBAAwB,CAAC,QAAqB,YAClD,CAAC,WAAW,OAAO,KAAK,2BAA2B,QAAQ,OAAO,IAAI;AAExE,IAAM,cAAc,CAClB,QACA,OACA,cACA,2BAA2B,OACZ;AAAA,EACf,WAAW,OAAO;AAAA,EAClB,aAAa,OAAO;AAAA,EACpB,YAAY,OAAO;AAAA,EACnB,UAAU,OAAO;AAAA,EACjB,oBAAoB,OAAO;AAAA,EAC3B,KAAK,OAAO;AAAA,EACZ,QAAQ,OAAO;AAAA,EACf,cAAc,OAAO;AAAA,EACrB;AAAA,EACA,MAAM;AAAA,EACN;AAAA,EACA;AACF;AAEA,IAAM,mBAAmB,CACvB,SACA,OACA,SACA,YACA,UAC6C;AAC7C,MAAI,QAAQ,WAAW,KAAK,MAAM,WAAW,EAAG,QAAO,EAAE,MAAM,CAAC,GAAG,UAAU,KAAK;AAClF,QAAM,aAA2F,CAAC;AAClG,MAAI,kBAAkB;AACtB,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,sBAAsB,QAAQ,OAAO,EAAG;AAC7C,UAAM,aAAa,IAAI,IAAI,OAAO,UAAU;AAC5C,UAAM,UAAU,MAAM,OAAO,CAAC,SAAS,WAAW,IAAI,IAAI,CAAC;AAC3D,QAAI,QAAQ,WAAW,KAAM,UAAU,SAAS,QAAQ,WAAW,MAAM,OAAS;AAClF,uBAAmB;AACnB,QAAI,WAAW,SAAS,YAAY;AAClC,iBAAW,KAAK;AAAA,QACd;AAAA,QACA;AAAA,QACA,mBAAmB,2BAA2B,QAAQ,OAAO;AAAA,MAC/D,CAAC;AAAA,IACH;AAAA,EACF;AACA,QAAM,oBAAoB,oBAAI,IAAoB;AAClD,aAAW,aAAa,YAAY;AAClC,eAAW,QAAQ,UAAU,SAAS;AACpC,wBAAkB,IAAI,OAAO,kBAAkB,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,IACpE;AAAA,EACF;AAEA,QAAM,OAAO,WAAW,IAAI,CAAC,cAAc;AACzC,UAAM,QAAQ,UAAU,QAAQ,OAAO,CAAC,OAAO,SAAS;AACtD,YAAM,KAAK,kBAAkB,IAAI,IAAI,KAAK;AAC1C,aAAO,QAAQ,KAAK,KAAK,WAAW,SAAS,KAAK,QAAQ,KAAK,OAAO,CAAC;AAAA,IACzE,GAAG,CAAC;AACJ,WAAO;AAAA,MACL,UAAU;AAAA,MACV;AAAA,MACA,UAAU,QAAQ;AAAA,MAClB,UAAU;AAAA,IACZ;AAAA,EACF,CAAC;AACD,SAAO,EAAE,MAAM,UAAU,mBAAmB,WAAW;AACzD;AAeA,IAAM,sBAAsB,CAC1B,QACA,SACA,SACA,UACA,aAC0F;AAC1F,QAAM,YAAsB,CAAC;AAC7B,QAAM,UAAyB,CAAC;AAChC,MAAI,QAAQ;AACZ,MAAI,WAAW;AACf,QAAM,UAAU,oBAAI,IAAY;AAChC,QAAM,SAAS,CAAC,UAAkB,WAAiC;AACjE,UAAM,YAAY,OAAO,WAAW,UAAU,MAAM;AACpD,QAAI,UAAU,UAAU,UAAU;AAChC,iBAAW;AACX,cAAQ,IAAI,0BAA0B;AACtC,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,YAAY,UAAU;AAChC,iBAAW;AACX,cAAQ,IAAI,0BAA0B;AACtC,aAAO;AAAA,IACT;AACA,cAAU,KAAK,QAAQ;AACvB,YAAQ,KAAK,MAAM;AACnB,aAAS;AACT,WAAO;AAAA,EACT;AAEA,QAAO,YAAW,SAAS,QAAQ;AACjC,eAAW,SAAS,MAAM,SAAS;AACjC,UAAI,CAACA,gBAAe,OAAO,OAAO,EAAG;AACrC,UAAI,CAAC,OAAO,MAAM,MAAM,EAAE,MAAM,OAAO,OAAO,MAAM,CAAC,EAAG,OAAM;AAAA,IAChE;AAAA,EACF;AACA,MAAI,UAAU;AACZ,UAAO,YAAW,UAAU,SAAS;AACnC,UAAI,CAAC,sBAAsB,QAAQ,OAAO,EAAG;AAC7C,iBAAW,QAAQ,OAAO,YAAY;AACpC,YAAI,CAAC,OAAO,MAAM,EAAE,MAAM,QAAQ,OAAO,CAAC,EAAG,OAAM;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,WAAW,SAAS,UAAU,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,cAAc,EAAE;AACpF;AAEA,IAAM,cAAc,OAClB,QACA,SACA,SACA,SACA,UAC2F;AAC3F,QAAM,SAAS,MAAM,eAAe;AAAA,IAClC,iBAAiB;AAAA,IACjB,kBAAkB;AAAA,IAClB,kBAAkB;AAAA,IAClB,WAAW;AAAA,EACb;AACA,QAAM,YAAY;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,OAAO;AAAA,EACT;AACA,QAAM,YAAY,MAAM,oBAAoB,SAAS,UAAU,WAAW;AAAA,IACxE,iBAAiB,OAAO;AAAA,IACxB,WAAW,OAAO;AAAA,EACpB,CAAC;AACD,MAAI,CAAC,UAAU,UAAU;AACvB,WAAO;AAAA,MACL,SAAS,CAAC;AAAA,MACV,YAAY,CAAC;AAAA,MACb,UAAU,EAAE,UAAU,OAAO,SAAS,CAAC,UAAU,MAAM,IAAI,GAAG,OAAO,UAAU,MAAM;AAAA,IACvF;AAAA,EACF;AAEA,QAAM,UAA0B,CAAC;AACjC,QAAM,cAAc,oBAAI,IAAyB;AACjD,aAAW,SAAS,UAAU,SAAS;AACrC,UAAM,SAAS,UAAU,QAAQ,KAAK;AACtC,QAAI,CAAC,OAAQ;AACb,QAAI,OAAO,SAAS,OAAO;AACzB,cAAQ,KAAK;AAAA,QACX,OAAO,OAAO;AAAA,QACd,SAAS;AAAA,QACT,cAAc,OAAO,MAAM;AAAA,QAC3B,OAAO,wBAAwB,OAAO,OAAO,OAAO;AAAA,MACtD,CAAC;AAAA,IACH,OAAO;AACL,kBAAY,IAAI,OAAO,SAAS,YAAY,IAAI,OAAO,MAAM,KAAK,KAAK,CAAC;AAAA,IAC1E;AAAA,EACF;AACA,QAAM,UAAU,IAAI,IAAI,UAAU,OAAO;AACzC,MAAI,YAAY,OAAO,KAAK,WAAW,OAAO,GAAG;AAC/C,YAAQ,IAAI,2CAA2C;AAAA,EACzD;AACA,SAAO;AAAA,IACL;AAAA,IACA,YAAY,CAAC,GAAG,WAAW,EAAE,IAAI,CAAC,CAAC,QAAQ,KAAK,MAC9C,YAAY,QAAQ,OAAO,OAAO,2BAA2B,QAAQ,OAAO,CAAC,CAAC;AAAA,IAChF,UAAU;AAAA,MACR,UAAU,UAAU,YAAY,QAAQ,SAAS;AAAA,MACjD,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,cAAc;AAAA,IAC3C;AAAA,EACF;AACF;AAEA,IAAM,iBAAiB,CAAC,SAA4B;AAClD,OAAK,KAAK,CAAC,MAAM,UAAU;AACzB,QAAI,MAAM,UAAU,KAAK,MAAO,QAAO,MAAM,QAAQ,KAAK;AAC1D,QAAI,MAAM,iBAAiB,KAAK,aAAc,QAAO,MAAM,eAAe,KAAK;AAC/E,WAAO,eAAe,KAAK,aAAa,MAAM,WAAW;AAAA,EAC3D,CAAC;AACH;AAEO,IAAM,oBAAoB,OAC/B,QACA,SACA,UAC0B;AAC1B,QAAM,UAAyB,MAAM,WAAW,CAAC;AACjD,QAAM,OAAO;AAAA,IACX,MAAM;AAAA,IACN,MAAM,aAAa;AAAA,IACnB,MAAM,cAAc;AAAA,EACtB;AACA,QAAM,SAAS,MAAM,mBAAmB;AAAA,IACtC,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AACA,QAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,UAAU,CAAC;AAC5D,QAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,UAAU,CAAC;AAC5D,QAAM,WAAW,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,QAAQ,CAAC;AACxD,MAAI;AACJ,MAAI,aAA0B,CAAC;AAC/B,MAAI,gBAA+B,EAAE,UAAU,MAAM,SAAS,CAAC,EAAE;AACjE,QAAM,uBAAuB,WAAW,OAAO;AAC/C,QAAM,YAA6B,KAAK,SAAS,WAC7C,uBAAuB,eAAe,WACtC,uBACE,aACA,KAAK,SAAS,UACZ,UACA,KAAK,SAAS,WACZ,WACA;AACV,QAAM,kBAAkB,KAAK,SAAS,YAAY;AAClD,QAAM,kBAAkB,oBAAI,IAAY;AAExC,MAAI,KAAK,SAAS,UAAU;AAC1B,UAAM,kBAAkB,mBAAmB,QAAQ,OAAO;AAC1D,cAAU,cAAc,QAAQ,SAAS,YAAY,uBAAuB,IAAI,CAAC;AACjF,QAAI,kBAAkB,WAAY,iBAAgB,IAAI,wBAAwB;AAC9E,QAAI,kBAAkB;AACtB,eAAW,UAAU,SAAS;AAC5B,UAAI,CAAC,sBAAsB,QAAQ,OAAO,EAAG;AAC7C,yBAAmB;AACnB,UAAI,WAAW,SAAS,YAAY;AAClC,cAAM,oBAAoB,2BAA2B,QAAQ,OAAO;AACpE,mBAAW,KAAK;AAAA,UACd;AAAA,UACA,uBAAuB,IAAI;AAAA,UAC3B;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AACA,QAAI,kBAAkB,WAAY,iBAAgB,IAAI,yBAAyB;AAAA,EACjF,WAAW,KAAK,SAAS,SAAS;AAChC,UAAM,cAAc,MAAM,YAAY,QAAQ,SAAS,KAAK,SAAS,SAAS,KAAK;AACnF,cAAU,YAAY,QAAQ,MAAM,GAAG,UAAU;AACjD,iBAAa,YAAY,WAAW,MAAM,GAAG,UAAU;AACvD,oBAAgB,YAAY;AAC5B,QAAI,YAAY,QAAQ,SAAS,WAAY,iBAAgB,IAAI,wBAAwB;AACzF,QAAI,YAAY,WAAW,SAAS,WAAY,iBAAgB,IAAI,yBAAyB;AAC7F,gBAAY,OAAO;AAAA,EACrB,WAAW,KAAK,SAAS,UAAU;AACjC,UAAM,kBAAkB,mBAAmB,QAAQ,OAAO;AAC1D,cAAU,qBAAqB,QAAQ,KAAK,QAAQ,SAAS,UAAU;AACvE,QAAI,kBAAkB,WAAY,iBAAgB,IAAI,wBAAwB;AAC9E,UAAM,eAAe,iBAAiB,SAAS,KAAK,OAAO,SAAS,YAAY,KAAK;AACrF,iBAAa,aAAa;AAC1B,QAAI,CAAC,aAAa,SAAU,iBAAgB,IAAI,yBAAyB;AACzE,QAAI,WAAW,SAAS,EAAG,iBAAgB,IAAI,gCAAgC;AAC/E,QAAI,WAAW,SAAS,KAAK,WAAW,OAAO,GAAG;AAChD,sBAAgB,IAAI,2CAA2C;AAAA,IACjE;AAAA,EACF,OAAO;AACL,UAAM,kBAAkB,mBAAmB,QAAQ,OAAO;AAC1D,cAAU,mBAAmB,QAAQ,KAAK,OAAO,SAAS,YAAY,KAAK,KAAK;AAChF,QAAI,kBAAkB,WAAY,iBAAgB,IAAI,wBAAwB;AAC9E,UAAM,eAAe,iBAAiB,SAAS,KAAK,OAAO,SAAS,YAAY,KAAK,KAAK;AAC1F,iBAAa,aAAa;AAC1B,QAAI,CAAC,aAAa,SAAU,iBAAgB,IAAI,yBAAyB;AACzE,QAAI,WAAW,SAAS,KAAK,KAAK,UAAU,SAAS,KAAK,MAAM,SAAS,GAAG;AAC1E,sBAAgB,IAAI,mCAAmC;AAAA,IACzD;AACA,QAAI,WAAW,SAAS,KAAK,WAAW,OAAO,GAAG;AAChD,sBAAgB,IAAI,2CAA2C;AAAA,IACjE;AAAA,EACF;AAEA,iBAAe,UAAU;AACzB,aAAW,UAAU,cAAc,QAAS,iBAAgB,IAAI,MAAM;AACtE,kBAAgB;AAAA,IACd,GAAG;AAAA,IACH,UAAU,cAAc,YAAY,gBAAgB,SAAS;AAAA,IAC7D,SAAS,CAAC,GAAG,eAAe,EAAE,KAAK,cAAc;AAAA,EACnD;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,IAAM,eAAe,CAAC,QAAiB,UAC5C,kBAAkB,QAAQ,CAAC,GAAG,KAAK;AAErC,IAAM,mBAAmB,CACvB,QACA,SACA,YACA,iBACA,WACA,UACA,kBACiB;AACjB,MAAI,QAAQ,WAAW,KAAK,WAAW,WAAW,GAAG;AACnD,WAAO;AAAA,MACL;AAAA,MACA,cAAc;AAAA,MACd,cAAc;AAAA,MACd,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU,CAAC;AAAA,MACX,YAAY,CAAC;AAAA,MACb,OAAO,CAAC;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,IAAI,IAAI,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,aAAa,KAAK,CAAC,CAAC;AAC9E,QAAM,eAAyB,CAAC;AAChC,QAAM,mBAAmB,oBAAI,IAAyB;AACtD,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,QAAQ,SAAS;AAC1B,QAAI,CAAC,iBAAiB,IAAI,KAAK,MAAM,WAAW,EAAG,cAAa,KAAK,KAAK,MAAM,WAAW;AAC3F,UAAM,MAAM,iBAAiB,IAAI,KAAK,MAAM,WAAW,KAAK,oBAAI,IAAY;AAC5E,QAAI,IAAI,KAAK,MAAM,KAAK;AACxB,qBAAiB,IAAI,KAAK,MAAM,aAAa,GAAG;AAChD,WAAO,IAAI,GAAG,KAAK,MAAM,WAAW,KAAK,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK;AAAA,EACzE;AAEA,QAAM,WAA4B,CAAC;AACnC,aAAW,QAAQ,cAAc;AAC/B,UAAM,QAAQ,aAAa,IAAI,IAAI;AACnC,UAAM,aAAa,iBAAiB,IAAI,IAAI;AAC5C,QAAI,CAAC,SAAS,CAAC,WAAY;AAC3B,QAAI,UAA6B,CAAC;AAClC,QAAI,eAAe;AACnB,UAAM,QAAQ,MAAY;AACxB,UAAI,QAAQ,WAAW,EAAG;AAC1B,YAAM,UAAgC,QAAQ,IAAI,CAAC,UAAU;AAC3D,cAAM,UAAU,WAAW,IAAI,MAAM,KAAK;AAC1C,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA,QAAQ,kBAAmB,UAAU,MAAM,MAAO;AAAA,UAClD,OAAO,UAAU,OAAO,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK,EAAE,KAAK,IAAI;AAAA,QAChE;AAAA,MACF,CAAC;AACD,YAAM,iBAAiB,QAAQ,OAAO,CAAC,UAAU,MAAM,OAAO;AAC9D,UAAI,mBAAmB,eAAe,WAAW,GAAG;AAClD,kBAAU,CAAC;AACX;AAAA,MACF;AACA,YAAM,YAAY,QAAQ,QAAQ,SAAS,CAAC,EAAG;AAC/C,YAAM,QAAQ,cAAc,eAAe,IAAI,YAAY,KAAK,IAAI,YAAY,KAAK,SAAS;AAC9F,YAAM,QAAQ,KAAK;AAAA,QACjB;AAAA,QACA,GAAG,eAAe,IAAI,CAAC,SAAS,OAAO,IAAI,GAAG,IAAI,KAAK,KAAK,MAAM,KAAK,EAAE,KAAK,CAAC;AAAA,MACjF;AACA,eAAS,KAAK;AAAA,QACZ,WAAW,MAAM;AAAA,QACjB,aAAa,MAAM;AAAA,QACnB,YAAY,MAAM;AAAA,QAClB,UAAU,MAAM;AAAA,QAChB,oBAAoB,MAAM;AAAA,QAC1B,cAAc,MAAM;AAAA,QACpB;AAAA,QACA,YAAY,EAAE,OAAO,cAAc,MAAM,UAAU;AAAA,QACnD;AAAA,QACA,cAAc,eAAe,IAAI,CAAC,EAAE,MAAM,OAAO;AAAA,UAC/C,OAAO,MAAM;AAAA,UACb,SAAS,MAAM;AAAA,UACf,kBAAkB,MAAM,oBAAoB;AAAA,QAC9C,EAAE;AAAA,QACF,cAAc,eAAe;AAAA,QAC7B;AAAA,QACA,MAAM,MAAM,QAAQ;AAAA,MACtB,CAAC;AACD,gBAAU,CAAC;AAAA,IACb;AAEA,eAAW,SAAS,MAAM,SAAS;AACjC,UAAI,QAAQ,SAAS,KAAK,MAAM,SAAS,QAAQ,kBAAkB,IAAI,MAAM,IAAI,EAAG,OAAM;AAC1F,UAAI,QAAQ,WAAW,EAAG,gBAAe,MAAM;AAC/C,cAAQ,KAAK,KAAK;AAAA,IACpB;AACA,UAAM;AAAA,EACR;AAEA,QAAM,QAAsB;AAAA,IAC1B,GAAG,SAAS,IAAI,CAAC,aAAyB,EAAE,MAAM,SAAS,QAAQ,EAAE;AAAA,IACrE,GAAG,WAAW,IAAI,CAAC,YAAwB,EAAE,MAAM,UAAU,OAAO,EAAE;AAAA,EACxE;AACA,QAAM,KAAK,kBAAkB;AAC7B,QAAM,yBAAyB,MAAM,SAAS;AAC9C,QAAM,eAAe,MAAM,MAAM,GAAG,QAAQ;AAC5C,QAAM,kBAAkB,aACrB,OAAO,CAAC,SAA4D,KAAK,SAAS,OAAO,EACzF,IAAI,CAAC,SAAS,KAAK,OAAO;AAC7B,QAAM,iBAAiB,aACpB,OAAO,CAAC,SAAwD,KAAK,SAAS,QAAQ,EACtF,IAAI,CAAC,SAAS,KAAK,MAAM;AAC5B,QAAM,eAAe,gBAAgB,OAAO,CAAC,KAAK,YAAY,MAAM,QAAQ,cAAc,CAAC,IACvF,eAAe;AACnB,QAAM,gBAAgB,yBAClB;AAAA,IACE,GAAG;AAAA,IACH,UAAU;AAAA,IACV,SAAS,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,cAAc,SAAS,uBAAuB,CAAC,CAAC,EAAE,KAAK,cAAc;AAAA,EAChG,IACA;AACJ,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,cAAc;AAAA,IACd,YAAY,aAAa;AAAA,IACzB,cAAc,gBAAgB;AAAA,IAC9B,UAAU;AAAA,IACV,YAAY;AAAA,IACZ,OAAO;AAAA,IACP,eAAe;AAAA,EACjB;AACF;AAEA,IAAM,qBAAqB,CAAC,MAAkB,UAA8B;AAC1E,QAAM,YAAY,KAAK,SAAS,UAAU,KAAK,UAAU,KAAK;AAC9D,QAAM,aAAa,MAAM,SAAS,UAAU,MAAM,UAAU,MAAM;AAClE,MAAI,WAAW,UAAU,UAAU,MAAO,QAAO,WAAW,QAAQ,UAAU;AAC9E,MAAI,WAAW,iBAAiB,UAAU,aAAc,QAAO,WAAW,eAAe,UAAU;AACnG,MAAI,KAAK,SAAS,MAAM,KAAM,QAAO,KAAK,SAAS,UAAU,KAAK;AAClE,MAAI,KAAK,SAAS,WAAW,MAAM,SAAS,SAAS;AACnD,UAAM,YAAY,KAAK,QAAQ,QAAQ,CAAC,GAAG,MAAM,SAAS;AAC1D,UAAM,aAAa,MAAM,QAAQ,QAAQ,CAAC,GAAG,MAAM,SAAS;AAC5D,QAAI,cAAc,WAAY,QAAO,YAAY;AACjD,WAAO,eAAe,KAAK,QAAQ,aAAa,MAAM,QAAQ,WAAW;AAAA,EAC3E;AACA,MAAI,KAAK,SAAS,YAAY,MAAM,SAAS,UAAU;AACrD,WAAO,eAAe,KAAK,OAAO,aAAa,MAAM,OAAO,WAAW;AAAA,EACzE;AACA,SAAO;AACT;",
6
- "names": ["crypto", "fs", "path", "crypto", "fs", "matchesFilters"]
7
- }
@@ -1,7 +0,0 @@
1
- {
2
- "version": 3,
3
- "sources": ["../../src/jev/guest-types.ts", "../../src/runtime/guest-types.ts"],
4
- "sourcesContent": ["export const JEV_GUEST_DECLARATIONS = `\ntype FabricJevJson = null | boolean | number | string | FabricJevJson[] | { [key: string]: FabricJevJson };\ntype FabricJevDescription = string | FabricJevJson[] | { [key: string]: FabricJevJson };\ntype FabricJevQuestion =\n | { type: \"noul\"; instructions: FabricJevDescription; criteria?: { true?: FabricJevDescription; false?: FabricJevDescription } }\n | { type: \"choice\"; instructions: FabricJevDescription; criteria: Record<string, FabricJevDescription | null> }\n | { type: \"score\"; instructions: FabricJevDescription; criteria: FabricJevDescription[] };\ntype FabricJevAnswer<Q extends FabricJevQuestion> = Q extends { type: \"noul\" }\n ? { type: \"noul\"; noul: number }\n : Q extends { type: \"choice\"; criteria: infer C }\n ? { type: \"choice\"; choice: Extract<keyof C, string>; confidence: number; probabilities: Record<Extract<keyof C, string>, number> }\n : { type: \"score\"; score: number; confidence: number; probabilities: Record<string, number>; legend: Record<string, FabricJevJson> };\ninterface FabricJevProgram {\n name: string;\n code: string;\n inputSchema: Record<string, unknown>;\n outputSchema: Record<string, unknown>;\n requires: string[];\n limits?: { timeoutMs?: number; maxEvaluations?: number; maxToolCalls?: number; maxTokens?: number };\n}\ntype FabricJevHostEventName = \"input\" | \"turn_end\" | \"tool_error\" | \"agent_end\" | \"agent_settled\";\ninterface FabricJevObserve {\n events: FabricJevHostEventName[];\n include?: Array<\"inputText\" | \"assistantText\" | \"toolResults\">;\n maxChars?: number; queueSize?: number; maxEventAgeMs?: number;\n delivery?: \"steer\" | \"followUp\"; triggerTurn?: boolean; maxAdvice?: number;\n}\ninterface FabricJevHostEvent {\n id: string; sequence: number; event: FabricJevHostEventName; source: \"main\";\n sessionId: string; revision: number; at: number; payload: FabricJevJson; truncated: boolean;\n}\ninterface FabricJevObservationStats {\n events: FabricJevHostEventName[]; received: number; consumed: number; dropped: number; queued: number;\n adviceDelivered: number; adviceSuppressed: number;\n}\ninterface FabricJevAdviceResult {\n delivered: boolean;\n reason?: \"disabled\" | \"stale\" | \"duplicate\" | \"budget\" | \"feedback\" | \"delivery_failed\";\n}\ninterface FabricJevRun<T = unknown> {\n id: string; name: string; state: \"running\" | \"completed\" | \"failed\" | \"cancelled\" | \"timed_out\";\n background: boolean; startedAt: number; endedAt?: number; result?: T; error?: string;\n evaluations: number; toolCalls: number; usage: { input_tokens: number; output_tokens: number };\n events: Array<{ sequence: number; at: number; value: FabricJevJson }>; nextSequence: number; logs: string[];\n observation?: FabricJevObservationStats;\n}\ninterface FabricJevApi {\n evaluate<Q extends Record<string, FabricJevQuestion>>(args: {\n state: string | FabricJevJson[] | { [key: string]: FabricJevJson }; questions: Q; model?: string;\n }): Promise<{ model: string; answers: { [K in keyof Q]: FabricJevAnswer<Q[K]> }; usage: { input_tokens: number; output_tokens: number } }>;\n run<T = unknown>(args: { program: FabricJevProgram; input: FabricJevJson }): Promise<FabricJevRun<T>>;\n spawn(args: { program: FabricJevProgram; input: FabricJevJson; observe?: FabricJevObserve }): Promise<FabricJevRun>;\n status(args?: { id?: never; after?: never }): Promise<{ credentials: { configured: boolean; source: \"pi\" | \"environment\" | \"command\" | \"missing\"; verified: boolean }; model: string; runs: Array<{ id: string; name: string; state: string; background: boolean; startedAt: number; evaluations: number; toolCalls: number; observation?: FabricJevObservationStats }> }>;\n status<T = unknown>(args: { id: string; after?: number }): Promise<FabricJevRun<T>>;\n wait<T = unknown>(args: { id: string }): Promise<FabricJevRun<T>>;\n /** Alias for wait. */\n join<T = unknown>(args: { id: string }): Promise<FabricJevRun<T>>;\n advise(args: { id: string; eventId: string; message: string }): Promise<FabricJevAdviceResult>;\n stop(args: { id: string }): Promise<FabricJevRun>;\n}\ndeclare const jev: FabricJevApi;\n`;\n", "import type { FabricDynamicGuestDeclarations } from \"../protocol.js\";\nimport { JEV_GUEST_DECLARATIONS } from \"../jev/guest-types.js\";\n\n// These names and compatibility fields are the single source of truth for\n// generated core-override overloads. Keep them beside PiToolsApi below so an\n// override extends the same guest contract rather than copying its signatures.\n// Numeric fields widen to `number | string` in generated overloads too,\n// mirroring built-in runtime normalization; a strict override schema still\n// rejects the string form at validation time, and the registry error wins.\nexport const PI_CORE_COMPATIBILITY_ARGUMENT_TYPE_NAMES = {\n read: \"PiReadCompatibilityArgument\",\n bash: \"PiBashCompatibilityArgument\",\n powershell: \"PiPowerShellCompatibilityArgument\",\n edit: \"PiEditCompatibilityArgument\",\n write: \"PiWriteCompatibilityArgument\",\n grep: \"PiGrepCompatibilityArgument\",\n find: \"PiFindCompatibilityArgument\",\n ls: \"PiLsCompatibilityArgument\",\n} as const;\n\nexport const PI_CORE_NUMERIC_FIELDS = {\n read: [\"offset\", \"limit\"],\n bash: [\"timeout\"],\n powershell: [\"timeout\"],\n edit: [],\n write: [],\n grep: [\"context\", \"limit\"],\n find: [\"limit\"],\n ls: [\"limit\"],\n} as const;\n\nexport const GUEST_TYPE_DECLARATIONS = `\ntype JsonPrimitive = string | number | boolean | null;\ntype JsonValue = JsonPrimitive | JsonValue[] | { [key: string]: JsonValue };\ntype FabricTransport = \"auto\" | \"process\" | \"tmux\" | \"screen\" | \"localterm\" | \"herdr\";\ntype FabricAgentRunner = \"pi\" | \"claude\" | \"veda\";\ntype FabricKernel = \"typescript\" | \"python\";\ntype FabricThinking = \"off\" | \"minimal\" | \"low\" | \"medium\" | \"high\" | \"xhigh\" | \"max\";\ninterface FabricActionEffect {\n kind: \"none\" | \"scoped\" | \"transactional\" | \"emission\";\n resources?: string[];\n ordering?: \"commutative\" | \"ordered\" | \"unknown\";\n}\ninterface FabricAction {\n ref: string;\n provider: string;\n name: string;\n description: string;\n inputSchema: Record<string, unknown>;\n outputSchema?: Record<string, unknown>;\n risk: \"read\" | \"write\" | \"execute\" | \"network\" | \"agent\";\n namespace?: string;\n effect?: FabricActionEffect;\n}\ninterface FabricAgentRequest {\n /** Omitted/inherit uses caller executor.kernel; concrete choices require Pi with extensions. */\n kernel?: FabricKernel | \"inherit\";\n task: string;\n name?: string;\n runner?: FabricAgentRunner;\n transport?: FabricTransport;\n model?: string;\n persona?: string;\n thinking?: FabricThinking;\n tools?: string[];\n timeoutMs?: number;\n extensions?: boolean;\n recursive?: boolean;\n /** Filesystem execution directory; relative paths resolve from the parent agent cwd. */\n cwd?: string;\n worktree?: boolean;\n schema?: Record<string, unknown>;\n prompt?: string;\n instructions?: string;\n timeout_ms?: number;\n residency?: FabricParticipantResidency;\n}\ninterface FabricHandoffCall {\n readonly ref: string;\n}\ninterface FabricHandoffFacts {\n readonly calls: readonly FabricHandoffCall[];\n count(ref?: string | readonly string[]): number;\n}\ntype FabricHandoffPredicate = (facts: Readonly<FabricHandoffFacts>) => boolean;\ninterface FabricHandoffRequest {\n kernel?: FabricKernel | \"inherit\";\n model: string;\n task?: string;\n when?: FabricHandoffPredicate;\n name?: string;\n transport?: FabricTransport;\n thinking?: FabricThinking;\n tools?: string[];\n timeoutMs?: number;\n extensions?: boolean;\n recursive?: boolean;\n schema?: Record<string, unknown>;\n prompt?: string;\n instructions?: string;\n timeout_ms?: number;\n}\ninterface FabricHandoffResult {\n scheduled: true;\n status: \"deferred\";\n boundary: \"fabric_exec_end\";\n}\ninterface FabricMainAgentInfo {\n id: string;\n name: \"Main\";\n kind: \"main\";\n status: \"idle\" | \"running\" | \"remote\";\n runner: \"pi\";\n transport: \"host\";\n cwd?: string;\n sessionId?: string;\n model?: string;\n thinking?: string;\n startedAt?: number;\n updatedAt: number;\n pendingMessages: boolean;\n local: boolean;\n}\ninterface FabricPeerInfo {\n id: string;\n name: string;\n kind: \"peer\";\n status: \"idle\" | \"running\";\n runner: \"pi\";\n transport: \"host\";\n cwd: string;\n sessionId: string;\n model?: string;\n thinking?: string;\n startedAt: number;\n updatedAt: number;\n pendingMessages: boolean;\n local: false;\n}\ntype FabricParticipantKind = \"root\" | \"agent\" | \"actor\";\ntype FabricParticipantResidency = \"session\" | \"durable\";\ntype FabricParticipantScope = \"local\" | \"lineage\" | \"project\";\ntype FabricParticipantCapability = \"steer\" | \"followUp\" | \"stop\" | \"ask\" | \"actor-bindings\" | \"attach\" | \"fabric\";\ninterface FabricParticipantInfo {\n format: 1;\n id: string;\n kind: FabricParticipantKind;\n rootId: string;\n ownerHostId: string;\n ownerIdentityId: string;\n parentId?: string;\n name: string;\n status: string;\n runner: FabricAgentRunner;\n transport: FabricTransport | \"host\";\n capabilities: FabricParticipantCapability[];\n cwd?: string;\n sessionId?: string;\n model?: string;\n thinking?: string;\n startedAt: number;\n updatedAt: number;\n finishedAt?: number;\n pendingMessages?: boolean;\n currentTool?: string;\n turns?: number;\n toolCalls?: number;\n usage?: { input: number; output: number; cacheRead: number; cacheWrite: number; cost: number };\n actorQueued?: number;\n actorMessages?: number;\n controlProtocol: \"v1\" | \"legacy\";\n residency: FabricParticipantResidency;\n local: boolean;\n stale: boolean;\n}\ntype FabricLifecycleEventType =\n | \"pi.input\"\n | \"pi.agent_start\"\n | \"pi.agent_end\"\n | \"pi.turn_end\"\n | \"pi.agent_settled\"\n | \"pi.tool_error\"\n | \"pi.session_compact\"\n | \"run.completed\"\n | \"run.failed\"\n | \"run.stopped\"\n | \"run.timed_out\"\n | \"run.resumed\"\n | \"run.detached\"\n | \"tokens.usage\"\n | \"component.state\";\ntype FabricLifecycleDelivery = \"steer\" | \"followUp\";\ninterface FabricLifecycleSource {\n id: string;\n name: string;\n kind: FabricParticipantKind;\n rootId: string;\n runner: FabricAgentRunner;\n ownerHostId?: string;\n ownerIdentityId?: string;\n}\ninterface FabricLifecycleEvent {\n version: 1;\n id: string;\n sequence: number;\n event: FabricLifecycleEventType;\n source: FabricLifecycleSource;\n occurredAt: number;\n publishedAt: number;\n runId?: string;\n status?: string;\n data?: unknown;\n}\ninterface FabricLifecycleSubscription {\n format: 1;\n id: string;\n from: string;\n events: FabricLifecycleEventType[];\n to: string;\n delivery: FabricLifecycleDelivery;\n triggerTurn: boolean;\n once: boolean;\n afterSequence: number;\n createdAt: number;\n updatedAt: number;\n createdBy: { id: string; name: string; kind: \"main\" | \"agent\" | \"actor\"; sessionId?: string };\n lastDeliveredAt?: number;\n lastEventId?: string;\n lastError?: string;\n}\ninterface FabricAgentHandle {\n /** Resolved Fabric kernel, absent for non-Fabric runners. */\n kernel?: FabricKernel;\n id: string;\n name: string;\n status: string;\n runner: FabricAgentRunner;\n /** Local execution metadata is absent for hosted participants. */\n transport?: FabricTransport;\n cwd?: string;\n rootId?: string;\n parentId?: string;\n depth?: number;\n generation?: number;\n model?: string;\n thinking?: FabricThinking;\n actorId?: string;\n actorName?: string;\n sessionId?: string;\n runnerSessionId?: string;\n attachCommand?: string;\n branch?: string;\n worktree?: string;\n text?: string;\n value?: unknown;\n error?: string;\n logFile?: string;\n residency?: FabricParticipantResidency;\n}\ninterface FabricRemoteControlResult {\n queued: true;\n messageId: string;\n routed: \"mesh\";\n acknowledged: true;\n}\ninterface FabricAgentResult extends FabricAgentHandle {\n task: string;\n startedAt: number;\n finishedAt?: number;\n turns: number;\n toolCalls: number;\n text: string;\n value?: unknown;\n error?: string;\n usage: { input: number; output: number; cacheRead: number; cacheWrite: number; cost: number };\n pendingMessages?: { steering: string[]; followUp: string[] };\n}\ninterface FabricModelInfo {\n runner?: FabricAgentRunner;\n provider: string;\n id: string;\n name: string;\n key: string;\n value?: string;\n resolvedModel?: string;\n displayName?: string;\n description?: string;\n supportsEffort?: boolean;\n supportedEffortLevels?: string[];\n supportsAdaptiveThinking?: boolean;\n supportsFastMode?: boolean;\n supportsAutoMode?: boolean;\n}\ninterface FabricLogLine {\n index?: number;\n offset: number;\n raw: string;\n parsed?: unknown;\n}\ninterface FabricAgentLog {\n id: string;\n runDirectory: string;\n logFile: string;\n status?: FabricAgentResult;\n events: FabricLogLine[];\n hasMore: boolean;\n before?: number;\n}\ninterface FabricActorLog {\n actorId: string;\n actorName: string;\n sessionFile: string;\n logDir: string;\n session: FabricLogLine[];\n sessionHasMore: boolean;\n sessionBefore?: number;\n run?: {\n runId: string;\n eventsFile: string;\n status?: FabricAgentResult;\n events: FabricLogLine[];\n hasMore: boolean;\n before?: number;\n };\n retainedRuns: string[];\n}\ninterface FabricCapabilityActionHead {\n key: string;\n parentKey: string;\n ref: string;\n name: string;\n description: string;\n descriptorHash: string;\n risk: \"read\" | \"write\" | \"execute\" | \"network\" | \"agent\";\n namespace?: string;\n effect?: FabricActionEffect;\n}\ninterface FabricCapabilityProviderHead {\n key: string;\n parentKey: string;\n name: string;\n description: string;\n descriptorHash: string;\n actions: FabricCapabilityActionHead[];\n}\ninterface FabricCapabilityCatalog {\n kind: \"pi-fabric.capability-catalog\";\n version: 1;\n root: {\n key: \"capability:fabric\";\n name: \"Fabric capabilities\";\n description: string;\n descriptorHash: string;\n };\n providers: FabricCapabilityProviderHead[];\n totalActions: number;\n indexedActions: number;\n complete: boolean;\n reasons: string[];\n}\ninterface FabricToolsApi {\ninterface FabricActionListEnvelope {\n kind: \"pi-fabric.action-list\";\n version: 1;\n actions: FabricAction[];\n /** Full visible-action count before paging. */\n total: number;\n /** True when total exceeds the returned page: more actions exist. */\n truncated: boolean;\n limit: number;\n}\ninterface FabricActionSearchBackend {\n requested: \"semantic\";\n used: \"semantic\" | \"lexical\";\n degraded: boolean;\n model?: string;\n usage?: { inputTokens: number; outputTokens: number };\n abstained?: boolean;\n reason?: \"timeout\" | \"rate_limited\" | \"service_unavailable\";\n}\ninterface FabricActionSearchEnvelope {\n kind: \"pi-fabric.action-search\";\n version: 1;\n actions: FabricAction[];\n backend: FabricActionSearchBackend;\n}\ninterface FabricToolsApi {\n providers(): Promise<Array<{ name: string; description: string }>>;\n catalog(args?: { provider?: string; limit?: number }): Promise<FabricCapabilityCatalog>;\n /**\n * Capped discovery page: default 100 entries, silently truncated (hard cap\n * 1000). A short result never proves an action is absent \u2014 confirm with\n * search() or pass envelope: true to get totals and a truncated flag.\n */\n list(args?: { provider?: string; namespace?: string; query?: string; limit?: number; envelope?: boolean }): Promise<FabricAction[] | FabricActionListEnvelope>;\n search(args: { query: string; limit?: number; searchMode?: \"lexical\" | \"semantic\" }): Promise<FabricAction[] | FabricActionSearchEnvelope>;\n describe(args: { ref: string }): Promise<FabricAction>;\n call(args: { ref: string; args?: Record<string, unknown> }): Promise<unknown>;\n progress(args: { message: string }): Promise<void>;\n models(): Promise<FabricModelInfo[]>;\n}\ninterface FabricCapturedToolResult {\n content: Array<{ type: string; text?: string; [key: string]: unknown }>;\n text: string;\n details?: unknown;\n isError: boolean;\n terminate?: boolean;\n source: { path: string; source: string; scope: string; origin: string; baseDir?: string };\n}\ninterface FabricCapturedTool {\n (args?: Record<string, unknown>): Promise<FabricCapturedToolResult>;\n}\ntype FabricExtensionsApi = Record<string, FabricCapturedTool>;\n// String-primary tools (read/bash/powershell/grep/find/ls) accept a bare string; the\n// runtime proxy coerces it to { <primaryField>: string }. Lets the model write\n// the natural form (pi.bash(\"ls\")) instead of pi.bash({ command: \"ls\" }).\n// Return shapes differ by tool: read/grep/find/ls return their text as a bare\n// string (e.g. const src: string = await pi.read({ path })); shell/edit/write\n// return { ok, output, details } (e.g. const { output } = await pi.bash(...)).\n// Common alias keys (cmd\u2192command, query\u2192pattern, file\u2192path, dir\u2192path) and a\n// flat edit shape ({ path, oldText, newText }) are also accepted; the runtime\n// proxy normalizes them to the canonical form before the host validates args.\n// Bash timeout is measured in seconds; timeoutMs is converted from milliseconds.\n// After executor.shellHangMs the await still resolves ok: true with a still-running\n// notice, pid, and live output path in details; background: true (alias\n// run_in_background) detaches immediately. The process keeps writing that file.\n// Extended near-miss repairs: find's name/filename/glob \u2192 pattern, write's\n// data \u2192 content, ls's folder \u2192 path, bash's script \u2192 command; numeric option\n// fields (limit/offset/context/timeout) also accept numeric strings, coerced\n// at runtime (2322 diagnostics are suppressed by the type-checker by design).\n// String-primary tools also take a two-arg (primary, options) form \u2014\n// pi.read(\"index.ts\", { limit: 120 }) merges to { path, ...options } at\n// runtime, the positional string winning the primary field on conflict.\n// shell/edit/write envelopes are proxy-guarded so string-method access\n// (.trim(), .split(), iteration) fails with an actionable TypeError pointing\n// at .output instead of QuickJS's context-free \"not a function\" \u2014 property-\n// miss (2339) checks are suppressed by design, so the runtime gives the hint.\ntype PiPathArgument = {\n path?: string;\n file?: string;\n absolutePath?: string;\n file_path?: string;\n filePath?: string;\n filepath?: string;\n pathname?: string;\n target_file?: string;\n targetFile?: string;\n absolute_path?: string;\n fileAbsolutePath?: string;\n};\ntype PiOptionalPathArgument = {\n path?: string;\n file?: string;\n absolutePath?: string;\n file_path?: string;\n filePath?: string;\n filepath?: string;\n pathname?: string;\n target_file?: string;\n targetFile?: string;\n absolute_path?: string;\n fileAbsolutePath?: string;\n dir?: string;\n folder?: string;\n directory?: string;\n directoryPath?: string;\n};\ntype PiOldTextArgument = {\n oldText?: string;\n old?: string;\n old_string?: string;\n oldString?: string;\n old_str?: string;\n oldStr?: string;\n from?: string;\n old_value?: string;\n old_text?: string;\n oldContent?: string;\n old_content?: string;\n};\ntype PiNewTextArgument = {\n newText?: string;\n new?: string;\n replacement?: string;\n new_string?: string;\n newString?: string;\n new_str?: string;\n newStr?: string;\n to?: string;\n new_value?: string;\n new_text?: string;\n newContent?: string;\n new_content?: string;\n};\ntype PiEditOperation = PiOldTextArgument & PiNewTextArgument & { all?: boolean };\ntype PiCommandArgument = { command?: string; cmd?: string; shell?: string; cmdline?: string; script?: string; commandLine?: string };\ntype PiContentArgument = { content?: string; contents?: string; body?: string; text?: string; data?: string; fileContent?: string };\ntype PiGrepPatternArgument = { pattern?: string; query?: string; regex?: string; search?: string; q?: string; expression?: string; text?: string };\ntype PiFindPatternArgument = { pattern?: string; query?: string; regex?: string; search?: string; name?: string; filename?: string; glob?: string; expression?: string; include?: string };\n// Two-arg (primary, options) bags for the string-primary tools. Only option\n// aliases belong here (max/start/ctx/ic/...), never primary-field aliases \u2014\n// the primary field comes from the positional string.\ntype PiReadOptions = { offset?: number; limit?: number; start?: number; max?: number };\n// cwd is honored per call by the pi provider, which binds the command to a\n// shell definition rooted there; relative paths resolve from the session cwd.\n// The alias spellings mirror the shell entries in __piArgAliases: the\n// runtime repairs them, so the checker has to accept the same spellings or a\n// repairable call is rejected before it ever reaches the sandbox.\ntype PiShellOptions = {\n timeout?: number; timeoutMs?: number; settle?: boolean;\n background?: boolean; run_in_background?: boolean;\n cwd?: string; workdir?: string; directory?: string; workingDirectory?: string;\n};\ntype PiBashOptions = PiShellOptions;\ntype PiPowerShellOptions = PiShellOptions;\ntype PiGrepOptions = { path?: string; glob?: string; globPattern?: string; ignoreCase?: boolean; ic?: boolean; caseInsensitive?: boolean; literal?: boolean; context?: number; ctx?: number; limit?: number; max?: number };\ntype PiFindOptions = { path?: string; limit?: number; max?: number };\ntype PiLsOptions = { limit?: number; max?: number };\ntype PiReadArgument = string | (PiPathArgument & PiReadOptions);\ntype PiBashArgument = string | (PiCommandArgument & PiBashOptions);\ntype PiPowerShellArgument = string | (PiCommandArgument & PiPowerShellOptions);\ntype PiEditFlatArgument = PiPathArgument & PiOldTextArgument & PiNewTextArgument & { all?: boolean };\ntype PiEditArgument = PiPathArgument & ({ edits: PiEditOperation[]; all?: boolean } | PiEditFlatArgument);\ntype PiWriteArgument = string | (PiPathArgument & PiContentArgument);\ntype PiGrepArgument = string | (PiGrepPatternArgument & PiGrepOptions);\ntype PiFindArgument = string | (PiFindPatternArgument & PiFindOptions);\ntype PiLsArgument = string | (PiOptionalPathArgument & PiLsOptions);\ntype PiNumericString<T> = T extends number ? T | string : T;\ntype PiNumericStringOptions<T> = { [K in keyof T]: PiNumericString<T[K]> };\ntype PiReadCompatibilityArgument = string | (PiPathArgument & PiNumericStringOptions<PiReadOptions>);\ntype PiBashCompatibilityArgument = string | (PiCommandArgument & PiNumericStringOptions<PiBashOptions>);\ntype PiPowerShellCompatibilityArgument = string | (PiCommandArgument & PiNumericStringOptions<PiPowerShellOptions>);\ntype PiEditCompatibilityArgument = PiEditFlatArgument;\ntype PiWriteCompatibilityArgument = PiWriteArgument;\ntype PiGrepCompatibilityArgument = string | (PiGrepPatternArgument & PiNumericStringOptions<PiGrepOptions>);\ntype PiFindCompatibilityArgument = string | (PiFindPatternArgument & PiNumericStringOptions<PiFindOptions>);\ntype PiLsCompatibilityArgument = string | (PiOptionalPathArgument & PiNumericStringOptions<PiLsOptions>);\ninterface PiToolsApi {\n read(args: PiReadArgument, options?: PiReadOptions): Promise<string>;\n bash(args: PiBashArgument, options?: PiBashOptions): Promise<{ ok: true; output: string; details: unknown } | { ok: false; output: string; details: null; exitCode: number; error: string }>;\n powershell(args: PiPowerShellArgument, options?: PiPowerShellOptions): Promise<{ ok: true; output: string; details: unknown } | { ok: false; output: string; details: null; exitCode: number; error: string }>;\n edit(args: PiEditArgument): Promise<{ ok: true; output: string; details: unknown }>;\n edit(path: string, oldText: string, newText: string): Promise<{ ok: true; output: string; details: unknown }>;\n write(args: PiWriteArgument): Promise<{ ok: true; output: string; details: unknown }>;\n write(path: string, content: string): Promise<{ ok: true; output: string; details: unknown }>;\n grep(args: PiGrepArgument): Promise<string>;\n grep(pattern: string, path?: string | PiGrepOptions, limit?: number): Promise<string>;\n find(args: PiFindArgument): Promise<string>;\n find(pattern: string, path?: string | PiFindOptions, limit?: number): Promise<string>;\n ls(args?: PiLsArgument, options?: PiLsOptions): Promise<string>;\n}\ntype FabricActorHostEvent =\n | \"resources_discover\"\n | \"session_start\"\n | \"session_info_changed\"\n | \"session_before_switch\"\n | \"session_before_fork\"\n | \"session_before_compact\"\n | \"session_compact\"\n | \"session_shutdown\"\n | \"session_before_tree\"\n | \"session_tree\"\n | \"input\"\n | \"before_agent_start\"\n | \"agent_start\"\n | \"agent_end\"\n | \"agent_settled\"\n | \"turn_start\"\n | \"turn_end\"\n | \"message_start\"\n | \"message_update\"\n | \"message_end\"\n | \"context\"\n | \"before_provider_headers\"\n | \"before_provider_request\"\n | \"after_provider_response\"\n | \"tool_execution_start\"\n | \"tool_call\"\n | \"tool_execution_update\"\n | \"tool_result\"\n | \"tool_execution_end\"\n | \"model_select\"\n | \"thinking_level_select\"\n | \"user_bash\"\n | \"tool_error\";\ntype FabricActorDelivery = \"mailbox\" | \"steer\" | \"followUp\" | \"nextTurn\";\ninterface FabricActorHostMediaDescriptor {\n readonly type: \"image\";\n readonly mediaIndex: number;\n readonly mimeType: string;\n}\ninterface FabricActorHostSignal {\n readonly payload: unknown;\n readonly media?: readonly FabricActorHostMediaDescriptor[];\n readonly idle: boolean;\n readonly observedAt: number;\n}\ntype FabricActorActivation =\n | { readonly kind: \"hostEvent\"; readonly id: string; readonly source: string; readonly sequence: number; readonly createdAt: number; readonly event: FabricActorHostEvent; readonly mainRevision: number; readonly taskRevision: number; readonly signal?: FabricActorHostSignal }\n | { readonly kind: \"direct\"; readonly id: string; readonly source: string; readonly sequence: number; readonly createdAt: number }\n | { readonly kind: \"mesh\"; readonly id: string; readonly source: string; readonly sequence: number; readonly createdAt: number; readonly topic: string };\ninterface FabricActorValidityFacts {\n readonly activation: Readonly<FabricActorActivation>;\n readonly current: Readonly<{ latestActivationSequence: number; mainRevision: number; taskRevision: number; idle: boolean; now: number }>;\n}\ntype FabricActorValidityDecision = boolean | { valid: boolean; reason?: string };\ntype FabricActorBindingScope = \"session\" | \"project\";\ninterface FabricActorRunBinding { model?: string; thinking?: FabricThinking }\ntype FabricActorValidWhile = (facts: Readonly<FabricActorValidityFacts>) => FabricActorValidityDecision;\ninterface FabricActorRequestBase {\n /** Fixed at creation; ask/tell cannot change language. Global templates resolve inheritance on import. */\n kernel?: FabricKernel | \"inherit\";\n scope?: \"session\" | \"project\" | \"global\";\n name: string;\n instructions: string;\n events?: FabricActorHostEvent[];\n topics?: string[];\n responseMode?: \"text\" | \"directive\";\n coalesce?: boolean;\n runner?: FabricAgentRunner;\n model?: string;\n thinking?: FabricThinking;\n tools?: string[];\n transport?: FabricTransport;\n timeoutMs?: number;\n timeout_ms?: number;\n extensions?: boolean;\n requires?: Array<string | { ref: string; optional?: boolean }>;\n validWhile?: FabricActorValidWhile;\n residency?: FabricParticipantResidency;\n}\ntype FabricActorRequest = FabricActorRequestBase & (\n | { delivery?: \"mailbox\"; triggerTurn?: false }\n | { delivery: \"nextTurn\"; triggerTurn?: false }\n | { delivery: \"steer\" | \"followUp\"; triggerTurn: boolean }\n);\ninterface FabricActorInfo {\n kernel?: FabricKernel;\n pythonRuntime?: \"cpython\" | \"monty\";\n id: string;\n scope: \"session\" | \"project\";\n name: string;\n status: \"idle\" | \"queued\" | \"running\" | \"stopped\";\n runner: FabricAgentRunner;\n events: FabricActorHostEvent[];\n topics: string[];\n delivery: FabricActorDelivery;\n responseMode: \"text\" | \"directive\";\n triggerTurn: boolean;\n coalesce: boolean;\n model?: string;\n thinking?: FabricThinking;\n binding?: FabricActorRunBinding & { scope: \"session\"; sessionId: string; updatedAt?: number };\n projectDefaults?: FabricActorRunBinding & { scope: \"project\" };\n tools?: string[];\n timeoutMs?: number;\n extensions?: boolean;\n requirements?: Array<{ ref: string; optional?: boolean }>;\n capabilityDigest?: string;\n missingCapabilities?: string[];\n validWhile?: { version: 1; source: string };\n residency: FabricParticipantResidency;\n queued: number;\n messages: number;\n createdAt: number;\n updatedAt: number;\n lastRunId?: string;\n lastError?: string;\n sessionFile?: string;\n logDir?: string;\n}\ninterface FabricModelSwitchRequest {\n /** provider/id, a models.aliases name, or a search term; resolution tries aliases first, then exact matches, then the closest fuzzy match (recency from pi-model-sort breaks ties) against authenticated models. */\n model: string;\n /** Optional provider filter applied before matching (e.g. \"anthropic\"). */\n provider?: string;\n}\ninterface FabricModelSwitchResult {\n switched: boolean;\n /** Active model as provider/id after the call (unchanged when reason is \"already-active\"). */\n model: string;\n name?: string;\n /** Previously active provider/id when known. Absent for already-active results. */\n previous?: string;\n /** Set when the selector resolved through a configured models.aliases name. */\n alias?: string;\n /** How the selector resolved: the alias name, or one of closest/recent/latest for inexact picks. Absent for exact provider/id or bare-id matches. */\n via?: string;\n reason?: \"already-active\";\n}\ninterface FabricActorMessage {\n id: string;\n actorId: string;\n actorName: string;\n direction: \"in\" | \"out\";\n source: string;\n createdAt: number;\n text?: string;\n data?: unknown;\n action?: \"silent\" | \"message\" | \"stop\";\n runId?: string;\n error?: string;\n stale?: boolean;\n reason?: string;\n}\n// agentId/agent_id spellings repair to id during agent arg normalization.\ntype FabricAgentTargetArgs = { id: string; agentId?: string; agent_id?: string };\ninterface FabricAgentsApi {\n run(args: FabricAgentRequest): Promise<FabricAgentResult>;\n /** Hosted capability only; resumes a paused direct child without exposing its checkpoint. */\n resume(args: FabricAgentTargetArgs & { task?: string }): Promise<FabricAgentResult>;\n handoff(args: FabricHandoffRequest): Promise<FabricHandoffResult>;\n spawn(args: FabricAgentRequest): Promise<FabricAgentHandle>;\n wait(args: FabricAgentTargetArgs): Promise<FabricAgentResult>;\n /** Alias for wait. */\n join(args: FabricAgentTargetArgs): Promise<FabricAgentResult>;\n status(args: FabricAgentTargetArgs): Promise<FabricAgentResult | FabricAgentHandle | FabricMainAgentInfo | FabricActorInfo | FabricParticipantInfo>;\n list(args?: { scope?: FabricParticipantScope }): Promise<Array<FabricAgentResult | FabricAgentHandle | FabricParticipantInfo>>;\n members(args?: { scope?: FabricParticipantScope; kinds?: FabricParticipantKind[]; includeStale?: boolean }): Promise<FabricParticipantInfo[]>;\n self(): Promise<FabricParticipantInfo>;\n main(): Promise<FabricMainAgentInfo>;\n sessions(): Promise<FabricParticipantInfo[]>;\n peers(): Promise<FabricPeerInfo[]>;\n subscribe(args: {\n from: string;\n events: FabricLifecycleEventType[];\n to?: string;\n delivery: FabricLifecycleDelivery;\n triggerTurn: boolean;\n once?: boolean;\n }): Promise<FabricLifecycleSubscription>;\n subscriptions(args?: { from?: string; to?: string }): Promise<FabricLifecycleSubscription[]>;\n unsubscribe(args: FabricAgentTargetArgs): Promise<{ removed: boolean }>;\n models(args?: { runner?: FabricAgentRunner; refresh?: boolean }): Promise<FabricModelInfo[]>;\n stop(args: FabricAgentTargetArgs): Promise<FabricAgentResult | FabricActorInfo | FabricRemoteControlResult>;\n cleanup(args: FabricAgentTargetArgs & { deleteBranch?: boolean; delete_branch?: boolean }): Promise<{ cleaned: boolean }>;\n create(args: FabricActorRequest): Promise<FabricActorInfo>;\n setModel(args: { id: string; model?: string; scope?: FabricActorBindingScope }): Promise<FabricActorInfo>;\n switchModel(args: FabricModelSwitchRequest): Promise<FabricModelSwitchResult>;\n setThinking(args: { id: string; thinking?: FabricThinking; scope?: FabricActorBindingScope }): Promise<FabricActorInfo>;\n setTools(args: { id: string; tools: string[]; scope?: \"project\" | \"global\" }): Promise<FabricActorInfo>;\n setEvents(args: { id: string; events: FabricActorHostEvent[] }): Promise<FabricActorInfo>;\n setDeliveryPolicy(args: {\n id: string;\n delivery: FabricActorDelivery;\n triggerTurn: boolean;\n scope?: \"project\" | \"global\";\n }): Promise<FabricActorInfo>;\n setInstructions(args: {\n id: string;\n instructions: string;\n scope?: \"project\" | \"global\";\n }): Promise<FabricActorInfo>;\n ask(args: { id: string; message: string; data?: unknown; model?: string; thinking?: FabricThinking }): Promise<FabricActorMessage>;\n tell(args: { id: string; message: string; data?: unknown; model?: string; thinking?: FabricThinking }): Promise<{ queued: true; messageId: string }>;\n steer(args: { id: string; message: string; data?: unknown }): Promise<{ queued: true; messageId: string; routed?: \"local\" | \"main\" | \"mesh\"; acknowledged?: boolean }>;\n followUp(args: { id: string; message: string; data?: unknown }): Promise<{ queued: true; messageId: string; routed?: \"local\" | \"main\" | \"mesh\"; acknowledged?: boolean }>;\n setSteeringMode(args: { id: string; mode: \"all\" | \"one-at-a-time\" }): Promise<{ queued: true; messageId: string }>;\n setFollowUpMode(args: { id: string; mode: \"all\" | \"one-at-a-time\" }): Promise<{ queued: true; messageId: string }>;\n /** Advisory compaction of a running Pi-runner child at its next safe turn boundary. */\n compact(args: { id: string; instructions?: string }): Promise<{ queued: true; messageId: string }>;\n actorStatus(args: FabricAgentTargetArgs): Promise<FabricActorInfo>;\n actors(): Promise<FabricActorInfo[]>;\n messages(args: { id: string; limit?: number }): Promise<FabricActorMessage[]>;\n remove(args: { id: string }): Promise<{ removed: boolean }>;\n /** Drop an actor's mailbox history without stopping the actor. */\n clearMessages(args: { id: string }): Promise<FabricActorInfo>;\n /** Stamp a global template into the current project as a fresh live actor with no inherited history. */\n \"import\"(args: { id?: string; name?: string; as?: string }): Promise<FabricActorInfo>;\n /** Export a live project actor's definition to the global registry as a project-independent template. */\n \"export\"(args: { id: string; overwrite?: boolean }): Promise<FabricActorRequest & { id: string; createdAt: number; updatedAt: number }>;\n log(args: {\n id: string;\n type?: \"session\" | \"run\" | \"all\";\n lines?: number;\n before?: number;\n runId?: string;\n }): Promise<FabricActorLog | FabricAgentLog>;\n}\ninterface FabricMcpResult {\n text: string;\n content: unknown[];\n structuredContent: unknown;\n}\ninterface FabricMcpTool {\n (args?: Record<string, unknown>): Promise<FabricMcpResult | unknown>;\n}\ninterface FabricMcpServer {\n [tool: string]: FabricMcpTool;\n}\n// Management verbs stay members of mcp even when the declare line below is\n// replaced by generated per-server declarations (see the dynamic option on\n// guestTypeDeclarations), so generated surfaces intersect with this type\n// rather than re-declaring them.\ninterface FabricMcpManagement {\n servers(): Promise<Array<{ name: string; description: string | null; transport: \"http\" | \"stdio\" }>>;\n reload(): Promise<{ servers: string[] }>;\n register(args: {\n name: string;\n description?: string;\n command?: string;\n args?: string[];\n cwd?: string;\n baseUrl?: string;\n headers?: Record<string, string>;\n env?: Record<string, string>;\n overwrite?: boolean;\n }): Promise<{ registered: string }>;\n call(args: { server: string; tool: string; args?: Record<string, unknown> }): Promise<unknown>;\n}\n// Loose static surface: any server/tool name compiles and argument shapes are\n// enforced at dispatch by the registry. With descriptor data available the\n// execution service replaces the declare-const-mcp line below with a\n// schema-typed rendering of the live cache (runtime/dynamic-guest-types.ts).\ntype FabricMcpApi = Record<string, FabricMcpServer> & FabricMcpManagement;\ninterface FabricCouncilRunOptions extends FabricAgentRequest {\n roles: string[];\n}\ninterface FabricCouncilApi {\n run(args: FabricCouncilRunOptions & { synthesize?: true }): Promise<FabricAgentResult>;\n run(args: FabricCouncilRunOptions & { synthesize: false }): Promise<FabricAgentResult[]>;\n}\ninterface FabricMeshIdentity {\n id: string;\n name: string;\n kind: \"main\" | \"actor\" | \"agent\";\n sessionId?: string;\n}\ninterface FabricMeshEvent {\n id: string;\n sequence: number;\n topic: string;\n kind: string;\n from: FabricMeshIdentity;\n to?: string;\n text?: string;\n data?: unknown;\n createdAt: number;\n}\ninterface FabricMeshStateEntry<T = unknown> {\n key: string;\n value: T;\n version: number;\n updatedAt: number;\n updatedBy: FabricMeshIdentity;\n}\ninterface FabricMeshApi {\n self(): Promise<FabricMeshIdentity>;\n publish(args: { topic: string; kind?: string; to?: string; text?: string; data?: unknown; message?: string; body?: string }): Promise<FabricMeshEvent>;\n read(args?: { after?: number; topic?: string; to?: string; limit?: number; max?: number }): Promise<FabricMeshEvent[]>;\n members(args?: { scope?: FabricParticipantScope; kinds?: FabricParticipantKind[]; includeStale?: boolean; limit?: number; max?: number; include_stale?: boolean }): Promise<FabricParticipantInfo[]>;\n get<T = unknown>(args: { key: string }): Promise<FabricMeshStateEntry<T> | null>;\n list<T = unknown>(args?: { prefix?: string; limit?: number; max?: number }): Promise<Array<FabricMeshStateEntry<T>>>;\n put<T = unknown>(args: { key: string; value: T; ifVersion?: number; if_version?: number; version?: number }): Promise<FabricMeshStateEntry<T>>;\n delete(args: { key: string; ifVersion?: number; if_version?: number; version?: number }): Promise<{ deleted: boolean; version?: number }>;\n}\n// Stable-provider argument bags declare the canonical keys plus the\n// near-miss spellings repaired during argument normalization\n// (providers/arg-normalization.ts and each provider's per-action table). The\n// registry's prepare stage repairs aliases before schema validation, so a\n// call spelled with an alias typechecks instead of tripping the\n// excess-property check; the canonical key wins on conflict, and anything\n// else fails additionalProperties:false validation with the offending\n// property path named. Keep these spillover fields in sync with the provider\n// normalization tables.\ntype FabricMemoryBranches = \"active\" | \"all\";\ntype FabricMemoryQueryMode = \"literal\" | \"phrase\" | \"regex\";\ntype FabricMemoryQueryMatch = \"all\" | \"any\";\ninterface FabricMemoryEntryRange {\n first: number;\n last: number;\n}\ninterface FabricMemoryRecallArgs {\n source?: string;\n query?: string;\n queryMode?: FabricMemoryQueryMode;\n queryMatch?: FabricMemoryQueryMatch;\n expectedSourceHash?: string;\n expectedLineageFingerprint?: string;\n branches?: FabricMemoryBranches;\n scope?: string;\n offset?: number;\n pageSize?: number;\n snippetChars?: number;\n role?: string;\n tool?: string;\n ref?: string;\n provider?: string;\n action?: string;\n outcome?: \"succeeded\" | \"failed\" | \"aborted\" | \"timed_out\";\n since?: number;\n until?: number;\n entryRange?: FabricMemoryEntryRange;\n q?: string;\n limit?: number;\n max?: number;\n page_size?: number;\n snippet_chars?: number;\n query_mode?: FabricMemoryQueryMode;\n query_match?: FabricMemoryQueryMatch;\n entry_range?: FabricMemoryEntryRange;\n}\ninterface FabricMemoryExpandArgs {\n source?: string;\n session: string;\n expectedSourceHash?: string;\n expectedLineageFingerprint?: string;\n branches?: FabricMemoryBranches;\n indices?: number[];\n entryIds?: string[];\n operationAddresses?: string[];\n entryRange?: FabricMemoryEntryRange;\n before?: number;\n after?: number;\n entryOffset?: number;\n textOffset?: number;\n maxChars?: number;\n maxEntries?: number;\n id?: string;\n file?: string;\n path?: string;\n session_id?: string;\n index?: number;\n entry_ids?: string[];\n operation_addresses?: string[];\n entry_range?: FabricMemoryEntryRange;\n entry_offset?: number;\n text_offset?: number;\n max_chars?: number;\n max_entries?: number;\n}\ninterface FabricMemoryCall<Ref extends string, Args> {\n ref: Ref;\n args: Args;\n}\ninterface FabricMemoryRecallEntryHit {\n kind: \"entry\";\n sessionId: string;\n tier: \"hot\" | \"cold\";\n index: number;\n entryId: string | null;\n parentId: string | null;\n operationAddress: string | null;\n type: string;\n role: string | null;\n tool: string | null;\n ref: string | null;\n provider: string | null;\n action: string | null;\n timestamp: number | null;\n isError: boolean;\n outcome?: \"succeeded\" | \"failed\" | \"aborted\" | \"timed_out\";\n score: number;\n snippet: string;\n truncated: boolean;\n follow: FabricMemoryCall<\"memory.expand\", FabricMemoryExpandArgs>;\n}\ninterface FabricMemoryRecallSessionHit {\n kind: \"session\";\n sessionId: string;\n tier: \"cold\";\n cwd: string;\n lastTimestamp: number | null;\n score: number;\n matchedTerms: number;\n matchedStructuralEntries: number;\n follow: FabricMemoryCall<\"memory.recall\", FabricMemoryRecallArgs>;\n}\ntype FabricMemoryRecallHit = FabricMemoryRecallEntryHit | FabricMemoryRecallSessionHit;\ninterface FabricMemoryError {\n code: string;\n message: string;\n [key: string]: unknown;\n}\ninterface FabricMemoryCoverage {\n complete: boolean;\n indexedSessions: number;\n eligibleSessions: number;\n staleSessions: number;\n incompleteSessions: number;\n reasons: string[];\n error?: FabricMemoryError;\n}\ninterface FabricMemoryRecallResult {\n total: number;\n hits: FabricMemoryRecallHit[];\n next: FabricMemoryCall<\"memory.recall\", FabricMemoryRecallArgs> | null;\n coverage: FabricMemoryCoverage;\n error?: FabricMemoryError;\n}\ninterface FabricMemoryExpandedEntry {\n index: number;\n entryId: string | null;\n parentId: string | null;\n type: string | null;\n role: string | null;\n timestamp: number | null;\n isError: boolean;\n anchor?: boolean;\n text: string;\n textRange: { start: number; end: number; total: number; complete: boolean };\n parentEntryId?: string | null;\n operationAddress?: string | null;\n tool?: string | null;\n ref?: string | null;\n provider?: string | null;\n action?: string | null;\n outcome?: \"succeeded\" | \"failed\" | \"aborted\" | \"timed_out\";\n filesTouched?: Array<string | null>;\n operation?: unknown;\n branchFact?: unknown;\n structuredTruncated?: boolean;\n factAddress?: string | null;\n carrierEntryId?: string | null;\n carrierParentId?: string | null;\n carrierFromId?: string | null;\n}\ninterface FabricMemoryExpandResult {\n session?: string;\n sourceHash?: string;\n branches?: FabricMemoryBranches;\n lineageFingerprint?: string;\n entryCount?: number;\n entries: FabricMemoryExpandedEntry[];\n next?: FabricMemoryCall<\"memory.expand\", FabricMemoryExpandArgs> | null;\n error?: FabricMemoryError;\n}\ninterface FabricMemoryWalkResult {\n visited: number;\n stopped: boolean;\n error?: FabricMemoryError;\n}\ninterface FabricMemorySessionInfo {\n id: string;\n file: string;\n cwd: string;\n mtime: number;\n entryCount: number;\n tier: \"hot\" | \"cold\";\n branches: FabricMemoryBranches;\n lineageFingerprint: string | null;\n}\ninterface FabricMemoryApi {\n recall(args?: FabricMemoryRecallArgs): Promise<FabricMemoryRecallResult>;\n expand(args: FabricMemoryExpandArgs): Promise<FabricMemoryExpandResult>;\n walk(\n args: FabricMemoryExpandArgs,\n visitor: (\n entry: FabricMemoryExpandedEntry,\n index: number,\n ) => boolean | void | Promise<boolean | void>,\n ): Promise<FabricMemoryWalkResult>;\n sessions(args?: {\n source?: string;\n scope?: string;\n branches?: FabricMemoryBranches;\n limit?: number;\n max?: number;\n }): Promise<{\n scope?: string;\n branches?: FabricMemoryBranches;\n sessions?: FabricMemorySessionInfo[];\n error?: FabricMemoryError;\n }>;\n}\ninterface FabricStateTransitionArgs {\n label: string;\n from?: string;\n to: string;\n summary: string;\n evidence?: string[];\n tags?: string[];\n kind?: \"state\" | \"representation\";\n complexity?: { files: string[] };\n force?: boolean;\n name?: string;\n description?: string;\n}\ninterface FabricStateComplexityFile {\n file: string;\n supported: boolean;\n language?: string;\n current?: number;\n recorded?: number;\n delta?: number;\n recordedDelta?: number;\n}\ninterface FabricStateVerificationResult {\n certified: boolean;\n violated: boolean;\n certificationStatus: \"certified\" | \"failed\";\n results: unknown[];\n failures: unknown[];\n certificate?: unknown;\n reportingError?: string;\n evidenceDigest: string;\n resultDigest: string;\n}\ninterface FabricStateApi {\n transition(args: FabricStateTransitionArgs): Promise<{ event: FabricMeshEvent; head: unknown }>;\n get(): Promise<{\n head: unknown | null;\n goal: { check: string; description?: string } | null;\n complexity: { files: number; decisionPoints: number; lastNetDelta: number };\n certification: { current: unknown | null; recent: unknown[] };\n recentLabels: string[];\n }>;\n history(args?: { label?: string; limit?: number; includeArchived?: boolean; name?: string; max?: number }): Promise<{\n transitions: unknown[];\n labels: string[];\n certifications: unknown[];\n }>;\n complexity(args?: { files?: string[]; paths?: string[] }): Promise<{ files: FabricStateComplexityFile[]; netDelta: number }>;\n verify(args?: { labels?: string[]; includeArchived?: boolean; timeoutMs?: number; label?: string }): Promise<FabricStateVerificationResult>;\n goal(args: { check: string; description?: string; command?: string; cmd?: string; predicate?: string }): Promise<FabricMeshStateEntry<{ check: string; description?: string }>>;\n checkGoal(args?: { timeoutMs?: number }): Promise<{\n passed: boolean;\n output: string;\n exitCode: number | null;\n error?: string;\n }>;\n}\ntype FabricSchemaEvidence =\n | { kind: \"file_exists\"; path: string }\n | { kind: \"file_absent\"; path: string }\n | { kind: \"file_contains\"; path: string; literal: string }\n | { kind: \"file_sha256\"; path: string; sha256: string }\n | { kind: \"trusted_command\"; name: string };\ntype FabricSchemaFileOperation =\n | { kind: \"write\"; path: string; content: string; expected: { absent: true } | { sha256: string } }\n | { kind: \"edit\"; path: string; oldText: string; newText: string; expectedSha256: string }\n | { kind: \"delete\"; path: string; expectedSha256: string };\ninterface FabricSchemaEvidenceResult {\n evidence: FabricSchemaEvidence;\n status: \"confirmed\" | \"nonconfirmed\" | \"error\";\n detail: string;\n exitCode?: number | null;\n output?: string;\n observedSha256?: string;\n}\ninterface FabricSchemaStatus {\n mode: \"off\" | \"audit\" | \"enforce\";\n certificateTtlMs: number;\n maxFiles: number;\n maxBytes: number;\n trustedCommands: string[];\n generation: number;\n lastOutcome: \"committed\" | \"rolled_back\" | \"quarantined\" | null;\n hypotheses: Array<{\n id: string;\n label: string;\n status: string;\n generation: number;\n updatedAt: number;\n }>;\n}\ninterface FabricSchemaVerificationResult {\n verified: boolean;\n hypothesisId: string;\n certificate?: string;\n issuedAt?: number;\n expiresAt?: number;\n reason?: string;\n results: FabricSchemaEvidenceResult[];\n}\ninterface FabricSchemaCommitResult {\n outcome: \"committed\" | \"rolled_back\" | \"quarantined\";\n transactionId: string;\n generation?: number;\n paths?: string[];\n postconditions?: FabricSchemaEvidenceResult[];\n complexityReductionCertified?: boolean;\n stateTransition?: unknown;\n error?: string;\n rollbackError?: string;\n}\ninterface FabricSchemaApi {\n status(): Promise<FabricSchemaStatus>;\n hypothesize(args: {\n label: string;\n summary: string;\n evidence: FabricSchemaEvidence[];\n complexityReduction?: boolean;\n name?: string;\n description?: string;\n complexity_reduction?: boolean;\n }): Promise<{\n hypothesisId: string;\n status: string;\n state: unknown;\n fingerprint: string;\n generation: number;\n }>;\n verify(args: { hypothesisId: string; id?: string; hypothesis_id?: string }): Promise<FabricSchemaVerificationResult>;\n commit(args: {\n hypothesisId: string;\n certificate: string;\n operations: FabricSchemaFileOperation[];\n postconditions: FabricSchemaEvidence[];\n id?: string;\n hypothesis_id?: string;\n }): Promise<FabricSchemaCommitResult>;\n abort(args: { hypothesisId: string; certificate?: string; id?: string; hypothesis_id?: string }): Promise<{\n aborted: true;\n hypothesisId: string;\n }>;\n}\ninterface FabricCompactPendingIntent {\n reason?: string;\n instructions?: string;\n preserve?: string[];\n requestedBy: string;\n requestedAt: number;\n}\ninterface FabricCompactLastCommit {\n at: number;\n requestedBy: string;\n status: \"committed\" | \"cancelled\" | \"failed\";\n summary?: string;\n tokensBefore?: number;\n estimatedTokensAfter?: number;\n error?: string;\n}\ntype FabricComponentState = \"waiting\" | \"loading\" | \"active\" | \"unloading\" | \"failed\" | \"quarantined\" | \"disposed\";\ninterface FabricComponentEffectInfo {\n label: string;\n kind: \"none\" | \"scoped\" | \"transactional\" | \"emission\";\n resources: string[];\n ordering: \"commutative\" | \"ordered\" | \"unknown\";\n}\ninterface FabricComponentEffectConflict {\n withComponent: string;\n resources: string[];\n reason: \"shared_resource\" | \"unknown_resource\";\n}\ninterface FabricComponentInfo {\n id: string;\n component: string;\n parentId?: string;\n state: FabricComponentState;\n guarantee: \"managed\" | \"revertible\";\n requirements: string[];\n provisions: string[];\n missing: string[];\n optionalMissing: string[];\n effects?: FabricComponentEffectInfo[];\n effectConflicts?: FabricComponentEffectConflict[];\n targetDigest?: string;\n error?: string;\n cleanupErrors?: string[];\n revision: number;\n createdAt: number;\n updatedAt: number;\n}\ninterface FabricComponentEntry {\n id: string;\n component: string;\n config?: unknown;\n disabled?: boolean;\n}\ninterface FabricComponentDefinitionInfo {\n name: string;\n description?: string;\n revision: number;\n configSchema?: Record<string, unknown>;\n requirements: string[];\n provisions: string[];\n}\ninterface FabricComponentConfigSource {\n scope: \"global\" | \"project\";\n path: string;\n trusted: boolean;\n present: boolean;\n selected: boolean;\n}\ninterface FabricComponentConfigurationInfo {\n sources: FabricComponentConfigSource[];\n warnings: string[];\n sessionOverrides: string[];\n removalPolicy: \"drain\";\n error?: string;\n}\ninterface FabricComponentChangeRequest {\n scope?: \"session\" | \"global\" | \"project\";\n entries?: FabricComponentEntry[];\n remove?: string[];\n reset?: string[];\n}\ninterface FabricComponentChangePlan {\n revision: string;\n request: Required<FabricComponentChangeRequest>;\n changes: Array<{ id: string; operation: \"add\" | \"replace\" | \"remove\"; component: string; requirements: string[]; provisions: string[] }>;\n warnings: string[];\n sources: FabricComponentConfigSource[];\n}\ninterface FabricComponentsApi {\n list(): Promise<{\n definitions: FabricComponentDefinitionInfo[];\n components: FabricComponentInfo[];\n configuration: FabricComponentConfigurationInfo;\n }>;\n describe(args: { component: string }): Promise<FabricComponentDefinitionInfo & { instances: FabricComponentInfo[] }>;\n plan(args: FabricComponentChangeRequest): Promise<FabricComponentChangePlan>;\n apply(args: FabricComponentChangeRequest & { expectedRevision: string }): Promise<{ components: FabricComponentInfo[]; configuration: FabricComponentConfigurationInfo; scope: \"session\" | \"global\" | \"project\" }>;\n reconcile(): Promise<{ components: FabricComponentInfo[]; configuration: FabricComponentConfigurationInfo }>;\n status(args: { id: string }): Promise<FabricComponentInfo>;\n graph(): Promise<{\n components: FabricComponentInfo[];\n edges: Array<{ from: string; to: string; ref: string; kind?: \"dependency\" | \"ownership\" }>;\n cycles: string[][];\n }>;\n reload(args?: { id?: string }): Promise<{ components: FabricComponentInfo[] }>;\n}\n\ninterface FabricCompactApi {\n request(args?: {\n reason?: string;\n instructions?: string;\n preserve?: string[];\n requestedBy?: string;\n instruction?: string;\n requested_by?: string;\n }): Promise<{ requested: true; intent: FabricCompactPendingIntent }>;\n status(): Promise<{ pending?: FabricCompactPendingIntent; last?: FabricCompactLastCommit }>;\n cancel(): Promise<{ cancelled: true }>;\n}\n\ninterface FabricPrewalkFileIdentityStatus {\n path: string;\n loadedSha256: string;\n diskSha256: string;\n stale: boolean;\n}\ninterface FabricPrewalkApi {\n plan(args: {\n outcome: string;\n steps: string[];\n verification: string[];\n risks: string;\n }): Promise<{ recorded: true; readiness: \"ready\"; plan: string }>;\n status(): Promise<{\n state: \"idle\" | \"armed\" | \"handing_off\" | \"continuation_pending\";\n planRequired: boolean;\n planReady: boolean;\n planPrompts: number;\n claimedReadiness: \"planned\" | \"disabled\" | \"unplanned\" | null;\n runtime?: {\n entry: FabricPrewalkFileIdentityStatus | null;\n lazyRuntime: FabricPrewalkFileIdentityStatus | null;\n };\n }>;\n}\n\ninterface FabricWorkflowAgentOptions extends Omit<FabricAgentRequest, \"task\"> {\n label?: string;\n}\ntype FabricActivityStatus = \"pending\" | \"running\" | \"completed\" | \"failed\" | \"blocked\" | \"stopped\";\ntype FabricActivityKind = \"agent\" | \"actor\" | \"tool\" | \"extension\" | \"mcp\" | \"mesh\" | \"task\" | \"custom\";\ninterface FabricWorkflowDisplay {\n name?: string;\n description?: string;\n}\ninterface FabricWorkflowPhaseOptions {\n id?: string;\n description?: string;\n total?: number;\n}\ninterface FabricWorkflowPhaseInput extends FabricWorkflowPhaseOptions {\n name: string;\n}\ninterface FabricWorkflowItem {\n id: string;\n label: string;\n status?: FabricActivityStatus;\n phase?: string;\n detail?: string;\n kind?: FabricActivityKind;\n current?: string;\n total?: number;\n completed?: number;\n data?: unknown;\n}\ninterface FabricWorkflowApi {\n agent<T = string>(prompt: string, options?: FabricWorkflowAgentOptions): Promise<T>;\n parallel<T, R>(items: T[], mapper: (item: T, index: number) => Promise<R> | R, concurrency?: number | { concurrency?: number }): Promise<R[]>;\n parallel<T>(thunks: Array<() => Promise<T> | T>, concurrency?: number | { concurrency?: number }): Promise<T[]>;\n pipeline<T>(items: T[], ...stages: Array<(value: unknown, original: T, index: number) => Promise<unknown> | unknown>): Promise<unknown[]>;\n configure(display: FabricWorkflowDisplay): Promise<FabricWorkflowDisplay>;\n phase(name: string, options?: FabricWorkflowPhaseOptions): Promise<{ name: string; index: number; id?: string }>;\n phase(input: FabricWorkflowPhaseInput): Promise<{ name: string; index: number; id?: string }>;\n item(item: FabricWorkflowItem): Promise<FabricWorkflowItem>;\n event(event: { message: string; level?: \"info\" | \"success\" | \"warning\" | \"error\"; data?: unknown }): Promise<void>;\n log(...values: unknown[]): void;\n budget: { total: number; spent(): number; remaining(): number };\n}\ndeclare const tools: FabricToolsApi;\ndeclare const pi: PiToolsApi;\ndeclare const extensions: FabricExtensionsApi;\ndeclare const agents: FabricAgentsApi;\ndeclare const mesh: FabricMeshApi;\ndeclare const mcp: FabricMcpApi;\ndeclare const memory: FabricMemoryApi;\ndeclare const state: FabricStateApi;\ndeclare const schema: FabricSchemaApi;\ndeclare const components: FabricComponentsApi;\ndeclare const compact: FabricCompactApi;\ndeclare const prewalk: FabricPrewalkApi;\n${JEV_GUEST_DECLARATIONS}\ndeclare const council: FabricCouncilApi;\ndeclare const workflow: FabricWorkflowApi;\ndeclare function agent<T = string>(prompt: string, options?: FabricWorkflowAgentOptions): Promise<T>;\ndeclare function parallel<T, R>(items: T[], mapper: (item: T, index: number) => Promise<R> | R, concurrency?: number | { concurrency?: number }): Promise<R[]>;\ndeclare function parallel<T>(thunks: Array<() => Promise<T> | T>, concurrency?: number | { concurrency?: number }): Promise<T[]>;\ndeclare function pipeline<T>(items: T[], ...stages: Array<(value: unknown, original: T, index: number) => Promise<unknown> | unknown>): Promise<unknown[]>;\ndeclare function phase(name: string, options?: FabricWorkflowPhaseOptions): Promise<{ name: string; index: number; id?: string }>;\ndeclare function phase(input: FabricWorkflowPhaseInput): Promise<{ name: string; index: number; id?: string }>;\ndeclare function log(...values: unknown[]): void;\ndeclare const budget: FabricWorkflowApi[\"budget\"];\ntype FabricRlmRequest = Omit<FabricAgentRequest, \"runner\" | \"recursive\"> & { runner?: \"pi\" };\ndeclare const rlm: { query(args: FabricRlmRequest): Promise<FabricAgentResult> };\ninterface FabricConsole {\n log(...args: unknown[]): void;\n info(...args: unknown[]): void;\n warn(...args: unknown[]): void;\n error(...args: unknown[]): void;\n}\ndeclare const console: FabricConsole;\ndeclare const \u03C0: Readonly<Record<string, string>>;\n// Process runtimes only: node/bun children bridge native-module imports;\n// quickjs has no module loader and rejects __fabricImport at runtime.\ndeclare function __fabricImport(specifier: string): Promise<any>;\ndeclare function print(...args: unknown[]): void;\ndeclare function setTimeout(handler: (...args: any[]) => void, timeout?: number): number;\ndeclare function clearTimeout(handle: number): void;\ndeclare function setInterval(handler: (...args: any[]) => void, timeout?: number): number;\ndeclare function clearInterval(handle: number): void;\n// Process runtimes only: the bun-process child binds the host's real Bun\n// module namespace as __bun; undefined under node-process and quickjs.\ndeclare const __bun: any;\n`;\n\nconst FULL_CODE_GLOBAL_DECLARATIONS = [\n \"declare const pi: PiToolsApi;\\n\",\n \"declare const extensions: FabricExtensionsApi;\\n\",\n];\n\nconst PI_LOOSE_DECLARATION = \"declare const pi: PiToolsApi;\\n\";\nconst MCP_LOOSE_DECLARATION = \"declare const mcp: FabricMcpApi;\\n\";\nconst EXTENSIONS_LOOSE_DECLARATION = \"declare const extensions: FabricExtensionsApi;\\n\";\n\nexport interface FabricGuestDeclarationOptions {\n /** Global names to omit (for example providers disabled by configuration). */\n excludeGlobals?: readonly string[];\n /**\n * Pre-rendered replacement blocks from buildDynamicGuestDeclarations().\n * Applied only when the loose anchor line is still present \u2014 excluded\n * globals (or orchestration-only mode, for extensions) keep nothing to\n * replace, and missing/undefined sections keep the loose surface.\n */\n dynamic?: FabricDynamicGuestDeclarations;\n /**\n * Additive overloads for the current captured exact-name core overrides.\n * The block is applied only to the full-code `pi` declaration.\n */\n coreOverrides?: string;\n}\n\nconst globalDeclarationLine = (name: string): RegExp =>\n new RegExp(`^declare const ${name}: [^\\\\n]*;\\\\n`, \"m\");\n\nconst terminatedDeclaration = (block: string): string =>\n block.endsWith(\"\\n\") ? block : `${block}\\n`;\n\nexport const guestTypeDeclarations = (\n fullCodeMode: boolean,\n options: FabricGuestDeclarationOptions = {},\n): string => {\n const base = fullCodeMode\n ? GUEST_TYPE_DECLARATIONS\n : FULL_CODE_GLOBAL_DECLARATIONS.reduce(\n (declarations, declaration) => declarations.replace(declaration, \"\"),\n GUEST_TYPE_DECLARATIONS,\n );\n let result = (options.excludeGlobals ?? []).reduce(\n (declarations, name) => declarations.replace(globalDeclarationLine(name), \"\"),\n base,\n );\n if (fullCodeMode && options.coreOverrides && result.includes(PI_LOOSE_DECLARATION)) {\n result = result.replace(\n PI_LOOSE_DECLARATION,\n terminatedDeclaration(options.coreOverrides),\n );\n }\n if (options.dynamic?.mcp && result.includes(MCP_LOOSE_DECLARATION)) {\n result = result.replace(\n MCP_LOOSE_DECLARATION,\n terminatedDeclaration(options.dynamic.mcp),\n );\n }\n if (options.dynamic?.extensions && result.includes(EXTENSIONS_LOOSE_DECLARATION)) {\n result = result.replace(\n EXTENSIONS_LOOSE_DECLARATION,\n terminatedDeclaration(options.dynamic.extensions),\n );\n }\n return result;\n};\n"],
5
- "mappings": ";AAAO,IAAM,yBAAyB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACS/B,IAAM,4CAA4C;AAAA,EACvD,MAAM;AAAA,EACN,MAAM;AAAA,EACN,YAAY;AAAA,EACZ,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,IAAI;AACN;AAEO,IAAM,yBAAyB;AAAA,EACpC,MAAM,CAAC,UAAU,OAAO;AAAA,EACxB,MAAM,CAAC,SAAS;AAAA,EAChB,YAAY,CAAC,SAAS;AAAA,EACtB,MAAM,CAAC;AAAA,EACP,OAAO,CAAC;AAAA,EACR,MAAM,CAAC,WAAW,OAAO;AAAA,EACzB,MAAM,CAAC,OAAO;AAAA,EACd,IAAI,CAAC,OAAO;AACd;AAEO,IAAM,0BAA0B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAg2CrC,sBAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAkCxB,IAAM,gCAAgC;AAAA,EACpC;AAAA,EACA;AACF;AAEA,IAAM,uBAAuB;AAC7B,IAAM,wBAAwB;AAC9B,IAAM,+BAA+B;AAmBrC,IAAM,wBAAwB,CAAC,SAC7B,IAAI,OAAO,kBAAkB,IAAI,iBAAiB,GAAG;AAEvD,IAAM,wBAAwB,CAAC,UAC7B,MAAM,SAAS,IAAI,IAAI,QAAQ,GAAG,KAAK;AAAA;AAElC,IAAM,wBAAwB,CACnC,cACA,UAAyC,CAAC,MAC/B;AACX,QAAM,OAAO,eACT,0BACA,8BAA8B;AAAA,IAC5B,CAAC,cAAc,gBAAgB,aAAa,QAAQ,aAAa,EAAE;AAAA,IACnE;AAAA,EACF;AACJ,MAAI,UAAU,QAAQ,kBAAkB,CAAC,GAAG;AAAA,IAC1C,CAAC,cAAc,SAAS,aAAa,QAAQ,sBAAsB,IAAI,GAAG,EAAE;AAAA,IAC5E;AAAA,EACF;AACA,MAAI,gBAAgB,QAAQ,iBAAiB,OAAO,SAAS,oBAAoB,GAAG;AAClF,aAAS,OAAO;AAAA,MACd;AAAA,MACA,sBAAsB,QAAQ,aAAa;AAAA,IAC7C;AAAA,EACF;AACA,MAAI,QAAQ,SAAS,OAAO,OAAO,SAAS,qBAAqB,GAAG;AAClE,aAAS,OAAO;AAAA,MACd;AAAA,MACA,sBAAsB,QAAQ,QAAQ,GAAG;AAAA,IAC3C;AAAA,EACF;AACA,MAAI,QAAQ,SAAS,cAAc,OAAO,SAAS,4BAA4B,GAAG;AAChF,aAAS,OAAO;AAAA,MACd;AAAA,MACA,sBAAsB,QAAQ,QAAQ,UAAU;AAAA,IAClD;AAAA,EACF;AACA,SAAO;AACT;",
6
- "names": []
7
- }
@@ -1,7 +0,0 @@
1
- {
2
- "version": 3,
3
- "sources": ["../../src/entropy/fingerprint.ts", "../../src/entropy/normal-form.ts"],
4
- "sourcesContent": ["// Deterministic fingerprints for the entropy meter: canonical call-shape\n// signatures, signature distance (retry churn), Shannon entropy in bits, and\n// the static freedom score of a JSON Schema. Everything here is a pure\n// function of its inputs; the same value always yields the same fingerprint.\n\nimport type { EntropyTrend } from \"./types.js\";\n\nconst SIGNATURE_MAX_KEYS = 32;\nconst SIGNATURE_MAX_DEPTH = 3;\n// Enum cardinality whose freedom saturates at 1.0 (log2 of 64 values).\nconst ENUM_SATURATION_BITS = 6;\n\nconst isPlainRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === \"object\" && value !== null && !Array.isArray(value);\n\n// Fixed rounding for every reported metric value. Same inputs, same floats,\n// same six decimal places \u2014 report JSON is byte-stable. Negative zero\n// collapses to zero so single-class entropies compare equal to zero.\nexport const roundMetric = (value: number): number => {\n const rounded = Math.round(value * 1e6) / 1e6;\n return rounded === 0 ? 0 : rounded;\n};\n\n// Code-unit string comparison: locale-independent, so ordering never varies\n// with the host's ICU data.\nexport const compareCodeUnits = (left: string, right: string): number =>\n left < right ? -1 : left > right ? 1 : 0;\n\nconst typeTag = (value: unknown, depth: number): string => {\n if (value === null) return \"null\";\n if (Array.isArray(value)) return \"arr\";\n switch (typeof value) {\n case \"string\":\n return \"str\";\n case \"number\":\n return \"num\";\n case \"boolean\":\n return \"bool\";\n case \"object\": {\n if (depth >= SIGNATURE_MAX_DEPTH) return \"obj\";\n try {\n const record = value as Record<string, unknown>;\n const keys = Object.keys(record).sort();\n const head = keys\n .slice(0, SIGNATURE_MAX_KEYS)\n .map((key) => `${key}:${typeTag(record[key], depth + 1)}`);\n if (keys.length > SIGNATURE_MAX_KEYS) {\n head.push(`\u2026+${keys.length - SIGNATURE_MAX_KEYS}`);\n }\n return `{${head.join(\",\")}}`;\n } catch {\n return \"obj\";\n }\n }\n default:\n return \"other\";\n }\n};\n\n// Canonical argument-shape signature: sorted parameter names with a bounded\n// value-type tag each. Key order and value contents never matter \u2014 only the\n// shape the model chose.\nexport const shapeSignature = (args: Record<string, unknown>): string => {\n const keys = Object.keys(args).sort();\n const head = keys\n .slice(0, SIGNATURE_MAX_KEYS)\n .map((key) => `${key}:${typeTag(args[key], 1)}`);\n if (keys.length > SIGNATURE_MAX_KEYS) {\n head.push(`\u2026+${keys.length - SIGNATURE_MAX_KEYS}`);\n }\n return `(${head.join(\",\")})`;\n};\n\n// Normalized Levenshtein distance between two signatures, in [0, 1]. Retry\n// churn is the distance between a failed call's shape and the next attempt's.\nexport const signatureDistance = (left: string, right: string): number => {\n if (left === right) return 0;\n const bound = Math.max(left.length, right.length);\n if (bound === 0) return 0;\n let previous: number[] = [];\n for (let index = 0; index <= right.length; index++) {\n previous.push(index);\n }\n for (let index = 1; index <= left.length; index++) {\n const current: number[] = [index];\n for (let inner = 1; inner <= right.length; inner++) {\n const substitution = previous[inner - 1]! + (left[index - 1] === right[inner - 1] ? 0 : 1);\n const insertion = current[inner - 1]! + 1;\n const deletion = previous[inner]! + 1;\n current.push(Math.min(substitution, insertion, deletion));\n }\n previous = current;\n }\n return roundMetric(previous[right.length]! / bound);\n};\n\n// Shannon entropy in bits over a count distribution, rounded to 1e-6.\n// A single class is zero bits; a uniform split over k classes is log2(k).\nexport const shannonEntropyBits = (counts: readonly number[]): number => {\n const total = counts.reduce((sum, value) => sum + value, 0);\n if (total <= 0) return 0;\n let bits = 0;\n for (const count of counts) {\n if (count <= 0) continue;\n const probability = count / total;\n bits += probability * Math.log2(probability);\n }\n return roundMetric(-bits);\n};\n\nconst schemaFreedom = (schema: unknown, depth: number): number => {\n if (depth > SIGNATURE_MAX_DEPTH) return 0.5;\n if (!isPlainRecord(schema)) return 0.5;\n const union = Array.isArray(schema.anyOf)\n ? schema.anyOf\n : Array.isArray(schema.oneOf)\n ? schema.oneOf\n : undefined;\n if (union) {\n const scores = union.map((branch) => schemaFreedom(branch, depth + 1));\n const widest = scores.length > 0 ? Math.max(...scores) : 0;\n return roundMetric(widest + 0.1 * Math.max(0, union.length - 1));\n }\n if (Array.isArray(schema.enum)) {\n return roundMetric(\n Math.min(1, Math.log2(Math.max(1, schema.enum.length)) / ENUM_SATURATION_BITS),\n );\n }\n if (\"const\" in schema) return 0;\n const type = schema.type;\n if (typeof type !== \"string\") return 0.75;\n if (type === \"boolean\") return 0.1;\n if (type === \"number\" || type === \"integer\") return 0.5;\n if (type === \"string\") return 1;\n if (type === \"array\") return roundMetric(0.5 + 0.5 * schemaFreedom(schema.items, depth + 1));\n if (type === \"object\") {\n const properties = schema.properties;\n if (!isPlainRecord(properties)) return 1;\n const keys = Object.keys(properties).sort();\n if (keys.length === 0) return 1;\n const required = Array.isArray(schema.required)\n ? schema.required.filter((entry): entry is string => typeof entry === \"string\")\n : [];\n let score = 0;\n for (const key of keys) {\n score += schemaFreedom(properties[key], depth + 1);\n if (!required.includes(key)) score += 0.25;\n }\n if (schema.additionalProperties !== false) score += 0.5;\n return roundMetric(score);\n }\n return 0.75;\n};\n\n// Static freedom of one action's input schema: free strings dominate, enums\n// shrink with log2 cardinality, literals cost nothing, and optional or\n// open-ended parameters add tax. Computable with an empty corpus, which is\n// what lets the compiler score candidate surfaces before deployment.\nexport const staticFreedomFromSchema = (schema: unknown): number => schemaFreedom(schema, 0);\n\n// Least-squares slope of a score sequence, oldest to newest. The on-demand\n// session trend feeds this per-session scores; a flat or negative slope is\n// the ratchet holding.\nexport const trendFromScores = (scores: readonly number[]): EntropyTrend => {\n const count = scores.length;\n const first = count > 0 ? scores[0] : undefined;\n const last = count > 0 ? scores[count - 1] : undefined;\n let slope = 0;\n if (count >= 2) {\n const meanX = (count - 1) / 2;\n const meanY = scores.reduce((sum, value) => sum + value, 0) / count;\n let numerator = 0;\n let denominator = 0;\n for (let index = 0; index < count; index++) {\n numerator += (index - meanX) * (scores[index]! - meanY);\n denominator += (index - meanX) ** 2;\n }\n slope = denominator > 0 ? numerator / denominator : 0;\n }\n return {\n count,\n ...(first !== undefined ? { first: roundMetric(first) } : {}),\n ...(last !== undefined ? { last: roundMetric(last) } : {}),\n slopePerStep: roundMetric(slope),\n };\n};\n", "// Internal compatibility plans. The declared schema is never rewritten.\n// A proof is a re-derivation from a bounded rule language, not a claim made\n// by an imported artifact. No observation can authorize a new semantic map.\nimport { Value } from \"typebox/value\";\nimport { stableJsonHash } from \"../core/stable-hash.js\";\nimport { shapeSignature } from \"./fingerprint.js\";\n\nexport interface NormalFormEvidenceSummary {\n normalizedCalls: number;\n rulesApplied: number;\n succeeded: number;\n subsequentFailures: number;\n}\n\n// Witness counts are observations, not manufactured task successes. A call\n// can be normalized and still fail authorization, approval, or execution.\nexport const normalFormEvidenceSummary = (\n traces: readonly import(\"./types.js\").EntropyTraceInput[],\n): NormalFormEvidenceSummary => {\n const summary = { normalizedCalls: 0, rulesApplied: 0, succeeded: 0, subsequentFailures: 0 };\n for (const trace of traces) for (const operation of trace.operations) {\n if (!operation.normalization || !isNormalFormWitness(operation.normalization)) continue;\n summary.normalizedCalls++;\n summary.rulesApplied += operation.normalization.rules.length;\n if (operation.outcome === \"succeeded\") summary.succeeded++;\n else summary.subsequentFailures++;\n }\n return summary;\n};\n\nexport const NORMAL_FORM_VERSION = 1 as const;\nexport const MAX_NORMAL_FORM_RULES = 128;\nexport const MAX_NORMAL_FORM_PLANS = 1_000;\nconst RULE_KINDS = [\"key-form\", \"enum-form\", \"numeric-string\", \"optional-null\"] as const;\nexport type NormalFormRuleKind = typeof RULE_KINDS[number];\nexport interface NormalFormRule { kind: NormalFormRuleKind; key: string }\nexport interface NormalFormPlan {\n version: typeof NORMAL_FORM_VERSION;\n ref: string;\n baseSchemaDigest: string;\n rules: NormalFormRule[];\n}\nexport interface NormalFormWitness {\n version: typeof NORMAL_FORM_VERSION;\n baseSchemaDigest: string;\n beforeShape: string;\n afterShape: string;\n rules: NormalFormRule[];\n}\nexport interface NormalFormResult {\n args: Record<string, unknown>;\n witness?: NormalFormWitness;\n}\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n typeof value === \"object\" && value !== null && !Array.isArray(value);\nconst safeKey = (key: string): boolean => key.length <= 128 &&\n ![\"__proto__\", \"prototype\", \"constructor\"].includes(key);\nconst form = (value: string): string | undefined =>\n /^[a-zA-Z][a-zA-Z0-9 _-]*$/.test(value) ? value.toLowerCase().replace(/[ _-]/g, \"\") : undefined;\nconst accepts = (schema: unknown, args: unknown): boolean => {\n try { return isRecord(schema) && Value.Check(schema, args); } catch { return false; }\n};\nconst uniqueForms = (values: readonly string[]): Map<string, string> => {\n const groups = new Map<string, string[]>();\n for (const value of values) {\n const key = form(value);\n if (!key) continue;\n const group = groups.get(key) ?? [];\n group.push(value);\n groups.set(key, group);\n }\n return new Map([...groups].filter(([, group]) => group.length === 1).map(([key, group]) => [key, group[0]!]));\n};\n\n// These four conventions are host-authored compatibility semantics:\n// spelling-only key/enum forms, lossless numeric encoding, and omission of\n// non-nullable optional fields. Open objects and schema combinators are not\n// grounds for inventing an interpretation. Unsupported schemas pass through.\nexport const deriveNormalFormPlan = (ref: string, schema: unknown): NormalFormPlan | undefined => {\n if (!ref || ref.length > 1_024 || !isRecord(schema) || schema.type !== \"object\" ||\n schema.additionalProperties !== false || !isRecord(schema.properties) ||\n [\"patternProperties\", \"oneOf\", \"anyOf\", \"allOf\", \"$ref\", \"if\", \"not\"].some((key) => Object.hasOwn(schema, key))) return undefined;\n const keys = Object.keys(schema.properties).sort();\n if (keys.length > MAX_NORMAL_FORM_RULES || !keys.every(safeKey)) return undefined;\n const required = new Set(Array.isArray(schema.required) ? schema.required : []);\n const forms = new Set(uniqueForms(keys).values());\n const rules: NormalFormRule[] = [];\n for (const key of keys) {\n const property = schema.properties[key];\n if (!isRecord(property)) continue;\n if (forms.has(key)) rules.push({ kind: \"key-form\", key });\n if (!required.has(key) && !accepts(property, null)) rules.push({ kind: \"optional-null\", key });\n if (property.type === \"number\" || property.type === \"integer\") rules.push({ kind: \"numeric-string\", key });\n if (property.type === \"string\" && Array.isArray(property.enum) &&\n property.enum.every((value) => typeof value === \"string\") &&\n uniqueForms(property.enum).size > 0) rules.push({ kind: \"enum-form\", key });\n }\n if (rules.length === 0) return undefined;\n return { version: NORMAL_FORM_VERSION, ref, baseSchemaDigest: stableJsonHash(schema), rules: rules.slice(0, MAX_NORMAL_FORM_RULES) };\n};\n\nconst isRule = (value: unknown): value is NormalFormRule => isRecord(value) &&\n Object.keys(value).length === 2 && typeof value.key === \"string\" && safeKey(value.key) &&\n RULE_KINDS.includes(value.kind as NormalFormRuleKind);\nconst isDigest = (value: unknown): value is string => typeof value === \"string\" && /^[a-f0-9]{64}$/.test(value);\nexport const isNormalFormPlan = (value: unknown): value is NormalFormPlan => isRecord(value) &&\n Object.keys(value).length === 4 && value.version === NORMAL_FORM_VERSION &&\n typeof value.ref === \"string\" && value.ref.length > 0 && value.ref.length <= 1_024 &&\n isDigest(value.baseSchemaDigest) && Array.isArray(value.rules) &&\n value.rules.length > 0 && value.rules.length <= MAX_NORMAL_FORM_RULES && value.rules.every(isRule);\nexport const isNormalFormWitness = (value: unknown): value is NormalFormWitness => isRecord(value) &&\n Object.keys(value).length === 5 && value.version === NORMAL_FORM_VERSION &&\n isDigest(value.baseSchemaDigest) && isDigest(value.beforeShape) && isDigest(value.afterShape) &&\n Array.isArray(value.rules) && value.rules.length > 0 && value.rules.length <= MAX_NORMAL_FORM_RULES && value.rules.every(isRule);\n\nexport const provesNormalFormPlan = (plan: NormalFormPlan, schema: unknown): boolean => {\n if (!isNormalFormPlan(plan)) return false;\n try {\n const derived = deriveNormalFormPlan(plan.ref, schema);\n return derived !== undefined && stableJsonHash(derived) === stableJsonHash(plan);\n } catch { return false; }\n};\n\nexport const applyNormalFormPlan = (\n ref: string,\n schema: unknown,\n args: Record<string, unknown>,\n plan?: NormalFormPlan,\n): NormalFormResult => {\n const unchanged = { args };\n // This early identity law protects every canonical capability, including\n // rare enum members and nullable values. Successful candidates satisfy it\n // too, which establishes idempotence without a corpus-dependent gate.\n if (!plan || plan.ref !== ref || accepts(schema, args) || !provesNormalFormPlan(plan, schema)) return unchanged;\n const properties = (schema as { properties: Record<string, Record<string, unknown>> }).properties;\n const candidate = { ...args };\n const applied: NormalFormRule[] = [];\n const keyRules = plan.rules.filter((rule) => rule.kind === \"key-form\");\n const forms = uniqueForms(keyRules.map((rule) => rule.key));\n const targets = new Set<string>();\n for (const key of Object.keys(args).sort()) {\n if (Object.hasOwn(properties, key)) continue;\n const normalized = form(key);\n const target = normalized ? forms.get(normalized) : undefined;\n if (!target) continue;\n // Never discard a competing canonical value or choose between aliases.\n if (Object.hasOwn(args, target) || targets.has(target)) return unchanged;\n targets.add(target);\n Object.defineProperty(candidate, target, { value: args[key], enumerable: true, configurable: true, writable: true });\n delete candidate[key];\n applied.push({ kind: \"key-form\", key: target });\n }\n for (const rule of plan.rules) {\n if (rule.kind === \"key-form\" || !Object.hasOwn(candidate, rule.key)) continue;\n const value = candidate[rule.key];\n const property = properties[rule.key]!;\n if (accepts(property, value)) continue;\n if (rule.kind === \"optional-null\" && (value === null || value === undefined)) {\n delete candidate[rule.key];\n applied.push(rule);\n } else if (rule.kind === \"numeric-string\" && typeof value === \"string\") {\n const number = Number(value);\n if (Number.isFinite(number) && String(number) === value && accepts(property, number)) {\n candidate[rule.key] = number;\n applied.push(rule);\n }\n } else if (rule.kind === \"enum-form\" && typeof value === \"string\") {\n const normalized = form(value);\n const target = normalized ? uniqueForms(property.enum as string[]).get(normalized) : undefined;\n if (target !== undefined && accepts(property, target)) {\n candidate[rule.key] = target;\n applied.push(rule);\n }\n }\n }\n // A partial repair is not a successful correction. Return original input\n // on every refusal so authoritative validation reports the real failure.\n if (applied.length === 0 || !accepts(schema, candidate)) return unchanged;\n return {\n args: candidate,\n witness: {\n version: NORMAL_FORM_VERSION,\n baseSchemaDigest: plan.baseSchemaDigest,\n beforeShape: stableJsonHash(shapeSignature(args)),\n afterShape: stableJsonHash(shapeSignature(candidate)),\n rules: applied,\n },\n };\n};\n"],
5
- "mappings": ";;;;;AAOA,IAAM,qBAAqB;AAC3B,IAAM,sBAAsB;AAE5B,IAAM,uBAAuB;AAE7B,IAAM,gBAAgB,CAAC,UACrB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAK9D,IAAM,cAAc,CAAC,UAA0B;AACpD,QAAM,UAAU,KAAK,MAAM,QAAQ,GAAG,IAAI;AAC1C,SAAO,YAAY,IAAI,IAAI;AAC7B;AAIO,IAAM,mBAAmB,CAAC,MAAc,UAC7C,OAAO,QAAQ,KAAK,OAAO,QAAQ,IAAI;AAEzC,IAAM,UAAU,CAAC,OAAgB,UAA0B;AACzD,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO;AACjC,UAAQ,OAAO,OAAO;AAAA,IACpB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK,UAAU;AACb,UAAI,SAAS,oBAAqB,QAAO;AACzC,UAAI;AACF,cAAM,SAAS;AACf,cAAM,OAAO,OAAO,KAAK,MAAM,EAAE,KAAK;AACtC,cAAM,OAAO,KACV,MAAM,GAAG,kBAAkB,EAC3B,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,QAAQ,OAAO,GAAG,GAAG,QAAQ,CAAC,CAAC,EAAE;AAC3D,YAAI,KAAK,SAAS,oBAAoB;AACpC,eAAK,KAAK,UAAK,KAAK,SAAS,kBAAkB,EAAE;AAAA,QACnD;AACA,eAAO,IAAI,KAAK,KAAK,GAAG,CAAC;AAAA,MAC3B,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IACA;AACE,aAAO;AAAA,EACX;AACF;AAKO,IAAM,iBAAiB,CAAC,SAA0C;AACvE,QAAM,OAAO,OAAO,KAAK,IAAI,EAAE,KAAK;AACpC,QAAM,OAAO,KACV,MAAM,GAAG,kBAAkB,EAC3B,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,QAAQ,KAAK,GAAG,GAAG,CAAC,CAAC,EAAE;AACjD,MAAI,KAAK,SAAS,oBAAoB;AACpC,SAAK,KAAK,UAAK,KAAK,SAAS,kBAAkB,EAAE;AAAA,EACnD;AACA,SAAO,IAAI,KAAK,KAAK,GAAG,CAAC;AAC3B;AAIO,IAAM,oBAAoB,CAAC,MAAc,UAA0B;AACxE,MAAI,SAAS,MAAO,QAAO;AAC3B,QAAM,QAAQ,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AAChD,MAAI,UAAU,EAAG,QAAO;AACxB,MAAI,WAAqB,CAAC;AAC1B,WAAS,QAAQ,GAAG,SAAS,MAAM,QAAQ,SAAS;AAClD,aAAS,KAAK,KAAK;AAAA,EACrB;AACA,WAAS,QAAQ,GAAG,SAAS,KAAK,QAAQ,SAAS;AACjD,UAAM,UAAoB,CAAC,KAAK;AAChC,aAAS,QAAQ,GAAG,SAAS,MAAM,QAAQ,SAAS;AAClD,YAAM,eAAe,SAAS,QAAQ,CAAC,KAAM,KAAK,QAAQ,CAAC,MAAM,MAAM,QAAQ,CAAC,IAAI,IAAI;AACxF,YAAM,YAAY,QAAQ,QAAQ,CAAC,IAAK;AACxC,YAAM,WAAW,SAAS,KAAK,IAAK;AACpC,cAAQ,KAAK,KAAK,IAAI,cAAc,WAAW,QAAQ,CAAC;AAAA,IAC1D;AACA,eAAW;AAAA,EACb;AACA,SAAO,YAAY,SAAS,MAAM,MAAM,IAAK,KAAK;AACpD;AAIO,IAAM,qBAAqB,CAAC,WAAsC;AACvE,QAAM,QAAQ,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC;AAC1D,MAAI,SAAS,EAAG,QAAO;AACvB,MAAI,OAAO;AACX,aAAW,SAAS,QAAQ;AAC1B,QAAI,SAAS,EAAG;AAChB,UAAM,cAAc,QAAQ;AAC5B,YAAQ,cAAc,KAAK,KAAK,WAAW;AAAA,EAC7C;AACA,SAAO,YAAY,CAAC,IAAI;AAC1B;AAEA,IAAM,gBAAgB,CAAC,QAAiB,UAA0B;AAChE,MAAI,QAAQ,oBAAqB,QAAO;AACxC,MAAI,CAAC,cAAc,MAAM,EAAG,QAAO;AACnC,QAAM,QAAQ,MAAM,QAAQ,OAAO,KAAK,IACpC,OAAO,QACP,MAAM,QAAQ,OAAO,KAAK,IACxB,OAAO,QACP;AACN,MAAI,OAAO;AACT,UAAM,SAAS,MAAM,IAAI,CAAC,WAAW,cAAc,QAAQ,QAAQ,CAAC,CAAC;AACrE,UAAM,SAAS,OAAO,SAAS,IAAI,KAAK,IAAI,GAAG,MAAM,IAAI;AACzD,WAAO,YAAY,SAAS,MAAM,KAAK,IAAI,GAAG,MAAM,SAAS,CAAC,CAAC;AAAA,EACjE;AACA,MAAI,MAAM,QAAQ,OAAO,IAAI,GAAG;AAC9B,WAAO;AAAA,MACL,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,IAAI,GAAG,OAAO,KAAK,MAAM,CAAC,IAAI,oBAAoB;AAAA,IAC/E;AAAA,EACF;AACA,MAAI,WAAW,OAAQ,QAAO;AAC9B,QAAM,OAAO,OAAO;AACpB,MAAI,OAAO,SAAS,SAAU,QAAO;AACrC,MAAI,SAAS,UAAW,QAAO;AAC/B,MAAI,SAAS,YAAY,SAAS,UAAW,QAAO;AACpD,MAAI,SAAS,SAAU,QAAO;AAC9B,MAAI,SAAS,QAAS,QAAO,YAAY,MAAM,MAAM,cAAc,OAAO,OAAO,QAAQ,CAAC,CAAC;AAC3F,MAAI,SAAS,UAAU;AACrB,UAAM,aAAa,OAAO;AAC1B,QAAI,CAAC,cAAc,UAAU,EAAG,QAAO;AACvC,UAAM,OAAO,OAAO,KAAK,UAAU,EAAE,KAAK;AAC1C,QAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,UAAM,WAAW,MAAM,QAAQ,OAAO,QAAQ,IAC1C,OAAO,SAAS,OAAO,CAAC,UAA2B,OAAO,UAAU,QAAQ,IAC5E,CAAC;AACL,QAAI,QAAQ;AACZ,eAAW,OAAO,MAAM;AACtB,eAAS,cAAc,WAAW,GAAG,GAAG,QAAQ,CAAC;AACjD,UAAI,CAAC,SAAS,SAAS,GAAG,EAAG,UAAS;AAAA,IACxC;AACA,QAAI,OAAO,yBAAyB,MAAO,UAAS;AACpD,WAAO,YAAY,KAAK;AAAA,EAC1B;AACA,SAAO;AACT;AAMO,IAAM,0BAA0B,CAAC,WAA4B,cAAc,QAAQ,CAAC;AAKpF,IAAM,kBAAkB,CAAC,WAA4C;AAC1E,QAAM,QAAQ,OAAO;AACrB,QAAM,QAAQ,QAAQ,IAAI,OAAO,CAAC,IAAI;AACtC,QAAM,OAAO,QAAQ,IAAI,OAAO,QAAQ,CAAC,IAAI;AAC7C,MAAI,QAAQ;AACZ,MAAI,SAAS,GAAG;AACd,UAAM,SAAS,QAAQ,KAAK;AAC5B,UAAM,QAAQ,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI;AAC9D,QAAI,YAAY;AAChB,QAAI,cAAc;AAClB,aAAS,QAAQ,GAAG,QAAQ,OAAO,SAAS;AAC1C,oBAAc,QAAQ,UAAU,OAAO,KAAK,IAAK;AACjD,sBAAgB,QAAQ,UAAU;AAAA,IACpC;AACA,YAAQ,cAAc,IAAI,YAAY,cAAc;AAAA,EACtD;AACA,SAAO;AAAA,IACL;AAAA,IACA,GAAI,UAAU,SAAY,EAAE,OAAO,YAAY,KAAK,EAAE,IAAI,CAAC;AAAA,IAC3D,GAAI,SAAS,SAAY,EAAE,MAAM,YAAY,IAAI,EAAE,IAAI,CAAC;AAAA,IACxD,cAAc,YAAY,KAAK;AAAA,EACjC;AACF;;;ACtLA,SAAS,aAAa;AAaf,IAAM,4BAA4B,CACvC,WAC8B;AAC9B,QAAM,UAAU,EAAE,iBAAiB,GAAG,cAAc,GAAG,WAAW,GAAG,oBAAoB,EAAE;AAC3F,aAAW,SAAS,OAAQ,YAAW,aAAa,MAAM,YAAY;AACpE,QAAI,CAAC,UAAU,iBAAiB,CAAC,oBAAoB,UAAU,aAAa,EAAG;AAC/E,YAAQ;AACR,YAAQ,gBAAgB,UAAU,cAAc,MAAM;AACtD,QAAI,UAAU,YAAY,YAAa,SAAQ;AAAA,QAC1C,SAAQ;AAAA,EACf;AACA,SAAO;AACT;AAEO,IAAM,sBAAsB;AAC5B,IAAM,wBAAwB;AAC9B,IAAM,wBAAwB;AACrC,IAAM,aAAa,CAAC,YAAY,aAAa,kBAAkB,eAAe;AAqB9E,IAAM,WAAW,CAAC,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AACrE,IAAM,UAAU,CAAC,QAAyB,IAAI,UAAU,OACtD,CAAC,CAAC,aAAa,aAAa,aAAa,EAAE,SAAS,GAAG;AACzD,IAAM,OAAO,CAAC,UACZ,4BAA4B,KAAK,KAAK,IAAI,MAAM,YAAY,EAAE,QAAQ,UAAU,EAAE,IAAI;AACxF,IAAM,UAAU,CAAC,QAAiB,SAA2B;AAC3D,MAAI;AAAE,WAAO,SAAS,MAAM,KAAK,MAAM,MAAM,QAAQ,IAAI;AAAA,EAAG,QAAQ;AAAE,WAAO;AAAA,EAAO;AACtF;AACA,IAAM,cAAc,CAAC,WAAmD;AACtE,QAAM,SAAS,oBAAI,IAAsB;AACzC,aAAW,SAAS,QAAQ;AAC1B,UAAM,MAAM,KAAK,KAAK;AACtB,QAAI,CAAC,IAAK;AACV,UAAM,QAAQ,OAAO,IAAI,GAAG,KAAK,CAAC;AAClC,UAAM,KAAK,KAAK;AAChB,WAAO,IAAI,KAAK,KAAK;AAAA,EACvB;AACA,SAAO,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,KAAK,MAAM,MAAM,WAAW,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,MAAM,CAAC,CAAE,CAAC,CAAC;AAC9G;AAMO,IAAM,uBAAuB,CAAC,KAAa,WAAgD;AAChG,MAAI,CAAC,OAAO,IAAI,SAAS,QAAS,CAAC,SAAS,MAAM,KAAK,OAAO,SAAS,YACnE,OAAO,yBAAyB,SAAS,CAAC,SAAS,OAAO,UAAU,KACpE,CAAC,qBAAqB,SAAS,SAAS,SAAS,QAAQ,MAAM,KAAK,EAAE,KAAK,CAAC,QAAQ,OAAO,OAAO,QAAQ,GAAG,CAAC,EAAG,QAAO;AAC5H,QAAM,OAAO,OAAO,KAAK,OAAO,UAAU,EAAE,KAAK;AACjD,MAAI,KAAK,SAAS,yBAAyB,CAAC,KAAK,MAAM,OAAO,EAAG,QAAO;AACxE,QAAM,WAAW,IAAI,IAAI,MAAM,QAAQ,OAAO,QAAQ,IAAI,OAAO,WAAW,CAAC,CAAC;AAC9E,QAAM,QAAQ,IAAI,IAAI,YAAY,IAAI,EAAE,OAAO,CAAC;AAChD,QAAM,QAA0B,CAAC;AACjC,aAAW,OAAO,MAAM;AACtB,UAAM,WAAW,OAAO,WAAW,GAAG;AACtC,QAAI,CAAC,SAAS,QAAQ,EAAG;AACzB,QAAI,MAAM,IAAI,GAAG,EAAG,OAAM,KAAK,EAAE,MAAM,YAAY,IAAI,CAAC;AACxD,QAAI,CAAC,SAAS,IAAI,GAAG,KAAK,CAAC,QAAQ,UAAU,IAAI,EAAG,OAAM,KAAK,EAAE,MAAM,iBAAiB,IAAI,CAAC;AAC7F,QAAI,SAAS,SAAS,YAAY,SAAS,SAAS,UAAW,OAAM,KAAK,EAAE,MAAM,kBAAkB,IAAI,CAAC;AACzG,QAAI,SAAS,SAAS,YAAY,MAAM,QAAQ,SAAS,IAAI,KACzD,SAAS,KAAK,MAAM,CAAC,UAAU,OAAO,UAAU,QAAQ,KACxD,YAAY,SAAS,IAAI,EAAE,OAAO,EAAG,OAAM,KAAK,EAAE,MAAM,aAAa,IAAI,CAAC;AAAA,EAChF;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,SAAO,EAAE,SAAS,qBAAqB,KAAK,kBAAkB,eAAe,MAAM,GAAG,OAAO,MAAM,MAAM,GAAG,qBAAqB,EAAE;AACrI;AAEA,IAAM,SAAS,CAAC,UAA4C,SAAS,KAAK,KACxE,OAAO,KAAK,KAAK,EAAE,WAAW,KAAK,OAAO,MAAM,QAAQ,YAAY,QAAQ,MAAM,GAAG,KACrF,WAAW,SAAS,MAAM,IAA0B;AACtD,IAAM,WAAW,CAAC,UAAoC,OAAO,UAAU,YAAY,iBAAiB,KAAK,KAAK;AACvG,IAAM,mBAAmB,CAAC,UAA4C,SAAS,KAAK,KACzF,OAAO,KAAK,KAAK,EAAE,WAAW,KAAK,MAAM,YAAY,uBACrD,OAAO,MAAM,QAAQ,YAAY,MAAM,IAAI,SAAS,KAAK,MAAM,IAAI,UAAU,QAC7E,SAAS,MAAM,gBAAgB,KAAK,MAAM,QAAQ,MAAM,KAAK,KAC7D,MAAM,MAAM,SAAS,KAAK,MAAM,MAAM,UAAU,yBAAyB,MAAM,MAAM,MAAM,MAAM;AAC5F,IAAM,sBAAsB,CAAC,UAA+C,SAAS,KAAK,KAC/F,OAAO,KAAK,KAAK,EAAE,WAAW,KAAK,MAAM,YAAY,uBACrD,SAAS,MAAM,gBAAgB,KAAK,SAAS,MAAM,WAAW,KAAK,SAAS,MAAM,UAAU,KAC5F,MAAM,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,SAAS,KAAK,MAAM,MAAM,UAAU,yBAAyB,MAAM,MAAM,MAAM,MAAM;AAE1H,IAAM,uBAAuB,CAAC,MAAsB,WAA6B;AACtF,MAAI,CAAC,iBAAiB,IAAI,EAAG,QAAO;AACpC,MAAI;AACF,UAAM,UAAU,qBAAqB,KAAK,KAAK,MAAM;AACrD,WAAO,YAAY,UAAa,eAAe,OAAO,MAAM,eAAe,IAAI;AAAA,EACjF,QAAQ;AAAE,WAAO;AAAA,EAAO;AAC1B;AAEO,IAAM,sBAAsB,CACjC,KACA,QACA,MACA,SACqB;AACrB,QAAM,YAAY,EAAE,KAAK;AAIzB,MAAI,CAAC,QAAQ,KAAK,QAAQ,OAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,qBAAqB,MAAM,MAAM,EAAG,QAAO;AACtG,QAAM,aAAc,OAAmE;AACvF,QAAM,YAAY,EAAE,GAAG,KAAK;AAC5B,QAAM,UAA4B,CAAC;AACnC,QAAM,WAAW,KAAK,MAAM,OAAO,CAAC,SAAS,KAAK,SAAS,UAAU;AACrE,QAAM,QAAQ,YAAY,SAAS,IAAI,CAAC,SAAS,KAAK,GAAG,CAAC;AAC1D,QAAM,UAAU,oBAAI,IAAY;AAChC,aAAW,OAAO,OAAO,KAAK,IAAI,EAAE,KAAK,GAAG;AAC1C,QAAI,OAAO,OAAO,YAAY,GAAG,EAAG;AACpC,UAAM,aAAa,KAAK,GAAG;AAC3B,UAAM,SAAS,aAAa,MAAM,IAAI,UAAU,IAAI;AACpD,QAAI,CAAC,OAAQ;AAEb,QAAI,OAAO,OAAO,MAAM,MAAM,KAAK,QAAQ,IAAI,MAAM,EAAG,QAAO;AAC/D,YAAQ,IAAI,MAAM;AAClB,WAAO,eAAe,WAAW,QAAQ,EAAE,OAAO,KAAK,GAAG,GAAG,YAAY,MAAM,cAAc,MAAM,UAAU,KAAK,CAAC;AACnH,WAAO,UAAU,GAAG;AACpB,YAAQ,KAAK,EAAE,MAAM,YAAY,KAAK,OAAO,CAAC;AAAA,EAChD;AACA,aAAW,QAAQ,KAAK,OAAO;AAC7B,QAAI,KAAK,SAAS,cAAc,CAAC,OAAO,OAAO,WAAW,KAAK,GAAG,EAAG;AACrE,UAAM,QAAQ,UAAU,KAAK,GAAG;AAChC,UAAM,WAAW,WAAW,KAAK,GAAG;AACpC,QAAI,QAAQ,UAAU,KAAK,EAAG;AAC9B,QAAI,KAAK,SAAS,oBAAoB,UAAU,QAAQ,UAAU,SAAY;AAC5E,aAAO,UAAU,KAAK,GAAG;AACzB,cAAQ,KAAK,IAAI;AAAA,IACnB,WAAW,KAAK,SAAS,oBAAoB,OAAO,UAAU,UAAU;AACtE,YAAM,SAAS,OAAO,KAAK;AAC3B,UAAI,OAAO,SAAS,MAAM,KAAK,OAAO,MAAM,MAAM,SAAS,QAAQ,UAAU,MAAM,GAAG;AACpF,kBAAU,KAAK,GAAG,IAAI;AACtB,gBAAQ,KAAK,IAAI;AAAA,MACnB;AAAA,IACF,WAAW,KAAK,SAAS,eAAe,OAAO,UAAU,UAAU;AACjE,YAAM,aAAa,KAAK,KAAK;AAC7B,YAAM,SAAS,aAAa,YAAY,SAAS,IAAgB,EAAE,IAAI,UAAU,IAAI;AACrF,UAAI,WAAW,UAAa,QAAQ,UAAU,MAAM,GAAG;AACrD,kBAAU,KAAK,GAAG,IAAI;AACtB,gBAAQ,KAAK,IAAI;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAGA,MAAI,QAAQ,WAAW,KAAK,CAAC,QAAQ,QAAQ,SAAS,EAAG,QAAO;AAChE,SAAO;AAAA,IACL,MAAM;AAAA,IACN,SAAS;AAAA,MACP,SAAS;AAAA,MACT,kBAAkB,KAAK;AAAA,MACvB,aAAa,eAAe,eAAe,IAAI,CAAC;AAAA,MAChD,YAAY,eAAe,eAAe,SAAS,CAAC;AAAA,MACpD,OAAO;AAAA,IACT;AAAA,EACF;AACF;",
6
- "names": []
7
- }