@e4779/pi-fabric 0.117.2-fork.30 → 0.131.0-fork.32
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 +12 -5
- package/THIRD_PARTY_NOTICES.md +6 -14
- package/dist/activity/store.d.ts +2 -1
- package/dist/activity/store.d.ts.map +1 -1
- package/dist/actors/binding-store.d.ts +13 -0
- package/dist/actors/binding-store.d.ts.map +1 -1
- package/dist/actors/directory.d.ts.map +1 -1
- package/dist/actors/global-registry.d.ts +8 -0
- package/dist/actors/global-registry.d.ts.map +1 -1
- package/dist/actors/host-event-payload.d.ts +14 -0
- package/dist/actors/host-event-payload.d.ts.map +1 -1
- package/dist/actors/manager.d.ts +4 -3
- package/dist/actors/manager.d.ts.map +1 -1
- package/dist/actors/mesh-monitor.d.ts +2 -0
- package/dist/actors/mesh-monitor.d.ts.map +1 -1
- package/dist/actors/name-policy.d.ts +3 -0
- package/dist/actors/name-policy.d.ts.map +1 -0
- package/dist/actors/registry-store.d.ts +14 -5
- package/dist/actors/registry-store.d.ts.map +1 -1
- package/dist/actors/store-read.d.ts +16 -0
- package/dist/actors/store-read.d.ts.map +1 -0
- package/dist/agents/agent-files.d.ts +80 -0
- package/dist/agents/agent-files.d.ts.map +1 -0
- package/dist/agents/agent-files.js +327 -0
- package/dist/agents/agent-files.js.map +7 -0
- package/dist/agents/child-skills.d.ts +60 -0
- package/dist/agents/child-skills.d.ts.map +1 -0
- package/dist/agents/child-skills.js +94 -0
- package/dist/agents/child-skills.js.map +7 -0
- package/dist/agents/clone-first-worktree.d.ts +6 -0
- package/dist/agents/clone-first-worktree.d.ts.map +1 -1
- package/dist/agents/cow-clone.d.ts.map +1 -1
- package/dist/agents/handoff.d.ts +12 -2
- package/dist/agents/handoff.d.ts.map +1 -1
- package/dist/agents/herdr-status.d.ts +26 -0
- package/dist/agents/herdr-status.d.ts.map +1 -0
- package/dist/agents/herdr-status.js +161 -0
- package/dist/agents/herdr-status.js.map +7 -0
- package/dist/agents/hosted-run.d.ts +20 -4
- package/dist/agents/hosted-run.d.ts.map +1 -1
- package/dist/agents/manager.d.ts +18 -2
- package/dist/agents/manager.d.ts.map +1 -1
- package/dist/agents/model-pin-guard.d.ts +27 -0
- package/dist/agents/model-pin-guard.d.ts.map +1 -0
- package/dist/agents/model-pin-guard.js +86 -0
- package/dist/agents/model-pin-guard.js.map +7 -0
- package/dist/agents/model-pin.d.ts +25 -0
- package/dist/agents/model-pin.d.ts.map +1 -0
- package/dist/agents/provider-bridge.d.ts +7 -6
- package/dist/agents/provider-bridge.d.ts.map +1 -1
- package/dist/agents/provider-bridge.js +33 -5
- package/dist/agents/provider-bridge.js.map +3 -3
- package/dist/agents/request.d.ts.map +1 -1
- package/dist/agents/result.d.ts.map +1 -1
- package/dist/agents/result.js +1 -1
- package/dist/agents/runner-notice.d.ts.map +1 -1
- package/dist/agents/runner-protocol.d.ts +8 -0
- package/dist/agents/runner-protocol.d.ts.map +1 -1
- package/dist/agents/service-schema.d.ts.map +1 -1
- package/dist/agents/transports/herdr-socket.d.ts +12 -0
- package/dist/agents/transports/herdr-socket.d.ts.map +1 -0
- package/dist/agents/transports/herdr-transport.d.ts.map +1 -1
- package/dist/agents/types.d.ts +51 -0
- package/dist/agents/types.d.ts.map +1 -1
- package/dist/agents/worker-recovery.d.ts +75 -0
- package/dist/agents/worker-recovery.d.ts.map +1 -0
- package/dist/agents/worktree-manager.d.ts.map +1 -1
- package/dist/agents.js +12 -11
- package/dist/agents.js.map +2 -2
- package/dist/audit/details.d.ts +36 -1
- package/dist/audit/details.d.ts.map +1 -1
- package/dist/audit/projection.d.ts.map +1 -1
- package/dist/audit/trace-schema.d.ts +50 -0
- package/dist/audit/trace-schema.d.ts.map +1 -0
- package/dist/audit/trace.d.ts +2 -48
- package/dist/audit/trace.d.ts.map +1 -1
- package/dist/chunks/chunk-2RWNVCFD.js +483 -0
- package/dist/chunks/chunk-2RWNVCFD.js.map +7 -0
- package/dist/chunks/chunk-2SCMGO2Z.js +16 -0
- package/dist/chunks/chunk-2SCMGO2Z.js.map +7 -0
- package/dist/chunks/chunk-35EEGOH3.js +324 -0
- package/dist/chunks/chunk-35EEGOH3.js.map +7 -0
- package/dist/chunks/{chunk-3FJUP3GV.js → chunk-36XQFTEN.js} +2 -2
- package/dist/chunks/{chunk-UTOBAZ5T.js → chunk-37NIOSVU.js} +1 -1
- package/dist/chunks/chunk-37NIOSVU.js.map +7 -0
- package/dist/chunks/chunk-3IJEQBFS.js +25 -0
- package/dist/chunks/chunk-3IJEQBFS.js.map +7 -0
- package/dist/chunks/{chunk-EHQQ4KCX.js → chunk-3MOY6WIB.js} +84 -19
- package/dist/chunks/chunk-3MOY6WIB.js.map +7 -0
- package/dist/chunks/chunk-3PKZSIRA.js +1312 -0
- package/dist/chunks/chunk-3PKZSIRA.js.map +7 -0
- package/dist/chunks/chunk-3VK6UGAN.js +64 -0
- package/dist/chunks/chunk-3VK6UGAN.js.map +7 -0
- package/dist/chunks/{chunk-ROTCDDOV.js → chunk-3XT5WHSG.js} +59 -119
- package/dist/chunks/chunk-3XT5WHSG.js.map +7 -0
- package/dist/chunks/{chunk-FIDUHKMM.js → chunk-4BYS4ZLY.js} +16 -16
- package/dist/chunks/chunk-4BYS4ZLY.js.map +7 -0
- package/dist/chunks/{chunk-K7J2ABAZ.js → chunk-4KX6BIPL.js} +91 -31
- package/dist/chunks/chunk-4KX6BIPL.js.map +7 -0
- package/dist/chunks/{chunk-UOM37PE4.js → chunk-4PBW54I2.js} +162 -92
- package/dist/chunks/chunk-4PBW54I2.js.map +7 -0
- package/dist/chunks/{chunk-ZEXCKK4K.js → chunk-4WKD3YM3.js} +3 -3
- package/dist/chunks/{chunk-PK4NIJEV.js → chunk-4XMXFHAR.js} +62 -3
- package/dist/chunks/chunk-4XMXFHAR.js.map +7 -0
- package/dist/chunks/{chunk-4EW7GVUR.js → chunk-56NMRVTV.js} +589 -377
- package/dist/chunks/chunk-56NMRVTV.js.map +7 -0
- package/dist/chunks/{chunk-GIK2WNAK.js → chunk-5BOTHX47.js} +109 -20
- package/dist/chunks/chunk-5BOTHX47.js.map +7 -0
- package/dist/chunks/chunk-5QJFDKPN.js +179 -0
- package/dist/chunks/chunk-5QJFDKPN.js.map +7 -0
- package/dist/chunks/{chunk-P7CBPPHY.js → chunk-6GWDGTHC.js} +5 -5
- package/dist/chunks/{chunk-P7CBPPHY.js.map → chunk-6GWDGTHC.js.map} +1 -1
- package/dist/chunks/chunk-6HO2IUQ5.js +104 -0
- package/dist/chunks/chunk-6HO2IUQ5.js.map +7 -0
- package/dist/chunks/chunk-6OGYPHNQ.js +62 -0
- package/dist/chunks/chunk-6OGYPHNQ.js.map +7 -0
- package/dist/chunks/{chunk-GO32KSEZ.js → chunk-7CIES6X2.js} +84 -9
- package/dist/chunks/chunk-7CIES6X2.js.map +7 -0
- package/dist/chunks/{chunk-G4TLWHRS.js → chunk-7N7IC3Z2.js} +4 -3
- package/dist/chunks/{chunk-G4TLWHRS.js.map → chunk-7N7IC3Z2.js.map} +2 -2
- package/dist/chunks/{chunk-5XBYFSI5.js → chunk-7YNE4NB2.js} +2 -2
- package/dist/chunks/{chunk-NTC2MCB6.js → chunk-B5L3X3ID.js} +1 -1
- package/dist/chunks/{chunk-NTC2MCB6.js.map → chunk-B5L3X3ID.js.map} +1 -1
- package/dist/chunks/chunk-BIBRWZWQ.js +325 -0
- package/dist/chunks/chunk-BIBRWZWQ.js.map +7 -0
- package/dist/chunks/{chunk-K6QXUGS5.js → chunk-BMAEZNZ5.js} +2 -1
- package/dist/chunks/{chunk-FSB2VIRZ.js → chunk-CBIV747V.js} +14 -3
- package/dist/chunks/chunk-CBIV747V.js.map +7 -0
- package/dist/chunks/{chunk-CCHZXF6K.js → chunk-CXYJJ3HZ.js} +3 -3
- package/dist/chunks/{chunk-R2XQ6AHT.js → chunk-DGERP4VL.js} +22 -10
- package/dist/chunks/chunk-DGERP4VL.js.map +7 -0
- package/dist/chunks/chunk-F2LGSRIN.js +38 -0
- package/dist/chunks/chunk-F2LGSRIN.js.map +7 -0
- package/dist/chunks/chunk-F6A6MQ6G.js +609 -0
- package/dist/chunks/chunk-F6A6MQ6G.js.map +7 -0
- package/dist/chunks/{chunk-IR3PIHJM.js → chunk-FK73YJKV.js} +67 -2
- package/dist/chunks/chunk-FK73YJKV.js.map +7 -0
- package/dist/chunks/{chunk-VYQV5JRT.js → chunk-GJVKEHDL.js} +2 -2
- package/dist/chunks/chunk-GJVKEHDL.js.map +7 -0
- package/dist/chunks/{chunk-TIIIHPHF.js → chunk-GS67KDMV.js} +2 -2
- package/dist/chunks/{chunk-D5NYNIST.js → chunk-H57KPL3V.js} +5 -5
- package/dist/chunks/{chunk-KVYNGDGC.js → chunk-HFDJWLMS.js} +6 -6
- package/dist/chunks/{chunk-KVYNGDGC.js.map → chunk-HFDJWLMS.js.map} +1 -1
- package/dist/chunks/{chunk-INRXG4J5.js → chunk-HGD75NZY.js} +2 -2
- package/dist/chunks/{chunk-CRRUW26I.js → chunk-HRDMBGMY.js} +12 -12
- package/dist/chunks/{chunk-CRRUW26I.js.map → chunk-HRDMBGMY.js.map} +2 -2
- package/dist/chunks/{chunk-MLLYR3Y6.js → chunk-HSEZPCL5.js} +19 -78
- package/dist/chunks/chunk-HSEZPCL5.js.map +7 -0
- package/dist/chunks/{chunk-LNASO4VT.js → chunk-IOGDTIGN.js} +44 -19
- package/dist/chunks/chunk-IOGDTIGN.js.map +7 -0
- package/dist/chunks/chunk-JMUUNW2H.js +65 -0
- package/dist/chunks/chunk-JMUUNW2H.js.map +7 -0
- package/dist/chunks/{chunk-UXIBKMUM.js → chunk-KIFOEBYJ.js} +4 -4
- package/dist/chunks/{chunk-SPCJXN4K.js → chunk-LKYLD5SN.js} +298 -65
- package/dist/chunks/chunk-LKYLD5SN.js.map +7 -0
- package/dist/chunks/{chunk-FUY6XVRX.js → chunk-MPMEK3IQ.js} +2 -2
- package/dist/chunks/{chunk-HP5P7NBO.js → chunk-MSDL7U6Q.js} +4 -4
- package/dist/chunks/chunk-N7ZAK2PB.js +132 -0
- package/dist/chunks/chunk-N7ZAK2PB.js.map +7 -0
- package/dist/chunks/{chunk-VSDUSNIA.js → chunk-NBIYYMKS.js} +8 -2
- package/dist/chunks/chunk-NBIYYMKS.js.map +7 -0
- package/dist/chunks/chunk-NENQZCGW.js +45 -0
- package/dist/chunks/chunk-NENQZCGW.js.map +7 -0
- package/dist/chunks/chunk-NJHJKINP.js +47 -0
- package/dist/chunks/chunk-NJHJKINP.js.map +7 -0
- package/dist/chunks/{chunk-U366I5K2.js → chunk-NQ7IWEIF.js} +18 -6
- package/dist/chunks/chunk-NQ7IWEIF.js.map +7 -0
- package/dist/chunks/{chunk-ZQMBS5SH.js → chunk-OJ4HAALD.js} +15 -12
- package/dist/chunks/chunk-OJ4HAALD.js.map +7 -0
- package/dist/chunks/chunk-OZCJU3PZ.js +33 -0
- package/dist/chunks/chunk-OZCJU3PZ.js.map +7 -0
- package/dist/chunks/chunk-P3DCXKL3.js +40 -0
- package/dist/chunks/chunk-P3DCXKL3.js.map +7 -0
- package/dist/chunks/chunk-P7YSPKTM.js +294 -0
- package/dist/chunks/chunk-P7YSPKTM.js.map +7 -0
- package/dist/chunks/chunk-PQVUMJ5J.js +223 -0
- package/dist/chunks/chunk-PQVUMJ5J.js.map +7 -0
- package/dist/chunks/chunk-PUBHBEYO.js +84 -0
- package/dist/chunks/chunk-PUBHBEYO.js.map +7 -0
- package/dist/chunks/{chunk-P4KH4S4S.js → chunk-QGTD3LAZ.js} +5 -20
- package/dist/chunks/chunk-QGTD3LAZ.js.map +7 -0
- package/dist/chunks/{chunk-TIJ3YQXX.js → chunk-QOEOKW2X.js} +2 -2
- package/dist/chunks/{chunk-TIJ3YQXX.js.map → chunk-QOEOKW2X.js.map} +1 -1
- package/dist/chunks/{chunk-QT4W5YVB.js → chunk-RAA3FAYZ.js} +2 -2
- package/dist/chunks/{chunk-WJJXODAB.js → chunk-RLKRZXSX.js} +8 -1
- package/dist/chunks/{chunk-WJJXODAB.js.map → chunk-RLKRZXSX.js.map} +2 -2
- package/dist/chunks/chunk-RWKQ5SRW.js +129 -0
- package/dist/chunks/chunk-RWKQ5SRW.js.map +7 -0
- package/dist/chunks/chunk-SW25R47N.js +71 -0
- package/dist/chunks/chunk-SW25R47N.js.map +7 -0
- package/dist/chunks/{chunk-EFETPXU2.js → chunk-TJZYM2SP.js} +118 -237
- package/dist/chunks/chunk-TJZYM2SP.js.map +7 -0
- package/dist/chunks/{chunk-53N2I4QA.js → chunk-TXCNZCZP.js} +2 -2
- package/dist/chunks/chunk-UD7LFV43.js +28 -0
- package/dist/chunks/chunk-UD7LFV43.js.map +7 -0
- package/dist/chunks/{chunk-ASSLHWZS.js → chunk-UFMYN5TA.js} +2 -2
- package/dist/chunks/{chunk-7QKKLBHJ.js → chunk-UPMWLOKL.js} +10 -1
- package/dist/chunks/{chunk-7QKKLBHJ.js.map → chunk-UPMWLOKL.js.map} +2 -2
- package/dist/chunks/chunk-V4OW2ULC.js +422 -0
- package/dist/chunks/chunk-V4OW2ULC.js.map +7 -0
- package/dist/chunks/{chunk-FE6NOAO7.js → chunk-VNWQIGQL.js} +1820 -649
- package/dist/chunks/chunk-VNWQIGQL.js.map +7 -0
- package/dist/chunks/{chunk-PYFJW3HC.js → chunk-W5FEHVZA.js} +2 -16
- package/dist/chunks/{chunk-PYFJW3HC.js.map → chunk-W5FEHVZA.js.map} +3 -3
- package/dist/chunks/{chunk-XCEEQ5AB.js → chunk-WGMCNCP6.js} +1567 -1564
- package/dist/chunks/chunk-WGMCNCP6.js.map +7 -0
- package/dist/chunks/chunk-WKFRGICG.js +101 -0
- package/dist/chunks/chunk-WKFRGICG.js.map +7 -0
- package/dist/chunks/{chunk-3UGN25XS.js → chunk-WWTGWGH7.js} +80 -1662
- package/dist/chunks/chunk-WWTGWGH7.js.map +7 -0
- package/dist/chunks/{chunk-5UBRGTVN.js → chunk-X7QETPBC.js} +31 -15
- package/dist/chunks/chunk-X7QETPBC.js.map +7 -0
- package/dist/chunks/{chunk-LEU5CDSL.js → chunk-XFOSUGLU.js} +5 -5
- package/dist/chunks/{chunk-MZUC6LLH.js → chunk-XMYG2TKR.js} +4 -4
- package/dist/chunks/{chunk-MZUC6LLH.js.map → chunk-XMYG2TKR.js.map} +1 -1
- package/dist/chunks/chunk-YC65P7ZO.js +57 -0
- package/dist/chunks/chunk-YC65P7ZO.js.map +7 -0
- package/dist/chunks/{chunk-EKODKR6Y.js → chunk-YHFWMAQ5.js} +1 -24
- package/dist/chunks/chunk-YHFWMAQ5.js.map +7 -0
- package/dist/chunks/{chunk-C7Z6F3SO.js → chunk-ZFWICFNJ.js} +27 -20
- package/dist/chunks/{chunk-C7Z6F3SO.js.map → chunk-ZFWICFNJ.js.map} +2 -2
- package/dist/cli/decisions.d.ts.map +1 -1
- package/dist/cli/decisions.js +15 -3
- package/dist/cli/decisions.js.map +2 -2
- package/dist/cli/mesh.js +4 -3
- package/dist/cli/mesh.js.map +1 -1
- package/dist/commands/fabric-handler.d.ts +7 -0
- package/dist/commands/fabric-handler.d.ts.map +1 -0
- package/dist/commands/fabric-handler.js +916 -0
- package/dist/commands/fabric-handler.js.map +7 -0
- package/dist/commands/fabric.d.ts +11 -1
- package/dist/commands/fabric.d.ts.map +1 -1
- package/dist/compaction/claim-events.d.ts +61 -0
- package/dist/compaction/claim-events.d.ts.map +1 -0
- package/dist/compaction/claim-events.js +210 -0
- package/dist/compaction/claim-events.js.map +7 -0
- package/dist/compaction/claim.d.ts +51 -0
- package/dist/compaction/claim.d.ts.map +1 -0
- package/dist/compaction/hook.d.ts +28 -2
- package/dist/compaction/hook.d.ts.map +1 -1
- package/dist/compaction/hook.js +12 -7
- package/dist/compaction/owner.js +9 -8
- package/dist/compaction/trace-events.d.ts +1 -1
- package/dist/compaction/trace-events.d.ts.map +1 -1
- package/dist/components/configuration.js +6 -6
- package/dist/components/effect-scope.d.ts.map +1 -1
- package/dist/config.d.ts +39 -2
- package/dist/config.d.ts.map +1 -1
- package/dist/core/action-arguments.d.ts.map +1 -1
- package/dist/core/action-policy-hooks.d.ts +69 -0
- package/dist/core/action-policy-hooks.d.ts.map +1 -0
- package/dist/core/action-registry.d.ts +31 -10
- package/dist/core/action-registry.d.ts.map +1 -1
- package/dist/core/action-registry.js +12 -9
- package/dist/core/approval-controller.d.ts +23 -3
- package/dist/core/approval-controller.d.ts.map +1 -1
- package/dist/core/atomic-write.d.ts +164 -0
- package/dist/core/atomic-write.d.ts.map +1 -1
- package/dist/core/child-tool-allowlist.d.ts +17 -1
- package/dist/core/child-tool-allowlist.d.ts.map +1 -1
- package/dist/core/compact-controller.d.ts +34 -0
- package/dist/core/compact-controller.d.ts.map +1 -1
- package/dist/core/core-override-guidance.d.ts +3 -1
- package/dist/core/core-override-guidance.d.ts.map +1 -1
- package/dist/core/file-lock.d.ts.map +1 -1
- package/dist/core/foreground-tools.d.ts +4 -1
- package/dist/core/foreground-tools.d.ts.map +1 -1
- package/dist/core/host-policy.d.ts +43 -0
- package/dist/core/host-policy.d.ts.map +1 -0
- package/dist/core/host-sdk-runtime.d.ts.map +1 -1
- package/dist/core/host-sdk.d.ts.map +1 -1
- package/dist/core/host-sdk.js +1 -1
- package/dist/core/managed-host-guidance.d.ts +5 -0
- package/dist/core/managed-host-guidance.d.ts.map +1 -0
- package/dist/core/model-aliases.d.ts +22 -0
- package/dist/core/model-aliases.d.ts.map +1 -0
- package/dist/core/model-resolution.d.ts +41 -20
- package/dist/core/model-resolution.d.ts.map +1 -1
- package/dist/core/native-tool-result.d.ts +1 -0
- package/dist/core/native-tool-result.d.ts.map +1 -1
- package/dist/core/program-tasks.d.ts +52 -0
- package/dist/core/program-tasks.d.ts.map +1 -0
- package/dist/core/prompt-guidance.d.ts +5 -0
- package/dist/core/prompt-guidance.d.ts.map +1 -0
- package/dist/core/prompt-guidance.js +159 -0
- package/dist/core/prompt-guidance.js.map +7 -0
- package/dist/core/provider-operations.d.ts.map +1 -1
- package/dist/core/provider-operations.js +60 -108
- package/dist/core/provider-operations.js.map +3 -3
- package/dist/core/shell-inbox.d.ts.map +1 -1
- package/dist/core/shell-jobs.d.ts +7 -5
- package/dist/core/shell-jobs.d.ts.map +1 -1
- package/dist/core/shell-timing.d.ts.map +1 -1
- package/dist/core/skill-prompt.d.ts +1 -1
- package/dist/core/skill-prompt.d.ts.map +1 -1
- package/dist/core/skill-references.d.ts +1 -1
- package/dist/core/skill-references.d.ts.map +1 -1
- package/dist/core/system-guidance.d.ts.map +1 -1
- package/dist/core/tool-result-proxy.d.ts.map +1 -1
- package/dist/decisions/command.d.ts +2 -1
- package/dist/decisions/command.d.ts.map +1 -1
- package/dist/decisions/command.js +40 -12
- package/dist/decisions/command.js.map +2 -2
- package/dist/decisions/events.d.ts +12 -0
- package/dist/decisions/events.d.ts.map +1 -0
- package/dist/decisions/events.js +130 -0
- package/dist/decisions/events.js.map +7 -0
- package/dist/decisions/host.d.ts +31 -3
- package/dist/decisions/host.d.ts.map +1 -1
- package/dist/decisions/render.d.ts +44 -0
- package/dist/decisions/render.d.ts.map +1 -0
- package/dist/decisions/store.d.ts +8 -0
- package/dist/decisions/store.d.ts.map +1 -1
- package/dist/durable/agent.d.ts +8 -0
- package/dist/durable/agent.d.ts.map +1 -1
- package/dist/durable/extension-load-error.d.ts +8 -0
- package/dist/durable/extension-load-error.d.ts.map +1 -0
- package/dist/durable/session.d.ts +1 -0
- package/dist/durable/session.d.ts.map +1 -1
- package/dist/durable/worker-host.d.ts +10 -1
- package/dist/durable/worker-host.d.ts.map +1 -1
- package/dist/durable/worker-host.js +10 -1181
- package/dist/durable/worker-host.js.map +4 -4
- package/dist/durable/worker-options.d.ts +3 -0
- package/dist/durable/worker-options.d.ts.map +1 -1
- package/dist/durable/worker-role-seed.d.ts +82 -0
- package/dist/durable/worker-role-seed.d.ts.map +1 -0
- package/dist/durable/worker.js +43 -4
- package/dist/durable/worker.js.map +2 -2
- package/dist/durable-controls.d.ts.map +1 -1
- package/dist/durable-extension-wasm.d.ts +8 -0
- package/dist/durable-extension-wasm.d.ts.map +1 -0
- package/dist/durable-extension-wasm.js +32 -0
- package/dist/durable-extension-wasm.js.map +7 -0
- package/dist/durable-extension.d.ts +94 -0
- package/dist/durable-extension.d.ts.map +1 -0
- package/dist/durable-extension.js +649 -0
- package/dist/durable-extension.js.map +7 -0
- package/dist/durable-host.d.ts +8 -0
- package/dist/durable-host.d.ts.map +1 -0
- package/dist/durable-host.js +20 -0
- package/dist/durable-host.js.map +7 -0
- package/dist/durable-journal.d.ts +94 -0
- package/dist/durable-journal.d.ts.map +1 -0
- package/dist/durable.d.ts.map +1 -1
- package/dist/durable.js +10 -8
- package/dist/durable.js.map +2 -2
- package/dist/entropy/index.js +12 -10
- package/dist/entropy/pool-store.d.ts.map +1 -1
- package/dist/execution-service.d.ts +14 -0
- package/dist/execution-service.d.ts.map +1 -1
- package/dist/extension-bootstrap.d.ts.map +1 -1
- package/dist/extension-bootstrap.js +28 -27
- package/dist/extension-bootstrap.js.map +2 -2
- package/dist/extension-copy.d.ts +21 -0
- package/dist/extension-copy.d.ts.map +1 -0
- package/dist/extension-copy.js +90 -0
- package/dist/extension-copy.js.map +7 -0
- package/dist/extension.d.ts +1 -1
- package/dist/extension.d.ts.map +1 -1
- package/dist/fabric-exec-arguments.d.ts.map +1 -1
- package/dist/fabric-exec-tool.d.ts +2 -1
- package/dist/fabric-exec-tool.d.ts.map +1 -1
- package/dist/fabric-runtime-state.d.ts +19 -0
- package/dist/fabric-runtime-state.d.ts.map +1 -1
- package/dist/fabric-runtime-state.js +2125 -786
- package/dist/fabric-runtime-state.js.map +4 -4
- package/dist/fabric-state.d.ts +44 -1
- package/dist/fabric-state.d.ts.map +1 -1
- package/dist/index.d.ts +5 -3
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +88 -53
- package/dist/index.js.map +2 -2
- package/dist/jev/client.js +2 -2
- package/dist/jev/manager.d.ts +3 -0
- package/dist/jev/manager.d.ts.map +1 -1
- package/dist/jev/observation.d.ts +1 -1
- package/dist/jev/observation.js +6 -6
- package/dist/jev-fabric/bridge.d.ts.map +1 -1
- package/dist/jev.js +11 -12
- package/dist/managed-host.d.ts +13 -0
- package/dist/managed-host.d.ts.map +1 -1
- package/dist/memory/digest.js +2 -2
- package/dist/memory/discovery.js +6 -7
- package/dist/memory/file-worker.js +10 -11
- package/dist/memory/file-worker.js.map +1 -1
- package/dist/memory/normalize.js +5 -6
- package/dist/memory/search.js +7 -8
- package/dist/memory/worker-provider.js +11 -12
- package/dist/memory.js +11 -12
- package/dist/memory.js.map +1 -1
- package/dist/mesh/grants.d.ts +3 -3
- package/dist/mesh/grants.d.ts.map +1 -1
- package/dist/mesh/store.d.ts +8 -0
- package/dist/mesh/store.d.ts.map +1 -1
- package/dist/native-codemode.d.ts.map +1 -1
- package/dist/native-tool-catalog.d.ts.map +1 -1
- package/dist/native-tool-catalog.js +12 -3
- package/dist/native-tool-catalog.js.map +2 -2
- package/dist/programs/host.d.ts +18 -6
- package/dist/programs/host.d.ts.map +1 -1
- package/dist/programs/host.js +71 -47
- package/dist/programs/host.js.map +2 -2
- package/dist/programs/source.d.ts +11 -0
- package/dist/programs/source.d.ts.map +1 -1
- package/dist/programs/store.d.ts.map +1 -1
- package/dist/protocol.d.ts +504 -8
- package/dist/protocol.d.ts.map +1 -1
- package/dist/protocol.js +41 -11
- package/dist/provider-globals.d.ts +13 -0
- package/dist/provider-globals.d.ts.map +1 -0
- package/dist/providers/agents-actions.d.ts.map +1 -1
- package/dist/providers/agents-provider.d.ts +3 -0
- package/dist/providers/agents-provider.d.ts.map +1 -1
- package/dist/providers/captured-tools-provider.d.ts +5 -0
- package/dist/providers/captured-tools-provider.d.ts.map +1 -1
- package/dist/providers/compact-provider.d.ts +4 -1
- package/dist/providers/compact-provider.d.ts.map +1 -1
- package/dist/providers/components-provider.d.ts.map +1 -1
- package/dist/providers/decisions-provider.d.ts +9 -1
- package/dist/providers/decisions-provider.d.ts.map +1 -1
- package/dist/providers/jev-provider.d.ts +1 -1
- package/dist/providers/jev-provider.js +11 -12
- package/dist/providers/memory-provider.js +10 -11
- package/dist/providers/pi-tools-provider.d.ts +14 -0
- package/dist/providers/pi-tools-provider.d.ts.map +1 -1
- package/dist/providers/programs-provider.d.ts.map +1 -1
- package/dist/providers/sessions-provider.d.ts +7 -0
- package/dist/providers/sessions-provider.d.ts.map +1 -1
- package/dist/repeat-guard.d.ts +7 -6
- package/dist/repeat-guard.d.ts.map +1 -1
- package/dist/residency/actor-client.js +3 -3
- package/dist/residency/client.d.ts +15 -0
- package/dist/residency/client.d.ts.map +1 -1
- package/dist/residency/host.d.ts.map +1 -1
- package/dist/residency/host.js +34 -23
- package/dist/residency/launcher.js +1 -1
- package/dist/residency/pi-entry.js +34 -23
- 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/runners.js +11 -1
- package/dist/runners.js.map +2 -2
- package/dist/runtime/core-override-guest-types.js +2 -2
- package/dist/runtime/cpython-child-source.d.ts.map +1 -1
- package/dist/runtime/cpython-runtime.d.ts.map +1 -1
- package/dist/runtime/cpython-runtime.js +51 -21
- package/dist/runtime/cpython-runtime.js.map +2 -2
- package/dist/runtime/deadline-pause.d.ts +2 -0
- package/dist/runtime/deadline-pause.d.ts.map +1 -1
- package/dist/runtime/dynamic-guest-types.d.ts.map +1 -1
- package/dist/runtime/dynamic-guest-types.js +2 -1
- package/dist/runtime/exec-journal.d.ts +73 -0
- package/dist/runtime/exec-journal.d.ts.map +1 -0
- package/dist/runtime/exec-journal.js +335 -0
- package/dist/runtime/exec-journal.js.map +7 -0
- package/dist/runtime/guest-types.d.ts +3 -2
- package/dist/runtime/guest-types.d.ts.map +1 -1
- package/dist/runtime/guest-types.js +1 -1
- package/dist/runtime/journal-shim.d.ts +3 -0
- package/dist/runtime/journal-shim.d.ts.map +1 -0
- package/dist/runtime/kernel.d.ts +95 -1
- package/dist/runtime/kernel.d.ts.map +1 -1
- package/dist/runtime/monty-bridge.d.ts +6 -2
- package/dist/runtime/monty-bridge.d.ts.map +1 -1
- package/dist/runtime/monty-runtime.d.ts.map +1 -1
- package/dist/runtime/monty-runtime.js +27 -15
- package/dist/runtime/monty-runtime.js.map +2 -2
- package/dist/runtime/native-codemode-guest.d.ts.map +1 -1
- package/dist/runtime/node-process-runtime.d.ts.map +1 -1
- package/dist/runtime/node-process-runtime.js +7 -5
- package/dist/runtime/quickjs-runtime.d.ts +7 -1
- package/dist/runtime/quickjs-runtime.d.ts.map +1 -1
- package/dist/runtime/quickjs-runtime.js +5 -4
- package/dist/runtime/sha256.d.ts +4 -0
- package/dist/runtime/sha256.d.ts.map +1 -0
- package/dist/runtime/transpile.d.ts +8 -0
- package/dist/runtime/transpile.d.ts.map +1 -0
- package/dist/runtime/type-checker.d.ts +1 -7
- package/dist/runtime/type-checker.d.ts.map +1 -1
- package/dist/runtime/type-checker.js +4 -2
- package/dist/runtime/typescript-kernel.js +13 -10
- package/dist/runtime/typescript-kernel.js.map +1 -1
- package/dist/runtime-state-builtins.d.ts.map +1 -1
- package/dist/speculation/scanner.js +1 -1
- package/dist/speculation/store.d.ts +7 -16
- package/dist/speculation/store.d.ts.map +1 -1
- package/dist/speculation/types.d.ts +1 -0
- package/dist/speculation/types.d.ts.map +1 -1
- package/dist/storage/retention.d.ts.map +1 -1
- package/dist/topology/participant-directory.d.ts +26 -1
- package/dist/topology/participant-directory.d.ts.map +1 -1
- package/dist/topology/peer-presence.d.ts.map +1 -1
- package/dist/topology/peer-settle.js +11 -0
- package/dist/topology/peer-settle.js.map +7 -0
- package/dist/topology/session-label-settings.d.ts +13 -0
- package/dist/topology/session-label-settings.d.ts.map +1 -0
- package/dist/topology/session-label.d.ts +60 -0
- package/dist/topology/session-label.d.ts.map +1 -0
- package/dist/topology/types.d.ts +27 -0
- package/dist/topology/types.d.ts.map +1 -1
- package/dist/type-error-guidance.js +1 -1
- package/dist/ui/controller.d.ts +1 -0
- 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 +3 -2
- package/dist/ui/conversation-commands.d.ts +1 -1
- package/dist/ui/conversation-commands.d.ts.map +1 -1
- package/dist/ui/conversation-native-reader.js +2 -2
- package/dist/ui/conversation-selection.d.ts +4 -1
- package/dist/ui/conversation-selection.d.ts.map +1 -1
- package/dist/ui/conversation-targets.d.ts.map +1 -1
- package/dist/ui/conversation-targets.js +2 -2
- package/dist/ui/conversation.d.ts +25 -24
- package/dist/ui/conversation.d.ts.map +1 -1
- package/dist/ui/conversation.js +170 -339
- package/dist/ui/conversation.js.map +2 -2
- package/dist/ui/core-tool-render.d.ts +1 -0
- package/dist/ui/core-tool-render.d.ts.map +1 -1
- package/dist/ui/dashboard.d.ts.map +1 -1
- package/dist/ui/dashboard.js +17 -13
- package/dist/ui/dashboard.js.map +2 -2
- package/dist/ui/fabric-render.d.ts +6 -0
- package/dist/ui/fabric-render.d.ts.map +1 -1
- package/dist/ui/footer-dock.d.ts +48 -0
- package/dist/ui/footer-dock.d.ts.map +1 -0
- package/dist/ui/format.d.ts +7 -0
- package/dist/ui/format.d.ts.map +1 -1
- package/dist/ui/settings-sections-lifecycle.d.ts.map +1 -1
- package/dist/ui/settings-sections-presentation.d.ts.map +1 -1
- package/dist/ui/settings-values.d.ts +1 -0
- package/dist/ui/settings-values.d.ts.map +1 -1
- package/dist/ui/settings.js +59 -18
- package/dist/ui/settings.js.map +2 -2
- package/dist/ui/shell-hang-keys.d.ts +8 -1
- package/dist/ui/shell-hang-keys.d.ts.map +1 -1
- package/dist/ui/shell-tasks.d.ts +2 -2
- package/dist/ui/shell-tasks.d.ts.map +1 -1
- package/dist/ui/shell-tasks.js +27 -94
- package/dist/ui/shell-tasks.js.map +2 -2
- package/dist/ui/snapshot.d.ts.map +1 -1
- package/dist/ui/terminal-title.d.ts +41 -0
- package/dist/ui/terminal-title.d.ts.map +1 -0
- package/dist/ui/types.d.ts +4 -0
- package/dist/ui/types.d.ts.map +1 -1
- package/dist/ui/widget-keys.d.ts +5 -0
- package/dist/ui/widget-keys.d.ts.map +1 -0
- package/dist/ui/widget.d.ts +34 -16
- package/dist/ui/widget.d.ts.map +1 -1
- package/dist/ui/word-diff/line-emphasis.js +1603 -0
- package/dist/ui/word-diff/line-emphasis.js.map +7 -0
- package/dist/util.d.ts +2 -0
- package/dist/util.d.ts.map +1 -1
- package/dist/verified/authority.d.ts +2 -2
- package/dist/verified/authority.d.ts.map +1 -1
- package/dist/verified/budget.d.ts +4 -0
- package/dist/verified/budget.d.ts.map +1 -0
- package/dist/verified/generated/actor-name.d.ts +4 -0
- package/dist/verified/generated/actor-name.js +17 -0
- package/dist/verified/generated/authority.d.ts +4 -0
- package/dist/verified/generated/authority.js +28 -0
- package/dist/verified/generated/budget.d.ts +4 -0
- package/dist/verified/generated/budget.js +17 -0
- package/dist/verified/generated/compaction.d.ts +4 -0
- package/dist/verified/generated/compaction.js +19 -0
- package/dist/verified/generated/grants.d.ts +4 -0
- package/dist/verified/generated/grants.js +17 -0
- package/dist/verified/generated/lifecycle.d.ts +4 -0
- package/dist/verified/generated/lifecycle.js +50 -0
- package/dist/verified/generated/manifest.json +137 -48
- package/dist/verified/generated/policy.d.ts +17 -0
- package/dist/verified/generated/policy.js +211 -0
- package/dist/verified/generated/provider.d.ts +4 -0
- package/dist/verified/generated/provider.js +18 -0
- package/dist/verified/generated/resources.d.ts +6 -0
- package/dist/verified/generated/resources.js +73 -0
- package/dist/verified/generated/speculation.d.ts +6 -0
- package/dist/verified/generated/speculation.js +48 -0
- package/dist/verified/generated/storage.d.ts +4 -0
- package/dist/verified/generated/storage.js +18 -0
- package/dist/verified/grants.d.ts +22 -0
- package/dist/verified/grants.d.ts.map +1 -0
- package/dist/verified/lifecycle.d.ts +31 -0
- package/dist/verified/lifecycle.d.ts.map +1 -0
- package/dist/verified/machine.d.ts +18 -0
- package/dist/verified/machine.d.ts.map +1 -0
- package/dist/verified/memory.d.ts +1 -1
- package/dist/verified/memory.d.ts.map +1 -1
- package/dist/verified/nat.d.ts +1 -1
- package/dist/verified/nat.d.ts.map +1 -1
- package/dist/verified/policy.d.ts +17 -5
- package/dist/verified/policy.d.ts.map +1 -1
- package/dist/verified/provider.d.ts +22 -0
- package/dist/verified/provider.d.ts.map +1 -0
- package/dist/verified/resources.d.ts +21 -7
- package/dist/verified/resources.d.ts.map +1 -1
- package/dist/verified/speculation.d.ts +36 -0
- package/dist/verified/speculation.d.ts.map +1 -0
- package/dist/verified/storage.d.ts.map +1 -1
- package/dist/worker/missing-install.d.ts +8 -0
- package/dist/worker/missing-install.d.ts.map +1 -0
- package/dist/worker/options.d.ts.map +1 -1
- package/dist/worker/options.js +25 -0
- package/dist/worker/options.js.map +2 -2
- package/dist/worker/prompt-lifecycle.d.ts +16 -0
- package/dist/worker/prompt-lifecycle.d.ts.map +1 -0
- package/dist/worker/prompt-lifecycle.js +90 -0
- package/dist/worker/prompt-lifecycle.js.map +7 -0
- package/dist/worker/questions.d.ts +15 -3
- package/dist/worker/questions.d.ts.map +1 -1
- package/dist/worker/questions.js +53 -8
- package/dist/worker/questions.js.map +2 -2
- package/dist/worker/recovery-watchdog.d.ts +22 -0
- package/dist/worker/recovery-watchdog.d.ts.map +1 -1
- package/dist/worker/recovery-watchdog.js +116 -1
- package/dist/worker/recovery-watchdog.js.map +2 -2
- package/dist/worker/result.js +1 -1
- package/dist/worker/result.js.map +2 -2
- package/dist/worker.js +131 -21
- package/dist/worker.js.map +2 -2
- package/docs/actor-name-policy-handoff.md +5 -0
- package/docs/agents.md +164 -17
- package/docs/architecture.md +5 -1
- package/docs/audit-trace.md +2 -1
- package/docs/background-tasks.md +102 -16
- package/docs/codemode-parity.md +2 -2
- package/docs/compaction.md +21 -5
- package/docs/components.md +1 -1
- package/docs/configuration.md +111 -66
- package/docs/decisions.md +92 -10
- package/docs/durable-extension.md +121 -0
- package/docs/durable-pi.md +306 -6
- package/docs/extractive-history.md +3 -1
- package/docs/interface.md +20 -17
- package/docs/jev.md +1 -1
- package/docs/kernels.md +1 -1
- package/{node_modules/pi-coralbricks-provider/LICENSE → docs/licenses/gdp-wired-mit.txt} +1 -1
- package/docs/managed-host-migration.md +50 -0
- package/docs/programmatic-compaction.md +216 -6
- package/docs/programs.md +23 -1
- package/docs/prompt-cache.md +4 -2
- package/docs/provider-capabilities.md +15 -14
- package/docs/providers.md +99 -3
- package/docs/shell-composition.md +15 -0
- package/docs/short-lock-protocol.md +90 -0
- package/docs/skills.md +5 -1
- package/docs/speculation.md +6 -0
- package/docs/verified-kernels.md +309 -220
- package/package.json +45 -24
- package/proofs/actor-name.ts +27 -0
- package/proofs/authority.ts +62 -0
- package/proofs/budget.ts +24 -0
- package/proofs/compaction.ts +51 -0
- package/proofs/grants.ts +39 -0
- package/proofs/index.ts +40 -0
- package/proofs/kernel.ts +44 -0
- package/proofs/lifecycle.ts +128 -0
- package/proofs/policy.ts +195 -0
- package/proofs/provider.ts +52 -0
- package/proofs/resources.ts +160 -0
- package/proofs/speculation.ts +69 -0
- package/proofs/storage.ts +66 -0
- package/scripts/verified-kernels.ts +141 -0
- package/skillsets/python/fabric-council/SKILL.md +92 -20
- package/skillsets/python/fabric-exec/SKILL.md +2 -2
- package/skillsets/python/fabric-exec/references/agents.md +10 -4
- package/skillsets/python/fabric-fusion/SKILL.md +1 -1
- package/skillsets/python/fabric-guide/SKILL.md +1 -1
- package/skillsets/typescript/fabric-council/SKILL.md +109 -22
- package/skillsets/typescript/fabric-exec/SKILL.md +7 -7
- package/skillsets/typescript/fabric-exec/references/agents.md +12 -3
- package/skillsets/typescript/fabric-fusion/SKILL.md +1 -1
- package/skillsets/typescript/fabric-guide/SKILL.md +1 -1
- package/LAWS.bend +0 -502
- package/PROOF.bend +0 -452
- package/dist/chunks/chunk-3UGN25XS.js.map +0 -7
- package/dist/chunks/chunk-4EW7GVUR.js.map +0 -7
- package/dist/chunks/chunk-5UBRGTVN.js.map +0 -7
- package/dist/chunks/chunk-BN7F52EG.js +0 -525
- package/dist/chunks/chunk-BN7F52EG.js.map +0 -7
- package/dist/chunks/chunk-DK35W6U7.js +0 -259
- package/dist/chunks/chunk-DK35W6U7.js.map +0 -7
- package/dist/chunks/chunk-EFETPXU2.js.map +0 -7
- package/dist/chunks/chunk-EHQQ4KCX.js.map +0 -7
- package/dist/chunks/chunk-EKODKR6Y.js.map +0 -7
- package/dist/chunks/chunk-FE6NOAO7.js.map +0 -7
- package/dist/chunks/chunk-FIDUHKMM.js.map +0 -7
- package/dist/chunks/chunk-FSB2VIRZ.js.map +0 -7
- package/dist/chunks/chunk-GIK2WNAK.js.map +0 -7
- package/dist/chunks/chunk-GO32KSEZ.js.map +0 -7
- package/dist/chunks/chunk-IR3PIHJM.js.map +0 -7
- package/dist/chunks/chunk-ITVLKXCI.js +0 -266
- package/dist/chunks/chunk-ITVLKXCI.js.map +0 -7
- package/dist/chunks/chunk-K7J2ABAZ.js.map +0 -7
- package/dist/chunks/chunk-KJZAOENY.js +0 -212
- package/dist/chunks/chunk-KJZAOENY.js.map +0 -7
- package/dist/chunks/chunk-LNASO4VT.js.map +0 -7
- package/dist/chunks/chunk-MLLYR3Y6.js.map +0 -7
- package/dist/chunks/chunk-P4KH4S4S.js.map +0 -7
- package/dist/chunks/chunk-PK4NIJEV.js.map +0 -7
- package/dist/chunks/chunk-Q2JQ3RYZ.js +0 -99
- package/dist/chunks/chunk-Q2JQ3RYZ.js.map +0 -7
- package/dist/chunks/chunk-R2XQ6AHT.js.map +0 -7
- package/dist/chunks/chunk-ROTCDDOV.js.map +0 -7
- package/dist/chunks/chunk-SPCJXN4K.js.map +0 -7
- package/dist/chunks/chunk-U366I5K2.js.map +0 -7
- package/dist/chunks/chunk-UKMQK5VP.js +0 -231
- package/dist/chunks/chunk-UKMQK5VP.js.map +0 -7
- package/dist/chunks/chunk-UOM37PE4.js.map +0 -7
- package/dist/chunks/chunk-UTOBAZ5T.js.map +0 -7
- package/dist/chunks/chunk-VSDUSNIA.js.map +0 -7
- package/dist/chunks/chunk-VTK2FEH7.js +0 -229
- package/dist/chunks/chunk-VTK2FEH7.js.map +0 -7
- package/dist/chunks/chunk-VYQV5JRT.js.map +0 -7
- package/dist/chunks/chunk-XCEEQ5AB.js.map +0 -7
- package/dist/chunks/chunk-ZLNJDTCN.js +0 -226
- package/dist/chunks/chunk-ZLNJDTCN.js.map +0 -7
- package/dist/chunks/chunk-ZQMBS5SH.js.map +0 -7
- package/dist/ui/conversation-shortcut.d.ts +0 -3
- package/dist/ui/conversation-shortcut.d.ts.map +0 -1
- package/dist/ui/widget-activity.d.ts +0 -21
- package/dist/ui/widget-activity.d.ts.map +0 -1
- package/dist/verified/generated/authority-kernel.d.ts +0 -10
- package/dist/verified/generated/authority-kernel.js +0 -127
- package/dist/verified/generated/kernel.d.ts +0 -31
- package/dist/verified/generated/kernel.js +0 -389
- package/dist/verified/generated/lifecycle-kernel.d.ts +0 -7
- package/dist/verified/generated/lifecycle-kernel.js +0 -164
- package/dist/verified/generated/provider-kernel.d.ts +0 -9
- package/dist/verified/generated/provider-kernel.js +0 -87
- package/dist/verified/generated/storage-kernel.d.ts +0 -11
- package/dist/verified/generated/storage-kernel.js +0 -107
- package/docs/licenses/bend-apache-2.0.txt +0 -202
- package/node_modules/pi-coralbricks-provider/README.md +0 -306
- package/node_modules/pi-coralbricks-provider/auth.ts +0 -30
- package/node_modules/pi-coralbricks-provider/custom-models.json +0 -1
- package/node_modules/pi-coralbricks-provider/deprecated-models.json +0 -1
- package/node_modules/pi-coralbricks-provider/guard.ts +0 -155
- package/node_modules/pi-coralbricks-provider/index.ts +0 -662
- package/node_modules/pi-coralbricks-provider/models.json +0 -88
- package/node_modules/pi-coralbricks-provider/package.json +0 -74
- package/node_modules/pi-coralbricks-provider/park.ts +0 -122
- package/node_modules/pi-coralbricks-provider/patch.json +0 -34
- package/node_modules/pi-coralbricks-provider/scripts/update-models.js +0 -658
- package/node_modules/pi-coralbricks-provider/settings.ts +0 -143
- package/node_modules/pi-coralbricks-provider/sync-policy.ts +0 -309
- package/proofs/abi.json +0 -308
- package/proofs/authority-abi.json +0 -7
- package/proofs/authority-kernel.bend +0 -23
- package/proofs/authority-proof.bend +0 -74
- package/proofs/authority-spec.bend +0 -30
- package/proofs/authority-state.bend +0 -43
- package/proofs/authority-types.d.ts +0 -3
- package/proofs/kernel.bend +0 -139
- package/proofs/lifecycle-abi.json +0 -3
- package/proofs/lifecycle-kernel.bend +0 -11
- package/proofs/lifecycle-proof.bend +0 -249
- package/proofs/lifecycle-spec.bend +0 -261
- package/proofs/lifecycle-types.d.ts +0 -4
- package/proofs/lifecycle.bend +0 -119
- package/proofs/provider-abi.json +0 -4
- package/proofs/provider-kernel.bend +0 -14
- package/proofs/provider-plans.bend +0 -28
- package/proofs/provider-spec.bend +0 -14
- package/proofs/provider-types.d.ts +0 -5
- package/proofs/resource-proof.bend +0 -633
- package/proofs/resource-spec.bend +0 -133
- package/proofs/resources.bend +0 -160
- package/proofs/state-kernel.bend +0 -17
- package/proofs/state-plans.bend +0 -40
- package/proofs/state-proof.bend +0 -42
- package/proofs/state-spec.bend +0 -26
- package/proofs/storage-abi.json +0 -3
- package/proofs/storage-kernel.bend +0 -11
- package/proofs/storage-plans.bend +0 -100
- package/proofs/storage-proof.bend +0 -176
- package/proofs/storage-spec.bend +0 -70
- package/proofs/storage-types.d.ts +0 -8
- package/proofs/types.d.ts +0 -7
- package/scripts/test-verified-kernels.mjs +0 -107
- package/scripts/verified-kernels.mjs +0 -176
- /package/dist/chunks/{chunk-3FJUP3GV.js.map → chunk-36XQFTEN.js.map} +0 -0
- /package/dist/chunks/{chunk-ZEXCKK4K.js.map → chunk-4WKD3YM3.js.map} +0 -0
- /package/dist/chunks/{chunk-5XBYFSI5.js.map → chunk-7YNE4NB2.js.map} +0 -0
- /package/dist/chunks/{chunk-K6QXUGS5.js.map → chunk-BMAEZNZ5.js.map} +0 -0
- /package/dist/chunks/{chunk-CCHZXF6K.js.map → chunk-CXYJJ3HZ.js.map} +0 -0
- /package/dist/chunks/{chunk-TIIIHPHF.js.map → chunk-GS67KDMV.js.map} +0 -0
- /package/dist/chunks/{chunk-D5NYNIST.js.map → chunk-H57KPL3V.js.map} +0 -0
- /package/dist/chunks/{chunk-INRXG4J5.js.map → chunk-HGD75NZY.js.map} +0 -0
- /package/dist/chunks/{chunk-UXIBKMUM.js.map → chunk-KIFOEBYJ.js.map} +0 -0
- /package/dist/chunks/{chunk-FUY6XVRX.js.map → chunk-MPMEK3IQ.js.map} +0 -0
- /package/dist/chunks/{chunk-HP5P7NBO.js.map → chunk-MSDL7U6Q.js.map} +0 -0
- /package/dist/chunks/{chunk-QT4W5YVB.js.map → chunk-RAA3FAYZ.js.map} +0 -0
- /package/dist/chunks/{chunk-53N2I4QA.js.map → chunk-TXCNZCZP.js.map} +0 -0
- /package/dist/chunks/{chunk-ASSLHWZS.js.map → chunk-UFMYN5TA.js.map} +0 -0
- /package/dist/chunks/{chunk-LEU5CDSL.js.map → chunk-XFOSUGLU.js.map} +0 -0
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
{
|
|
2
|
+
"version": 3,
|
|
3
|
+
"sources": ["../../../src/ui/word-diff/normalize.ts", "../../../src/ui/word-diff/tokens.ts", "../../../src/ui/word-diff/changed-line.ts", "../../../src/ui/word-diff/alignment.ts", "../../../src/ui/word-diff/line-similarity.ts", "../../../src/ui/word-diff/sparse-line-matching.ts", "../../../src/ui/word-diff/line-matching.ts", "../../../src/ui/word-diff/ranges.ts", "../../../src/ui/word-diff/text-boundaries.ts", "../../../src/ui/word-diff/token-alignment.ts", "../../../src/ui/word-diff/token-text-refinement.ts", "../../../src/ui/word-diff/range-refinement.ts", "../../../src/ui/word-diff/smart-filter.ts", "../../../src/ui/word-diff/emphasis.ts", "../../../src/ui/word-diff/change-block.ts", "../../../src/ui/word-diff/line-emphasis.ts"],
|
|
4
|
+
"sourcesContent": ["export const expandPreviewTabs = (text: string): string => text.replace(/\\t/g, \" \");\n\nexport const escapeControlChars = (text: string): string =>\n text\n .replace(/\\x1b/g, \"\u241B\")\n .replace(/\\r/g, \"\u240D\")\n .replace(/[\\x00-\\x08\\x0b\\x0c\\x0e-\\x1f\\x7f-\\x9f]/g, \"\uFFFD\");\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nexport type WordEmphasisToken = {\n value: string;\n start: number;\n end: number;\n};\n\nconst WORD_TOKEN_PATTERN =\n /[$_\\p{L}][$_\\p{L}\\p{N}\\p{Mark}]*|\\p{N}+(?:\\.\\p{N}+)?|===|!==|=>|==|!=|<=|>=|&&|\\|\\||[^\\s]/gu;\nconst IDENTIFIER_TOKEN_PATTERN = /^[$_\\p{L}][$_\\p{L}\\p{N}\\p{Mark}]*$/u;\nconst NUMBER_TOKEN_PATTERN = /^\\p{N}+(?:\\.\\p{N}+)?$/u;\nconst SYMBOL_TOKEN_PATTERN = /^\\p{S}+$/u;\nconst MEANINGFUL_OPERATOR_TOKEN_PATTERN =\n /^(?:===|!==|=>|==|!=|<=|>=|&&|\\|\\||[+\\-*\\/%<>=!?:~&|^]+)$/;\nconst DOMAIN_SEPARATOR_TOKEN_PATTERN = /^[-/:@#]$/;\nconst STRUCTURAL_PUNCTUATION_TOKEN_PATTERN = /^[{}()[\\].,;]$/;\n\nexport function wordEmphasisTokens(text: string): WordEmphasisToken[] {\n const tokens: WordEmphasisToken[] = [];\n for (const match of text.matchAll(WORD_TOKEN_PATTERN)) {\n const value = match[0];\n const start = match.index;\n tokens.push({ value, start, end: start + value.length });\n }\n return tokens;\n}\n\nexport function wordTokenValues(text: string): string[] {\n return Array.from(text.matchAll(WORD_TOKEN_PATTERN), (match) => match[0]);\n}\n\nexport function isIdentifierToken(value: string): boolean {\n return IDENTIFIER_TOKEN_PATTERN.test(value);\n}\n\nexport function isNumberToken(value: string): boolean {\n return NUMBER_TOKEN_PATTERN.test(value);\n}\n\nexport function isSymbolToken(value: string): boolean {\n return SYMBOL_TOKEN_PATTERN.test(value);\n}\n\nexport function isMeaningfulOperatorToken(value: string): boolean {\n return MEANINGFUL_OPERATOR_TOKEN_PATTERN.test(value);\n}\n\nexport function wordEmphasisTokenWeight(value: string): number {\n if (isIdentifierToken(value)) return 2;\n if (isNumberToken(value)) return 1.5;\n if (DOMAIN_SEPARATOR_TOKEN_PATTERN.test(value)) return 0.25;\n if (isMeaningfulOperatorToken(value)) return 1;\n if (STRUCTURAL_PUNCTUATION_TOKEN_PATTERN.test(value)) return 0.05;\n return 1;\n}\n\nexport function splitIdentifierToken(value: string, start: number): WordEmphasisToken[] {\n const parts: WordEmphasisToken[] = [];\n const partPattern =\n /[$_]+|(?:\\p{Lu}\\p{Mark}*)+(?=(?:\\p{Lu}\\p{Mark}*)(?:\\p{Ll}\\p{Mark}*)|\\p{N}|$)|(?:\\p{Lu}\\p{Mark}*)?(?:\\p{Ll}\\p{Mark}*)+|\\p{N}+|(?:\\p{Lu}\\p{Mark}*)+|(?:\\p{L}\\p{Mark}*)+/gu;\n for (const match of value.matchAll(partPattern)) {\n const part = match[0];\n const offset = match.index;\n parts.push({ value: part, start: start + offset, end: start + offset + part.length });\n }\n return parts.length > 0 ? parts : [{ value, start, end: start + value.length }];\n}\n\nexport function wordEmphasisSimilarityTokenValues(tokens: WordEmphasisToken[]): string[] {\n const values: string[] = [];\n for (const token of tokens) {\n if (!isIdentifierToken(token.value)) {\n values.push(token.value);\n continue;\n }\n const parts = splitIdentifierToken(token.value, 0)\n .map((part) => part.value)\n .filter(isIdentifierSimilarityPart);\n if (parts.length === 0) values.push(token.value.toLowerCase());\n else values.push(...parts.map((part) => part.toLowerCase()));\n }\n return values;\n}\n\nexport function isIdentifierSimilarityPart(value: string): boolean {\n return !/^[$_]+$/.test(value);\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport type { AddedDiffLine, RemovedDiffLine } from \"./parse.js\";\nimport { expandPreviewTabs } from \"./normalize.js\";\nimport { escapeControlChars } from \"./normalize.js\";\nimport { wordEmphasisTokens, type WordEmphasisToken } from \"./tokens.js\";\n\nexport type IndexedChangedLine<T extends AddedDiffLine | RemovedDiffLine> = {\n index: number;\n line: T;\n normalizedContent?: string;\n tokens?: WordEmphasisToken[];\n similarityTokenValues?: string[];\n similarityFeatureValues?: string[];\n};\n\nexport function indexedChangedLine<T extends AddedDiffLine | RemovedDiffLine>(\n index: number,\n line: T,\n): IndexedChangedLine<T> {\n return { index, line };\n}\n\nexport function normalizedChangedContent(\n line: IndexedChangedLine<AddedDiffLine | RemovedDiffLine>,\n): string {\n // Compute ranges against the same normalized text that Shiki/fallback rendering displays.\n // Otherwise tabs or escaped control chars shift the emphasis range by multiple cells.\n return (line.normalizedContent ??= normalizeDiffContent(line.line.content));\n}\n\nexport function changedLineTokens(\n line: IndexedChangedLine<AddedDiffLine | RemovedDiffLine>,\n): WordEmphasisToken[] {\n return (line.tokens ??= wordEmphasisTokens(normalizedChangedContent(line)));\n}\n\nfunction normalizeDiffContent(content: string): string {\n return escapeControlChars(expandPreviewTabs(content));\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nconst ALIGNMENT_SCORE_EPSILON = 1e-9;\n\ntype PairScoreAt = (beforeIndex: number, afterIndex: number) => number;\n\nfunction sameAlignmentScore(a: number, b: number): boolean {\n return Math.abs(a - b) < ALIGNMENT_SCORE_EPSILON;\n}\n\nexport function suffixAlignedPairs(\n beforeLength: number,\n afterLength: number,\n scoreAt: PairScoreAt,\n): Array<[number, number]> {\n const columns = afterLength + 1;\n const dp = new Float64Array((beforeLength + 1) * columns);\n\n for (let i = beforeLength - 1; i >= 0; i--) {\n const rowOffset = i * columns;\n const nextRowOffset = rowOffset + columns;\n for (let j = afterLength - 1; j >= 0; j--) {\n const pairScore = scoreAt(i, j);\n const align = Number.isFinite(pairScore) ? dp[nextRowOffset + j + 1]! + pairScore : pairScore;\n dp[rowOffset + j] = Math.max(align, dp[nextRowOffset + j]!, dp[rowOffset + j + 1]!);\n }\n }\n\n const pairs: Array<[number, number]> = [];\n let i = 0;\n let j = 0;\n while (i < beforeLength && j < afterLength) {\n const rowOffset = i * columns;\n const nextRowOffset = rowOffset + columns;\n const pairScore = scoreAt(i, j);\n const align = Number.isFinite(pairScore) ? dp[nextRowOffset + j + 1]! + pairScore : pairScore;\n if (Number.isFinite(pairScore) && sameAlignmentScore(dp[rowOffset + j]!, align)) {\n pairs.push([i, j]);\n i++;\n j++;\n } else if (dp[nextRowOffset + j]! >= dp[rowOffset + j + 1]!) {\n i++;\n } else {\n j++;\n }\n }\n return pairs;\n}\n\nexport function prefixAlignedPairs(\n beforeLength: number,\n afterLength: number,\n scoreAt: PairScoreAt,\n): Array<[number, number]> {\n const columns = afterLength + 1;\n const dp = new Float64Array((beforeLength + 1) * columns);\n\n for (let i = 1; i <= beforeLength; i++) {\n const rowOffset = i * columns;\n const previousRowOffset = rowOffset - columns;\n for (let j = 1; j <= afterLength; j++) {\n const pairScore = scoreAt(i - 1, j - 1);\n const pair = Number.isFinite(pairScore)\n ? dp[previousRowOffset + j - 1]! + pairScore\n : pairScore;\n dp[rowOffset + j] = Math.max(dp[previousRowOffset + j]!, dp[rowOffset + j - 1]!, pair);\n }\n }\n\n const pairs: Array<[number, number]> = [];\n let i = beforeLength;\n let j = afterLength;\n while (i > 0 && j > 0) {\n const rowOffset = i * columns;\n const previousRowOffset = rowOffset - columns;\n const pairScore = scoreAt(i - 1, j - 1);\n const pair = Number.isFinite(pairScore)\n ? dp[previousRowOffset + j - 1]! + pairScore\n : pairScore;\n if (Number.isFinite(pairScore) && sameAlignmentScore(dp[rowOffset + j]!, pair)) {\n pairs.push([i - 1, j - 1]);\n i--;\n j--;\n } else if (dp[previousRowOffset + j]! >= dp[rowOffset + j - 1]!) {\n i--;\n } else {\n j--;\n }\n }\n return pairs.reverse();\n}\n\nexport function suffixAlignmentScore(\n beforeLength: number,\n afterLength: number,\n scoreAt: PairScoreAt,\n): number {\n let next = new Float64Array(afterLength + 1);\n let current = new Float64Array(afterLength + 1);\n\n for (let i = beforeLength - 1; i >= 0; i--) {\n current[afterLength] = 0;\n for (let j = afterLength - 1; j >= 0; j--) {\n const pairScore = scoreAt(i, j);\n const match = Number.isFinite(pairScore) ? numericAt(next, j + 1) + pairScore : pairScore;\n current[j] = Math.max(match, numericAt(next, j), numericAt(current, j + 1));\n }\n [next, current] = [current, next];\n }\n\n return numericAt(next, 0);\n}\n\nfunction numericAt(values: ArrayLike<number>, index: number): number {\n const value = values[index];\n if (value === undefined) throw new RangeError(`Missing alignment cell ${index}`);\n return value;\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport type { AddedDiffLine, RemovedDiffLine } from \"./parse.js\";\nimport { suffixAlignmentScore } from \"./alignment.js\";\nimport { wordEmphasisSimilarityTokenValues, wordEmphasisTokenWeight } from \"./tokens.js\";\nimport { changedLineTokens, type IndexedChangedLine } from \"./changed-line.js\";\n\ntype ChangedLineSimilarityDocuments = {\n removedFeatures: string[][];\n addedFeatures: string[][];\n documentCounts: Map<string, number>;\n};\n\ntype SimilarityTokenWeight = (token: string) => number;\n\nconst SIMILARITY_BIGRAM_PREFIX = \"\\u0000PI_SIM_BIGRAM\\u0000\";\nconst MAX_LINE_TOKEN_SIMILARITY_CELLS = 16_384;\n\nfunction changedLineSimilarityTokenValues(\n line: IndexedChangedLine<AddedDiffLine | RemovedDiffLine>,\n): string[] {\n return (line.similarityTokenValues ??= wordEmphasisSimilarityTokenValues(\n changedLineTokens(line),\n ));\n}\n\nfunction changedLineSimilarityFeatureValues(\n line: IndexedChangedLine<AddedDiffLine | RemovedDiffLine>,\n): string[] {\n return (line.similarityFeatureValues ??= similarityFeatures(\n changedLineSimilarityTokenValues(line),\n ));\n}\n\nexport function changedLineSimilarityDocuments(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n): ChangedLineSimilarityDocuments {\n const removedFeatures = removed.map(changedLineSimilarityFeatureValues);\n const addedFeatures = added.map(changedLineSimilarityFeatureValues);\n const documentCounts = new Map<string, number>();\n countSimilarityDocuments(removedFeatures, documentCounts);\n countSimilarityDocuments(addedFeatures, documentCounts);\n return { removedFeatures, addedFeatures, documentCounts };\n}\n\nfunction countSimilarityDocuments(\n featureLists: string[][],\n documentCounts: Map<string, number>,\n): void {\n for (const features of featureLists) {\n for (const feature of new Set(features))\n documentCounts.set(feature, (documentCounts.get(feature) ?? 0) + 1);\n }\n}\n\nexport function hasUniqueSharedSimilarityFeature(\n removed: IndexedChangedLine<RemovedDiffLine>,\n added: IndexedChangedLine<AddedDiffLine>,\n documents: ChangedLineSimilarityDocuments,\n): boolean {\n const addedFeatures = new Set(changedLineSimilarityFeatureValues(added));\n for (const feature of new Set(changedLineSimilarityFeatureValues(removed))) {\n if (!addedFeatures.has(feature)) continue;\n if (documents.documentCounts.get(feature) === 2 && tokenWeight(feature) >= 1) return true;\n }\n return false;\n}\n\nfunction similarityFeatures(tokens: string[]): string[] {\n const features = [...tokens];\n appendSimilarityShingles(\n features,\n tokens.filter(isSimilarityShingleToken),\n 2,\n SIMILARITY_BIGRAM_PREFIX,\n );\n return features;\n}\n\nfunction appendSimilarityShingles(\n features: string[],\n tokens: string[],\n size: number,\n prefix: string,\n): void {\n for (let index = 0; index + size <= tokens.length; index++)\n features.push(`${prefix}${tokens.slice(index, index + size).join(\"\\u0000\")}`);\n}\n\nfunction isSimilarityShingleToken(token: string): boolean {\n return wordEmphasisTokenWeight(token) >= 1;\n}\n\nexport function similarityTokenWeight(\n documents: ChangedLineSimilarityDocuments,\n): SimilarityTokenWeight {\n const weights = new Map<string, number>();\n const lineCount = documents.removedFeatures.length + documents.addedFeatures.length;\n return (token) => {\n const cached = weights.get(token);\n if (cached !== undefined) return cached;\n const documentCount = documents.documentCounts.get(token) ?? lineCount;\n const rarity = Math.min(3, 1 + Math.log((lineCount + 1) / (documentCount + 1)));\n const weight = tokenWeight(token) * rarity;\n weights.set(token, weight);\n return weight;\n };\n}\n\nexport function fallbackLineSimilarity(\n removed: IndexedChangedLine<RemovedDiffLine>,\n added: IndexedChangedLine<AddedDiffLine>,\n weight: SimilarityTokenWeight,\n removedWeight?: number,\n addedWeight?: number,\n): number {\n return unorderedTokenSimilarity(\n changedLineSimilarityFeatureValues(removed),\n changedLineSimilarityFeatureValues(added),\n weight,\n removedWeight,\n addedWeight,\n );\n}\n\nexport function tokenSimilarity(\n beforeTokens: string[],\n afterTokens: string[],\n weight: SimilarityTokenWeight = tokenWeight,\n minimumRelevantSimilarity = 0,\n beforeWeight?: number,\n afterWeight?: number,\n): number {\n if (beforeTokens.length === 0 || afterTokens.length === 0)\n return beforeTokens.length === afterTokens.length ? 1 : 0;\n const bagSimilarity = unorderedTokenSimilarity(\n beforeTokens,\n afterTokens,\n weight,\n beforeWeight,\n afterWeight,\n );\n // Ordered overlap cannot exceed multiset overlap. Avoid its dynamic program when\n // the upper bound is already below the caller's minimum useful score.\n if (bagSimilarity < minimumRelevantSimilarity) return bagSimilarity;\n const orderedSimilarity = orderedTokenSimilarity(\n beforeTokens,\n afterTokens,\n weight,\n beforeWeight ?? similarityTokenListWeight(beforeTokens, weight),\n afterWeight ?? similarityTokenListWeight(afterTokens, weight),\n );\n if (orderedSimilarity === undefined) return bagSimilarity;\n return Math.max(\n orderedSimilarity,\n bagSimilarity * 0.8,\n orderedSimilarity * 0.75 + bagSimilarity * 0.25,\n );\n}\n\nfunction unorderedTokenSimilarity(\n beforeTokens: string[],\n afterTokens: string[],\n weight: SimilarityTokenWeight,\n beforeWeight = similarityTokenListWeight(beforeTokens, weight),\n afterWeight = similarityTokenListWeight(afterTokens, weight),\n): number {\n const remaining = new Map<string, number>();\n for (const token of beforeTokens) remaining.set(token, (remaining.get(token) ?? 0) + 1);\n let sharedWeight = 0;\n for (const token of afterTokens) {\n const count = remaining.get(token) ?? 0;\n if (count === 0) continue;\n sharedWeight += weight(token);\n if (count === 1) remaining.delete(token);\n else remaining.set(token, count - 1);\n }\n return (2 * sharedWeight) / (beforeWeight + afterWeight);\n}\n\nfunction orderedTokenSimilarity(\n beforeTokens: string[],\n afterTokens: string[],\n weight: SimilarityTokenWeight,\n beforeWeight: number,\n afterWeight: number,\n): number | undefined {\n if (beforeTokens.length * afterTokens.length > MAX_LINE_TOKEN_SIMILARITY_CELLS) return undefined;\n const score = suffixAlignmentScore(\n beforeTokens.length,\n afterTokens.length,\n (beforeIndex, afterIndex) => {\n const beforeToken = stringAt(beforeTokens, beforeIndex);\n return beforeToken === stringAt(afterTokens, afterIndex)\n ? weight(beforeToken)\n : Number.NEGATIVE_INFINITY;\n },\n );\n\n return (2 * score) / (beforeWeight + afterWeight);\n}\n\nexport function similarityTokenListWeight(tokens: string[], weight: SimilarityTokenWeight): number {\n return tokens.reduce((total, token) => total + weight(token), 0);\n}\n\nfunction tokenWeight(token: string): number {\n if (token.startsWith(SIMILARITY_BIGRAM_PREFIX)) return 1.15;\n return wordEmphasisTokenWeight(token);\n}\n\nfunction stringAt(values: string[], index: number): string {\n const value = values[index];\n if (value === undefined) throw new RangeError(`Missing similarity token ${index}`);\n return value;\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport type { AddedDiffLine, RemovedDiffLine } from \"./parse.js\";\nimport type { IndexedChangedLine } from \"./changed-line.js\";\nimport {\n changedLineSimilarityDocuments,\n fallbackLineSimilarity,\n hasUniqueSharedSimilarityFeature,\n similarityTokenListWeight,\n similarityTokenWeight,\n} from \"./line-similarity.js\";\nimport type { WordChangeConfidence } from \"./types.js\";\n\nexport type SparseChangedLinePair = {\n removedIndex: number;\n addedIndex: number;\n confidence: WordChangeConfidence;\n};\n\ntype SparseChangedLinePairCandidate = {\n removedPosition: number;\n addedPosition: number;\n evidence: number;\n sharedFeatureCount: number;\n hasUniqueFeature: boolean;\n competingEvidence: number;\n};\n\ntype ScoredSparseChangedLinePairCandidate = SparseChangedLinePairCandidate & {\n score: number;\n};\n\ntype ChangedLineScoreAt = (removedPosition: number, addedPosition: number) => number;\n\nexport type SparseLineMatchingPolicy = {\n minPositionalFallbackPairScore: number;\n minChangedLinePairScore: number;\n competingChangedLineScoreAt: (\n removedLength: number,\n addedLength: number,\n removedPosition: number,\n addedPosition: number,\n scoreAt: ChangedLineScoreAt,\n ) => number;\n isAmbiguousChangedLinePairScore: (score: number, competingScore: number) => boolean;\n isReciprocalBestChangedLinePair: (score: number, competingScore: number) => boolean;\n linePairConfidence: (score: number, competingScore: number) => WordChangeConfidence;\n};\n\nexport type TopTwoCandidateValues = { best: number; second: number };\n\nconst MAX_POSITIONAL_FALLBACK_AMBIGUITY_CELLS = 10_000;\nconst MAX_SPARSE_FEATURE_DOCUMENTS = 6;\nconst MAX_SPARSE_FEATURE_DOCUMENTS_PER_SIDE = 3;\nconst MAX_SPARSE_CANDIDATES_PER_LINE = 8;\nconst MIN_SPARSE_RARE_FEATURE_COUNT = 2;\nconst MIN_SPARSE_EVIDENCE_MARGIN = 1;\nconst MIN_SPARSE_EVIDENCE_RATIO = 0.9;\n\nexport function matchChangedLinesSparse(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n policy: SparseLineMatchingPolicy,\n): SparseChangedLinePair[] {\n const similarityDocuments = changedLineSimilarityDocuments(removed, added);\n const tokenWeight = similarityTokenWeight(similarityDocuments);\n const removedWeights: Array<number | undefined> = [];\n const addedWeights: Array<number | undefined> = [];\n const canCheckAmbiguity =\n removed.length * added.length <= MAX_POSITIONAL_FALLBACK_AMBIGUITY_CELLS;\n const scoreCache = canCheckAmbiguity ? new Map<number, number>() : undefined;\n const scoreAt = (removedPosition: number, addedPosition: number): number => {\n const key = removedPosition * added.length + addedPosition;\n const cached = scoreCache?.get(key);\n if (cached !== undefined) return cached;\n const removedFeatures = similarityDocuments.removedFeatures[removedPosition];\n const addedFeatures = similarityDocuments.addedFeatures[addedPosition];\n if (removedFeatures === undefined || addedFeatures === undefined)\n throw new RangeError(`Missing similarity features ${removedPosition}:${addedPosition}`);\n const removedWeight = (removedWeights[removedPosition] ??= similarityTokenListWeight(\n removedFeatures,\n tokenWeight,\n ));\n const addedWeight = (addedWeights[addedPosition] ??= similarityTokenListWeight(\n addedFeatures,\n tokenWeight,\n ));\n const score = fallbackLineSimilarity(\n changedLineAt(removed, removedPosition),\n changedLineAt(added, addedPosition),\n tokenWeight,\n removedWeight,\n addedWeight,\n );\n scoreCache?.set(key, score);\n return score;\n };\n\n const sparseCandidates = sparseChangedLinePairCandidates(similarityDocuments, tokenWeight);\n const pairs = sparseChangedLineAnchors(removed, added, sparseCandidates, scoreAt, policy);\n const positions = changedLinePositions(removed, added);\n const usedRemoved = new Set<number>();\n const usedAdded = new Set<number>();\n for (const pair of pairs) {\n const removedPosition = positions.removed.get(pair.removedIndex);\n const addedPosition = positions.added.get(pair.addedIndex);\n if (removedPosition !== undefined) usedRemoved.add(removedPosition);\n if (addedPosition !== undefined) usedAdded.add(addedPosition);\n }\n\n for (let index = 0; index < Math.min(removed.length, added.length); index++) {\n if (usedRemoved.has(index) || usedAdded.has(index)) continue;\n const score = scoreAt(index, index);\n if (score < policy.minPositionalFallbackPairScore) continue;\n const removedLine = changedLineAt(removed, index);\n const addedLine = changedLineAt(added, index);\n if (hasUniqueSharedSimilarityFeature(removedLine, addedLine, similarityDocuments)) {\n pairs.push({\n removedIndex: removedLine.index,\n addedIndex: addedLine.index,\n confidence: policy.linePairConfidence(score, 0),\n });\n usedRemoved.add(index);\n usedAdded.add(index);\n continue;\n }\n if (!canCheckAmbiguity) continue;\n\n const competingScore = policy.competingChangedLineScoreAt(\n removed.length,\n added.length,\n index,\n index,\n scoreAt,\n );\n if (policy.isAmbiguousChangedLinePairScore(score, competingScore)) continue;\n pairs.push({\n removedIndex: removedLine.index,\n addedIndex: addedLine.index,\n confidence: policy.linePairConfidence(score, competingScore),\n });\n usedRemoved.add(index);\n usedAdded.add(index);\n }\n return pairs.sort(\n (a, b) =>\n (positions.removed.get(a.removedIndex) ?? 0) - (positions.removed.get(b.removedIndex) ?? 0),\n );\n}\n\nfunction sparseChangedLinePairCandidates(\n documents: ReturnType<typeof changedLineSimilarityDocuments>,\n tokenWeight: ReturnType<typeof similarityTokenWeight>,\n): SparseChangedLinePairCandidate[] {\n const removedPositions = similarityFeaturePositions(documents.removedFeatures);\n const addedPositions = similarityFeaturePositions(documents.addedFeatures);\n const candidates = new Map<number, SparseChangedLinePairCandidate>();\n const addedLength = documents.addedFeatures.length;\n\n for (const [feature, featureRemovedPositions] of removedPositions) {\n const featureAddedPositions = addedPositions.get(feature);\n if (!featureAddedPositions) continue;\n const documentCount = documents.documentCounts.get(feature) ?? Number.POSITIVE_INFINITY;\n if (\n documentCount > MAX_SPARSE_FEATURE_DOCUMENTS ||\n featureRemovedPositions.length > MAX_SPARSE_FEATURE_DOCUMENTS_PER_SIDE ||\n featureAddedPositions.length > MAX_SPARSE_FEATURE_DOCUMENTS_PER_SIDE\n )\n continue;\n const weight = tokenWeight(feature);\n if (weight < 1) continue;\n const uniqueFeature =\n documentCount === 2 &&\n featureRemovedPositions.length === 1 &&\n featureAddedPositions.length === 1;\n\n for (const removedPosition of featureRemovedPositions) {\n for (const addedPosition of featureAddedPositions) {\n const key = removedPosition * addedLength + addedPosition;\n const candidate = candidates.get(key);\n if (candidate) {\n candidate.evidence += weight;\n candidate.sharedFeatureCount++;\n candidate.hasUniqueFeature ||= uniqueFeature;\n } else {\n candidates.set(key, {\n removedPosition,\n addedPosition,\n evidence: weight,\n sharedFeatureCount: 1,\n hasUniqueFeature: uniqueFeature,\n competingEvidence: 0,\n });\n }\n }\n }\n }\n\n const candidateList = [...candidates.values()];\n addCompetingSparseEvidence(candidateList);\n return boundedSparseChangedLinePairCandidates(candidateList);\n}\n\nfunction similarityFeaturePositions(featureLists: string[][]): Map<string, number[]> {\n const positions = new Map<string, number[]>();\n for (let position = 0; position < featureLists.length; position++) {\n const features = featureLists[position];\n if (!features) continue;\n for (const feature of new Set(features)) {\n const featurePositions = positions.get(feature);\n if (featurePositions) featurePositions.push(position);\n else positions.set(feature, [position]);\n }\n }\n return positions;\n}\n\nfunction addCompetingSparseEvidence(candidates: SparseChangedLinePairCandidate[]): void {\n const removedEvidence = topTwoCandidateValues(\n candidates,\n (candidate) => candidate.removedPosition,\n (candidate) => candidate.evidence,\n );\n const addedEvidence = topTwoCandidateValues(\n candidates,\n (candidate) => candidate.addedPosition,\n (candidate) => candidate.evidence,\n );\n for (const candidate of candidates) {\n candidate.competingEvidence = Math.max(\n competingCandidateValue(removedEvidence.get(candidate.removedPosition), candidate.evidence),\n competingCandidateValue(addedEvidence.get(candidate.addedPosition), candidate.evidence),\n );\n }\n}\n\nfunction topTwoCandidateValues<T>(\n candidates: T[],\n position: (candidate: T) => number,\n value: (candidate: T) => number,\n): Map<number, TopTwoCandidateValues> {\n const values = new Map<number, TopTwoCandidateValues>();\n for (const candidate of candidates) {\n const current = values.get(position(candidate)) ?? { best: 0, second: 0 };\n const candidateValue = value(candidate);\n if (candidateValue >= current.best) {\n current.second = current.best;\n current.best = candidateValue;\n } else if (candidateValue > current.second) current.second = candidateValue;\n values.set(position(candidate), current);\n }\n return values;\n}\n\nexport function competingCandidateValue(\n values: TopTwoCandidateValues | undefined,\n candidateValue: number,\n): number {\n if (!values) return 0;\n return candidateValue === values.best ? values.second : values.best;\n}\n\nfunction boundedSparseChangedLinePairCandidates(\n candidates: SparseChangedLinePairCandidate[],\n): SparseChangedLinePairCandidate[] {\n const byRemoved = new Map<number, SparseChangedLinePairCandidate[]>();\n const byAdded = new Map<number, SparseChangedLinePairCandidate[]>();\n for (const candidate of candidates) {\n appendSparseCandidate(byRemoved, candidate.removedPosition, candidate);\n appendSparseCandidate(byAdded, candidate.addedPosition, candidate);\n }\n const selectedByRemoved = topSparseCandidates(byRemoved);\n const selectedByAdded = topSparseCandidates(byAdded);\n return candidates.filter(\n (candidate) => selectedByRemoved.has(candidate) && selectedByAdded.has(candidate),\n );\n}\n\nfunction appendSparseCandidate(\n candidates: Map<number, SparseChangedLinePairCandidate[]>,\n position: number,\n candidate: SparseChangedLinePairCandidate,\n): void {\n const atPosition = candidates.get(position);\n if (atPosition) atPosition.push(candidate);\n else candidates.set(position, [candidate]);\n}\n\nfunction topSparseCandidates(\n candidates: Map<number, SparseChangedLinePairCandidate[]>,\n): Set<SparseChangedLinePairCandidate> {\n const selected = new Set<SparseChangedLinePairCandidate>();\n for (const atPosition of candidates.values()) {\n atPosition.sort(compareSparseCandidates);\n for (const candidate of atPosition.slice(0, MAX_SPARSE_CANDIDATES_PER_LINE))\n selected.add(candidate);\n }\n return selected;\n}\n\nfunction compareSparseCandidates(\n a: SparseChangedLinePairCandidate,\n b: SparseChangedLinePairCandidate,\n): number {\n return (\n Number(b.hasUniqueFeature) - Number(a.hasUniqueFeature) ||\n b.evidence - a.evidence ||\n b.sharedFeatureCount - a.sharedFeatureCount ||\n Math.abs(a.removedPosition - a.addedPosition) - Math.abs(b.removedPosition - b.addedPosition) ||\n a.removedPosition - b.removedPosition ||\n a.addedPosition - b.addedPosition\n );\n}\n\nfunction sparseChangedLineAnchors(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n sparseCandidates: SparseChangedLinePairCandidate[],\n scoreAt: ChangedLineScoreAt,\n policy: SparseLineMatchingPolicy,\n): SparseChangedLinePair[] {\n const scoredCandidates: ScoredSparseChangedLinePairCandidate[] = sparseCandidates\n .map((candidate) => ({\n ...candidate,\n score: scoreAt(candidate.removedPosition, candidate.addedPosition),\n }))\n .sort((a, b) => b.score - a.score || compareSparseCandidates(a, b));\n const removedScores = topTwoCandidateValues(\n scoredCandidates,\n (candidate) => candidate.removedPosition,\n (candidate) => candidate.score,\n );\n const addedScores = topTwoCandidateValues(\n scoredCandidates,\n (candidate) => candidate.addedPosition,\n (candidate) => candidate.score,\n );\n const usedRemoved = new Set<number>();\n const usedAdded = new Set<number>();\n const pairs: SparseChangedLinePair[] = [];\n\n for (const candidate of scoredCandidates) {\n if (candidate.score < policy.minChangedLinePairScore) continue;\n if (usedRemoved.has(candidate.removedPosition) || usedAdded.has(candidate.addedPosition))\n continue;\n if (!hasStrongSparseEvidence(candidate)) continue;\n const competingScore = Math.max(\n competingCandidateValue(removedScores.get(candidate.removedPosition), candidate.score),\n competingCandidateValue(addedScores.get(candidate.addedPosition), candidate.score),\n sparsePositionalCompetingScore(candidate, removed.length, added.length, scoreAt),\n );\n if (!policy.isReciprocalBestChangedLinePair(candidate.score, competingScore)) continue;\n usedRemoved.add(candidate.removedPosition);\n usedAdded.add(candidate.addedPosition);\n pairs.push({\n removedIndex: changedLineAt(removed, candidate.removedPosition).index,\n addedIndex: changedLineAt(added, candidate.addedPosition).index,\n confidence: policy.linePairConfidence(candidate.score, competingScore),\n });\n }\n return pairs;\n}\n\nfunction sparsePositionalCompetingScore(\n candidate: SparseChangedLinePairCandidate,\n removedLength: number,\n addedLength: number,\n scoreAt: ChangedLineScoreAt,\n): number {\n let competingScore = 0;\n if (\n candidate.removedPosition < addedLength &&\n candidate.addedPosition !== candidate.removedPosition\n )\n competingScore = scoreAt(candidate.removedPosition, candidate.removedPosition);\n if (\n candidate.addedPosition < removedLength &&\n candidate.removedPosition !== candidate.addedPosition\n )\n competingScore = Math.max(\n competingScore,\n scoreAt(candidate.addedPosition, candidate.addedPosition),\n );\n return competingScore;\n}\n\nfunction hasStrongSparseEvidence(candidate: SparseChangedLinePairCandidate): boolean {\n if (!candidate.hasUniqueFeature && candidate.sharedFeatureCount < MIN_SPARSE_RARE_FEATURE_COUNT)\n return false;\n return (\n candidate.evidence - candidate.competingEvidence > MIN_SPARSE_EVIDENCE_MARGIN &&\n candidate.competingEvidence < candidate.evidence * MIN_SPARSE_EVIDENCE_RATIO\n );\n}\n\ntype ChangedLinePositions = {\n removed: Map<number, number>;\n added: Map<number, number>;\n};\n\nfunction changedLinePositions(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n): ChangedLinePositions {\n return {\n removed: new Map(removed.map((line, index) => [line.index, index])),\n added: new Map(added.map((line, index) => [line.index, index])),\n };\n}\n\nfunction changedLineAt<T extends AddedDiffLine | RemovedDiffLine>(\n lines: Array<IndexedChangedLine<T>>,\n index: number,\n): IndexedChangedLine<T> {\n const line = lines[index];\n if (line === undefined) throw new RangeError(`Missing changed line ${index}`);\n return line;\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport type { WordChangeConfidence } from \"./types.js\";\nimport type { AddedDiffLine, RemovedDiffLine } from \"./parse.js\";\nimport { prefixAlignedPairs } from \"./alignment.js\";\nimport {\n changedLineSimilarityDocuments,\n similarityTokenListWeight,\n similarityTokenWeight,\n tokenSimilarity,\n} from \"./line-similarity.js\";\nimport type { IndexedChangedLine } from \"./changed-line.js\";\nimport {\n competingCandidateValue,\n matchChangedLinesSparse,\n type SparseLineMatchingPolicy,\n type TopTwoCandidateValues,\n} from \"./sparse-line-matching.js\";\n\nexport type ChangedLinePair = {\n removedIndex: number;\n addedIndex: number;\n confidence: WordChangeConfidence;\n};\n\ntype ChangedLinePairCandidate = {\n removedPosition: number;\n addedPosition: number;\n score: number;\n};\n\ntype ChangedLinePositionPair = [removedPosition: number, addedPosition: number];\ntype ChangedLineIndexPair = [removedIndex: number, addedIndex: number];\ntype ChangedLineScoreAt = (removedPosition: number, addedPosition: number) => number;\n\nexport function matchChangedLines(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n): ChangedLinePair[] {\n if (removed.length === 0 || added.length === 0) return [];\n if (removed.length * added.length > MAX_CHANGED_LINE_PAIR_CELLS)\n return matchChangedLinesSparse(removed, added, SPARSE_LINE_MATCHING_POLICY);\n const similarityDocuments = changedLineSimilarityDocuments(removed, added);\n const tokenWeight = similarityTokenWeight(similarityDocuments);\n const { removedFeatures, addedFeatures } = similarityDocuments;\n const removedWeights = removedFeatures.map((tokens) =>\n similarityTokenListWeight(tokens, tokenWeight),\n );\n const addedWeights = addedFeatures.map((tokens) =>\n similarityTokenListWeight(tokens, tokenWeight),\n );\n const scores = removedFeatures.map((beforeTokens, removedPosition) =>\n addedFeatures.map((afterTokens, addedPosition) =>\n tokenSimilarity(\n beforeTokens,\n afterTokens,\n tokenWeight,\n MIN_POSITIONAL_FALLBACK_PAIR_SCORE,\n removedWeights[removedPosition],\n addedWeights[addedPosition],\n ),\n ),\n );\n const similarPairs = prefixAlignedPairs(\n removed.length,\n added.length,\n (removedPosition, addedPosition) => {\n const score = scores[removedPosition]?.[addedPosition] ?? 0;\n return score >= MIN_CHANGED_LINE_PAIR_SCORE ? score + 0.01 : Number.NEGATIVE_INFINITY;\n },\n );\n if (similarPairs.length === 0 && removed.length === 1 && added.length === 1)\n return [\n {\n removedIndex: changedLineAt(removed, 0).index,\n addedIndex: changedLineAt(added, 0).index,\n confidence: \"medium\",\n },\n ];\n const positions = changedLinePositions(removed, added);\n const confidentPairs = confidentChangedLinePairs(\n positions,\n scores,\n addPositionalFallbackPairs(removed, added, scores, similarPairs),\n );\n return addCrossingPairs(removed, added, scores, positions, confidentPairs);\n}\n\nconst MIN_CHANGED_LINE_PAIR_SCORE = 0.45;\nconst MIN_POSITIONAL_FALLBACK_PAIR_SCORE = 0.28;\nconst CHANGED_LINE_PAIR_AMBIGUITY_MARGIN = 0.06;\nconst CHANGED_LINE_PAIR_AMBIGUITY_RATIO = 0.92;\nconst MIN_HIGH_CONFIDENCE_CROSSING_PAIR_SCORE = 0.72;\nconst HIGH_CONFIDENCE_CROSSING_PAIR_MARGIN = 0.12;\nconst HIGH_CONFIDENCE_CROSSING_PAIR_RATIO = 0.85;\nconst MAX_CHANGED_LINE_PAIR_CELLS = 1024;\n\nconst SPARSE_LINE_MATCHING_POLICY: SparseLineMatchingPolicy = {\n minPositionalFallbackPairScore: MIN_POSITIONAL_FALLBACK_PAIR_SCORE,\n minChangedLinePairScore: MIN_CHANGED_LINE_PAIR_SCORE,\n competingChangedLineScoreAt,\n isAmbiguousChangedLinePairScore,\n isReciprocalBestChangedLinePair,\n linePairConfidence,\n};\n\ntype ChangedLinePositions = {\n removed: Map<number, number>;\n added: Map<number, number>;\n};\n\nfunction changedLinePositions(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n): ChangedLinePositions {\n return {\n removed: new Map(removed.map((line, index) => [line.index, index])),\n added: new Map(added.map((line, index) => [line.index, index])),\n };\n}\n\nfunction confidentChangedLinePairs(\n positions: ChangedLinePositions,\n scores: number[][],\n pairs: ChangedLineIndexPair[],\n): ChangedLinePair[] {\n const confidentPairs: ChangedLinePair[] = [];\n for (const [removedIndex, addedIndex] of pairs) {\n const removedPosition = positions.removed.get(removedIndex);\n const addedPosition = positions.added.get(addedIndex);\n if (removedPosition === undefined || addedPosition === undefined) continue;\n const score = scores[removedPosition]?.[addedPosition] ?? 0;\n const competingScore = competingChangedLineScore(scores, removedPosition, addedPosition);\n if (isAmbiguousChangedLinePairScore(score, competingScore)) continue;\n confidentPairs.push({\n removedIndex,\n addedIndex,\n confidence: linePairConfidence(score, competingScore),\n });\n }\n return confidentPairs;\n}\n\nfunction competingChangedLineScore(\n scores: number[][],\n removedPosition: number,\n addedPosition: number,\n usedRemoved?: ReadonlySet<number>,\n usedAdded?: ReadonlySet<number>,\n): number {\n return competingChangedLineScoreAt(\n scores.length,\n scores[removedPosition]?.length ?? 0,\n removedPosition,\n addedPosition,\n (candidateRemovedPosition, candidateAddedPosition) =>\n scores[candidateRemovedPosition]?.[candidateAddedPosition] ?? 0,\n usedRemoved,\n usedAdded,\n );\n}\n\nfunction competingChangedLineScoreAt(\n removedLength: number,\n addedLength: number,\n removedPosition: number,\n addedPosition: number,\n scoreAt: ChangedLineScoreAt,\n usedRemoved?: ReadonlySet<number>,\n usedAdded?: ReadonlySet<number>,\n): number {\n let competingScore = 0;\n for (\n let candidateAddedPosition = 0;\n candidateAddedPosition < addedLength;\n candidateAddedPosition++\n ) {\n if (candidateAddedPosition === addedPosition || usedAdded?.has(candidateAddedPosition))\n continue;\n competingScore = Math.max(competingScore, scoreAt(removedPosition, candidateAddedPosition));\n }\n for (\n let candidateRemovedPosition = 0;\n candidateRemovedPosition < removedLength;\n candidateRemovedPosition++\n ) {\n if (candidateRemovedPosition === removedPosition || usedRemoved?.has(candidateRemovedPosition))\n continue;\n competingScore = Math.max(competingScore, scoreAt(candidateRemovedPosition, addedPosition));\n }\n return competingScore;\n}\n\nfunction isAmbiguousChangedLinePairScore(score: number, competingScore: number): boolean {\n return (\n competingScore >= MIN_POSITIONAL_FALLBACK_PAIR_SCORE &&\n (score - competingScore <= CHANGED_LINE_PAIR_AMBIGUITY_MARGIN ||\n competingScore >= score * CHANGED_LINE_PAIR_AMBIGUITY_RATIO)\n );\n}\n\nfunction isReciprocalBestChangedLinePair(score: number, competingScore: number): boolean {\n return score > competingScore && !isAmbiguousChangedLinePairScore(score, competingScore);\n}\n\nfunction linePairConfidence(score: number, competingScore: number): WordChangeConfidence {\n if (\n score >= MIN_HIGH_CONFIDENCE_CROSSING_PAIR_SCORE &&\n score - competingScore >= HIGH_CONFIDENCE_CROSSING_PAIR_MARGIN &&\n competingScore <= score * HIGH_CONFIDENCE_CROSSING_PAIR_RATIO\n )\n return \"high\";\n return \"medium\";\n}\n\nfunction addCrossingPairs(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n scores: number[][],\n positions: ChangedLinePositions,\n pairs: ChangedLinePair[],\n): ChangedLinePair[] {\n const usedRemoved = new Set<number>();\n const usedAdded = new Set<number>();\n for (const pair of pairs) {\n const removedPosition = positions.removed.get(pair.removedIndex);\n const addedPosition = positions.added.get(pair.addedIndex);\n if (removedPosition !== undefined) usedRemoved.add(removedPosition);\n if (addedPosition !== undefined) usedAdded.add(addedPosition);\n }\n\n const candidates: ChangedLinePairCandidate[] = [];\n for (let removedPosition = 0; removedPosition < removed.length; removedPosition++) {\n if (usedRemoved.has(removedPosition)) continue;\n for (let addedPosition = 0; addedPosition < added.length; addedPosition++) {\n if (usedAdded.has(addedPosition)) continue;\n const score = scores[removedPosition]?.[addedPosition] ?? 0;\n if (score >= MIN_CHANGED_LINE_PAIR_SCORE)\n candidates.push({ removedPosition, addedPosition, score });\n }\n }\n candidates.sort((a, b) => b.score - a.score);\n const competingScores = changedLineCompetingScores(scores);\n\n const out = [...pairs];\n for (const candidate of candidates) {\n if (usedRemoved.has(candidate.removedPosition) || usedAdded.has(candidate.addedPosition))\n continue;\n let confidence: WordChangeConfidence | undefined;\n if (candidate.score >= MIN_HIGH_CONFIDENCE_CROSSING_PAIR_SCORE) {\n const availableCompetingScore = competingChangedLineScore(\n scores,\n candidate.removedPosition,\n candidate.addedPosition,\n usedRemoved,\n usedAdded,\n );\n if (linePairConfidence(candidate.score, availableCompetingScore) === \"high\")\n confidence = \"high\";\n }\n confidence ??= reciprocalCrossingPairConfidence(competingScores, candidate);\n if (!confidence) continue;\n usedRemoved.add(candidate.removedPosition);\n usedAdded.add(candidate.addedPosition);\n out.push({\n removedIndex: changedLineAt(removed, candidate.removedPosition).index,\n addedIndex: changedLineAt(added, candidate.addedPosition).index,\n confidence,\n });\n }\n\n return out.sort(\n (a, b) =>\n (positions.removed.get(a.removedIndex) ?? 0) - (positions.removed.get(b.removedIndex) ?? 0),\n );\n}\n\ntype ChangedLineCompetingScores = {\n removed: TopTwoCandidateValues[];\n added: TopTwoCandidateValues[];\n};\n\nfunction changedLineCompetingScores(scores: number[][]): ChangedLineCompetingScores {\n const removed: TopTwoCandidateValues[] = [];\n const added: TopTwoCandidateValues[] = [];\n for (let removedPosition = 0; removedPosition < scores.length; removedPosition++) {\n const removedScores = scores[removedPosition] ?? [];\n for (let addedPosition = 0; addedPosition < removedScores.length; addedPosition++) {\n const score = removedScores[addedPosition] ?? 0;\n addCandidateValue(removed, removedPosition, score);\n addCandidateValue(added, addedPosition, score);\n }\n }\n return { removed, added };\n}\n\nfunction addCandidateValue(values: TopTwoCandidateValues[], position: number, value: number): void {\n const current = values[position] ?? { best: 0, second: 0 };\n if (value >= current.best) {\n current.second = current.best;\n current.best = value;\n } else if (value > current.second) current.second = value;\n values[position] = current;\n}\n\nfunction reciprocalCrossingPairConfidence(\n competingScores: ChangedLineCompetingScores,\n candidate: ChangedLinePairCandidate,\n): WordChangeConfidence | undefined {\n const competingScore = Math.max(\n competingCandidateValue(competingScores.removed[candidate.removedPosition], candidate.score),\n competingCandidateValue(competingScores.added[candidate.addedPosition], candidate.score),\n );\n if (!isReciprocalBestChangedLinePair(candidate.score, competingScore)) return undefined;\n return linePairConfidence(candidate.score, competingScore);\n}\n\nfunction addPositionalFallbackPairs(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n scores: number[][],\n similarPairs: ChangedLinePositionPair[],\n): ChangedLineIndexPair[] {\n const pairs: ChangedLineIndexPair[] = [];\n let removedCursor = 0;\n let addedCursor = 0;\n for (const [removedPosition, addedPosition] of similarPairs) {\n pairs.push(\n ...positionPairs(\n removed,\n added,\n scores,\n removedCursor,\n removedPosition,\n addedCursor,\n addedPosition,\n ),\n );\n pairs.push([\n changedLineAt(removed, removedPosition).index,\n changedLineAt(added, addedPosition).index,\n ]);\n removedCursor = removedPosition + 1;\n addedCursor = addedPosition + 1;\n }\n pairs.push(\n ...positionPairs(\n removed,\n added,\n scores,\n removedCursor,\n removed.length,\n addedCursor,\n added.length,\n ),\n );\n return pairs;\n}\n\nfunction positionPairs(\n removed: Array<IndexedChangedLine<RemovedDiffLine>>,\n added: Array<IndexedChangedLine<AddedDiffLine>>,\n scores: number[][],\n removedStart: number,\n removedEnd: number,\n addedStart: number,\n addedEnd: number,\n): ChangedLineIndexPair[] {\n const pairs: ChangedLineIndexPair[] = [];\n const count = Math.min(removedEnd - removedStart, addedEnd - addedStart);\n for (let offset = 0; offset < count; offset++) {\n const removedPosition = removedStart + offset;\n const addedPosition = addedStart + offset;\n const score = scores[removedPosition]?.[addedPosition] ?? 0;\n if (score < MIN_POSITIONAL_FALLBACK_PAIR_SCORE) continue;\n pairs.push([\n changedLineAt(removed, removedPosition).index,\n changedLineAt(added, addedPosition).index,\n ]);\n }\n return pairs;\n}\n\nfunction changedLineAt<T extends AddedDiffLine | RemovedDiffLine>(\n lines: Array<IndexedChangedLine<T>>,\n index: number,\n): IndexedChangedLine<T> {\n const line = lines[index];\n if (line === undefined) throw new RangeError(`Missing changed line ${index}`);\n return line;\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport type { WordEmphasisToken } from \"./tokens.js\";\n\nexport type TextRange = [number, number];\nexport type TokenGroup = { start: number; end: number };\n\nexport function rangesForTokenGroup(tokens: WordEmphasisToken[], group: TokenGroup): TextRange[] {\n const ranges: TextRange[] = [];\n for (let index = group.start; index < group.end; index++) {\n const token = tokens[index];\n if (token) appendTokenRange(ranges, token);\n }\n return ranges;\n}\n\nexport function pushTokenRange(ranges: TextRange[], token: WordEmphasisToken): void {\n ranges.push([token.start, token.end]);\n}\n\nexport function mergeRangesByStart(ranges: TextRange[]): TextRange[] {\n return mergeRanges([...ranges].sort((a, b) => a[0] - b[0]));\n}\n\nexport function mergeRanges(ranges: TextRange[]): TextRange[] {\n const merged: TextRange[] = [];\n for (const range of ranges) {\n const previous = merged.at(-1);\n if (previous && range[0] - previous[1] <= 1) previous[1] = range[1];\n else merged.push([...range]);\n }\n return merged;\n}\n\nfunction appendTokenRange(ranges: TextRange[], token: WordEmphasisToken): void {\n const previous = ranges.at(-1);\n if (previous && token.start - previous[1] <= 1) previous[1] = token.end;\n else ranges.push([token.start, token.end]);\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nconst NON_ASCII_TEXT_PATTERN = /[^\\x00-\\x7F]/;\nconst graphemeSegmenter = new Intl.Segmenter(undefined, { granularity: \"grapheme\" });\ntype GraphemeSegments = ReturnType<Intl.Segmenter[\"segment\"]>;\n\nexport type TextBoundarySegment = { value: string; start: number; end: number };\n\nexport function commonPrefixLength(before: string, after: string): number {\n const prefix = commonPrefixCodeUnitLength(before, after);\n if (!needsBoundarySafeOffsets(before) && !needsBoundarySafeOffsets(after)) return prefix;\n return commonGraphemePrefixLength(before, after, prefix);\n}\n\nexport function commonSuffixLength(before: string, after: string, prefixLength: number): number {\n const suffix = commonSuffixCodeUnitLength(before, after, prefixLength);\n if (!needsBoundarySafeOffsets(before) && !needsBoundarySafeOffsets(after)) return suffix;\n return commonGraphemeSuffixLength(before, after, suffix);\n}\n\nexport function needsBoundarySafeOffsets(text: string): boolean {\n return NON_ASCII_TEXT_PATTERN.test(text) || text.includes(\"\\r\\n\");\n}\n\nexport function textBoundarySegments(text: string): TextBoundarySegment[] {\n if (!needsBoundarySafeOffsets(text)) {\n return Array.from({ length: text.length }, (_, index) => ({\n value: text[index] ?? \"\",\n start: index,\n end: index + 1,\n }));\n }\n\n return Array.from(graphemeSegmenter.segment(text), (segment) => ({\n value: segment.segment,\n start: segment.index,\n end: segment.index + segment.segment.length,\n }));\n}\n\nexport function rangesAtGraphemeBoundaries(\n text: string,\n ranges: Array<[number, number]>,\n): Array<[number, number]> {\n if (ranges.length === 0 || !needsBoundarySafeOffsets(text)) return ranges;\n\n const segmentedText = graphemeSegmenter.segment(text);\n return ranges.map(([start, end]) => [\n graphemeStartAtOrBefore(segmentedText, start, text.length),\n graphemeEndAtOrAfter(segmentedText, end, text.length),\n ]);\n}\n\nfunction commonPrefixCodeUnitLength(before: string, after: string): number {\n const end = Math.min(before.length, after.length);\n let index = 0;\n while (index < end && before[index] === after[index]) index++;\n return index;\n}\n\nfunction commonSuffixCodeUnitLength(before: string, after: string, prefixLength: number): number {\n const maxLength = Math.min(before.length, after.length) - prefixLength;\n let length = 0;\n while (\n length < maxLength &&\n before[before.length - 1 - length] === after[after.length - 1 - length]\n )\n length++;\n return length;\n}\n\nfunction commonGraphemePrefixLength(before: string, after: string, prefix: number): number {\n const beforeSegments = graphemeSegmenter.segment(before);\n const afterSegments = graphemeSegmenter.segment(after);\n let safePrefix = prefix;\n while (safePrefix > 0) {\n const beforeBoundary = graphemeBoundaryAtOrBefore(beforeSegments, safePrefix);\n const afterBoundary = graphemeBoundaryAtOrBefore(afterSegments, safePrefix);\n const nextPrefix = Math.min(beforeBoundary, afterBoundary);\n if (nextPrefix === safePrefix) break;\n safePrefix = nextPrefix;\n }\n return safePrefix;\n}\n\nfunction commonGraphemeSuffixLength(before: string, after: string, suffix: number): number {\n const beforeSegments = graphemeSegmenter.segment(before);\n const afterSegments = graphemeSegmenter.segment(after);\n let safeSuffix = suffix;\n while (safeSuffix > 0) {\n const beforeStart = before.length - safeSuffix;\n const afterStart = after.length - safeSuffix;\n const beforeTrim =\n graphemeBoundaryAtOrAfter(beforeSegments, beforeStart, before.length) - beforeStart;\n const afterTrim =\n graphemeBoundaryAtOrAfter(afterSegments, afterStart, after.length) - afterStart;\n const trim = Math.max(beforeTrim, afterTrim);\n if (trim === 0) break;\n safeSuffix = Math.max(0, safeSuffix - trim);\n }\n return safeSuffix;\n}\n\nfunction graphemeBoundaryAtOrBefore(segments: GraphemeSegments, offset: number): number {\n if (offset <= 0) return 0;\n const segment = segments.containing(offset - 1);\n if (!segment) return offset;\n const segmentEnd = segment.index + segment.segment.length;\n return segmentEnd === offset ? offset : segment.index;\n}\n\nfunction graphemeBoundaryAtOrAfter(\n segments: GraphemeSegments,\n offset: number,\n textLength: number,\n): number {\n if (offset <= 0) return 0;\n if (offset >= textLength) return textLength;\n const segment = segments.containing(offset);\n if (!segment || segment.index === offset) return offset;\n return segment.index + segment.segment.length;\n}\n\nfunction graphemeStartAtOrBefore(\n segments: GraphemeSegments,\n offset: number,\n textLength: number,\n): number {\n if (offset <= 0) return 0;\n if (offset >= textLength) return textLength;\n return segments.containing(offset)?.index ?? offset;\n}\n\nfunction graphemeEndAtOrAfter(\n segments: GraphemeSegments,\n offset: number,\n textLength: number,\n): number {\n if (offset <= 0) return 0;\n if (offset >= textLength) return textLength;\n const segment = segments.containing(offset - 1);\n return segment ? segment.index + segment.segment.length : offset;\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport type { WordChangeConfidence } from \"./types.js\";\nimport { wordEmphasisTokenWeight, type WordEmphasisToken } from \"./tokens.js\";\nimport { suffixAlignedPairs } from \"./alignment.js\";\nimport type { TokenGroup } from \"./ranges.js\";\n\nconst WORD_EMPHASIS_EXACT_LCS_MAX_CELLS = 262_144;\n\nexport type ChangedTokenGap = { removed: TokenGroup; added: TokenGroup };\n\nexport function collectChangedTokenGaps(\n before: WordEmphasisToken[],\n beforeStart: number,\n beforeEnd: number,\n after: WordEmphasisToken[],\n afterStart: number,\n afterEnd: number,\n gaps: ChangedTokenGap[],\n): WordChangeConfidence {\n while (\n beforeStart < beforeEnd &&\n afterStart < afterEnd &&\n tokenAt(before, beforeStart).value === tokenAt(after, afterStart).value\n ) {\n beforeStart++;\n afterStart++;\n }\n\n while (\n beforeStart < beforeEnd &&\n afterStart < afterEnd &&\n tokenAt(before, beforeEnd - 1).value === tokenAt(after, afterEnd - 1).value\n ) {\n beforeEnd--;\n afterEnd--;\n }\n\n if (beforeStart === beforeEnd || afterStart === afterEnd) {\n appendChangedTokenGap(gaps, beforeStart, beforeEnd, afterStart, afterEnd);\n return \"high\";\n }\n\n const beforeLength = beforeEnd - beforeStart;\n const afterLength = afterEnd - afterStart;\n if (beforeLength * afterLength <= WORD_EMPHASIS_EXACT_LCS_MAX_CELLS) {\n collectChangedTokenGapsByLcs(before, beforeStart, beforeEnd, after, afterStart, afterEnd, gaps);\n return \"high\";\n }\n\n const anchors = uniqueOrderedAnchors(before, beforeStart, beforeEnd, after, afterStart, afterEnd);\n if (anchors.length === 0) {\n appendChangedTokenGap(gaps, beforeStart, beforeEnd, afterStart, afterEnd);\n return \"low\";\n }\n\n let confidence: WordChangeConfidence = \"high\";\n let previousBefore = beforeStart;\n let previousAfter = afterStart;\n for (const anchor of anchors) {\n confidence = lowerWordChangeConfidence(\n confidence,\n collectChangedTokenGaps(\n before,\n previousBefore,\n anchor.beforeIndex,\n after,\n previousAfter,\n anchor.afterIndex,\n gaps,\n ),\n );\n previousBefore = anchor.beforeIndex + 1;\n previousAfter = anchor.afterIndex + 1;\n }\n confidence = lowerWordChangeConfidence(\n confidence,\n collectChangedTokenGaps(\n before,\n previousBefore,\n beforeEnd,\n after,\n previousAfter,\n afterEnd,\n gaps,\n ),\n );\n return lowerWordChangeConfidence(confidence, \"medium\");\n}\n\nfunction lowerWordChangeConfidence(\n a: WordChangeConfidence,\n b: WordChangeConfidence,\n): WordChangeConfidence {\n return WORD_CHANGE_CONFIDENCE_RANK[a] <= WORD_CHANGE_CONFIDENCE_RANK[b] ? a : b;\n}\n\nconst WORD_CHANGE_CONFIDENCE_RANK = {\n low: 0,\n medium: 1,\n high: 2,\n} satisfies Record<WordChangeConfidence, number>;\n\nfunction collectChangedTokenGapsByLcs(\n before: WordEmphasisToken[],\n beforeStart: number,\n beforeEnd: number,\n after: WordEmphasisToken[],\n afterStart: number,\n afterEnd: number,\n gaps: ChangedTokenGap[],\n): void {\n const beforeLength = beforeEnd - beforeStart;\n const afterLength = afterEnd - afterStart;\n const pairs = suffixAlignedPairs(beforeLength, afterLength, (beforeIndex, afterIndex) => {\n const beforeToken = tokenAt(before, beforeStart + beforeIndex);\n const afterToken = tokenAt(after, afterStart + afterIndex);\n return beforeToken.value === afterToken.value\n ? wordEmphasisTokenWeight(beforeToken.value)\n : Number.NEGATIVE_INFINITY;\n });\n\n let beforeIndex = 0;\n let afterIndex = 0;\n for (const [nextBeforeIndex, nextAfterIndex] of pairs) {\n appendChangedTokenGap(\n gaps,\n beforeStart + beforeIndex,\n beforeStart + nextBeforeIndex,\n afterStart + afterIndex,\n afterStart + nextAfterIndex,\n );\n beforeIndex = nextBeforeIndex + 1;\n afterIndex = nextAfterIndex + 1;\n }\n appendChangedTokenGap(\n gaps,\n beforeStart + beforeIndex,\n beforeEnd,\n afterStart + afterIndex,\n afterEnd,\n );\n}\n\nfunction uniqueOrderedAnchors(\n before: WordEmphasisToken[],\n beforeStart: number,\n beforeEnd: number,\n after: WordEmphasisToken[],\n afterStart: number,\n afterEnd: number,\n): Array<{ beforeIndex: number; afterIndex: number }> {\n const beforeCounts = tokenCounts(before, beforeStart, beforeEnd);\n const afterCounts = tokenCounts(after, afterStart, afterEnd);\n const afterUniqueIndexes = new Map<string, number>();\n for (let index = afterStart; index < afterEnd; index++) {\n const value = tokenAt(after, index).value;\n if (beforeCounts.get(value) === 1 && afterCounts.get(value) === 1)\n afterUniqueIndexes.set(value, index);\n }\n const candidates: Array<{ beforeIndex: number; afterIndex: number }> = [];\n for (let index = beforeStart; index < beforeEnd; index++) {\n const value = tokenAt(before, index).value;\n if (beforeCounts.get(value) !== 1 || afterCounts.get(value) !== 1) continue;\n const afterIndex = afterUniqueIndexes.get(value);\n if (afterIndex !== undefined) candidates.push({ beforeIndex: index, afterIndex });\n }\n return longestIncreasingAfterIndexes(candidates);\n}\n\nfunction longestIncreasingAfterIndexes(\n candidates: Array<{ beforeIndex: number; afterIndex: number }>,\n): Array<{ beforeIndex: number; afterIndex: number }> {\n if (candidates.length <= 1) return candidates;\n const tails: number[] = [];\n const previous = Array.from({ length: candidates.length }, () => -1);\n const tailCandidateIndexes: number[] = [];\n\n for (let index = 0; index < candidates.length; index++) {\n const afterIndex = candidateAt(candidates, index).afterIndex;\n let low = 0;\n let high = tails.length;\n while (low < high) {\n const middle = (low + high) >> 1;\n if (numberAt(tails, middle) < afterIndex) low = middle + 1;\n else high = middle;\n }\n if (low > 0) previous[index] = numberAt(tailCandidateIndexes, low - 1);\n tails[low] = afterIndex;\n tailCandidateIndexes[low] = index;\n }\n\n const ordered: Array<{ beforeIndex: number; afterIndex: number }> = [];\n let index = tailCandidateIndexes[tails.length - 1] ?? -1;\n while (index >= 0) {\n ordered.push(candidateAt(candidates, index));\n index = previous[index] ?? -1;\n }\n return ordered.reverse();\n}\n\nfunction tokenCounts(tokens: WordEmphasisToken[], start: number, end: number): Map<string, number> {\n const counts = new Map<string, number>();\n for (let index = start; index < end; index++) {\n const value = tokenAt(tokens, index).value;\n counts.set(value, (counts.get(value) ?? 0) + 1);\n }\n return counts;\n}\n\nfunction appendChangedTokenGap(\n gaps: ChangedTokenGap[],\n beforeStart: number,\n beforeEnd: number,\n afterStart: number,\n afterEnd: number,\n): void {\n if (beforeStart === beforeEnd && afterStart === afterEnd) return;\n gaps.push({\n removed: { start: beforeStart, end: beforeEnd },\n added: { start: afterStart, end: afterEnd },\n });\n}\n\nfunction tokenAt(tokens: WordEmphasisToken[], index: number): WordEmphasisToken {\n const token = tokens[index];\n if (token === undefined) throw new RangeError(`Missing word-emphasis token ${index}`);\n return token;\n}\n\nfunction candidateAt(\n candidates: Array<{ beforeIndex: number; afterIndex: number }>,\n index: number,\n): { beforeIndex: number; afterIndex: number } {\n const candidate = candidates[index];\n if (candidate === undefined) throw new RangeError(`Missing anchor candidate ${index}`);\n return candidate;\n}\n\nfunction numberAt(values: number[], index: number): number {\n const value = values[index];\n if (value === undefined) throw new RangeError(`Missing numeric value ${index}`);\n return value;\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport { suffixAlignedPairs } from \"./alignment.js\";\nimport type { TextRange } from \"./ranges.js\";\nimport {\n commonPrefixLength,\n commonSuffixLength,\n needsBoundarySafeOffsets,\n textBoundarySegments,\n type TextBoundarySegment,\n} from \"./text-boundaries.js\";\nimport {\n isIdentifierToken,\n isMeaningfulOperatorToken,\n isNumberToken,\n type WordEmphasisToken,\n} from \"./tokens.js\";\nimport type { WordChangeRanges } from \"./types.js\";\n\nconst MAX_REFINED_TEXT_ALIGNMENT_CELLS = 1024;\nconst MAX_REFINED_TEXT_GRAPHEMES = 48;\nconst MAX_REFINED_TEXT_INTERNAL_RUNS = 4;\nconst MIN_REFINED_TEXT_INTERNAL_RUN_GRAPHEMES = 3;\n\ntype CommonTextRun = {\n beforeStart: number;\n beforeEnd: number;\n afterStart: number;\n afterEnd: number;\n};\n\nexport function refinedTokenTextRanges(\n beforeToken: WordEmphasisToken,\n afterToken: WordEmphasisToken,\n): WordChangeRanges | undefined {\n if (beforeToken.value === afterToken.value) return undefined;\n const prefix = commonPrefixLength(beforeToken.value, afterToken.value);\n const suffix = commonSuffixLength(beforeToken.value, afterToken.value, prefix);\n if (!shouldRefineTokenText(beforeToken.value, afterToken.value, prefix, suffix)) return undefined;\n const aligned = refinedTokenTextRangesByAlignment(beforeToken, afterToken, prefix, suffix);\n if (aligned) return aligned;\n\n return tokenTextGapRanges(\n beforeToken,\n afterToken,\n prefix,\n beforeToken.value.length - suffix,\n prefix,\n afterToken.value.length - suffix,\n );\n}\n\nfunction refinedTokenTextRangesByAlignment(\n beforeToken: WordEmphasisToken,\n afterToken: WordEmphasisToken,\n prefix: number,\n suffix: number,\n): WordChangeRanges | undefined {\n const beforeValue = beforeToken.value;\n const afterValue = afterToken.value;\n if (!isIdentifierToken(beforeValue) || !isIdentifierToken(afterValue)) return undefined;\n if (beforeValue.length * afterValue.length > MAX_REFINED_TEXT_ALIGNMENT_CELLS) return undefined;\n if (!hasPotentialInternalCommonText(beforeValue, afterValue, prefix, suffix)) return undefined;\n\n const beforeSegments = textBoundarySegments(beforeValue);\n const afterSegments = textBoundarySegments(afterValue);\n if (\n beforeSegments.length > MAX_REFINED_TEXT_GRAPHEMES ||\n afterSegments.length > MAX_REFINED_TEXT_GRAPHEMES ||\n beforeSegments.length * afterSegments.length > MAX_REFINED_TEXT_ALIGNMENT_CELLS\n )\n return undefined;\n\n const pairs = suffixAlignedPairs(beforeSegments.length, afterSegments.length, (before, after) =>\n segmentAt(beforeSegments, before).value === segmentAt(afterSegments, after).value\n ? 1\n : Number.NEGATIVE_INFINITY,\n );\n const runs = commonTextRuns(pairs);\n const keptRuns = runs.filter(\n (run) =>\n isEdgeTextRun(run, beforeSegments.length, afterSegments.length) ||\n run.beforeEnd - run.beforeStart >= MIN_REFINED_TEXT_INTERNAL_RUN_GRAPHEMES,\n );\n const internalRunCount = keptRuns.filter(\n (run) => !isEdgeTextRun(run, beforeSegments.length, afterSegments.length),\n ).length;\n if (internalRunCount === 0 || internalRunCount > MAX_REFINED_TEXT_INTERNAL_RUNS) return undefined;\n\n const removed: TextRange[] = [];\n const added: TextRange[] = [];\n let beforeIndex = 0;\n let afterIndex = 0;\n for (const run of keptRuns) {\n pushTextSegmentRange(removed, beforeToken, beforeSegments, beforeIndex, run.beforeStart);\n pushTextSegmentRange(added, afterToken, afterSegments, afterIndex, run.afterStart);\n beforeIndex = run.beforeEnd;\n afterIndex = run.afterEnd;\n }\n pushTextSegmentRange(removed, beforeToken, beforeSegments, beforeIndex, beforeSegments.length);\n pushTextSegmentRange(added, afterToken, afterSegments, afterIndex, afterSegments.length);\n\n return removed.length > 0 || added.length > 0 ? { removed, added } : undefined;\n}\n\nfunction tokenTextGapRanges(\n beforeToken: WordEmphasisToken,\n afterToken: WordEmphasisToken,\n beforeStart: number,\n beforeEnd: number,\n afterStart: number,\n afterEnd: number,\n): WordChangeRanges | undefined {\n const removed: TextRange[] =\n beforeStart < beforeEnd\n ? [[beforeToken.start + beforeStart, beforeToken.start + beforeEnd]]\n : [];\n const added: TextRange[] =\n afterStart < afterEnd ? [[afterToken.start + afterStart, afterToken.start + afterEnd]] : [];\n return removed.length > 0 || added.length > 0 ? { removed, added } : undefined;\n}\n\nfunction hasPotentialInternalCommonText(\n before: string,\n after: string,\n prefix: number,\n suffix: number,\n): boolean {\n const beforeMiddle = before.slice(prefix, before.length - suffix);\n const afterMiddle = after.slice(prefix, after.length - suffix);\n const [shorter, longer] =\n beforeMiddle.length <= afterMiddle.length\n ? [beforeMiddle, afterMiddle]\n : [afterMiddle, beforeMiddle];\n if (shorter.length < MIN_REFINED_TEXT_INTERNAL_RUN_GRAPHEMES) return false;\n\n for (let index = 0; index <= shorter.length - MIN_REFINED_TEXT_INTERNAL_RUN_GRAPHEMES; index++) {\n const candidate = shorter.slice(index, index + MIN_REFINED_TEXT_INTERNAL_RUN_GRAPHEMES);\n if (longer.includes(candidate)) return true;\n }\n return false;\n}\n\nfunction commonTextRuns(pairs: Array<[number, number]>): CommonTextRun[] {\n const runs: CommonTextRun[] = [];\n for (const [beforeIndex, afterIndex] of pairs) {\n const previous = runs.at(-1);\n if (previous?.beforeEnd === beforeIndex && previous.afterEnd === afterIndex) {\n previous.beforeEnd++;\n previous.afterEnd++;\n } else {\n runs.push({\n beforeStart: beforeIndex,\n beforeEnd: beforeIndex + 1,\n afterStart: afterIndex,\n afterEnd: afterIndex + 1,\n });\n }\n }\n return runs;\n}\n\nfunction isEdgeTextRun(run: CommonTextRun, beforeLength: number, afterLength: number): boolean {\n return (\n (run.beforeStart === 0 && run.afterStart === 0) ||\n (run.beforeEnd === beforeLength && run.afterEnd === afterLength)\n );\n}\n\nfunction pushTextSegmentRange(\n ranges: TextRange[],\n token: WordEmphasisToken,\n segments: TextBoundarySegment[],\n start: number,\n end: number,\n): void {\n if (start >= end) return;\n ranges.push([\n token.start + textSegmentOffset(segments, start, token.value.length),\n token.start + textSegmentOffset(segments, end, token.value.length),\n ]);\n}\n\nfunction textSegmentOffset(\n segments: TextBoundarySegment[],\n index: number,\n textLength: number,\n): number {\n return index === segments.length ? textLength : segmentAt(segments, index).start;\n}\n\nfunction segmentAt(segments: TextBoundarySegment[], index: number): TextBoundarySegment {\n const segment = segments[index];\n if (segment === undefined) throw new RangeError(`Missing text segment ${index}`);\n return segment;\n}\n\nfunction shouldRefineTokenText(\n before: string,\n after: string,\n prefix: number,\n suffix: number,\n): boolean {\n const sharedEdgeLength = prefix + suffix;\n if (sharedEdgeLength === 0) return false;\n if (isIdentifierToken(before) && isIdentifierToken(after)) {\n if (\n sharedEdgeLength < 2 &&\n !needsBoundarySafeOffsets(before) &&\n !needsBoundarySafeOffsets(after)\n )\n return false;\n if (prefix === 0 && suffix > 0) {\n const beforeChangedLength = before.length - suffix;\n const afterChangedLength = after.length - suffix;\n if (\n beforeChangedLength !== afterChangedLength &&\n Math.min(beforeChangedLength, afterChangedLength) < 2\n )\n return false;\n }\n return true;\n }\n if (isNumberToken(before) && isNumberToken(after)) return true;\n if (isMeaningfulOperatorToken(before) && isMeaningfulOperatorToken(after)) return true;\n return false;\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport {\n mergeRanges,\n mergeRangesByStart,\n pushTokenRange,\n rangesForTokenGroup,\n type TextRange,\n type TokenGroup,\n} from \"./ranges.js\";\nimport {\n commonPrefixLength,\n commonSuffixLength,\n rangesAtGraphemeBoundaries,\n} from \"./text-boundaries.js\";\nimport { collectChangedTokenGaps, type ChangedTokenGap } from \"./token-alignment.js\";\nimport {\n isIdentifierSimilarityPart,\n isIdentifierToken,\n isMeaningfulOperatorToken,\n isNumberToken,\n splitIdentifierToken,\n wordEmphasisTokenWeight,\n type WordEmphasisToken,\n} from \"./tokens.js\";\nimport type { WordChangeRanges } from \"./types.js\";\nimport { suffixAlignedPairs } from \"./alignment.js\";\nimport { refinedTokenTextRanges } from \"./token-text-refinement.js\";\n\nconst MAX_SOFT_TOKEN_ALIGNMENT_CELLS = 4096;\nconst MIN_SOFT_TOKEN_SUBSTITUTION_SIMILARITY = 0.45;\n\nexport function refinedRangesForChangedTokens(\n beforeText: string,\n beforeTokens: WordEmphasisToken[],\n afterText: string,\n afterTokens: WordEmphasisToken[],\n gaps: ChangedTokenGap[],\n): WordChangeRanges {\n const ranges = refinedRangesForTokenGaps(beforeTokens, afterTokens, gaps);\n return {\n removed: mergeRanges(rangesAtGraphemeBoundaries(beforeText, ranges.removed)),\n added: mergeRanges(rangesAtGraphemeBoundaries(afterText, ranges.added)),\n };\n}\n\nfunction refinedRangesForTokenGaps(\n beforeTokens: WordEmphasisToken[],\n afterTokens: WordEmphasisToken[],\n gaps: ChangedTokenGap[],\n): WordChangeRanges {\n const removed: TextRange[] = [];\n const added: TextRange[] = [];\n\n for (const gap of gaps) {\n const removedGroup = nonEmptyTokenGroup(gap.removed);\n const addedGroup = nonEmptyTokenGroup(gap.added);\n const refined =\n removedGroup && addedGroup\n ? refinedChangedTokenGroupRanges(beforeTokens, removedGroup, afterTokens, addedGroup)\n : undefined;\n if (refined) {\n removed.push(...refined.removed);\n added.push(...refined.added);\n continue;\n }\n if (removedGroup) removed.push(...rangesForTokenGroup(beforeTokens, removedGroup));\n if (addedGroup) added.push(...rangesForTokenGroup(afterTokens, addedGroup));\n }\n\n return { removed: mergeRanges(removed), added: mergeRanges(added) };\n}\n\nfunction nonEmptyTokenGroup(group: TokenGroup): TokenGroup | undefined {\n return group.start < group.end ? group : undefined;\n}\n\nfunction refinedChangedTokenGroupRanges(\n beforeTokens: WordEmphasisToken[],\n beforeGroup: TokenGroup,\n afterTokens: WordEmphasisToken[],\n afterGroup: TokenGroup,\n): WordChangeRanges | undefined {\n return (\n refinedSingleTokenRanges(beforeTokens, beforeGroup, afterTokens, afterGroup) ??\n refinedSoftTokenGroupRanges(beforeTokens, beforeGroup, afterTokens, afterGroup)\n );\n}\n\nfunction refinedSingleTokenRanges(\n beforeTokens: WordEmphasisToken[],\n beforeGroup: TokenGroup,\n afterTokens: WordEmphasisToken[],\n afterGroup: TokenGroup,\n): WordChangeRanges | undefined {\n if (beforeGroup.end - beforeGroup.start !== 1 || afterGroup.end - afterGroup.start !== 1)\n return undefined;\n return refinedTokenPairRanges(\n tokenAt(beforeTokens, beforeGroup.start),\n tokenAt(afterTokens, afterGroup.start),\n );\n}\n\nfunction refinedTokenPairRanges(\n beforeToken: WordEmphasisToken,\n afterToken: WordEmphasisToken,\n): WordChangeRanges | undefined {\n const identifierRanges = refinedIdentifierTokenRanges(beforeToken, afterToken);\n const textRanges = refinedTokenTextRanges(beforeToken, afterToken);\n if (identifierRanges && isNarrowerThanWholeTokens(identifierRanges, beforeToken, afterToken)) {\n if (shouldSuppressUnbalancedIdentifierPartRefinement(beforeToken, afterToken, textRanges))\n return textRanges;\n if (\n textRanges &&\n (textRanges.removed.length === 0 || textRanges.added.length === 0) &&\n highlightedRangeWidth(textRanges) < highlightedRangeWidth(identifierRanges)\n )\n return textRanges;\n return identifierRanges;\n }\n return textRanges ?? identifierRanges;\n}\n\nfunction highlightedRangeWidth(ranges: WordChangeRanges): number {\n let width = 0;\n for (const [start, end] of ranges.removed) width += end - start;\n for (const [start, end] of ranges.added) width += end - start;\n return width;\n}\n\nfunction shouldSuppressUnbalancedIdentifierPartRefinement(\n beforeToken: WordEmphasisToken,\n afterToken: WordEmphasisToken,\n textRanges: WordChangeRanges | undefined,\n): boolean {\n if (textRanges) return false;\n if (!isIdentifierToken(beforeToken.value) || !isIdentifierToken(afterToken.value)) return false;\n const beforePartCount = splitIdentifierToken(beforeToken.value, 0).filter((part) =>\n isIdentifierSimilarityPart(part.value),\n ).length;\n const afterPartCount = splitIdentifierToken(afterToken.value, 0).filter((part) =>\n isIdentifierSimilarityPart(part.value),\n ).length;\n return Math.min(beforePartCount, afterPartCount) === 1 && beforePartCount !== afterPartCount;\n}\n\nfunction refinedSoftTokenGroupRanges(\n beforeTokens: WordEmphasisToken[],\n beforeGroup: TokenGroup,\n afterTokens: WordEmphasisToken[],\n afterGroup: TokenGroup,\n): WordChangeRanges | undefined {\n const before = beforeTokens.slice(beforeGroup.start, beforeGroup.end);\n const after = afterTokens.slice(afterGroup.start, afterGroup.end);\n if (before.length * after.length > MAX_SOFT_TOKEN_ALIGNMENT_CELLS) return undefined;\n const pairs = softAlignedTokenPairs(before, after);\n if (pairs.length === 0) return undefined;\n\n const pairedBefore = new Set<number>();\n const pairedAfter = new Set<number>();\n const removed: TextRange[] = [];\n const added: TextRange[] = [];\n\n for (const [beforeIndex, afterIndex] of pairs) {\n pairedBefore.add(beforeIndex);\n pairedAfter.add(afterIndex);\n const beforeToken = tokenAt(before, beforeIndex);\n const afterToken = tokenAt(after, afterIndex);\n if (beforeToken.value === afterToken.value) continue;\n const refined = refinedTokenPairRanges(beforeToken, afterToken);\n if (refined) {\n removed.push(...refined.removed);\n added.push(...refined.added);\n } else {\n pushTokenRange(removed, beforeToken);\n pushTokenRange(added, afterToken);\n }\n }\n\n for (let index = 0; index < before.length; index++) {\n if (!pairedBefore.has(index)) pushTokenRange(removed, tokenAt(before, index));\n }\n for (let index = 0; index < after.length; index++) {\n if (!pairedAfter.has(index)) pushTokenRange(added, tokenAt(after, index));\n }\n\n const result = { removed: mergeRangesByStart(removed), added: mergeRangesByStart(added) };\n return result.removed.length > 0 || result.added.length > 0 ? result : undefined;\n}\n\nfunction softAlignedTokenPairs(\n before: WordEmphasisToken[],\n after: WordEmphasisToken[],\n): Array<[number, number]> {\n return suffixAlignedPairs(before.length, after.length, (beforeIndex, afterIndex) => {\n const substitution = softTokenSubstitutionWeight(\n tokenAt(before, beforeIndex),\n tokenAt(after, afterIndex),\n );\n return substitution > 0 ? substitution : Number.NEGATIVE_INFINITY;\n });\n}\n\nfunction softTokenSubstitutionWeight(\n beforeToken: WordEmphasisToken,\n afterToken: WordEmphasisToken,\n): number {\n if (beforeToken.value === afterToken.value) return wordEmphasisTokenWeight(beforeToken.value);\n const similarity = softTokenSimilarity(beforeToken.value, afterToken.value);\n return similarity >= MIN_SOFT_TOKEN_SUBSTITUTION_SIMILARITY\n ? Math.min(\n wordEmphasisTokenWeight(beforeToken.value),\n wordEmphasisTokenWeight(afterToken.value),\n ) * similarity\n : 0;\n}\n\nfunction softTokenSimilarity(before: string, after: string): number {\n if (isIdentifierToken(before) && isIdentifierToken(after))\n return identifierTokenSimilarity(before, after);\n if (isNumberToken(before) && isNumberToken(after)) return edgeTextSimilarity(before, after);\n if (isMeaningfulOperatorToken(before) && isMeaningfulOperatorToken(after))\n return edgeTextSimilarity(before, after);\n return 0;\n}\n\nfunction identifierTokenSimilarity(before: string, after: string): number {\n const beforeParts = splitIdentifierToken(before, 0)\n .map((part) => part.value.toLowerCase())\n .filter(isIdentifierSimilarityPart);\n const afterParts = splitIdentifierToken(after, 0)\n .map((part) => part.value.toLowerCase())\n .filter(isIdentifierSimilarityPart);\n const partSimilarity = tokenDiceSimilarity(beforeParts, afterParts);\n return Math.max(partSimilarity, edgeTextSimilarity(before, after));\n}\n\nfunction tokenDiceSimilarity(before: string[], after: string[]): number {\n if (before.length === 0 || after.length === 0) return 0;\n const remaining = new Map<string, number>();\n for (const token of before) remaining.set(token, (remaining.get(token) ?? 0) + 1);\n let shared = 0;\n for (const token of after) {\n const count = remaining.get(token) ?? 0;\n if (count === 0) continue;\n shared++;\n if (count === 1) remaining.delete(token);\n else remaining.set(token, count - 1);\n }\n return (2 * shared) / (before.length + after.length);\n}\n\nfunction edgeTextSimilarity(before: string, after: string): number {\n const prefix = commonPrefixLength(before, after);\n const suffix = commonSuffixLength(before, after, prefix);\n return (2 * (prefix + suffix)) / (before.length + after.length);\n}\n\nfunction refinedIdentifierTokenRanges(\n beforeToken: WordEmphasisToken,\n afterToken: WordEmphasisToken,\n): WordChangeRanges | undefined {\n if (!isIdentifierToken(beforeToken.value) || !isIdentifierToken(afterToken.value))\n return undefined;\n const beforeParts = splitIdentifierToken(beforeToken.value, beforeToken.start);\n const afterParts = splitIdentifierToken(afterToken.value, afterToken.start);\n if (beforeParts.length <= 1 && afterParts.length <= 1) return undefined;\n\n const gaps: ChangedTokenGap[] = [];\n collectChangedTokenGaps(\n beforeParts,\n 0,\n beforeParts.length,\n afterParts,\n 0,\n afterParts.length,\n gaps,\n );\n const ranges = refinedRangesForTokenGaps(beforeParts, afterParts, gaps);\n return hasWordChangeRanges(ranges) ? ranges : undefined;\n}\n\nfunction isNarrowerThanWholeTokens(\n ranges: WordChangeRanges,\n beforeToken: WordEmphasisToken,\n afterToken: WordEmphasisToken,\n): boolean {\n return (\n ranges.removed.some((range) => range[0] > beforeToken.start || range[1] < beforeToken.end) ||\n ranges.added.some((range) => range[0] > afterToken.start || range[1] < afterToken.end) ||\n ranges.removed.length === 0 ||\n ranges.added.length === 0\n );\n}\n\nfunction hasWordChangeRanges(ranges: WordChangeRanges): boolean {\n return ranges.removed.length > 0 || ranges.added.length > 0;\n}\n\nfunction tokenAt(tokens: WordEmphasisToken[], index: number): WordEmphasisToken {\n const token = tokens[index];\n if (token === undefined) throw new RangeError(`Missing word-emphasis token ${index}`);\n return token;\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport type { WordChangeRanges } from \"./types.js\";\nimport {\n isIdentifierToken,\n isMeaningfulOperatorToken,\n isNumberToken,\n isSymbolToken,\n wordTokenValues,\n} from \"./tokens.js\";\n\nexport function filterLowSignalWordEmphasis(\n before: string,\n after: string,\n ranges: WordChangeRanges,\n): WordChangeRanges {\n const hasRemovedSignal = ranges.removed.some((range) => hasSmartRangeSignal(before, range));\n const hasAddedSignal = ranges.added.some((range) => hasSmartRangeSignal(after, range));\n return {\n removed: ranges.removed.filter((range) =>\n shouldKeepSmartRange(before.slice(range[0], range[1]), hasAddedSignal),\n ),\n added: ranges.added.filter((range) =>\n shouldKeepSmartRange(after.slice(range[0], range[1]), hasRemovedSignal),\n ),\n };\n}\n\nfunction hasSmartRangeSignal(content: string, range: [number, number]): boolean {\n const tokens = wordTokenValues(content.slice(range[0], range[1]));\n return tokens.some(isSmartSignalToken);\n}\n\nfunction shouldKeepSmartRange(text: string, oppositeSideHasSignal: boolean): boolean {\n const tokens = wordTokenValues(text);\n const signalTokens = tokens.filter(isSmartSignalToken);\n if (signalTokens.length === 0) return false;\n const wordTokens = signalTokens.filter(\n (token) => isIdentifierToken(token) || isNumberToken(token),\n );\n const hasIntrinsicSignal = signalTokens.some(\n (token) => isMeaningfulOperatorToken(token) || isSymbolToken(token),\n );\n if (\n !oppositeSideHasSignal &&\n !hasIntrinsicSignal &&\n wordTokens.every((token) => LOW_SIGNAL_SYNTAX_TOKENS.has(token))\n )\n return false;\n if (!oppositeSideHasSignal && !hasIntrinsicSignal && isWrapperCallNoise(text, wordTokens))\n return false;\n return true;\n}\n\nfunction isSmartSignalToken(token: string): boolean {\n return (\n isIdentifierToken(token) ||\n isNumberToken(token) ||\n isMeaningfulOperatorToken(token) ||\n isSymbolToken(token)\n );\n}\n\nconst LOW_SIGNAL_SYNTAX_TOKENS = new Set([\n \"as\",\n \"const\",\n \"else\",\n \"export\",\n \"from\",\n \"function\",\n \"if\",\n \"import\",\n \"let\",\n \"var\",\n]);\n\nconst WRAPPER_CALL_TOKENS = new Set([\"filter\", \"flatMap\", \"forEach\", \"map\", \"reduce\"]);\n\nfunction isWrapperCallNoise(text: string, tokens: string[]): boolean {\n return (\n tokens.length === 1 &&\n tokens[0] !== undefined &&\n WRAPPER_CALL_TOKENS.has(tokens[0]) &&\n /^[\\s.()[\\]{};,]*[$_\\p{L}][$_\\p{L}\\p{N}\\p{Mark}]*[\\s.()[\\]{};,]*$/u.test(text)\n );\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport type { DiffWordEmphasis } from \"./types.js\";\nimport { refinedRangesForChangedTokens } from \"./range-refinement.js\";\nimport { filterLowSignalWordEmphasis } from \"./smart-filter.js\";\nimport { collectChangedTokenGaps, type ChangedTokenGap } from \"./token-alignment.js\";\nimport type { ConfidentWordChangeRanges, WordChangeConfidence, WordChangeRanges } from \"./types.js\";\nimport { wordEmphasisTokens, type WordEmphasisToken } from \"./tokens.js\";\n\nexport type { ConfidentWordChangeRanges, WordChangeConfidence, WordChangeRanges } from \"./types.js\";\n\nexport function shouldEmphasizeChangedPair(\n ranges: ConfidentWordChangeRanges,\n lineConfidence: WordChangeConfidence,\n): boolean {\n if (ranges.removed.length === 0 && ranges.added.length === 0) return false;\n if (lineConfidence === \"low\") return false;\n if (ranges.confidence === \"low\" && lineConfidence !== \"high\") return false;\n return true;\n}\n\nexport function changedRanges(\n before: string,\n after: string,\n wordEmphasis: DiffWordEmphasis,\n): WordChangeRanges {\n return stripWordChangeConfidence(changedRangesWithConfidence(before, after, wordEmphasis));\n}\n\nexport function changedRangesWithConfidence(\n before: string,\n after: string,\n wordEmphasis: DiffWordEmphasis,\n): ConfidentWordChangeRanges {\n if (wordEmphasis === \"off\") return emptyWordChangeRanges();\n return changedRangesForTokensWithConfidence(\n before,\n after,\n wordEmphasisTokens(before),\n wordEmphasisTokens(after),\n wordEmphasis,\n );\n}\n\nexport function changedRangesForTokensWithConfidence(\n before: string,\n after: string,\n beforeTokens: WordEmphasisToken[],\n afterTokens: WordEmphasisToken[],\n wordEmphasis: DiffWordEmphasis,\n): ConfidentWordChangeRanges {\n if (wordEmphasis === \"off\") return emptyWordChangeRanges();\n\n const gaps: ChangedTokenGap[] = [];\n const alignmentConfidence = collectChangedTokenGaps(\n beforeTokens,\n 0,\n beforeTokens.length,\n afterTokens,\n 0,\n afterTokens.length,\n gaps,\n );\n const ranges = refinedRangesForChangedTokens(before, beforeTokens, after, afterTokens, gaps);\n const confidence: WordChangeConfidence = hasWordChangeRanges(ranges)\n ? alignmentConfidence\n : \"low\";\n if (wordEmphasis !== \"smart\") return { ...ranges, confidence };\n\n const filtered = filterLowSignalWordEmphasis(before, after, ranges);\n return { ...filtered, confidence: hasWordChangeRanges(filtered) ? confidence : \"low\" };\n}\n\nfunction stripWordChangeConfidence(ranges: ConfidentWordChangeRanges): WordChangeRanges {\n return { removed: ranges.removed, added: ranges.added };\n}\n\nfunction hasWordChangeRanges(ranges: WordChangeRanges): boolean {\n return ranges.removed.length > 0 || ranges.added.length > 0;\n}\n\nfunction emptyWordChangeRanges(): ConfidentWordChangeRanges {\n return { removed: [], added: [], confidence: \"low\" };\n}\n", "// Adapted from pi-code-previews; see THIRD_PARTY_NOTICES.md.\nimport {\n changedLineTokens,\n indexedChangedLine,\n normalizedChangedContent,\n type IndexedChangedLine,\n} from \"./changed-line.js\";\nimport { matchChangedLines, type ChangedLinePair } from \"./line-matching.js\";\nimport type { DiffWordEmphasis } from \"./types.js\";\nimport {\n isAddedDiffLine,\n isRemovedDiffLine,\n type AddedDiffLine,\n type ParsedDiffLine,\n type RemovedDiffLine,\n} from \"./parse.js\";\nimport { changedRangesForTokensWithConfidence } from \"./emphasis.js\";\nimport type { ConfidentWordChangeRanges } from \"./types.js\";\n\ntype ChangedLineBlockAnalysis = {\n removed: Array<IndexedChangedLine<RemovedDiffLine>>;\n added: Array<IndexedChangedLine<AddedDiffLine>>;\n pairs: ChangedLinePair[];\n ranges: ChangedLineRangePair[];\n};\n\ntype ChangedLineRangePair = {\n pair: ChangedLinePair;\n ranges: ConfidentWordChangeRanges;\n};\n\nexport function analyzeChangedLineBlock(\n block: ParsedDiffLine[],\n wordEmphasis: DiffWordEmphasis,\n): ChangedLineBlockAnalysis {\n const removed: Array<IndexedChangedLine<RemovedDiffLine>> = [];\n const added: Array<IndexedChangedLine<AddedDiffLine>> = [];\n for (let index = 0; index < block.length; index++) {\n const line = block[index];\n if (line === undefined) continue;\n if (isRemovedDiffLine(line)) removed.push(indexedChangedLine(index, line));\n else if (isAddedDiffLine(line)) added.push(indexedChangedLine(index, line));\n }\n const removedByIndex = new Map(removed.map((line) => [line.index, line]));\n const addedByIndex = new Map(added.map((line) => [line.index, line]));\n const pairs = matchChangedLines(removed, added);\n const ranges: ChangedLineRangePair[] = [];\n\n for (const pair of pairs) {\n const removedLine = removedByIndex.get(pair.removedIndex);\n const addedLine = addedByIndex.get(pair.addedIndex);\n if (!removedLine || !addedLine) continue;\n ranges.push({\n pair,\n ranges: changedRangesForTokensWithConfidence(\n normalizedChangedContent(removedLine),\n normalizedChangedContent(addedLine),\n changedLineTokens(removedLine),\n changedLineTokens(addedLine),\n wordEmphasis,\n ),\n });\n }\n\n return { removed, added, pairs, ranges };\n}\n", "import type { ParsedDiffLine } from \"./parse.js\";\nimport { analyzeChangedLineBlock } from \"./change-block.js\";\nimport { shouldEmphasizeChangedPair } from \"./emphasis.js\";\nimport type { DiffWordEmphasis } from \"./types.js\";\n\nexport const changedLineEmphasis = (\n block: ParsedDiffLine[],\n wordEmphasis: DiffWordEmphasis,\n): Map<number, { ranges: Array<[number, number]>; kind: \"add\" | \"remove\" }> => {\n const emphasis = new Map<\n number,\n { ranges: Array<[number, number]>; kind: \"add\" | \"remove\" }\n >();\n if (wordEmphasis === \"off\") return emphasis;\n\n for (const { pair, ranges } of analyzeChangedLineBlock(block, wordEmphasis).ranges) {\n if (!shouldEmphasizeChangedPair(ranges, pair.confidence)) continue;\n emphasis.set(pair.removedIndex, { ranges: ranges.removed, kind: \"remove\" });\n emphasis.set(pair.addedIndex, { ranges: ranges.added, kind: \"add\" });\n }\n return emphasis;\n};\n"],
|
|
5
|
+
"mappings": ";;;;;;AAAO,IAAM,oBAAoB,CAAC,SAAyB,KAAK,QAAQ,OAAO,MAAM;AAE9E,IAAM,qBAAqB,CAAC,SACjC,KACG,QAAQ,SAAS,QAAG,EACpB,QAAQ,OAAO,QAAG,EAClB,QAAQ,0CAA0C,QAAG;;;ACC1D,IAAM,qBACJ,WAAC,uGAA0F,IAAE;AAC/F,IAAM,2BAA2B;AACjC,IAAM,uBAAuB,WAAC,4BAAsB,GAAC;AACrD,IAAM,uBAAuB,WAAC,aAAS,GAAC;AACxC,IAAM,oCACJ;AACF,IAAM,iCAAiC;AACvC,IAAM,uCAAuC;AAEtC,SAAS,mBAAmB,MAAmC;AACpE,QAAM,SAA8B,CAAC;AACrC,aAAW,SAAS,KAAK,SAAS,kBAAkB,GAAG;AACrD,UAAM,QAAQ,MAAM,CAAC;AACrB,UAAM,QAAQ,MAAM;AACpB,WAAO,KAAK,EAAE,OAAO,OAAO,KAAK,QAAQ,MAAM,OAAO,CAAC;AAAA,EACzD;AACA,SAAO;AACT;AAEO,SAAS,gBAAgB,MAAwB;AACtD,SAAO,MAAM,KAAK,KAAK,SAAS,kBAAkB,GAAG,CAAC,UAAU,MAAM,CAAC,CAAC;AAC1E;AAEO,SAAS,kBAAkB,OAAwB;AACxD,SAAO,yBAAyB,KAAK,KAAK;AAC5C;AAEO,SAAS,cAAc,OAAwB;AACpD,SAAO,qBAAqB,KAAK,KAAK;AACxC;AAEO,SAAS,cAAc,OAAwB;AACpD,SAAO,qBAAqB,KAAK,KAAK;AACxC;AAEO,SAAS,0BAA0B,OAAwB;AAChE,SAAO,kCAAkC,KAAK,KAAK;AACrD;AAEO,SAAS,wBAAwB,OAAuB;AAC7D,MAAI,kBAAkB,KAAK,EAAG,QAAO;AACrC,MAAI,cAAc,KAAK,EAAG,QAAO;AACjC,MAAI,+BAA+B,KAAK,KAAK,EAAG,QAAO;AACvD,MAAI,0BAA0B,KAAK,EAAG,QAAO;AAC7C,MAAI,qCAAqC,KAAK,KAAK,EAAG,QAAO;AAC7D,SAAO;AACT;AAEO,SAAS,qBAAqB,OAAe,OAAoC;AACtF,QAAM,QAA6B,CAAC;AACpC,QAAM,cACJ,WAAC,yLAAsK,IAAE;AAC3K,aAAW,SAAS,MAAM,SAAS,WAAW,GAAG;AAC/C,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,SAAS,MAAM;AACrB,UAAM,KAAK,EAAE,OAAO,MAAM,OAAO,QAAQ,QAAQ,KAAK,QAAQ,SAAS,KAAK,OAAO,CAAC;AAAA,EACtF;AACA,SAAO,MAAM,SAAS,IAAI,QAAQ,CAAC,EAAE,OAAO,OAAO,KAAK,QAAQ,MAAM,OAAO,CAAC;AAChF;AAEO,SAAS,kCAAkC,QAAuC;AACvF,QAAM,SAAmB,CAAC;AAC1B,aAAW,SAAS,QAAQ;AAC1B,QAAI,CAAC,kBAAkB,MAAM,KAAK,GAAG;AACnC,aAAO,KAAK,MAAM,KAAK;AACvB;AAAA,IACF;AACA,UAAM,QAAQ,qBAAqB,MAAM,OAAO,CAAC,EAC9C,IAAI,CAAC,SAAS,KAAK,KAAK,EACxB,OAAO,0BAA0B;AACpC,QAAI,MAAM,WAAW,EAAG,QAAO,KAAK,MAAM,MAAM,YAAY,CAAC;AAAA,QACxD,QAAO,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,KAAK,YAAY,CAAC,CAAC;AAAA,EAC7D;AACA,SAAO;AACT;AAEO,SAAS,2BAA2B,OAAwB;AACjE,SAAO,CAAC,UAAU,KAAK,KAAK;AAC9B;;;ACvEO,SAAS,mBACd,OACA,MACuB;AACvB,SAAO,EAAE,OAAO,KAAK;AACvB;AAEO,SAAS,yBACd,MACQ;AAGR,SAAQ,KAAK,sBAAsB,qBAAqB,KAAK,KAAK,OAAO;AAC3E;AAEO,SAAS,kBACd,MACqB;AACrB,SAAQ,KAAK,WAAW,mBAAmB,yBAAyB,IAAI,CAAC;AAC3E;AAEA,SAAS,qBAAqB,SAAyB;AACrD,SAAO,mBAAmB,kBAAkB,OAAO,CAAC;AACtD;;;ACrCA,IAAM,0BAA0B;AAIhC,SAAS,mBAAmB,GAAW,GAAoB;AACzD,SAAO,KAAK,IAAI,IAAI,CAAC,IAAI;AAC3B;AAEO,SAAS,mBACd,cACA,aACA,SACyB;AACzB,QAAM,UAAU,cAAc;AAC9B,QAAM,KAAK,IAAI,cAAc,eAAe,KAAK,OAAO;AAExD,WAASA,KAAI,eAAe,GAAGA,MAAK,GAAGA,MAAK;AAC1C,UAAM,YAAYA,KAAI;AACtB,UAAM,gBAAgB,YAAY;AAClC,aAASC,KAAI,cAAc,GAAGA,MAAK,GAAGA,MAAK;AACzC,YAAM,YAAY,QAAQD,IAAGC,EAAC;AAC9B,YAAM,QAAQ,OAAO,SAAS,SAAS,IAAI,GAAG,gBAAgBA,KAAI,CAAC,IAAK,YAAY;AACpF,SAAG,YAAYA,EAAC,IAAI,KAAK,IAAI,OAAO,GAAG,gBAAgBA,EAAC,GAAI,GAAG,YAAYA,KAAI,CAAC,CAAE;AAAA,IACpF;AAAA,EACF;AAEA,QAAM,QAAiC,CAAC;AACxC,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,IAAI,gBAAgB,IAAI,aAAa;AAC1C,UAAM,YAAY,IAAI;AACtB,UAAM,gBAAgB,YAAY;AAClC,UAAM,YAAY,QAAQ,GAAG,CAAC;AAC9B,UAAM,QAAQ,OAAO,SAAS,SAAS,IAAI,GAAG,gBAAgB,IAAI,CAAC,IAAK,YAAY;AACpF,QAAI,OAAO,SAAS,SAAS,KAAK,mBAAmB,GAAG,YAAY,CAAC,GAAI,KAAK,GAAG;AAC/E,YAAM,KAAK,CAAC,GAAG,CAAC,CAAC;AACjB;AACA;AAAA,IACF,WAAW,GAAG,gBAAgB,CAAC,KAAM,GAAG,YAAY,IAAI,CAAC,GAAI;AAC3D;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,mBACd,cACA,aACA,SACyB;AACzB,QAAM,UAAU,cAAc;AAC9B,QAAM,KAAK,IAAI,cAAc,eAAe,KAAK,OAAO;AAExD,WAASD,KAAI,GAAGA,MAAK,cAAcA,MAAK;AACtC,UAAM,YAAYA,KAAI;AACtB,UAAM,oBAAoB,YAAY;AACtC,aAASC,KAAI,GAAGA,MAAK,aAAaA,MAAK;AACrC,YAAM,YAAY,QAAQD,KAAI,GAAGC,KAAI,CAAC;AACtC,YAAM,OAAO,OAAO,SAAS,SAAS,IAClC,GAAG,oBAAoBA,KAAI,CAAC,IAAK,YACjC;AACJ,SAAG,YAAYA,EAAC,IAAI,KAAK,IAAI,GAAG,oBAAoBA,EAAC,GAAI,GAAG,YAAYA,KAAI,CAAC,GAAI,IAAI;AAAA,IACvF;AAAA,EACF;AAEA,QAAM,QAAiC,CAAC;AACxC,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,IAAI,GAAG;AACrB,UAAM,YAAY,IAAI;AACtB,UAAM,oBAAoB,YAAY;AACtC,UAAM,YAAY,QAAQ,IAAI,GAAG,IAAI,CAAC;AACtC,UAAM,OAAO,OAAO,SAAS,SAAS,IAClC,GAAG,oBAAoB,IAAI,CAAC,IAAK,YACjC;AACJ,QAAI,OAAO,SAAS,SAAS,KAAK,mBAAmB,GAAG,YAAY,CAAC,GAAI,IAAI,GAAG;AAC9E,YAAM,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;AACzB;AACA;AAAA,IACF,WAAW,GAAG,oBAAoB,CAAC,KAAM,GAAG,YAAY,IAAI,CAAC,GAAI;AAC/D;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,SAAO,MAAM,QAAQ;AACvB;AAEO,SAAS,qBACd,cACA,aACA,SACQ;AACR,MAAI,OAAO,IAAI,aAAa,cAAc,CAAC;AAC3C,MAAI,UAAU,IAAI,aAAa,cAAc,CAAC;AAE9C,WAAS,IAAI,eAAe,GAAG,KAAK,GAAG,KAAK;AAC1C,YAAQ,WAAW,IAAI;AACvB,aAAS,IAAI,cAAc,GAAG,KAAK,GAAG,KAAK;AACzC,YAAM,YAAY,QAAQ,GAAG,CAAC;AAC9B,YAAM,QAAQ,OAAO,SAAS,SAAS,IAAI,UAAU,MAAM,IAAI,CAAC,IAAI,YAAY;AAChF,cAAQ,CAAC,IAAI,KAAK,IAAI,OAAO,UAAU,MAAM,CAAC,GAAG,UAAU,SAAS,IAAI,CAAC,CAAC;AAAA,IAC5E;AACA,KAAC,MAAM,OAAO,IAAI,CAAC,SAAS,IAAI;AAAA,EAClC;AAEA,SAAO,UAAU,MAAM,CAAC;AAC1B;AAEA,SAAS,UAAU,QAA2B,OAAuB;AACnE,QAAM,QAAQ,OAAO,KAAK;AAC1B,MAAI,UAAU,OAAW,OAAM,IAAI,WAAW,0BAA0B,KAAK,EAAE;AAC/E,SAAO;AACT;;;ACtGA,IAAM,2BAA2B;AACjC,IAAM,kCAAkC;AAExC,SAAS,iCACP,MACU;AACV,SAAQ,KAAK,0BAA0B;AAAA,IACrC,kBAAkB,IAAI;AAAA,EACxB;AACF;AAEA,SAAS,mCACP,MACU;AACV,SAAQ,KAAK,4BAA4B;AAAA,IACvC,iCAAiC,IAAI;AAAA,EACvC;AACF;AAEO,SAAS,+BACd,SACA,OACgC;AAChC,QAAM,kBAAkB,QAAQ,IAAI,kCAAkC;AACtE,QAAM,gBAAgB,MAAM,IAAI,kCAAkC;AAClE,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,2BAAyB,iBAAiB,cAAc;AACxD,2BAAyB,eAAe,cAAc;AACtD,SAAO,EAAE,iBAAiB,eAAe,eAAe;AAC1D;AAEA,SAAS,yBACP,cACA,gBACM;AACN,aAAW,YAAY,cAAc;AACnC,eAAW,WAAW,IAAI,IAAI,QAAQ;AACpC,qBAAe,IAAI,UAAU,eAAe,IAAI,OAAO,KAAK,KAAK,CAAC;AAAA,EACtE;AACF;AAEO,SAAS,iCACd,SACA,OACA,WACS;AACT,QAAM,gBAAgB,IAAI,IAAI,mCAAmC,KAAK,CAAC;AACvE,aAAW,WAAW,IAAI,IAAI,mCAAmC,OAAO,CAAC,GAAG;AAC1E,QAAI,CAAC,cAAc,IAAI,OAAO,EAAG;AACjC,QAAI,UAAU,eAAe,IAAI,OAAO,MAAM,KAAK,YAAY,OAAO,KAAK,EAAG,QAAO;AAAA,EACvF;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,QAA4B;AACtD,QAAM,WAAW,CAAC,GAAG,MAAM;AAC3B;AAAA,IACE;AAAA,IACA,OAAO,OAAO,wBAAwB;AAAA,IACtC;AAAA,IACA;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,yBACP,UACA,QACA,MACA,QACM;AACN,WAAS,QAAQ,GAAG,QAAQ,QAAQ,OAAO,QAAQ;AACjD,aAAS,KAAK,GAAG,MAAM,GAAG,OAAO,MAAM,OAAO,QAAQ,IAAI,EAAE,KAAK,IAAQ,CAAC,EAAE;AAChF;AAEA,SAAS,yBAAyB,OAAwB;AACxD,SAAO,wBAAwB,KAAK,KAAK;AAC3C;AAEO,SAAS,sBACd,WACuB;AACvB,QAAM,UAAU,oBAAI,IAAoB;AACxC,QAAM,YAAY,UAAU,gBAAgB,SAAS,UAAU,cAAc;AAC7E,SAAO,CAAC,UAAU;AAChB,UAAM,SAAS,QAAQ,IAAI,KAAK;AAChC,QAAI,WAAW,OAAW,QAAO;AACjC,UAAM,gBAAgB,UAAU,eAAe,IAAI,KAAK,KAAK;AAC7D,UAAM,SAAS,KAAK,IAAI,GAAG,IAAI,KAAK,KAAK,YAAY,MAAM,gBAAgB,EAAE,CAAC;AAC9E,UAAM,SAAS,YAAY,KAAK,IAAI;AACpC,YAAQ,IAAI,OAAO,MAAM;AACzB,WAAO;AAAA,EACT;AACF;AAEO,SAAS,uBACd,SACA,OACA,QACA,eACA,aACQ;AACR,SAAO;AAAA,IACL,mCAAmC,OAAO;AAAA,IAC1C,mCAAmC,KAAK;AAAA,IACxC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAAS,gBACd,cACA,aACA,SAAgC,aAChC,4BAA4B,GAC5B,cACA,aACQ;AACR,MAAI,aAAa,WAAW,KAAK,YAAY,WAAW;AACtD,WAAO,aAAa,WAAW,YAAY,SAAS,IAAI;AAC1D,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAGA,MAAI,gBAAgB,0BAA2B,QAAO;AACtD,QAAM,oBAAoB;AAAA,IACxB;AAAA,IACA;AAAA,IACA;AAAA,IACA,gBAAgB,0BAA0B,cAAc,MAAM;AAAA,IAC9D,eAAe,0BAA0B,aAAa,MAAM;AAAA,EAC9D;AACA,MAAI,sBAAsB,OAAW,QAAO;AAC5C,SAAO,KAAK;AAAA,IACV;AAAA,IACA,gBAAgB;AAAA,IAChB,oBAAoB,OAAO,gBAAgB;AAAA,EAC7C;AACF;AAEA,SAAS,yBACP,cACA,aACA,QACA,eAAe,0BAA0B,cAAc,MAAM,GAC7D,cAAc,0BAA0B,aAAa,MAAM,GACnD;AACR,QAAM,YAAY,oBAAI,IAAoB;AAC1C,aAAW,SAAS,aAAc,WAAU,IAAI,QAAQ,UAAU,IAAI,KAAK,KAAK,KAAK,CAAC;AACtF,MAAI,eAAe;AACnB,aAAW,SAAS,aAAa;AAC/B,UAAM,QAAQ,UAAU,IAAI,KAAK,KAAK;AACtC,QAAI,UAAU,EAAG;AACjB,oBAAgB,OAAO,KAAK;AAC5B,QAAI,UAAU,EAAG,WAAU,OAAO,KAAK;AAAA,QAClC,WAAU,IAAI,OAAO,QAAQ,CAAC;AAAA,EACrC;AACA,SAAQ,IAAI,gBAAiB,eAAe;AAC9C;AAEA,SAAS,uBACP,cACA,aACA,QACA,cACA,aACoB;AACpB,MAAI,aAAa,SAAS,YAAY,SAAS,gCAAiC,QAAO;AACvF,QAAM,QAAQ;AAAA,IACZ,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,CAAC,aAAa,eAAe;AAC3B,YAAM,cAAc,SAAS,cAAc,WAAW;AACtD,aAAO,gBAAgB,SAAS,aAAa,UAAU,IACnD,OAAO,WAAW,IAClB,OAAO;AAAA,IACb;AAAA,EACF;AAEA,SAAQ,IAAI,SAAU,eAAe;AACvC;AAEO,SAAS,0BAA0B,QAAkB,QAAuC;AACjG,SAAO,OAAO,OAAO,CAAC,OAAO,UAAU,QAAQ,OAAO,KAAK,GAAG,CAAC;AACjE;AAEA,SAAS,YAAY,OAAuB;AAC1C,MAAI,MAAM,WAAW,wBAAwB,EAAG,QAAO;AACvD,SAAO,wBAAwB,KAAK;AACtC;AAEA,SAAS,SAAS,QAAkB,OAAuB;AACzD,QAAM,QAAQ,OAAO,KAAK;AAC1B,MAAI,UAAU,OAAW,OAAM,IAAI,WAAW,4BAA4B,KAAK,EAAE;AACjF,SAAO;AACT;;;ACrKA,IAAM,0CAA0C;AAChD,IAAM,+BAA+B;AACrC,IAAM,wCAAwC;AAC9C,IAAM,iCAAiC;AACvC,IAAM,gCAAgC;AACtC,IAAM,6BAA6B;AACnC,IAAM,4BAA4B;AAE3B,SAAS,wBACd,SACA,OACA,QACyB;AACzB,QAAM,sBAAsB,+BAA+B,SAAS,KAAK;AACzE,QAAMC,eAAc,sBAAsB,mBAAmB;AAC7D,QAAM,iBAA4C,CAAC;AACnD,QAAM,eAA0C,CAAC;AACjD,QAAM,oBACJ,QAAQ,SAAS,MAAM,UAAU;AACnC,QAAM,aAAa,oBAAoB,oBAAI,IAAoB,IAAI;AACnE,QAAM,UAAU,CAAC,iBAAyB,kBAAkC;AAC1E,UAAM,MAAM,kBAAkB,MAAM,SAAS;AAC7C,UAAM,SAAS,YAAY,IAAI,GAAG;AAClC,QAAI,WAAW,OAAW,QAAO;AACjC,UAAM,kBAAkB,oBAAoB,gBAAgB,eAAe;AAC3E,UAAM,gBAAgB,oBAAoB,cAAc,aAAa;AACrE,QAAI,oBAAoB,UAAa,kBAAkB;AACrD,YAAM,IAAI,WAAW,+BAA+B,eAAe,IAAI,aAAa,EAAE;AACxF,UAAM,gBAAiB,eAAe,eAAe,MAAM;AAAA,MACzD;AAAA,MACAA;AAAA,IACF;AACA,UAAM,cAAe,aAAa,aAAa,MAAM;AAAA,MACnD;AAAA,MACAA;AAAA,IACF;AACA,UAAM,QAAQ;AAAA,MACZ,cAAc,SAAS,eAAe;AAAA,MACtC,cAAc,OAAO,aAAa;AAAA,MAClCA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,gBAAY,IAAI,KAAK,KAAK;AAC1B,WAAO;AAAA,EACT;AAEA,QAAM,mBAAmB,gCAAgC,qBAAqBA,YAAW;AACzF,QAAM,QAAQ,yBAAyB,SAAS,OAAO,kBAAkB,SAAS,MAAM;AACxF,QAAM,YAAY,qBAAqB,SAAS,KAAK;AACrD,QAAM,cAAc,oBAAI,IAAY;AACpC,QAAM,YAAY,oBAAI,IAAY;AAClC,aAAW,QAAQ,OAAO;AACxB,UAAM,kBAAkB,UAAU,QAAQ,IAAI,KAAK,YAAY;AAC/D,UAAM,gBAAgB,UAAU,MAAM,IAAI,KAAK,UAAU;AACzD,QAAI,oBAAoB,OAAW,aAAY,IAAI,eAAe;AAClE,QAAI,kBAAkB,OAAW,WAAU,IAAI,aAAa;AAAA,EAC9D;AAEA,WAAS,QAAQ,GAAG,QAAQ,KAAK,IAAI,QAAQ,QAAQ,MAAM,MAAM,GAAG,SAAS;AAC3E,QAAI,YAAY,IAAI,KAAK,KAAK,UAAU,IAAI,KAAK,EAAG;AACpD,UAAM,QAAQ,QAAQ,OAAO,KAAK;AAClC,QAAI,QAAQ,OAAO,+BAAgC;AACnD,UAAM,cAAc,cAAc,SAAS,KAAK;AAChD,UAAM,YAAY,cAAc,OAAO,KAAK;AAC5C,QAAI,iCAAiC,aAAa,WAAW,mBAAmB,GAAG;AACjF,YAAM,KAAK;AAAA,QACT,cAAc,YAAY;AAAA,QAC1B,YAAY,UAAU;AAAA,QACtB,YAAY,OAAO,mBAAmB,OAAO,CAAC;AAAA,MAChD,CAAC;AACD,kBAAY,IAAI,KAAK;AACrB,gBAAU,IAAI,KAAK;AACnB;AAAA,IACF;AACA,QAAI,CAAC,kBAAmB;AAExB,UAAM,iBAAiB,OAAO;AAAA,MAC5B,QAAQ;AAAA,MACR,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,QAAI,OAAO,gCAAgC,OAAO,cAAc,EAAG;AACnE,UAAM,KAAK;AAAA,MACT,cAAc,YAAY;AAAA,MAC1B,YAAY,UAAU;AAAA,MACtB,YAAY,OAAO,mBAAmB,OAAO,cAAc;AAAA,IAC7D,CAAC;AACD,gBAAY,IAAI,KAAK;AACrB,cAAU,IAAI,KAAK;AAAA,EACrB;AACA,SAAO,MAAM;AAAA,IACX,CAAC,GAAG,OACD,UAAU,QAAQ,IAAI,EAAE,YAAY,KAAK,MAAM,UAAU,QAAQ,IAAI,EAAE,YAAY,KAAK;AAAA,EAC7F;AACF;AAEA,SAAS,gCACP,WACAA,cACkC;AAClC,QAAM,mBAAmB,2BAA2B,UAAU,eAAe;AAC7E,QAAM,iBAAiB,2BAA2B,UAAU,aAAa;AACzE,QAAM,aAAa,oBAAI,IAA4C;AACnE,QAAM,cAAc,UAAU,cAAc;AAE5C,aAAW,CAAC,SAAS,uBAAuB,KAAK,kBAAkB;AACjE,UAAM,wBAAwB,eAAe,IAAI,OAAO;AACxD,QAAI,CAAC,sBAAuB;AAC5B,UAAM,gBAAgB,UAAU,eAAe,IAAI,OAAO,KAAK,OAAO;AACtE,QACE,gBAAgB,gCAChB,wBAAwB,SAAS,yCACjC,sBAAsB,SAAS;AAE/B;AACF,UAAM,SAASA,aAAY,OAAO;AAClC,QAAI,SAAS,EAAG;AAChB,UAAM,gBACJ,kBAAkB,KAClB,wBAAwB,WAAW,KACnC,sBAAsB,WAAW;AAEnC,eAAW,mBAAmB,yBAAyB;AACrD,iBAAW,iBAAiB,uBAAuB;AACjD,cAAM,MAAM,kBAAkB,cAAc;AAC5C,cAAM,YAAY,WAAW,IAAI,GAAG;AACpC,YAAI,WAAW;AACb,oBAAU,YAAY;AACtB,oBAAU;AACV,oBAAU,qBAAqB;AAAA,QACjC,OAAO;AACL,qBAAW,IAAI,KAAK;AAAA,YAClB;AAAA,YACA;AAAA,YACA,UAAU;AAAA,YACV,oBAAoB;AAAA,YACpB,kBAAkB;AAAA,YAClB,mBAAmB;AAAA,UACrB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAAgB,CAAC,GAAG,WAAW,OAAO,CAAC;AAC7C,6BAA2B,aAAa;AACxC,SAAO,uCAAuC,aAAa;AAC7D;AAEA,SAAS,2BAA2B,cAAiD;AACnF,QAAM,YAAY,oBAAI,IAAsB;AAC5C,WAAS,WAAW,GAAG,WAAW,aAAa,QAAQ,YAAY;AACjE,UAAM,WAAW,aAAa,QAAQ;AACtC,QAAI,CAAC,SAAU;AACf,eAAW,WAAW,IAAI,IAAI,QAAQ,GAAG;AACvC,YAAM,mBAAmB,UAAU,IAAI,OAAO;AAC9C,UAAI,iBAAkB,kBAAiB,KAAK,QAAQ;AAAA,UAC/C,WAAU,IAAI,SAAS,CAAC,QAAQ,CAAC;AAAA,IACxC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,2BAA2B,YAAoD;AACtF,QAAM,kBAAkB;AAAA,IACtB;AAAA,IACA,CAAC,cAAc,UAAU;AAAA,IACzB,CAAC,cAAc,UAAU;AAAA,EAC3B;AACA,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACA,CAAC,cAAc,UAAU;AAAA,IACzB,CAAC,cAAc,UAAU;AAAA,EAC3B;AACA,aAAW,aAAa,YAAY;AAClC,cAAU,oBAAoB,KAAK;AAAA,MACjC,wBAAwB,gBAAgB,IAAI,UAAU,eAAe,GAAG,UAAU,QAAQ;AAAA,MAC1F,wBAAwB,cAAc,IAAI,UAAU,aAAa,GAAG,UAAU,QAAQ;AAAA,IACxF;AAAA,EACF;AACF;AAEA,SAAS,sBACP,YACA,UACA,OACoC;AACpC,QAAM,SAAS,oBAAI,IAAmC;AACtD,aAAW,aAAa,YAAY;AAClC,UAAM,UAAU,OAAO,IAAI,SAAS,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ,EAAE;AACxE,UAAM,iBAAiB,MAAM,SAAS;AACtC,QAAI,kBAAkB,QAAQ,MAAM;AAClC,cAAQ,SAAS,QAAQ;AACzB,cAAQ,OAAO;AAAA,IACjB,WAAW,iBAAiB,QAAQ,OAAQ,SAAQ,SAAS;AAC7D,WAAO,IAAI,SAAS,SAAS,GAAG,OAAO;AAAA,EACzC;AACA,SAAO;AACT;AAEO,SAAS,wBACd,QACA,gBACQ;AACR,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,mBAAmB,OAAO,OAAO,OAAO,SAAS,OAAO;AACjE;AAEA,SAAS,uCACP,YACkC;AAClC,QAAM,YAAY,oBAAI,IAA8C;AACpE,QAAM,UAAU,oBAAI,IAA8C;AAClE,aAAW,aAAa,YAAY;AAClC,0BAAsB,WAAW,UAAU,iBAAiB,SAAS;AACrE,0BAAsB,SAAS,UAAU,eAAe,SAAS;AAAA,EACnE;AACA,QAAM,oBAAoB,oBAAoB,SAAS;AACvD,QAAM,kBAAkB,oBAAoB,OAAO;AACnD,SAAO,WAAW;AAAA,IAChB,CAAC,cAAc,kBAAkB,IAAI,SAAS,KAAK,gBAAgB,IAAI,SAAS;AAAA,EAClF;AACF;AAEA,SAAS,sBACP,YACA,UACA,WACM;AACN,QAAM,aAAa,WAAW,IAAI,QAAQ;AAC1C,MAAI,WAAY,YAAW,KAAK,SAAS;AAAA,MACpC,YAAW,IAAI,UAAU,CAAC,SAAS,CAAC;AAC3C;AAEA,SAAS,oBACP,YACqC;AACrC,QAAM,WAAW,oBAAI,IAAoC;AACzD,aAAW,cAAc,WAAW,OAAO,GAAG;AAC5C,eAAW,KAAK,uBAAuB;AACvC,eAAW,aAAa,WAAW,MAAM,GAAG,8BAA8B;AACxE,eAAS,IAAI,SAAS;AAAA,EAC1B;AACA,SAAO;AACT;AAEA,SAAS,wBACP,GACA,GACQ;AACR,SACE,OAAO,EAAE,gBAAgB,IAAI,OAAO,EAAE,gBAAgB,KACtD,EAAE,WAAW,EAAE,YACf,EAAE,qBAAqB,EAAE,sBACzB,KAAK,IAAI,EAAE,kBAAkB,EAAE,aAAa,IAAI,KAAK,IAAI,EAAE,kBAAkB,EAAE,aAAa,KAC5F,EAAE,kBAAkB,EAAE,mBACtB,EAAE,gBAAgB,EAAE;AAExB;AAEA,SAAS,yBACP,SACA,OACA,kBACA,SACA,QACyB;AACzB,QAAM,mBAA2D,iBAC9D,IAAI,CAAC,eAAe;AAAA,IACnB,GAAG;AAAA,IACH,OAAO,QAAQ,UAAU,iBAAiB,UAAU,aAAa;AAAA,EACnE,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,wBAAwB,GAAG,CAAC,CAAC;AACpE,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACA,CAAC,cAAc,UAAU;AAAA,IACzB,CAAC,cAAc,UAAU;AAAA,EAC3B;AACA,QAAM,cAAc;AAAA,IAClB;AAAA,IACA,CAAC,cAAc,UAAU;AAAA,IACzB,CAAC,cAAc,UAAU;AAAA,EAC3B;AACA,QAAM,cAAc,oBAAI,IAAY;AACpC,QAAM,YAAY,oBAAI,IAAY;AAClC,QAAM,QAAiC,CAAC;AAExC,aAAW,aAAa,kBAAkB;AACxC,QAAI,UAAU,QAAQ,OAAO,wBAAyB;AACtD,QAAI,YAAY,IAAI,UAAU,eAAe,KAAK,UAAU,IAAI,UAAU,aAAa;AACrF;AACF,QAAI,CAAC,wBAAwB,SAAS,EAAG;AACzC,UAAM,iBAAiB,KAAK;AAAA,MAC1B,wBAAwB,cAAc,IAAI,UAAU,eAAe,GAAG,UAAU,KAAK;AAAA,MACrF,wBAAwB,YAAY,IAAI,UAAU,aAAa,GAAG,UAAU,KAAK;AAAA,MACjF,+BAA+B,WAAW,QAAQ,QAAQ,MAAM,QAAQ,OAAO;AAAA,IACjF;AACA,QAAI,CAAC,OAAO,gCAAgC,UAAU,OAAO,cAAc,EAAG;AAC9E,gBAAY,IAAI,UAAU,eAAe;AACzC,cAAU,IAAI,UAAU,aAAa;AACrC,UAAM,KAAK;AAAA,MACT,cAAc,cAAc,SAAS,UAAU,eAAe,EAAE;AAAA,MAChE,YAAY,cAAc,OAAO,UAAU,aAAa,EAAE;AAAA,MAC1D,YAAY,OAAO,mBAAmB,UAAU,OAAO,cAAc;AAAA,IACvE,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,SAAS,+BACP,WACA,eACA,aACA,SACQ;AACR,MAAI,iBAAiB;AACrB,MACE,UAAU,kBAAkB,eAC5B,UAAU,kBAAkB,UAAU;AAEtC,qBAAiB,QAAQ,UAAU,iBAAiB,UAAU,eAAe;AAC/E,MACE,UAAU,gBAAgB,iBAC1B,UAAU,oBAAoB,UAAU;AAExC,qBAAiB,KAAK;AAAA,MACpB;AAAA,MACA,QAAQ,UAAU,eAAe,UAAU,aAAa;AAAA,IAC1D;AACF,SAAO;AACT;AAEA,SAAS,wBAAwB,WAAoD;AACnF,MAAI,CAAC,UAAU,oBAAoB,UAAU,qBAAqB;AAChE,WAAO;AACT,SACE,UAAU,WAAW,UAAU,oBAAoB,8BACnD,UAAU,oBAAoB,UAAU,WAAW;AAEvD;AAOA,SAAS,qBACP,SACA,OACsB;AACtB,SAAO;AAAA,IACL,SAAS,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,UAAU,CAAC,KAAK,OAAO,KAAK,CAAC,CAAC;AAAA,IAClE,OAAO,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,UAAU,CAAC,KAAK,OAAO,KAAK,CAAC,CAAC;AAAA,EAChE;AACF;AAEA,SAAS,cACP,OACA,OACuB;AACvB,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,SAAS,OAAW,OAAM,IAAI,WAAW,wBAAwB,KAAK,EAAE;AAC5E,SAAO;AACT;;;AC9XO,SAAS,kBACd,SACA,OACmB;AACnB,MAAI,QAAQ,WAAW,KAAK,MAAM,WAAW,EAAG,QAAO,CAAC;AACxD,MAAI,QAAQ,SAAS,MAAM,SAAS;AAClC,WAAO,wBAAwB,SAAS,OAAO,2BAA2B;AAC5E,QAAM,sBAAsB,+BAA+B,SAAS,KAAK;AACzE,QAAMC,eAAc,sBAAsB,mBAAmB;AAC7D,QAAM,EAAE,iBAAiB,cAAc,IAAI;AAC3C,QAAM,iBAAiB,gBAAgB;AAAA,IAAI,CAAC,WAC1C,0BAA0B,QAAQA,YAAW;AAAA,EAC/C;AACA,QAAM,eAAe,cAAc;AAAA,IAAI,CAAC,WACtC,0BAA0B,QAAQA,YAAW;AAAA,EAC/C;AACA,QAAM,SAAS,gBAAgB;AAAA,IAAI,CAAC,cAAc,oBAChD,cAAc;AAAA,MAAI,CAAC,aAAa,kBAC9B;AAAA,QACE;AAAA,QACA;AAAA,QACAA;AAAA,QACA;AAAA,QACA,eAAe,eAAe;AAAA,QAC9B,aAAa,aAAa;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AACA,QAAM,eAAe;AAAA,IACnB,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,CAAC,iBAAiB,kBAAkB;AAClC,YAAM,QAAQ,OAAO,eAAe,IAAI,aAAa,KAAK;AAC1D,aAAO,SAAS,8BAA8B,QAAQ,OAAO,OAAO;AAAA,IACtE;AAAA,EACF;AACA,MAAI,aAAa,WAAW,KAAK,QAAQ,WAAW,KAAK,MAAM,WAAW;AACxE,WAAO;AAAA,MACL;AAAA,QACE,cAAcC,eAAc,SAAS,CAAC,EAAE;AAAA,QACxC,YAAYA,eAAc,OAAO,CAAC,EAAE;AAAA,QACpC,YAAY;AAAA,MACd;AAAA,IACF;AACF,QAAM,YAAYC,sBAAqB,SAAS,KAAK;AACrD,QAAM,iBAAiB;AAAA,IACrB;AAAA,IACA;AAAA,IACA,2BAA2B,SAAS,OAAO,QAAQ,YAAY;AAAA,EACjE;AACA,SAAO,iBAAiB,SAAS,OAAO,QAAQ,WAAW,cAAc;AAC3E;AAEA,IAAM,8BAA8B;AACpC,IAAM,qCAAqC;AAC3C,IAAM,qCAAqC;AAC3C,IAAM,oCAAoC;AAC1C,IAAM,0CAA0C;AAChD,IAAM,uCAAuC;AAC7C,IAAM,sCAAsC;AAC5C,IAAM,8BAA8B;AAEpC,IAAM,8BAAwD;AAAA,EAC5D,gCAAgC;AAAA,EAChC,yBAAyB;AAAA,EACzB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAOA,SAASA,sBACP,SACA,OACsB;AACtB,SAAO;AAAA,IACL,SAAS,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,UAAU,CAAC,KAAK,OAAO,KAAK,CAAC,CAAC;AAAA,IAClE,OAAO,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,UAAU,CAAC,KAAK,OAAO,KAAK,CAAC,CAAC;AAAA,EAChE;AACF;AAEA,SAAS,0BACP,WACA,QACA,OACmB;AACnB,QAAM,iBAAoC,CAAC;AAC3C,aAAW,CAAC,cAAc,UAAU,KAAK,OAAO;AAC9C,UAAM,kBAAkB,UAAU,QAAQ,IAAI,YAAY;AAC1D,UAAM,gBAAgB,UAAU,MAAM,IAAI,UAAU;AACpD,QAAI,oBAAoB,UAAa,kBAAkB,OAAW;AAClE,UAAM,QAAQ,OAAO,eAAe,IAAI,aAAa,KAAK;AAC1D,UAAM,iBAAiB,0BAA0B,QAAQ,iBAAiB,aAAa;AACvF,QAAI,gCAAgC,OAAO,cAAc,EAAG;AAC5D,mBAAe,KAAK;AAAA,MAClB;AAAA,MACA;AAAA,MACA,YAAY,mBAAmB,OAAO,cAAc;AAAA,IACtD,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,SAAS,0BACP,QACA,iBACA,eACA,aACA,WACQ;AACR,SAAO;AAAA,IACL,OAAO;AAAA,IACP,OAAO,eAAe,GAAG,UAAU;AAAA,IACnC;AAAA,IACA;AAAA,IACA,CAAC,0BAA0B,2BACzB,OAAO,wBAAwB,IAAI,sBAAsB,KAAK;AAAA,IAChE;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,4BACP,eACA,aACA,iBACA,eACA,SACA,aACA,WACQ;AACR,MAAI,iBAAiB;AACrB,WACM,yBAAyB,GAC7B,yBAAyB,aACzB,0BACA;AACA,QAAI,2BAA2B,iBAAiB,WAAW,IAAI,sBAAsB;AACnF;AACF,qBAAiB,KAAK,IAAI,gBAAgB,QAAQ,iBAAiB,sBAAsB,CAAC;AAAA,EAC5F;AACA,WACM,2BAA2B,GAC/B,2BAA2B,eAC3B,4BACA;AACA,QAAI,6BAA6B,mBAAmB,aAAa,IAAI,wBAAwB;AAC3F;AACF,qBAAiB,KAAK,IAAI,gBAAgB,QAAQ,0BAA0B,aAAa,CAAC;AAAA,EAC5F;AACA,SAAO;AACT;AAEA,SAAS,gCAAgC,OAAe,gBAAiC;AACvF,SACE,kBAAkB,uCACjB,QAAQ,kBAAkB,sCACzB,kBAAkB,QAAQ;AAEhC;AAEA,SAAS,gCAAgC,OAAe,gBAAiC;AACvF,SAAO,QAAQ,kBAAkB,CAAC,gCAAgC,OAAO,cAAc;AACzF;AAEA,SAAS,mBAAmB,OAAe,gBAA8C;AACvF,MACE,SAAS,2CACT,QAAQ,kBAAkB,wCAC1B,kBAAkB,QAAQ;AAE1B,WAAO;AACT,SAAO;AACT;AAEA,SAAS,iBACP,SACA,OACA,QACA,WACA,OACmB;AACnB,QAAM,cAAc,oBAAI,IAAY;AACpC,QAAM,YAAY,oBAAI,IAAY;AAClC,aAAW,QAAQ,OAAO;AACxB,UAAM,kBAAkB,UAAU,QAAQ,IAAI,KAAK,YAAY;AAC/D,UAAM,gBAAgB,UAAU,MAAM,IAAI,KAAK,UAAU;AACzD,QAAI,oBAAoB,OAAW,aAAY,IAAI,eAAe;AAClE,QAAI,kBAAkB,OAAW,WAAU,IAAI,aAAa;AAAA,EAC9D;AAEA,QAAM,aAAyC,CAAC;AAChD,WAAS,kBAAkB,GAAG,kBAAkB,QAAQ,QAAQ,mBAAmB;AACjF,QAAI,YAAY,IAAI,eAAe,EAAG;AACtC,aAAS,gBAAgB,GAAG,gBAAgB,MAAM,QAAQ,iBAAiB;AACzE,UAAI,UAAU,IAAI,aAAa,EAAG;AAClC,YAAM,QAAQ,OAAO,eAAe,IAAI,aAAa,KAAK;AAC1D,UAAI,SAAS;AACX,mBAAW,KAAK,EAAE,iBAAiB,eAAe,MAAM,CAAC;AAAA,IAC7D;AAAA,EACF;AACA,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC3C,QAAM,kBAAkB,2BAA2B,MAAM;AAEzD,QAAM,MAAM,CAAC,GAAG,KAAK;AACrB,aAAW,aAAa,YAAY;AAClC,QAAI,YAAY,IAAI,UAAU,eAAe,KAAK,UAAU,IAAI,UAAU,aAAa;AACrF;AACF,QAAI;AACJ,QAAI,UAAU,SAAS,yCAAyC;AAC9D,YAAM,0BAA0B;AAAA,QAC9B;AAAA,QACA,UAAU;AAAA,QACV,UAAU;AAAA,QACV;AAAA,QACA;AAAA,MACF;AACA,UAAI,mBAAmB,UAAU,OAAO,uBAAuB,MAAM;AACnE,qBAAa;AAAA,IACjB;AACA,mBAAe,iCAAiC,iBAAiB,SAAS;AAC1E,QAAI,CAAC,WAAY;AACjB,gBAAY,IAAI,UAAU,eAAe;AACzC,cAAU,IAAI,UAAU,aAAa;AACrC,QAAI,KAAK;AAAA,MACP,cAAcD,eAAc,SAAS,UAAU,eAAe,EAAE;AAAA,MAChE,YAAYA,eAAc,OAAO,UAAU,aAAa,EAAE;AAAA,MAC1D;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO,IAAI;AAAA,IACT,CAAC,GAAG,OACD,UAAU,QAAQ,IAAI,EAAE,YAAY,KAAK,MAAM,UAAU,QAAQ,IAAI,EAAE,YAAY,KAAK;AAAA,EAC7F;AACF;AAOA,SAAS,2BAA2B,QAAgD;AAClF,QAAM,UAAmC,CAAC;AAC1C,QAAM,QAAiC,CAAC;AACxC,WAAS,kBAAkB,GAAG,kBAAkB,OAAO,QAAQ,mBAAmB;AAChF,UAAM,gBAAgB,OAAO,eAAe,KAAK,CAAC;AAClD,aAAS,gBAAgB,GAAG,gBAAgB,cAAc,QAAQ,iBAAiB;AACjF,YAAM,QAAQ,cAAc,aAAa,KAAK;AAC9C,wBAAkB,SAAS,iBAAiB,KAAK;AACjD,wBAAkB,OAAO,eAAe,KAAK;AAAA,IAC/C;AAAA,EACF;AACA,SAAO,EAAE,SAAS,MAAM;AAC1B;AAEA,SAAS,kBAAkB,QAAiC,UAAkB,OAAqB;AACjG,QAAM,UAAU,OAAO,QAAQ,KAAK,EAAE,MAAM,GAAG,QAAQ,EAAE;AACzD,MAAI,SAAS,QAAQ,MAAM;AACzB,YAAQ,SAAS,QAAQ;AACzB,YAAQ,OAAO;AAAA,EACjB,WAAW,QAAQ,QAAQ,OAAQ,SAAQ,SAAS;AACpD,SAAO,QAAQ,IAAI;AACrB;AAEA,SAAS,iCACP,iBACA,WACkC;AAClC,QAAM,iBAAiB,KAAK;AAAA,IAC1B,wBAAwB,gBAAgB,QAAQ,UAAU,eAAe,GAAG,UAAU,KAAK;AAAA,IAC3F,wBAAwB,gBAAgB,MAAM,UAAU,aAAa,GAAG,UAAU,KAAK;AAAA,EACzF;AACA,MAAI,CAAC,gCAAgC,UAAU,OAAO,cAAc,EAAG,QAAO;AAC9E,SAAO,mBAAmB,UAAU,OAAO,cAAc;AAC3D;AAEA,SAAS,2BACP,SACA,OACA,QACA,cACwB;AACxB,QAAM,QAAgC,CAAC;AACvC,MAAI,gBAAgB;AACpB,MAAI,cAAc;AAClB,aAAW,CAAC,iBAAiB,aAAa,KAAK,cAAc;AAC3D,UAAM;AAAA,MACJ,GAAG;AAAA,QACD;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,UAAM,KAAK;AAAA,MACTA,eAAc,SAAS,eAAe,EAAE;AAAA,MACxCA,eAAc,OAAO,aAAa,EAAE;AAAA,IACtC,CAAC;AACD,oBAAgB,kBAAkB;AAClC,kBAAc,gBAAgB;AAAA,EAChC;AACA,QAAM;AAAA,IACJ,GAAG;AAAA,MACD;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA,MAAM;AAAA,IACR;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,cACP,SACA,OACA,QACA,cACA,YACA,YACA,UACwB;AACxB,QAAM,QAAgC,CAAC;AACvC,QAAM,QAAQ,KAAK,IAAI,aAAa,cAAc,WAAW,UAAU;AACvE,WAAS,SAAS,GAAG,SAAS,OAAO,UAAU;AAC7C,UAAM,kBAAkB,eAAe;AACvC,UAAM,gBAAgB,aAAa;AACnC,UAAM,QAAQ,OAAO,eAAe,IAAI,aAAa,KAAK;AAC1D,QAAI,QAAQ,mCAAoC;AAChD,UAAM,KAAK;AAAA,MACTA,eAAc,SAAS,eAAe,EAAE;AAAA,MACxCA,eAAc,OAAO,aAAa,EAAE;AAAA,IACtC,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,SAASA,eACP,OACA,OACuB;AACvB,QAAM,OAAO,MAAM,KAAK;AACxB,MAAI,SAAS,OAAW,OAAM,IAAI,WAAW,wBAAwB,KAAK,EAAE;AAC5E,SAAO;AACT;;;AC/XO,SAAS,oBAAoB,QAA6B,OAAgC;AAC/F,QAAM,SAAsB,CAAC;AAC7B,WAAS,QAAQ,MAAM,OAAO,QAAQ,MAAM,KAAK,SAAS;AACxD,UAAM,QAAQ,OAAO,KAAK;AAC1B,QAAI,MAAO,kBAAiB,QAAQ,KAAK;AAAA,EAC3C;AACA,SAAO;AACT;AAEO,SAAS,eAAe,QAAqB,OAAgC;AAClF,SAAO,KAAK,CAAC,MAAM,OAAO,MAAM,GAAG,CAAC;AACtC;AAEO,SAAS,mBAAmB,QAAkC;AACnE,SAAO,YAAY,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC5D;AAEO,SAAS,YAAY,QAAkC;AAC5D,QAAM,SAAsB,CAAC;AAC7B,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,OAAO,GAAG,EAAE;AAC7B,QAAI,YAAY,MAAM,CAAC,IAAI,SAAS,CAAC,KAAK,EAAG,UAAS,CAAC,IAAI,MAAM,CAAC;AAAA,QAC7D,QAAO,KAAK,CAAC,GAAG,KAAK,CAAC;AAAA,EAC7B;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,QAAqB,OAAgC;AAC7E,QAAM,WAAW,OAAO,GAAG,EAAE;AAC7B,MAAI,YAAY,MAAM,QAAQ,SAAS,CAAC,KAAK,EAAG,UAAS,CAAC,IAAI,MAAM;AAAA,MAC/D,QAAO,KAAK,CAAC,MAAM,OAAO,MAAM,GAAG,CAAC;AAC3C;;;ACpCA,IAAM,yBAAyB;AAC/B,IAAM,oBAAoB,IAAI,KAAK,UAAU,QAAW,EAAE,aAAa,WAAW,CAAC;AAK5E,SAAS,mBAAmB,QAAgB,OAAuB;AACxE,QAAM,SAAS,2BAA2B,QAAQ,KAAK;AACvD,MAAI,CAAC,yBAAyB,MAAM,KAAK,CAAC,yBAAyB,KAAK,EAAG,QAAO;AAClF,SAAO,2BAA2B,QAAQ,OAAO,MAAM;AACzD;AAEO,SAAS,mBAAmB,QAAgB,OAAe,cAA8B;AAC9F,QAAM,SAAS,2BAA2B,QAAQ,OAAO,YAAY;AACrE,MAAI,CAAC,yBAAyB,MAAM,KAAK,CAAC,yBAAyB,KAAK,EAAG,QAAO;AAClF,SAAO,2BAA2B,QAAQ,OAAO,MAAM;AACzD;AAEO,SAAS,yBAAyB,MAAuB;AAC9D,SAAO,uBAAuB,KAAK,IAAI,KAAK,KAAK,SAAS,MAAM;AAClE;AAEO,SAAS,qBAAqB,MAAqC;AACxE,MAAI,CAAC,yBAAyB,IAAI,GAAG;AACnC,WAAO,MAAM,KAAK,EAAE,QAAQ,KAAK,OAAO,GAAG,CAAC,GAAG,WAAW;AAAA,MACxD,OAAO,KAAK,KAAK,KAAK;AAAA,MACtB,OAAO;AAAA,MACP,KAAK,QAAQ;AAAA,IACf,EAAE;AAAA,EACJ;AAEA,SAAO,MAAM,KAAK,kBAAkB,QAAQ,IAAI,GAAG,CAAC,aAAa;AAAA,IAC/D,OAAO,QAAQ;AAAA,IACf,OAAO,QAAQ;AAAA,IACf,KAAK,QAAQ,QAAQ,QAAQ,QAAQ;AAAA,EACvC,EAAE;AACJ;AAEO,SAAS,2BACd,MACA,QACyB;AACzB,MAAI,OAAO,WAAW,KAAK,CAAC,yBAAyB,IAAI,EAAG,QAAO;AAEnE,QAAM,gBAAgB,kBAAkB,QAAQ,IAAI;AACpD,SAAO,OAAO,IAAI,CAAC,CAAC,OAAO,GAAG,MAAM;AAAA,IAClC,wBAAwB,eAAe,OAAO,KAAK,MAAM;AAAA,IACzD,qBAAqB,eAAe,KAAK,KAAK,MAAM;AAAA,EACtD,CAAC;AACH;AAEA,SAAS,2BAA2B,QAAgB,OAAuB;AACzE,QAAM,MAAM,KAAK,IAAI,OAAO,QAAQ,MAAM,MAAM;AAChD,MAAI,QAAQ;AACZ,SAAO,QAAQ,OAAO,OAAO,KAAK,MAAM,MAAM,KAAK,EAAG;AACtD,SAAO;AACT;AAEA,SAAS,2BAA2B,QAAgB,OAAe,cAA8B;AAC/F,QAAM,YAAY,KAAK,IAAI,OAAO,QAAQ,MAAM,MAAM,IAAI;AAC1D,MAAI,SAAS;AACb,SACE,SAAS,aACT,OAAO,OAAO,SAAS,IAAI,MAAM,MAAM,MAAM,MAAM,SAAS,IAAI,MAAM;AAEtE;AACF,SAAO;AACT;AAEA,SAAS,2BAA2B,QAAgB,OAAe,QAAwB;AACzF,QAAM,iBAAiB,kBAAkB,QAAQ,MAAM;AACvD,QAAM,gBAAgB,kBAAkB,QAAQ,KAAK;AACrD,MAAI,aAAa;AACjB,SAAO,aAAa,GAAG;AACrB,UAAM,iBAAiB,2BAA2B,gBAAgB,UAAU;AAC5E,UAAM,gBAAgB,2BAA2B,eAAe,UAAU;AAC1E,UAAM,aAAa,KAAK,IAAI,gBAAgB,aAAa;AACzD,QAAI,eAAe,WAAY;AAC/B,iBAAa;AAAA,EACf;AACA,SAAO;AACT;AAEA,SAAS,2BAA2B,QAAgB,OAAe,QAAwB;AACzF,QAAM,iBAAiB,kBAAkB,QAAQ,MAAM;AACvD,QAAM,gBAAgB,kBAAkB,QAAQ,KAAK;AACrD,MAAI,aAAa;AACjB,SAAO,aAAa,GAAG;AACrB,UAAM,cAAc,OAAO,SAAS;AACpC,UAAM,aAAa,MAAM,SAAS;AAClC,UAAM,aACJ,0BAA0B,gBAAgB,aAAa,OAAO,MAAM,IAAI;AAC1E,UAAM,YACJ,0BAA0B,eAAe,YAAY,MAAM,MAAM,IAAI;AACvE,UAAM,OAAO,KAAK,IAAI,YAAY,SAAS;AAC3C,QAAI,SAAS,EAAG;AAChB,iBAAa,KAAK,IAAI,GAAG,aAAa,IAAI;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,2BAA2B,UAA4B,QAAwB;AACtF,MAAI,UAAU,EAAG,QAAO;AACxB,QAAM,UAAU,SAAS,WAAW,SAAS,CAAC;AAC9C,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,aAAa,QAAQ,QAAQ,QAAQ,QAAQ;AACnD,SAAO,eAAe,SAAS,SAAS,QAAQ;AAClD;AAEA,SAAS,0BACP,UACA,QACA,YACQ;AACR,MAAI,UAAU,EAAG,QAAO;AACxB,MAAI,UAAU,WAAY,QAAO;AACjC,QAAM,UAAU,SAAS,WAAW,MAAM;AAC1C,MAAI,CAAC,WAAW,QAAQ,UAAU,OAAQ,QAAO;AACjD,SAAO,QAAQ,QAAQ,QAAQ,QAAQ;AACzC;AAEA,SAAS,wBACP,UACA,QACA,YACQ;AACR,MAAI,UAAU,EAAG,QAAO;AACxB,MAAI,UAAU,WAAY,QAAO;AACjC,SAAO,SAAS,WAAW,MAAM,GAAG,SAAS;AAC/C;AAEA,SAAS,qBACP,UACA,QACA,YACQ;AACR,MAAI,UAAU,EAAG,QAAO;AACxB,MAAI,UAAU,WAAY,QAAO;AACjC,QAAM,UAAU,SAAS,WAAW,SAAS,CAAC;AAC9C,SAAO,UAAU,QAAQ,QAAQ,QAAQ,QAAQ,SAAS;AAC5D;;;ACvIA,IAAM,oCAAoC;AAInC,SAAS,wBACd,QACA,aACA,WACA,OACA,YACA,UACA,MACsB;AACtB,SACE,cAAc,aACd,aAAa,YACb,QAAQ,QAAQ,WAAW,EAAE,UAAU,QAAQ,OAAO,UAAU,EAAE,OAClE;AACA;AACA;AAAA,EACF;AAEA,SACE,cAAc,aACd,aAAa,YACb,QAAQ,QAAQ,YAAY,CAAC,EAAE,UAAU,QAAQ,OAAO,WAAW,CAAC,EAAE,OACtE;AACA;AACA;AAAA,EACF;AAEA,MAAI,gBAAgB,aAAa,eAAe,UAAU;AACxD,0BAAsB,MAAM,aAAa,WAAW,YAAY,QAAQ;AACxE,WAAO;AAAA,EACT;AAEA,QAAM,eAAe,YAAY;AACjC,QAAM,cAAc,WAAW;AAC/B,MAAI,eAAe,eAAe,mCAAmC;AACnE,iCAA6B,QAAQ,aAAa,WAAW,OAAO,YAAY,UAAU,IAAI;AAC9F,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,qBAAqB,QAAQ,aAAa,WAAW,OAAO,YAAY,QAAQ;AAChG,MAAI,QAAQ,WAAW,GAAG;AACxB,0BAAsB,MAAM,aAAa,WAAW,YAAY,QAAQ;AACxE,WAAO;AAAA,EACT;AAEA,MAAI,aAAmC;AACvC,MAAI,iBAAiB;AACrB,MAAI,gBAAgB;AACpB,aAAW,UAAU,SAAS;AAC5B,iBAAa;AAAA,MACX;AAAA,MACA;AAAA,QACE;AAAA,QACA;AAAA,QACA,OAAO;AAAA,QACP;AAAA,QACA;AAAA,QACA,OAAO;AAAA,QACP;AAAA,MACF;AAAA,IACF;AACA,qBAAiB,OAAO,cAAc;AACtC,oBAAgB,OAAO,aAAa;AAAA,EACtC;AACA,eAAa;AAAA,IACX;AAAA,IACA;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,0BAA0B,YAAY,QAAQ;AACvD;AAEA,SAAS,0BACP,GACA,GACsB;AACtB,SAAO,4BAA4B,CAAC,KAAK,4BAA4B,CAAC,IAAI,IAAI;AAChF;AAEA,IAAM,8BAA8B;AAAA,EAClC,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,MAAM;AACR;AAEA,SAAS,6BACP,QACA,aACA,WACA,OACA,YACA,UACA,MACM;AACN,QAAM,eAAe,YAAY;AACjC,QAAM,cAAc,WAAW;AAC/B,QAAM,QAAQ,mBAAmB,cAAc,aAAa,CAACE,cAAaC,gBAAe;AACvF,UAAM,cAAc,QAAQ,QAAQ,cAAcD,YAAW;AAC7D,UAAM,aAAa,QAAQ,OAAO,aAAaC,WAAU;AACzD,WAAO,YAAY,UAAU,WAAW,QACpC,wBAAwB,YAAY,KAAK,IACzC,OAAO;AAAA,EACb,CAAC;AAED,MAAI,cAAc;AAClB,MAAI,aAAa;AACjB,aAAW,CAAC,iBAAiB,cAAc,KAAK,OAAO;AACrD;AAAA,MACE;AAAA,MACA,cAAc;AAAA,MACd,cAAc;AAAA,MACd,aAAa;AAAA,MACb,aAAa;AAAA,IACf;AACA,kBAAc,kBAAkB;AAChC,iBAAa,iBAAiB;AAAA,EAChC;AACA;AAAA,IACE;AAAA,IACA,cAAc;AAAA,IACd;AAAA,IACA,aAAa;AAAA,IACb;AAAA,EACF;AACF;AAEA,SAAS,qBACP,QACA,aACA,WACA,OACA,YACA,UACoD;AACpD,QAAM,eAAe,YAAY,QAAQ,aAAa,SAAS;AAC/D,QAAM,cAAc,YAAY,OAAO,YAAY,QAAQ;AAC3D,QAAM,qBAAqB,oBAAI,IAAoB;AACnD,WAAS,QAAQ,YAAY,QAAQ,UAAU,SAAS;AACtD,UAAM,QAAQ,QAAQ,OAAO,KAAK,EAAE;AACpC,QAAI,aAAa,IAAI,KAAK,MAAM,KAAK,YAAY,IAAI,KAAK,MAAM;AAC9D,yBAAmB,IAAI,OAAO,KAAK;AAAA,EACvC;AACA,QAAM,aAAiE,CAAC;AACxE,WAAS,QAAQ,aAAa,QAAQ,WAAW,SAAS;AACxD,UAAM,QAAQ,QAAQ,QAAQ,KAAK,EAAE;AACrC,QAAI,aAAa,IAAI,KAAK,MAAM,KAAK,YAAY,IAAI,KAAK,MAAM,EAAG;AACnE,UAAM,aAAa,mBAAmB,IAAI,KAAK;AAC/C,QAAI,eAAe,OAAW,YAAW,KAAK,EAAE,aAAa,OAAO,WAAW,CAAC;AAAA,EAClF;AACA,SAAO,8BAA8B,UAAU;AACjD;AAEA,SAAS,8BACP,YACoD;AACpD,MAAI,WAAW,UAAU,EAAG,QAAO;AACnC,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAW,MAAM,KAAK,EAAE,QAAQ,WAAW,OAAO,GAAG,MAAM,EAAE;AACnE,QAAM,uBAAiC,CAAC;AAExC,WAASC,SAAQ,GAAGA,SAAQ,WAAW,QAAQA,UAAS;AACtD,UAAM,aAAa,YAAY,YAAYA,MAAK,EAAE;AAClD,QAAI,MAAM;AACV,QAAI,OAAO,MAAM;AACjB,WAAO,MAAM,MAAM;AACjB,YAAM,SAAU,MAAM,QAAS;AAC/B,UAAI,SAAS,OAAO,MAAM,IAAI,WAAY,OAAM,SAAS;AAAA,UACpD,QAAO;AAAA,IACd;AACA,QAAI,MAAM,EAAG,UAASA,MAAK,IAAI,SAAS,sBAAsB,MAAM,CAAC;AACrE,UAAM,GAAG,IAAI;AACb,yBAAqB,GAAG,IAAIA;AAAA,EAC9B;AAEA,QAAM,UAA8D,CAAC;AACrE,MAAI,QAAQ,qBAAqB,MAAM,SAAS,CAAC,KAAK;AACtD,SAAO,SAAS,GAAG;AACjB,YAAQ,KAAK,YAAY,YAAY,KAAK,CAAC;AAC3C,YAAQ,SAAS,KAAK,KAAK;AAAA,EAC7B;AACA,SAAO,QAAQ,QAAQ;AACzB;AAEA,SAAS,YAAY,QAA6B,OAAe,KAAkC;AACjG,QAAM,SAAS,oBAAI,IAAoB;AACvC,WAAS,QAAQ,OAAO,QAAQ,KAAK,SAAS;AAC5C,UAAM,QAAQ,QAAQ,QAAQ,KAAK,EAAE;AACrC,WAAO,IAAI,QAAQ,OAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAAA,EAChD;AACA,SAAO;AACT;AAEA,SAAS,sBACP,MACA,aACA,WACA,YACA,UACM;AACN,MAAI,gBAAgB,aAAa,eAAe,SAAU;AAC1D,OAAK,KAAK;AAAA,IACR,SAAS,EAAE,OAAO,aAAa,KAAK,UAAU;AAAA,IAC9C,OAAO,EAAE,OAAO,YAAY,KAAK,SAAS;AAAA,EAC5C,CAAC;AACH;AAEA,SAAS,QAAQ,QAA6B,OAAkC;AAC9E,QAAM,QAAQ,OAAO,KAAK;AAC1B,MAAI,UAAU,OAAW,OAAM,IAAI,WAAW,+BAA+B,KAAK,EAAE;AACpF,SAAO;AACT;AAEA,SAAS,YACP,YACA,OAC6C;AAC7C,QAAM,YAAY,WAAW,KAAK;AAClC,MAAI,cAAc,OAAW,OAAM,IAAI,WAAW,4BAA4B,KAAK,EAAE;AACrF,SAAO;AACT;AAEA,SAAS,SAAS,QAAkB,OAAuB;AACzD,QAAM,QAAQ,OAAO,KAAK;AAC1B,MAAI,UAAU,OAAW,OAAM,IAAI,WAAW,yBAAyB,KAAK,EAAE;AAC9E,SAAO;AACT;;;AChOA,IAAM,mCAAmC;AACzC,IAAM,6BAA6B;AACnC,IAAM,iCAAiC;AACvC,IAAM,0CAA0C;AASzC,SAAS,uBACd,aACA,YAC8B;AAC9B,MAAI,YAAY,UAAU,WAAW,MAAO,QAAO;AACnD,QAAM,SAAS,mBAAmB,YAAY,OAAO,WAAW,KAAK;AACrE,QAAM,SAAS,mBAAmB,YAAY,OAAO,WAAW,OAAO,MAAM;AAC7E,MAAI,CAAC,sBAAsB,YAAY,OAAO,WAAW,OAAO,QAAQ,MAAM,EAAG,QAAO;AACxF,QAAM,UAAU,kCAAkC,aAAa,YAAY,QAAQ,MAAM;AACzF,MAAI,QAAS,QAAO;AAEpB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,MAAM,SAAS;AAAA,IAC3B;AAAA,IACA,WAAW,MAAM,SAAS;AAAA,EAC5B;AACF;AAEA,SAAS,kCACP,aACA,YACA,QACA,QAC8B;AAC9B,QAAM,cAAc,YAAY;AAChC,QAAM,aAAa,WAAW;AAC9B,MAAI,CAAC,kBAAkB,WAAW,KAAK,CAAC,kBAAkB,UAAU,EAAG,QAAO;AAC9E,MAAI,YAAY,SAAS,WAAW,SAAS,iCAAkC,QAAO;AACtF,MAAI,CAAC,+BAA+B,aAAa,YAAY,QAAQ,MAAM,EAAG,QAAO;AAErF,QAAM,iBAAiB,qBAAqB,WAAW;AACvD,QAAM,gBAAgB,qBAAqB,UAAU;AACrD,MACE,eAAe,SAAS,8BACxB,cAAc,SAAS,8BACvB,eAAe,SAAS,cAAc,SAAS;AAE/C,WAAO;AAET,QAAM,QAAQ;AAAA,IAAmB,eAAe;AAAA,IAAQ,cAAc;AAAA,IAAQ,CAAC,QAAQ,UACrF,UAAU,gBAAgB,MAAM,EAAE,UAAU,UAAU,eAAe,KAAK,EAAE,QACxE,IACA,OAAO;AAAA,EACb;AACA,QAAM,OAAO,eAAe,KAAK;AACjC,QAAM,WAAW,KAAK;AAAA,IACpB,CAAC,QACC,cAAc,KAAK,eAAe,QAAQ,cAAc,MAAM,KAC9D,IAAI,YAAY,IAAI,eAAe;AAAA,EACvC;AACA,QAAM,mBAAmB,SAAS;AAAA,IAChC,CAAC,QAAQ,CAAC,cAAc,KAAK,eAAe,QAAQ,cAAc,MAAM;AAAA,EAC1E,EAAE;AACF,MAAI,qBAAqB,KAAK,mBAAmB,+BAAgC,QAAO;AAExF,QAAM,UAAuB,CAAC;AAC9B,QAAM,QAAqB,CAAC;AAC5B,MAAI,cAAc;AAClB,MAAI,aAAa;AACjB,aAAW,OAAO,UAAU;AAC1B,yBAAqB,SAAS,aAAa,gBAAgB,aAAa,IAAI,WAAW;AACvF,yBAAqB,OAAO,YAAY,eAAe,YAAY,IAAI,UAAU;AACjF,kBAAc,IAAI;AAClB,iBAAa,IAAI;AAAA,EACnB;AACA,uBAAqB,SAAS,aAAa,gBAAgB,aAAa,eAAe,MAAM;AAC7F,uBAAqB,OAAO,YAAY,eAAe,YAAY,cAAc,MAAM;AAEvF,SAAO,QAAQ,SAAS,KAAK,MAAM,SAAS,IAAI,EAAE,SAAS,MAAM,IAAI;AACvE;AAEA,SAAS,mBACP,aACA,YACA,aACA,WACA,YACA,UAC8B;AAC9B,QAAM,UACJ,cAAc,YACV,CAAC,CAAC,YAAY,QAAQ,aAAa,YAAY,QAAQ,SAAS,CAAC,IACjE,CAAC;AACP,QAAM,QACJ,aAAa,WAAW,CAAC,CAAC,WAAW,QAAQ,YAAY,WAAW,QAAQ,QAAQ,CAAC,IAAI,CAAC;AAC5F,SAAO,QAAQ,SAAS,KAAK,MAAM,SAAS,IAAI,EAAE,SAAS,MAAM,IAAI;AACvE;AAEA,SAAS,+BACP,QACA,OACA,QACA,QACS;AACT,QAAM,eAAe,OAAO,MAAM,QAAQ,OAAO,SAAS,MAAM;AAChE,QAAM,cAAc,MAAM,MAAM,QAAQ,MAAM,SAAS,MAAM;AAC7D,QAAM,CAAC,SAAS,MAAM,IACpB,aAAa,UAAU,YAAY,SAC/B,CAAC,cAAc,WAAW,IAC1B,CAAC,aAAa,YAAY;AAChC,MAAI,QAAQ,SAAS,wCAAyC,QAAO;AAErE,WAAS,QAAQ,GAAG,SAAS,QAAQ,SAAS,yCAAyC,SAAS;AAC9F,UAAM,YAAY,QAAQ,MAAM,OAAO,QAAQ,uCAAuC;AACtF,QAAI,OAAO,SAAS,SAAS,EAAG,QAAO;AAAA,EACzC;AACA,SAAO;AACT;AAEA,SAAS,eAAe,OAAiD;AACvE,QAAM,OAAwB,CAAC;AAC/B,aAAW,CAAC,aAAa,UAAU,KAAK,OAAO;AAC7C,UAAM,WAAW,KAAK,GAAG,EAAE;AAC3B,QAAI,UAAU,cAAc,eAAe,SAAS,aAAa,YAAY;AAC3E,eAAS;AACT,eAAS;AAAA,IACX,OAAO;AACL,WAAK,KAAK;AAAA,QACR,aAAa;AAAA,QACb,WAAW,cAAc;AAAA,QACzB,YAAY;AAAA,QACZ,UAAU,aAAa;AAAA,MACzB,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,KAAoB,cAAsB,aAA8B;AAC7F,SACG,IAAI,gBAAgB,KAAK,IAAI,eAAe,KAC5C,IAAI,cAAc,gBAAgB,IAAI,aAAa;AAExD;AAEA,SAAS,qBACP,QACA,OACA,UACA,OACA,KACM;AACN,MAAI,SAAS,IAAK;AAClB,SAAO,KAAK;AAAA,IACV,MAAM,QAAQ,kBAAkB,UAAU,OAAO,MAAM,MAAM,MAAM;AAAA,IACnE,MAAM,QAAQ,kBAAkB,UAAU,KAAK,MAAM,MAAM,MAAM;AAAA,EACnE,CAAC;AACH;AAEA,SAAS,kBACP,UACA,OACA,YACQ;AACR,SAAO,UAAU,SAAS,SAAS,aAAa,UAAU,UAAU,KAAK,EAAE;AAC7E;AAEA,SAAS,UAAU,UAAiC,OAAoC;AACtF,QAAM,UAAU,SAAS,KAAK;AAC9B,MAAI,YAAY,OAAW,OAAM,IAAI,WAAW,wBAAwB,KAAK,EAAE;AAC/E,SAAO;AACT;AAEA,SAAS,sBACP,QACA,OACA,QACA,QACS;AACT,QAAM,mBAAmB,SAAS;AAClC,MAAI,qBAAqB,EAAG,QAAO;AACnC,MAAI,kBAAkB,MAAM,KAAK,kBAAkB,KAAK,GAAG;AACzD,QACE,mBAAmB,KACnB,CAAC,yBAAyB,MAAM,KAChC,CAAC,yBAAyB,KAAK;AAE/B,aAAO;AACT,QAAI,WAAW,KAAK,SAAS,GAAG;AAC9B,YAAM,sBAAsB,OAAO,SAAS;AAC5C,YAAM,qBAAqB,MAAM,SAAS;AAC1C,UACE,wBAAwB,sBACxB,KAAK,IAAI,qBAAqB,kBAAkB,IAAI;AAEpD,eAAO;AAAA,IACX;AACA,WAAO;AAAA,EACT;AACA,MAAI,cAAc,MAAM,KAAK,cAAc,KAAK,EAAG,QAAO;AAC1D,MAAI,0BAA0B,MAAM,KAAK,0BAA0B,KAAK,EAAG,QAAO;AAClF,SAAO;AACT;;;ACrMA,IAAM,iCAAiC;AACvC,IAAM,yCAAyC;AAExC,SAAS,8BACd,YACA,cACA,WACA,aACA,MACkB;AAClB,QAAM,SAAS,0BAA0B,cAAc,aAAa,IAAI;AACxE,SAAO;AAAA,IACL,SAAS,YAAY,2BAA2B,YAAY,OAAO,OAAO,CAAC;AAAA,IAC3E,OAAO,YAAY,2BAA2B,WAAW,OAAO,KAAK,CAAC;AAAA,EACxE;AACF;AAEA,SAAS,0BACP,cACA,aACA,MACkB;AAClB,QAAM,UAAuB,CAAC;AAC9B,QAAM,QAAqB,CAAC;AAE5B,aAAW,OAAO,MAAM;AACtB,UAAM,eAAe,mBAAmB,IAAI,OAAO;AACnD,UAAM,aAAa,mBAAmB,IAAI,KAAK;AAC/C,UAAM,UACJ,gBAAgB,aACZ,+BAA+B,cAAc,cAAc,aAAa,UAAU,IAClF;AACN,QAAI,SAAS;AACX,cAAQ,KAAK,GAAG,QAAQ,OAAO;AAC/B,YAAM,KAAK,GAAG,QAAQ,KAAK;AAC3B;AAAA,IACF;AACA,QAAI,aAAc,SAAQ,KAAK,GAAG,oBAAoB,cAAc,YAAY,CAAC;AACjF,QAAI,WAAY,OAAM,KAAK,GAAG,oBAAoB,aAAa,UAAU,CAAC;AAAA,EAC5E;AAEA,SAAO,EAAE,SAAS,YAAY,OAAO,GAAG,OAAO,YAAY,KAAK,EAAE;AACpE;AAEA,SAAS,mBAAmB,OAA2C;AACrE,SAAO,MAAM,QAAQ,MAAM,MAAM,QAAQ;AAC3C;AAEA,SAAS,+BACP,cACA,aACA,aACA,YAC8B;AAC9B,SACE,yBAAyB,cAAc,aAAa,aAAa,UAAU,KAC3E,4BAA4B,cAAc,aAAa,aAAa,UAAU;AAElF;AAEA,SAAS,yBACP,cACA,aACA,aACA,YAC8B;AAC9B,MAAI,YAAY,MAAM,YAAY,UAAU,KAAK,WAAW,MAAM,WAAW,UAAU;AACrF,WAAO;AACT,SAAO;AAAA,IACLC,SAAQ,cAAc,YAAY,KAAK;AAAA,IACvCA,SAAQ,aAAa,WAAW,KAAK;AAAA,EACvC;AACF;AAEA,SAAS,uBACP,aACA,YAC8B;AAC9B,QAAM,mBAAmB,6BAA6B,aAAa,UAAU;AAC7E,QAAM,aAAa,uBAAuB,aAAa,UAAU;AACjE,MAAI,oBAAoB,0BAA0B,kBAAkB,aAAa,UAAU,GAAG;AAC5F,QAAI,iDAAiD,aAAa,YAAY,UAAU;AACtF,aAAO;AACT,QACE,eACC,WAAW,QAAQ,WAAW,KAAK,WAAW,MAAM,WAAW,MAChE,sBAAsB,UAAU,IAAI,sBAAsB,gBAAgB;AAE1E,aAAO;AACT,WAAO;AAAA,EACT;AACA,SAAO,cAAc;AACvB;AAEA,SAAS,sBAAsB,QAAkC;AAC/D,MAAI,QAAQ;AACZ,aAAW,CAAC,OAAO,GAAG,KAAK,OAAO,QAAS,UAAS,MAAM;AAC1D,aAAW,CAAC,OAAO,GAAG,KAAK,OAAO,MAAO,UAAS,MAAM;AACxD,SAAO;AACT;AAEA,SAAS,iDACP,aACA,YACA,YACS;AACT,MAAI,WAAY,QAAO;AACvB,MAAI,CAAC,kBAAkB,YAAY,KAAK,KAAK,CAAC,kBAAkB,WAAW,KAAK,EAAG,QAAO;AAC1F,QAAM,kBAAkB,qBAAqB,YAAY,OAAO,CAAC,EAAE;AAAA,IAAO,CAAC,SACzE,2BAA2B,KAAK,KAAK;AAAA,EACvC,EAAE;AACF,QAAM,iBAAiB,qBAAqB,WAAW,OAAO,CAAC,EAAE;AAAA,IAAO,CAAC,SACvE,2BAA2B,KAAK,KAAK;AAAA,EACvC,EAAE;AACF,SAAO,KAAK,IAAI,iBAAiB,cAAc,MAAM,KAAK,oBAAoB;AAChF;AAEA,SAAS,4BACP,cACA,aACA,aACA,YAC8B;AAC9B,QAAM,SAAS,aAAa,MAAM,YAAY,OAAO,YAAY,GAAG;AACpE,QAAM,QAAQ,YAAY,MAAM,WAAW,OAAO,WAAW,GAAG;AAChE,MAAI,OAAO,SAAS,MAAM,SAAS,+BAAgC,QAAO;AAC1E,QAAM,QAAQ,sBAAsB,QAAQ,KAAK;AACjD,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,QAAM,eAAe,oBAAI,IAAY;AACrC,QAAM,cAAc,oBAAI,IAAY;AACpC,QAAM,UAAuB,CAAC;AAC9B,QAAM,QAAqB,CAAC;AAE5B,aAAW,CAAC,aAAa,UAAU,KAAK,OAAO;AAC7C,iBAAa,IAAI,WAAW;AAC5B,gBAAY,IAAI,UAAU;AAC1B,UAAM,cAAcA,SAAQ,QAAQ,WAAW;AAC/C,UAAM,aAAaA,SAAQ,OAAO,UAAU;AAC5C,QAAI,YAAY,UAAU,WAAW,MAAO;AAC5C,UAAM,UAAU,uBAAuB,aAAa,UAAU;AAC9D,QAAI,SAAS;AACX,cAAQ,KAAK,GAAG,QAAQ,OAAO;AAC/B,YAAM,KAAK,GAAG,QAAQ,KAAK;AAAA,IAC7B,OAAO;AACL,qBAAe,SAAS,WAAW;AACnC,qBAAe,OAAO,UAAU;AAAA,IAClC;AAAA,EACF;AAEA,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;AAClD,QAAI,CAAC,aAAa,IAAI,KAAK,EAAG,gBAAe,SAASA,SAAQ,QAAQ,KAAK,CAAC;AAAA,EAC9E;AACA,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,QAAI,CAAC,YAAY,IAAI,KAAK,EAAG,gBAAe,OAAOA,SAAQ,OAAO,KAAK,CAAC;AAAA,EAC1E;AAEA,QAAM,SAAS,EAAE,SAAS,mBAAmB,OAAO,GAAG,OAAO,mBAAmB,KAAK,EAAE;AACxF,SAAO,OAAO,QAAQ,SAAS,KAAK,OAAO,MAAM,SAAS,IAAI,SAAS;AACzE;AAEA,SAAS,sBACP,QACA,OACyB;AACzB,SAAO,mBAAmB,OAAO,QAAQ,MAAM,QAAQ,CAAC,aAAa,eAAe;AAClF,UAAM,eAAe;AAAA,MACnBA,SAAQ,QAAQ,WAAW;AAAA,MAC3BA,SAAQ,OAAO,UAAU;AAAA,IAC3B;AACA,WAAO,eAAe,IAAI,eAAe,OAAO;AAAA,EAClD,CAAC;AACH;AAEA,SAAS,4BACP,aACA,YACQ;AACR,MAAI,YAAY,UAAU,WAAW,MAAO,QAAO,wBAAwB,YAAY,KAAK;AAC5F,QAAM,aAAa,oBAAoB,YAAY,OAAO,WAAW,KAAK;AAC1E,SAAO,cAAc,yCACjB,KAAK;AAAA,IACH,wBAAwB,YAAY,KAAK;AAAA,IACzC,wBAAwB,WAAW,KAAK;AAAA,EAC1C,IAAI,aACJ;AACN;AAEA,SAAS,oBAAoB,QAAgB,OAAuB;AAClE,MAAI,kBAAkB,MAAM,KAAK,kBAAkB,KAAK;AACtD,WAAO,0BAA0B,QAAQ,KAAK;AAChD,MAAI,cAAc,MAAM,KAAK,cAAc,KAAK,EAAG,QAAO,mBAAmB,QAAQ,KAAK;AAC1F,MAAI,0BAA0B,MAAM,KAAK,0BAA0B,KAAK;AACtE,WAAO,mBAAmB,QAAQ,KAAK;AACzC,SAAO;AACT;AAEA,SAAS,0BAA0B,QAAgB,OAAuB;AACxE,QAAM,cAAc,qBAAqB,QAAQ,CAAC,EAC/C,IAAI,CAAC,SAAS,KAAK,MAAM,YAAY,CAAC,EACtC,OAAO,0BAA0B;AACpC,QAAM,aAAa,qBAAqB,OAAO,CAAC,EAC7C,IAAI,CAAC,SAAS,KAAK,MAAM,YAAY,CAAC,EACtC,OAAO,0BAA0B;AACpC,QAAM,iBAAiB,oBAAoB,aAAa,UAAU;AAClE,SAAO,KAAK,IAAI,gBAAgB,mBAAmB,QAAQ,KAAK,CAAC;AACnE;AAEA,SAAS,oBAAoB,QAAkB,OAAyB;AACtE,MAAI,OAAO,WAAW,KAAK,MAAM,WAAW,EAAG,QAAO;AACtD,QAAM,YAAY,oBAAI,IAAoB;AAC1C,aAAW,SAAS,OAAQ,WAAU,IAAI,QAAQ,UAAU,IAAI,KAAK,KAAK,KAAK,CAAC;AAChF,MAAI,SAAS;AACb,aAAW,SAAS,OAAO;AACzB,UAAM,QAAQ,UAAU,IAAI,KAAK,KAAK;AACtC,QAAI,UAAU,EAAG;AACjB;AACA,QAAI,UAAU,EAAG,WAAU,OAAO,KAAK;AAAA,QAClC,WAAU,IAAI,OAAO,QAAQ,CAAC;AAAA,EACrC;AACA,SAAQ,IAAI,UAAW,OAAO,SAAS,MAAM;AAC/C;AAEA,SAAS,mBAAmB,QAAgB,OAAuB;AACjE,QAAM,SAAS,mBAAmB,QAAQ,KAAK;AAC/C,QAAM,SAAS,mBAAmB,QAAQ,OAAO,MAAM;AACvD,SAAQ,KAAK,SAAS,WAAY,OAAO,SAAS,MAAM;AAC1D;AAEA,SAAS,6BACP,aACA,YAC8B;AAC9B,MAAI,CAAC,kBAAkB,YAAY,KAAK,KAAK,CAAC,kBAAkB,WAAW,KAAK;AAC9E,WAAO;AACT,QAAM,cAAc,qBAAqB,YAAY,OAAO,YAAY,KAAK;AAC7E,QAAM,aAAa,qBAAqB,WAAW,OAAO,WAAW,KAAK;AAC1E,MAAI,YAAY,UAAU,KAAK,WAAW,UAAU,EAAG,QAAO;AAE9D,QAAM,OAA0B,CAAC;AACjC;AAAA,IACE;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACF;AACA,QAAM,SAAS,0BAA0B,aAAa,YAAY,IAAI;AACtE,SAAO,oBAAoB,MAAM,IAAI,SAAS;AAChD;AAEA,SAAS,0BACP,QACA,aACA,YACS;AACT,SACE,OAAO,QAAQ,KAAK,CAAC,UAAU,MAAM,CAAC,IAAI,YAAY,SAAS,MAAM,CAAC,IAAI,YAAY,GAAG,KACzF,OAAO,MAAM,KAAK,CAAC,UAAU,MAAM,CAAC,IAAI,WAAW,SAAS,MAAM,CAAC,IAAI,WAAW,GAAG,KACrF,OAAO,QAAQ,WAAW,KAC1B,OAAO,MAAM,WAAW;AAE5B;AAEA,SAAS,oBAAoB,QAAmC;AAC9D,SAAO,OAAO,QAAQ,SAAS,KAAK,OAAO,MAAM,SAAS;AAC5D;AAEA,SAASA,SAAQ,QAA6B,OAAkC;AAC9E,QAAM,QAAQ,OAAO,KAAK;AAC1B,MAAI,UAAU,OAAW,OAAM,IAAI,WAAW,+BAA+B,KAAK,EAAE;AACpF,SAAO;AACT;;;ACpSO,SAAS,4BACd,QACA,OACA,QACkB;AAClB,QAAM,mBAAmB,OAAO,QAAQ,KAAK,CAAC,UAAU,oBAAoB,QAAQ,KAAK,CAAC;AAC1F,QAAM,iBAAiB,OAAO,MAAM,KAAK,CAAC,UAAU,oBAAoB,OAAO,KAAK,CAAC;AACrF,SAAO;AAAA,IACL,SAAS,OAAO,QAAQ;AAAA,MAAO,CAAC,UAC9B,qBAAqB,OAAO,MAAM,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,cAAc;AAAA,IACvE;AAAA,IACA,OAAO,OAAO,MAAM;AAAA,MAAO,CAAC,UAC1B,qBAAqB,MAAM,MAAM,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,gBAAgB;AAAA,IACxE;AAAA,EACF;AACF;AAEA,SAAS,oBAAoB,SAAiB,OAAkC;AAC9E,QAAM,SAAS,gBAAgB,QAAQ,MAAM,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAChE,SAAO,OAAO,KAAK,kBAAkB;AACvC;AAEA,SAAS,qBAAqB,MAAc,uBAAyC;AACnF,QAAM,SAAS,gBAAgB,IAAI;AACnC,QAAM,eAAe,OAAO,OAAO,kBAAkB;AACrD,MAAI,aAAa,WAAW,EAAG,QAAO;AACtC,QAAM,aAAa,aAAa;AAAA,IAC9B,CAAC,UAAU,kBAAkB,KAAK,KAAK,cAAc,KAAK;AAAA,EAC5D;AACA,QAAM,qBAAqB,aAAa;AAAA,IACtC,CAAC,UAAU,0BAA0B,KAAK,KAAK,cAAc,KAAK;AAAA,EACpE;AACA,MACE,CAAC,yBACD,CAAC,sBACD,WAAW,MAAM,CAAC,UAAU,yBAAyB,IAAI,KAAK,CAAC;AAE/D,WAAO;AACT,MAAI,CAAC,yBAAyB,CAAC,sBAAsB,mBAAmB,MAAM,UAAU;AACtF,WAAO;AACT,SAAO;AACT;AAEA,SAAS,mBAAmB,OAAwB;AAClD,SACE,kBAAkB,KAAK,KACvB,cAAc,KAAK,KACnB,0BAA0B,KAAK,KAC/B,cAAc,KAAK;AAEvB;AAEA,IAAM,2BAA2B,oBAAI,IAAI;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,sBAAsB,oBAAI,IAAI,CAAC,UAAU,WAAW,WAAW,OAAO,QAAQ,CAAC;AAErF,SAAS,mBAAmB,MAAc,QAA2B;AACnE,SACE,OAAO,WAAW,KAClB,OAAO,CAAC,MAAM,UACd,oBAAoB,IAAI,OAAO,CAAC,CAAC,KACjC,oEAAoE,KAAK,IAAI;AAEjF;;;AC1EO,SAAS,2BACd,QACA,gBACS;AACT,MAAI,OAAO,QAAQ,WAAW,KAAK,OAAO,MAAM,WAAW,EAAG,QAAO;AACrE,MAAI,mBAAmB,MAAO,QAAO;AACrC,MAAI,OAAO,eAAe,SAAS,mBAAmB,OAAQ,QAAO;AACrE,SAAO;AACT;AAyBO,SAAS,qCACd,QACA,OACA,cACA,aACA,cAC2B;AAC3B,MAAI,iBAAiB,MAAO,QAAO,sBAAsB;AAEzD,QAAM,OAA0B,CAAC;AACjC,QAAM,sBAAsB;AAAA,IAC1B;AAAA,IACA;AAAA,IACA,aAAa;AAAA,IACb;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ;AAAA,EACF;AACA,QAAM,SAAS,8BAA8B,QAAQ,cAAc,OAAO,aAAa,IAAI;AAC3F,QAAM,aAAmCC,qBAAoB,MAAM,IAC/D,sBACA;AACJ,MAAI,iBAAiB,QAAS,QAAO,EAAE,GAAG,QAAQ,WAAW;AAE7D,QAAM,WAAW,4BAA4B,QAAQ,OAAO,MAAM;AAClE,SAAO,EAAE,GAAG,UAAU,YAAYA,qBAAoB,QAAQ,IAAI,aAAa,MAAM;AACvF;AAMA,SAASC,qBAAoB,QAAmC;AAC9D,SAAO,OAAO,QAAQ,SAAS,KAAK,OAAO,MAAM,SAAS;AAC5D;AAEA,SAAS,wBAAmD;AAC1D,SAAO,EAAE,SAAS,CAAC,GAAG,OAAO,CAAC,GAAG,YAAY,MAAM;AACrD;;;ACnDO,SAAS,wBACd,OACA,cAC0B;AAC1B,QAAM,UAAsD,CAAC;AAC7D,QAAM,QAAkD,CAAC;AACzD,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,UAAM,OAAO,MAAM,KAAK;AACxB,QAAI,SAAS,OAAW;AACxB,QAAI,kBAAkB,IAAI,EAAG,SAAQ,KAAK,mBAAmB,OAAO,IAAI,CAAC;AAAA,aAChE,gBAAgB,IAAI,EAAG,OAAM,KAAK,mBAAmB,OAAO,IAAI,CAAC;AAAA,EAC5E;AACA,QAAM,iBAAiB,IAAI,IAAI,QAAQ,IAAI,CAAC,SAAS,CAAC,KAAK,OAAO,IAAI,CAAC,CAAC;AACxE,QAAM,eAAe,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,OAAO,IAAI,CAAC,CAAC;AACpE,QAAM,QAAQ,kBAAkB,SAAS,KAAK;AAC9C,QAAM,SAAiC,CAAC;AAExC,aAAW,QAAQ,OAAO;AACxB,UAAM,cAAc,eAAe,IAAI,KAAK,YAAY;AACxD,UAAM,YAAY,aAAa,IAAI,KAAK,UAAU;AAClD,QAAI,CAAC,eAAe,CAAC,UAAW;AAChC,WAAO,KAAK;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,yBAAyB,WAAW;AAAA,QACpC,yBAAyB,SAAS;AAAA,QAClC,kBAAkB,WAAW;AAAA,QAC7B,kBAAkB,SAAS;AAAA,QAC3B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO,EAAE,SAAS,OAAO,OAAO,OAAO;AACzC;;;AC5DO,IAAM,sBAAsB,CACjC,OACA,iBAC6E;AAC7E,QAAM,WAAW,oBAAI,IAGnB;AACF,MAAI,iBAAiB,MAAO,QAAO;AAEnC,aAAW,EAAE,MAAM,OAAO,KAAK,wBAAwB,OAAO,YAAY,EAAE,QAAQ;AAClF,QAAI,CAAC,2BAA2B,QAAQ,KAAK,UAAU,EAAG;AAC1D,aAAS,IAAI,KAAK,cAAc,EAAE,QAAQ,OAAO,SAAS,MAAM,SAAS,CAAC;AAC1E,aAAS,IAAI,KAAK,YAAY,EAAE,QAAQ,OAAO,OAAO,MAAM,MAAM,CAAC;AAAA,EACrE;AACA,SAAO;AACT;",
|
|
6
|
+
"names": ["i", "j", "tokenWeight", "tokenWeight", "changedLineAt", "changedLinePositions", "beforeIndex", "afterIndex", "index", "tokenAt", "hasWordChangeRanges", "hasWordChangeRanges"]
|
|
7
|
+
}
|
package/dist/util.d.ts
CHANGED
|
@@ -1,3 +1,5 @@
|
|
|
1
1
|
export declare const countNewlines: (value: string) => number;
|
|
2
|
+
/** Levenshtein distance, for "did you mean" suggestions over short names. */
|
|
3
|
+
export declare const editDistance: (left: string, right: string) => number;
|
|
2
4
|
export declare const truncateMiddle: (value: string, maxChars: number) => string;
|
|
3
5
|
//# sourceMappingURL=util.d.ts.map
|
package/dist/util.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../src/util.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,aAAa,GAAI,OAAO,MAAM,KAAG,MAM7C,CAAC;AAEF,eAAO,MAAM,cAAc,GAAI,OAAO,MAAM,EAAE,UAAU,MAAM,KAAG,MAOhE,CAAC"}
|
|
1
|
+
{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../src/util.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,aAAa,GAAI,OAAO,MAAM,KAAG,MAM7C,CAAC;AAEF,6EAA6E;AAC7E,eAAO,MAAM,YAAY,GAAI,MAAM,MAAM,EAAE,OAAO,MAAM,KAAG,MAY1D,CAAC;AAEF,eAAO,MAAM,cAAc,GAAI,OAAO,MAAM,EAAE,UAAU,MAAM,KAAG,MAOhE,CAAC"}
|
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
import type { FabricCapabilityBindingView } from "../protocol.js";
|
|
2
2
|
/** Private canonical state behind ActionRegistry's WeakMap-owned public views.
|
|
3
3
|
* Root issuance is a trusted registry operation, not a caller-supplied permission
|
|
4
|
-
* Boolean.
|
|
5
|
-
* WeakMap ownership, binding observations and abort delivery remain trusted.
|
|
4
|
+
* Boolean. The compiled kernel decides derivation/use/release over exact grants.
|
|
5
|
+
* JS identity, WeakMap ownership, binding observations and abort delivery remain trusted.
|
|
6
6
|
*/
|
|
7
7
|
export declare class CapabilityAuthority {
|
|
8
8
|
#private;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"authority.d.ts","sourceRoot":"","sources":["../../src/verified/authority.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"authority.d.ts","sourceRoot":"","sources":["../../src/verified/authority.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,gBAAgB,CAAC;AAalE;;;;GAIG;AACH,qBAAa,mBAAmB;;IAK9B,OAAO;IAYP,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,2BAA2B,EAAE,GAAG,mBAAmB;IAIjF,MAAM,CAAC,MAAM,EAAE,SAAS,2BAA2B,EAAE,GAAG,mBAAmB;IAI3E,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED,OAAO,IAAI,IAAI;IAIf,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,2BAA2B,GAAG,SAAS;IAS7D,QAAQ,IAAI,2BAA2B,EAAE;CAG1C"}
|
|
@@ -0,0 +1,4 @@
|
|
|
1
|
+
/** Admission threshold only: incurred child costs are recorded after settlement.
|
|
2
|
+
* Concurrent admitted children may overshoot. Nonfinite observations fail closed. */
|
|
3
|
+
export declare const budgetAdmits: (spent: number, limit: number) => boolean;
|
|
4
|
+
//# sourceMappingURL=budget.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"budget.d.ts","sourceRoot":"","sources":["../../src/verified/budget.ts"],"names":[],"mappings":"AAYA;qFACqF;AACrF,eAAO,MAAM,YAAY,GAAI,OAAO,MAAM,EAAE,OAAO,MAAM,KAAG,OAK3D,CAAC"}
|
|
@@ -0,0 +1,4 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/actor-name.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
export interface MachineState { scalars: Record<string, number>; maps: Record<string, Map<number, number>>; defaults?: Record<string, number> }
|
|
3
|
+
export interface Machine { init(params: object): MachineState; step(params: object, state: MachineState, input: object): MachineState }
|
|
4
|
+
export declare const actorName: Machine;
|
|
@@ -0,0 +1,17 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/actor-name.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
function $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }
|
|
3
|
+
|
|
4
|
+
export const actorName = /* @__PURE__ */ (() => {
|
|
5
|
+
// Generated from the machine actor name decision. step consumes its state: keep the one it returns (fork to branch).
|
|
6
|
+
function init(params) {
|
|
7
|
+
const env = {}, s = {};
|
|
8
|
+
return {scalars: {"out.active": 0, "out.stopped": 0, "out.available": 0}, maps: {}};
|
|
9
|
+
}
|
|
10
|
+
function step(params, state, input) {
|
|
11
|
+
const env = {"hasActive": $n(input["hasActive"], "input hasActive"), "hasStopped": $n(input["hasStopped"], "input hasStopped")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;
|
|
12
|
+
if (!((env["hasActive"] <= 1) && (env["hasStopped"] <= 1))) throw new RangeError("actor name decision: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
13
|
+
const scalars = {...s, "out.active": ((env["hasActive"] === 1) ? 1 : 0), "out.stopped": (((!(env["hasActive"] === 1)) && (env["hasStopped"] === 1)) ? 1 : 0), "out.available": (((!(env["hasActive"] === 1)) && (!(env["hasStopped"] === 1))) ? 1 : 0)};
|
|
14
|
+
return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};
|
|
15
|
+
}
|
|
16
|
+
return { init, step };
|
|
17
|
+
})();
|
|
@@ -0,0 +1,4 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/authority.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
export interface MachineState { scalars: Record<string, number>; maps: Record<string, Map<number, number>>; defaults?: Record<string, number> }
|
|
3
|
+
export interface Machine { init(params: object): MachineState; step(params: object, state: MachineState, input: object): MachineState }
|
|
4
|
+
export declare const capabilityAuthority: Machine;
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/authority.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
function $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }
|
|
3
|
+
function $m(v, what) { if (!(v instanceof Map)) throw new RangeError(what + ' must be a Map of naturals'); for (const [key, x] of v) { $n(key, 'a key of ' + what); $n(x, 'a cell of ' + what); } return v; }
|
|
4
|
+
function $keys(maps, names) { const keys = new Set(); let past = 0; for (const c of Object.values(maps)) for (const key of c.keys()) past = Math.max(past, key + 1); for (const n of names) for (const key of maps[n].keys()) keys.add(key); return [...keys, past]; }
|
|
5
|
+
function $every(keys, f) { const past = keys[keys.length - 1], d = f(past), cells = new Map(); for (let i = 0; i < keys.length - 1; i++) { const v = f(keys[i]); if (v !== d) cells.set(keys[i], v); } return {cells, d}; }
|
|
6
|
+
|
|
7
|
+
export const capabilityAuthority = /* @__PURE__ */ (() => {
|
|
8
|
+
// Generated from the machine capability authority. step consumes its state: keep the one it returns (fork to branch).
|
|
9
|
+
function init(params) {
|
|
10
|
+
const env = {}, s = {};
|
|
11
|
+
return {scalars: {"live": 0, "granted": 0}, maps: {"Grants": new Map()}};
|
|
12
|
+
}
|
|
13
|
+
function step(params, state, input) {
|
|
14
|
+
const env = {"op": $n(input["op"], "input op"), "name": $n(input["name"], "input name"), "parentLive": $n(input["parentLive"], "input parentLive")}, s = state.scalars, dft = {...state.defaults}, maps = {...state.maps, "Candidate": $m(input["Candidate"], "input Candidate"), "Parent": $m(input["Parent"], "input Parent")};
|
|
15
|
+
const flag0 = $keys(maps, ["Candidate","Parent"]).every(k => (((maps["Candidate"].get(k) ?? 0) <= 1) && ((maps["Parent"].get(k) ?? 0) <= 1)));
|
|
16
|
+
const flag1 = $keys(maps, ["Candidate","Parent"]).every(k => ((!(1 <= (maps["Candidate"].get(k) ?? 0))) || (1 <= (maps["Parent"].get(k) ?? 0))));
|
|
17
|
+
const flag2 = $keys(maps, ["Candidate","Parent"]).every(k => ((maps["Candidate"].get(k) ?? 0) <= (maps["Parent"].get(k) ?? 0)));
|
|
18
|
+
const flag3 = (env["op"] === 0);
|
|
19
|
+
const flag4 = ((env["op"] === 1) && ((env["parentLive"] === 1) && flag2));
|
|
20
|
+
const flag5 = ((env["op"] === 2) && ((s["live"] === 1) && (1 <= (maps["Grants"].get(env["name"]) ?? dft["Grants"] ?? 0))));
|
|
21
|
+
if (!((env["op"] < 4) && (env["parentLive"] <= 1) && flag0)) throw new RangeError("capability authority: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
22
|
+
const scalars = {...s, "live": ((flag3 || flag4) ? 1 : ((env["op"] === 2) ? s["live"] : 0)), "granted": (flag5 ? 1 : 0)};
|
|
23
|
+
const write0 = $every($keys(maps, ["Candidate","Grants"]), k => ((flag3 || flag4) ? (maps["Candidate"].get(k) ?? 0) : ((env["op"] === 2) ? (maps["Grants"].get(k) ?? dft["Grants"] ?? 0) : 0)));
|
|
24
|
+
state.maps["Grants"] = write0.cells; dft["Grants"] = write0.d;
|
|
25
|
+
return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};
|
|
26
|
+
}
|
|
27
|
+
return { init, step };
|
|
28
|
+
})();
|
|
@@ -0,0 +1,4 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/budget.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
export interface MachineState { scalars: Record<string, number>; maps: Record<string, Map<number, number>>; defaults?: Record<string, number> }
|
|
3
|
+
export interface Machine { init(params: object): MachineState; step(params: object, state: MachineState, input: object): MachineState }
|
|
4
|
+
export declare const budgetAdmission: Machine;
|
|
@@ -0,0 +1,17 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/budget.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
function $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }
|
|
3
|
+
|
|
4
|
+
export const budgetAdmission = /* @__PURE__ */ (() => {
|
|
5
|
+
// Generated from the machine budget admission. step consumes its state: keep the one it returns (fork to branch).
|
|
6
|
+
function init(params) {
|
|
7
|
+
const env = {}, s = {};
|
|
8
|
+
return {scalars: {"out.admitted": 0}, maps: {}};
|
|
9
|
+
}
|
|
10
|
+
function step(params, state, input) {
|
|
11
|
+
const env = {"valid": $n(input["valid"], "input valid"), "spentHigh": $n(input["spentHigh"], "input spentHigh"), "spentLow": $n(input["spentLow"], "input spentLow"), "limitHigh": $n(input["limitHigh"], "input limitHigh"), "limitLow": $n(input["limitLow"], "input limitLow")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;
|
|
12
|
+
if (!(env["valid"] <= 1)) throw new RangeError("budget admission: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
13
|
+
const scalars = {...s, "out.admitted": (((env["valid"] === 1) && ((env["spentHigh"] < env["limitHigh"]) || ((env["spentHigh"] === env["limitHigh"]) && (env["spentLow"] < env["limitLow"])))) ? 1 : 0)};
|
|
14
|
+
return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};
|
|
15
|
+
}
|
|
16
|
+
return { init, step };
|
|
17
|
+
})();
|
|
@@ -0,0 +1,4 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/compaction.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
export interface MachineState { scalars: Record<string, number>; maps: Record<string, Map<number, number>>; defaults?: Record<string, number> }
|
|
3
|
+
export interface Machine { init(params: object): MachineState; step(params: object, state: MachineState, input: object): MachineState }
|
|
4
|
+
export declare const compactionCut: Machine;
|
|
@@ -0,0 +1,19 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/compaction.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
function $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }
|
|
3
|
+
|
|
4
|
+
export const compactionCut = /* @__PURE__ */ (() => {
|
|
5
|
+
// Generated from the machine compaction cut. step consumes its state: keep the one it returns (fork to branch).
|
|
6
|
+
function init(params) {
|
|
7
|
+
const env = {"eligible": $n(params["eligible"], "param eligible"), "afterPrevious": $n(params["afterPrevious"], "param afterPrevious"), "retained": $n(params["retained"], "param retained"), "budget": $n(params["budget"], "param budget"), "boundary": $n(params["boundary"], "param boundary")}, s = {};
|
|
8
|
+
return {scalars: {"phase": 0}, maps: {}};
|
|
9
|
+
}
|
|
10
|
+
function step(params, state, input) {
|
|
11
|
+
const env = {"eligible": $n(params["eligible"], "param eligible"), "afterPrevious": $n(params["afterPrevious"], "param afterPrevious"), "retained": $n(params["retained"], "param retained"), "budget": $n(params["budget"], "param budget"), "boundary": $n(params["boundary"], "param boundary"), "op": $n(input["op"], "input op"), "first": $n(input["first"], "input first"), "last": $n(input["last"], "input last"), "paired": $n(input["paired"], "input paired")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;
|
|
12
|
+
const flag0 = ((env["eligible"] === 1) && (env["afterPrevious"] === 1) && (env["retained"] <= env["budget"]));
|
|
13
|
+
const flag1 = ((!(env["paired"] === 1)) || (env["boundary"] <= env["first"]) || (env["last"] < env["boundary"]));
|
|
14
|
+
if (!((env["op"] < 2) && (env["paired"] <= 1))) throw new RangeError("compaction cut: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
15
|
+
const scalars = {...s, "phase": ((env["op"] === 0) ? (((s["phase"] === 0) && flag0) ? 1 : 2) : (((s["phase"] === 1) && flag1) ? 1 : 2))};
|
|
16
|
+
return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};
|
|
17
|
+
}
|
|
18
|
+
return { init, step };
|
|
19
|
+
})();
|
|
@@ -0,0 +1,4 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/grants.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
export interface MachineState { scalars: Record<string, number>; maps: Record<string, Map<number, number>>; defaults?: Record<string, number> }
|
|
3
|
+
export interface Machine { init(params: object): MachineState; step(params: object, state: MachineState, input: object): MachineState }
|
|
4
|
+
export declare const meshGrantTake: Machine;
|
|
@@ -0,0 +1,17 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/grants.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
function $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }
|
|
3
|
+
|
|
4
|
+
export const meshGrantTake = /* @__PURE__ */ (() => {
|
|
5
|
+
// Generated from the machine mesh grant consumption. step consumes its state: keep the one it returns (fork to branch).
|
|
6
|
+
function init(params) {
|
|
7
|
+
const env = {}, s = {};
|
|
8
|
+
return {scalars: {"out.plan": 0, "out.uses": 0, "out.topic": 0, "out.kind": 0}, maps: {}};
|
|
9
|
+
}
|
|
10
|
+
function step(params, state, input) {
|
|
11
|
+
const env = {"authenticated": $n(input["authenticated"], "input authenticated"), "now": $n(input["now"], "input now"), "expiresAt": $n(input["expiresAt"], "input expiresAt"), "uses": $n(input["uses"], "input uses"), "topic": $n(input["topic"], "input topic"), "requestedTopic": $n(input["requestedTopic"], "input requestedTopic"), "hasTopic": $n(input["hasTopic"], "input hasTopic"), "kind": $n(input["kind"], "input kind"), "hasKind": $n(input["hasKind"], "input hasKind"), "requestedKind": $n(input["requestedKind"], "input requestedKind"), "hasRequestedKind": $n(input["hasRequestedKind"], "input hasRequestedKind"), "externalKind": $n(input["externalKind"], "input externalKind")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;
|
|
12
|
+
if (!((env["authenticated"] <= 1) && (env["hasTopic"] <= 1) && (env["hasKind"] <= 1) && (env["hasRequestedKind"] <= 1))) throw new RangeError("mesh grant consumption: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
13
|
+
const scalars = {...s, "out.plan": ((!(env["authenticated"] === 1)) ? 0 : ((env["expiresAt"] <= env["now"]) ? 1 : ((env["uses"] === 0) ? 2 : (((env["hasTopic"] === 1) && (!(env["requestedTopic"] === env["topic"]))) ? 3 : (((env["hasKind"] === 1) && (env["hasRequestedKind"] === 1) && (!(env["requestedKind"] === env["kind"]))) ? 4 : 5))))), "out.uses": ((((!(env["authenticated"] === 1)) ? 0 : ((env["expiresAt"] <= env["now"]) ? 1 : ((env["uses"] === 0) ? 2 : (((env["hasTopic"] === 1) && (!(env["requestedTopic"] === env["topic"]))) ? 3 : (((env["hasKind"] === 1) && (env["hasRequestedKind"] === 1) && (!(env["requestedKind"] === env["kind"]))) ? 4 : 5))))) === 5) ? Math.max(0, env["uses"] - 1) : env["uses"]), "out.topic": env["topic"], "out.kind": ((env["hasRequestedKind"] === 1) ? env["requestedKind"] : ((env["hasKind"] === 1) ? env["kind"] : env["externalKind"]))};
|
|
14
|
+
return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};
|
|
15
|
+
}
|
|
16
|
+
return { init, step };
|
|
17
|
+
})();
|
|
@@ -0,0 +1,4 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/lifecycle.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
export interface MachineState { scalars: Record<string, number>; maps: Record<string, Map<number, number>>; defaults?: Record<string, number> }
|
|
3
|
+
export interface Machine { init(params: object): MachineState; step(params: object, state: MachineState, input: object): MachineState }
|
|
4
|
+
export declare const bindingStep: Machine;
|
|
@@ -0,0 +1,50 @@
|
|
|
1
|
+
// Generated by scripts/verified-kernels.ts from proofs/lifecycle.ts with gdp-wired@0.31.1. Do not edit.
|
|
2
|
+
function $n(v, what) { if (typeof v !== 'number' || !Number.isSafeInteger(v) || v < 0) throw new RangeError(what + ' must be a natural below 2^53, not ' + v); return v; }
|
|
3
|
+
function $x(v) { if (v > 9007199254740991) throw new RangeError('a value passed 2^53 - 1, past which the proofs over the naturals no longer describe the run'); return v; }
|
|
4
|
+
|
|
5
|
+
export const bindingStep = /* @__PURE__ */ (() => {
|
|
6
|
+
// Generated from the machine binding lifecycle. step consumes its state: keep the one it returns (fork to branch).
|
|
7
|
+
function init(params) {
|
|
8
|
+
const env = {}, s = {};
|
|
9
|
+
return {scalars: {"phase": 0, "owner": 1, "holds": 0, "calls": 0, "revoked": 0, "command": 0}, maps: {}};
|
|
10
|
+
}
|
|
11
|
+
function step(params, state, input) {
|
|
12
|
+
const env = {"event": $n(input["event"], "input event"), "cleanup": $n(input["cleanup"], "input cleanup")}, s = state.scalars, dft = {...state.defaults}, maps = state.maps;
|
|
13
|
+
const flag0 = ((env["event"] === 0) && (s["phase"] <= 2) && (s["revoked"] === 0));
|
|
14
|
+
const flag1 = ((env["event"] === 1) && (s["phase"] <= 1));
|
|
15
|
+
const flag2 = ((env["event"] === 2) && (s["phase"] <= 1));
|
|
16
|
+
const flag3 = ((env["event"] === 2) && (2 <= s["phase"]));
|
|
17
|
+
const flag4 = ((env["event"] === 3) && (0 <= 0));
|
|
18
|
+
const flag5 = ((env["event"] === 4) && (s["phase"] <= 1));
|
|
19
|
+
const flag6 = ((env["event"] === 4) && (2 <= s["phase"]));
|
|
20
|
+
const flag7 = ((env["event"] === 5) && (s["phase"] <= 2) && ((env["cleanup"] === 1) || (s["revoked"] === 0)));
|
|
21
|
+
const flag8 = ((env["event"] === 5) && (s["phase"] === 5) && (env["cleanup"] === 1));
|
|
22
|
+
const flag9 = ((env["event"] === 7) && (s["phase"] <= 2) && ((env["cleanup"] === 1) || (s["revoked"] === 0)));
|
|
23
|
+
const flag10 = ((env["event"] === 7) && (s["phase"] === 5) && (env["cleanup"] === 1));
|
|
24
|
+
const flag11 = ((env["event"] === 6) && (0 <= 0) && (1 <= s["holds"]));
|
|
25
|
+
const flag12 = ((env["event"] === 8) && (0 <= 0) && (1 <= s["calls"]));
|
|
26
|
+
const flag13 = ((env["event"] === 9) && (s["phase"] === 2) && ((s["owner"] === 0) && (s["holds"] === 0) && (s["calls"] === 0)));
|
|
27
|
+
const flag14 = ((env["event"] === 10) && (s["phase"] === 3));
|
|
28
|
+
const flag15 = ((env["event"] === 11) && ((s["phase"] <= 3) || (s["phase"] === 5)));
|
|
29
|
+
const flag16 = flag0;
|
|
30
|
+
const flag17 = flag1;
|
|
31
|
+
const flag18 = flag2;
|
|
32
|
+
const flag19 = flag3;
|
|
33
|
+
const flag20 = flag4;
|
|
34
|
+
const flag21 = flag5;
|
|
35
|
+
const flag22 = flag6;
|
|
36
|
+
const flag23 = flag7;
|
|
37
|
+
const flag24 = flag8;
|
|
38
|
+
const flag25 = flag9;
|
|
39
|
+
const flag26 = flag10;
|
|
40
|
+
const flag27 = flag11;
|
|
41
|
+
const flag28 = flag12;
|
|
42
|
+
const flag29 = flag13;
|
|
43
|
+
const flag30 = flag14;
|
|
44
|
+
const flag31 = flag15;
|
|
45
|
+
if (!((env["event"] < 12) && (env["cleanup"] <= 1))) throw new RangeError("binding lifecycle: the request fails the rule's assumption, so no proof covers the step it would take");
|
|
46
|
+
const scalars = {...s, "owner": ((flag20 || flag21 || flag22 || flag31) ? 0 : s["owner"]), "holds": ((flag23 || flag24) ? $x(s["holds"] + 1) : (flag27 ? Math.max(0, s["holds"] - 1) : s["holds"])), "calls": ((flag25 || flag26) ? $x(s["calls"] + 1) : (flag28 ? Math.max(0, s["calls"] - 1) : s["calls"])), "revoked": ((flag21 || flag22 || flag31) ? 1 : s["revoked"]), "phase": (flag17 ? 1 : ((flag18 || flag21) ? 2 : (flag29 ? 3 : (flag30 ? 4 : (flag31 ? 5 : s["phase"]))))), "command": ((flag16 || flag17 || flag18 || flag19 || flag20 || flag21 || flag22 || flag23 || flag24 || flag25 || flag26 || flag27 || flag28 || flag30 || flag31) ? 1 : (flag29 ? 2 : 0))};
|
|
47
|
+
return Object.keys(dft).length ? {scalars, maps: state.maps, defaults: dft} : {scalars, maps: state.maps};
|
|
48
|
+
}
|
|
49
|
+
return { init, step };
|
|
50
|
+
})();
|