@e4779/pi-fabric 0.131.4-fork.33 → 0.138.1-fork.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +8 -0
- package/dist/actors/context.d.ts.map +1 -1
- package/dist/agents/clone-first-worktree.d.ts +2 -0
- package/dist/agents/clone-first-worktree.d.ts.map +1 -1
- package/dist/agents/completion-inbox.d.ts +2 -1
- package/dist/agents/completion-inbox.d.ts.map +1 -1
- package/dist/agents/handoff.d.ts.map +1 -1
- package/dist/agents/manager.d.ts.map +1 -1
- package/dist/agents/worktree-manager.d.ts +4 -1
- package/dist/agents/worktree-manager.d.ts.map +1 -1
- package/dist/agents/worktree-paths.d.ts +8 -3
- package/dist/agents/worktree-paths.d.ts.map +1 -1
- package/dist/agents.js +6 -1
- package/dist/agents.js.map +1 -1
- package/dist/async-settlement.d.ts +1 -1
- package/dist/async-settlement.d.ts.map +1 -1
- package/dist/audit/details.d.ts.map +1 -1
- package/dist/capture/catalog.d.ts +2 -0
- package/dist/capture/catalog.d.ts.map +1 -1
- package/dist/capture/interceptor.d.ts.map +1 -1
- package/dist/chunks/{chunk-7N7IC3Z2.js → chunk-2CD7HLVP.js} +3 -84
- package/dist/chunks/chunk-2CD7HLVP.js.map +7 -0
- package/dist/chunks/{chunk-7YNE4NB2.js → chunk-2MELFQCQ.js} +2 -2
- package/dist/chunks/{chunk-HSEZPCL5.js → chunk-2OC4YJOL.js} +3 -3
- package/dist/chunks/{chunk-TXCNZCZP.js → chunk-2QJ4MNS6.js} +2 -2
- package/dist/chunks/{chunk-F6A6MQ6G.js → chunk-2WPTD6BI.js} +11 -15
- package/dist/chunks/chunk-2WPTD6BI.js.map +7 -0
- package/dist/chunks/{chunk-QOEOKW2X.js → chunk-3QH6JAE3.js} +2 -2
- package/dist/chunks/chunk-4U47NCP2.js +88 -0
- package/dist/chunks/chunk-4U47NCP2.js.map +7 -0
- package/dist/chunks/{chunk-OJ4HAALD.js → chunk-5VZEAAHD.js} +10 -9
- package/dist/chunks/chunk-5VZEAAHD.js.map +7 -0
- package/dist/chunks/{chunk-LKYLD5SN.js → chunk-6HM4TX7L.js} +10 -8
- package/dist/chunks/chunk-6HM4TX7L.js.map +7 -0
- package/dist/chunks/{chunk-L6H46CPY.js → chunk-6NNL5LOG.js} +2 -2
- package/dist/chunks/{chunk-7TB7NXSL.js → chunk-7CIQQOOD.js} +11 -3
- package/dist/chunks/{chunk-7TB7NXSL.js.map → chunk-7CIQQOOD.js.map} +2 -2
- package/dist/chunks/{chunk-RWKQ5SRW.js → chunk-7ZFPVOV2.js} +2 -2
- package/dist/chunks/{chunk-PUBHBEYO.js → chunk-B2FIGOPI.js} +2 -2
- package/dist/chunks/{chunk-HRDMBGMY.js → chunk-BLT66VHH.js} +331 -22
- package/dist/chunks/chunk-BLT66VHH.js.map +7 -0
- package/dist/chunks/{chunk-4WKD3YM3.js → chunk-C3UPHOJW.js} +3 -3
- package/dist/chunks/{chunk-G2DZJ5LK.js → chunk-CB72SLHB.js} +451 -134
- package/dist/chunks/chunk-CB72SLHB.js.map +7 -0
- package/dist/chunks/{chunk-B5L3X3ID.js → chunk-CCJ6PUZJ.js} +1 -1
- package/dist/chunks/{chunk-B5L3X3ID.js.map → chunk-CCJ6PUZJ.js.map} +1 -1
- package/dist/chunks/{chunk-FK73YJKV.js → chunk-DWM63MAJ.js} +21 -9
- package/dist/chunks/chunk-DWM63MAJ.js.map +7 -0
- package/dist/chunks/{chunk-56NMRVTV.js → chunk-FFJ7TV66.js} +32 -29
- package/dist/chunks/chunk-FFJ7TV66.js.map +7 -0
- package/dist/chunks/{chunk-LRSZFYUC.js → chunk-FUMALXYQ.js} +15 -15
- package/dist/chunks/chunk-FUMALXYQ.js.map +7 -0
- package/dist/chunks/{chunk-TJZYM2SP.js → chunk-G3RQ3HUK.js} +8 -3
- package/dist/chunks/{chunk-TJZYM2SP.js.map → chunk-G3RQ3HUK.js.map} +2 -2
- package/dist/chunks/{chunk-RAA3FAYZ.js → chunk-GNPTDN6K.js} +2 -2
- package/dist/chunks/{chunk-XFOSUGLU.js → chunk-JCGEW5OQ.js} +5 -5
- package/dist/chunks/{chunk-CXYJJ3HZ.js → chunk-LJ2MG6U2.js} +3 -3
- package/dist/chunks/{chunk-3MOY6WIB.js → chunk-LRBDEAKB.js} +3 -3
- package/dist/chunks/{chunk-2RWNVCFD.js → chunk-MPFBOVOD.js} +1 -1
- package/dist/chunks/{chunk-2RWNVCFD.js.map → chunk-MPFBOVOD.js.map} +1 -1
- package/dist/chunks/{chunk-NQ7IWEIF.js → chunk-MQGRQMVM.js} +2 -2
- package/dist/chunks/{chunk-3VK6UGAN.js → chunk-O5SHIUIL.js} +6 -1
- package/dist/chunks/chunk-O5SHIUIL.js.map +7 -0
- package/dist/chunks/{chunk-U6Y6TKJL.js → chunk-OK2EKY3M.js} +15 -11
- package/dist/chunks/chunk-OK2EKY3M.js.map +7 -0
- package/dist/chunks/{chunk-DGUXJSYA.js → chunk-OR44GYXD.js} +70 -3
- package/dist/chunks/chunk-OR44GYXD.js.map +7 -0
- package/dist/chunks/{chunk-DGERP4VL.js → chunk-P4TALNLX.js} +11 -10
- package/dist/chunks/chunk-P4TALNLX.js.map +7 -0
- package/dist/chunks/{chunk-4BYS4ZLY.js → chunk-PHGPOSCP.js} +267 -71
- package/dist/chunks/chunk-PHGPOSCP.js.map +7 -0
- package/dist/chunks/{chunk-3XT5WHSG.js → chunk-QAGEWWCJ.js} +260 -59
- package/dist/chunks/chunk-QAGEWWCJ.js.map +7 -0
- package/dist/chunks/{chunk-WKFRGICG.js → chunk-RBYRHS24.js} +2 -2
- package/dist/chunks/{chunk-ZHROHNEE.js → chunk-RFNYH7S7.js} +8 -8
- package/dist/chunks/{chunk-VGRUWTMG.js → chunk-RPZJVLML.js} +472 -466
- package/dist/chunks/chunk-RPZJVLML.js.map +7 -0
- package/dist/chunks/{chunk-H57KPL3V.js → chunk-S2JWFXW5.js} +2 -2
- package/dist/chunks/{chunk-LZ2ZXOCU.js → chunk-SSB2JN3I.js} +168 -5
- package/dist/chunks/chunk-SSB2JN3I.js.map +7 -0
- package/dist/chunks/{chunk-RKJPBTBB.js → chunk-SVQ7ZHEQ.js} +33 -16
- package/dist/chunks/chunk-SVQ7ZHEQ.js.map +7 -0
- package/dist/chunks/{chunk-MPMEK3IQ.js → chunk-TV5NCPPS.js} +6 -5
- package/dist/chunks/chunk-TV5NCPPS.js.map +7 -0
- package/dist/chunks/{chunk-XOBLUZMB.js → chunk-UIVMSMSQ.js} +10 -1
- package/dist/chunks/chunk-UIVMSMSQ.js.map +7 -0
- package/dist/chunks/{chunk-QGTD3LAZ.js → chunk-UYS5VZUU.js} +9 -3
- package/dist/chunks/chunk-UYS5VZUU.js.map +7 -0
- package/dist/chunks/{chunk-HRVYXRWZ.js → chunk-V5RZK45W.js} +37 -3
- package/dist/chunks/chunk-V5RZK45W.js.map +7 -0
- package/dist/chunks/{chunk-KIFOEBYJ.js → chunk-VEXCD3RA.js} +2 -2
- package/dist/chunks/{chunk-GS67KDMV.js → chunk-VN7AE3EY.js} +2 -2
- package/dist/chunks/{chunk-HFDJWLMS.js → chunk-WFGJUVTH.js} +106 -65
- package/dist/chunks/chunk-WFGJUVTH.js.map +7 -0
- package/dist/chunks/chunk-WMULZZER.js +196 -0
- package/dist/chunks/chunk-WMULZZER.js.map +7 -0
- package/dist/chunks/{chunk-QNMQJNXE.js → chunk-X4HDI7RT.js} +14 -4
- package/dist/chunks/chunk-X4HDI7RT.js.map +7 -0
- package/dist/chunks/{chunk-MX53BRAC.js → chunk-XBAOTA4U.js} +2 -2
- package/dist/chunks/{chunk-MSDL7U6Q.js → chunk-XQCNVH3Y.js} +4 -4
- package/dist/chunks/{chunk-4PBW54I2.js → chunk-YC6NV7FK.js} +88 -54
- package/dist/chunks/chunk-YC6NV7FK.js.map +7 -0
- package/dist/chunks/{chunk-6GWDGTHC.js → chunk-YLO62DWD.js} +4 -4
- package/dist/cli/decisions.js +2 -2
- package/dist/cli/mesh.js +3 -3
- package/dist/commands/fabric-handler.d.ts.map +1 -1
- package/dist/commands/fabric-handler.js +18 -4
- package/dist/commands/fabric-handler.js.map +2 -2
- package/dist/commands/fabric.d.ts.map +1 -1
- package/dist/compaction/branch-summary.d.ts.map +1 -1
- package/dist/compaction/claim-events.js +9 -9
- package/dist/compaction/hook.d.ts.map +1 -1
- package/dist/compaction/hook.js +6 -6
- package/dist/compaction/normalize.d.ts +9 -0
- package/dist/compaction/normalize.d.ts.map +1 -1
- package/dist/compaction/owner.js +7 -7
- package/dist/compaction/projections.d.ts +18 -2
- package/dist/compaction/projections.d.ts.map +1 -1
- package/dist/compaction/qa.d.ts +3 -2
- package/dist/compaction/qa.d.ts.map +1 -1
- package/dist/compaction/render.d.ts +3 -0
- package/dist/compaction/render.d.ts.map +1 -1
- package/dist/compaction/threshold.d.ts.map +1 -1
- package/dist/compaction/user-activity.d.ts +31 -0
- package/dist/compaction/user-activity.d.ts.map +1 -0
- package/dist/components/configuration.js +4 -4
- package/dist/config.d.ts +13 -6
- package/dist/config.d.ts.map +1 -1
- package/dist/core/action-registry.d.ts +1 -1
- package/dist/core/action-registry.d.ts.map +1 -1
- package/dist/core/action-registry.js +10 -9
- package/dist/core/approval-controller.d.ts +3 -0
- package/dist/core/approval-controller.d.ts.map +1 -1
- package/dist/core/atomic-write.d.ts +1 -0
- package/dist/core/atomic-write.d.ts.map +1 -1
- package/dist/core/attached-monitors.d.ts +39 -0
- package/dist/core/attached-monitors.d.ts.map +1 -0
- package/dist/core/control-abort.d.ts +3 -0
- package/dist/core/control-abort.d.ts.map +1 -0
- package/dist/core/crash-guard.d.ts +15 -0
- package/dist/core/crash-guard.d.ts.map +1 -0
- package/dist/core/execution-guidelines.d.ts +6 -0
- package/dist/core/execution-guidelines.d.ts.map +1 -0
- package/dist/core/guidance-delivery.d.ts +19 -0
- package/dist/core/guidance-delivery.d.ts.map +1 -0
- package/dist/core/lifecycle-settlement.d.ts +9 -0
- package/dist/core/lifecycle-settlement.d.ts.map +1 -0
- package/dist/core/observation-actions.d.ts +9 -0
- package/dist/core/observation-actions.d.ts.map +1 -0
- package/dist/core/pasted-images.d.ts +12 -0
- package/dist/core/pasted-images.d.ts.map +1 -0
- package/dist/core/pasted-images.js +139 -0
- package/dist/core/pasted-images.js.map +7 -0
- package/dist/core/permission-queue.d.ts +32 -0
- package/dist/core/permission-queue.d.ts.map +1 -0
- package/dist/core/permission-queue.js +104 -0
- package/dist/core/permission-queue.js.map +7 -0
- package/dist/core/prompt-guidance.d.ts +1 -0
- package/dist/core/prompt-guidance.d.ts.map +1 -1
- package/dist/core/prompt-guidance.js +52 -3
- package/dist/core/prompt-guidance.js.map +3 -3
- package/dist/core/provider-operations.js +1 -1
- package/dist/core/shell-inbox.d.ts +1 -1
- package/dist/core/shell-inbox.d.ts.map +1 -1
- package/dist/core/shell-jobs.d.ts +28 -1
- package/dist/core/shell-jobs.d.ts.map +1 -1
- package/dist/core/shell-monitor.d.ts +1 -0
- package/dist/core/shell-monitor.d.ts.map +1 -1
- package/dist/durable/worker.js +0 -42
- package/dist/durable/worker.js.map +3 -3
- package/dist/durable-extension.d.ts +2 -2
- package/dist/durable-extension.d.ts.map +1 -1
- package/dist/durable-extension.js +215 -1
- package/dist/durable-extension.js.map +3 -3
- package/dist/entropy/index.d.ts +2 -0
- package/dist/entropy/index.d.ts.map +1 -1
- package/dist/entropy/index.js +23 -13
- package/dist/entropy/pool-store.d.ts +8 -1
- package/dist/entropy/pool-store.d.ts.map +1 -1
- package/dist/entropy/pool-worker.d.ts +18 -0
- package/dist/entropy/pool-worker.d.ts.map +1 -0
- package/dist/entropy/pool-writer.d.ts +23 -0
- package/dist/entropy/pool-writer.d.ts.map +1 -0
- package/dist/entropy/pool.d.ts +11 -0
- package/dist/entropy/pool.d.ts.map +1 -1
- package/dist/entropy/sessions.d.ts +5 -0
- package/dist/entropy/sessions.d.ts.map +1 -1
- package/dist/execution-service.d.ts.map +1 -1
- package/dist/extension-bootstrap.d.ts.map +1 -1
- package/dist/extension-bootstrap.js +19 -19
- package/dist/extension.d.ts.map +1 -1
- package/dist/fabric-exec-tool.d.ts.map +1 -1
- package/dist/fabric-runtime-state.d.ts.map +1 -1
- package/dist/fabric-runtime-state.js +534 -261
- package/dist/fabric-runtime-state.js.map +4 -4
- package/dist/fabric-state.d.ts.map +1 -1
- package/dist/index.js +40 -30
- package/dist/index.js.map +1 -1
- package/dist/jev/client.js +2 -2
- package/dist/jev/observation.js +7 -6
- package/dist/jev.js +12 -11
- package/dist/main-agent.d.ts.map +1 -1
- package/dist/managed-host.d.ts +4 -0
- package/dist/managed-host.d.ts.map +1 -1
- package/dist/memory/discovery.js +6 -6
- package/dist/memory/expand-service.d.ts.map +1 -1
- package/dist/memory/file-worker.js +9 -8
- package/dist/memory/file-worker.js.map +1 -1
- package/dist/memory/history-paging.d.ts +9 -0
- package/dist/memory/history-paging.d.ts.map +1 -0
- package/dist/memory/history-paging.js +164 -0
- package/dist/memory/history-paging.js.map +7 -0
- package/dist/memory/index.d.ts.map +1 -1
- package/dist/memory/normalize.js +5 -5
- package/dist/memory/outline-service.d.ts +7 -0
- package/dist/memory/outline-service.d.ts.map +1 -0
- package/dist/memory/request-cache.d.ts +3 -1
- package/dist/memory/request-cache.d.ts.map +1 -1
- package/dist/memory/request-context.d.ts +1 -0
- package/dist/memory/request-context.d.ts.map +1 -1
- package/dist/memory/request-limits.d.ts +2 -0
- package/dist/memory/request-limits.d.ts.map +1 -1
- package/dist/memory/search.js +7 -6
- package/dist/memory/worker-provider.d.ts.map +1 -1
- package/dist/memory/worker-provider.js +10 -9
- package/dist/memory.d.ts +16 -1
- package/dist/memory.d.ts.map +1 -1
- package/dist/memory.js +64 -12
- package/dist/memory.js.map +1 -1
- package/dist/mesh/store.d.ts +2 -1
- package/dist/mesh/store.d.ts.map +1 -1
- package/dist/programs/host.js +2 -2
- package/dist/protocol.d.ts +5 -0
- package/dist/protocol.d.ts.map +1 -1
- package/dist/protocol.js +1 -1
- package/dist/providers/agents-actions.d.ts.map +1 -1
- package/dist/providers/agents-message-router.d.ts +1 -0
- package/dist/providers/agents-message-router.d.ts.map +1 -1
- package/dist/providers/agents-provider.d.ts +2 -0
- package/dist/providers/agents-provider.d.ts.map +1 -1
- package/dist/providers/jev-provider.js +12 -11
- package/dist/providers/memory-provider.d.ts +4 -0
- package/dist/providers/memory-provider.d.ts.map +1 -1
- package/dist/providers/memory-provider.js +9 -8
- package/dist/providers/pi-read-operations.d.ts +24 -0
- package/dist/providers/pi-read-operations.d.ts.map +1 -0
- package/dist/providers/pi-tools-provider.d.ts +7 -0
- package/dist/providers/pi-tools-provider.d.ts.map +1 -1
- package/dist/providers/sessions-provider.d.ts +1 -1
- package/dist/providers/sessions-provider.d.ts.map +1 -1
- package/dist/providers/tasks-provider.d.ts +3 -1
- package/dist/providers/tasks-provider.d.ts.map +1 -1
- package/dist/residency/actor-client.js +3 -3
- package/dist/residency/client.d.ts.map +1 -1
- package/dist/residency/host.d.ts.map +1 -1
- package/dist/residency/host.js +17 -16
- package/dist/residency/launcher.js +1 -1
- package/dist/residency/pi-entry.js +17 -16
- package/dist/residency/pi-entry.js.map +1 -1
- package/dist/residency/protocol.d.ts +2 -0
- package/dist/residency/protocol.d.ts.map +1 -1
- package/dist/runtime/core-override-guest-types.js +2 -2
- package/dist/runtime/cpython-runtime.d.ts.map +1 -1
- package/dist/runtime/cpython-runtime.js +7 -6
- package/dist/runtime/cpython-runtime.js.map +2 -2
- package/dist/runtime/guest-types.d.ts +1 -1
- package/dist/runtime/guest-types.d.ts.map +1 -1
- package/dist/runtime/guest-types.js +1 -1
- package/dist/runtime/monty-runtime.d.ts.map +1 -1
- package/dist/runtime/monty-runtime.js +7 -6
- package/dist/runtime/monty-runtime.js.map +2 -2
- package/dist/runtime/node-process-runtime.d.ts.map +1 -1
- package/dist/runtime/node-process-runtime.js +6 -6
- package/dist/runtime/quickjs-runtime.d.ts.map +1 -1
- package/dist/runtime/quickjs-runtime.js +4 -4
- package/dist/runtime/type-checker.d.ts.map +1 -1
- package/dist/runtime/type-checker.js +1 -1
- package/dist/runtime/typescript-kernel.js +10 -10
- package/dist/runtime-state-builtins.d.ts +2 -0
- package/dist/runtime-state-builtins.d.ts.map +1 -1
- package/dist/schema/policy.d.ts.map +1 -1
- package/dist/speculation/eligibility.d.ts.map +1 -1
- package/dist/speculation/store.d.ts.map +1 -1
- package/dist/topology/participant-directory.d.ts +1 -0
- package/dist/topology/participant-directory.d.ts.map +1 -1
- package/dist/topology/peer-presence.d.ts.map +1 -1
- package/dist/topology/provider-participants.d.ts +1 -0
- package/dist/topology/provider-participants.d.ts.map +1 -1
- package/dist/type-error-guidance.js +1 -1
- package/dist/ui/code-preview-shell.d.ts +1 -0
- package/dist/ui/code-preview-shell.d.ts.map +1 -1
- package/dist/ui/controller.d.ts.map +1 -1
- package/dist/ui/conversation-chrome.d.ts.map +1 -1
- package/dist/ui/conversation-chrome.js +2 -2
- package/dist/ui/conversation-feedback.d.ts +8 -0
- package/dist/ui/conversation-feedback.d.ts.map +1 -0
- package/dist/ui/conversation-latest.d.ts.map +1 -1
- package/dist/ui/conversation-native-reader.d.ts.map +1 -1
- package/dist/ui/conversation-native-reader.js +3 -3
- package/dist/ui/conversation-native-reader.js.map +2 -2
- package/dist/ui/conversation-render.d.ts.map +1 -1
- package/dist/ui/conversation.d.ts +1 -0
- package/dist/ui/conversation.d.ts.map +1 -1
- package/dist/ui/conversation.js +139 -86
- package/dist/ui/conversation.js.map +4 -4
- package/dist/ui/core-tool-render.d.ts.map +1 -1
- package/dist/ui/dashboard-fabric-graph.d.ts.map +1 -1
- package/dist/ui/dashboard.js +47 -48
- package/dist/ui/dashboard.js.map +3 -3
- package/dist/ui/fabric-render.d.ts.map +1 -1
- package/dist/ui/format.d.ts.map +1 -1
- package/dist/ui/highlight.d.ts.map +1 -1
- package/dist/ui/permissions.d.ts +18 -0
- package/dist/ui/permissions.d.ts.map +1 -0
- package/dist/ui/permissions.js +178 -0
- package/dist/ui/permissions.js.map +7 -0
- package/dist/ui/row-balance.d.ts +1 -1
- package/dist/ui/row-balance.d.ts.map +1 -1
- package/dist/ui/settings-sections-execution.d.ts.map +1 -1
- package/dist/ui/settings-values.d.ts.map +1 -1
- package/dist/ui/settings.js +37 -31
- package/dist/ui/settings.js.map +2 -2
- package/dist/ui/shell-hang-keys.d.ts.map +1 -1
- package/dist/ui/shell-tasks.d.ts.map +1 -1
- package/dist/ui/shell-tasks.js +28 -11
- package/dist/ui/shell-tasks.js.map +2 -2
- package/dist/ui/structured.d.ts.map +1 -1
- package/dist/ui/tool-display.d.ts +18 -2
- package/dist/ui/tool-display.d.ts.map +1 -1
- package/dist/ui/truncate.d.ts +3 -0
- package/dist/ui/truncate.d.ts.map +1 -0
- package/dist/ui/widget.d.ts +7 -2
- package/dist/ui/widget.d.ts.map +1 -1
- package/dist/verified/context.d.ts +35 -0
- package/dist/verified/context.d.ts.map +1 -0
- package/dist/verified/execution.d.ts +7 -0
- package/dist/verified/execution.d.ts.map +1 -0
- package/dist/verified/generated/context.d.ts +6 -0
- package/dist/verified/generated/context.js +51 -0
- package/dist/verified/generated/execution.d.ts +5 -0
- package/dist/verified/generated/execution.js +32 -0
- package/dist/verified/generated/manifest.json +34 -3
- package/dist/verified/generated/prompt-guidance.d.ts +4 -0
- package/dist/verified/generated/prompt-guidance.js +17 -0
- package/dist/worker/recovery-watchdog.d.ts +7 -0
- package/dist/worker/recovery-watchdog.d.ts.map +1 -1
- package/dist/worker/recovery-watchdog.js +66 -4
- package/dist/worker/recovery-watchdog.js.map +2 -2
- package/dist/worker.js +22 -3
- package/dist/worker.js.map +2 -2
- package/docs/agents.md +37 -4
- package/docs/architecture.md +13 -0
- package/docs/background-tasks.md +81 -5
- package/docs/benchmarks/cli-resume-2026-11-09.json +1260 -0
- package/docs/benchmarks/interactivity-2026-11-09.json +2280 -0
- package/docs/benchmarks/resume-latency-2026-11-09.json +12105 -0
- package/docs/benchmarks/resume-startup-fix-2026-11-09.json +5452 -0
- package/docs/benchmarks/session-memory-2026-11-09.json +1320 -0
- package/docs/benchmarks/session-memory-fix-2026-11-09.json +280 -0
- package/docs/compaction.md +59 -23
- package/docs/configuration.md +53 -11
- package/docs/entropy.md +4 -1
- package/docs/history-paging.md +99 -0
- package/docs/interactivity-investigation.md +109 -0
- package/docs/interface.md +2 -2
- package/docs/jev.md +1 -1
- package/docs/memory-recall.md +42 -1
- package/docs/providers.md +24 -1
- package/docs/resume-latency-investigation.md +249 -0
- package/docs/session-memory-investigation.md +223 -0
- package/docs/verified-kernels.md +56 -0
- package/package.json +211 -211
- package/proofs/context.ts +139 -0
- package/proofs/execution.ts +48 -0
- package/proofs/index.ts +6 -0
- package/proofs/prompt-guidance.ts +38 -0
- package/scripts/verified-kernels.ts +1 -1
- package/skillsets/python/fabric-council/SKILL.md +31 -21
- package/skillsets/python/fabric-exec/SKILL.md +1 -1
- package/skillsets/python/fabric-exec/references/agents.md +2 -0
- package/skillsets/python/fabric-guide/SKILL.md +1 -0
- package/skillsets/python/fabric-memory/SKILL.md +82 -0
- package/skillsets/typescript/fabric-council/SKILL.md +26 -17
- package/skillsets/typescript/fabric-exec/SKILL.md +3 -2
- package/skillsets/typescript/fabric-exec/references/agents.md +1 -0
- package/skillsets/typescript/fabric-guide/SKILL.md +1 -0
- package/skillsets/typescript/fabric-memory/SKILL.md +87 -0
- package/dist/chunks/chunk-3VK6UGAN.js.map +0 -7
- package/dist/chunks/chunk-3XT5WHSG.js.map +0 -7
- package/dist/chunks/chunk-4BYS4ZLY.js.map +0 -7
- package/dist/chunks/chunk-4PBW54I2.js.map +0 -7
- package/dist/chunks/chunk-56NMRVTV.js.map +0 -7
- package/dist/chunks/chunk-7N7IC3Z2.js.map +0 -7
- package/dist/chunks/chunk-DGERP4VL.js.map +0 -7
- package/dist/chunks/chunk-DGUXJSYA.js.map +0 -7
- package/dist/chunks/chunk-F6A6MQ6G.js.map +0 -7
- package/dist/chunks/chunk-FK73YJKV.js.map +0 -7
- package/dist/chunks/chunk-G2DZJ5LK.js.map +0 -7
- package/dist/chunks/chunk-HFDJWLMS.js.map +0 -7
- package/dist/chunks/chunk-HRDMBGMY.js.map +0 -7
- package/dist/chunks/chunk-HRVYXRWZ.js.map +0 -7
- package/dist/chunks/chunk-LKYLD5SN.js.map +0 -7
- package/dist/chunks/chunk-LRSZFYUC.js.map +0 -7
- package/dist/chunks/chunk-LZ2ZXOCU.js.map +0 -7
- package/dist/chunks/chunk-MPMEK3IQ.js.map +0 -7
- package/dist/chunks/chunk-OJ4HAALD.js.map +0 -7
- package/dist/chunks/chunk-QGTD3LAZ.js.map +0 -7
- package/dist/chunks/chunk-QNMQJNXE.js.map +0 -7
- package/dist/chunks/chunk-RKJPBTBB.js.map +0 -7
- package/dist/chunks/chunk-U6Y6TKJL.js.map +0 -7
- package/dist/chunks/chunk-VGRUWTMG.js.map +0 -7
- package/dist/chunks/chunk-XOBLUZMB.js.map +0 -7
- package/dist/durable/openai-sse-patch.d.ts +0 -21
- package/dist/durable/openai-sse-patch.d.ts.map +0 -1
- /package/dist/chunks/{chunk-7YNE4NB2.js.map → chunk-2MELFQCQ.js.map} +0 -0
- /package/dist/chunks/{chunk-HSEZPCL5.js.map → chunk-2OC4YJOL.js.map} +0 -0
- /package/dist/chunks/{chunk-TXCNZCZP.js.map → chunk-2QJ4MNS6.js.map} +0 -0
- /package/dist/chunks/{chunk-QOEOKW2X.js.map → chunk-3QH6JAE3.js.map} +0 -0
- /package/dist/chunks/{chunk-L6H46CPY.js.map → chunk-6NNL5LOG.js.map} +0 -0
- /package/dist/chunks/{chunk-RWKQ5SRW.js.map → chunk-7ZFPVOV2.js.map} +0 -0
- /package/dist/chunks/{chunk-PUBHBEYO.js.map → chunk-B2FIGOPI.js.map} +0 -0
- /package/dist/chunks/{chunk-4WKD3YM3.js.map → chunk-C3UPHOJW.js.map} +0 -0
- /package/dist/chunks/{chunk-RAA3FAYZ.js.map → chunk-GNPTDN6K.js.map} +0 -0
- /package/dist/chunks/{chunk-XFOSUGLU.js.map → chunk-JCGEW5OQ.js.map} +0 -0
- /package/dist/chunks/{chunk-CXYJJ3HZ.js.map → chunk-LJ2MG6U2.js.map} +0 -0
- /package/dist/chunks/{chunk-3MOY6WIB.js.map → chunk-LRBDEAKB.js.map} +0 -0
- /package/dist/chunks/{chunk-NQ7IWEIF.js.map → chunk-MQGRQMVM.js.map} +0 -0
- /package/dist/chunks/{chunk-WKFRGICG.js.map → chunk-RBYRHS24.js.map} +0 -0
- /package/dist/chunks/{chunk-ZHROHNEE.js.map → chunk-RFNYH7S7.js.map} +0 -0
- /package/dist/chunks/{chunk-H57KPL3V.js.map → chunk-S2JWFXW5.js.map} +0 -0
- /package/dist/chunks/{chunk-KIFOEBYJ.js.map → chunk-VEXCD3RA.js.map} +0 -0
- /package/dist/chunks/{chunk-GS67KDMV.js.map → chunk-VN7AE3EY.js.map} +0 -0
- /package/dist/chunks/{chunk-MX53BRAC.js.map → chunk-XBAOTA4U.js.map} +0 -0
- /package/dist/chunks/{chunk-MSDL7U6Q.js.map → chunk-XQCNVH3Y.js.map} +0 -0
- /package/dist/chunks/{chunk-6GWDGTHC.js.map → chunk-YLO62DWD.js.map} +0 -0
|
@@ -9,7 +9,10 @@ import {
|
|
|
9
9
|
import {
|
|
10
10
|
DEFAULT_MEMORY_INDEX_PRIVACY,
|
|
11
11
|
normalizeSession
|
|
12
|
-
} from "./chunk-
|
|
12
|
+
} from "./chunk-S2JWFXW5.js";
|
|
13
|
+
import {
|
|
14
|
+
writeJsonAtomic
|
|
15
|
+
} from "./chunk-2WPTD6BI.js";
|
|
13
16
|
import {
|
|
14
17
|
coverageComplete
|
|
15
18
|
} from "./chunk-P7YSPKTM.js";
|
|
@@ -132,24 +135,23 @@ var normalizationOptions = (options, lineage) => ({
|
|
|
132
135
|
indexThinking: options.indexThinking ?? DEFAULT_MEMORY_INDEX_PRIVACY.indexThinking,
|
|
133
136
|
indexToolOutput: options.indexToolOutput ?? DEFAULT_MEMORY_INDEX_PRIVACY.indexToolOutput
|
|
134
137
|
});
|
|
135
|
-
var
|
|
138
|
+
var validShardRecord = (parsed, fileSize) => parsed.cacheVersion === MEMORY_CACHE_VERSION && parsed.kind === "shard" && typeof parsed.sessionFile === "string" && typeof parsed.sessionId === "string" && typeof parsed.sourceHash === "string" && parsed.sourceHash.length === 64 && (parsed.branches === "active" || parsed.branches === "all") && typeof parsed.lineageFingerprint === "string" && parsed.lineageFingerprint.length === 64 && typeof parsed.policy === "string" && typeof parsed.cacheBytes === "number" && parsed.cacheBytes === fileSize && typeof parsed.cacheSourceRatio === "number" && typeof parsed.totalEntryCount === "number" && typeof parsed.indexCoverage === "object" && parsed.indexCoverage !== null && typeof parsed.indexCoverage.complete === "boolean" && Array.isArray(parsed.indexCoverage.reasons) && parsed.indexCoverage.reasons.every((reason) => typeof reason === "string") && Array.isArray(parsed.entries) && parsed.entries.every((entry) => entry !== null && typeof entry === "object" && typeof entry.index === "number" && typeof entry.sessionFile === "string" && typeof entry.text === "string");
|
|
139
|
+
var validDigestRecord = (parsed, fileSize) => parsed.cacheVersion === MEMORY_CACHE_VERSION && parsed.kind === "digest" && typeof parsed.sessionId === "string" && typeof parsed.file === "string" && typeof parsed.sourceHash === "string" && parsed.sourceHash.length === 64 && (parsed.branches === "active" || parsed.branches === "all") && typeof parsed.lineageFingerprint === "string" && parsed.lineageFingerprint.length === 64 && typeof parsed.policy === "string" && typeof parsed.cacheBytes === "number" && parsed.cacheBytes === fileSize && typeof parsed.cacheSourceRatio === "number" && Array.isArray(parsed.filesTouched) && Array.isArray(parsed.vocabulary) && parsed.vocabulary.every((term, index) => typeof term === "string" && (index === 0 || parsed.vocabulary[index - 1] < term)) && Array.isArray(parsed.addresses) && parsed.addresses.every((address) => Array.isArray(address) && address.length === 10 && typeof address[0] === "number" && (address[1] === null || typeof address[1] === "string") && (address[2] === null || typeof address[2] === "string") && (address[3] === null || typeof address[3] === "string") && (address[4] === null || typeof address[4] === "string") && (address[5] === null || typeof address[5] === "number") && (address[6] === null || typeof address[6] === "string") && (address[7] === null || typeof address[7] === "string") && (address[8] === null || typeof address[8] === "string") && (address[9] === null || address[9] === "succeeded" || address[9] === "failed" || address[9] === "aborted" || address[9] === "timed_out")) && typeof parsed.indexCoverage === "object" && parsed.indexCoverage !== null && typeof parsed.indexCoverage.complete === "boolean" && typeof parsed.indexCoverage.vocabularyBytes === "number" && Array.isArray(parsed.indexCoverage.reasons) && parsed.indexCoverage.reasons.every((reason) => typeof reason === "string") && typeof parsed.mtime === "number" && typeof parsed.size === "number";
|
|
140
|
+
var withCacheSnapshot = (filePath, read) => {
|
|
141
|
+
const fd = fs2.openSync(filePath, fs2.constants.O_RDONLY | (fs2.constants.O_NONBLOCK ?? 0));
|
|
136
142
|
try {
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
if (parsed.cacheVersion !== MEMORY_CACHE_VERSION || parsed.kind !== "shard" || typeof parsed.sessionFile !== "string" || typeof parsed.sessionId !== "string" || typeof parsed.sourceHash !== "string" || parsed.sourceHash.length !== 64 || parsed.branches !== "active" && parsed.branches !== "all" || typeof parsed.lineageFingerprint !== "string" || parsed.lineageFingerprint.length !== 64 || typeof parsed.policy !== "string" || typeof parsed.cacheBytes !== "number" || parsed.cacheBytes !== stat.size || typeof parsed.cacheSourceRatio !== "number" || typeof parsed.totalEntryCount !== "number" || typeof parsed.indexCoverage !== "object" || parsed.indexCoverage === null || typeof parsed.indexCoverage.complete !== "boolean" || !Array.isArray(parsed.indexCoverage.reasons) || !parsed.indexCoverage.reasons.every((reason) => typeof reason === "string") || !Array.isArray(parsed.entries) || !parsed.entries.every((entry) => entry !== null && typeof entry === "object" && typeof entry.index === "number" && typeof entry.sessionFile === "string" && typeof entry.text === "string")) return null;
|
|
141
|
-
return parsed;
|
|
142
|
-
} catch {
|
|
143
|
-
return null;
|
|
143
|
+
return read(fd, fs2.fstatSync(fd));
|
|
144
|
+
} finally {
|
|
145
|
+
fs2.closeSync(fd);
|
|
144
146
|
}
|
|
145
147
|
};
|
|
146
|
-
var
|
|
148
|
+
var readCacheFile = (filePath, maxBytes, valid) => {
|
|
147
149
|
try {
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
150
|
+
return withCacheSnapshot(filePath, (fd, stat) => {
|
|
151
|
+
if (!stat.isFile() || stat.size > maxBytes) return null;
|
|
152
|
+
const parsed = JSON.parse(fs2.readFileSync(fd, "utf8"));
|
|
153
|
+
return valid(parsed, stat.size) ? parsed : null;
|
|
154
|
+
});
|
|
153
155
|
} catch {
|
|
154
156
|
return null;
|
|
155
157
|
}
|
|
@@ -168,28 +170,48 @@ var applyCacheMetrics = (value) => {
|
|
|
168
170
|
value.cacheSourceRatio = value.size === 0 ? 0 : Number((value.cacheBytes / value.size).toFixed(6));
|
|
169
171
|
return value;
|
|
170
172
|
};
|
|
171
|
-
var
|
|
173
|
+
var withCacheMutation = (filePath, mutate) => {
|
|
174
|
+
const lock = `${filePath}.lock`;
|
|
172
175
|
try {
|
|
173
|
-
fs2.mkdirSync(
|
|
176
|
+
fs2.mkdirSync(lock, { mode: 448 });
|
|
177
|
+
} catch {
|
|
178
|
+
return;
|
|
179
|
+
}
|
|
180
|
+
try {
|
|
181
|
+
mutate();
|
|
182
|
+
} catch {
|
|
183
|
+
} finally {
|
|
174
184
|
try {
|
|
175
|
-
fs2.
|
|
185
|
+
fs2.rmdirSync(lock);
|
|
176
186
|
} catch {
|
|
177
187
|
}
|
|
178
|
-
|
|
188
|
+
}
|
|
189
|
+
};
|
|
190
|
+
var writeCacheFile = (filePath, value) => {
|
|
191
|
+
try {
|
|
192
|
+
const directory = path.dirname(filePath);
|
|
193
|
+
fs2.mkdirSync(directory, { recursive: true, mode: 448 });
|
|
179
194
|
try {
|
|
180
|
-
fs2.chmodSync(
|
|
195
|
+
fs2.chmodSync(directory, 448);
|
|
181
196
|
} catch {
|
|
182
197
|
}
|
|
183
|
-
|
|
198
|
+
withCacheMutation(filePath, () => {
|
|
199
|
+
writeJsonAtomic(filePath, value);
|
|
200
|
+
try {
|
|
201
|
+
fs2.chmodSync(filePath, 384);
|
|
202
|
+
} catch {
|
|
203
|
+
}
|
|
204
|
+
});
|
|
184
205
|
} catch {
|
|
185
|
-
return false;
|
|
186
206
|
}
|
|
187
207
|
};
|
|
188
208
|
var removeCacheFile = (filePath) => {
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
209
|
+
fs2.rmSync(filePath, { force: true });
|
|
210
|
+
};
|
|
211
|
+
var evictCacheFile = (filePath, shouldRemove = () => true) => {
|
|
212
|
+
withCacheMutation(filePath, () => {
|
|
213
|
+
if (shouldRemove()) removeCacheFile(filePath);
|
|
214
|
+
});
|
|
193
215
|
};
|
|
194
216
|
var fingerprintSource = (file) => {
|
|
195
217
|
try {
|
|
@@ -230,16 +252,16 @@ var loadShard = (ref, options) => {
|
|
|
230
252
|
const filePath = shardPathForSession(ref.file, options.indexDir, lineage.branches);
|
|
231
253
|
const state = fingerprintSource(ref.file);
|
|
232
254
|
if (!state) {
|
|
233
|
-
|
|
255
|
+
evictCacheFile(filePath, () => !fs2.existsSync(ref.file));
|
|
234
256
|
return missingShard(ref, lineage);
|
|
235
257
|
}
|
|
236
258
|
const policy = shardPolicy(options, lineage);
|
|
237
|
-
const cached =
|
|
259
|
+
const cached = readCacheFile(
|
|
238
260
|
filePath,
|
|
239
|
-
options.maxSyncSourceBytes ?? DEFAULT_MAX_SYNC_SOURCE_BYTES
|
|
261
|
+
options.maxSyncSourceBytes ?? DEFAULT_MAX_SYNC_SOURCE_BYTES,
|
|
262
|
+
validShardRecord
|
|
240
263
|
);
|
|
241
264
|
if (isCacheFresh(cached, state, policy) && cached?.sessionFile === ref.file) return cached;
|
|
242
|
-
if (fs2.existsSync(filePath)) removeCacheFile(filePath);
|
|
243
265
|
const { entries, header, indexCoverage } = normalizeSession(
|
|
244
266
|
ref.file,
|
|
245
267
|
options.maxEntryChars,
|
|
@@ -248,7 +270,6 @@ var loadShard = (ref, options) => {
|
|
|
248
270
|
const finalState = fingerprintSource(ref.file);
|
|
249
271
|
const finalLineage = resolveLineage(ref.file, options);
|
|
250
272
|
if (!finalState || finalState.sourceHash !== state.sourceHash || finalLineage.fingerprint !== lineage.fingerprint) {
|
|
251
|
-
removeCacheFile(filePath);
|
|
252
273
|
return missingShard(
|
|
253
274
|
ref,
|
|
254
275
|
finalLineage,
|
|
@@ -375,14 +396,13 @@ var loadDigest = (ref, options) => {
|
|
|
375
396
|
const filePath = digestPathForSession(ref.file, options.indexDir, lineage.branches);
|
|
376
397
|
const state = fingerprintSource(ref.file);
|
|
377
398
|
if (!state) {
|
|
378
|
-
|
|
399
|
+
evictCacheFile(filePath, () => !fs2.existsSync(ref.file));
|
|
379
400
|
return missingDigest(ref, lineage);
|
|
380
401
|
}
|
|
381
402
|
const policy = digestPolicy(options, lineage);
|
|
382
403
|
const maxCacheBytes = options.maxColdCacheBytes ?? DEFAULT_MAX_COLD_CACHE_BYTES;
|
|
383
|
-
const cached =
|
|
404
|
+
const cached = readCacheFile(filePath, maxCacheBytes, validDigestRecord);
|
|
384
405
|
if (isCacheFresh(cached, state, policy) && cached?.file === ref.file && serializedBytes(cached) <= maxCacheBytes) return cached;
|
|
385
|
-
if (fs2.existsSync(filePath)) removeCacheFile(filePath);
|
|
386
406
|
const { entries, header, indexCoverage } = normalizeSession(
|
|
387
407
|
ref.file,
|
|
388
408
|
Number.MAX_SAFE_INTEGER,
|
|
@@ -391,7 +411,6 @@ var loadDigest = (ref, options) => {
|
|
|
391
411
|
const finalState = fingerprintSource(ref.file);
|
|
392
412
|
const finalLineage = resolveLineage(ref.file, options);
|
|
393
413
|
if (!finalState || finalState.sourceHash !== state.sourceHash || finalLineage.fingerprint !== lineage.fingerprint) {
|
|
394
|
-
removeCacheFile(filePath);
|
|
395
414
|
return missingDigest(
|
|
396
415
|
ref,
|
|
397
416
|
finalLineage,
|
|
@@ -417,7 +436,15 @@ var loadDigest = (ref, options) => {
|
|
|
417
436
|
cacheBytes: 0,
|
|
418
437
|
cacheSourceRatio: 0
|
|
419
438
|
}, maxCacheBytes);
|
|
420
|
-
if (persisted.cacheBytes <= maxCacheBytes)
|
|
439
|
+
if (persisted.cacheBytes <= maxCacheBytes) {
|
|
440
|
+
writeCacheFile(filePath, persisted);
|
|
441
|
+
} else {
|
|
442
|
+
evictCacheFile(filePath, () => {
|
|
443
|
+
const current = readCacheFile(filePath, maxCacheBytes, validDigestRecord);
|
|
444
|
+
if (isCacheFresh(current, state, policy) && current?.file === ref.file) return false;
|
|
445
|
+
return fingerprintSource(ref.file)?.sourceHash === state.sourceHash && resolveLineage(ref.file, options).fingerprint === lineage.fingerprint;
|
|
446
|
+
});
|
|
447
|
+
}
|
|
421
448
|
return persisted;
|
|
422
449
|
};
|
|
423
450
|
var compareRefsByRecency = (left, right) => {
|
|
@@ -429,6 +456,36 @@ var classifySessionTiers = (refs, hotSessions = DEFAULT_HOT_SESSIONS) => {
|
|
|
429
456
|
const hot = new Set(sorted.slice(0, Math.max(0, Math.floor(hotSessions))).map((ref) => ref.file));
|
|
430
457
|
return new Map(sorted.map((ref) => [ref.file, hot.has(ref.file) ? "hot" : "cold"]));
|
|
431
458
|
};
|
|
459
|
+
var inspectCacheFile = (cacheFile, indexDir, branchesToClean, remainingBytes) => {
|
|
460
|
+
try {
|
|
461
|
+
if (!fs2.lstatSync(cacheFile).isFile()) return { bytes: 0, verdict: "remove" };
|
|
462
|
+
return withCacheSnapshot(cacheFile, (fd, stat) => {
|
|
463
|
+
if (!stat.isFile()) return { bytes: 0, verdict: "remove" };
|
|
464
|
+
if (stat.size > remainingBytes) return { bytes: 0, verdict: "budget" };
|
|
465
|
+
const bytes = stat.size;
|
|
466
|
+
const contents = fs2.readFileSync(fd, "utf8");
|
|
467
|
+
let record;
|
|
468
|
+
try {
|
|
469
|
+
record = JSON.parse(contents);
|
|
470
|
+
} catch {
|
|
471
|
+
return { bytes, verdict: "remove" };
|
|
472
|
+
}
|
|
473
|
+
if (!record || record.branches !== "active" && record.branches !== "all") {
|
|
474
|
+
return { bytes, verdict: "remove" };
|
|
475
|
+
}
|
|
476
|
+
const branches = record.branches;
|
|
477
|
+
if (branches !== branchesToClean) return { bytes, verdict: "keep" };
|
|
478
|
+
const source = record.kind === "shard" && validShardRecord(record, bytes) ? record.sessionFile : record.kind === "digest" && validDigestRecord(record, bytes) ? record.file : null;
|
|
479
|
+
const expected = !source ? null : record.kind === "shard" ? shardPathForSession(source, indexDir, branches) : digestPathForSession(source, indexDir, branches);
|
|
480
|
+
return {
|
|
481
|
+
bytes,
|
|
482
|
+
verdict: source !== null && expected === cacheFile && fs2.existsSync(source) ? "keep" : "remove"
|
|
483
|
+
};
|
|
484
|
+
});
|
|
485
|
+
} catch {
|
|
486
|
+
return { bytes: 0, verdict: "keep" };
|
|
487
|
+
}
|
|
488
|
+
};
|
|
432
489
|
var cleanupCacheDirectory = (indexDir, branchesToClean, maxFiles, maxBytes) => {
|
|
433
490
|
let directory;
|
|
434
491
|
try {
|
|
@@ -448,33 +505,16 @@ var cleanupCacheDirectory = (indexDir, branchesToClean, maxFiles, maxBytes) => {
|
|
|
448
505
|
}
|
|
449
506
|
inspected += 1;
|
|
450
507
|
const cacheFile = path.join(indexDir, entry.name);
|
|
451
|
-
|
|
452
|
-
|
|
453
|
-
|
|
454
|
-
|
|
455
|
-
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
removeCacheFile(cacheFile);
|
|
460
|
-
continue;
|
|
461
|
-
}
|
|
462
|
-
if (inspectedBytes + cacheBytes > maxBytes) {
|
|
463
|
-
return { complete: false, reasons: ["cache_cleanup_budget"] };
|
|
464
|
-
}
|
|
465
|
-
inspectedBytes += cacheBytes;
|
|
466
|
-
try {
|
|
467
|
-
const parsed = JSON.parse(fs2.readFileSync(cacheFile, "utf8"));
|
|
468
|
-
const kind = parsed.kind;
|
|
469
|
-
const source = kind === "shard" && typeof parsed.sessionFile === "string" ? parsed.sessionFile : kind === "digest" && typeof parsed.file === "string" ? parsed.file : null;
|
|
470
|
-
const branches = parsed.branches === "active" || parsed.branches === "all" ? parsed.branches : null;
|
|
471
|
-
if (branches !== null && branches !== branchesToClean) continue;
|
|
472
|
-
const expected = source && branches && kind === "shard" ? shardPathForSession(source, indexDir, branches) : source && branches && kind === "digest" ? digestPathForSession(source, indexDir, branches) : null;
|
|
473
|
-
const structurallyValid = kind === "shard" ? readShardFile(cacheFile, cacheBytes) !== null : kind === "digest" ? readDigestFile(cacheFile, cacheBytes) !== null : false;
|
|
474
|
-
if (parsed.cacheVersion !== MEMORY_CACHE_VERSION || source === null || expected !== cacheFile || !fs2.existsSync(source) || !structurallyValid) removeCacheFile(cacheFile);
|
|
475
|
-
} catch {
|
|
476
|
-
removeCacheFile(cacheFile);
|
|
508
|
+
const inspect = () => {
|
|
509
|
+
const result = inspectCacheFile(cacheFile, indexDir, branchesToClean, maxBytes - inspectedBytes);
|
|
510
|
+
inspectedBytes += result.bytes;
|
|
511
|
+
return result.verdict;
|
|
512
|
+
};
|
|
513
|
+
let verdict = inspect();
|
|
514
|
+
if (verdict === "remove") {
|
|
515
|
+
evictCacheFile(cacheFile, () => (verdict = inspect()) === "remove");
|
|
477
516
|
}
|
|
517
|
+
if (verdict === "budget") return { complete: false, reasons: ["cache_cleanup_budget"] };
|
|
478
518
|
}
|
|
479
519
|
} finally {
|
|
480
520
|
directory.closeSync();
|
|
@@ -537,7 +577,7 @@ var loadTieredIndex = (refs, allRefs, options, hydrate = false, entryRange) => {
|
|
|
537
577
|
}
|
|
538
578
|
} else if (tier === "hot") {
|
|
539
579
|
const shard = loadShard(ref, options);
|
|
540
|
-
|
|
580
|
+
evictCacheFile(digestPathForSession(
|
|
541
581
|
ref.file,
|
|
542
582
|
options.indexDir,
|
|
543
583
|
options.branches ?? "active"
|
|
@@ -551,7 +591,7 @@ var loadTieredIndex = (refs, allRefs, options, hydrate = false, entryRange) => {
|
|
|
551
591
|
}
|
|
552
592
|
} else {
|
|
553
593
|
const digest = loadDigest(ref, options);
|
|
554
|
-
|
|
594
|
+
evictCacheFile(shardPathForSession(
|
|
555
595
|
ref.file,
|
|
556
596
|
options.indexDir,
|
|
557
597
|
options.branches ?? "active"
|
|
@@ -1235,6 +1275,7 @@ export {
|
|
|
1235
1275
|
fitDigestCache,
|
|
1236
1276
|
classifySessionTiers,
|
|
1237
1277
|
loadTieredIndex,
|
|
1278
|
+
bm25Score,
|
|
1238
1279
|
DEFAULT_REGEX_MAX_PATTERN_BYTES,
|
|
1239
1280
|
DEFAULT_REGEX_MAX_HAYSTACK_TERMS,
|
|
1240
1281
|
DEFAULT_REGEX_MAX_HAYSTACK_BYTES,
|
|
@@ -1242,4 +1283,4 @@ export {
|
|
|
1242
1283
|
searchMemoryIndex,
|
|
1243
1284
|
searchShards
|
|
1244
1285
|
};
|
|
1245
|
-
//# sourceMappingURL=chunk-
|
|
1286
|
+
//# sourceMappingURL=chunk-WFGJUVTH.js.map
|
|
@@ -0,0 +1,7 @@
|
|
|
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 { writeJsonAtomic } from \"../core/atomic-write.js\";\nimport { coverageComplete } from \"../verified/policy.js\";\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\n/** Structural validity of an already-parsed shard record against the size of\n * the file it was read from. Pure, so cache cleanup can validate a record\n * it already parsed instead of reading the file a second time. */\nconst validShardRecord = (parsed: Shard, fileSize: number): boolean =>\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 === fileSize &&\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\n/** Structural validity of an already-parsed digest record against the size\n * of the file it was read from; see validShardRecord. */\nconst validDigestRecord = (parsed: DigestShard, fileSize: number): boolean =>\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 === fileSize &&\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\n// The size check, byte budget, and JSON must all describe the same inode.\n// A path stat followed by a path read can straddle another process's rename.\nconst withCacheSnapshot = <T>(filePath: string, read: (fd: number, stat: fs.Stats) => T): T => {\n // Do not block opening unexpected special files such as FIFOs on POSIX.\n const fd = fs.openSync(filePath, fs.constants.O_RDONLY | (fs.constants.O_NONBLOCK ?? 0));\n try {\n return read(fd, fs.fstatSync(fd));\n } finally {\n fs.closeSync(fd);\n }\n};\n\nconst readCacheFile = <T>(\n filePath: string,\n maxBytes: number,\n valid: (value: T, fileSize: number) => boolean,\n): T | null => {\n try {\n return withCacheSnapshot(filePath, (fd, stat) => {\n if (!stat.isFile() || stat.size > maxBytes) return null;\n const parsed = JSON.parse(fs.readFileSync(fd, \"utf8\")) as T;\n return valid(parsed, stat.size) ? parsed : null;\n });\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\n// Shards and digests are replaceable snapshots, never authoritative state or\n// read/merge/write records. Only publication and eviction need exclusion. The\n// best-effort cache never waits or steals by age: a crash can strand one key's\n// empty lock directory, but queries still compute from the source. Clear a\n// stranded .lock only with both memory clients stopped.\nconst withCacheMutation = (filePath: string, mutate: () => void): void => {\n const lock = `${filePath}.lock`;\n try {\n fs.mkdirSync(lock, { mode: 0o700 });\n } catch {\n return;\n }\n try {\n mutate();\n } catch {\n // Cache writes/eviction are best effort.\n } finally {\n try { fs.rmdirSync(lock); } catch {}\n }\n};\n\nconst writeCacheFile = (filePath: string, value: Shard | DigestShard): void => {\n try {\n const directory = path.dirname(filePath);\n fs.mkdirSync(directory, { recursive: true, mode: 0o700 });\n try { fs.chmodSync(directory, 0o700); } catch {}\n withCacheMutation(filePath, () => {\n // Replace the index entry rather than writing through a leaf symlink.\n writeJsonAtomic(filePath, value);\n try { fs.chmodSync(filePath, 0o600); } catch {}\n });\n } catch {\n // An unusable index directory must not fail a query.\n }\n};\n\nconst removeCacheFile = (filePath: string): void => {\n // Do not recursively remove an unexpected directory at a cache pathname.\n fs.rmSync(filePath, { force: true });\n};\n\nconst evictCacheFile = (filePath: string, shouldRemove = () => true): void => {\n withCacheMutation(filePath, () => {\n if (shouldRemove()) removeCacheFile(filePath);\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 evictCacheFile(filePath, () => !fs.existsSync(ref.file));\n return missingShard(ref, lineage);\n }\n const policy = shardPolicy(options, lineage);\n const cached = readCacheFile(\n filePath,\n options.maxSyncSourceBytes ?? DEFAULT_MAX_SYNC_SOURCE_BYTES,\n validShardRecord,\n );\n if (isCacheFresh(cached, state, policy) && cached?.sessionFile === ref.file) return cached;\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 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 = coverageComplete(digest.indexCoverage.complete, true);\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 evictCacheFile(filePath, () => !fs.existsSync(ref.file));\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 = readCacheFile(filePath, maxCacheBytes, validDigestRecord);\n if (\n isCacheFresh(cached, state, policy) &&\n cached?.file === ref.file &&\n serializedBytes(cached) <= maxCacheBytes\n ) return cached;\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 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) {\n writeCacheFile(filePath, persisted);\n } else {\n // Keep the cache budget even when this replacement cannot be stored. Do\n // not evict a fresh digest another process has already published.\n evictCacheFile(filePath, () => {\n const current = readCacheFile(filePath, maxCacheBytes, validDigestRecord);\n if (isCacheFresh(current, state, policy) && current?.file === ref.file) return false;\n return fingerprintSource(ref.file)?.sourceHash === state.sourceHash &&\n resolveLineage(ref.file, options).fingerprint === lineage.fingerprint;\n });\n }\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\ninterface CacheInspection {\n bytes: number;\n verdict: \"keep\" | \"remove\" | \"budget\";\n}\n\nconst inspectCacheFile = (\n cacheFile: string,\n indexDir: string,\n branchesToClean: MemoryBranches,\n remainingBytes: number,\n): CacheInspection => {\n try {\n if (!fs.lstatSync(cacheFile).isFile()) return { bytes: 0, verdict: \"remove\" };\n return withCacheSnapshot(cacheFile, (fd, stat) => {\n if (!stat.isFile()) return { bytes: 0, verdict: \"remove\" };\n if (stat.size > remainingBytes) return { bytes: 0, verdict: \"budget\" };\n const bytes = stat.size;\n const contents = fs.readFileSync(fd, \"utf8\");\n let record: Shard | DigestShard | null;\n try {\n record = JSON.parse(contents) as Shard | DigestShard | null;\n } catch {\n return { bytes, verdict: \"remove\" };\n }\n if (!record || (record.branches !== \"active\" && record.branches !== \"all\")) {\n return { bytes, verdict: \"remove\" };\n }\n const branches = record.branches;\n if (branches !== branchesToClean) return { bytes, verdict: \"keep\" };\n const source = record.kind === \"shard\" && validShardRecord(record, bytes)\n ? record.sessionFile\n : record.kind === \"digest\" && validDigestRecord(record, bytes) ? record.file : null;\n const expected = !source ? null : record.kind === \"shard\"\n ? shardPathForSession(source, indexDir, branches)\n : digestPathForSession(source, indexDir, branches);\n return {\n bytes,\n verdict: source !== null && expected === cacheFile && fs.existsSync(source) ? \"keep\" : \"remove\",\n };\n });\n } catch {\n // An unobservable entry is not evidence that it should be removed.\n return { bytes: 0, verdict: \"keep\" };\n }\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 const inspect = (): CacheInspection[\"verdict\"] => {\n const result = inspectCacheFile(cacheFile, indexDir, branchesToClean, maxBytes - inspectedBytes);\n inspectedBytes += result.bytes;\n return result.verdict;\n };\n let verdict = inspect();\n if (verdict === \"remove\") {\n // Re-validate while holding the same lock as publishers. The sweep's\n // original observation may describe a file that has been replaced.\n evictCacheFile(cacheFile, () => (verdict = inspect()) === \"remove\");\n }\n if (verdict === \"budget\") return { complete: false, reasons: [\"cache_cleanup_budget\"] };\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 evictCacheFile(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 evictCacheFile(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;AAGnB,OAAOC,SAAQ;AACf,OAAO,UAAU;;;ACJjB,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;;;ADvIhH,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;AAKA,IAAM,mBAAmB,CAAC,QAAe,aACvC,OAAO,iBAAiB,wBACxB,OAAO,SAAS,WAChB,OAAO,OAAO,gBAAgB,YAC9B,OAAO,OAAO,cAAc,YAC5B,OAAO,OAAO,eAAe,YAC7B,OAAO,WAAW,WAAW,OAC5B,OAAO,aAAa,YAAY,OAAO,aAAa,UACrD,OAAO,OAAO,uBAAuB,YACrC,OAAO,mBAAmB,WAAW,MACrC,OAAO,OAAO,WAAW,YACzB,OAAO,OAAO,eAAe,YAC7B,OAAO,eAAe,YACtB,OAAO,OAAO,qBAAqB,YACnC,OAAO,OAAO,oBAAoB,YAClC,OAAO,OAAO,kBAAkB,YAChC,OAAO,kBAAkB,QACzB,OAAO,OAAO,cAAc,aAAa,aACzC,MAAM,QAAQ,OAAO,cAAc,OAAO,KAC1C,OAAO,cAAc,QAAQ,MAAM,CAAC,WAAW,OAAO,WAAW,QAAQ,KACzE,MAAM,QAAQ,OAAO,OAAO,KAC5B,OAAO,QAAQ,MAAM,CAAC,UACpB,UAAU,QACV,OAAO,UAAU,YACjB,OAAO,MAAM,UAAU,YACvB,OAAO,MAAM,gBAAgB,YAC7B,OAAO,MAAM,SAAS,QAAQ;AAIlC,IAAM,oBAAoB,CAAC,QAAqB,aAC9C,OAAO,iBAAiB,wBACxB,OAAO,SAAS,YAChB,OAAO,OAAO,cAAc,YAC5B,OAAO,OAAO,SAAS,YACvB,OAAO,OAAO,eAAe,YAC7B,OAAO,WAAW,WAAW,OAC5B,OAAO,aAAa,YAAY,OAAO,aAAa,UACrD,OAAO,OAAO,uBAAuB,YACrC,OAAO,mBAAmB,WAAW,MACrC,OAAO,OAAO,WAAW,YACzB,OAAO,OAAO,eAAe,YAC7B,OAAO,eAAe,YACtB,OAAO,OAAO,qBAAqB,YACnC,MAAM,QAAQ,OAAO,YAAY,KACjC,MAAM,QAAQ,OAAO,UAAU,KAC/B,OAAO,WAAW,MAAM,CAAC,MAAM,UAC7B,OAAO,SAAS,aAAa,UAAU,KAAK,OAAO,WAAW,QAAQ,CAAC,IAAK,KAAK,KACnF,MAAM,QAAQ,OAAO,SAAS,KAC9B,OAAO,UAAU,MAAM,CAAC,YACtB,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,MAAM,QAAQ,OAAO,cAAc,OAAO,KAC1C,OAAO,cAAc,QAAQ,MAAM,CAAC,WAAW,OAAO,WAAW,QAAQ,KACzE,OAAO,OAAO,UAAU,YACxB,OAAO,OAAO,SAAS;AAIzB,IAAM,oBAAoB,CAAI,UAAkB,SAA+C;AAE7F,QAAM,KAAKC,IAAG,SAAS,UAAUA,IAAG,UAAU,YAAYA,IAAG,UAAU,cAAc,EAAE;AACvF,MAAI;AACF,WAAO,KAAK,IAAIA,IAAG,UAAU,EAAE,CAAC;AAAA,EAClC,UAAE;AACA,IAAAA,IAAG,UAAU,EAAE;AAAA,EACjB;AACF;AAEA,IAAM,gBAAgB,CACpB,UACA,UACA,UACa;AACb,MAAI;AACF,WAAO,kBAAkB,UAAU,CAAC,IAAI,SAAS;AAC/C,UAAI,CAAC,KAAK,OAAO,KAAK,KAAK,OAAO,SAAU,QAAO;AACnD,YAAM,SAAS,KAAK,MAAMA,IAAG,aAAa,IAAI,MAAM,CAAC;AACrD,aAAO,MAAM,QAAQ,KAAK,IAAI,IAAI,SAAS;AAAA,IAC7C,CAAC;AAAA,EACH,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;AAOA,IAAM,oBAAoB,CAAC,UAAkB,WAA6B;AACxE,QAAM,OAAO,GAAG,QAAQ;AACxB,MAAI;AACF,IAAAA,IAAG,UAAU,MAAM,EAAE,MAAM,IAAM,CAAC;AAAA,EACpC,QAAQ;AACN;AAAA,EACF;AACA,MAAI;AACF,WAAO;AAAA,EACT,QAAQ;AAAA,EAER,UAAE;AACA,QAAI;AAAE,MAAAA,IAAG,UAAU,IAAI;AAAA,IAAG,QAAQ;AAAA,IAAC;AAAA,EACrC;AACF;AAEA,IAAM,iBAAiB,CAAC,UAAkB,UAAqC;AAC7E,MAAI;AACF,UAAM,YAAY,KAAK,QAAQ,QAAQ;AACvC,IAAAA,IAAG,UAAU,WAAW,EAAE,WAAW,MAAM,MAAM,IAAM,CAAC;AACxD,QAAI;AAAE,MAAAA,IAAG,UAAU,WAAW,GAAK;AAAA,IAAG,QAAQ;AAAA,IAAC;AAC/C,sBAAkB,UAAU,MAAM;AAEhC,sBAAgB,UAAU,KAAK;AAC/B,UAAI;AAAE,QAAAA,IAAG,UAAU,UAAU,GAAK;AAAA,MAAG,QAAQ;AAAA,MAAC;AAAA,IAChD,CAAC;AAAA,EACH,QAAQ;AAAA,EAER;AACF;AAEA,IAAM,kBAAkB,CAAC,aAA2B;AAElD,EAAAA,IAAG,OAAO,UAAU,EAAE,OAAO,KAAK,CAAC;AACrC;AAEA,IAAM,iBAAiB,CAAC,UAAkB,eAAe,MAAM,SAAe;AAC5E,oBAAkB,UAAU,MAAM;AAChC,QAAI,aAAa,EAAG,iBAAgB,QAAQ;AAAA,EAC9C,CAAC;AACH;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,mBAAe,UAAU,MAAM,CAACC,IAAG,WAAW,IAAI,IAAI,CAAC;AACvD,WAAO,aAAa,KAAK,OAAO;AAAA,EAClC;AACA,QAAM,SAAS,YAAY,SAAS,OAAO;AAC3C,QAAM,SAAS;AAAA,IACb;AAAA,IACA,QAAQ,sBAAsB;AAAA,IAC9B;AAAA,EACF;AACA,MAAI,aAAa,QAAQ,OAAO,MAAM,KAAK,QAAQ,gBAAgB,IAAI,KAAM,QAAO;AACpF,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;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,iBAAiB,OAAO,cAAc,UAAU,IAAI;AACpF,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,mBAAe,UAAU,MAAM,CAACA,IAAG,WAAW,IAAI,IAAI,CAAC;AACvD,WAAO,cAAc,KAAK,OAAO;AAAA,EACnC;AACA,QAAM,SAAS,aAAa,SAAS,OAAO;AAC5C,QAAM,gBAAgB,QAAQ,qBAAqB;AACnD,QAAM,SAAS,cAAc,UAAU,eAAe,iBAAiB;AACvE,MACE,aAAa,QAAQ,OAAO,MAAM,KAClC,QAAQ,SAAS,IAAI,QACrB,gBAAgB,MAAM,KAAK,cAC3B,QAAO;AAET,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,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,eAAe;AACzC,mBAAe,UAAU,SAAS;AAAA,EACpC,OAAO;AAGL,mBAAe,UAAU,MAAM;AAC7B,YAAM,UAAU,cAAc,UAAU,eAAe,iBAAiB;AACxE,UAAI,aAAa,SAAS,OAAO,MAAM,KAAK,SAAS,SAAS,IAAI,KAAM,QAAO;AAC/E,aAAO,kBAAkB,IAAI,IAAI,GAAG,eAAe,MAAM,cACvD,eAAe,IAAI,MAAM,OAAO,EAAE,gBAAgB,QAAQ;AAAA,IAC9D,CAAC;AAAA,EACH;AACA,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;AAwBA,IAAM,mBAAmB,CACvB,WACA,UACA,iBACA,mBACoB;AACpB,MAAI;AACF,QAAI,CAACA,IAAG,UAAU,SAAS,EAAE,OAAO,EAAG,QAAO,EAAE,OAAO,GAAG,SAAS,SAAS;AAC5E,WAAO,kBAAkB,WAAW,CAAC,IAAI,SAAS;AAChD,UAAI,CAAC,KAAK,OAAO,EAAG,QAAO,EAAE,OAAO,GAAG,SAAS,SAAS;AACzD,UAAI,KAAK,OAAO,eAAgB,QAAO,EAAE,OAAO,GAAG,SAAS,SAAS;AACrE,YAAM,QAAQ,KAAK;AACnB,YAAM,WAAWA,IAAG,aAAa,IAAI,MAAM;AAC3C,UAAI;AACJ,UAAI;AACF,iBAAS,KAAK,MAAM,QAAQ;AAAA,MAC9B,QAAQ;AACN,eAAO,EAAE,OAAO,SAAS,SAAS;AAAA,MACpC;AACA,UAAI,CAAC,UAAW,OAAO,aAAa,YAAY,OAAO,aAAa,OAAQ;AAC1E,eAAO,EAAE,OAAO,SAAS,SAAS;AAAA,MACpC;AACA,YAAM,WAAW,OAAO;AACxB,UAAI,aAAa,gBAAiB,QAAO,EAAE,OAAO,SAAS,OAAO;AAClE,YAAM,SAAS,OAAO,SAAS,WAAW,iBAAiB,QAAQ,KAAK,IACpE,OAAO,cACP,OAAO,SAAS,YAAY,kBAAkB,QAAQ,KAAK,IAAI,OAAO,OAAO;AACjF,YAAM,WAAW,CAAC,SAAS,OAAO,OAAO,SAAS,UAC9C,oBAAoB,QAAQ,UAAU,QAAQ,IAC9C,qBAAqB,QAAQ,UAAU,QAAQ;AACnD,aAAO;AAAA,QACL;AAAA,QACA,SAAS,WAAW,QAAQ,aAAa,aAAaA,IAAG,WAAW,MAAM,IAAI,SAAS;AAAA,MACzF;AAAA,IACF,CAAC;AAAA,EACH,QAAQ;AAEN,WAAO,EAAE,OAAO,GAAG,SAAS,OAAO;AAAA,EACrC;AACF;AAEA,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,YAAM,UAAU,MAAkC;AAChD,cAAM,SAAS,iBAAiB,WAAW,UAAU,iBAAiB,WAAW,cAAc;AAC/F,0BAAkB,OAAO;AACzB,eAAO,OAAO;AAAA,MAChB;AACA,UAAI,UAAU,QAAQ;AACtB,UAAI,YAAY,UAAU;AAGxB,uBAAe,WAAW,OAAO,UAAU,QAAQ,OAAO,QAAQ;AAAA,MACpE;AACA,UAAI,YAAY,SAAU,QAAO,EAAE,UAAU,OAAO,SAAS,CAAC,sBAAsB,EAAE;AAAA,IACxF;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,uBAAe;AAAA,UACb,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,uBAAe;AAAA,UACb,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;;;AE56BA,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
|
+
}
|