@aiderdesk/aiderdesk 0.87.0 → 0.89.0
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/out/renderer/assets/2DXBBFLN-DhlZjS3f.js +666 -0
- package/out/renderer/assets/46IJ22JX-C1e8pvI2.js +853 -0
- package/out/renderer/assets/4TTDE5I4-Bea_IXhu.js +501 -0
- package/out/renderer/assets/4UF3HTLV-CVqcE2iq.js +29 -0
- package/out/renderer/assets/5THPTBWS-2mBFupjU.js +21 -0
- package/out/renderer/assets/7WLXJQOR-C8MM6Bra.js +23 -0
- package/out/renderer/assets/AAXQQPKT-BVbjBycX.js +1130 -0
- package/out/renderer/assets/AKE5O7KZ-Dr4O6i9X.js +184 -0
- package/out/renderer/assets/{AgentSettings-Cp7VI6CM.js → AgentSettings-ByYnHHTv.js} +710 -255
- package/out/renderer/assets/BNMLP6AG-CHDGj3j_.js +804 -0
- package/out/renderer/assets/DKTLEL5E-Dj3316cp.js +42 -0
- package/out/renderer/assets/DR6PKOQU-C6a3Tq7K.js +301 -0
- package/out/renderer/assets/E4RJ7UJB-BQWgl9gv.js +441 -0
- package/out/renderer/assets/ELSXBIJH-CVPK3kX4.js +39 -0
- package/out/renderer/assets/ERTIBQVS-71_Ru0iJ.js +182 -0
- package/out/renderer/assets/F653G4FO-Dj2Ang6n.js +1497 -0
- package/out/renderer/assets/FKCDD66M-DCrQTwBi.js +205 -0
- package/out/renderer/assets/FP7KDXVC-DKVnH-En.js +221 -0
- package/out/renderer/assets/FT5I3RHX-hlTJy7Nw.js +243 -0
- package/out/renderer/assets/FTXIJQGB-BX14b7pN.js +13 -0
- package/out/renderer/assets/G3MDBVQH-qZ3yfAIw.js +25 -0
- package/out/renderer/assets/GY35JXOZ-cSi0MdIc.js +168 -0
- package/out/renderer/assets/H5EEJPP2-bpYW0xE8.js +353 -0
- package/out/renderer/assets/HWDLEDTA-uLGgs5fE.js +982 -0
- package/out/renderer/assets/{InfoIcon-DesJ60KC.js → InfoIcon-DI4teJbi.js} +1 -1
- package/out/renderer/assets/JZWSX6AR-B0pkfB2b.js +67 -0
- package/out/renderer/assets/KQOEJWJY-EQFQbIDt.js +84 -0
- package/out/renderer/assets/KS3BB3KE-DclWHpbY.js +138 -0
- package/out/renderer/assets/KXJRRZHI-CHoCRoQ4.js +502 -0
- package/out/renderer/assets/KaTeX_AMS-Regular-BQhdFMY1.woff2 +0 -0
- package/out/renderer/assets/KaTeX_AMS-Regular-DMm9YOAa.woff +0 -0
- package/out/renderer/assets/KaTeX_AMS-Regular-DRggAlZN.ttf +0 -0
- package/out/renderer/assets/KaTeX_Caligraphic-Bold-ATXxdsX0.ttf +0 -0
- package/out/renderer/assets/KaTeX_Caligraphic-Bold-BEiXGLvX.woff +0 -0
- package/out/renderer/assets/KaTeX_Caligraphic-Bold-Dq_IR9rO.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Caligraphic-Regular-CTRA-rTL.woff +0 -0
- package/out/renderer/assets/KaTeX_Caligraphic-Regular-Di6jR-x-.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Caligraphic-Regular-wX97UBjC.ttf +0 -0
- package/out/renderer/assets/KaTeX_Fraktur-Bold-BdnERNNW.ttf +0 -0
- package/out/renderer/assets/KaTeX_Fraktur-Bold-BsDP51OF.woff +0 -0
- package/out/renderer/assets/KaTeX_Fraktur-Bold-CL6g_b3V.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Fraktur-Regular-CB_wures.ttf +0 -0
- package/out/renderer/assets/KaTeX_Fraktur-Regular-CTYiF6lA.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Fraktur-Regular-Dxdc4cR9.woff +0 -0
- package/out/renderer/assets/KaTeX_Main-Bold-Cx986IdX.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Main-Bold-Jm3AIy58.woff +0 -0
- package/out/renderer/assets/KaTeX_Main-Bold-waoOVXN0.ttf +0 -0
- package/out/renderer/assets/KaTeX_Main-BoldItalic-DxDJ3AOS.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Main-BoldItalic-DzxPMmG6.ttf +0 -0
- package/out/renderer/assets/KaTeX_Main-BoldItalic-SpSLRI95.woff +0 -0
- package/out/renderer/assets/KaTeX_Main-Italic-3WenGoN9.ttf +0 -0
- package/out/renderer/assets/KaTeX_Main-Italic-BMLOBm91.woff +0 -0
- package/out/renderer/assets/KaTeX_Main-Italic-NWA7e6Wa.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Main-Regular-B22Nviop.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Main-Regular-Dr94JaBh.woff +0 -0
- package/out/renderer/assets/KaTeX_Main-Regular-ypZvNtVU.ttf +0 -0
- package/out/renderer/assets/KaTeX_Math-BoldItalic-B3XSjfu4.ttf +0 -0
- package/out/renderer/assets/KaTeX_Math-BoldItalic-CZnvNsCZ.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Math-BoldItalic-iY-2wyZ7.woff +0 -0
- package/out/renderer/assets/KaTeX_Math-Italic-DA0__PXp.woff +0 -0
- package/out/renderer/assets/KaTeX_Math-Italic-flOr_0UB.ttf +0 -0
- package/out/renderer/assets/KaTeX_Math-Italic-t53AETM-.woff2 +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Bold-CFMepnvq.ttf +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Bold-D1sUS0GD.woff2 +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Bold-DbIhKOiC.woff +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Italic-C3H0VqGB.woff2 +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Italic-DN2j7dab.woff +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Italic-YYjJ1zSn.ttf +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Regular-BNo7hRIc.ttf +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Regular-CS6fqUqJ.woff +0 -0
- package/out/renderer/assets/KaTeX_SansSerif-Regular-DDBCnlJ7.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Script-Regular-C5JkGWo-.ttf +0 -0
- package/out/renderer/assets/KaTeX_Script-Regular-D3wIWfF6.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Script-Regular-D5yQViql.woff +0 -0
- package/out/renderer/assets/KaTeX_Size1-Regular-C195tn64.woff +0 -0
- package/out/renderer/assets/KaTeX_Size1-Regular-Dbsnue_I.ttf +0 -0
- package/out/renderer/assets/KaTeX_Size1-Regular-mCD8mA8B.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Size2-Regular-B7gKUWhC.ttf +0 -0
- package/out/renderer/assets/KaTeX_Size2-Regular-Dy4dx90m.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Size2-Regular-oD1tc_U0.woff +0 -0
- package/out/renderer/assets/KaTeX_Size3-Regular-CTq5MqoE.woff +0 -0
- package/out/renderer/assets/KaTeX_Size3-Regular-DgpXs0kz.ttf +0 -0
- package/out/renderer/assets/KaTeX_Size4-Regular-BF-4gkZK.woff +0 -0
- package/out/renderer/assets/KaTeX_Size4-Regular-DWFBv043.ttf +0 -0
- package/out/renderer/assets/KaTeX_Size4-Regular-Dl5lxZxV.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Typewriter-Regular-C0xS9mPB.woff +0 -0
- package/out/renderer/assets/KaTeX_Typewriter-Regular-CO6r4hn1.woff2 +0 -0
- package/out/renderer/assets/KaTeX_Typewriter-Regular-D3Ib7_Hf.ttf +0 -0
- package/out/renderer/assets/MFVI5XKI-TmPyVySZ.js +10 -0
- package/out/renderer/assets/MWY2J62P-BlVjis68.js +1102 -0
- package/out/renderer/assets/MXGNCBL2-HvKcixVr.js +216 -0
- package/out/renderer/assets/N6DAJLIZ-B0JHSPS3.js +120 -0
- package/out/renderer/assets/NU5M23IW-CWgVJ5o_.js +116 -0
- package/out/renderer/assets/NV4XNBIS-uOSoaYKk.js +1221 -0
- package/out/renderer/assets/OGLU4SIR-CiNpshB1.js +289 -0
- package/out/renderer/assets/OUNS5N76-C6p0zhvm.js +1064 -0
- package/out/renderer/assets/{Onboarding-B2h7iatR.js → Onboarding-Ct6-CF4Z.js} +4 -4
- package/out/renderer/assets/PU4ISKXV-BQc-2oYa.js +515 -0
- package/out/renderer/assets/PUZGS23X-Bf89SCAj.js +21 -0
- package/out/renderer/assets/{ProviderHeader-BvigqAWX.js → ProviderHeader-Buje398H.js} +2 -2
- package/out/renderer/assets/Q3IYVLG5-DbP4qs2C.js +500 -0
- package/out/renderer/assets/QYHQDLKZ-dANs6SeT.js +983 -0
- package/out/renderer/assets/RVARI57O-DMrXgtoB.js +10 -0
- package/out/renderer/assets/RZSVICHU-CeuX_9H4.js +263 -0
- package/out/renderer/assets/{SettingsPage-CBonY1bv.js → SettingsPage-CLpPKXG1.js} +978 -848
- package/out/renderer/assets/UEXXS2NB-Bmbum3yG.js +25 -0
- package/out/renderer/assets/UHTQJXKL-C2OuiQBx.js +134 -0
- package/out/renderer/assets/URA2L2QI-DJ2BF8fn.js +201 -0
- package/out/renderer/assets/UXCHDUKG-B6wMZRAn.js +173 -0
- package/out/renderer/assets/{UsageDashboard-DFgckoeT.js → UsageDashboard-ORnsHGxF.js} +9130 -6449
- package/out/renderer/assets/VKNV3BUX-BMK4lviM.js +277 -0
- package/out/renderer/assets/VMV7XPHP-CzHnUaWh.js +127 -0
- package/out/renderer/assets/WEVWDWVA-BYWYeLxq.js +57 -0
- package/out/renderer/assets/XRRJ35LF-DaeQ2kbN.js +119 -0
- package/out/renderer/assets/YFKBLVVN-DsXlM7HO.js +990 -0
- package/out/renderer/assets/YHRE5QGZ-nB9z3NP1.js +697 -0
- package/out/renderer/assets/ZF3OVT4B-Ctn5OOBd.js +420 -0
- package/out/renderer/assets/{index-BFhJk8dv.js → index-BCaQe4ny.js} +2 -2
- package/out/renderer/assets/{index-Dk4pOCFt.js → index-BD-JYQGT.js} +5 -5
- package/out/renderer/assets/{index-bNFXvWqr.js → index-BGR4ZXWZ.js} +2 -2
- package/out/renderer/assets/{index-BP0q4HOE.js → index-BZBhErKV.js} +2 -2
- package/out/renderer/assets/{index-x_iC3w5N.js → index-BcWszklu.js} +1 -1
- package/out/renderer/assets/{index-C8TOzJWw.js → index-BpNNugm2.js} +4 -4
- package/out/renderer/assets/{index-uAJ0Zw9K.js → index-BrgyIQaN.js} +2 -2
- package/out/renderer/assets/{index-CuQvDzzr.js → index-Bt1dN7k_.js} +1 -1
- package/out/renderer/assets/{index-BZmjwrvJ.js → index-Bxu6rqm3.js} +1 -1
- package/out/renderer/assets/{index-tNlkrDYM.js → index-C6mXHxX3.js} +1 -1
- package/out/renderer/assets/{index-Z71oMk_m.js → index-CCbq90uE.js} +1 -1
- package/out/renderer/assets/{index-DE2koGci.js → index-CCm3UXZP.js} +2 -2
- package/out/renderer/assets/{index-DKNYbwcH.js → index-CNkiGtsK.js} +3 -3
- package/out/renderer/assets/{index-D_o1aMFn.css → index-CWfnJXNI.css} +130 -0
- package/out/renderer/assets/{index-47ZLfCU8.js → index-Cc-He418.js} +72999 -82151
- package/out/renderer/assets/{index-Dx6kKrXY.js → index-Crdzxx6k.js} +19 -15
- package/out/renderer/assets/{index-B_PkNLqT.js → index-D30k3y98.js} +1 -1
- package/out/renderer/assets/{index-CasrGDb0.js → index-DAWoHfjM.js} +2 -2
- package/out/renderer/assets/{index-D-rE7YVD.js → index-DG5AIC6J.js} +3 -3
- package/out/renderer/assets/{index-BzOM6AUj.js → index-DSBgCNMv.js} +2 -2
- package/out/renderer/assets/{index-C1I2Idqy.js → index-DeRKeskE.js} +5 -5
- package/out/renderer/assets/{index-Bh4xfAPL.js → index-DgQEgdew.js} +2 -2
- package/out/renderer/assets/{index-BKmr7UTW.js → index-Dgdp4i2K.js} +1 -1
- package/out/renderer/assets/{index-Bbv79qeB.js → index-DnNK6R2g.js} +2 -2
- package/out/renderer/assets/{index-CiIr--kg.js → index-DrNutodm.js} +2 -2
- package/out/renderer/assets/{index-B2jZTTYL.js → index-FS3mY8Ct.js} +1 -1
- package/out/renderer/assets/{index-DvSWnCZD.js → index-KId2jLzt.js} +2 -2
- package/out/renderer/assets/{index-DWZF-uSf.js → index-PyRCX6hq.js} +5 -5
- package/out/renderer/assets/{index-J-dLn6uq.js → index-U8nE80jx.js} +2 -2
- package/out/renderer/assets/{index-cO9XeYPQ.js → index-Vw8jKJU_.js} +5 -5
- package/out/renderer/assets/{index-B9bf5T9j.js → index-_a6zbU-0.js} +1 -1
- package/out/renderer/assets/{index-CenYyetH.js → index-dsqlqRSG.js} +5 -5
- package/out/renderer/assets/{index-D4dhIRp1.js → index-rQL1hwaP.js} +5 -5
- package/out/renderer/assets/{jsx-dev-runtime-CtvYhMha.js → jsx-dev-runtime-Bwt8d4vP.js} +1 -1
- package/out/renderer/index.html +2 -2
- package/out/resources/prompts/system-prompt.hbs +11 -0
- package/out/resources/skills/extension-creator/SKILL.md +20 -1
- package/out/resources/skills/extension-creator/references/event-types.md +5 -3
- package/out/resources/skills/extension-creator/references/extension-interface.md +62 -1
- package/out/resources/skills/extension-creator/references/external-agent-providers.md +90 -0
- package/out/runner.js +2016 -615
- package/package.json +3 -3
- package/out/renderer/assets/abnfDiagram-N423BO3Z-DV7pjob8.js +0 -118
- package/out/renderer/assets/arc-C2NyJjKR.js +0 -131
- package/out/renderer/assets/architectureDiagram-T3A2C74G-BmG8PHmc.js +0 -8829
- package/out/renderer/assets/band-zXq5o_Ib.js +0 -77
- package/out/renderer/assets/blockDiagram-VBNYF7ZC-CJndPtzf.js +0 -3824
- package/out/renderer/assets/c4Diagram-5PPSVZJV-B9DY2Hnr.js +0 -2482
- package/out/renderer/assets/channel-CCPkBLnh.js +0 -7
- package/out/renderer/assets/chunk-2GRJ4B5K-Bt46bDfT.js +0 -116
- package/out/renderer/assets/chunk-2Q5K7J3B-DkQwfKC2.js +0 -19
- package/out/renderer/assets/chunk-5RXB4S5H-CFNEWvlR.js +0 -1988
- package/out/renderer/assets/chunk-5VM5RSS4-BNeZg_6d.js +0 -19
- package/out/renderer/assets/chunk-6Q2QTUOP-BU5gT8Us.js +0 -860
- package/out/renderer/assets/chunk-GF5L2VYU-BNML5JwJ.js +0 -2026
- package/out/renderer/assets/chunk-JWPE2WC7-Dvih3ku3.js +0 -16
- package/out/renderer/assets/chunk-KBJHAD2P-CMgAbRkQ.js +0 -24
- package/out/renderer/assets/chunk-RYQCIY6F-CAJ6Qldz.js +0 -474
- package/out/renderer/assets/chunk-XXDRQBXY-BDZJ-WFV.js +0 -13
- package/out/renderer/assets/classDiagram-JCYQIIEL-BJCilkUQ.js +0 -23
- package/out/renderer/assets/classDiagram-v2-OCEON4UE-BJCilkUQ.js +0 -23
- package/out/renderer/assets/cose-bilkent-JH36ORCC-D6MsqBP5.js +0 -4942
- package/out/renderer/assets/cynefin-VYW2F7L2-3kPlVPG0.js +0 -32093
- package/out/renderer/assets/cynefinDiagram-MW4NZA55-6BlkJqWN.js +0 -453
- package/out/renderer/assets/cytoscape.esm-Bx_1tVW-.js +0 -30332
- package/out/renderer/assets/dagre-VZM6K2ZE-Chj1W0as.js +0 -522
- package/out/renderer/assets/defaultLocale-B2RvLBDe.js +0 -206
- package/out/renderer/assets/diagram-7IWD3JNH-CHFj7vIm.js +0 -488
- package/out/renderer/assets/diagram-B4RE2ZJO-BqOMO30m.js +0 -632
- package/out/renderer/assets/diagram-LBJQPF4R-CkiuQM5K.js +0 -212
- package/out/renderer/assets/diagram-Q27KOJAE-WVbpb4Iq.js +0 -857
- package/out/renderer/assets/diagram-UB23O5K3-B9Q0wQI3.js +0 -311
- package/out/renderer/assets/ebnfDiagram-BXEA7PRR-BUhf1ZxU.js +0 -138
- package/out/renderer/assets/erDiagram-JOGREHBK-DGxWkssI.js +0 -1238
- package/out/renderer/assets/flowDiagram-UKHOOZJN-D3ul5aGG.js +0 -2348
- package/out/renderer/assets/ganttDiagram-PKOTCBZU-BD3VbhAZ.js +0 -2782
- package/out/renderer/assets/gitGraphDiagram-DS77QQ5N-x-7NMw7v.js +0 -1373
- package/out/renderer/assets/graph-BDbmSegI.js +0 -1308
- package/out/renderer/assets/infoDiagram-6WML65LV-BMwbA6CU.js +0 -31
- package/out/renderer/assets/init-CTO7spbL.js +0 -35
- package/out/renderer/assets/ishikawaDiagram-WSZJBQD7-Bx90Gz0s.js +0 -967
- package/out/renderer/assets/journeyDiagram-NVQOT4AX-Dh4pUAU5.js +0 -1255
- package/out/renderer/assets/kanban-definition-27J2QSJJ-BZ_lX-ko.js +0 -1052
- package/out/renderer/assets/katex-oVG3DVWa.js +0 -14499
- package/out/renderer/assets/layout-oaOUFeBM.js +0 -2326
- package/out/renderer/assets/linear-B2eGZpM_.js +0 -361
- package/out/renderer/assets/map-BijQCI9U.js +0 -299
- package/out/renderer/assets/mindmap-definition-FAOFIHXS-BeWZh5qg.js +0 -1153
- package/out/renderer/assets/ordinal-BD3Y6v77.js +0 -77
- package/out/renderer/assets/pegDiagram-VL7TDLO6-BA6NzzN6.js +0 -126
- package/out/renderer/assets/pieDiagram-7S7Q4E2Y-KJmT5t-P.js +0 -316
- package/out/renderer/assets/quadrantDiagram-CIZ2JOQS-BdFz_bQU.js +0 -1343
- package/out/renderer/assets/railroadDiagram-AXF67PYL-CbH2ZZ1S.js +0 -92
- package/out/renderer/assets/requirementDiagram-LRYGKXZP-BZXG5Vgf.js +0 -1204
- package/out/renderer/assets/sankeyDiagram-W5VNT64P-CV1Upv22.js +0 -1274
- package/out/renderer/assets/sequenceDiagram-SI44F4Z6-Csbi3ivi.js +0 -4514
- package/out/renderer/assets/sizeCapture-X5ZJPWSS-CaN4k1d3.js +0 -62
- package/out/renderer/assets/stateDiagram-OKZ733FA-DSo1KeOQ.js +0 -452
- package/out/renderer/assets/stateDiagram-v2-UEYNNEHI-BhXw89HT.js +0 -22
- package/out/renderer/assets/swimlanes-SLNWSIFB-p3GZ-wkU.js +0 -8557
- package/out/renderer/assets/swimlanesDiagram-ULZ7WXOC-DGBdyiqy.js +0 -20
- package/out/renderer/assets/time-4LaKa9ym.js +0 -985
- package/out/renderer/assets/timeline-definition-Z64GVDOM-DfY8hG5p.js +0 -1596
- package/out/renderer/assets/vennDiagram-T6HMQDX7-wp87GaTi.js +0 -2515
- package/out/renderer/assets/wardleyDiagram-T6FBY63Y-DNrC2vOI.js +0 -975
- package/out/renderer/assets/xychartDiagram-ELKLHX3M-Bn8J2SKt.js +0 -1943
|
@@ -0,0 +1,982 @@
|
|
|
1
|
+
import { x, y, f as ft } from "./RZSVICHU-CeuX_9H4.js";
|
|
2
|
+
function gn(l, A, e = 0) {
|
|
3
|
+
return { w: l, h: A, kind: e, pin: 0, span: 0, x: 0, y: 0, rank: 0 };
|
|
4
|
+
}
|
|
5
|
+
function En(l, A, e = 1, g = 0, b = 0) {
|
|
6
|
+
return { tail: l, head: A, minlen: e, labelW: g, labelH: b, tailDx: 0, headDx: 0, tailFixed: false, headFixed: false, reversed: false, points: [], labelX: 0, labelY: 0 };
|
|
7
|
+
}
|
|
8
|
+
var Bt = 24, _t = 2e4, Kt = 16, Tt = 8, Vt = 0.125, Ot = 3, qt = 18, zt = 10, Qt = 14, Zt = 2, Jt = 28, Wt = 12, tn = 12, nn = 8, en = 4, Ht = 0.5, wt = 0.5, Gt = 12, rn = 40, jt = 400;
|
|
9
|
+
function Mt(l) {
|
|
10
|
+
return l === 1 || l === 2;
|
|
11
|
+
}
|
|
12
|
+
function Ct(l, A, e, g) {
|
|
13
|
+
for (let b = A + 1; b < e; b++) {
|
|
14
|
+
let F = l[b], E = g[F], R = b - 1;
|
|
15
|
+
for (; R >= A && (g[l[R]] > E || g[l[R]] === E && l[R] > F); ) l[R + 1] = l[R], R--;
|
|
16
|
+
l[R + 1] = F;
|
|
17
|
+
}
|
|
18
|
+
}
|
|
19
|
+
function In(l, A, e) {
|
|
20
|
+
let g = l.length;
|
|
21
|
+
if (g === 0) return { width: 0, height: 0 };
|
|
22
|
+
let b = A.length, F = 1;
|
|
23
|
+
if (b > 0) {
|
|
24
|
+
let n = /* @__PURE__ */ new Set();
|
|
25
|
+
for (let f of A) {
|
|
26
|
+
let M = Math.min(f.tail, f.head), B = Math.max(f.tail, f.head), Y = M * g + B;
|
|
27
|
+
if (f.labelW > 0 || n.has(Y)) {
|
|
28
|
+
F = 2;
|
|
29
|
+
break;
|
|
30
|
+
}
|
|
31
|
+
n.add(Y);
|
|
32
|
+
}
|
|
33
|
+
}
|
|
34
|
+
on(l, A), sn(l, A, F);
|
|
35
|
+
let E = new Int32Array(b), R = 0;
|
|
36
|
+
for (let n = 0; n < b; n++) {
|
|
37
|
+
let f = A[n];
|
|
38
|
+
E[n] = Math.abs(l[f.head].rank - l[f.tail].rank), E[n] > 1 && (R += E[n] - 1);
|
|
39
|
+
}
|
|
40
|
+
let y2 = new Uint8Array(b);
|
|
41
|
+
if (R > _t) {
|
|
42
|
+
let n = [];
|
|
43
|
+
for (let f = 0; f < b; f++) E[f] > 1 && n.push(f);
|
|
44
|
+
n.sort((f, M) => E[M] - E[f] || f - M);
|
|
45
|
+
for (let f of n) {
|
|
46
|
+
if (R <= _t) break;
|
|
47
|
+
y2[f] = 1, R -= E[f] - 1;
|
|
48
|
+
}
|
|
49
|
+
}
|
|
50
|
+
let s = g + R, w = new Float64Array(s), X = new Float64Array(s), h = new Uint8Array(s), S = new Int32Array(s), u = 0;
|
|
51
|
+
for (let n = 0; n < g; n++) {
|
|
52
|
+
let f = l[n];
|
|
53
|
+
w[n] = f.w, X[n] = f.h, h[n] = f.kind, S[n] = f.rank, f.rank > u && (u = f.rank);
|
|
54
|
+
}
|
|
55
|
+
let D = 0;
|
|
56
|
+
for (let n = 0; n < b; n++) y2[n] || (D += E[n]);
|
|
57
|
+
let _ = new Int32Array(D), z = new Int32Array(D), q = new Float64Array(D), p = new Float64Array(D), T = new Int32Array(b).fill(-1), N = new Uint8Array(u + 1), I = new Int32Array(b).fill(-1), V = false;
|
|
58
|
+
for (let n = 0; n < g; n++) l[n].span > 0 && l[n].kind === 0 && (V = true);
|
|
59
|
+
let P = V ? new Uint8Array(D) : void 0, C = V ? new Uint8Array(D) : void 0, c = new Int32Array(b).fill(-1), L = new Int32Array(b).fill(-1), r = false;
|
|
60
|
+
{
|
|
61
|
+
let n = g, f = 0;
|
|
62
|
+
for (let M = 0; M < b; M++) {
|
|
63
|
+
if (y2[M]) continue;
|
|
64
|
+
let B = A[M], Y = B.reversed ? B.head : B.tail, et = B.reversed ? B.tail : B.head, ft2 = B.reversed ? B.headDx : B.tailDx, nt = B.reversed ? B.tailDx : B.headDx;
|
|
65
|
+
(ft2 !== 0 || nt !== 0) && (r = true);
|
|
66
|
+
let it = S[Y], ht = S[et], pt = -1;
|
|
67
|
+
B.labelW > 0 && (pt = it + (ht - it >> 1), F === 2 && ht - it >= 4 ? (pt & 1) === 1 && (pt += B.reversed ? 1 : -1) : F === 2 && (pt & 1) === 0 && (pt += B.reversed ? 1 : -1));
|
|
68
|
+
let kt = Y;
|
|
69
|
+
ht - it > 1 && (T[M] = n), c[M] = f, P && !(B.reversed ? B.headFixed : B.tailFixed) && (P[f] = B.reversed ? 2 : 1);
|
|
70
|
+
for (let Dt = it + 1; Dt < ht; Dt++) {
|
|
71
|
+
let xt = n++;
|
|
72
|
+
S[xt] = Dt, Dt === pt ? (w[xt] = B.labelW, X[xt] = B.labelH, h[xt] = 2, I[M] = xt, N[Dt] |= B.reversed ? 2 : 1) : h[xt] = 1, _[f] = kt, z[f] = xt, q[f] = kt === Y ? ft2 : 0, f++, kt = xt;
|
|
73
|
+
}
|
|
74
|
+
_[f] = kt, z[f] = et, q[f] = kt === Y ? ft2 : 0, p[f] = nt, C && !(B.reversed ? B.tailFixed : B.headFixed) && (C[f] = B.reversed ? 1 : 2), L[M] = f, f++;
|
|
75
|
+
}
|
|
76
|
+
}
|
|
77
|
+
let a = new Int32Array(s + 1), $ = new Int32Array(s + 1);
|
|
78
|
+
for (let n = 0; n < D; n++) a[_[n] + 1]++, $[z[n] + 1]++;
|
|
79
|
+
for (let n = 0; n < s; n++) a[n + 1] += a[n], $[n + 1] += $[n];
|
|
80
|
+
let v = new Int32Array(D), K = new Int32Array(D);
|
|
81
|
+
{
|
|
82
|
+
let n = a.slice(0, s), f = $.slice(0, s);
|
|
83
|
+
for (let M = 0; M < D; M++) v[n[_[M]]++] = M, K[f[z[M]]++] = M;
|
|
84
|
+
}
|
|
85
|
+
let W = new Int32Array(u + 2);
|
|
86
|
+
for (let n = 0; n < s; n++) W[S[n] + 1]++;
|
|
87
|
+
for (let n = 0; n <= u; n++) W[n + 1] += W[n];
|
|
88
|
+
let o = new Int32Array(s), O = new Int32Array(s);
|
|
89
|
+
{
|
|
90
|
+
let n = new Int32Array(s), f = W.slice(0, u + 1);
|
|
91
|
+
for (let Y = 0; Y < s; Y++) n[f[S[Y]]++] = Y;
|
|
92
|
+
f.set(W.subarray(0, u + 1));
|
|
93
|
+
let M = new Uint8Array(s), B = [];
|
|
94
|
+
for (let Y = 0; Y < s; Y++) if (!M[n[Y]]) for (B.push(n[Y]); B.length > 0; ) {
|
|
95
|
+
let et = B.pop();
|
|
96
|
+
if (!M[et]) {
|
|
97
|
+
M[et] = 1, o[f[S[et]]++] = et;
|
|
98
|
+
for (let ft2 = a[et + 1] - 1; ft2 >= a[et]; ft2--) {
|
|
99
|
+
let nt = z[v[ft2]];
|
|
100
|
+
M[nt] || B.push(nt);
|
|
101
|
+
}
|
|
102
|
+
}
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
let k = false;
|
|
106
|
+
for (let n = 0; n < g; n++) l[n].pin !== 0 && (k = true);
|
|
107
|
+
if (k) for (let n = 0; n <= u; n++) {
|
|
108
|
+
let f = Array.from(o.subarray(W[n], W[n + 1])), M = /* @__PURE__ */ new Map();
|
|
109
|
+
f.forEach((Y, et) => M.set(Y, et));
|
|
110
|
+
let B = (Y) => Y < g ? l[Y].pin : 0;
|
|
111
|
+
f.sort((Y, et) => B(Y) - B(et) || M.get(Y) - M.get(et)), o.set(f, W[n]);
|
|
112
|
+
}
|
|
113
|
+
let G = () => {
|
|
114
|
+
for (let n = 0; n <= u; n++) {
|
|
115
|
+
let f = W[n];
|
|
116
|
+
for (let M = f, B = W[n + 1]; M < B; M++) O[o[M]] = M - f;
|
|
117
|
+
}
|
|
118
|
+
};
|
|
119
|
+
G();
|
|
120
|
+
let t = { n: s, real: g, maxRank: u, W: w, KIND: h, RANK: S, EF: _, ET: z, EFD: q, ETD: p, succStart: a, succE: v, predStart: $, predE: K, layerStart: W, order: o, pos: O, offsets: r };
|
|
121
|
+
D > 0 && u > 0 && (yn(t, l), G()), P && C && an(t, l, P, C);
|
|
122
|
+
let i = pn(t, e), m = mn(t);
|
|
123
|
+
if (P && C) {
|
|
124
|
+
let n = cn(t, P, C);
|
|
125
|
+
ln(t, l, i, n, e, m), fn(t, l, i, P, C, n, m), un(t, i, m, e);
|
|
126
|
+
for (let f = 0; f < b; f++) {
|
|
127
|
+
if (y2[f]) continue;
|
|
128
|
+
let M = A[f], B = q[c[f]], Y = p[L[f]];
|
|
129
|
+
M.tailDx = M.reversed ? Y : B, M.headDx = M.reversed ? B : Y;
|
|
130
|
+
}
|
|
131
|
+
}
|
|
132
|
+
let U = new Uint8Array(s);
|
|
133
|
+
m && !e.tracks && hn(t, i, m, T, E, e.apart ? 0 : e.edgeSep, U), e.tracks || dn(t, i, T, E, e.edgeSep, U);
|
|
134
|
+
let j = new Int32Array(b + 1), d = e.tracks || P && !e.straight ? { from: [], to: [], rank: [], lower: [], track: [], levels: [], wide: [] } : void 0, H = new Int32Array(u + 1);
|
|
135
|
+
if (d) {
|
|
136
|
+
for (let n = 0; n < b; n++) {
|
|
137
|
+
if (j[n] = d.from.length, y2[n]) continue;
|
|
138
|
+
let f = T[n], M = false;
|
|
139
|
+
for (let et = f, ft2 = f < 0 ? f : f + E[n] - 1; et < ft2; et++) {
|
|
140
|
+
let nt = m !== void 0 && m[S[et]] === 1;
|
|
141
|
+
!e.tracks && nt !== (U[et] === 1) && (M = true);
|
|
142
|
+
}
|
|
143
|
+
if (M) continue;
|
|
144
|
+
let B = i[_[c[n]]] + q[c[n]], Y = S[_[c[n]]];
|
|
145
|
+
for (let et = f, ft2 = f < 0 ? f : f + E[n] - 1; et < ft2; et++) m && m[S[et]] || (d.from.push(B), d.to.push(i[et]), d.rank.push(Y), d.lower.push(et), B = i[et], Y = S[et]);
|
|
146
|
+
d.from.push(B), d.to.push(i[z[L[n]]] + p[L[n]]), d.rank.push(Y), d.lower.push(-1);
|
|
147
|
+
}
|
|
148
|
+
j[b] = d.from.length;
|
|
149
|
+
}
|
|
150
|
+
let at = (n, f) => {
|
|
151
|
+
let M = false;
|
|
152
|
+
for (let B = W[n]; B < W[n + 1]; B++) {
|
|
153
|
+
let Y = h[o[B]];
|
|
154
|
+
if (Y === f) M = true;
|
|
155
|
+
else if (Y !== 1) return false;
|
|
156
|
+
}
|
|
157
|
+
return M;
|
|
158
|
+
}, rt = at(0, 3) ? F : 0, ot = at(u, 4) ? F : 0, J = new Float64Array(u + 1);
|
|
159
|
+
for (let n = 0; n < D; n++) {
|
|
160
|
+
let f = Math.abs(i[_[n]] + q[n] - i[z[n]] - p[n]);
|
|
161
|
+
f > J[S[_[n]]] && (J[S[_[n]]] = f);
|
|
162
|
+
}
|
|
163
|
+
let st = new Float64Array(u + 1), x2 = new Float64Array(u + 1), Z = (n) => (n < rt || n >= u - ot ? e.portSep : e.rankSep) / F, tt = new Float64Array(u + 1);
|
|
164
|
+
for (let n = 0; n < u; n++) tt[n] = d ? Z(n) : Math.max(Z(n), Math.min(Ot * e.rankSep / F, J[n] * Vt));
|
|
165
|
+
let ct = new Uint8Array(u + 1).fill(1);
|
|
166
|
+
for (let n = 0; n < g; n++) ct[S[n]] = 0;
|
|
167
|
+
for (let n = 1; n < u; n++) {
|
|
168
|
+
if (e.tracks || !ct[n] || N[n] !== 1 && N[n] !== 2) continue;
|
|
169
|
+
let f = Math.min((e.headRoom ?? 0) / 2, tt[N[n] === 1 ? n - 1 : n] / 2);
|
|
170
|
+
tt[n - 1] += N[n] === 1 ? -f : f, tt[n] += N[n] === 1 ? f : -f;
|
|
171
|
+
}
|
|
172
|
+
let lt = (n) => h[n] === 1 && ct[S[n]] && !e.tracks ? (x2[S[n]] - st[S[n]]) / 4 : 0, ut = e.tracks ? qt : Jt, bt = e.tracks ? zt : Wt, dt = e.tracks ? Qt : Wt, yt = new Int32Array(u + 1);
|
|
173
|
+
if (d) {
|
|
174
|
+
let n = new Float64Array(u + 1);
|
|
175
|
+
for (let M = 0; M < u; M++) {
|
|
176
|
+
if (m && m[M]) continue;
|
|
177
|
+
let B = M + 1;
|
|
178
|
+
for (n[M] = tt[M]; B < u && m && m[B]; ) n[M] += tt[B++];
|
|
179
|
+
yt[M] = B;
|
|
180
|
+
}
|
|
181
|
+
for (let M = 0; M < d.from.length; M++) d.wide.push(Math.abs(d.from[M] - d.to[M]) > Zt * n[d.rank[M]] ? 1 : 0);
|
|
182
|
+
let f = new Float64Array(u + 1);
|
|
183
|
+
bn(d, H, !e.tracks, n, f);
|
|
184
|
+
for (let M = 0; M < u; M++) H[M] > 0 ? tt[M] += Math.max(0, 2 * ut + (H[M] - 1) * bt - n[M]) : f[M] > 0 && (tt[M] += Math.max(0, Math.min(Ot * e.rankSep, f[M]) - n[M]));
|
|
185
|
+
}
|
|
186
|
+
let gt = 0;
|
|
187
|
+
for (let n = 0; n <= u; n++) {
|
|
188
|
+
let f = 0;
|
|
189
|
+
for (let M = W[n]; M < W[n + 1]; M++) X[o[M]] > f && (f = X[o[M]]);
|
|
190
|
+
st[n] = gt, x2[n] = gt + f, gt += f + tt[n];
|
|
191
|
+
}
|
|
192
|
+
let vt = gt, Ft = (n, f = d.track[n]) => {
|
|
193
|
+
let M = d.rank[n], B = x2[M], Y = st[yt[M]], et = e.tracks ? H[M] : d.levels[n], ft2 = et > 1 ? Math.min(dt, (Y - B - 2 * ut) / (et - 1)) : 0;
|
|
194
|
+
return (B + Y) / 2 + (f - (et - 1) / 2) * ft2;
|
|
195
|
+
}, mt = 1 / 0, Et = -1 / 0;
|
|
196
|
+
for (let n = 0; n < s; n++) {
|
|
197
|
+
let f = w[n] / 2;
|
|
198
|
+
i[n] - f < mt && (mt = i[n] - f), i[n] + f > Et && (Et = i[n] + f);
|
|
199
|
+
}
|
|
200
|
+
let It = new Uint8Array(u + 1), At = new Uint8Array(u + 1);
|
|
201
|
+
for (let n = 0; n < g; n++) h[n] !== 0 || !P || ($[n + 1] > $[n] && (It[S[n]] = 1), a[n + 1] > a[n] && (At[S[n]] = 1));
|
|
202
|
+
for (let n = 0; n < g; n++) {
|
|
203
|
+
let f = l[n], M = f.rank;
|
|
204
|
+
f.x = i[n] - mt, h[n] === 0 && At[M] && !It[M] ? f.y = x2[M] - f.h / 2 : h[n] === 0 && It[M] && !At[M] ? f.y = st[M] + f.h / 2 : f.y = (st[M] + x2[M]) / 2;
|
|
205
|
+
}
|
|
206
|
+
for (let n = 0; n < b; n++) {
|
|
207
|
+
let f = A[n], M = l[f.reversed ? f.head : f.tail], B = l[f.reversed ? f.tail : f.head], Y = [M.x + (f.reversed ? f.headDx : f.tailDx), M.y + M.h / 2], et = T[n];
|
|
208
|
+
if (d && j[n + 1] > j[n]) for (let nt = j[n]; nt < j[n + 1]; nt++) {
|
|
209
|
+
if (d.track[nt] >= 0 && (e.tracks || d.wide[nt] === 1)) {
|
|
210
|
+
let ht = Ft(nt);
|
|
211
|
+
Y.push(d.from[nt] - mt, ht, d.to[nt] - mt, ht);
|
|
212
|
+
} else d.track[nt] > 0 && Y.push(d.from[nt] - mt, Ft(nt, d.track[nt] - 1));
|
|
213
|
+
let it = d.lower[nt];
|
|
214
|
+
it < 0 || (Y.push(i[it] - mt, st[S[it]] + lt(it)), x2[S[it]] > st[S[it]] && Y.push(i[it] - mt, x2[S[it]] - lt(it)));
|
|
215
|
+
}
|
|
216
|
+
else if (et >= 0) for (let nt = et, it = et + E[n] - 1; nt < it; nt++) {
|
|
217
|
+
if (U[nt]) continue;
|
|
218
|
+
let ht = i[nt] - mt, pt = st[S[nt]], kt = x2[S[nt]];
|
|
219
|
+
Y.push(ht, pt + lt(nt)), kt > pt && Y.push(ht, kt - lt(nt));
|
|
220
|
+
}
|
|
221
|
+
if (Y.push(B.x + (f.reversed ? f.tailDx : f.headDx), B.y - B.h / 2), f.reversed) for (let nt = 0, it = Y.length - 2; nt < it; nt += 2, it -= 2) {
|
|
222
|
+
let ht = Y[nt], pt = Y[nt + 1];
|
|
223
|
+
Y[nt] = Y[it], Y[nt + 1] = Y[it + 1], Y[it] = ht, Y[it + 1] = pt;
|
|
224
|
+
}
|
|
225
|
+
f.points = Y;
|
|
226
|
+
let ft2 = I[n];
|
|
227
|
+
ft2 >= 0 ? (f.labelX = i[ft2] - mt, f.labelY = (st[S[ft2]] + x2[S[ft2]]) / 2) : f.labelW > 0 && (f.labelX = (Y[0] + Y[Y.length - 2]) / 2, f.labelY = (Y[1] + Y[Y.length - 1]) / 2);
|
|
228
|
+
}
|
|
229
|
+
return { width: Et - mt, height: vt };
|
|
230
|
+
}
|
|
231
|
+
function on(l, A) {
|
|
232
|
+
let e = l.length, g = A.length, b = new Int32Array(e + 1);
|
|
233
|
+
for (let s = 0; s < g; s++) {
|
|
234
|
+
let w = A[s];
|
|
235
|
+
w.reversed = l[w.head].kind === 3 || l[w.tail].kind === 4, w.reversed || b[w.tail + 1]++;
|
|
236
|
+
}
|
|
237
|
+
for (let s = 0; s < e; s++) b[s + 1] += b[s];
|
|
238
|
+
let F = new Int32Array(b[e]);
|
|
239
|
+
{
|
|
240
|
+
let s = b.slice(0, e);
|
|
241
|
+
for (let w = 0; w < g; w++) A[w].reversed || (F[s[A[w].tail]++] = w);
|
|
242
|
+
}
|
|
243
|
+
let E = new Uint8Array(e), R = b.slice(0, e), y2 = [];
|
|
244
|
+
for (let s = 0; s < e; s++) if (E[s] === 0) for (y2.push(s), E[s] = 1; y2.length > 0; ) {
|
|
245
|
+
let w = y2[y2.length - 1];
|
|
246
|
+
if (R[w] < b[w + 1]) {
|
|
247
|
+
let X = A[F[R[w]++]], h = X.head;
|
|
248
|
+
E[h] === 1 ? X.reversed = true : E[h] === 0 && (E[h] = 1, y2.push(h));
|
|
249
|
+
} else E[w] = 2, y2.pop();
|
|
250
|
+
}
|
|
251
|
+
}
|
|
252
|
+
function sn(l, A, e) {
|
|
253
|
+
let g = l.length, b = A.length, F = new Int32Array(b), E = new Int32Array(b), R = new Int32Array(b), y2 = new Int32Array(g + 1), s = new Int32Array(g + 1);
|
|
254
|
+
for (let p = 0; p < b; p++) {
|
|
255
|
+
let T = A[p], N = T.reversed ? T.head : T.tail, I = T.reversed ? T.tail : T.head;
|
|
256
|
+
F[p] = N, E[p] = I, R[p] = Math.max(1, T.minlen) * e, y2[N + 1]++, s[I + 1]++;
|
|
257
|
+
}
|
|
258
|
+
for (let p = 0; p < g; p++) y2[p + 1] += y2[p], s[p + 1] += s[p];
|
|
259
|
+
let w = new Int32Array(b), X = new Int32Array(b);
|
|
260
|
+
{
|
|
261
|
+
let p = y2.slice(0, g), T = s.slice(0, g);
|
|
262
|
+
for (let N = 0; N < b; N++) w[p[F[N]]++] = N, X[T[E[N]]++] = N;
|
|
263
|
+
}
|
|
264
|
+
let h = new Int32Array(g), S = new Int32Array(g);
|
|
265
|
+
for (let p = 0; p < g; p++) S[p] = s[p + 1] - s[p];
|
|
266
|
+
let u = new Int32Array(g), D = 0;
|
|
267
|
+
for (let p = 0; p < g; p++) S[p] === 0 && (u[D++] = p);
|
|
268
|
+
for (let p = 0; p < D; p++) {
|
|
269
|
+
let T = u[p];
|
|
270
|
+
for (let N = y2[T]; N < y2[T + 1]; N++) {
|
|
271
|
+
let I = w[N], V = E[I];
|
|
272
|
+
h[T] + R[I] > h[V] && (h[V] = h[T] + R[I]), --S[V] === 0 && (u[D++] = V);
|
|
273
|
+
}
|
|
274
|
+
}
|
|
275
|
+
for (let p = 0; p < 8; p++) {
|
|
276
|
+
let T = false;
|
|
277
|
+
for (let N = D - 1; N >= 0; N--) {
|
|
278
|
+
let I = u[N], V = s[I + 1] - s[I], P = y2[I + 1] - y2[I];
|
|
279
|
+
if (V === 0 && P === 0) continue;
|
|
280
|
+
let C = -1 / 0, c = 1 / 0;
|
|
281
|
+
for (let r = s[I]; r < s[I + 1]; r++) {
|
|
282
|
+
let a = X[r];
|
|
283
|
+
C = Math.max(C, h[F[a]] + R[a]);
|
|
284
|
+
}
|
|
285
|
+
for (let r = y2[I]; r < y2[I + 1]; r++) {
|
|
286
|
+
let a = w[r];
|
|
287
|
+
c = Math.min(c, h[E[a]] - R[a]);
|
|
288
|
+
}
|
|
289
|
+
let L = h[I];
|
|
290
|
+
P > V && c !== 1 / 0 ? L = c : V > P && C !== -1 / 0 && (L = C), L !== h[I] && (h[I] = L, T = true);
|
|
291
|
+
}
|
|
292
|
+
if (!T) break;
|
|
293
|
+
}
|
|
294
|
+
let _ = 1 / 0, z = -1 / 0, q = false;
|
|
295
|
+
for (let p = 0; p < g; p++) {
|
|
296
|
+
let T = l[p].kind;
|
|
297
|
+
T === 3 && (q = true), !(T === 3 || T === 4) && (h[p] < _ && (_ = h[p]), h[p] > z && (z = h[p]));
|
|
298
|
+
}
|
|
299
|
+
_ === 1 / 0 && (_ = 0, z = 0);
|
|
300
|
+
for (let p = 0; p < g; p++) l[p].kind === 3 ? h[p] = _ - e : l[p].kind === 4 && (h[p] = z + e);
|
|
301
|
+
q && (_ -= e);
|
|
302
|
+
for (let p = 0; p < g; p++) l[p].rank = h[p] - _;
|
|
303
|
+
}
|
|
304
|
+
function Xt(l, A, e, g, b, F, E) {
|
|
305
|
+
let R = e === 0 ? l.predStart : l.succStart, y2 = e === 0 ? l.predE : l.succE, s = e === 0 ? l.EF : l.ET, w = l.pos;
|
|
306
|
+
F.length = 0;
|
|
307
|
+
for (let u = R[A]; u < R[A + 1]; u++) b[y2[u]] !== 0 && F.push(y2[u]);
|
|
308
|
+
if (F.length < 2) return 0;
|
|
309
|
+
F.sort((u, D) => w[s[u]] - w[s[D]] || u - D);
|
|
310
|
+
let X = (u) => {
|
|
311
|
+
let D = 0;
|
|
312
|
+
E.length = F.length, E[0] = 0;
|
|
313
|
+
for (let _ = 1; _ < F.length; _++) {
|
|
314
|
+
let z = b[F[_]] === b[F[_ - 1]];
|
|
315
|
+
E[_] = u(z && b[F[_]] === 1, z), D += E[_];
|
|
316
|
+
}
|
|
317
|
+
return D;
|
|
318
|
+
}, h = X(() => 1);
|
|
319
|
+
if (g / h < Tt && (h = X((u) => u ? 0.5 : 1)), g / h < Tt && (h = X((u, D) => D ? 0 : 1)), h === 0) return 0;
|
|
320
|
+
let S = Math.min(Kt, g / h);
|
|
321
|
+
for (let u = 1; u < F.length; u++) E[u] *= S;
|
|
322
|
+
return h * S;
|
|
323
|
+
}
|
|
324
|
+
function an(l, A, e, g) {
|
|
325
|
+
let { real: b, W: F, EFD: E, ETD: R } = l, y2 = [], s = [];
|
|
326
|
+
for (let w = 0; w < b; w++) {
|
|
327
|
+
let X = Math.min(A[w].span, F[w]);
|
|
328
|
+
if (!(X <= 0 || A[w].kind !== 0)) for (let h = 0; h < 2; h++) {
|
|
329
|
+
let S = Xt(l, w, h, X, h === 0 ? g : e, y2, s);
|
|
330
|
+
if (S === 0) continue;
|
|
331
|
+
let u = h === 0 ? R : E, D = -S / 2;
|
|
332
|
+
for (let _ = 0; _ < y2.length; _++) D += s[_], u[y2[_]] = D;
|
|
333
|
+
}
|
|
334
|
+
}
|
|
335
|
+
}
|
|
336
|
+
function $t(l, A, e, g) {
|
|
337
|
+
if (!A) return e;
|
|
338
|
+
let { KIND: b, RANK: F, EF: E, ET: R, succStart: y2, succE: s, predStart: w, predE: X } = l;
|
|
339
|
+
for (let h = 0; h < 1e5; h++) {
|
|
340
|
+
let S = g === 0 ? E[e] : R[e];
|
|
341
|
+
if (b[S] !== 1 || !A[F[S]]) break;
|
|
342
|
+
e = g === 0 ? X[w[S]] : s[y2[S]];
|
|
343
|
+
}
|
|
344
|
+
return e;
|
|
345
|
+
}
|
|
346
|
+
function cn(l, A, e) {
|
|
347
|
+
let g = [new Int32Array(l.n), new Int32Array(l.n)];
|
|
348
|
+
for (let b = 0; b < l.EF.length; b++) e[b] !== 0 && g[0][l.ET[b]]++, A[b] !== 0 && g[1][l.EF[b]]++;
|
|
349
|
+
return g;
|
|
350
|
+
}
|
|
351
|
+
function Rt(l, A) {
|
|
352
|
+
return Math.max(0.25, Math.min(0.5, 4 * Math.abs(A) / (Math.abs(l) || 1)));
|
|
353
|
+
}
|
|
354
|
+
function ln(l, A, e, g, b, F) {
|
|
355
|
+
let E = b.edgeSep, { n: R, real: y2, maxRank: s, KIND: w, RANK: X, W: h, EF: S, ET: u, EFD: D, ETD: _, succStart: z, succE: q, predStart: p, predE: T, layerStart: N, order: I, pos: V } = l, P = ($) => w[$] === 2 || w[$] === 1 && !(F !== void 0 && F[X[$]] === 1), C = ($, v) => {
|
|
356
|
+
let K = v === 0 ? S[$] : u[$];
|
|
357
|
+
return [v === 0 ? e[K] + D[$] : e[K] + _[$], K < y2 && A[K].kind === 0 ? g[1 - v][K] : 0];
|
|
358
|
+
}, c = ($) => {
|
|
359
|
+
let v = N[X[$]], K = v + V[$], W = (o) => h[o] / 2 + h[$] / 2 + (w[o] === 0 ? b.nodeSep / 2 + E / 2 : w[o] === w[$] ? E : E / 2);
|
|
360
|
+
return [K > v ? e[I[K - 1]] + W(I[K - 1]) : -1 / 0, K + 1 < N[X[$] + 1] ? e[I[K + 1]] - W(I[K + 1]) : 1 / 0];
|
|
361
|
+
}, L = ($, v, K, W, o) => {
|
|
362
|
+
let k = (v[1] !== K[1] ? v[1] < K[1] : Math.abs(v[0] - $) <= Math.abs(K[0] - $)) ? [v[0], K[0]] : [K[0], v[0]];
|
|
363
|
+
return k.find((G) => G >= W && G <= o) ?? Math.max(W, Math.min(o, k[0]));
|
|
364
|
+
}, r = new Uint8Array(R), a = [];
|
|
365
|
+
for (let $ = 1; $ < s; $++) for (let v = N[$]; v < N[$ + 1]; v++) {
|
|
366
|
+
if (!P(I[v]) || r[I[v]]) continue;
|
|
367
|
+
let K = I[v];
|
|
368
|
+
for (; Mt(w[S[T[p[K]]]]); ) K = S[T[p[K]]];
|
|
369
|
+
let W = K, o = -1 / 0, O = 1 / 0;
|
|
370
|
+
a.length = 0;
|
|
371
|
+
for (let k = K; Mt(w[k]); k = u[q[z[k]]]) {
|
|
372
|
+
if (W = k, !P(k)) continue;
|
|
373
|
+
r[k] = 1, a.push(k);
|
|
374
|
+
let [G, t] = c(k);
|
|
375
|
+
G > o && (o = G), t < O && (O = t);
|
|
376
|
+
}
|
|
377
|
+
if (o <= O) {
|
|
378
|
+
let k = L(e[a[0]], C(T[p[K]], 0), C(q[z[W]], 1), o, O);
|
|
379
|
+
for (let G of a) e[G] = k;
|
|
380
|
+
continue;
|
|
381
|
+
}
|
|
382
|
+
for (let k of a) {
|
|
383
|
+
let [G, t] = c(k);
|
|
384
|
+
G > t || (e[k] = L(e[k], C($t(l, F, T[p[k]], 0), 0), C($t(l, F, q[z[k]], 1), 1), G, t));
|
|
385
|
+
}
|
|
386
|
+
}
|
|
387
|
+
}
|
|
388
|
+
function fn(l, A, e, g, b, F, E) {
|
|
389
|
+
let { real: R, W: y2, EF: s, ET: w, EFD: X, ETD: h, succStart: S, succE: u, predStart: D, predE: _, pos: z } = l, q = [], p = [], T = [], N = [], I = [], V = (P, C, c, L, r) => {
|
|
390
|
+
if (F[C][c] < 2) return 0;
|
|
391
|
+
P = $t(l, E, P, C);
|
|
392
|
+
let a = C === 0 ? s[P] : w[P], $ = C === 0 ? e[a] + X[P] : e[a] + h[P];
|
|
393
|
+
if (r && Math.abs($ - e[c]) <= L / 2 + wt) return Math.max(-L / 2, Math.min(L / 2, $ - e[c]));
|
|
394
|
+
let v = $, K = 0;
|
|
395
|
+
a < R && A[a].kind === 0 && (C === 0 ? g : b)[P] !== 0 && F[1 - C][a] >= 2 && (K = Math.max(0, Math.min(A[a].span, y2[a])), K > 0 && (v = e[a]));
|
|
396
|
+
let W = Math.max(e[c] - L / 2, v - K / 2), o = Math.min(e[c] + L / 2, v + K / 2);
|
|
397
|
+
if (W > o + wt) {
|
|
398
|
+
let k = Math.max(0, L / 2 - rn);
|
|
399
|
+
return Math.max(-k, Math.min(k, $ - e[c]));
|
|
400
|
+
}
|
|
401
|
+
let O = (e[c] * K + v * L) / (K + L);
|
|
402
|
+
return Math.max(W, Math.min(o, O)) - e[c];
|
|
403
|
+
};
|
|
404
|
+
for (let P = 0, C = true; C && P < 6; P++) {
|
|
405
|
+
C = false;
|
|
406
|
+
for (let c = 0; c < R; c++) {
|
|
407
|
+
let L = Math.min(A[c].span, y2[c]);
|
|
408
|
+
if (!(L <= 0 || A[c].kind !== 0)) for (let r = 0; r < 2; r++) {
|
|
409
|
+
let a = r === 0 ? b : g, $ = r === 0 ? h : X, v = r === 0 ? s : w, K = r === 0 ? D : S, W = r === 0 ? _ : u;
|
|
410
|
+
if (Xt(l, c, r, L, a, q, p), q.length === 0) continue;
|
|
411
|
+
q.length === 1 && (p[0] = 0), T.length = 0;
|
|
412
|
+
for (let k = K[c]; k < K[c + 1]; k++) T.push(W[k]);
|
|
413
|
+
T.sort((k, G) => z[v[k]] - z[v[G]] || k - G);
|
|
414
|
+
let o = 0, O = -L / 2;
|
|
415
|
+
for (let k = 0; k <= T.length; k++) {
|
|
416
|
+
let G = k < T.length && a[T[k]] === 0;
|
|
417
|
+
if (k < T.length && !G) continue;
|
|
418
|
+
let t = 0;
|
|
419
|
+
for (let m = k - 1; m >= 0 && a[T[m]] !== 0; m--) t++;
|
|
420
|
+
let i = G ? $[T[k]] - Kt : L / 2;
|
|
421
|
+
if (t > 0) {
|
|
422
|
+
N.length = 0, I.length = 0;
|
|
423
|
+
let m = 0;
|
|
424
|
+
for (let d = 0; d < t; d++) {
|
|
425
|
+
d > 0 && (m += p[o + d]), N.push(V(q[o + d], r, c, L, P > 0) - m), I.push(1);
|
|
426
|
+
let H = d > 0 && p[o + d] === 0;
|
|
427
|
+
for (; N.length > 1 && (H || N[N.length - 2] / I[I.length - 2] > N[N.length - 1] / I[I.length - 1]); ) {
|
|
428
|
+
H = false;
|
|
429
|
+
let at = N.pop(), rt = I.pop();
|
|
430
|
+
N[N.length - 1] += at, I[I.length - 1] += rt;
|
|
431
|
+
}
|
|
432
|
+
}
|
|
433
|
+
let U = m, j = 0;
|
|
434
|
+
m = 0;
|
|
435
|
+
for (let d = 0; d < N.length; d++) {
|
|
436
|
+
let H = i - U < O ? (O + i - U) / 2 : Math.max(O, Math.min(i - U, N[d] / I[d]));
|
|
437
|
+
for (let at = 0; at < I[d]; at++, j++) j > 0 && (m += p[o + j]), Math.abs($[q[o + j]] - H - m) > 0.01 && (C = true), $[q[o + j]] = H + m;
|
|
438
|
+
}
|
|
439
|
+
o += t;
|
|
440
|
+
}
|
|
441
|
+
G && (O = $[T[k]] + Kt);
|
|
442
|
+
}
|
|
443
|
+
}
|
|
444
|
+
}
|
|
445
|
+
}
|
|
446
|
+
}
|
|
447
|
+
function un(l, A, e, g) {
|
|
448
|
+
let { n: b, KIND: F, RANK: E, EF: R, ET: y2, EFD: s, ETD: w, layerStart: X, order: h, pos: S } = l, u = (c) => e !== void 0 && F[c] === 1 && e[E[c]] === 1, D = [], _ = [], z = [], q = [];
|
|
449
|
+
for (let c = 0; c < R.length; c++) {
|
|
450
|
+
if (u(R[c])) continue;
|
|
451
|
+
let L = $t(l, e, c, 1);
|
|
452
|
+
D.push(R[c]), _.push(y2[L]), z.push(s[c]), q.push(w[L]);
|
|
453
|
+
}
|
|
454
|
+
let p = (c) => A[_[c]] + q[c] - A[D[c]] - z[c], T = new Int32Array(b), N = [];
|
|
455
|
+
for (let c = 0; c < b; c++) T[c] = c, N.push([c]);
|
|
456
|
+
let I = (c, L) => {
|
|
457
|
+
let r = T[c], a = T[L];
|
|
458
|
+
if (r !== a) {
|
|
459
|
+
N[r].length < N[a].length && ([r, a] = [a, r]);
|
|
460
|
+
for (let $ of N[a]) T[$] = r, N[r].push($);
|
|
461
|
+
N[a] = [];
|
|
462
|
+
}
|
|
463
|
+
}, V = [];
|
|
464
|
+
for (let c = 0; c < D.length; c++) {
|
|
465
|
+
let L = Math.abs(p(c));
|
|
466
|
+
L < 0.01 ? I(D[c], _[c]) : L <= Gt && V.push(c);
|
|
467
|
+
}
|
|
468
|
+
if (V.length === 0) return;
|
|
469
|
+
V.sort((c, L) => Math.abs(p(c)) - Math.abs(p(L)) || c - L);
|
|
470
|
+
let P = (c) => Yt(l, g, c), C = (c, L) => {
|
|
471
|
+
for (let r of N[c]) {
|
|
472
|
+
let a = X[E[r]], $ = X[E[r] + 1], v = a + S[r];
|
|
473
|
+
if (v > a && T[h[v - 1]] !== c && A[r] + L - A[h[v - 1]] < P(r) + P(h[v - 1]) - 0.01 || v + 1 < $ && T[h[v + 1]] !== c && A[h[v + 1]] - A[r] - L < P(r) + P(h[v + 1]) - 0.01) return false;
|
|
474
|
+
}
|
|
475
|
+
return true;
|
|
476
|
+
};
|
|
477
|
+
for (let c of V) {
|
|
478
|
+
let L = p(c);
|
|
479
|
+
if (Math.abs(L) < 0.01) {
|
|
480
|
+
I(D[c], _[c]);
|
|
481
|
+
continue;
|
|
482
|
+
}
|
|
483
|
+
if (Math.abs(L) > Gt || T[D[c]] === T[_[c]]) continue;
|
|
484
|
+
let r = T[D[c]], a = T[_[c]], $ = N[r].length <= N[a].length ? r : a;
|
|
485
|
+
for (let v of [$, $ === r ? a : r]) {
|
|
486
|
+
let K = v === r ? L : -L;
|
|
487
|
+
if (C(v, K)) {
|
|
488
|
+
for (let W of N[v]) A[W] += K;
|
|
489
|
+
I(D[c], _[c]);
|
|
490
|
+
break;
|
|
491
|
+
}
|
|
492
|
+
}
|
|
493
|
+
}
|
|
494
|
+
}
|
|
495
|
+
function mn(l) {
|
|
496
|
+
let { maxRank: A, KIND: e, layerStart: g, order: b } = l, F = new Uint8Array(A + 1), E = false;
|
|
497
|
+
for (let R = 1; R < A; R++) {
|
|
498
|
+
let y2 = g[R + 1] > g[R];
|
|
499
|
+
for (let s = g[R]; y2 && s < g[R + 1]; s++) e[b[s]] !== 1 && (y2 = false);
|
|
500
|
+
y2 && (F[R] = 1, E = true);
|
|
501
|
+
}
|
|
502
|
+
return E ? F : void 0;
|
|
503
|
+
}
|
|
504
|
+
function bn(l, A, e, g, b) {
|
|
505
|
+
let { from: F, to: E, rank: R, track: y2, levels: s, wide: w } = l, X = F.length, h = /* @__PURE__ */ new Map();
|
|
506
|
+
for (let r = 0; r < X; r++) {
|
|
507
|
+
if (y2.push(-1), s.push(0), Math.abs(F[r] - E[r]) < wt) continue;
|
|
508
|
+
let a = h.get(R[r]);
|
|
509
|
+
a ? a.push(r) : h.set(R[r], [r]);
|
|
510
|
+
}
|
|
511
|
+
let S = new Float64Array(X), u = new Float64Array(X);
|
|
512
|
+
for (let r = 0; r < X; r++) S[r] = Math.min(F[r], E[r]), u[r] = Math.max(F[r], E[r]);
|
|
513
|
+
let D = (r, a) => r >= S[a] - wt && r <= u[a] + wt ? 1 : 0, _ = (r, a) => Math.abs(F[r] - F[a]) < wt || Math.abs(E[r] - E[a]) < wt, z = (r, a) => S[r] < u[a] - wt && S[a] < u[r] - wt, q = (r, a) => z(r, a) && !_(r, a), p = (r, a) => z(r, a) || D(E[r], a) + D(F[a], r) + D(E[a], r) + D(F[r], a) > 0, T = (r, a) => D(E[r], a) + D(F[a], r), N = (r) => {
|
|
514
|
+
r.sort((t, i) => u[i] - S[i] - (u[t] - S[t]) || S[t] - S[i] || t - i);
|
|
515
|
+
let a = r.length, $ = [], v = r.map((t, i) => i), K = (t) => {
|
|
516
|
+
for (; v[t] !== t; ) t = v[t] = v[v[t]];
|
|
517
|
+
return t;
|
|
518
|
+
}, W = r;
|
|
519
|
+
if (a <= jt) {
|
|
520
|
+
let t = new Int32Array(a), i = [];
|
|
521
|
+
for (let j = 0; j < a; j++) $.push([]), i.push([]);
|
|
522
|
+
for (let j = 0; j < a; j++) for (let d = j + 1; d < a; d++) {
|
|
523
|
+
let H = r[j], at = r[d];
|
|
524
|
+
if (!p(H, at)) continue;
|
|
525
|
+
v[K(j)] = K(d);
|
|
526
|
+
let rt = T(H, at), ot = T(at, H);
|
|
527
|
+
if (rt === ot) continue;
|
|
528
|
+
let J = rt < ot ? j : d, st = rt < ot ? d : j;
|
|
529
|
+
$[st].push(J), i[J].push(st), t[st]++;
|
|
530
|
+
}
|
|
531
|
+
let m = new Uint8Array(a), U = [];
|
|
532
|
+
for (let j = 0; j < a; j++) {
|
|
533
|
+
let d = -1;
|
|
534
|
+
for (let H = 0; H < a && !(!m[H] && ((d < 0 || t[H] < t[d]) && (d = H), t[H] === 0)); H++) ;
|
|
535
|
+
m[d] = 1, U.push(d);
|
|
536
|
+
for (let H of i[d]) t[H]--;
|
|
537
|
+
}
|
|
538
|
+
W = U.map((j) => r[j]);
|
|
539
|
+
}
|
|
540
|
+
let o = /* @__PURE__ */ new Map();
|
|
541
|
+
r.forEach((t, i) => o.set(t, i));
|
|
542
|
+
let O = [];
|
|
543
|
+
for (let t of W) {
|
|
544
|
+
let i = 0;
|
|
545
|
+
for (let m of $[o.get(t)] ?? []) y2[r[m]] >= i && (i = y2[r[m]] + 1);
|
|
546
|
+
for (; ; i++) {
|
|
547
|
+
let m = O[i] ??= [], U = true;
|
|
548
|
+
for (let j of m) q(t, j) && (U = false);
|
|
549
|
+
if (U) {
|
|
550
|
+
m.push(t);
|
|
551
|
+
break;
|
|
552
|
+
}
|
|
553
|
+
}
|
|
554
|
+
y2[t] = i;
|
|
555
|
+
}
|
|
556
|
+
let k = /* @__PURE__ */ new Map(), G = /* @__PURE__ */ new Map();
|
|
557
|
+
return r.forEach((t, i) => {
|
|
558
|
+
let m = K(i);
|
|
559
|
+
k.set(m, Math.min(k.get(m) ?? 1 / 0, y2[t])), G.set(m, Math.max(G.get(m) ?? -1 / 0, y2[t]));
|
|
560
|
+
}), r.forEach((t, i) => {
|
|
561
|
+
let m = K(i);
|
|
562
|
+
s[t] = G.get(m) - k.get(m) + 1, e && (y2[t] -= k.get(m));
|
|
563
|
+
}), O.length;
|
|
564
|
+
}, I = 16, V = (r, a, $) => {
|
|
565
|
+
let v = Rt(E[r] - F[r], a);
|
|
566
|
+
for (let K = 0; K <= I; K++) {
|
|
567
|
+
let W = K / I, o = 1 - W;
|
|
568
|
+
$[2 * K] = F[r] + (E[r] - F[r]) * W * W * (3 - 2 * W), $[2 * K + 1] = a * (3 * v * W * o * o + 3 * (1 - v) * W * W * o + W * W * W);
|
|
569
|
+
}
|
|
570
|
+
}, P = new Float64Array(2 * I + 2), C = new Float64Array(2 * I + 2), c = (r, a) => {
|
|
571
|
+
let $ = 1 / 0;
|
|
572
|
+
for (let v = 0; v <= I; v++) {
|
|
573
|
+
let K = r[2 * v], W = r[2 * v + 1];
|
|
574
|
+
for (let o = 0; o < I; o++) {
|
|
575
|
+
let O = a[2 * o + 2] - a[2 * o], k = a[2 * o + 3] - a[2 * o + 1], G = Math.max(0, Math.min(1, ((K - a[2 * o]) * O + (W - a[2 * o + 1]) * k) / (O * O + k * k || 1))), t = Math.hypot(K - a[2 * o] - G * O, W - a[2 * o + 1] - G * k);
|
|
576
|
+
t < $ && ($ = t);
|
|
577
|
+
}
|
|
578
|
+
}
|
|
579
|
+
return $;
|
|
580
|
+
}, L = (r, a, $) => {
|
|
581
|
+
let v = Math.max($ / 2, $ - 2 * tn);
|
|
582
|
+
return V(r, v, P), V(a, v, C), Math.min(c(P, C), c(C, P));
|
|
583
|
+
};
|
|
584
|
+
for (let [r, a] of h) {
|
|
585
|
+
if (!e) {
|
|
586
|
+
A[r] = N(a);
|
|
587
|
+
continue;
|
|
588
|
+
}
|
|
589
|
+
if (a.length > jt) continue;
|
|
590
|
+
let $ = a.filter((t) => w[t] === 1);
|
|
591
|
+
N($);
|
|
592
|
+
let v = new Set($.filter((t) => s[t] > 1));
|
|
593
|
+
for (let t = 0; t < a.length; t++) for (let i = t + 1; i < a.length; i++) {
|
|
594
|
+
let m = a[t], U = a[i];
|
|
595
|
+
v.has(m) && v.has(U) || !q(m, U) || F[m] < E[m] != F[U] < E[U] || L(m, U, g[r]) < (w[m] === 1 || w[U] === 1 ? nn : en) && v.add(m).add(U);
|
|
596
|
+
}
|
|
597
|
+
for (let t of $) y2[t] = -1, s[t] = 0;
|
|
598
|
+
if (v.size === 0) continue;
|
|
599
|
+
let K = 0, W = 0, o = [...v];
|
|
600
|
+
for (let t = 0; t < o.length; t++) for (let i = t + 1; i < o.length; i++) {
|
|
601
|
+
let m = o[t], U = o[i];
|
|
602
|
+
z(m, U) && (F[m] < E[m] != F[U] < E[U] ? K++ : _(m, U) || W++);
|
|
603
|
+
}
|
|
604
|
+
if (K > W) {
|
|
605
|
+
for (let t of a) (u[t] - S[t]) * Ht > b[r] && (b[r] = (u[t] - S[t]) * Ht);
|
|
606
|
+
continue;
|
|
607
|
+
}
|
|
608
|
+
let O = (t) => {
|
|
609
|
+
for (let i of v) if (p(t, i)) return true;
|
|
610
|
+
return false;
|
|
611
|
+
}, k = a.filter((t) => v.has(t) || w[t] !== 1 && O(t));
|
|
612
|
+
N(k);
|
|
613
|
+
let G = 0;
|
|
614
|
+
for (let t of k) s[t] > G && (G = s[t]);
|
|
615
|
+
A[r] = G;
|
|
616
|
+
}
|
|
617
|
+
}
|
|
618
|
+
function hn(l, A, e, g, b, F, E) {
|
|
619
|
+
let { maxRank: R, EF: y2, ET: s, EFD: w, ETD: X, succStart: h, succE: S, predStart: u, predE: D, layerStart: _, order: z } = l, q = new Float64Array(A.length), p = new Float64Array(A.length), T = new Float64Array(A.length);
|
|
620
|
+
for (let I = 0; I < g.length; I++) {
|
|
621
|
+
let V = g[I];
|
|
622
|
+
if (V < 0) continue;
|
|
623
|
+
let P = V + b[I] - 1, C = l.RANK[V];
|
|
624
|
+
for (let c = V; c < P; c++) {
|
|
625
|
+
if (!e[C + c - V]) continue;
|
|
626
|
+
let L = c;
|
|
627
|
+
for (; L + 1 < P && e[C + L + 1 - V]; ) L++;
|
|
628
|
+
let r = D[u[c]], a = S[h[L]], $ = A[y2[r]] + w[r], v = A[s[a]] + X[a], K = L - c + 2;
|
|
629
|
+
for (let W = c; W <= L; W++) q[W] = $ + (v - $) * (W - c + 1) / K, p[W] = $, T[W] = v;
|
|
630
|
+
c = L;
|
|
631
|
+
}
|
|
632
|
+
}
|
|
633
|
+
let N = [];
|
|
634
|
+
for (let I = 1; I < R; I++) {
|
|
635
|
+
if (!e[I]) continue;
|
|
636
|
+
let V = _[I], P = _[I + 1], C = Array.from(z.subarray(V, P)).sort((c, L) => p[c] - p[L] || T[c] - T[L] || c - L);
|
|
637
|
+
for (let c = 0; c < C.length; ) {
|
|
638
|
+
N.length = 0;
|
|
639
|
+
let L = c;
|
|
640
|
+
for (; L < C.length && Math.abs(p[C[L]] - p[C[c]]) < 1 && Math.abs(T[C[L]] - T[C[c]]) < 1; L++) N.push(C[L]);
|
|
641
|
+
N.sort((r, a) => l.pos[r] - l.pos[a]);
|
|
642
|
+
for (let r = 0; r < N.length; r++) {
|
|
643
|
+
let a = N[r];
|
|
644
|
+
A[a] = q[a] + (r - (N.length - 1) / 2) * F, (N.length === 1 || F === 0) && (E[a] = 1);
|
|
645
|
+
}
|
|
646
|
+
c = L;
|
|
647
|
+
}
|
|
648
|
+
}
|
|
649
|
+
}
|
|
650
|
+
function dn(l, A, e, g, b, F) {
|
|
651
|
+
let { maxRank: E, W: R, KIND: y2, RANK: s, EF: w, ET: X, EFD: h, ETD: S, succStart: u, succE: D, predStart: _, predE: z, layerStart: q, order: p } = l, T = new Uint8Array(E + 1), N = false;
|
|
652
|
+
for (let I = 1; I < E; I++) {
|
|
653
|
+
let V = false, P = false;
|
|
654
|
+
for (let C = q[I]; C < q[I + 1]; C++) {
|
|
655
|
+
let c = y2[p[C]];
|
|
656
|
+
c === 2 ? V = true : c !== 1 && (P = true);
|
|
657
|
+
}
|
|
658
|
+
V && !P && (T[I] = 1, N = true);
|
|
659
|
+
}
|
|
660
|
+
if (N) for (let I = 0; I < e.length; I++) {
|
|
661
|
+
let V = e[I];
|
|
662
|
+
if (!(V < 0)) for (let P = V, C = V + g[I] - 1; P < C; P++) {
|
|
663
|
+
if (y2[P] !== 1 || !T[s[P]]) continue;
|
|
664
|
+
let c = P, L = P;
|
|
665
|
+
for (; c > V && F[c - 1]; ) c--;
|
|
666
|
+
for (; L + 1 < C && F[L + 1]; ) L++;
|
|
667
|
+
let r = z[_[c]], a = D[u[L]], $ = A[w[r]] + h[r], v = A[X[a]] + S[a], K = Math.min($, v) - b, W = Math.max($, v) + b, o = true, O = s[P];
|
|
668
|
+
for (let G = q[O]; o && G < q[O + 1]; G++) {
|
|
669
|
+
let t = p[G];
|
|
670
|
+
y2[t] === 2 && A[t] + R[t] / 2 > K && A[t] - R[t] / 2 < W && (o = false);
|
|
671
|
+
}
|
|
672
|
+
if (!o) continue;
|
|
673
|
+
F[P] = 1;
|
|
674
|
+
let k = L - c + 2;
|
|
675
|
+
for (let G = c; G <= L; G++) A[G] = $ + (v - $) * (G - c + 1) / k;
|
|
676
|
+
}
|
|
677
|
+
}
|
|
678
|
+
}
|
|
679
|
+
function yn(l, A) {
|
|
680
|
+
let { n: e, real: g, maxRank: b, W: F, EF: E, ET: R, EFD: y2, ETD: s, succStart: w, succE: X, predStart: h, predE: S, layerStart: u, order: D, pos: _, offsets: z } = l, q = 0;
|
|
681
|
+
for (let t = 0; t <= b; t++) q = Math.max(q, u[t + 1] - u[t]);
|
|
682
|
+
let p = z ? new Int32Array(E.length) : void 0, T = 1;
|
|
683
|
+
for (; T < (p ? q + E.length : q); ) T <<= 1;
|
|
684
|
+
let N = new Int32Array(2 * T), I = new Int32Array(E.length), V = () => {
|
|
685
|
+
let t = 0;
|
|
686
|
+
for (let i = 0; i < b; i++) {
|
|
687
|
+
let m = u[i + 2] - u[i + 1];
|
|
688
|
+
if (p) {
|
|
689
|
+
let d = 0;
|
|
690
|
+
for (let H = u[i + 1]; H < u[i + 2]; H++) {
|
|
691
|
+
let at = h[D[H]], rt = h[D[H] + 1], ot = false;
|
|
692
|
+
for (let J = at + 1; J < rt; J++) s[S[J]] !== s[S[at]] && (ot = true);
|
|
693
|
+
if (ot) {
|
|
694
|
+
let J = Array.from(S.subarray(at, rt));
|
|
695
|
+
J.sort((st, x2) => s[st] - s[x2]);
|
|
696
|
+
for (let st = 0; st < J.length; st++) st > 0 && s[J[st]] !== s[J[st - 1]] && d++, p[J[st]] = d;
|
|
697
|
+
} else for (let J = at; J < rt; J++) p[S[J]] = d;
|
|
698
|
+
d++;
|
|
699
|
+
}
|
|
700
|
+
m = d;
|
|
701
|
+
}
|
|
702
|
+
if (m < 2) continue;
|
|
703
|
+
let U = 0;
|
|
704
|
+
for (let d = u[i]; d < u[i + 1]; d++) {
|
|
705
|
+
let H = D[d], at = w[H], rt = w[H + 1], ot = U;
|
|
706
|
+
for (let x2 = at; x2 < rt; x2++) I[U++] = p ? p[X[x2]] : _[R[X[x2]]];
|
|
707
|
+
let J = U - ot;
|
|
708
|
+
if (J < 2) continue;
|
|
709
|
+
let st = false;
|
|
710
|
+
if (p) for (let x2 = at + 1; x2 < rt; x2++) y2[X[x2]] !== y2[X[at]] && (st = true);
|
|
711
|
+
if (p && st) {
|
|
712
|
+
let x2 = Array.from(X.subarray(at, rt));
|
|
713
|
+
x2.sort((Z, tt) => y2[Z] - y2[tt] || p[Z] - p[tt]);
|
|
714
|
+
for (let Z = 0; Z < J; Z++) I[ot + Z] = p[x2[Z]];
|
|
715
|
+
} else if (J <= 12) for (let x2 = ot + 1; x2 < U; x2++) {
|
|
716
|
+
let Z = I[x2], tt = x2 - 1;
|
|
717
|
+
for (; tt >= ot && I[tt] > Z; ) I[tt + 1] = I[tt], tt--;
|
|
718
|
+
I[tt + 1] = Z;
|
|
719
|
+
}
|
|
720
|
+
else I.subarray(ot, U).sort();
|
|
721
|
+
}
|
|
722
|
+
if (U < 2) continue;
|
|
723
|
+
let j = 1;
|
|
724
|
+
for (; j < m; ) j <<= 1;
|
|
725
|
+
N.fill(0, 0, 2 * j);
|
|
726
|
+
for (let d = 0; d < U; d++) {
|
|
727
|
+
let H = I[d] + j;
|
|
728
|
+
for (N[H]++; H > 1; ) (H & 1) === 0 && (t += N[H + 1]), H >>= 1, N[H]++;
|
|
729
|
+
}
|
|
730
|
+
}
|
|
731
|
+
return t;
|
|
732
|
+
}, P = V();
|
|
733
|
+
if (P === 0) return;
|
|
734
|
+
let C = D.slice(), c = new Float64Array(e), L = new Int32Array(q), r = (t, i) => c[t] - c[i] || _[t] - _[i], a = (t, i) => c[t] - c[i] || _[i] - _[t], $ = (t, i) => {
|
|
735
|
+
let m = t ? h : w, U = t ? S : X, j = t ? E : R, d = t ? y2 : s;
|
|
736
|
+
for (let H = 1; H <= b; H++) {
|
|
737
|
+
let at = t ? H : b - H, rt = u[at], ot = u[at + 1], J = 0;
|
|
738
|
+
for (let x2 = rt; x2 < ot; x2++) {
|
|
739
|
+
let Z = D[x2], tt = Z < g ? A[Z].pin : 0;
|
|
740
|
+
if (tt !== 0) {
|
|
741
|
+
c[Z] = tt * 1e9, L[J++] = Z;
|
|
742
|
+
continue;
|
|
743
|
+
}
|
|
744
|
+
let ct = m[Z], lt = m[Z + 1];
|
|
745
|
+
if (ct === lt) {
|
|
746
|
+
c[Z] = -1;
|
|
747
|
+
continue;
|
|
748
|
+
}
|
|
749
|
+
let ut = 0;
|
|
750
|
+
for (let bt = ct; bt < lt; bt++) {
|
|
751
|
+
let dt = j[U[bt]];
|
|
752
|
+
ut += _[dt], z && F[dt] > 0 && (ut += d[U[bt]] / F[dt]);
|
|
753
|
+
}
|
|
754
|
+
c[Z] = ut / (lt - ct), L[J++] = Z;
|
|
755
|
+
}
|
|
756
|
+
if (J < 2) continue;
|
|
757
|
+
L.subarray(0, J).sort(i ? a : r);
|
|
758
|
+
let st = 0;
|
|
759
|
+
for (let x2 = rt; x2 < ot; x2++) c[D[x2]] !== -1 && (D[x2] = L[st++]);
|
|
760
|
+
for (let x2 = rt; x2 < ot; x2++) _[D[x2]] = x2 - rt;
|
|
761
|
+
}
|
|
762
|
+
}, v = () => {
|
|
763
|
+
let t = 0;
|
|
764
|
+
for (let i = 0; i <= b; i++) for (let m = u[i]; m < u[i + 1]; m++) if (!(D[m] >= g)) for (let U = m + 1; U < u[i + 1]; U++) D[U] < D[m] && t++;
|
|
765
|
+
return t;
|
|
766
|
+
}, K = () => {
|
|
767
|
+
for (let t = 0; t <= b; t++) for (let i = u[t]; i < u[t + 1]; i++) _[D[i]] = i - u[t];
|
|
768
|
+
}, W = D.slice(), o = P, O = e <= 600, k = C, G = 1 / 0;
|
|
769
|
+
for (let t = 0; t < (O ? 2 : 1); t++) {
|
|
770
|
+
t > 0 && (D.set(W), K());
|
|
771
|
+
let i = o, m = W.slice();
|
|
772
|
+
for (let j = 0, d = 0; d < 4 && j < Bt; j++, d++) {
|
|
773
|
+
$((j + t) % 2 === 0, j % 4 >= 2);
|
|
774
|
+
let H = V();
|
|
775
|
+
if (H < i && (i = H, m.set(D), d = 0, H === 0)) break;
|
|
776
|
+
}
|
|
777
|
+
D.set(m);
|
|
778
|
+
let U = O ? v() : 0;
|
|
779
|
+
(t === 0 || i < P || i === P && U < G) && (P = i, k = m, G = U);
|
|
780
|
+
}
|
|
781
|
+
if (D.set(k), K(), C.set(k), !!O) {
|
|
782
|
+
for (let t = 0; t < g; t++) if (A[t].pin !== 0) return;
|
|
783
|
+
if (G !== 0) {
|
|
784
|
+
for (let t = 0; t <= b; t++) D.subarray(u[t], u[t + 1]).reverse();
|
|
785
|
+
K(), (V() > P || v() >= G) && D.set(C);
|
|
786
|
+
}
|
|
787
|
+
}
|
|
788
|
+
}
|
|
789
|
+
function Yt(l, A, e) {
|
|
790
|
+
return l.W[e] / 2 + (l.KIND[e] === 0 ? A.nodeSep : A.edgeSep) / 2;
|
|
791
|
+
}
|
|
792
|
+
function pn(l, A) {
|
|
793
|
+
let { n: e, maxRank: g, W: b, KIND: F, EF: E, ET: R, EFD: y2, ETD: s, succStart: w, succE: X, predStart: h, predE: S, layerStart: u, order: D, pos: _ } = l, z = E.length, q = new Float64Array(e);
|
|
794
|
+
for (let t = 0; t < e; t++) q[t] = Yt(l, A, t);
|
|
795
|
+
let p = new Int32Array(z);
|
|
796
|
+
for (let t = 0; t < z; t++) p[t] = _[R[t]];
|
|
797
|
+
for (let t = 0; t < e; t++) w[t + 1] - w[t] > 1 && Ct(X, w[t], w[t + 1], p);
|
|
798
|
+
for (let t = 0; t < z; t++) p[t] = _[E[t]];
|
|
799
|
+
for (let t = 0; t < e; t++) h[t + 1] - h[t] > 1 && Ct(S, h[t], h[t + 1], p);
|
|
800
|
+
let T = new Uint8Array(z);
|
|
801
|
+
for (let t = 1; t <= g; t++) {
|
|
802
|
+
let i = u[t] - u[t - 1], m = u[t], U = u[t + 1], j = 0, d = m;
|
|
803
|
+
for (let H = m; H < U; H++) {
|
|
804
|
+
let at = D[H], rt = -1;
|
|
805
|
+
if (Mt(F[at])) {
|
|
806
|
+
let J = E[S[h[at]]];
|
|
807
|
+
Mt(F[J]) && (rt = J);
|
|
808
|
+
}
|
|
809
|
+
let ot = rt >= 0 ? _[rt] : i;
|
|
810
|
+
if (rt >= 0 || H === U - 1) {
|
|
811
|
+
for (let J = d; J <= H; J++) {
|
|
812
|
+
let st = D[J], x2 = Mt(F[st]);
|
|
813
|
+
for (let Z = h[st]; Z < h[st + 1]; Z++) {
|
|
814
|
+
let tt = S[Z], ct = _[E[tt]];
|
|
815
|
+
(ct < j || ot < ct) && !(x2 && Mt(F[E[tt]])) && (T[tt] = 1);
|
|
816
|
+
}
|
|
817
|
+
}
|
|
818
|
+
d = H + 1, j = ot;
|
|
819
|
+
}
|
|
820
|
+
}
|
|
821
|
+
}
|
|
822
|
+
let N = [], I = new Int32Array(e), V = new Int32Array(e), P = new Float64Array(e), C = new Int32Array(e), c = new Int32Array(e), L = new Float64Array(e), r = new Int32Array(e), a = new Int32Array(e + 1), $ = new Int32Array(e), v = new Int32Array(e), K = new Int32Array(e);
|
|
823
|
+
for (let t = 0; t < 4; t++) {
|
|
824
|
+
let i = t < 2, m = (t & 1) === 1, U = i ? h : w, j = i ? S : X, d = i ? E : R, H = i ? s : y2, at = i ? y2 : s;
|
|
825
|
+
for (let x2 = 0; x2 < e; x2++) I[x2] = x2, V[x2] = x2, P[x2] = 0;
|
|
826
|
+
for (let x2 = 0; x2 <= g; x2++) {
|
|
827
|
+
let Z = i ? x2 : g - x2, tt = u[Z], ct = u[Z + 1], lt = i ? Z - 1 : Z + 1, ut = lt >= 0 && lt <= g ? u[lt + 1] - u[lt] - 1 : 0, bt = -1;
|
|
828
|
+
for (let dt = m ? ct - 1 : tt; m ? dt >= tt : dt < ct; m ? dt-- : dt++) {
|
|
829
|
+
let yt = D[dt], gt = U[yt], vt = U[yt + 1] - gt;
|
|
830
|
+
if (vt === 0) continue;
|
|
831
|
+
let Ft = gt + (vt - 1 >> 1), mt = gt + (vt >> 1);
|
|
832
|
+
for (let Et = 0; Et < 2 && !(Et === 1 && Ft === mt); Et++) {
|
|
833
|
+
let It = j[Et === 0 !== m ? Ft : mt], At = d[It], n = m ? ut - _[At] : _[At];
|
|
834
|
+
V[yt] === yt && bt < n && T[It] === 0 && (V[At] = yt, V[yt] = I[yt] = I[At], P[yt] = P[At] + at[It] - H[It], bt = n);
|
|
835
|
+
}
|
|
836
|
+
}
|
|
837
|
+
}
|
|
838
|
+
let rt = 0;
|
|
839
|
+
r.fill(0), a.fill(0);
|
|
840
|
+
for (let x2 = 0; x2 <= g; x2++) {
|
|
841
|
+
let Z = u[x2], tt = u[x2 + 1];
|
|
842
|
+
for (let ct = Z + 1; ct < tt; ct++) {
|
|
843
|
+
let lt = m ? D[ct] : D[ct - 1], ut = m ? D[ct - 1] : D[ct], bt = q[lt] + q[ut];
|
|
844
|
+
C[rt] = I[lt], c[rt] = I[ut], L[rt] = m ? bt - P[lt] + P[ut] : bt + P[lt] - P[ut], r[I[ut]]++, a[I[lt] + 1]++, rt++;
|
|
845
|
+
}
|
|
846
|
+
}
|
|
847
|
+
for (let x2 = 0; x2 < e; x2++) a[x2 + 1] += a[x2];
|
|
848
|
+
v.set(a.subarray(0, e));
|
|
849
|
+
for (let x2 = 0; x2 < rt; x2++) $[v[C[x2]]++] = x2;
|
|
850
|
+
let ot = new Float64Array(e), J = 0;
|
|
851
|
+
for (let x2 = 0; x2 < e; x2++) I[x2] === x2 && r[x2] === 0 && (K[J++] = x2);
|
|
852
|
+
for (let x2 = 0; x2 < J; x2++) {
|
|
853
|
+
let Z = K[x2];
|
|
854
|
+
for (let tt = a[Z]; tt < a[Z + 1]; tt++) {
|
|
855
|
+
let ct = $[tt], lt = c[ct];
|
|
856
|
+
ot[Z] + L[ct] > ot[lt] && (ot[lt] = ot[Z] + L[ct]), --r[lt] === 0 && (K[J++] = lt);
|
|
857
|
+
}
|
|
858
|
+
}
|
|
859
|
+
for (let x2 = J - 1; x2 >= 0; x2--) {
|
|
860
|
+
let Z = K[x2], tt = 1 / 0;
|
|
861
|
+
for (let ct = a[Z]; ct < a[Z + 1]; ct++) {
|
|
862
|
+
let lt = $[ct], ut = ot[c[lt]] - L[lt];
|
|
863
|
+
ut < tt && (tt = ut);
|
|
864
|
+
}
|
|
865
|
+
tt !== 1 / 0 && tt > ot[Z] && (ot[Z] = tt);
|
|
866
|
+
}
|
|
867
|
+
let st = new Float64Array(e);
|
|
868
|
+
for (let x2 = 0; x2 < e; x2++) st[x2] = (m ? -ot[I[x2]] : ot[I[x2]]) + P[x2];
|
|
869
|
+
N.push(st);
|
|
870
|
+
}
|
|
871
|
+
let W = 0, o = 1 / 0, O = [], k = [];
|
|
872
|
+
for (let t = 0; t < 4; t++) {
|
|
873
|
+
let i = 1 / 0, m = -1 / 0, U = N[t];
|
|
874
|
+
for (let j = 0; j < e; j++) {
|
|
875
|
+
let d = b[j] / 2;
|
|
876
|
+
U[j] - d < i && (i = U[j] - d), U[j] + d > m && (m = U[j] + d);
|
|
877
|
+
}
|
|
878
|
+
O.push(i), k.push(m), m - i < o && (o = m - i, W = t);
|
|
879
|
+
}
|
|
880
|
+
for (let t = 0; t < 4; t++) {
|
|
881
|
+
let i = (t & 1) === 0 ? O[W] - O[t] : k[W] - k[t];
|
|
882
|
+
if (i !== 0) {
|
|
883
|
+
let m = N[t];
|
|
884
|
+
for (let U = 0; U < e; U++) m[U] += i;
|
|
885
|
+
}
|
|
886
|
+
}
|
|
887
|
+
let G = new Float64Array(e);
|
|
888
|
+
for (let t = 0; t < e; t++) {
|
|
889
|
+
let i = N[0][t], m = N[1][t], U = N[2][t], j = N[3][t], d;
|
|
890
|
+
i > m && (d = i, i = m, m = d), U > j && (d = U, U = j, j = d), i > U && (d = i, i = U, U = d), m > j && (d = m, m = j, j = d), m > U && (d = m, m = U, U = d), G[t] = (m + U) / 2;
|
|
891
|
+
}
|
|
892
|
+
return G;
|
|
893
|
+
}
|
|
894
|
+
var St = 8, An = 12, Nt = 0.62, Lt = 6;
|
|
895
|
+
function vn() {
|
|
896
|
+
let l = /* @__PURE__ */ new Map();
|
|
897
|
+
return { add(A, e, g) {
|
|
898
|
+
let b = wn(g);
|
|
899
|
+
e >= 0 && b > 0 && b + Lt > (l.get(A * 4 + e) ?? 0) && l.set(A * 4 + e, b + Lt);
|
|
900
|
+
}, of: (A, e) => e >= 0 ? l.get(A * 4 + e) ?? 0 : 0 };
|
|
901
|
+
}
|
|
902
|
+
function Fn(l, A, e, g, b = e > 0 ? e + Lt : 0, F = g > 0 ? g + Lt : 0) {
|
|
903
|
+
let E = A === "linear", R = A === "step" || A === "stepBefore" || A === "stepAfter", y2 = [], s = [], w = [], X = (o, O, k, G) => Math.abs(o - k) < 0.01 && Math.abs(O - G) < 0.01;
|
|
904
|
+
for (let o = 0; o < l.length; o += 3) {
|
|
905
|
+
let O = l[o], k = l[o + 1], G = l[o + 2], t = y2.length - 1;
|
|
906
|
+
if (R && t >= 0 && Math.abs(O - y2[t]) >= 0.01 && Math.abs(k - s[t]) >= 0.01) {
|
|
907
|
+
let i = y2[t], m = s[t], U = A === "stepBefore" ? m : A === "stepAfter" ? k : (m + k) / 2, j = A === "stepBefore" ? i : A === "stepAfter" ? O : (i + O) / 2, d = G === 0 ? [i, U, O, U] : [j, m, j, k];
|
|
908
|
+
for (let H = 0; H < 4; H += 2) X(d[H], d[H + 1], i, m) || X(d[H], d[H + 1], O, k) || (y2.push(d[H]), s.push(d[H + 1]), w.push(G));
|
|
909
|
+
}
|
|
910
|
+
y2.push(O), s.push(k), w.push(G);
|
|
911
|
+
}
|
|
912
|
+
let h = y2.length - 1, S = (o) => Math.abs(y2[o] - y2[o - 1]) < 0.01 || Math.abs(s[o] - s[o - 1]) < 0.01, u = (o) => E || S(o), D = (o, O, k) => {
|
|
913
|
+
if (!u(Math.max(o, O))) return k === 0 ? [0, Math.sign(s[O] - s[o]) || 1] : [Math.sign(y2[O] - y2[o]) || 1, 0];
|
|
914
|
+
let G = y2[O] - y2[o], t = s[O] - s[o], i = Math.hypot(G, t) || 1;
|
|
915
|
+
return [G / i, t / i];
|
|
916
|
+
}, [_, z] = D(0, 1, w[1]), [q, p] = D(h - 1, h, w[h]), T = y2[0], N = s[0], I = y2[h], V = s[h];
|
|
917
|
+
y2[0] += _ * e, s[0] += z * e, y2[h] -= q * g, s[h] -= p * g;
|
|
918
|
+
let P = (o) => Math.abs(y2[o] - y2[o - 1]) + Math.abs(s[o] - s[o - 1]), C = (o) => !E && o > 0 && o < h && S(o) && S(o + 1) && P(o) >= 0.01 && P(o + 1) >= 0.01 && Math.abs(y2[o] - y2[o - 1]) < 0.01 != Math.abs(y2[o + 1] - y2[o]) < 0.01, c = (o, O, k) => Math.abs(y2[o] - y2[o - 1]) * Math.abs(O) + Math.abs(s[o] - s[o - 1]) * Math.abs(k), L = (o, O, k) => {
|
|
919
|
+
let G = Math.min(Math.max(0, o - Lt - O), k / 4);
|
|
920
|
+
return G + Math.min(o - O - G, (k - G) / 4);
|
|
921
|
+
}, r = F > g && (!u(h) || C(h - 1)) ? L(F, g, c(h, q, p)) : 0, a = b > e && (!u(1) || C(1)) ? L(b, e, c(1, _, z)) : 0;
|
|
922
|
+
r >= 1 && (y2.splice(h, 0, y2[h] - q * r), s.splice(h, 0, s[h] - p * r), w.splice(h, 0, w[h]), h++), a >= 1 && (y2.splice(1, 0, y2[0] + _ * a), s.splice(1, 0, s[0] + z * a), w.splice(1, 0, w[1]), h++);
|
|
923
|
+
let $ = `M${x(y2[0])},${x(s[0])}`, v = y2[0], K = s[0], W = (o, O) => {
|
|
924
|
+
X(o, O, v, K) || ($ += `L${x(o)},${x(O)}`, v = o, K = O);
|
|
925
|
+
};
|
|
926
|
+
for (let o = 1; o <= h; o++) {
|
|
927
|
+
let O = y2[o], k = s[o];
|
|
928
|
+
if (!u(o)) {
|
|
929
|
+
let d = w[o] === 0, H = d ? k - K : O - v, at = Math.abs(H) * Rt(d ? O - v : k - K, H), rt = d ? 0 : Math.sign(H) * at, ot = d ? Math.sign(H) * at : 0;
|
|
930
|
+
$ += `C${x(v + rt)},${x(K + ot)} ${x(O - rt)},${x(k - ot)} ${x(O)},${x(k)}`, v = O, K = k;
|
|
931
|
+
continue;
|
|
932
|
+
}
|
|
933
|
+
if (!C(o)) {
|
|
934
|
+
if (o < h && S(o) && S(o + 1) && (O - y2[o - 1]) * (y2[o + 1] - O) + (k - s[o - 1]) * (s[o + 1] - k) > 0) continue;
|
|
935
|
+
W(O, k);
|
|
936
|
+
continue;
|
|
937
|
+
}
|
|
938
|
+
let G = C(o - 1) ? P(o) / 2 : P(o), t = C(o + 1) ? P(o + 1) / 2 : P(o + 1);
|
|
939
|
+
R && (G = t = Math.min(An, G, t));
|
|
940
|
+
let [i, m] = D(o - 1, o, w[o]), [U, j] = D(o, o + 1, w[o + 1]);
|
|
941
|
+
W(O - i * G, k - m * G), v = O + U * t, K = k + j * t, R ? $ += `Q${x(O)},${x(k)} ${x(v)},${x(K)}` : $ += `C${x(O - i * G * (1 - Nt))},${x(k - m * G * (1 - Nt))} ${x(O + U * t * (1 - Nt))},${x(k + j * t * (1 - Nt))} ${x(v)},${x(K)}`;
|
|
942
|
+
}
|
|
943
|
+
return { d: $, sx: T, sy: N, sdx: -_, sdy: -z, ex: I, ey: V, edx: q, edy: p };
|
|
944
|
+
}
|
|
945
|
+
function wn(l) {
|
|
946
|
+
return l === "arrow_point" ? St - 1 : l === "arrow_circle" ? St : l === "arrow_cross" ? 4 : 0;
|
|
947
|
+
}
|
|
948
|
+
function Dn(l, A, e, g, b, F) {
|
|
949
|
+
let E = -b, R = g;
|
|
950
|
+
if (l === "arrow_point") {
|
|
951
|
+
let y2 = A - g * St, s = e - b * St, w = St * 0.42;
|
|
952
|
+
return `<path class="pele-marker" d="M${x(A)},${x(e)}L${x(y2 + E * w)},${x(s + R * w)}L${x(y2 - E * w)},${x(s - R * w)}Z" fill="${F}" stroke="none"/>`;
|
|
953
|
+
}
|
|
954
|
+
if (l === "arrow_circle") return `<circle class="pele-marker" cx="${x(A - g * 4)}" cy="${x(e - b * 4)}" r="3.5" fill="${F}" stroke="none"/>`;
|
|
955
|
+
if (l === "arrow_cross") {
|
|
956
|
+
let y2 = A - g * 4, s = e - b * 4, w = 3.5, X = (g + E) * w, h = (b + R) * w, S = (g - E) * w, u = (b - R) * w;
|
|
957
|
+
return `<path class="pele-marker" d="M${x(y2 - X)},${x(s - h)}L${x(y2 + X)},${x(s + h)}M${x(y2 - S)},${x(s - u)}L${x(y2 + S)},${x(s + u)}"/>`;
|
|
958
|
+
}
|
|
959
|
+
return "";
|
|
960
|
+
}
|
|
961
|
+
function Sn(l, A, e, g, b, F) {
|
|
962
|
+
let E = A.width + 8, R = A.height;
|
|
963
|
+
return `<g class="pele-edge-label" data-id="${y(l)}"><rect x="${x(e - E / 2)}" y="${x(g - R / 2)}" width="${x(E)}" height="${x(R)}" rx="3" fill="var(--_bg)"/>` + ft(A, e, g, b, F) + "</g>";
|
|
964
|
+
}
|
|
965
|
+
function Ln(l, A, e, g, b, F, E, R) {
|
|
966
|
+
let y2 = (b ? A : e) / 2, s = Math.min(y2 - 4, 8 + g * 6), w = F + g * 8, X = Math.hypot(w, s) || 1, h = (D, _) => b ? `${x(l.x + _)},${x(l.y + e / 2 + D)}` : `${x(l.x + A / 2 + D)},${x(l.y + _)}`, S = w / X * E, u = s / X * E;
|
|
967
|
+
return b ? (R.labelX = l.x, R.labelY = l.y + e / 2 + w + 4 + R.labelH / 2) : (R.labelX = l.x + A / 2 + w + 4 + R.labelW / 2, R.labelY = l.y), { d: `M${h(0, -s)}C${h(w, -s * 2)} ${h(w, s * 2)} ${h(S, s + u)}`, sx: b ? l.x - s : l.x + A / 2, sy: b ? l.y + e / 2 : l.y - s, sdx: b ? 0 : -1, sdy: b ? -1 : 0, ex: b ? l.x + s : l.x + A / 2, ey: b ? l.y + e / 2 : l.y + s, edx: b ? -s / X : -w / X, edy: b ? -w / X : -s / X };
|
|
968
|
+
}
|
|
969
|
+
export {
|
|
970
|
+
Dn as D,
|
|
971
|
+
En as E,
|
|
972
|
+
Fn as F,
|
|
973
|
+
In as I,
|
|
974
|
+
Ln as L,
|
|
975
|
+
Sn as S,
|
|
976
|
+
St as a,
|
|
977
|
+
gn as g,
|
|
978
|
+
on as o,
|
|
979
|
+
sn as s,
|
|
980
|
+
vn as v,
|
|
981
|
+
wn as w
|
|
982
|
+
};
|