zidane-gui 9.0.4 → 9.1.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +1 -1
- package/out/main/chunks/{dev-extension-D5os9z0A.js → dev-extension-CjcEOYly.js} +10 -9
- package/out/main/chunks/extension-watch-Bk_X4gTf.js +93 -0
- package/out/main/chunks/{history-pager-DUFgTrih.js → history-pager-B5iwhWqn.js} +44 -7
- package/out/main/chunks/idle-collect-ZgTY7fw2.js +33 -0
- package/out/main/chunks/{remote-hosts-DlvE2ELX.js → remote-hosts-DmiOiwKi.js} +41 -1
- package/out/main/chunks/{session-search-sql-BrNTuwjH.js → session-search-sql-BaBnjEgm.js} +4 -4
- package/out/main/chunks/{tool-results-sql-C0MqWcQc.js → tool-results-sql-CVleIS51.js} +1 -1
- package/out/main/chunks/transcript-sql-DfsO-a4Q.js +27 -0
- package/out/main/extension-worker.js +52 -0
- package/out/main/git-watch-worker.js +21 -0
- package/out/main/history-worker.js +6 -3
- package/out/main/index.js +7614 -4263
- package/out/main/session-search-worker.js +18 -13
- package/out/main/tool-results-worker.js +18 -13
- package/out/main/update-worker.js +6 -0
- package/out/main/usage-worker.js +4 -1
- package/out/preload/index.mjs +49 -6
- package/out/renderer/assets/2CHDFZHC-B7OS2WPy.js +76 -0
- package/out/renderer/assets/43YPWK3Q-C1KxyhBe.js +297 -0
- package/out/renderer/assets/45MVAN6X-uedsCyvs.js +227 -0
- package/out/renderer/assets/46GJKBLZ-DqRDtmyU.js +362 -0
- package/out/renderer/assets/5THPTBWS-2mBFupjU.js +21 -0
- package/out/renderer/assets/63WH7YNF-E23uJkxY.js +1519 -0
- package/out/renderer/assets/6DDU7VKX-BnYMT-fZ.js +139 -0
- package/out/renderer/assets/7WLXJQOR-C8MM6Bra.js +23 -0
- package/out/renderer/assets/CLQLV5VT-BsAy1F0L.js +1159 -0
- package/out/renderer/assets/CUSPXG5M-BndthcFo.js +233 -0
- package/out/renderer/assets/{CodeEditor-in2F3Rz-.js → CodeEditor-Bc2yVqNr.js} +404 -744
- package/out/renderer/assets/{ComposerEditor-DzKoxH6Z.js → ComposerEditor-B4wmjkXE.js} +6 -7
- package/out/renderer/assets/D3L7O4X2-LfFKkl0g.js +194 -0
- package/out/renderer/assets/D5TW5CPZ-BUXfpU2q.js +21 -0
- package/out/renderer/assets/DKTLEL5E-Dj3316cp.js +42 -0
- package/out/renderer/assets/{DiffsTab-Ceh4E5wW.js → DiffsTab-BHaJc7Ve.js} +43 -26
- package/out/renderer/assets/EGADTWYV-giCCF2cw.js +292 -0
- package/out/renderer/assets/EOJSJZXM-B9xc3U2A.js +1137 -0
- package/out/renderer/assets/{EditorWorkers-Bhv2OJRb.js → EditorWorkers-DABG5YG9.js} +9 -11
- package/out/renderer/assets/FTXIJQGB-BX14b7pN.js +13 -0
- package/out/renderer/assets/{FileIcon-CYgGSQ59.js → FileIcon-acads6Ac.js} +1 -1
- package/out/renderer/assets/{FilesTab-DESQMqGK.js → FilesTab-CyWw9vW2.js} +70 -28
- package/out/renderer/assets/G2OEIG6X-hZmo0wrY.js +519 -0
- package/out/renderer/assets/G3MDBVQH-qZ3yfAIw.js +25 -0
- package/out/renderer/assets/GXJ2T77W-Dx1MA_On.js +445 -0
- package/out/renderer/assets/HX3UMAK7-DcJt6NaE.js +177 -0
- package/out/renderer/assets/IU7WZTP6-BZMu2vL3.js +137 -0
- package/out/renderer/assets/J5J2NR2G-CbQLnnZq.js +673 -0
- package/out/renderer/assets/JRCWTJEL-xEOyWDIN.js +419 -0
- package/out/renderer/assets/KHUP5TOH-032p46g-.js +359 -0
- package/out/renderer/assets/L74FQTH5-CQ_54hNm.js +994 -0
- package/out/renderer/assets/LAV4ZXOS-DvhVMhLR.js +968 -0
- package/out/renderer/assets/LBIZYCRR-CMaDdulz.js +715 -0
- package/out/renderer/assets/LFFXNLRS-BjbqzBYN.js +377 -0
- package/out/renderer/assets/LLLWOAQD-B2zZRpRf.js +409 -0
- package/out/renderer/assets/LTYQZ5U5-DzI-7yJW.js +1223 -0
- package/out/renderer/assets/NDSCUZ25-C9oT6c6G.js +83 -0
- package/out/renderer/assets/NMN3IKWL-9IsXehWp.js +1042 -0
- package/out/renderer/assets/NMUA3R2D-B2ZuyfXA.js +1080 -0
- package/out/renderer/assets/NY5A6PPW-BzmvsXmE.js +523 -0
- package/out/renderer/assets/OHJ2EJXK-BEkFEoxu.js +85 -0
- package/out/renderer/assets/OU2GIT2H-DZQl_5qv.js +32 -0
- package/out/renderer/assets/PDMLSE6I-C3FMl6Ej.js +15 -0
- package/out/renderer/assets/PJ7X32S5-BQ3aTkUy.js +188 -0
- package/out/renderer/assets/RLLQ44NJ-Dq15CCQ6.js +248 -0
- package/out/renderer/assets/RVARI57O-DMrXgtoB.js +10 -0
- package/out/renderer/assets/S6DWMCK5-KeQNStMI.js +817 -0
- package/out/renderer/assets/STIOTUT7-ZnewWXB7.js +509 -0
- package/out/renderer/assets/SXSLPWUD-VIPmiOfk.js +120 -0
- package/out/renderer/assets/TR4WJQGX-CQ3dPMLJ.js +25 -0
- package/out/renderer/assets/UWRPUF3N-CtgKKvKe.js +1276 -0
- package/out/renderer/assets/VSWIZJ7B-BN-hZ_G_.js +205 -0
- package/out/renderer/assets/WM7NR6YK-CghasXna.js +193 -0
- package/out/renderer/assets/WXKV2YEK-C8qjO_OQ.js +499 -0
- package/out/renderer/assets/XLHPVVFU-CoRVO17g.js +56 -0
- package/out/renderer/assets/YNX532HU-DhZCm9iK.js +119 -0
- package/out/renderer/assets/YUPSMAUO-Brx2G_oh.js +39 -0
- package/out/renderer/assets/ZFRCZTLK-Cs8fJIgy.js +150 -0
- package/out/renderer/assets/ZZDR4CN3-DcTVOpcO.js +122 -0
- package/out/renderer/assets/andromeeda-Bx1G2cLE.js +293 -0
- package/out/renderer/assets/andromeeda-vBqMIOkk.js +293 -0
- package/out/renderer/assets/aurora-x-Cm7-xw-C.js +243 -0
- package/out/renderer/assets/aurora-x-DPl7s7lw.js +243 -0
- package/out/renderer/assets/ayu-dark-CwZzE4zG.js +207 -0
- package/out/renderer/assets/ayu-dark-DkHc-GR-.js +207 -0
- package/out/renderer/assets/ayu-light-D8NJUeg2.js +207 -0
- package/out/renderer/assets/ayu-light-DNVhSCsl.js +207 -0
- package/out/renderer/assets/ayu-mirage-C-lSBwzI.js +207 -0
- package/out/renderer/assets/ayu-mirage-JE49iZ2H.js +207 -0
- package/out/renderer/assets/catppuccin-frappe-DU1nAiyx.js +414 -0
- package/out/renderer/assets/catppuccin-frappe-DX6Q-ciL.js +414 -0
- package/out/renderer/assets/catppuccin-latte-CO9onEOF.js +414 -0
- package/out/renderer/assets/catppuccin-latte-CkSyOFfG.js +414 -0
- package/out/renderer/assets/catppuccin-macchiato-OyZDjojj.js +414 -0
- package/out/renderer/assets/catppuccin-macchiato-WINjU_Dw.js +414 -0
- package/out/renderer/assets/catppuccin-mocha-0z8-eFg0.js +414 -0
- package/out/renderer/assets/catppuccin-mocha-DRTSTdRR.js +414 -0
- package/out/renderer/assets/core-COuvbqNs.js +5186 -0
- package/out/renderer/assets/{highlight.worker-gURcNJD7.js → core-Drnj1qQL.js} +404 -4454
- package/out/renderer/assets/{core-xOIU6ifr.js → core-Z_paRVMb.js} +3208 -1946
- package/out/renderer/assets/dark-plus-BaggkchT.js +241 -0
- package/out/renderer/assets/dark-plus-Conw9IRY.js +241 -0
- package/out/renderer/assets/default-CzLFidVE.js +1890 -0
- package/out/renderer/assets/dracula-BKSZoV-6.js +227 -0
- package/out/renderer/assets/dracula-BpiXsqbq.js +227 -0
- package/out/renderer/assets/dracula-soft-BF0b4PXf.js +169 -0
- package/out/renderer/assets/dracula-soft-DIWOT7Wr.js +169 -0
- package/out/renderer/assets/engine-javascript-CtTomO8o.js +3238 -0
- package/out/renderer/assets/engine-javascript-DUvVq6Hk.js +3223 -0
- package/out/renderer/assets/engine-oniguruma-DKBWYAaE.js +482 -0
- package/out/renderer/assets/engine-oniguruma-mZf4aRKS.js +482 -0
- package/out/renderer/assets/everforest-dark-B3n4qCUZ.js +181 -0
- package/out/renderer/assets/everforest-dark-BXgth4bF.js +181 -0
- package/out/renderer/assets/everforest-light-BhaIwhYu.js +181 -0
- package/out/renderer/assets/everforest-light-cbpcbx0E.js +181 -0
- package/out/renderer/assets/{file-tabs-Cozt9Sho.js → file-tabs-BCf1cAWp.js} +10 -12
- package/out/renderer/assets/{ghostty-web-BTHoKwMc.js → ghostty-web-CdNv377h.js} +3 -1
- package/out/renderer/assets/github-dark-BESFF5XO.js +234 -0
- package/out/renderer/assets/github-dark-DNCSzN6m.js +234 -0
- package/out/renderer/assets/github-dark-default-DgFmzzcd.js +168 -0
- package/out/renderer/assets/github-dark-default-ffmDUf0z.js +168 -0
- package/out/renderer/assets/github-dark-dimmed-CLKTYZCg.js +225 -0
- package/out/renderer/assets/github-dark-dimmed-s1SLsKJt.js +225 -0
- package/out/renderer/assets/github-dark-high-contrast-CXehgwDU.js +225 -0
- package/out/renderer/assets/github-dark-high-contrast-KLlCEr3k.js +225 -0
- package/out/renderer/assets/github-light-U3PkvbB_.js +234 -0
- package/out/renderer/assets/github-light-default-BPzGUBgG.js +225 -0
- package/out/renderer/assets/github-light-default-xMLgS_bN.js +225 -0
- package/out/renderer/assets/github-light-high-contrast-C8D72_o0.js +225 -0
- package/out/renderer/assets/github-light-high-contrast-DQhuIFi9.js +225 -0
- package/out/renderer/assets/github-light-jtm9FPHO.js +234 -0
- package/out/renderer/assets/gruvbox-dark-hard-BAboCHnq.js +214 -0
- package/out/renderer/assets/gruvbox-dark-hard-woZR1aVf.js +214 -0
- package/out/renderer/assets/gruvbox-dark-medium-BsoEOmFF.js +214 -0
- package/out/renderer/assets/gruvbox-dark-medium-CNo7daJC.js +214 -0
- package/out/renderer/assets/gruvbox-dark-soft-CaJ_lf0b.js +214 -0
- package/out/renderer/assets/gruvbox-dark-soft-Cg271WAX.js +214 -0
- package/out/renderer/assets/gruvbox-light-hard-CEjA0x_J.js +214 -0
- package/out/renderer/assets/gruvbox-light-hard-D8Ufxp8E.js +214 -0
- package/out/renderer/assets/gruvbox-light-medium-BCS-MX7u.js +214 -0
- package/out/renderer/assets/gruvbox-light-medium-DZkNZdeM.js +214 -0
- package/out/renderer/assets/gruvbox-light-soft-CRdK2Ssn.js +214 -0
- package/out/renderer/assets/gruvbox-light-soft-DEEl98i-.js +214 -0
- package/out/renderer/assets/hastToHtml-AUrFnNH_.js +123 -0
- package/out/renderer/assets/highlight.worker-BYB12Fvh.js +1624 -0
- package/out/renderer/assets/highlights-Cjdp9LIq.js +292 -0
- package/out/renderer/assets/highlights-CpZm9DAR-DaBE50nC.js +2188 -0
- package/out/renderer/assets/highlights-DaYW35iB.js +313 -0
- package/out/renderer/assets/horizon-B492K9Ky.js +165 -0
- package/out/renderer/assets/horizon-DAZuC-xh.js +165 -0
- package/out/renderer/assets/horizon-bright-D2Sfzu7E.js +165 -0
- package/out/renderer/assets/horizon-bright-tGFWGsRc.js +165 -0
- package/out/renderer/assets/houston-BuwDhoUX.js +373 -0
- package/out/renderer/assets/houston-Cp9zzZds.js +373 -0
- package/out/renderer/assets/index-DhpOdP7M.js +882 -0
- package/out/renderer/assets/{index-DkE-xvCG.js → index-_dhRO6Oc.js} +1823 -384
- package/out/renderer/assets/{index-DrLLItLS.css → index-fNK5AY6Q.css} +202 -42
- package/out/renderer/assets/kanagawa-dragon-6NLBJhOz.js +229 -0
- package/out/renderer/assets/kanagawa-dragon-BF7rCHRT.js +229 -0
- package/out/renderer/assets/kanagawa-lotus-Cj8RDQcT.js +229 -0
- package/out/renderer/assets/kanagawa-lotus-uV7FMPcj.js +229 -0
- package/out/renderer/assets/kanagawa-wave-0rvDP1ei.js +229 -0
- package/out/renderer/assets/kanagawa-wave-B6IVm0GO.js +229 -0
- package/out/renderer/assets/{kit-BUt8oFlT.js → kit-E8-H6M0V.js} +45590 -39890
- package/out/renderer/assets/langs-BDUDFyts.js +1333 -0
- package/out/renderer/assets/langs-BtXnoosO.js +1331 -0
- package/out/renderer/assets/laserwave-DXWE1WnK.js +166 -0
- package/out/renderer/assets/laserwave-JLRBtymH.js +166 -0
- package/out/renderer/assets/lazy-DQmrNfMK.js +1188 -0
- package/out/renderer/assets/light-plus-DU2oMqtU.js +244 -0
- package/out/renderer/assets/light-plus-D_GZIzn-.js +244 -0
- package/out/renderer/assets/loader-byWkNl6P.js +83 -0
- package/out/renderer/assets/loader-q6EC19QI.js +80 -0
- package/out/renderer/assets/material-theme-C0rHRk_7.js +171 -0
- package/out/renderer/assets/material-theme-CKzpgSIj.js +171 -0
- package/out/renderer/assets/material-theme-darker-LxtgP-nI.js +171 -0
- package/out/renderer/assets/material-theme-darker-q1PJSGwC.js +171 -0
- package/out/renderer/assets/material-theme-lighter-Bo7q33GI.js +171 -0
- package/out/renderer/assets/material-theme-lighter-DIrXq_cm.js +171 -0
- package/out/renderer/assets/material-theme-ocean-DBoGA257.js +171 -0
- package/out/renderer/assets/material-theme-ocean-DKw0PiZ1.js +171 -0
- package/out/renderer/assets/material-theme-palenight-C6KqY_uf.js +171 -0
- package/out/renderer/assets/material-theme-palenight-DoLm5E7H.js +171 -0
- package/out/renderer/assets/min-dark-C29HEm34.js +166 -0
- package/out/renderer/assets/min-dark-C5zOB6s9.js +166 -0
- package/out/renderer/assets/min-light-BDAdB2zx.js +166 -0
- package/out/renderer/assets/min-light-CCfylF7u.js +166 -0
- package/out/renderer/assets/monokai-CgbJVDnk.js +246 -0
- package/out/renderer/assets/monokai-hi1UnAdE.js +246 -0
- package/out/renderer/assets/night-owl-Cy8ZrWil.js +238 -0
- package/out/renderer/assets/night-owl-Pfm14M0L.js +238 -0
- package/out/renderer/assets/night-owl-light-Cr6ug2dl.js +237 -0
- package/out/renderer/assets/night-owl-light-UewpB7JV.js +237 -0
- package/out/renderer/assets/nord-C68LX7oy.js +200 -0
- package/out/renderer/assets/nord-D68iK8nx.js +200 -0
- package/out/renderer/assets/one-dark-pro-DSih0ZZj.js +196 -0
- package/out/renderer/assets/one-dark-pro-DyTT0T_G.js +196 -0
- package/out/renderer/assets/one-light--fEa3idW.js +232 -0
- package/out/renderer/assets/one-light-BzGf0rQc.js +232 -0
- package/out/renderer/assets/{patch-parse.worker-BAW1QWyk.js → patch-parse.worker-siqPY9wG.js} +24 -4
- package/out/renderer/assets/pierre-dark-1Xh1-lMo.js +4 -0
- package/out/renderer/assets/pierre-dark-7z_hCG7W.js +364 -0
- package/out/renderer/assets/pierre-dark-protanopia-deuteranopia-DjiH32kw.js +364 -0
- package/out/renderer/assets/pierre-dark-protanopia-deuteranopia-GW6g2K_K.js +364 -0
- package/out/renderer/assets/pierre-dark-protanopia-deuteranopia-LDfpPKjm.js +4 -0
- package/out/renderer/assets/pierre-dark-soft-1iBHdNO0.js +364 -0
- package/out/renderer/assets/pierre-dark-soft-C_k_gt55.js +4 -0
- package/out/renderer/assets/pierre-dark-soft-D5-n1AeJ.js +364 -0
- package/out/renderer/assets/pierre-dark-tritanopia-CeWJyYfV.js +4 -0
- package/out/renderer/assets/pierre-dark-tritanopia-ClMvjOGO.js +364 -0
- package/out/renderer/assets/pierre-dark-tritanopia-D9kXXcwP.js +364 -0
- package/out/renderer/assets/pierre-dark-vibrant-6Oqz1PbM.js +4 -0
- package/out/renderer/assets/pierre-dark-vibrant-C8yH51pK.js +364 -0
- package/out/renderer/assets/pierre-dark-vibrant-D_7rJXbX.js +364 -0
- package/out/renderer/assets/pierre-dark-yHUcpElV.js +364 -0
- package/out/renderer/assets/pierre-light-BIebL0yQ.js +4 -0
- package/out/renderer/assets/pierre-light-C34x-mcs.js +364 -0
- package/out/renderer/assets/pierre-light-C9v4GAHb.js +364 -0
- package/out/renderer/assets/pierre-light-protanopia-deuteranopia-BufD2-1n.js +4 -0
- package/out/renderer/assets/pierre-light-protanopia-deuteranopia-DUrvpW2C.js +364 -0
- package/out/renderer/assets/pierre-light-protanopia-deuteranopia-VwXWNPo2.js +364 -0
- package/out/renderer/assets/pierre-light-soft-BmDnpPlM.js +364 -0
- package/out/renderer/assets/pierre-light-soft-Cd6v49hf.js +4 -0
- package/out/renderer/assets/pierre-light-soft-DqFh0kZA.js +364 -0
- package/out/renderer/assets/pierre-light-tritanopia-BVCfgdSF.js +364 -0
- package/out/renderer/assets/pierre-light-tritanopia-RkA2q6k9.js +364 -0
- package/out/renderer/assets/pierre-light-tritanopia-VrCUn-Lh.js +4 -0
- package/out/renderer/assets/pierre-light-vibrant-C5BaqWq3.js +364 -0
- package/out/renderer/assets/pierre-light-vibrant-CCrCMYrB.js +364 -0
- package/out/renderer/assets/pierre-light-vibrant-ClZHsQXl.js +4 -0
- package/out/renderer/assets/{pierre-theme-Bj5EAt1L.js → pierre-theme-CsyO3esE.js} +1022 -913
- package/out/renderer/assets/plastic-7t7HzasC.js +207 -0
- package/out/renderer/assets/plastic-EgWoj0TX.js +207 -0
- package/out/renderer/assets/poimandres-Clm3QHf_.js +186 -0
- package/out/renderer/assets/poimandres-_9ZL-zjP.js +186 -0
- package/out/renderer/assets/red-BGLMOAQA.js +240 -0
- package/out/renderer/assets/red-C7WxuK4s.js +240 -0
- package/out/renderer/assets/rose-pine-CSYOOLQH.js +200 -0
- package/out/renderer/assets/rose-pine-DQTixAK4.js +200 -0
- package/out/renderer/assets/rose-pine-dawn-BsExWFpO.js +200 -0
- package/out/renderer/assets/rose-pine-dawn-DtnCKB3V.js +200 -0
- package/out/renderer/assets/rose-pine-moon-CIVzFPCR.js +200 -0
- package/out/renderer/assets/rose-pine-moon-DUVYttUm.js +200 -0
- package/out/renderer/assets/shiki-Ci4cdHsM-C6d-uTVf.js +681 -0
- package/out/renderer/assets/shiki-DxXti3Bm.js +651 -0
- package/out/renderer/assets/slack-dark-DqfBLzDN.js +156 -0
- package/out/renderer/assets/slack-dark-PDVLPqBV.js +156 -0
- package/out/renderer/assets/slack-ochin-BXb20b9s.js +167 -0
- package/out/renderer/assets/slack-ochin-Bkl8Akj-.js +167 -0
- package/out/renderer/assets/snazzy-light-B-XgRQqH.js +169 -0
- package/out/renderer/assets/snazzy-light-B_Pnr_t3.js +169 -0
- package/out/renderer/assets/solarized-dark-BExlwCgF.js +256 -0
- package/out/renderer/assets/solarized-dark-BWOkBqBk.js +256 -0
- package/out/renderer/assets/solarized-light-B0LC-9ef.js +256 -0
- package/out/renderer/assets/solarized-light-B7xKmc3j.js +256 -0
- package/out/renderer/assets/stream-tokenizer-DK9xp5M5-BkzgPytU.js +2641 -0
- package/out/renderer/assets/stream-tokenizer-sqhinrU5.js +131 -0
- package/out/renderer/assets/synthwave-84-Bz5LYLQI.js +766 -0
- package/out/renderer/assets/synthwave-84-DnB997dV.js +766 -0
- package/out/renderer/assets/themes-DGY5d--g.js +323 -0
- package/out/renderer/assets/themes-KOxcu5sY.js +322 -0
- package/out/renderer/assets/tokyo-night-BFQDXQF9.js +343 -0
- package/out/renderer/assets/tokyo-night-BKV2xFQO.js +343 -0
- package/out/renderer/assets/{useDetachCleanup-Bb7k1ePf.js → useDetachCleanup-DYbCqwX-.js} +95 -51
- package/out/renderer/assets/{useFolderChanges-B4X4n6NV.js → useFolderChanges-Y0OqX_nG.js} +406 -242
- package/out/renderer/assets/utils-BcG7Lqcy.js +90 -0
- package/out/renderer/assets/{vendor-BvslLX9q.js → vendor-BpwX-s_O.js} +16835 -16799
- package/out/renderer/assets/{vendor-editor-Bx3dRdBD.js → vendor-editor-Cx3SvGyZ.js} +2 -2
- package/out/renderer/assets/{vendor-motion-BLeNAEjH.js → vendor-motion-CD5Og8pC.js} +3 -3
- package/out/renderer/assets/{vendor-react-DltKc0Ts.js → vendor-react-bPTwWURR.js} +28 -12
- package/out/renderer/assets/vesper-BVtJs6jF.js +173 -0
- package/out/renderer/assets/vesper-BXSaHQeX.js +173 -0
- package/out/renderer/assets/vitesse-black-Bk4nGSr_.js +388 -0
- package/out/renderer/assets/vitesse-black-DjBh7jMr.js +388 -0
- package/out/renderer/assets/vitesse-dark-BSeRY0TR.js +388 -0
- package/out/renderer/assets/vitesse-dark-Czy_Ejt3.js +388 -0
- package/out/renderer/assets/vitesse-light-BpMpGmeY.js +388 -0
- package/out/renderer/assets/vitesse-light-Cv09MZGR.js +388 -0
- package/out/renderer/assets/worker-CswOd5_T.js +2367 -0
- package/out/renderer/index.html +8 -9
- package/package.json +13 -6
- package/out/main/chunks/transcript-sql-DbZ-a5wb.js +0 -43
- package/out/renderer/assets/index-DogoEzwx.js +0 -10868
- package/out/renderer/assets/vendor-shiki-ba8IDo5s.js +0 -459
- package/out/renderer/assets/worker-DNIQ0wG8.js +0 -12761
|
@@ -0,0 +1,1276 @@
|
|
|
1
|
+
import { A } from "./2CHDFZHC-B7OS2WPy.js";
|
|
2
|
+
import { L, x, W as Wt$1 } from "./KHUP5TOH-032p46g-.js";
|
|
3
|
+
function Xn(n, c, e = 0) {
|
|
4
|
+
return { w: n, h: c, kind: e, pin: 0, hint: NaN, key: NaN, span: 0, x: 0, y: 0, rank: 0 };
|
|
5
|
+
}
|
|
6
|
+
function Yn(n, c, e = 1, i = 0, s = 0) {
|
|
7
|
+
return { tail: n, head: c, minlen: e, labelW: i, labelH: s, tailDx: 0, headDx: 0, tailFixed: false, headFixed: false, reversed: false, points: [], labelX: 0, labelY: 0 };
|
|
8
|
+
}
|
|
9
|
+
var ln = 24, Vt = 2e4, jt = 16, zt = 8, fn = 0.125, Qt = 3, un = 18, mn = 10, bn = 14, hn = 2, dn = 28, Zt = 12, pn = 12, yn = 8, An = 4, Jt = 0.5, Nt = 0.5, tn = 12, gn = 40, nn = 400, Pt = 16, Gt = new Float64Array(2 * Pt + 2), Wt = new Float64Array(2 * Pt + 2);
|
|
10
|
+
function Ut(n) {
|
|
11
|
+
return n === 1 || n === 2;
|
|
12
|
+
}
|
|
13
|
+
function en(n, c, e, i) {
|
|
14
|
+
for (let s = c + 1; s < e; s++) {
|
|
15
|
+
let d = n[s], p = i[d], g = s - 1;
|
|
16
|
+
for (; g >= c && (i[n[g]] > p || i[n[g]] === p && n[g] > d); ) n[g + 1] = n[g], g--;
|
|
17
|
+
n[g + 1] = d;
|
|
18
|
+
}
|
|
19
|
+
}
|
|
20
|
+
function wn(n, c, e, i, s, d) {
|
|
21
|
+
let p = (f, I) => e[f] < e[I] || e[f] === e[I] && (s ? i[f] > i[I] : i[f] < i[I]);
|
|
22
|
+
for (let f = 0; f < c; f += 8) for (let I = f + 1, h = Math.min(c, f + 8); I < h; I++) {
|
|
23
|
+
let A2 = n[I], u = I - 1;
|
|
24
|
+
for (; u >= f && p(A2, n[u]); ) n[u + 1] = n[u], u--;
|
|
25
|
+
n[u + 1] = A2;
|
|
26
|
+
}
|
|
27
|
+
let l = n, r = d;
|
|
28
|
+
for (let f = 8; f < c; f *= 2) {
|
|
29
|
+
for (let h = 0; h < c; h += 2 * f) {
|
|
30
|
+
let A2 = Math.min(c, h + f), u = Math.min(c, h + 2 * f), y = h, $ = A2, V = h;
|
|
31
|
+
for (; y < A2 && $ < u; ) r[V++] = p(l[$], l[y]) ? l[$++] : l[y++];
|
|
32
|
+
for (; y < A2; ) r[V++] = l[y++];
|
|
33
|
+
for (; $ < u; ) r[V++] = l[$++];
|
|
34
|
+
}
|
|
35
|
+
let I = l;
|
|
36
|
+
l = r, r = I;
|
|
37
|
+
}
|
|
38
|
+
if (l !== n) for (let f = 0; f < c; f++) n[f] = l[f];
|
|
39
|
+
}
|
|
40
|
+
function qn(n, c, e) {
|
|
41
|
+
let i = n.length;
|
|
42
|
+
if (i === 0) return { width: 0, height: 0 };
|
|
43
|
+
let s = c.length;
|
|
44
|
+
if (i === 1 && s === 0 && n[0].kind === 0) {
|
|
45
|
+
let t = n[0];
|
|
46
|
+
return t.rank = 0, t.x = t.w / 2, t.y = t.h / 2, { width: t.w, height: t.h };
|
|
47
|
+
}
|
|
48
|
+
let d = 1;
|
|
49
|
+
if (s > 0) {
|
|
50
|
+
let t = /* @__PURE__ */ new Set();
|
|
51
|
+
for (let b of c) {
|
|
52
|
+
let v = Math.min(b.tail, b.head), H = Math.max(b.tail, b.head), L2 = v * i + H;
|
|
53
|
+
if (b.labelW > 0 || t.has(L2)) {
|
|
54
|
+
d = 2;
|
|
55
|
+
break;
|
|
56
|
+
}
|
|
57
|
+
t.add(L2);
|
|
58
|
+
}
|
|
59
|
+
}
|
|
60
|
+
In(n, c), kn(n, c, d);
|
|
61
|
+
let p = new Int32Array(s), g = 0;
|
|
62
|
+
for (let t = 0; t < s; t++) {
|
|
63
|
+
let b = c[t];
|
|
64
|
+
p[t] = Math.abs(n[b.head].rank - n[b.tail].rank), p[t] > 1 && (g += p[t] - 1);
|
|
65
|
+
}
|
|
66
|
+
let l = new Uint8Array(s);
|
|
67
|
+
if (g > Vt) {
|
|
68
|
+
let t = [];
|
|
69
|
+
for (let b = 0; b < s; b++) p[b] > 1 && t.push(b);
|
|
70
|
+
t.sort((b, v) => p[v] - p[b] || b - v);
|
|
71
|
+
for (let b of t) {
|
|
72
|
+
if (g <= Vt) break;
|
|
73
|
+
l[b] = 1, g -= p[b] - 1;
|
|
74
|
+
}
|
|
75
|
+
}
|
|
76
|
+
let r = i + g, f = new Float64Array(r), I = new Float64Array(r), h = new Uint8Array(r), A2 = new Int32Array(r), u = 0;
|
|
77
|
+
for (let t = 0; t < i; t++) {
|
|
78
|
+
let b = n[t];
|
|
79
|
+
f[t] = b.w, I[t] = b.h, h[t] = b.kind, A2[t] = b.rank, b.rank > u && (u = b.rank);
|
|
80
|
+
}
|
|
81
|
+
let y = 0;
|
|
82
|
+
for (let t = 0; t < s; t++) l[t] || (y += p[t]);
|
|
83
|
+
let $ = new Int32Array(y), V = new Int32Array(y), q = new Float64Array(y), k = new Float64Array(y), S = new Int32Array(s).fill(-1), _ = new Uint8Array(u + 1), M = new Int32Array(s).fill(-1), Y = false;
|
|
84
|
+
for (let t = 0; t < i; t++) n[t].span > 0 && n[t].kind === 0 && (Y = true);
|
|
85
|
+
let j = Y ? new Uint8Array(y) : void 0, X = Y ? new Uint8Array(y) : void 0, o = new Int32Array(s).fill(-1), m = new Int32Array(s).fill(-1), N = new Float64Array(r).fill(NaN);
|
|
86
|
+
for (let t = 0; t < i; t++) N[t] = n[t].key;
|
|
87
|
+
let w = false;
|
|
88
|
+
{
|
|
89
|
+
let t = i, b = 0;
|
|
90
|
+
for (let v = 0; v < s; v++) {
|
|
91
|
+
if (l[v]) continue;
|
|
92
|
+
let H = c[v], L2 = H.reversed ? H.head : H.tail, Z = H.reversed ? H.tail : H.head, lt = H.reversed ? H.headDx : H.tailDx, tt = H.reversed ? H.tailDx : H.headDx;
|
|
93
|
+
(lt !== 0 || tt !== 0) && (w = true);
|
|
94
|
+
let At = A2[L2], vt = A2[Z], St = -1;
|
|
95
|
+
H.labelW > 0 && (St = At + (vt - At >> 1), d === 2 && vt - At >= 4 ? (St & 1) === 1 && (St += H.reversed ? 1 : -1) : d === 2 && (St & 1) === 0 && (St += H.reversed ? 1 : -1));
|
|
96
|
+
let Lt = L2;
|
|
97
|
+
vt - At > 1 && (S[v] = t), o[v] = b, j && !(H.reversed ? H.headFixed : H.tailFixed) && (j[b] = H.reversed ? 2 : 1);
|
|
98
|
+
for (let Kt = At + 1; Kt < vt; Kt++) {
|
|
99
|
+
let Dt = t++;
|
|
100
|
+
A2[Dt] = Kt, N[Dt] = N[L2] + (N[Z] - N[L2]) * (Kt - At) / (vt - At), Kt === St ? (f[Dt] = H.labelW, I[Dt] = H.labelH, h[Dt] = 2, M[v] = Dt, _[Kt] |= H.reversed ? 2 : 1) : h[Dt] = 1, $[b] = Lt, V[b] = Dt, q[b] = Lt === L2 ? lt : 0, b++, Lt = Dt;
|
|
101
|
+
}
|
|
102
|
+
$[b] = Lt, V[b] = Z, q[b] = Lt === L2 ? lt : 0, k[b] = tt, X && !(H.reversed ? H.tailFixed : H.headFixed) && (X[b] = H.reversed ? 1 : 2), m[v] = b, b++;
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
let x2;
|
|
106
|
+
if (e.groups) {
|
|
107
|
+
let { of: t, parent: b } = e.groups;
|
|
108
|
+
x2 = new Int32Array(r);
|
|
109
|
+
for (let L2 = 0; L2 < i; L2++) x2[L2] = t[L2];
|
|
110
|
+
let v = (L2) => {
|
|
111
|
+
let Z = 0;
|
|
112
|
+
for (; L2 >= 0; L2 = b[L2]) Z++;
|
|
113
|
+
return Z;
|
|
114
|
+
}, H = (L2, Z) => {
|
|
115
|
+
let lt = v(L2), tt = v(Z);
|
|
116
|
+
for (; lt > tt; lt--) L2 = b[L2];
|
|
117
|
+
for (; tt > lt; tt--) Z = b[Z];
|
|
118
|
+
for (; L2 !== Z; ) L2 = b[L2], Z = b[Z];
|
|
119
|
+
return L2;
|
|
120
|
+
};
|
|
121
|
+
for (let L2 = 0; L2 < s; L2++) {
|
|
122
|
+
if (S[L2] < 0) continue;
|
|
123
|
+
let Z = c[L2], lt = H(t[Z.tail], t[Z.head]);
|
|
124
|
+
for (let tt = S[L2], At = tt + p[L2] - 1; tt < At; tt++) x2[tt] = lt;
|
|
125
|
+
}
|
|
126
|
+
}
|
|
127
|
+
let E = new Int32Array(r + 1), U = new Int32Array(r + 1);
|
|
128
|
+
for (let t = 0; t < y; t++) E[$[t] + 1]++, U[V[t] + 1]++;
|
|
129
|
+
for (let t = 0; t < r; t++) E[t + 1] += E[t], U[t + 1] += U[t];
|
|
130
|
+
let G = new Int32Array(y), nt = new Int32Array(y);
|
|
131
|
+
{
|
|
132
|
+
let t = E.slice(0, r), b = U.slice(0, r);
|
|
133
|
+
for (let v = 0; v < y; v++) G[t[$[v]]++] = v, nt[b[V[v]]++] = v;
|
|
134
|
+
}
|
|
135
|
+
let J = new Int32Array(u + 2);
|
|
136
|
+
for (let t = 0; t < r; t++) J[A2[t] + 1]++;
|
|
137
|
+
for (let t = 0; t <= u; t++) J[t + 1] += J[t];
|
|
138
|
+
let a = new Int32Array(r), F = new Int32Array(r);
|
|
139
|
+
{
|
|
140
|
+
let t = new Int32Array(r), b = J.slice(0, u + 1);
|
|
141
|
+
for (let L2 = 0; L2 < r; L2++) t[b[A2[L2]]++] = L2;
|
|
142
|
+
for (let L2 = 0; L2 <= u; L2++) b[L2] = J[L2];
|
|
143
|
+
let v = new Uint8Array(r), H = [];
|
|
144
|
+
for (let L2 = 0; L2 < r; L2++) if (!v[t[L2]]) for (H.push(t[L2]); H.length > 0; ) {
|
|
145
|
+
let Z = H.pop();
|
|
146
|
+
if (!v[Z]) {
|
|
147
|
+
v[Z] = 1, a[b[A2[Z]]++] = Z;
|
|
148
|
+
for (let lt = E[Z + 1] - 1; lt >= E[Z]; lt--) {
|
|
149
|
+
let tt = V[G[lt]];
|
|
150
|
+
v[tt] || H.push(tt);
|
|
151
|
+
}
|
|
152
|
+
}
|
|
153
|
+
}
|
|
154
|
+
}
|
|
155
|
+
let T = (t, b) => {
|
|
156
|
+
let v = J[t], H = J[t + 1];
|
|
157
|
+
if (H - v < 2) return false;
|
|
158
|
+
for (let lt = v; lt < H; lt++) if (Number.isNaN(b(a[lt]))) return false;
|
|
159
|
+
let L2 = Array.from(a.subarray(v, H)), Z = /* @__PURE__ */ new Map();
|
|
160
|
+
return L2.forEach((lt, tt) => Z.set(lt, tt)), L2.sort((lt, tt) => b(lt) - b(tt) || Z.get(lt) - Z.get(tt)), a.set(L2, v), true;
|
|
161
|
+
};
|
|
162
|
+
for (let t = 0; t <= u; t++) T(t, (b) => N[b]);
|
|
163
|
+
let K = false;
|
|
164
|
+
for (let t = 0; t < i; t++) n[t].pin !== 0 && (K = true);
|
|
165
|
+
if (K) for (let t = 0; t <= u; t++) {
|
|
166
|
+
let b = Array.from(a.subarray(J[t], J[t + 1])), v = /* @__PURE__ */ new Map();
|
|
167
|
+
b.forEach((L2, Z) => v.set(L2, Z));
|
|
168
|
+
let H = (L2) => L2 < i ? n[L2].pin : 0;
|
|
169
|
+
b.sort((L2, Z) => H(L2) - H(Z) || v.get(L2) - v.get(Z)), a.set(b, J[t]);
|
|
170
|
+
}
|
|
171
|
+
let P = new Uint8Array(u + 1), D = (t) => t < i && (n[t].kind === 3 || n[t].kind === 4) ? n[t].hint : NaN;
|
|
172
|
+
for (let t of [0, u]) T(t, D) && (P[t] = 1);
|
|
173
|
+
let B = () => {
|
|
174
|
+
for (let t = 0; t <= u; t++) {
|
|
175
|
+
let b = J[t];
|
|
176
|
+
for (let v = b, H = J[t + 1]; v < H; v++) F[a[v]] = v - b;
|
|
177
|
+
}
|
|
178
|
+
};
|
|
179
|
+
B();
|
|
180
|
+
let z = { n: r, real: i, maxRank: u, W: f, KIND: h, RANK: A2, EF: $, ET: V, EFD: q, ETD: k, succStart: E, succE: G, predStart: U, predE: nt, layerStart: J, order: a, pos: F, offsets: w, fixed: P, GRP: x2, groupParent: e.groups?.parent }, at = 0, it = 0;
|
|
181
|
+
if (y > 0 && u > 0 && ([at, it] = $n(z, n), B()), e.orderOnly) {
|
|
182
|
+
let t = rn(z, e);
|
|
183
|
+
for (let b = 0; b < i; b++) n[b].x = t[b];
|
|
184
|
+
for (let b = 0; b < s; b++) {
|
|
185
|
+
let v = c[b], H = v.reversed ? v.head : v.tail, L2 = v.reversed ? v.tail : v.head, Z = [A2[H], t[H]];
|
|
186
|
+
if (!l[b] && S[b] >= 0) for (let lt = S[b], tt = lt + p[b] - 1; lt < tt; lt++) Z.push(A2[lt], t[lt]);
|
|
187
|
+
Z.push(A2[L2], t[L2]), v.points = Z;
|
|
188
|
+
}
|
|
189
|
+
return { width: 0, height: 0, crossings: at, declared: it };
|
|
190
|
+
}
|
|
191
|
+
j && X && xn(z, n, j, X);
|
|
192
|
+
let et = rn(z, e), ft = Sn(z);
|
|
193
|
+
if (j && X) {
|
|
194
|
+
let t = En(z, j, X);
|
|
195
|
+
Mn(z, n, et, t, e, ft), vn(z, n, et, j, X, t, ft), Fn(z, et, ft, e);
|
|
196
|
+
for (let b = 0; b < s; b++) {
|
|
197
|
+
if (l[b]) continue;
|
|
198
|
+
let v = c[b], H = q[o[b]], L2 = k[m[b]];
|
|
199
|
+
v.tailDx = v.reversed ? L2 : H, v.headDx = v.reversed ? H : L2;
|
|
200
|
+
}
|
|
201
|
+
}
|
|
202
|
+
let Mt = new Uint8Array(r);
|
|
203
|
+
ft && !e.tracks && Dn(z, et, ft, S, p, e.apart ? 0 : e.edgeSep, Mt), e.tracks || Ln(z, et, S, p, e.edgeSep, Mt);
|
|
204
|
+
let It = new Int32Array(s + 1), R = e.tracks || j && !e.straight ? { from: [], to: [], rank: [], lower: [], track: [], levels: [], wide: [] } : void 0, ht = new Int32Array(u + 1);
|
|
205
|
+
if (R) {
|
|
206
|
+
for (let t = 0; t < s; t++) {
|
|
207
|
+
if (It[t] = R.from.length, l[t]) continue;
|
|
208
|
+
let b = S[t], v = false;
|
|
209
|
+
for (let Z = b, lt = b < 0 ? b : b + p[t] - 1; Z < lt; Z++) {
|
|
210
|
+
let tt = ft !== void 0 && ft[A2[Z]] === 1;
|
|
211
|
+
!e.tracks && tt !== (Mt[Z] === 1) && (v = true);
|
|
212
|
+
}
|
|
213
|
+
if (v) continue;
|
|
214
|
+
let H = et[$[o[t]]] + q[o[t]], L2 = A2[$[o[t]]];
|
|
215
|
+
for (let Z = b, lt = b < 0 ? b : b + p[t] - 1; Z < lt; Z++) ft && ft[A2[Z]] || (R.from.push(H), R.to.push(et[Z]), R.rank.push(L2), R.lower.push(Z), H = et[Z], L2 = A2[Z]);
|
|
216
|
+
R.from.push(H), R.to.push(et[V[m[t]]] + k[m[t]]), R.rank.push(L2), R.lower.push(-1);
|
|
217
|
+
}
|
|
218
|
+
It[s] = R.from.length;
|
|
219
|
+
}
|
|
220
|
+
let kt = (t, b) => {
|
|
221
|
+
let v = false;
|
|
222
|
+
for (let H = J[t]; H < J[t + 1]; H++) {
|
|
223
|
+
let L2 = h[a[H]];
|
|
224
|
+
if (L2 === b) v = true;
|
|
225
|
+
else if (L2 !== 1) return false;
|
|
226
|
+
}
|
|
227
|
+
return v;
|
|
228
|
+
}, gt = kt(0, 3) ? d : 0, yt = kt(u, 4) ? d : 0, C = new Float64Array(u + 1);
|
|
229
|
+
for (let t = 0; t < y; t++) {
|
|
230
|
+
let b = Math.abs(et[$[t]] + q[t] - et[V[t]] - k[t]);
|
|
231
|
+
b > C[A2[$[t]]] && (C[A2[$[t]]] = b);
|
|
232
|
+
}
|
|
233
|
+
let W = new Float64Array(u + 1), O = new Float64Array(u + 1), Q = (t) => (t < gt || t >= u - yt ? e.portSep : e.rankSep) / d, st = new Float64Array(u + 1);
|
|
234
|
+
for (let t = 0; t < u; t++) st[t] = R ? Q(t) : Math.max(Q(t), Math.min(Qt * e.rankSep / d, C[t] * fn));
|
|
235
|
+
let rt = new Uint8Array(u + 1).fill(1);
|
|
236
|
+
for (let t = 0; t < i; t++) rt[A2[t]] = 0;
|
|
237
|
+
for (let t = 1; t < u; t++) {
|
|
238
|
+
if (e.tracks || !rt[t] || _[t] !== 1 && _[t] !== 2) continue;
|
|
239
|
+
let b = Math.min((e.headRoom ?? 0) / 2, st[_[t] === 1 ? t - 1 : t] / 2);
|
|
240
|
+
st[t - 1] += _[t] === 1 ? -b : b, st[t] += _[t] === 1 ? b : -b;
|
|
241
|
+
}
|
|
242
|
+
let ct = (t) => h[t] === 1 && rt[A2[t]] && !e.tracks ? (O[A2[t]] - W[A2[t]]) / 4 : 0, xt = e.tracks ? un : dn, ot = e.tracks ? mn : Zt, ut = e.tracks ? bn : Zt, pt = new Int32Array(u + 1);
|
|
243
|
+
if (R) {
|
|
244
|
+
let t = new Float64Array(u + 1);
|
|
245
|
+
for (let v = 0; v < u; v++) {
|
|
246
|
+
if (ft && ft[v]) continue;
|
|
247
|
+
let H = v + 1;
|
|
248
|
+
for (t[v] = st[v]; H < u && ft && ft[H]; ) t[v] += st[H++];
|
|
249
|
+
pt[v] = H;
|
|
250
|
+
}
|
|
251
|
+
for (let v = 0; v < R.from.length; v++) R.wide.push(Math.abs(R.from[v] - R.to[v]) > hn * t[R.rank[v]] ? 1 : 0);
|
|
252
|
+
let b = new Float64Array(u + 1);
|
|
253
|
+
Nn(R, ht, !e.tracks, t, b);
|
|
254
|
+
for (let v = 0; v < u; v++) ht[v] > 0 ? st[v] += Math.max(0, 2 * xt + (ht[v] - 1) * ot - t[v]) : b[v] > 0 && (st[v] += Math.max(0, Math.min(Qt * e.rankSep, b[v]) - t[v]));
|
|
255
|
+
}
|
|
256
|
+
let dt = 0;
|
|
257
|
+
for (let t = 0; t <= u; t++) {
|
|
258
|
+
let b = 0;
|
|
259
|
+
for (let v = J[t]; v < J[t + 1]; v++) I[a[v]] > b && (b = I[a[v]]);
|
|
260
|
+
W[t] = dt, O[t] = dt + b, dt += b + st[t];
|
|
261
|
+
}
|
|
262
|
+
let mt = dt, bt = (t, b = R.track[t]) => {
|
|
263
|
+
let v = R.rank[t], H = O[v], L2 = W[pt[v]], Z = e.tracks ? ht[v] : R.levels[t], lt = Z > 1 ? Math.min(ut, (L2 - H - 2 * xt) / (Z - 1)) : 0;
|
|
264
|
+
return (H + L2) / 2 + (b - (Z - 1) / 2) * lt;
|
|
265
|
+
}, Et = 1 / 0, Ft = -1 / 0;
|
|
266
|
+
for (let t = 0; t < r; t++) {
|
|
267
|
+
let b = f[t] / 2;
|
|
268
|
+
et[t] - b < Et && (Et = et[t] - b), et[t] + b > Ft && (Ft = et[t] + b);
|
|
269
|
+
}
|
|
270
|
+
let $t = new Uint8Array(u + 1), Rt = new Uint8Array(u + 1);
|
|
271
|
+
for (let t = 0; t < i; t++) h[t] !== 0 || !j || (U[t + 1] > U[t] && ($t[A2[t]] = 1), E[t + 1] > E[t] && (Rt[A2[t]] = 1));
|
|
272
|
+
for (let t = 0; t < i; t++) {
|
|
273
|
+
let b = n[t], v = b.rank;
|
|
274
|
+
b.x = et[t] - Et, h[t] === 0 && Rt[v] && !$t[v] ? b.y = O[v] - b.h / 2 : h[t] === 0 && $t[v] && !Rt[v] ? b.y = W[v] + b.h / 2 : b.y = (W[v] + O[v]) / 2;
|
|
275
|
+
}
|
|
276
|
+
for (let t = 0; t < s; t++) {
|
|
277
|
+
let b = c[t], v = n[b.reversed ? b.head : b.tail], H = n[b.reversed ? b.tail : b.head], L2 = [v.x + (b.reversed ? b.headDx : b.tailDx), v.y + v.h / 2], Z = S[t];
|
|
278
|
+
if (R && It[t + 1] > It[t]) for (let tt = It[t]; tt < It[t + 1]; tt++) {
|
|
279
|
+
if (R.track[tt] >= 0 && (e.tracks || R.wide[tt] === 1)) {
|
|
280
|
+
let vt = bt(tt);
|
|
281
|
+
L2.push(R.from[tt] - Et, vt, R.to[tt] - Et, vt);
|
|
282
|
+
} else R.track[tt] > 0 && L2.push(R.from[tt] - Et, bt(tt, R.track[tt] - 1));
|
|
283
|
+
let At = R.lower[tt];
|
|
284
|
+
At < 0 || (L2.push(et[At] - Et, W[A2[At]] + ct(At)), O[A2[At]] > W[A2[At]] && L2.push(et[At] - Et, O[A2[At]] - ct(At)));
|
|
285
|
+
}
|
|
286
|
+
else if (Z >= 0) for (let tt = Z, At = Z + p[t] - 1; tt < At; tt++) {
|
|
287
|
+
if (Mt[tt]) continue;
|
|
288
|
+
let vt = et[tt] - Et, St = W[A2[tt]], Lt = O[A2[tt]];
|
|
289
|
+
L2.push(vt, St + ct(tt)), Lt > St && L2.push(vt, Lt - ct(tt));
|
|
290
|
+
}
|
|
291
|
+
if (L2.push(H.x + (b.reversed ? b.tailDx : b.headDx), H.y - H.h / 2), b.reversed) for (let tt = 0, At = L2.length - 2; tt < At; tt += 2, At -= 2) {
|
|
292
|
+
let vt = L2[tt], St = L2[tt + 1];
|
|
293
|
+
L2[tt] = L2[At], L2[tt + 1] = L2[At + 1], L2[At] = vt, L2[At + 1] = St;
|
|
294
|
+
}
|
|
295
|
+
b.points = L2;
|
|
296
|
+
let lt = M[t];
|
|
297
|
+
lt >= 0 ? (b.labelX = et[lt] - Et, b.labelY = (W[A2[lt]] + O[A2[lt]]) / 2) : b.labelW > 0 && (b.labelX = (L2[0] + L2[L2.length - 2]) / 2, b.labelY = (L2[1] + L2[L2.length - 1]) / 2);
|
|
298
|
+
}
|
|
299
|
+
return { width: Ft - Et, height: mt };
|
|
300
|
+
}
|
|
301
|
+
function In(n, c) {
|
|
302
|
+
let e = n.length, i = c.length, s = new Int32Array(e + 1);
|
|
303
|
+
for (let r = 0; r < i; r++) {
|
|
304
|
+
let f = c[r];
|
|
305
|
+
f.reversed = n[f.head].kind === 3 || n[f.tail].kind === 4, f.reversed || s[f.tail + 1]++;
|
|
306
|
+
}
|
|
307
|
+
for (let r = 0; r < e; r++) s[r + 1] += s[r];
|
|
308
|
+
let d = new Int32Array(s[e]);
|
|
309
|
+
{
|
|
310
|
+
let r = s.slice(0, e);
|
|
311
|
+
for (let f = 0; f < i; f++) c[f].reversed || (d[r[c[f].tail]++] = f);
|
|
312
|
+
}
|
|
313
|
+
let p = new Uint8Array(e), g = s.slice(0, e), l = [];
|
|
314
|
+
for (let r = 0; r < e; r++) if (p[r] === 0) for (l.push(r), p[r] = 1; l.length > 0; ) {
|
|
315
|
+
let f = l[l.length - 1];
|
|
316
|
+
if (g[f] < s[f + 1]) {
|
|
317
|
+
let I = c[d[g[f]++]], h = I.head;
|
|
318
|
+
p[h] === 1 ? I.reversed = true : p[h] === 0 && (p[h] = 1, l.push(h));
|
|
319
|
+
} else p[f] = 2, l.pop();
|
|
320
|
+
}
|
|
321
|
+
}
|
|
322
|
+
function kn(n, c, e) {
|
|
323
|
+
let i = n.length, s = c.length, d = new Int32Array(s), p = new Int32Array(s), g = new Int32Array(s), l = new Int32Array(i + 1), r = new Int32Array(i + 1);
|
|
324
|
+
for (let k = 0; k < s; k++) {
|
|
325
|
+
let S = c[k], _ = S.reversed ? S.head : S.tail, M = S.reversed ? S.tail : S.head;
|
|
326
|
+
d[k] = _, p[k] = M, g[k] = Math.max(1, S.minlen) * e, l[_ + 1]++, r[M + 1]++;
|
|
327
|
+
}
|
|
328
|
+
for (let k = 0; k < i; k++) l[k + 1] += l[k], r[k + 1] += r[k];
|
|
329
|
+
let f = new Int32Array(s), I = new Int32Array(s);
|
|
330
|
+
{
|
|
331
|
+
let k = l.slice(0, i), S = r.slice(0, i);
|
|
332
|
+
for (let _ = 0; _ < s; _++) f[k[d[_]]++] = _, I[S[p[_]]++] = _;
|
|
333
|
+
}
|
|
334
|
+
let h = new Int32Array(i), A2 = new Int32Array(i);
|
|
335
|
+
for (let k = 0; k < i; k++) A2[k] = r[k + 1] - r[k];
|
|
336
|
+
let u = new Int32Array(i), y = 0;
|
|
337
|
+
for (let k = 0; k < i; k++) A2[k] === 0 && (u[y++] = k);
|
|
338
|
+
for (let k = 0; k < y; k++) {
|
|
339
|
+
let S = u[k];
|
|
340
|
+
for (let _ = l[S]; _ < l[S + 1]; _++) {
|
|
341
|
+
let M = f[_], Y = p[M];
|
|
342
|
+
h[S] + g[M] > h[Y] && (h[Y] = h[S] + g[M]), --A2[Y] === 0 && (u[y++] = Y);
|
|
343
|
+
}
|
|
344
|
+
}
|
|
345
|
+
for (let k = 0; k < 8; k++) {
|
|
346
|
+
let S = false;
|
|
347
|
+
for (let _ = y - 1; _ >= 0; _--) {
|
|
348
|
+
let M = u[_], Y = r[M + 1] - r[M], j = l[M + 1] - l[M];
|
|
349
|
+
if (Y === 0 && j === 0) continue;
|
|
350
|
+
let X = -1 / 0, o = 1 / 0;
|
|
351
|
+
for (let N = r[M]; N < r[M + 1]; N++) {
|
|
352
|
+
let w = I[N];
|
|
353
|
+
X = Math.max(X, h[d[w]] + g[w]);
|
|
354
|
+
}
|
|
355
|
+
for (let N = l[M]; N < l[M + 1]; N++) {
|
|
356
|
+
let w = f[N];
|
|
357
|
+
o = Math.min(o, h[p[w]] - g[w]);
|
|
358
|
+
}
|
|
359
|
+
let m = h[M];
|
|
360
|
+
j > Y && o !== 1 / 0 ? m = o : Y > j && X !== -1 / 0 && (m = X), m !== h[M] && (h[M] = m, S = true);
|
|
361
|
+
}
|
|
362
|
+
if (!S) break;
|
|
363
|
+
}
|
|
364
|
+
let $ = 1 / 0, V = -1 / 0, q = false;
|
|
365
|
+
for (let k = 0; k < i; k++) {
|
|
366
|
+
let S = n[k].kind;
|
|
367
|
+
S === 3 && (q = true), !(S === 3 || S === 4) && (h[k] < $ && ($ = h[k]), h[k] > V && (V = h[k]));
|
|
368
|
+
}
|
|
369
|
+
$ === 1 / 0 && ($ = 0, V = 0);
|
|
370
|
+
for (let k = 0; k < i; k++) n[k].kind === 3 ? h[k] = $ - e : n[k].kind === 4 && (h[k] = V + e);
|
|
371
|
+
q && ($ -= e);
|
|
372
|
+
for (let k = 0; k < i; k++) n[k].rank = h[k] - $;
|
|
373
|
+
}
|
|
374
|
+
function on(n, c, e, i, s, d, p) {
|
|
375
|
+
let g = e === 0 ? n.predStart : n.succStart, l = e === 0 ? n.predE : n.succE, r = e === 0 ? n.EF : n.ET, f = n.pos;
|
|
376
|
+
for (let u = g[c]; u < g[c + 1]; u++) s[l[u]] !== 0 && d.push(l[u]);
|
|
377
|
+
if (d.length < 2) return 0;
|
|
378
|
+
d.sort((u, y) => f[r[u]] - f[r[y]] || u - y);
|
|
379
|
+
let I = (u) => {
|
|
380
|
+
let y = 0;
|
|
381
|
+
p[0] = 0;
|
|
382
|
+
for (let $ = 1; $ < d.length; $++) {
|
|
383
|
+
let V = s[d[$]] === s[d[$ - 1]];
|
|
384
|
+
p[$] = u(V && s[d[$]] === 1, V), y += p[$];
|
|
385
|
+
}
|
|
386
|
+
return y;
|
|
387
|
+
}, h = I(() => 1);
|
|
388
|
+
if (i / h < zt && (h = I((u) => u ? 0.5 : 1)), i / h < zt && (h = I((u, y) => y ? 0 : 1)), h === 0) return 0;
|
|
389
|
+
let A2 = Math.min(jt, i / h);
|
|
390
|
+
for (let u = 1; u < d.length; u++) p[u] *= A2;
|
|
391
|
+
return h * A2;
|
|
392
|
+
}
|
|
393
|
+
function xn(n, c, e, i) {
|
|
394
|
+
let { real: s, W: d, EFD: p, ETD: g } = n;
|
|
395
|
+
for (let l = 0; l < s; l++) {
|
|
396
|
+
let r = Math.min(c[l].span, d[l]);
|
|
397
|
+
if (!(r <= 0 || c[l].kind !== 0)) for (let f = 0; f < 2; f++) {
|
|
398
|
+
let I = [], h = [], A2 = on(n, l, f, r, f === 0 ? i : e, I, h);
|
|
399
|
+
if (A2 === 0) continue;
|
|
400
|
+
let u = f === 0 ? g : p, y = -A2 / 2;
|
|
401
|
+
for (let $ = 0; $ < I.length; $++) y += h[$], u[I[$]] = y;
|
|
402
|
+
}
|
|
403
|
+
}
|
|
404
|
+
}
|
|
405
|
+
function Ct(n, c, e, i) {
|
|
406
|
+
if (!c) return e;
|
|
407
|
+
let { KIND: s, RANK: d, EF: p, ET: g, succStart: l, succE: r, predStart: f, predE: I } = n;
|
|
408
|
+
for (let h = 0; h < 1e5; h++) {
|
|
409
|
+
let A2 = i === 0 ? p[e] : g[e];
|
|
410
|
+
if (s[A2] !== 1 || !c[d[A2]]) break;
|
|
411
|
+
e = i === 0 ? I[f[A2]] : r[l[A2]];
|
|
412
|
+
}
|
|
413
|
+
return e;
|
|
414
|
+
}
|
|
415
|
+
function En(n, c, e) {
|
|
416
|
+
let i = [new Int32Array(n.n), new Int32Array(n.n)];
|
|
417
|
+
for (let s = 0; s < n.EF.length; s++) e[s] !== 0 && i[0][n.ET[s]]++, c[s] !== 0 && i[1][n.EF[s]]++;
|
|
418
|
+
return i;
|
|
419
|
+
}
|
|
420
|
+
function Ht(n, c) {
|
|
421
|
+
return Math.max(0.25, Math.min(0.5, 4 * Math.abs(c) / (Math.abs(n) || 1)));
|
|
422
|
+
}
|
|
423
|
+
function Mn(n, c, e, i, s, d) {
|
|
424
|
+
let p = s.edgeSep, { n: g, real: l, maxRank: r, KIND: f, RANK: I, W: h, EF: A2, ET: u, EFD: y, ETD: $, succStart: V, succE: q, predStart: k, predE: S, layerStart: _, order: M, pos: Y } = n, j = (x2) => f[x2] === 2 || f[x2] === 1 && !(d !== void 0 && d[I[x2]] === 1), X = (x2, E) => {
|
|
425
|
+
let U = E === 0 ? A2[x2] : u[x2];
|
|
426
|
+
return [E === 0 ? e[U] + y[x2] : e[U] + $[x2], U < l && c[U].kind === 0 ? i[1 - E][U] : 0];
|
|
427
|
+
}, o = (x2) => {
|
|
428
|
+
let E = _[I[x2]], U = E + Y[x2], G = (nt) => h[nt] / 2 + h[x2] / 2 + (f[nt] === 0 ? s.nodeSep / 2 + p / 2 : f[nt] === f[x2] ? p : p / 2);
|
|
429
|
+
return [U > E ? e[M[U - 1]] + G(M[U - 1]) : -1 / 0, U + 1 < _[I[x2] + 1] ? e[M[U + 1]] - G(M[U + 1]) : 1 / 0];
|
|
430
|
+
}, m = (x2, E, U, G, nt) => {
|
|
431
|
+
let a = (E[1] !== U[1] ? E[1] < U[1] : Math.abs(E[0] - x2) <= Math.abs(U[0] - x2)) ? [E[0], U[0]] : [U[0], E[0]];
|
|
432
|
+
return a.find((F) => F >= G && F <= nt) ?? Math.max(G, Math.min(nt, a[0]));
|
|
433
|
+
}, N = new Uint8Array(g), w = [];
|
|
434
|
+
for (let x2 = 1; x2 < r; x2++) for (let E = _[x2]; E < _[x2 + 1]; E++) {
|
|
435
|
+
if (!j(M[E]) || N[M[E]]) continue;
|
|
436
|
+
let U = M[E];
|
|
437
|
+
for (; Ut(f[A2[S[k[U]]]]); ) U = A2[S[k[U]]];
|
|
438
|
+
let G = U, nt = -1 / 0, J = 1 / 0;
|
|
439
|
+
w.length = 0;
|
|
440
|
+
for (let a = U; Ut(f[a]); a = u[q[V[a]]]) {
|
|
441
|
+
if (G = a, !j(a)) continue;
|
|
442
|
+
N[a] = 1, w.push(a);
|
|
443
|
+
let [F, T] = o(a);
|
|
444
|
+
F > nt && (nt = F), T < J && (J = T);
|
|
445
|
+
}
|
|
446
|
+
if (nt <= J) {
|
|
447
|
+
let a = m(e[w[0]], X(S[k[U]], 0), X(q[V[G]], 1), nt, J);
|
|
448
|
+
for (let F of w) e[F] = a;
|
|
449
|
+
continue;
|
|
450
|
+
}
|
|
451
|
+
for (let a of w) {
|
|
452
|
+
let [F, T] = o(a);
|
|
453
|
+
F > T || (e[a] = m(e[a], X(Ct(n, d, S[k[a]], 0), 0), X(Ct(n, d, q[V[a]], 1), 1), F, T));
|
|
454
|
+
}
|
|
455
|
+
}
|
|
456
|
+
}
|
|
457
|
+
function vn(n, c, e, i, s, d, p) {
|
|
458
|
+
let { real: g, W: l, EF: r, ET: f, EFD: I, ETD: h, succStart: A2, succE: u, predStart: y, predE: $, pos: V } = n, q = (S, _, M, Y, j) => {
|
|
459
|
+
if (d[_][M] < 2) return 0;
|
|
460
|
+
S = Ct(n, p, S, _);
|
|
461
|
+
let X = _ === 0 ? r[S] : f[S], o = _ === 0 ? e[X] + I[S] : e[X] + h[S];
|
|
462
|
+
if (j && Math.abs(o - e[M]) <= Y / 2 + Nt) return Math.max(-Y / 2, Math.min(Y / 2, o - e[M]));
|
|
463
|
+
let m = o, N = 0;
|
|
464
|
+
X < g && c[X].kind === 0 && (_ === 0 ? i : s)[S] !== 0 && d[1 - _][X] >= 2 && (N = Math.max(0, Math.min(c[X].span, l[X])), N > 0 && (m = e[X]));
|
|
465
|
+
let w = Math.max(e[M] - Y / 2, m - N / 2), x2 = Math.min(e[M] + Y / 2, m + N / 2);
|
|
466
|
+
if (w > x2 + Nt) {
|
|
467
|
+
let U = Math.max(0, Y / 2 - gn);
|
|
468
|
+
return Math.max(-U, Math.min(U, o - e[M]));
|
|
469
|
+
}
|
|
470
|
+
let E = (e[M] * N + m * Y) / (N + Y);
|
|
471
|
+
return Math.max(w, Math.min(x2, E)) - e[M];
|
|
472
|
+
}, k = [];
|
|
473
|
+
for (let S = 0; S < g; S++) {
|
|
474
|
+
let _ = Math.min(c[S].span, l[S]);
|
|
475
|
+
if (!(_ <= 0 || c[S].kind !== 0)) for (let M = 0; M < 2; M++) {
|
|
476
|
+
let Y = M === 0 ? r : f, j = M === 0 ? y : A2, X = M === 0 ? $ : u, o = [], m = [];
|
|
477
|
+
if (on(n, S, M, _, M === 0 ? s : i, o, m), o.length === 0) continue;
|
|
478
|
+
o.length === 1 && (m[0] = 0);
|
|
479
|
+
let N = [];
|
|
480
|
+
for (let w = j[S]; w < j[S + 1]; w++) N.push(X[w]);
|
|
481
|
+
N.sort((w, x2) => V[Y[w]] - V[Y[x2]] || w - x2), k.push({ v: S, side: M, span: _, ids: o, room: m, all: N });
|
|
482
|
+
}
|
|
483
|
+
}
|
|
484
|
+
for (let S = 0, _ = true; _ && S < 6; S++) {
|
|
485
|
+
_ = false;
|
|
486
|
+
for (let { v: M, side: Y, span: j, ids: X, room: o, all: m } of k) {
|
|
487
|
+
let N = Y === 0 ? s : i, w = Y === 0 ? h : I, x2 = 0, E = -j / 2;
|
|
488
|
+
for (let U = 0; U <= m.length; U++) {
|
|
489
|
+
let G = U < m.length && N[m[U]] === 0;
|
|
490
|
+
if (U < m.length && !G) continue;
|
|
491
|
+
let nt = 0;
|
|
492
|
+
for (let a = U - 1; a >= 0 && N[m[a]] !== 0; a--) nt++;
|
|
493
|
+
let J = G ? w[m[U]] - jt : j / 2;
|
|
494
|
+
if (nt > 0) {
|
|
495
|
+
let a = [], F = [], T = 0;
|
|
496
|
+
for (let D = 0; D < nt; D++) {
|
|
497
|
+
D > 0 && (T += o[x2 + D]), a.push(q(X[x2 + D], Y, M, j, S > 0) - T), F.push(1);
|
|
498
|
+
let B = D > 0 && o[x2 + D] === 0;
|
|
499
|
+
for (; a.length > 1 && (B || a[a.length - 2] / F[F.length - 2] > a[a.length - 1] / F[F.length - 1]); ) {
|
|
500
|
+
B = false;
|
|
501
|
+
let z = a.pop(), at = F.pop();
|
|
502
|
+
a[a.length - 1] += z, F[F.length - 1] += at;
|
|
503
|
+
}
|
|
504
|
+
}
|
|
505
|
+
let K = T, P = 0;
|
|
506
|
+
T = 0;
|
|
507
|
+
for (let D = 0; D < a.length; D++) {
|
|
508
|
+
let B = J - K < E ? (E + J - K) / 2 : Math.max(E, Math.min(J - K, a[D] / F[D]));
|
|
509
|
+
for (let z = 0; z < F[D]; z++, P++) P > 0 && (T += o[x2 + P]), Math.abs(w[X[x2 + P]] - B - T) > 0.01 && (_ = true), w[X[x2 + P]] = B + T;
|
|
510
|
+
}
|
|
511
|
+
x2 += nt;
|
|
512
|
+
}
|
|
513
|
+
G && (E = w[m[U]] + jt);
|
|
514
|
+
}
|
|
515
|
+
}
|
|
516
|
+
}
|
|
517
|
+
}
|
|
518
|
+
function Fn(n, c, e, i) {
|
|
519
|
+
let { n: s, KIND: d, RANK: p, EF: g, ET: l, EFD: r, ETD: f, layerStart: I, order: h, pos: A2 } = n, u = (o) => e !== void 0 && d[o] === 1 && e[p[o]] === 1, y = [], $ = [], V = [], q = [];
|
|
520
|
+
for (let o = 0; o < g.length; o++) {
|
|
521
|
+
if (u(g[o])) continue;
|
|
522
|
+
let m = Ct(n, e, o, 1);
|
|
523
|
+
y.push(g[o]), $.push(l[m]), V.push(r[o]), q.push(f[m]);
|
|
524
|
+
}
|
|
525
|
+
let k = (o) => c[$[o]] + q[o] - c[y[o]] - V[o], S = new Int32Array(s), _ = [];
|
|
526
|
+
for (let o = 0; o < s; o++) S[o] = o, _.push([o]);
|
|
527
|
+
let M = (o, m) => {
|
|
528
|
+
let N = S[o], w = S[m];
|
|
529
|
+
if (N !== w) {
|
|
530
|
+
_[N].length < _[w].length && ([N, w] = [w, N]);
|
|
531
|
+
for (let x2 of _[w]) S[x2] = N, _[N].push(x2);
|
|
532
|
+
_[w] = [];
|
|
533
|
+
}
|
|
534
|
+
}, Y = [];
|
|
535
|
+
for (let o = 0; o < y.length; o++) {
|
|
536
|
+
let m = Math.abs(k(o));
|
|
537
|
+
m < 0.01 ? M(y[o], $[o]) : m <= tn && Y.push(o);
|
|
538
|
+
}
|
|
539
|
+
if (Y.length === 0) return;
|
|
540
|
+
Y.sort((o, m) => Math.abs(k(o)) - Math.abs(k(m)) || o - m);
|
|
541
|
+
let j = (o) => sn(n, i, o), X = (o, m) => {
|
|
542
|
+
for (let N of _[o]) {
|
|
543
|
+
let w = I[p[N]], x2 = I[p[N] + 1], E = w + A2[N];
|
|
544
|
+
if (E > w && S[h[E - 1]] !== o && c[N] + m - c[h[E - 1]] < j(N) + j(h[E - 1]) - 0.01 || E + 1 < x2 && S[h[E + 1]] !== o && c[h[E + 1]] - c[N] - m < j(N) + j(h[E + 1]) - 0.01) return false;
|
|
545
|
+
}
|
|
546
|
+
return true;
|
|
547
|
+
};
|
|
548
|
+
for (let o of Y) {
|
|
549
|
+
let m = k(o);
|
|
550
|
+
if (Math.abs(m) < 0.01) {
|
|
551
|
+
M(y[o], $[o]);
|
|
552
|
+
continue;
|
|
553
|
+
}
|
|
554
|
+
if (Math.abs(m) > tn || S[y[o]] === S[$[o]]) continue;
|
|
555
|
+
let N = S[y[o]], w = S[$[o]], x2 = _[N].length <= _[w].length ? N : w;
|
|
556
|
+
for (let E of [x2, x2 === N ? w : N]) {
|
|
557
|
+
let U = E === N ? m : -m;
|
|
558
|
+
if (X(E, U)) {
|
|
559
|
+
for (let G of _[E]) c[G] += U;
|
|
560
|
+
M(y[o], $[o]);
|
|
561
|
+
break;
|
|
562
|
+
}
|
|
563
|
+
}
|
|
564
|
+
}
|
|
565
|
+
}
|
|
566
|
+
function Sn(n) {
|
|
567
|
+
let { maxRank: c, KIND: e, layerStart: i, order: s } = n, d = new Uint8Array(c + 1), p = false;
|
|
568
|
+
for (let g = 1; g < c; g++) {
|
|
569
|
+
let l = i[g + 1] > i[g];
|
|
570
|
+
for (let r = i[g]; l && r < i[g + 1]; r++) e[s[r]] !== 1 && (l = false);
|
|
571
|
+
l && (d[g] = 1, p = true);
|
|
572
|
+
}
|
|
573
|
+
return p ? d : void 0;
|
|
574
|
+
}
|
|
575
|
+
function Nn(n, c, e, i, s) {
|
|
576
|
+
let { from: d, to: p, rank: g, track: l, levels: r, wide: f } = n, I = d.length, h = /* @__PURE__ */ new Map();
|
|
577
|
+
for (let o = 0; o < I; o++) {
|
|
578
|
+
if (l.push(-1), r.push(0), Math.abs(d[o] - p[o]) < Nt) continue;
|
|
579
|
+
let m = h.get(g[o]);
|
|
580
|
+
m ? m.push(o) : h.set(g[o], [o]);
|
|
581
|
+
}
|
|
582
|
+
if (h.size === 0) return;
|
|
583
|
+
let A2 = new Float64Array(I), u = new Float64Array(I);
|
|
584
|
+
for (let o = 0; o < I; o++) A2[o] = Math.min(d[o], p[o]), u[o] = Math.max(d[o], p[o]);
|
|
585
|
+
let y = (o, m) => o >= A2[m] - Nt && o <= u[m] + Nt ? 1 : 0, $ = (o, m) => Math.abs(d[o] - d[m]) < Nt || Math.abs(p[o] - p[m]) < Nt, V = (o, m) => A2[o] < u[m] - Nt && A2[m] < u[o] - Nt, q = (o, m) => V(o, m) && !$(o, m), k = (o, m) => V(o, m) || y(p[o], m) + y(d[m], o) + y(p[m], o) + y(d[o], m) > 0, S = (o, m) => y(p[o], m) + y(d[m], o), _ = (o) => {
|
|
586
|
+
let m = o.map((w, x2) => x2).sort((w, x2) => A2[o[w]] - A2[o[x2]]), N = [];
|
|
587
|
+
for (let w = 0; w < m.length; w++) {
|
|
588
|
+
let x2 = m[w], E = u[o[x2]] + 4 * Nt;
|
|
589
|
+
for (let U = w + 1; U < m.length && A2[o[m[U]]] <= E; U++) {
|
|
590
|
+
let G = m[U];
|
|
591
|
+
N.push(Math.min(x2, G), Math.max(x2, G));
|
|
592
|
+
}
|
|
593
|
+
}
|
|
594
|
+
return N;
|
|
595
|
+
}, M = (o) => {
|
|
596
|
+
o.sort((P, D) => u[D] - A2[D] - (u[P] - A2[P]) || A2[P] - A2[D] || P - D);
|
|
597
|
+
let m = o.length, N = [], w = o.map((P, D) => D), x2 = (P) => {
|
|
598
|
+
for (; w[P] !== P; ) P = w[P] = w[w[P]];
|
|
599
|
+
return P;
|
|
600
|
+
}, E = m <= nn, U = E ? _(o) : [], G = E ? o.map(() => []) : [];
|
|
601
|
+
for (let P = 0; P < U.length; P += 2) {
|
|
602
|
+
let D = U[P], B = U[P + 1];
|
|
603
|
+
q(o[D], o[B]) && (G[D].push(B), G[B].push(D));
|
|
604
|
+
}
|
|
605
|
+
let nt = o.map((P, D) => D);
|
|
606
|
+
if (E) {
|
|
607
|
+
let P = new Int32Array(m), D = [];
|
|
608
|
+
for (let z = 0; z < m; z++) N.push([]), D.push([]);
|
|
609
|
+
for (let z = 0; z < U.length; z += 2) {
|
|
610
|
+
let at = U[z], it = U[z + 1], et = o[at], ft = o[it];
|
|
611
|
+
if (!k(et, ft)) continue;
|
|
612
|
+
w[x2(at)] = x2(it);
|
|
613
|
+
let Mt = S(et, ft), It = S(ft, et);
|
|
614
|
+
if (Mt === It) continue;
|
|
615
|
+
let R = Mt < It ? at : it, ht = Mt < It ? it : at;
|
|
616
|
+
N[ht].push(R), D[R].push(ht), P[ht]++;
|
|
617
|
+
}
|
|
618
|
+
let B = new Uint8Array(m);
|
|
619
|
+
nt = [];
|
|
620
|
+
for (let z = 0; z < m; z++) {
|
|
621
|
+
let at = -1;
|
|
622
|
+
for (let it = 0; it < m && !(!B[it] && ((at < 0 || P[it] < P[at]) && (at = it), P[it] === 0)); it++) ;
|
|
623
|
+
B[at] = 1, nt.push(at);
|
|
624
|
+
for (let it of D[at]) P[it]--;
|
|
625
|
+
}
|
|
626
|
+
}
|
|
627
|
+
let J = /* @__PURE__ */ new Set(), a = [], F = 0;
|
|
628
|
+
for (let P of nt) {
|
|
629
|
+
let D = o[P], B = 0;
|
|
630
|
+
for (let z of N[P] ?? []) l[o[z]] >= B && (B = l[o[z]] + 1);
|
|
631
|
+
if (E) {
|
|
632
|
+
J.clear();
|
|
633
|
+
for (let z of G[P]) J.add(l[o[z]]);
|
|
634
|
+
for (; J.has(B); ) B++;
|
|
635
|
+
} else {
|
|
636
|
+
for (; a[B]?.some((z) => q(D, z)); ) B++;
|
|
637
|
+
(a[B] ??= []).push(D);
|
|
638
|
+
}
|
|
639
|
+
l[D] = B, B >= F && (F = B + 1);
|
|
640
|
+
}
|
|
641
|
+
let T = new Int32Array(m).fill(F), K = new Int32Array(m).fill(-1);
|
|
642
|
+
for (let P = 0; P < m; P++) {
|
|
643
|
+
let D = x2(P);
|
|
644
|
+
T[D] = Math.min(T[D], l[o[P]]), K[D] = Math.max(K[D], l[o[P]]);
|
|
645
|
+
}
|
|
646
|
+
for (let P = 0; P < m; P++) {
|
|
647
|
+
let D = x2(P);
|
|
648
|
+
r[o[P]] = K[D] - T[D] + 1, e && (l[o[P]] -= T[D]);
|
|
649
|
+
}
|
|
650
|
+
return F;
|
|
651
|
+
}, Y = (o, m, N) => {
|
|
652
|
+
let w = Ht(p[o] - d[o], m);
|
|
653
|
+
for (let x2 = 0; x2 <= Pt; x2++) {
|
|
654
|
+
let E = x2 / Pt, U = 1 - E;
|
|
655
|
+
N[2 * x2] = d[o] + (p[o] - d[o]) * E * E * (3 - 2 * E), N[2 * x2 + 1] = m * (3 * w * E * U * U + 3 * (1 - w) * E * E * U + E * E * E);
|
|
656
|
+
}
|
|
657
|
+
}, j = (o, m, N) => {
|
|
658
|
+
let w = N * N * 1.000000001;
|
|
659
|
+
for (let x2 = 0; x2 <= Pt; x2++) {
|
|
660
|
+
let E = o[2 * x2], U = o[2 * x2 + 1];
|
|
661
|
+
for (let G = 0; G < Pt; G++) {
|
|
662
|
+
let nt = m[2 * G + 2] - m[2 * G], J = m[2 * G + 3] - m[2 * G + 1], a = Math.max(0, Math.min(1, ((E - m[2 * G]) * nt + (U - m[2 * G + 1]) * J) / (nt * nt + J * J || 1))), F = E - m[2 * G] - a * nt, T = U - m[2 * G + 1] - a * J;
|
|
663
|
+
if (F * F + T * T < w && Math.hypot(F, T) < N) return true;
|
|
664
|
+
}
|
|
665
|
+
}
|
|
666
|
+
return false;
|
|
667
|
+
}, X = (o, m, N, w) => {
|
|
668
|
+
let x2 = Math.max(N / 2, N - 2 * pn);
|
|
669
|
+
return Y(o, x2, Gt), Y(m, x2, Wt), j(Gt, Wt, w) || j(Wt, Gt, w);
|
|
670
|
+
};
|
|
671
|
+
for (let [o, m] of h) {
|
|
672
|
+
if (!e) {
|
|
673
|
+
c[o] = M(m);
|
|
674
|
+
continue;
|
|
675
|
+
}
|
|
676
|
+
if (m.length > nn) continue;
|
|
677
|
+
let N = m.filter((a) => f[a] === 1);
|
|
678
|
+
M(N);
|
|
679
|
+
let w = new Set(N.filter((a) => r[a] > 1)), x2 = _(m);
|
|
680
|
+
for (let a = 0; a < x2.length; a += 2) {
|
|
681
|
+
let F = m[x2[a]], T = m[x2[a + 1]];
|
|
682
|
+
w.has(F) && w.has(T) || !q(F, T) || d[F] < p[F] != d[T] < p[T] || X(F, T, i[o], f[F] === 1 || f[T] === 1 ? yn : An) && w.add(F).add(T);
|
|
683
|
+
}
|
|
684
|
+
for (let a of N) l[a] = -1, r[a] = 0;
|
|
685
|
+
if (w.size === 0) continue;
|
|
686
|
+
let E = 0, U = 0, G = /* @__PURE__ */ new Set();
|
|
687
|
+
for (let a = 0; a < x2.length; a += 2) {
|
|
688
|
+
let F = m[x2[a]], T = m[x2[a + 1]];
|
|
689
|
+
if (w.has(F) && w.has(T)) {
|
|
690
|
+
if (!V(F, T)) continue;
|
|
691
|
+
d[F] < p[F] != d[T] < p[T] ? E++ : $(F, T) || U++;
|
|
692
|
+
} else (w.has(F) || w.has(T)) && k(F, T) && G.add(F).add(T);
|
|
693
|
+
}
|
|
694
|
+
if (E > U) {
|
|
695
|
+
for (let a of m) (u[a] - A2[a]) * Jt > s[o] && (s[o] = (u[a] - A2[a]) * Jt);
|
|
696
|
+
continue;
|
|
697
|
+
}
|
|
698
|
+
let nt = m.filter((a) => w.has(a) || f[a] !== 1 && G.has(a));
|
|
699
|
+
M(nt);
|
|
700
|
+
let J = 0;
|
|
701
|
+
for (let a of nt) r[a] > J && (J = r[a]);
|
|
702
|
+
c[o] = J;
|
|
703
|
+
}
|
|
704
|
+
}
|
|
705
|
+
function Dn(n, c, e, i, s, d, p) {
|
|
706
|
+
let { maxRank: g, EF: l, ET: r, EFD: f, ETD: I, succStart: h, succE: A2, predStart: u, predE: y, layerStart: $, order: V } = n, q = new Float64Array(c.length), k = new Float64Array(c.length), S = new Float64Array(c.length);
|
|
707
|
+
for (let M = 0; M < i.length; M++) {
|
|
708
|
+
let Y = i[M];
|
|
709
|
+
if (Y < 0) continue;
|
|
710
|
+
let j = Y + s[M] - 1, X = n.RANK[Y];
|
|
711
|
+
for (let o = Y; o < j; o++) {
|
|
712
|
+
if (!e[X + o - Y]) continue;
|
|
713
|
+
let m = o;
|
|
714
|
+
for (; m + 1 < j && e[X + m + 1 - Y]; ) m++;
|
|
715
|
+
let N = y[u[o]], w = A2[h[m]], x2 = c[l[N]] + f[N], E = c[r[w]] + I[w], U = m - o + 2;
|
|
716
|
+
for (let G = o; G <= m; G++) q[G] = x2 + (E - x2) * (G - o + 1) / U, k[G] = x2, S[G] = E;
|
|
717
|
+
o = m;
|
|
718
|
+
}
|
|
719
|
+
}
|
|
720
|
+
let _ = [];
|
|
721
|
+
for (let M = 1; M < g; M++) {
|
|
722
|
+
if (!e[M]) continue;
|
|
723
|
+
let Y = $[M], j = $[M + 1], X = Array.from(V.subarray(Y, j)).sort((o, m) => k[o] - k[m] || S[o] - S[m] || o - m);
|
|
724
|
+
for (let o = 0; o < X.length; ) {
|
|
725
|
+
_.length = 0;
|
|
726
|
+
let m = o;
|
|
727
|
+
for (; m < X.length && Math.abs(k[X[m]] - k[X[o]]) < 1 && Math.abs(S[X[m]] - S[X[o]]) < 1; m++) _.push(X[m]);
|
|
728
|
+
_.sort((N, w) => n.pos[N] - n.pos[w]);
|
|
729
|
+
for (let N = 0; N < _.length; N++) {
|
|
730
|
+
let w = _[N];
|
|
731
|
+
c[w] = q[w] + (N - (_.length - 1) / 2) * d, (_.length === 1 || d === 0) && (p[w] = 1);
|
|
732
|
+
}
|
|
733
|
+
o = m;
|
|
734
|
+
}
|
|
735
|
+
}
|
|
736
|
+
}
|
|
737
|
+
function Ln(n, c, e, i, s, d) {
|
|
738
|
+
let { maxRank: p, W: g, KIND: l, RANK: r, EF: f, ET: I, EFD: h, ETD: A2, succStart: u, succE: y, predStart: $, predE: V, layerStart: q, order: k } = n, S = new Uint8Array(p + 1), _ = false;
|
|
739
|
+
for (let M = 1; M < p; M++) {
|
|
740
|
+
let Y = false, j = false;
|
|
741
|
+
for (let X = q[M]; X < q[M + 1]; X++) {
|
|
742
|
+
let o = l[k[X]];
|
|
743
|
+
o === 2 ? Y = true : o !== 1 && (j = true);
|
|
744
|
+
}
|
|
745
|
+
Y && !j && (S[M] = 1, _ = true);
|
|
746
|
+
}
|
|
747
|
+
if (_) for (let M = 0; M < e.length; M++) {
|
|
748
|
+
let Y = e[M];
|
|
749
|
+
if (!(Y < 0)) for (let j = Y, X = Y + i[M] - 1; j < X; j++) {
|
|
750
|
+
if (l[j] !== 1 || !S[r[j]]) continue;
|
|
751
|
+
let o = j, m = j;
|
|
752
|
+
for (; o > Y && d[o - 1]; ) o--;
|
|
753
|
+
for (; m + 1 < X && d[m + 1]; ) m++;
|
|
754
|
+
let N = V[$[o]], w = y[u[m]], x2 = c[f[N]] + h[N], E = c[I[w]] + A2[w], U = Math.min(x2, E) - s, G = Math.max(x2, E) + s, nt = true, J = r[j];
|
|
755
|
+
for (let F = q[J]; nt && F < q[J + 1]; F++) {
|
|
756
|
+
let T = k[F];
|
|
757
|
+
l[T] === 2 && c[T] + g[T] / 2 > U && c[T] - g[T] / 2 < G && (nt = false);
|
|
758
|
+
}
|
|
759
|
+
if (!nt) continue;
|
|
760
|
+
d[j] = 1;
|
|
761
|
+
let a = m - o + 2;
|
|
762
|
+
for (let F = o; F <= m; F++) c[F] = x2 + (E - x2) * (F - o + 1) / a;
|
|
763
|
+
}
|
|
764
|
+
}
|
|
765
|
+
}
|
|
766
|
+
function $n(n, c) {
|
|
767
|
+
let { n: e, real: i, maxRank: s, W: d, EF: p, ET: g, EFD: l, ETD: r, succStart: f, succE: I, predStart: h, predE: A2, layerStart: u, order: y, pos: $, offsets: V, fixed: q, GRP: k, groupParent: S } = n, _ = 0;
|
|
768
|
+
for (let C = 0; C <= s; C++) _ = Math.max(_, u[C + 1] - u[C]);
|
|
769
|
+
if (_ < 2) return [0, 0];
|
|
770
|
+
let M = V ? new Int32Array(p.length) : void 0, Y = new Int32Array(M ? p.length : 0), j = new Int32Array(M ? e : 0), X = M ? I.slice() : I, o = new Uint8Array(M ? e : 0);
|
|
771
|
+
if (M) {
|
|
772
|
+
let C = A2.slice(), W = (O, Q, st, rt) => {
|
|
773
|
+
for (let ct = Q + 1; ct < st; ct++) if (rt[O[ct]] !== rt[O[Q]]) return O.subarray(Q, st).sort((xt, ot) => rt[xt] - rt[ot]), true;
|
|
774
|
+
return false;
|
|
775
|
+
};
|
|
776
|
+
for (let O = 0; O < e; O++) {
|
|
777
|
+
if (j[O] = 1, W(C, h[O], h[O + 1], r)) for (let Q = h[O] + 1; Q < h[O + 1]; Q++) r[C[Q]] !== r[C[Q - 1]] && j[O]++, Y[C[Q]] = j[O] - 1;
|
|
778
|
+
W(X, f[O], f[O + 1], l) && (o[O] = 1);
|
|
779
|
+
}
|
|
780
|
+
}
|
|
781
|
+
let m = 1;
|
|
782
|
+
for (; m < (M ? _ + p.length : _); ) m <<= 1;
|
|
783
|
+
let N = new Int32Array(2 * m), w = new Int32Array(p.length), x2 = () => {
|
|
784
|
+
let C = 0;
|
|
785
|
+
for (let W = 0; W < s; W++) {
|
|
786
|
+
let O = u[W + 2] - u[W + 1];
|
|
787
|
+
if (M) {
|
|
788
|
+
let rt = 0;
|
|
789
|
+
for (let ct = u[W + 1]; ct < u[W + 2]; ct++) {
|
|
790
|
+
let xt = y[ct];
|
|
791
|
+
for (let ot = h[xt]; ot < h[xt + 1]; ot++) M[A2[ot]] = rt + Y[A2[ot]];
|
|
792
|
+
rt += j[xt];
|
|
793
|
+
}
|
|
794
|
+
O = rt;
|
|
795
|
+
}
|
|
796
|
+
if (O < 2) continue;
|
|
797
|
+
let Q = 0;
|
|
798
|
+
for (let rt = u[W]; rt < u[W + 1]; rt++) {
|
|
799
|
+
let ct = y[rt], xt = f[ct], ot = f[ct + 1], ut = Q;
|
|
800
|
+
for (let dt = xt; dt < ot; dt++) w[Q++] = M ? M[X[dt]] : $[g[I[dt]]];
|
|
801
|
+
let pt = Q - ut;
|
|
802
|
+
if (!(pt < 2)) if (M && o[ct]) for (let dt = ut + 1; dt < Q; dt++) {
|
|
803
|
+
let mt = w[dt], bt = l[X[xt + dt - ut]], Et = dt - 1;
|
|
804
|
+
for (; Et >= ut && l[X[xt + Et - ut]] === bt && w[Et] > mt; ) w[Et + 1] = w[Et], Et--;
|
|
805
|
+
w[Et + 1] = mt;
|
|
806
|
+
}
|
|
807
|
+
else if (pt <= 12) for (let dt = ut + 1; dt < Q; dt++) {
|
|
808
|
+
let mt = w[dt], bt = dt - 1;
|
|
809
|
+
for (; bt >= ut && w[bt] > mt; ) w[bt + 1] = w[bt], bt--;
|
|
810
|
+
w[bt + 1] = mt;
|
|
811
|
+
}
|
|
812
|
+
else w.subarray(ut, Q).sort();
|
|
813
|
+
}
|
|
814
|
+
if (Q < 2) continue;
|
|
815
|
+
let st = 1;
|
|
816
|
+
for (; st < O; ) st <<= 1;
|
|
817
|
+
N.fill(0, 0, 2 * st);
|
|
818
|
+
for (let rt = 0; rt < Q; rt++) {
|
|
819
|
+
let ct = w[rt] + st;
|
|
820
|
+
for (N[ct]++; ct > 1; ) (ct & 1) === 0 && (C += N[ct + 1]), ct >>= 1, N[ct]++;
|
|
821
|
+
}
|
|
822
|
+
}
|
|
823
|
+
return C;
|
|
824
|
+
}, E = x2(), U = new Float64Array(e), G = new Int32Array(_), nt = new Int32Array(_), J = S ? S.length : 0, a = new Int32Array(J);
|
|
825
|
+
for (let C = 0; C < J; C++) for (let W = C; W >= 0; W = S[W]) a[C]++;
|
|
826
|
+
let F = new Float64Array(J), T = new Int32Array(J), K = new Int32Array(J), P = (C, W) => {
|
|
827
|
+
let O = u[C], Q = u[C + 1];
|
|
828
|
+
for (let ot = O; ot < Q; ot++) for (let ut = k[y[ot]]; ut >= 0; ut = S[ut]) F[ut] = 0, T[ut] = 0;
|
|
829
|
+
for (let ot = O; ot < Q; ot++) {
|
|
830
|
+
let ut = y[ot];
|
|
831
|
+
for (let pt = k[ut]; pt >= 0; pt = S[pt]) T[pt] === 0 && (K[pt] = ot), F[pt] += W[ut], T[pt]++;
|
|
832
|
+
}
|
|
833
|
+
let st = (ot) => ot >= e ? F[ot - e] / T[ot - e] : W[ot], rt = (ot) => ot >= e ? K[ot - e] : O + $[ot], ct = (ot, ut) => {
|
|
834
|
+
let pt = ot, dt = ut, mt = k[ot], bt = k[ut], Et = mt < 0 ? 0 : a[mt], Ft = bt < 0 ? 0 : a[bt];
|
|
835
|
+
for (; Et > Ft; Et--) pt = e + mt, mt = S[mt];
|
|
836
|
+
for (; Ft > Et; Ft--) dt = e + bt, bt = S[bt];
|
|
837
|
+
for (; mt !== bt; ) pt = e + mt, mt = S[mt], dt = e + bt, bt = S[bt];
|
|
838
|
+
return st(pt) - st(dt) || rt(pt) - rt(dt);
|
|
839
|
+
}, xt = Array.from(y.subarray(O, Q)).sort(ct);
|
|
840
|
+
y.set(xt, O);
|
|
841
|
+
for (let ot = O; ot < Q; ot++) $[y[ot]] = ot - O;
|
|
842
|
+
};
|
|
843
|
+
if (k) {
|
|
844
|
+
let C = new Float64Array(e);
|
|
845
|
+
for (let W = 0; W <= s; W++) {
|
|
846
|
+
for (let O = u[W]; O < u[W + 1]; O++) C[y[O]] = O - u[W];
|
|
847
|
+
P(W, C);
|
|
848
|
+
}
|
|
849
|
+
}
|
|
850
|
+
let D = k ? x2() : E;
|
|
851
|
+
if (D === 0) return [0, E];
|
|
852
|
+
let B = y.slice(), z = Math.min(D, E), at = (C, W) => {
|
|
853
|
+
let O = C ? h : f, Q = C ? A2 : I, st = C ? p : g, rt = C ? l : r;
|
|
854
|
+
for (let ct = 1; ct <= s; ct++) {
|
|
855
|
+
let xt = C ? ct : s - ct;
|
|
856
|
+
if (q[xt]) continue;
|
|
857
|
+
let ot = u[xt], ut = u[xt + 1], pt = 0;
|
|
858
|
+
for (let mt = ot; mt < ut; mt++) {
|
|
859
|
+
let bt = y[mt], Et = bt < i ? c[bt].pin : 0;
|
|
860
|
+
if (Et !== 0) {
|
|
861
|
+
U[bt] = Et * 1e9, G[pt++] = bt;
|
|
862
|
+
continue;
|
|
863
|
+
}
|
|
864
|
+
let Ft = O[bt], $t = O[bt + 1];
|
|
865
|
+
if (Ft === $t) {
|
|
866
|
+
if (k) {
|
|
867
|
+
let t = C ? u[xt] - u[xt - 1] : u[xt + 2] - u[xt + 1];
|
|
868
|
+
U[bt] = (mt - ot) * t / (ut - ot);
|
|
869
|
+
continue;
|
|
870
|
+
}
|
|
871
|
+
U[bt] = -1;
|
|
872
|
+
continue;
|
|
873
|
+
}
|
|
874
|
+
let Rt = 0;
|
|
875
|
+
for (let t = Ft; t < $t; t++) {
|
|
876
|
+
let b = st[Q[t]];
|
|
877
|
+
Rt += $[b], V && d[b] > 0 && (Rt += rt[Q[t]] / d[b]);
|
|
878
|
+
}
|
|
879
|
+
U[bt] = Rt / ($t - Ft), G[pt++] = bt;
|
|
880
|
+
}
|
|
881
|
+
if (k) {
|
|
882
|
+
P(xt, U);
|
|
883
|
+
continue;
|
|
884
|
+
}
|
|
885
|
+
if (pt < 2) continue;
|
|
886
|
+
wn(G, pt, U, $, W, nt);
|
|
887
|
+
let dt = 0;
|
|
888
|
+
for (let mt = ot; mt < ut; mt++) U[y[mt]] !== -1 && (y[mt] = G[dt++]);
|
|
889
|
+
for (let mt = ot; mt < ut; mt++) $[y[mt]] = mt - ot;
|
|
890
|
+
}
|
|
891
|
+
}, it = () => {
|
|
892
|
+
let C = 0;
|
|
893
|
+
for (let W = 0; W <= s; W++) for (let O = u[W]; O < u[W + 1]; O++) if (!(y[O] >= i)) for (let Q = O + 1; Q < u[W + 1]; Q++) y[Q] < y[O] && C++;
|
|
894
|
+
return C;
|
|
895
|
+
}, et = () => {
|
|
896
|
+
for (let C = 0; C <= s; C++) for (let W = u[C]; W < u[C + 1]; W++) $[y[W]] = W - u[C];
|
|
897
|
+
}, ft = (C) => C < i ? c[C].pin : 0, Mt = (C, W) => {
|
|
898
|
+
let O = W ? p[C] : g[C];
|
|
899
|
+
return V && d[O] > 0 ? $[O] + (W ? l[C] : r[C]) / d[O] : $[O];
|
|
900
|
+
}, It = (C, W) => {
|
|
901
|
+
let O = 0;
|
|
902
|
+
for (let Q = h[C]; Q < h[C + 1]; Q++) {
|
|
903
|
+
let st = Mt(A2[Q], true);
|
|
904
|
+
for (let rt = h[W]; rt < h[W + 1]; rt++) st > Mt(A2[rt], true) && O++;
|
|
905
|
+
}
|
|
906
|
+
for (let Q = f[C]; Q < f[C + 1]; Q++) {
|
|
907
|
+
let st = Mt(I[Q], false);
|
|
908
|
+
for (let rt = f[W]; rt < f[W + 1]; rt++) st > Mt(I[rt], false) && O++;
|
|
909
|
+
}
|
|
910
|
+
return O;
|
|
911
|
+
}, R = () => {
|
|
912
|
+
for (let C = 0; C < 8; C++) {
|
|
913
|
+
let W = false;
|
|
914
|
+
for (let O = 0; O <= s; O++) {
|
|
915
|
+
if (q[O]) continue;
|
|
916
|
+
let Q = u[O];
|
|
917
|
+
for (let st = Q; st + 1 < u[O + 1]; st++) {
|
|
918
|
+
let rt = y[st], ct = y[st + 1];
|
|
919
|
+
ft(rt) !== ft(ct) || k && k[rt] !== k[ct] || It(ct, rt) >= It(rt, ct) || (y[st] = ct, y[st + 1] = rt, $[ct] = st - Q, $[rt] = st + 1 - Q, W = true);
|
|
920
|
+
}
|
|
921
|
+
}
|
|
922
|
+
if (!W) break;
|
|
923
|
+
}
|
|
924
|
+
}, ht = y.slice(), kt = e <= 600, gt = B, yt = 1 / 0;
|
|
925
|
+
for (let C = 0; C < (kt ? 2 : 1); C++) {
|
|
926
|
+
C > 0 && (y.set(ht), et());
|
|
927
|
+
let W = z, O = ht.slice();
|
|
928
|
+
for (let st = 0, rt = 0; rt < 4 && st < ln; st++, rt++) {
|
|
929
|
+
at((st + C) % 2 === 0, st % 4 >= 2);
|
|
930
|
+
let ct = x2();
|
|
931
|
+
if (ct < W && (W = ct, O.set(y), rt = 0, ct === 0)) break;
|
|
932
|
+
}
|
|
933
|
+
if (y.set(O), kt && W > 0) {
|
|
934
|
+
et(), R();
|
|
935
|
+
let st = x2();
|
|
936
|
+
st < W && (W = st, O.set(y));
|
|
937
|
+
}
|
|
938
|
+
let Q = kt ? it() : 0;
|
|
939
|
+
(C === 0 || W < D || W === D && Q < yt) && (D = W, gt = O, yt = Q);
|
|
940
|
+
}
|
|
941
|
+
if (y.set(gt), et(), B.set(gt), k && (D = x2()), !kt) return [D, E];
|
|
942
|
+
for (let C = 0; C < i; C++) if (c[C].pin !== 0) return [D, E];
|
|
943
|
+
if (yt === 0 || q[0] || q[s]) return [D, E];
|
|
944
|
+
for (let C = 0; C <= s; C++) y.subarray(u[C], u[C + 1]).reverse();
|
|
945
|
+
return et(), (x2() > D || it() >= yt) && y.set(B), [D, E];
|
|
946
|
+
}
|
|
947
|
+
function sn(n, c, e) {
|
|
948
|
+
return n.W[e] / 2 + (n.KIND[e] === 0 ? c.nodeSep : c.edgeSep) / 2;
|
|
949
|
+
}
|
|
950
|
+
function rn(n, c) {
|
|
951
|
+
let { n: e, maxRank: i, W: s, KIND: d, EF: p, ET: g, EFD: l, ETD: r, succStart: f, succE: I, predStart: h, predE: A2, layerStart: u, order: y, pos: $ } = n, V = p.length, q = new Float64Array(e);
|
|
952
|
+
for (let K = 0; K < e; K++) q[K] = sn(n, c, K);
|
|
953
|
+
let k = new Int32Array(V);
|
|
954
|
+
for (let K = 0; K < V; K++) k[K] = $[g[K]];
|
|
955
|
+
for (let K = 0; K < e; K++) f[K + 1] - f[K] > 1 && en(I, f[K], f[K + 1], k);
|
|
956
|
+
for (let K = 0; K < V; K++) k[K] = $[p[K]];
|
|
957
|
+
for (let K = 0; K < e; K++) h[K + 1] - h[K] > 1 && en(A2, h[K], h[K + 1], k);
|
|
958
|
+
let S = new Uint8Array(V);
|
|
959
|
+
for (let K = 1; K <= i; K++) {
|
|
960
|
+
let P = u[K] - u[K - 1], D = u[K], B = u[K + 1], z = 0, at = D;
|
|
961
|
+
for (let it = D; it < B; it++) {
|
|
962
|
+
let et = y[it], ft = -1;
|
|
963
|
+
if (Ut(d[et])) {
|
|
964
|
+
let It = p[A2[h[et]]];
|
|
965
|
+
Ut(d[It]) && (ft = It);
|
|
966
|
+
}
|
|
967
|
+
let Mt = ft >= 0 ? $[ft] : P;
|
|
968
|
+
if (ft >= 0 || it === B - 1) {
|
|
969
|
+
for (let It = at; It <= it; It++) {
|
|
970
|
+
let R = y[It], ht = Ut(d[R]);
|
|
971
|
+
for (let kt = h[R]; kt < h[R + 1]; kt++) {
|
|
972
|
+
let gt = A2[kt], yt = $[p[gt]];
|
|
973
|
+
(yt < z || Mt < yt) && !(ht && Ut(d[p[gt]])) && (S[gt] = 1);
|
|
974
|
+
}
|
|
975
|
+
}
|
|
976
|
+
at = it + 1, z = Mt;
|
|
977
|
+
}
|
|
978
|
+
}
|
|
979
|
+
}
|
|
980
|
+
let _ = [], M = new Int32Array(e), Y = new Int32Array(e), j = new Float64Array(e), X = new Int32Array(e), o = new Int32Array(e), m = new Float64Array(e), N = new Int32Array(e), w = new Int32Array(e + 1), x2 = new Int32Array(e), E = new Int32Array(e), U = new Int32Array(e), G = new Float64Array(e);
|
|
981
|
+
for (let K = 0; K < 4; K++) {
|
|
982
|
+
let P = K < 2, D = (K & 1) === 1, B = P ? h : f, z = P ? A2 : I, at = P ? p : g, it = P ? r : l, et = P ? l : r;
|
|
983
|
+
for (let R = 0; R < e; R++) M[R] = R, Y[R] = R, j[R] = 0, N[R] = 0, w[R + 1] = 0, G[R] = 0;
|
|
984
|
+
for (let R = 0; R <= i; R++) {
|
|
985
|
+
let ht = P ? R : i - R, kt = u[ht], gt = u[ht + 1], yt = P ? ht - 1 : ht + 1, C = yt >= 0 && yt <= i ? u[yt + 1] - u[yt] - 1 : 0, W = -1;
|
|
986
|
+
for (let O = D ? gt - 1 : kt; D ? O >= kt : O < gt; D ? O-- : O++) {
|
|
987
|
+
let Q = y[O], st = B[Q], rt = B[Q + 1] - st;
|
|
988
|
+
if (rt === 0) continue;
|
|
989
|
+
let ct = st + (rt - 1 >> 1), xt = st + (rt >> 1);
|
|
990
|
+
for (let ot = 0; ot < 2 && !(ot === 1 && ct === xt); ot++) {
|
|
991
|
+
let ut = z[ot === 0 !== D ? ct : xt], pt = at[ut], dt = D ? C - $[pt] : $[pt];
|
|
992
|
+
Y[Q] === Q && W < dt && S[ut] === 0 && (Y[pt] = Q, Y[Q] = M[Q] = M[pt], j[Q] = j[pt] + et[ut] - it[ut], W = dt);
|
|
993
|
+
}
|
|
994
|
+
}
|
|
995
|
+
}
|
|
996
|
+
let ft = 0;
|
|
997
|
+
for (let R = 0; R <= i; R++) {
|
|
998
|
+
let ht = u[R], kt = u[R + 1];
|
|
999
|
+
for (let gt = ht + 1; gt < kt; gt++) {
|
|
1000
|
+
let yt = D ? y[gt] : y[gt - 1], C = D ? y[gt - 1] : y[gt], W = q[yt] + q[C];
|
|
1001
|
+
X[ft] = M[yt], o[ft] = M[C], m[ft] = D ? W - j[yt] + j[C] : W + j[yt] - j[C], N[M[C]]++, w[M[yt] + 1]++, ft++;
|
|
1002
|
+
}
|
|
1003
|
+
}
|
|
1004
|
+
for (let R = 0; R < e; R++) w[R + 1] += w[R];
|
|
1005
|
+
for (let R = 0; R < e; R++) E[R] = w[R];
|
|
1006
|
+
for (let R = 0; R < ft; R++) x2[E[X[R]]++] = R;
|
|
1007
|
+
let Mt = 0;
|
|
1008
|
+
for (let R = 0; R < e; R++) M[R] === R && N[R] === 0 && (U[Mt++] = R);
|
|
1009
|
+
for (let R = 0; R < Mt; R++) {
|
|
1010
|
+
let ht = U[R];
|
|
1011
|
+
for (let kt = w[ht]; kt < w[ht + 1]; kt++) {
|
|
1012
|
+
let gt = x2[kt], yt = o[gt];
|
|
1013
|
+
G[ht] + m[gt] > G[yt] && (G[yt] = G[ht] + m[gt]), --N[yt] === 0 && (U[Mt++] = yt);
|
|
1014
|
+
}
|
|
1015
|
+
}
|
|
1016
|
+
for (let R = Mt - 1; R >= 0; R--) {
|
|
1017
|
+
let ht = U[R], kt = 1 / 0;
|
|
1018
|
+
for (let gt = w[ht]; gt < w[ht + 1]; gt++) {
|
|
1019
|
+
let yt = x2[gt], C = G[o[yt]] - m[yt];
|
|
1020
|
+
C < kt && (kt = C);
|
|
1021
|
+
}
|
|
1022
|
+
kt !== 1 / 0 && kt > G[ht] && (G[ht] = kt);
|
|
1023
|
+
}
|
|
1024
|
+
let It = new Float64Array(e);
|
|
1025
|
+
for (let R = 0; R < e; R++) It[R] = (D ? -G[M[R]] : G[M[R]]) + j[R];
|
|
1026
|
+
_.push(It);
|
|
1027
|
+
}
|
|
1028
|
+
let nt = 0, J = 1 / 0, a = [], F = [];
|
|
1029
|
+
for (let K = 0; K < 4; K++) {
|
|
1030
|
+
let P = 1 / 0, D = -1 / 0, B = _[K];
|
|
1031
|
+
for (let z = 0; z < e; z++) {
|
|
1032
|
+
let at = s[z] / 2;
|
|
1033
|
+
B[z] - at < P && (P = B[z] - at), B[z] + at > D && (D = B[z] + at);
|
|
1034
|
+
}
|
|
1035
|
+
a.push(P), F.push(D), D - P < J && (J = D - P, nt = K);
|
|
1036
|
+
}
|
|
1037
|
+
for (let K = 0; K < 4; K++) {
|
|
1038
|
+
let P = (K & 1) === 0 ? a[nt] - a[K] : F[nt] - F[K];
|
|
1039
|
+
if (P !== 0) {
|
|
1040
|
+
let D = _[K];
|
|
1041
|
+
for (let B = 0; B < e; B++) D[B] += P;
|
|
1042
|
+
}
|
|
1043
|
+
}
|
|
1044
|
+
let T = new Float64Array(e);
|
|
1045
|
+
for (let K = 0; K < e; K++) {
|
|
1046
|
+
let P = _[0][K], D = _[1][K], B = _[2][K], z = _[3][K], at;
|
|
1047
|
+
P > D && (at = P, P = D, D = at), B > z && (at = B, B = z, z = at), P > B && (at = P, P = B, B = at), D > z && (at = D, D = z, z = at), D > B && (at = D, D = B, B = at), T[K] = (D + B) / 2;
|
|
1048
|
+
}
|
|
1049
|
+
return T;
|
|
1050
|
+
}
|
|
1051
|
+
var _t = 8, Rn = 12, Ot = 0.62, Tt = 6;
|
|
1052
|
+
function Zn() {
|
|
1053
|
+
let n = /* @__PURE__ */ new Map();
|
|
1054
|
+
return { add(c, e, i) {
|
|
1055
|
+
let s = Kn(i);
|
|
1056
|
+
e >= 0 && s > 0 && s + Tt > (n.get(c * 4 + e) ?? 0) && n.set(c * 4 + e, s + Tt);
|
|
1057
|
+
}, of: (c, e) => e >= 0 ? n.get(c * 4 + e) ?? 0 : 0 };
|
|
1058
|
+
}
|
|
1059
|
+
function Jn(n, c, e, i, s = e > 0 ? e + Tt : 0, d = i > 0 ? i + Tt : 0) {
|
|
1060
|
+
let p = c === "linear", g = c === "step" || c === "stepBefore" || c === "stepAfter", l = [], r = [], f = [], I = (a, F, T, K) => Math.abs(a - T) < 0.01 && Math.abs(F - K) < 0.01;
|
|
1061
|
+
for (let a = 0; a < n.length; a += 3) {
|
|
1062
|
+
let F = n[a], T = n[a + 1], K = n[a + 2], P = l.length - 1;
|
|
1063
|
+
if (g && P >= 0 && Math.abs(F - l[P]) >= 0.01 && Math.abs(T - r[P]) >= 0.01) {
|
|
1064
|
+
let D = l[P], B = r[P], z = c === "stepBefore" ? B : c === "stepAfter" ? T : (B + T) / 2, at = c === "stepBefore" ? D : c === "stepAfter" ? F : (D + F) / 2, it = K === 0 ? [D, z, F, z] : [at, B, at, T];
|
|
1065
|
+
for (let et = 0; et < 4; et += 2) I(it[et], it[et + 1], D, B) || I(it[et], it[et + 1], F, T) || (l.push(it[et]), r.push(it[et + 1]), f.push(K));
|
|
1066
|
+
}
|
|
1067
|
+
l.push(F), r.push(T), f.push(K);
|
|
1068
|
+
}
|
|
1069
|
+
let h = l.length - 1, A2 = (a) => Math.abs(l[a] - l[a - 1]) < 0.01 || Math.abs(r[a] - r[a - 1]) < 0.01, u = (a) => p || A2(a), y = (a, F, T) => {
|
|
1070
|
+
if (!u(Math.max(a, F))) return T === 0 ? [0, Math.sign(r[F] - r[a]) || 1] : [Math.sign(l[F] - l[a]) || 1, 0];
|
|
1071
|
+
let K = l[F] - l[a], P = r[F] - r[a], D = Math.hypot(K, P) || 1;
|
|
1072
|
+
return [K / D, P / D];
|
|
1073
|
+
}, [$, V] = y(0, 1, f[1]), [q, k] = y(h - 1, h, f[h]), S = l[0], _ = r[0], M = l[h], Y = r[h];
|
|
1074
|
+
l[0] += $ * e, r[0] += V * e, l[h] -= q * i, r[h] -= k * i;
|
|
1075
|
+
let j = (a) => Math.abs(l[a] - l[a - 1]) + Math.abs(r[a] - r[a - 1]), X = (a) => !p && a > 0 && a < h && A2(a) && A2(a + 1) && j(a) >= 0.01 && j(a + 1) >= 0.01 && Math.abs(l[a] - l[a - 1]) < 0.01 != Math.abs(l[a + 1] - l[a]) < 0.01, o = (a, F, T) => Math.abs(l[a] - l[a - 1]) * Math.abs(F) + Math.abs(r[a] - r[a - 1]) * Math.abs(T), m = (a, F, T) => {
|
|
1076
|
+
let K = Math.min(Math.max(0, a - Tt - F), T / 4);
|
|
1077
|
+
return K + Math.min(a - F - K, (T - K) / 4);
|
|
1078
|
+
}, N = d > i && (!u(h) || X(h - 1)) ? m(d, i, o(h, q, k)) : 0, w = s > e && (!u(1) || X(1)) ? m(s, e, o(1, $, V)) : 0;
|
|
1079
|
+
N >= 1 && (l.splice(h, 0, l[h] - q * N), r.splice(h, 0, r[h] - k * N), f.splice(h, 0, f[h]), h++), w >= 1 && (l.splice(1, 0, l[0] + $ * w), r.splice(1, 0, r[0] + V * w), f.splice(1, 0, f[1]), h++);
|
|
1080
|
+
let x$1 = [], E = (a) => (x$1.push(Tn(a)), x(a));
|
|
1081
|
+
x$1.push(77, 2);
|
|
1082
|
+
let U = `M${E(l[0])},${E(r[0])}`, G = l[0], nt = r[0], J = (a, F) => {
|
|
1083
|
+
I(a, F, G, nt) || (x$1.push(76, 2), U += `L${E(a)},${E(F)}`, G = a, nt = F);
|
|
1084
|
+
};
|
|
1085
|
+
for (let a = 1; a <= h; a++) {
|
|
1086
|
+
let F = l[a], T = r[a];
|
|
1087
|
+
if (!u(a)) {
|
|
1088
|
+
let it = f[a] === 0, et = it ? T - nt : F - G, ft = Math.abs(et) * Ht(it ? F - G : T - nt, et), Mt = it ? 0 : Math.sign(et) * ft, It = it ? Math.sign(et) * ft : 0;
|
|
1089
|
+
x$1.push(67, 6), U += `C${E(G + Mt)},${E(nt + It)} ${E(F - Mt)},${E(T - It)} ${E(F)},${E(T)}`, G = F, nt = T;
|
|
1090
|
+
continue;
|
|
1091
|
+
}
|
|
1092
|
+
if (!X(a)) {
|
|
1093
|
+
if (a < h && A2(a) && A2(a + 1) && (F - l[a - 1]) * (l[a + 1] - F) + (T - r[a - 1]) * (r[a + 1] - T) > 0) continue;
|
|
1094
|
+
J(F, T);
|
|
1095
|
+
continue;
|
|
1096
|
+
}
|
|
1097
|
+
let K = X(a - 1) ? j(a) / 2 : j(a), P = X(a + 1) ? j(a + 1) / 2 : j(a + 1);
|
|
1098
|
+
g && (K = P = Math.min(Rn, K, P));
|
|
1099
|
+
let [D, B] = y(a - 1, a, f[a]), [z, at] = y(a, a + 1, f[a + 1]);
|
|
1100
|
+
J(F - D * K, T - B * K), G = F + z * P, nt = T + at * P, g ? (x$1.push(81, 4), U += `Q${E(F)},${E(T)} ${E(G)},${E(nt)}`) : (x$1.push(67, 6), U += `C${E(F - D * K * (1 - Ot))},${E(T - B * K * (1 - Ot))} ${E(F + z * P * (1 - Ot))},${E(T + at * P * (1 - Ot))} ${E(G)},${E(nt)}`);
|
|
1101
|
+
}
|
|
1102
|
+
return { d: U, tokens: x$1, sx: S, sy: _, sdx: -$, sdy: -V, ex: M, ey: Y, edx: q, edy: k };
|
|
1103
|
+
}
|
|
1104
|
+
function Kn(n) {
|
|
1105
|
+
return n === "arrow_point" ? _t - 1 : n === "arrow_circle" ? _t : n === "arrow_cross" ? 4 : 0;
|
|
1106
|
+
}
|
|
1107
|
+
function an(n, c, e, i, s, d, p = "none") {
|
|
1108
|
+
let g = -s, l = i;
|
|
1109
|
+
if (n === "arrow_point") {
|
|
1110
|
+
let r = c - i * _t, f = e - s * _t, I = _t * 0.42;
|
|
1111
|
+
return `<path class="pele-marker" d="M${x(c)},${x(e)}L${x(r + g * I)},${x(f + l * I)}L${x(r - g * I)},${x(f - l * I)}Z" fill="${d}" stroke="${p}"/>`;
|
|
1112
|
+
}
|
|
1113
|
+
if (n === "arrow_circle") return `<circle class="pele-marker" cx="${x(c - i * 4)}" cy="${x(e - s * 4)}" r="3.5" fill="${d}" stroke="${p}"/>`;
|
|
1114
|
+
if (n === "arrow_cross") {
|
|
1115
|
+
let r = c - i * 4, f = e - s * 4, I = 3.5, h = (i + g) * I, A2 = (s + l) * I, u = (i - g) * I, y = (s - l) * I;
|
|
1116
|
+
return `<path class="pele-marker" d="M${x(r - h)},${x(f - A2)}L${x(r + h)},${x(f + A2)}M${x(r - u)},${x(f - y)}L${x(r + u)},${x(f + y)}"/>`;
|
|
1117
|
+
}
|
|
1118
|
+
return "";
|
|
1119
|
+
}
|
|
1120
|
+
var Pn = Array.from({ length: 23 }, (n, c) => +`1e${c}`);
|
|
1121
|
+
function Un(n) {
|
|
1122
|
+
return cn(_n(n));
|
|
1123
|
+
}
|
|
1124
|
+
function _n(n) {
|
|
1125
|
+
let c = [], e = -1;
|
|
1126
|
+
for (let i = 0; i < n.length; ) {
|
|
1127
|
+
let s = n.charCodeAt(i);
|
|
1128
|
+
if (s >= 65 && s <= 90 && s !== 69) e = c.length + 1, c.push(s, 0), i++;
|
|
1129
|
+
else if (s === 45 || s === 46 || s >= 48 && s <= 57) {
|
|
1130
|
+
let d = s === 45 ? i + 1 : i, p = 0, g = -1;
|
|
1131
|
+
for (let r = n.charCodeAt(d); r >= 48 && r <= 57 || r === 46 && g < 0; r = n.charCodeAt(++d)) r === 46 ? g = 0 : (p = p * 10 + r - 48, g >= 0 && g++);
|
|
1132
|
+
let l;
|
|
1133
|
+
if ((n.charCodeAt(d) | 32) === 101 || p > Number.MAX_SAFE_INTEGER || g > 22) {
|
|
1134
|
+
for (let r = n.charCodeAt(d); r === 46 || r === 101 || r === 69 || r >= 48 && r <= 57 || (r === 45 || r === 43) && (n.charCodeAt(d - 1) | 32) === 101; r = n.charCodeAt(++d)) ;
|
|
1135
|
+
l = Number(n.slice(i, d));
|
|
1136
|
+
} else l = g > 0 ? p / Pn[g] : p, s === 45 && (l = -l);
|
|
1137
|
+
e >= 0 && (c.push(l), c[e]++), i = d;
|
|
1138
|
+
} else i++;
|
|
1139
|
+
}
|
|
1140
|
+
return c;
|
|
1141
|
+
}
|
|
1142
|
+
function Tn(n) {
|
|
1143
|
+
let c = Math.round(n * 100);
|
|
1144
|
+
return c === 0 ? 0 : c / 100;
|
|
1145
|
+
}
|
|
1146
|
+
function cn(n) {
|
|
1147
|
+
let c = [], e = 0, i = 0;
|
|
1148
|
+
for (let s = 0; s < n.length; ) {
|
|
1149
|
+
let d = n[s], p = n[s + 1], g = s + 2, l = g + p;
|
|
1150
|
+
if (s = l, d === 72 || d === 86) for (let r = g; r < l; r++) d === 72 ? e = n[r] : i = n[r], c.push(e, i);
|
|
1151
|
+
else if (d === 67 || d === 81) {
|
|
1152
|
+
let r = d === 67, f = r ? 6 : 4;
|
|
1153
|
+
for (let I = g; I + f <= l; I += f) {
|
|
1154
|
+
let h = n[I], A2 = n[I + 1], u = n[I + 2], y = n[I + 3], $ = r ? n[I + 4] : u, V = r ? n[I + 5] : y;
|
|
1155
|
+
for (let q = 0.125; q <= 1; q += 0.125) {
|
|
1156
|
+
let k = e + (h - e) * q, S = i + (A2 - i) * q, _ = h + (u - h) * q, M = A2 + (y - A2) * q;
|
|
1157
|
+
if (r) {
|
|
1158
|
+
let Y = u + ($ - u) * q, j = y + (V - y) * q;
|
|
1159
|
+
k += (_ - k) * q, S += (M - S) * q, _ += (Y - _) * q, M += (j - M) * q;
|
|
1160
|
+
}
|
|
1161
|
+
c.push(k + (_ - k) * q, S + (M - S) * q);
|
|
1162
|
+
}
|
|
1163
|
+
e = $, i = V;
|
|
1164
|
+
}
|
|
1165
|
+
} else if (d === 65) for (let r = g; r + 7 <= l; r += 7) Cn(c, e, i, n[r], n[r + 1], n[r + 3], n[r + 4], n[r + 5], n[r + 6]), e = n[r + 5], i = n[r + 6];
|
|
1166
|
+
else for (let r = g; r + 2 <= l; r += 2) d === 77 && r === g && c.length > 0 && c.push(NaN, NaN), e = n[r], i = n[r + 1], c.push(e, i);
|
|
1167
|
+
}
|
|
1168
|
+
return c;
|
|
1169
|
+
}
|
|
1170
|
+
function Cn(n, c, e, i, s, d, p, g, l) {
|
|
1171
|
+
let r = (c - g) / 2, f = (e - l) / 2;
|
|
1172
|
+
if (i === 0 || s === 0 || r === 0 && f === 0) {
|
|
1173
|
+
n.push(g, l);
|
|
1174
|
+
return;
|
|
1175
|
+
}
|
|
1176
|
+
let I = Math.max(1, Math.sqrt(r * r / (i * i) + f * f / (s * s)));
|
|
1177
|
+
i *= I, s *= I;
|
|
1178
|
+
let h = (d === p ? -1 : 1) * Math.sqrt(Math.max(0, (i * i * s * s - i * i * f * f - s * s * r * r) / (i * i * f * f + s * s * r * r))), A2 = h * i * f / s + (c + g) / 2, u = -h * s * r / i + (e + l) / 2, y = Math.atan2((e - u) / s, (c - A2) / i), $ = Math.atan2((l - u) / s, (g - A2) / i) - y;
|
|
1179
|
+
p && $ < 0 ? $ += 2 * Math.PI : !p && $ > 0 && ($ -= 2 * Math.PI);
|
|
1180
|
+
for (let V = 1; V <= 8; V++) n.push(A2 + i * Math.cos(y + $ * V / 8), u + s * Math.sin(y + $ * V / 8));
|
|
1181
|
+
}
|
|
1182
|
+
function On(n, c, e, i, s, d, p, g) {
|
|
1183
|
+
let l = 0, r = 1;
|
|
1184
|
+
for (let f = 0; f < 4; f++) {
|
|
1185
|
+
let I = f === 0 ? -e : f === 1 ? e : f === 2 ? -i : i, h = f === 0 ? n - s : f === 1 ? p - n : f === 2 ? c - d : g - c;
|
|
1186
|
+
I === 0 ? h < 0 && (r = -1) : I < 0 ? l = Math.max(l, h / I) : r = Math.min(r, h / I);
|
|
1187
|
+
}
|
|
1188
|
+
return l < r;
|
|
1189
|
+
}
|
|
1190
|
+
function Gn(n, c, e, i, s) {
|
|
1191
|
+
for (let d = 0; d + 2 < n.length; d += 2) {
|
|
1192
|
+
let p = n[d], g = n[d + 1], l = n[d + 2], r = n[d + 3];
|
|
1193
|
+
if (!(p < c && l < c || p > i && l > i || g < e && r < e || g > s && r > s) && On(p, g, l - p, r - g, c, e, i, s)) return true;
|
|
1194
|
+
}
|
|
1195
|
+
return false;
|
|
1196
|
+
}
|
|
1197
|
+
function Wn(n, c, e, i) {
|
|
1198
|
+
if (e.length === 0) return;
|
|
1199
|
+
let s = i ? cn(i) : Un(n), d = 1 / 0, p = 1 / 0, g = -1 / 0, l = -1 / 0;
|
|
1200
|
+
for (let I = 0; I < s.length + c.length; I += 2) {
|
|
1201
|
+
let h = I < s.length ? s[I] : c[I - s.length], A2 = I < s.length ? s[I + 1] : c[I + 1 - s.length];
|
|
1202
|
+
h < d && (d = h), h > g && (g = h), A2 < p && (p = A2), A2 > l && (l = A2);
|
|
1203
|
+
}
|
|
1204
|
+
let r, f = 1 / 0;
|
|
1205
|
+
for (let I of e) {
|
|
1206
|
+
let [h, A2, u, y] = I.box;
|
|
1207
|
+
if (g < h + 0.5 || d > u - 0.5 || l < A2 + 0.5 || p > y - 0.5) continue;
|
|
1208
|
+
let $ = Gn(s, h + 0.5, A2 + 0.5, u - 0.5, y - 0.5);
|
|
1209
|
+
for (let q = 0; q < c.length && !$; q += 2) $ = c[q] > h + 0.5 && c[q] < u - 0.5 && c[q + 1] > A2 + 0.5 && c[q + 1] < y - 0.5;
|
|
1210
|
+
if (!$) continue;
|
|
1211
|
+
if (d < h || g > u || p < A2 || l > y) return "";
|
|
1212
|
+
let V = (u - h) * (y - A2);
|
|
1213
|
+
V < f && (f = V, r = I);
|
|
1214
|
+
}
|
|
1215
|
+
return r;
|
|
1216
|
+
}
|
|
1217
|
+
function jn(n, c = "") {
|
|
1218
|
+
return (/[";]stroke:/.test(c) ? void 0 : A(n.shape)) ?? "";
|
|
1219
|
+
}
|
|
1220
|
+
function te(n, c) {
|
|
1221
|
+
let e = /[";]fill:([^;"]*)/.exec(c.shape)?.[1].trim();
|
|
1222
|
+
return e ? n.replace(/ fill="var\(--_bg\)"/g, ` fill="${e}"`) : n;
|
|
1223
|
+
}
|
|
1224
|
+
function ne(n, c, e, i = "", s) {
|
|
1225
|
+
let d = Wn(n, c, e, s);
|
|
1226
|
+
return d && jn(d, i);
|
|
1227
|
+
}
|
|
1228
|
+
var Xt = 4;
|
|
1229
|
+
function Hn(n, c, e = "", i = false) {
|
|
1230
|
+
let s = (f) => e.includes(f) ? new RegExp(`[";]${f}:([^;"]+);`).exec(e)?.[1].trim() : void 0, d = s("stroke");
|
|
1231
|
+
if (d === "none" || d === "transparent") return "";
|
|
1232
|
+
let p = i ? "2.5" : s("stroke-width"), g = "", l = "";
|
|
1233
|
+
p !== void 0 && /^[\d.]+(?:px)?$/.test(p) ? parseFloat(p) !== 1 && (g = ` stroke-width="${x(parseFloat(p) + Xt)}"`) : p !== void 0 && (l += `stroke-width:calc(${p} + ${Xt}px);`);
|
|
1234
|
+
for (let f of ["opacity", "stroke-opacity"]) {
|
|
1235
|
+
let I = s(f);
|
|
1236
|
+
I !== void 0 && (l += `${f}:${I};`);
|
|
1237
|
+
}
|
|
1238
|
+
let r = `<path d="${n}"/>` + c.replace(/ class="pele-marker"/g, "");
|
|
1239
|
+
return g || l ? `<g${g}${l ? ` style="${l}"` : ""}>${r}</g>` : r;
|
|
1240
|
+
}
|
|
1241
|
+
function ee(n, c, e, i = "", s = false) {
|
|
1242
|
+
return Hn(n.d, an(c, n.sx, n.sy, n.sdx, n.sdy, "var(--_bg)", "var(--_bg)") + an(e, n.ex, n.ey, n.edx, n.edy, "var(--_bg)", "var(--_bg)"), i, s);
|
|
1243
|
+
}
|
|
1244
|
+
function re(n) {
|
|
1245
|
+
return n ? `<g class="pele-casings" fill="none" stroke="var(--_bg)" stroke-width="${1 + Xt}" stroke-linecap="round" stroke-linejoin="round" pointer-events="none">${n}</g>` : "";
|
|
1246
|
+
}
|
|
1247
|
+
function oe(n, c, e, i, s, d) {
|
|
1248
|
+
let p = c.width + 8, g = c.height;
|
|
1249
|
+
return `<g class="pele-edge-label" data-id="${L(n)}"><rect x="${x(e - p / 2)}" y="${x(i - g / 2)}" width="${x(p)}" height="${x(g)}" rx="3" fill="var(--_bg)"/>` + Wt$1(c, e, i, s, d) + "</g>";
|
|
1250
|
+
}
|
|
1251
|
+
function se(n, c, e, i, s, d, p, g) {
|
|
1252
|
+
let l = (s ? c : e) / 2, r = Math.min(l - 4, 8 + i * 6), f = d + i * 8, I = Math.hypot(f, r) || 1, h = (y, $) => s ? `${x(n.x + $)},${x(n.y + e / 2 + y)}` : `${x(n.x + c / 2 + y)},${x(n.y + $)}`, A2 = f / I * p, u = r / I * p;
|
|
1253
|
+
return s ? (g.labelX = n.x, g.labelY = n.y + e / 2 + f + 4 + g.labelH / 2) : (g.labelX = n.x + c / 2 + f + 4 + g.labelW / 2, g.labelY = n.y), { d: `M${h(0, -r)}C${h(f, -r * 2)} ${h(f, r * 2)} ${h(A2, r + u)}`, sx: s ? n.x - r : n.x + c / 2, sy: s ? n.y + e / 2 : n.y - r, sdx: s ? 0 : -1, sdy: s ? -1 : 0, ex: s ? n.x + r : n.x + c / 2, ey: s ? n.y + e / 2 : n.y + r, edx: s ? -r / I : -f / I, edy: s ? -f / I : -r / I };
|
|
1254
|
+
}
|
|
1255
|
+
export {
|
|
1256
|
+
Ht as H,
|
|
1257
|
+
In as I,
|
|
1258
|
+
Jn as J,
|
|
1259
|
+
Kn as K,
|
|
1260
|
+
Wn as W,
|
|
1261
|
+
Xn as X,
|
|
1262
|
+
Yn as Y,
|
|
1263
|
+
Zn as Z,
|
|
1264
|
+
_t as _,
|
|
1265
|
+
Hn as a,
|
|
1266
|
+
an as b,
|
|
1267
|
+
ee as e,
|
|
1268
|
+
jn as j,
|
|
1269
|
+
kn as k,
|
|
1270
|
+
ne as n,
|
|
1271
|
+
oe as o,
|
|
1272
|
+
qn as q,
|
|
1273
|
+
re as r,
|
|
1274
|
+
se as s,
|
|
1275
|
+
te as t
|
|
1276
|
+
};
|