@cardenelabs/dragon 0.75.0 → 0.76.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.
Files changed (143) hide show
  1. package/README.ja.md +2 -2
  2. package/README.md +2 -2
  3. package/dist/cdn/dragon-main.js +1 -1
  4. package/dist/cdn/dragon.js +1 -1
  5. package/dist/cdn/{framed-AKGEB6S4.js → framed-EY7MCXO5.js} +10 -11
  6. package/dist/cdn/framed-EY7MCXO5.js.map +1 -0
  7. package/dist/cli.cjs +1 -1
  8. package/dist/cli.js +1 -1
  9. package/dist/embed.cjs +16 -16
  10. package/dist/embed.cjs.map +1 -1
  11. package/dist/embed.js +16 -16
  12. package/dist/embed.js.map +1 -1
  13. package/dist/frame.cjs +16 -16
  14. package/dist/frame.cjs.map +1 -1
  15. package/dist/frame.js +16 -16
  16. package/dist/frame.js.map +1 -1
  17. package/dist/header.cjs +16 -16
  18. package/dist/header.cjs.map +1 -1
  19. package/dist/header.d.cts +4 -1
  20. package/dist/header.d.ts +4 -1
  21. package/dist/header.js +16 -16
  22. package/dist/header.js.map +1 -1
  23. package/dist/light/chart-X3JZXB7X.cjs.map +1 -1
  24. package/dist/light/checkout-ID7EXZKS.cjs.map +1 -1
  25. package/dist/light/chunk-2UIJLZQS.cjs.map +1 -1
  26. package/dist/light/chunk-32F5LGYM.cjs.map +1 -1
  27. package/dist/light/chunk-37YJVHKU.cjs.map +1 -1
  28. package/dist/light/chunk-3K7HXFGU.cjs.map +1 -1
  29. package/dist/light/chunk-3N6XGWY3.cjs.map +1 -1
  30. package/dist/light/chunk-3WNASQ4F.cjs.map +1 -1
  31. package/dist/light/chunk-5TGDO7AR.cjs.map +1 -1
  32. package/dist/light/chunk-5YBLDLYL.cjs.map +1 -1
  33. package/dist/light/chunk-BQ224M6S.cjs.map +1 -1
  34. package/dist/light/chunk-BZJAJNOY.cjs.map +1 -1
  35. package/dist/light/chunk-CHBS42VR.cjs.map +1 -1
  36. package/dist/light/chunk-CSY2M2ZF.cjs.map +1 -1
  37. package/dist/light/chunk-CY365UJL.cjs.map +1 -1
  38. package/dist/light/chunk-D6AWLCS4.cjs.map +1 -1
  39. package/dist/light/chunk-EFPTGCUT.cjs.map +1 -1
  40. package/dist/light/chunk-EGEJ2PZU.cjs.map +1 -1
  41. package/dist/light/chunk-FQ6EHQI4.cjs.map +1 -1
  42. package/dist/light/chunk-FXUL4JF7.cjs.map +1 -1
  43. package/dist/light/chunk-H64H2OY3.cjs.map +1 -1
  44. package/dist/light/chunk-H7GHG4MU.cjs.map +1 -1
  45. package/dist/light/chunk-HBMD7U4E.cjs.map +1 -1
  46. package/dist/light/chunk-IV4QO6S3.cjs.map +1 -1
  47. package/dist/light/chunk-J7WOLGM5.cjs.map +1 -1
  48. package/dist/light/chunk-JYWZ6CXU.cjs.map +1 -1
  49. package/dist/light/chunk-LFGJVSUY.cjs.map +1 -1
  50. package/dist/light/chunk-LFVA44T7.cjs.map +1 -1
  51. package/dist/light/chunk-M3OG3EO4.cjs.map +1 -1
  52. package/dist/light/chunk-MVELFHAA.cjs.map +1 -1
  53. package/dist/light/chunk-MVFMWHCG.cjs.map +1 -1
  54. package/dist/light/chunk-OBDQYQW7.cjs.map +1 -1
  55. package/dist/light/chunk-OLBWXQAN.cjs.map +1 -1
  56. package/dist/light/chunk-P5OAASO6.cjs.map +1 -1
  57. package/dist/light/chunk-QWPVCX5A.cjs.map +1 -1
  58. package/dist/light/chunk-S42M54IW.cjs.map +1 -1
  59. package/dist/light/chunk-TMHQNQRC.cjs.map +1 -1
  60. package/dist/light/chunk-TMXS76EN.cjs.map +1 -1
  61. package/dist/light/chunk-TZMBIKGJ.cjs.map +1 -1
  62. package/dist/light/chunk-UHJDQGMN.cjs.map +1 -1
  63. package/dist/light/chunk-UN6WQLU7.cjs.map +1 -1
  64. package/dist/light/chunk-UZNIABQO.cjs.map +1 -1
  65. package/dist/light/chunk-WGR7LOJZ.cjs.map +1 -1
  66. package/dist/light/chunk-YALPCSWW.cjs.map +1 -1
  67. package/dist/light/chunk-YJXF2J5R.cjs.map +1 -1
  68. package/dist/light/chunk-ZXX3TUJF.cjs.map +1 -1
  69. package/dist/light/cycle-2XACC564.cjs.map +1 -1
  70. package/dist/light/er-NNOIUAMN.cjs.map +1 -1
  71. package/dist/light/flow-77MQIZTE.cjs.map +1 -1
  72. package/dist/light/git-I2U4X7BH.cjs.map +1 -1
  73. package/dist/light/index.cjs.map +1 -1
  74. package/dist/light/lineup-UIGE4OTC.cjs.map +1 -1
  75. package/dist/light/matrix-G5LWGZLA.cjs.map +1 -1
  76. package/dist/light/mind-NZ2UZGRU.cjs.map +1 -1
  77. package/dist/light/pen-YKT3AQG2.cjs.map +1 -1
  78. package/dist/light/pipe-EZX6P3SM.cjs.map +1 -1
  79. package/dist/light/read-2CDK5L23.cjs.map +1 -1
  80. package/dist/light/read-2F2544RV.cjs.map +1 -1
  81. package/dist/light/read-2YW4EIPG.cjs.map +1 -1
  82. package/dist/light/read-4IVGQSSQ.cjs.map +1 -1
  83. package/dist/light/read-4JAHWXJD.cjs.map +1 -1
  84. package/dist/light/read-56LAPGCZ.cjs.map +1 -1
  85. package/dist/light/read-57SWS5FY.cjs.map +1 -1
  86. package/dist/light/read-5KBTP6Z2.cjs.map +1 -1
  87. package/dist/light/read-5MWEQRHC.cjs.map +1 -1
  88. package/dist/light/read-5ZM54K75.cjs.map +1 -1
  89. package/dist/light/read-6OB5GZL6.cjs.map +1 -1
  90. package/dist/light/read-6VFJHLUY.cjs.map +1 -1
  91. package/dist/light/read-7JCTPQRN.cjs.map +1 -1
  92. package/dist/light/read-7NMMPDOJ.cjs.map +1 -1
  93. package/dist/light/read-7VURJ7JH.cjs.map +1 -1
  94. package/dist/light/read-A6UKZDB6.cjs.map +1 -1
  95. package/dist/light/read-BLY7FGW6.cjs.map +1 -1
  96. package/dist/light/read-CX4OJNA5.cjs.map +1 -1
  97. package/dist/light/read-DNOQGGAA.cjs.map +1 -1
  98. package/dist/light/read-FQODA66G.cjs.map +1 -1
  99. package/dist/light/read-FVJ2ZANC.cjs.map +1 -1
  100. package/dist/light/read-GNDJBICD.cjs.map +1 -1
  101. package/dist/light/read-GPICB7EV.cjs.map +1 -1
  102. package/dist/light/read-HLQ3O2EY.cjs.map +1 -1
  103. package/dist/light/read-IQ4ZDMXU.cjs.map +1 -1
  104. package/dist/light/read-IYADDI7P.cjs.map +1 -1
  105. package/dist/light/read-JAJQAMTT.cjs.map +1 -1
  106. package/dist/light/read-JXQCAGVB.cjs.map +1 -1
  107. package/dist/light/read-KHKBGDMH.cjs.map +1 -1
  108. package/dist/light/read-KHMI7BLQ.cjs.map +1 -1
  109. package/dist/light/read-KNIKCAD7.cjs.map +1 -1
  110. package/dist/light/read-MHJORRLJ.cjs.map +1 -1
  111. package/dist/light/read-NGRLYO4J.cjs.map +1 -1
  112. package/dist/light/read-NJVQ56VB.cjs.map +1 -1
  113. package/dist/light/read-NNUDMZ5Y.cjs.map +1 -1
  114. package/dist/light/read-OPPCTEVP.cjs.map +1 -1
  115. package/dist/light/read-P6RYSGSC.cjs.map +1 -1
  116. package/dist/light/read-PZ7HUBUD.cjs.map +1 -1
  117. package/dist/light/read-QLVXA2AM.cjs.map +1 -1
  118. package/dist/light/read-R7QDGI3Z.cjs.map +1 -1
  119. package/dist/light/read-RR7DTA7C.cjs.map +1 -1
  120. package/dist/light/read-TMVI3SFD.cjs.map +1 -1
  121. package/dist/light/read-TZOSUG56.cjs.map +1 -1
  122. package/dist/light/read-UHJ2PWRC.cjs.map +1 -1
  123. package/dist/light/read-VC2A7LYL.cjs.map +1 -1
  124. package/dist/light/read-VDD66HHL.cjs.map +1 -1
  125. package/dist/light/read-W3LCBM2A.cjs.map +1 -1
  126. package/dist/light/read-XCSEQMMC.cjs.map +1 -1
  127. package/dist/light/read-XDZ73ZUX.cjs.map +1 -1
  128. package/dist/light/read-Z3ORGJSL.cjs.map +1 -1
  129. package/dist/light/read-ZHAWKO6J.cjs.map +1 -1
  130. package/dist/light/read-ZYXLIU6T.cjs.map +1 -1
  131. package/dist/light/sankey-NVGFOYYU.cjs.map +1 -1
  132. package/dist/light/state-2EJKP54B.cjs.map +1 -1
  133. package/dist/light/tabler-P2VVGLOL.cjs.map +1 -1
  134. package/dist/light/time-DRE3GJEU.cjs.map +1 -1
  135. package/dist/light/tree-GGBX3XAZ.cjs.map +1 -1
  136. package/dist/light/try-OV4XRYFL.cjs.map +1 -1
  137. package/dist/light/user-blocks-read-VCJ2URDT.cjs.map +1 -1
  138. package/dist/light/validator-CFJGBSZW.cjs.map +1 -1
  139. package/dist/light/venn-TW7FTGME.cjs.map +1 -1
  140. package/package.json +12 -13
  141. package/src/frame/header.mjs +15 -13
  142. package/src/frame/header.ts +4 -1
  143. package/dist/cdn/framed-AKGEB6S4.js.map +0 -1
@@ -1 +1 @@
1
- {"version":3,"sources":["/Users/cardene/Desktop/projects/dragon-3711-release-0-75-0/packages/dragon/dist/light/pipe-EZX6P3SM.cjs","../../src/blocks/calc/draw.ts","../../src/pipe-valve.ts","../../src/blocks/revert/draw.ts","../../src/blocks/hold/draw.ts","../../src/blocks/write/draw.ts","../../src/blocks/check/draw.ts","../../src/blocks/emit/draw.ts","../../src/blocks/fold/draw.ts","../../src/blocks/call/draw.ts","../../src/blocks/return/draw.ts","../../src/render/pipe.ts","../../src/pipe-route.ts","../../src/kinds/pipe/layout.ts","../../src/pipe-player.ts","../../src/kinds/pipe.ts"],"names":["parts","T","v","s","grid","frame","P","from","near","order","rect","room","others","lanes","at","callList","plate","longest","was","strike","flow"],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACA;AC1CA,IAAM,KAAA,EAAO,2BAAA,CAAU,SAAA,CAAU,CAAA;AAG1B,SAAS,SAAA,CAAU,CAAA,EAAkB,KAAA,EAAuB;AACjE,EAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,IAAA;AAChB,EAAA,MAAM,GAAA,EAAK,CAAC,CAAA,EAAW,CAAA,EAAA,GAAsB,CAAA,EAAA;AACvB,EAAA;AACD,EAAA;AAET,EAAA;AAId;ADsCwB;AACA;AEtDJ;AAGkB;AAClB,EAAA;AACC,EAAA;AACrB;AAG2B;AACN,EAAA;AACE,EAAA;AACD,EAAA;AACtB;AAGsC;AACf,EAAA;AACJ,EAAA;AACD,EAAA;AACZ,EAAA;AACK,IAAA;AACY,MAAA;AACA,MAAA;AACD,MAAA;AAClB,IAAA;AACK,EAAA;AACY,IAAA;AACG,IAAA;AACJ,IAAA;AAClB,EAAA;AACF;AFkDwB;AACA;AGnFe;AHqFf;AACA;AIxEd;AACA;AAGmB;AAGG;AAEN;AAMS;AAChB,EAAA;AACG,EAAA;AAGd,IAAA;AAGI,EAAA;AACW,EAAA;AACD,EAAA;AAEjB,EAAA;AACoB,IAAA;AACA,IAAA;AACZ,IAAA;AAED,EAAA;AAER,EAAA;AAMJ;AAG8C;AAIV;AACd,EAAA;AACE,EAAA;AACxB;AAGoC;AAGE;AAM2B;AACnD,EAAA;AACQ,EAAA;AACA,IAAA;AACX,IAAA;AACC,EAAA;AACS,EAAA;AAEJ,EAAA;AASjB;AAOkD;AAC3B,EAAA;AACN,EAAA;AACF,EAAA;AACc,EAAA;AAEZ,EAAA;AACM,EAAA;AACD,EAAA;AAEJ,EAAA;AACQ,IAAA;AACE,IAAA;AACL,MAAA;AACC,MAAA;AACA,MAAA;AACF,MAAA;AAClB,IAAA;AACO,IAAA;AACT,EAAA;AACyB,EAAA;AACR,EAAA;AACH,IAAA;AACO,IAAA;AACP,EAAA;AACM,IAAA;AACD,IAAA;AACJ,MAAA;AACF,IAAA;AACIA,EAAAA;AACEA,EAAAA;AACL,EAAA;AACW,EAAA;AACA,EAAA;AACZ,IAAA;AACY,EAAA;AAEnB,EAAA;AAGM,EAAA;AAGd;AAG0B;AACF,EAAA;AACL,EAAA;AACnB;AAS4C;AAC9B,EAAA;AACC,EAAA;AAGI,EAAA;AACH,EAAA;AACC,EAAA;AACD,EAAA;AACQ,EAAA;AAEpB,EAAA;AAKJ;AAG2B;AAGY;AAClB,EAAA;AACN,EAAA;AAED,EAAA;AAGd;AAuB4C;AACzB,EAAA;AACA,EAAA;AACE,EAAA;AACH,EAAA;AAGH,EAAA;AACF,EAAA;AACW,EAAA;AAEH,IAAA;AACH,IAAA;AACG,IAAA;AACO,IAAA;AACJ,MAAA;AACF,MAAA;AACE,MAAA;AACJ,MAAA;AACN,MAAA;AACM,MAAA;AACE,MAAA;AAClB,IAAA;AACO,IAAA;AACT,EAAA;AAEY,EAAA;AAGd;AAG0B;AACL,EAAA;AACE,EAAA;AACF,EAAA;AACF,EAAA;AACK,EAAA;AACf,EAAA;AACT;AJtCwB;AACA;AK5Md;AACA;AAGsC;AAEZ;AAGU;AAC1B,EAAA;AACL,EAAA;AACG,IAAA;AAEF,IAAA;AAMd,EAAA;AAEW,EAAA;AAMK,EAAA;AACG,EAAA;AAEP,EAAA;AAMd;AAGwC;AACrB,EAAA;AACE,EAAA;AAEP,EAAA;AAGd;ALkLwB;AACA;AMjOd;AACU;AAGS;AAIyD;AAExE,EAAA;AAOd;AAGqC;AACU,EAAA;AACvB,EAAA;AACA,EAAA;AACA,EAAA;AACxB;AAM8C;AACtB,EAAA;AACP,EAAA;AACA,EAAA;AAGO,EAAA;AAElB,EAAA;AAES,EAAA;AAED,EAAA;AAOd;ANqMwB;AACA;AO3Pd;AAGkC;AAC1B,EAAA;AACC,EAAA;AACN,EAAA;AACC,EAAA;AACK,IAAA;AACR,IAAA;AACT,EAAA;AAEY,EAAA;AAId;AAGqC;AAChB,EAAA;AACA,EAAA;AACG,EAAA;AACF,EAAA;AACtB;APqPwB;AACA;AQjRgB;AACvB,EAAA;AACjB;ARmRwB;AACA;ASxRwC;AACzC,EAAA;AACvB;AT0RwB;AACA;AUxRR;AAGiC;AAC/B,EAAA;AAIT,EAAA;AACT;AAMgF;AACxD,EAAA;AACD,EAAA;AAEnB,EAAA;AAGJ;AV6QwB;AACA;AWjRd;AACA;AACK;AACE;AAGoB;AAMpB;AAAA;AAEf,EAAA;AACoB,EAAA;AACpB,EAAA;AAA4G;AAE5G,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAA6H;AAE7H,EAAA;AAA4D;AAEtC,EAAA;AACtB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAA;AAEqB,EAAA;AACrB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACqB,EAAA;AACC,EAAA;AACHC,EAAAA;AACAA,EAAAA;AACAA,EAAAA;AACAA,EAAAA;AACnB,EAAA;AACe,EAAA;AACf,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAyE;AAEzE,EAAA;AACA,EAAA;AACA,EAAA;AACe,EAAA;AACA,EAAA;AACf,EAAA;AACe,EAAA;AACf,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACkBA,EAAAA;AAClB,EAAA;AACA,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACsB,EAAA;AACtB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAwE;AAExE,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACgB,EAAA;AACA,EAAA;AAChB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACe,EAAA;AACf,EAAA;AACe,EAAA;AACf,EAAA;AAAkE;AAElE,EAAA;AACA,EAAA;AACkBA,EAAAA;AACAA,EAAAA;AAClB,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACe,EAAA;AACf,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACkBA,EAAAA;AACAA,EAAAA;AACAA,EAAAA;AAClB,EAAA;AACO;AAIP;AAG6B;AAEjB,EAAA;AAId;AAGqC;AACd,EAAA;AACH,EAAA;AACG,EAAA;AACvB;AAMsB;AACE,EAAA;AACN,EAAA;AACA,EAAA;AACG,IAAA;AACG,IAAA;AACtB,EAAA;AACmB,EAAA;AACA,IAAA;AACD,MAAA;AACD,MAAA;AACA,MAAA;AACK,MAAA;AACJ,MAAA;AACE,MAAA;AACC,MAAA;AACnB,IAAA;AACgB,EAAA;AACF,IAAA;AACN,IAAA;AACQ,IAAA;AACC,IAAA;AACnB,EAAA;AACF;AAGwE;AAE/C;AACT,EAAA;AACG,EAAA;AACA,EAAA;AACG,EAAA;AACD,EAAA;AACD,EAAA;AACS,EAAA;AAGT,EAAA;AACa,IAAA;AACnB,IAAA;AACO,IAAA;AACG,MAAA;AACZ,MAAA;AACR,IAAA;AACe,IAAA;AACG,IAAA;AACpB,EAAA;AACmC,EAAA;AAEnB,EAAA;AACI,IAAA;AACE,IAAA;AACtB,EAAA;AAC4B,EAAA;AAKE,EAAA;AAEV,EAAA;AAEJ,EAAA;AAGM,EAAA;AACF,IAAA;AACD,IAAA;AACE,IAAA;AACH,MAAA;AACI,MAAA;AACnB,IAAA;AACmB,IAAA;AACA,IAAA;AACtB,EAAA;AAGe,EAAA;AACI,IAAA;AACL,IAAA;AACa,IAAA;AACN,IAAA;AACF,MAAA;AACF,MAAA;AACK,MAAA;AAEhB,MAAA;AAGY,QAAA;AACK,QAAA;AACD,QAAA;AACE,QAAA;AACb,MAAA;AACI,MAAA;AACb,IAAA;AAEgB,IAAA;AACG,MAAA;AACN,MAAA;AACb,IAAA;AACS,IAAA;AACV,EAAA;AAEkB,EAAA;AACA,EAAA;AACH,EAAA;AACF,IAAA;AAGH,IAAA;AACX,EAAA;AAEe,EAAA;AACI,IAAA;AACW,IAAA;AACb,IAAA;AACA,IAAA;AAEwB,IAAA;AAEZ,IAAA;AACf,IAAA;AACI,IAAA;AACS,IAAA;AACL,IAAA;AACL,IAAA;AAGG,IAAA;AACC,IAAA;AAEF,IAAA;AACE,MAAA;AACA,MAAA;AACJ,MAAA;AACH,MAAA;AACC,MAAA;AACb,IAAA;AAEkB,IAAA;AACF,MAAA;AACN,MAAA;AACM,MAAA;AAKI,MAAA;AACL,MAAA;AACA,MAAA;AACF,MAAA;AACb,IAAA;AACgB,IAAA;AACG,MAAA;AACA,MAAA;AACN,MAAA;AACb,IAAA;AAEgB,IAAA;AACI,MAAA;AACL,MAAA;AACL,MAAA;AACQ,QAAA;AACJ,QAAA;AACG,QAAA;AAEL,QAAA;AAGV,MAAA;AACgB,MAAA;AACL,MAAA;AACb,IAAA;AACgB,IAAA;AAEA,IAAA;AACA,IAAA;AACG,MAAA;AACA,MAAA;AACA,MAAA;AACH,MAAA;AACJ,MAAA;AACG,QAAA;AACX,QAAA;AACF,MAAA;AACW,MAAA;AACb,IAAA;AAEmB,IAAA;AACA,MAAA;AACD,QAAA;AACA,QAAA;AACA,QAAA;AAEI,UAAA;AACA,UAAA;AAEN,QAAA;AACA,QAAA;AACN,QAAA;AACQ,QAAA;AAEZ,QAAA;AAGiB,UAAA;AACC,UAAA;AACZ,UAAA;AACE,UAAA;AACJ,QAAA;AACK,QAAA;AACD,QAAA;AACF,UAAA;AACI,UAAA;AACE,UAAA;AACE,YAAA;AACN,YAAA;AACR,UAAA;AACa,UAAA;AACD,UAAA;AACd,QAAA;AACW,QAAA;AACb,MAAA;AAEc,IAAA;AACG,sBAAA;AACA,MAAA;AACL,MAAA;AACS,MAAA;AACR,QAAA;AACX,QAAA;AACF,MAAA;AACe,MAAA;AACC,MAAA;AACR,QAAA;AACA,QAAA;AACU,QAAA;AACD,QAAA;AACH,QAAA;AACb,MAAA;AACW,MAAA;AACK,MAAA;AACnB,IAAA;AAEgB,IAAA;AACG,MAAA;AACA,MAAA;AACX,MAAA;AACJ,QAAA;AACE,UAAA;AACY,UAAA;AAGd,QAAA;AACF,MAAA;AACF,IAAA;AACgB,IAAA;AACI,MAAA;AACL,MAAA;AACI,MAAA;AACA,MAAA;AACD,MAAA;AACL,MAAA;AACb,IAAA;AAEgB,IAAA;AACG,MAAA;AACA,MAAA;AACJ,MAAA;AACH,MAAA;AACC,MAAA;AACb,IAAA;AAEgB,IAAA;AACG,MAAA;AACN,MAAA;AACb,IAAA;AAEgB,IAAA;AACC,MAAA;AACG,MAAA;AACJ,MAAA;AACE,MAAA;AACC,MAAA;AACH,MAAA;AACU,MAAA;AAChB,QAAA;AACC,QAAA;AACT,MAAA;AACa,MAAA;AACC,MAAA;AACI,QAAA;AACD,QAAA;AACF,QAAA;AACd,MAAA;AACgB,MAAA;AACF,MAAA;AAEG,MAAA;AACZ,MAAA;AACJ,QAAA;AAEF,MAAA;AACkB,MAAA;AAED,sBAAA;AACnB,IAAA;AAEmB,IAAA;AACV,IAAA;AACV,EAAA;AACc,EAAA;AACjB;AXoMwB;AACA;AYhrBD;AACA;AAsDyB;AAG5B;AACT,EAAA;AACK,EAAA;AACE,EAAA;AACI,IAAA;AACa,IAAA;AACrB,IAAA;AACZ,EAAA;AACO,EAAA;AACT;AAG0B;AAED,EAAA;AACH,EAAA;AACA,EAAA;AACR,IAAA;AACU,IAAA;AACJ,IAAA;AACJ,IAAA;AACM,IAAA;AACpB,EAAA;AACO,EAAA;AACT;AAOW;AACW,iBAAA;AACC,kBAAA;AACS,kBAAA;AAClB,kBAAA;AAAA;AAEF,kBAAA;AAEI,EAAA;AACH,IAAA;AACX,EAAA;AAEe,EAAA;AACD,IAAA;AACd,EAAA;AAEmD,EAAA;AAC7B,IAAA;AACL,IAAA;AACF,IAAA;AACC,IAAA;AACG,MAAA;AACG,MAAA;AACF,MAAA;AACL,MAAA;AACC,MAAA;AACA,MAAA;AACR,MAAA;AACN,IAAA;AACW,IAAA;AACC,IAAA;AACJ,IAAA;AACV,EAAA;AAEc,EAAA;AACG,IAAA;AACK,IAAA;AACD,IAAA;AACF,IAAA;AACN,IAAA;AACK,MAAA;AACA,MAAA;AACI,MAAA;AACV,MAAA;AACC,MAAA;AACO,QAAA;AACA,QAAA;AACN,QAAA;AACC,QAAA;AACK,QAAA;AACR,UAAA;AACQ,UAAA;AACd,QAAA;AACc,QAAA;AACR,UAAA;AACQ,UAAA;AACd,QAAA;AACa,QAAA;AACF,QAAA;AACC,QAAA;AACA,QAAA;AACR,QAAA;AACN,MAAA;AACW,MAAA;AACC,MAAA;AACJ,MAAA;AACV,IAAA;AACO,IAAA;AACT,EAAA;AAEqB,EAAA;AACD,IAAA;AACA,IAAA;AACC,IAAA;AACJ,IAAA;AACK,IAAA;AACJ,IAAA;AACF,IAAA;AACD,IAAA;AACC,IAAA;AACJ,IAAA;AACZ,EAAA;AACF;AACsB;AAaU;AAqB5B;AAEQ;AAG0B;AACf,EAAA;AACA,EAAA;AACZ,EAAA;AACG,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACI,IAAA;AACH,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACD,IAAA;AACA,IAAA;AACC,IAAA;AACA,IAAA;AACI,IAAA;AACD,IAAA;AAChB,EAAA;AAEQ,EAAA;AACD,EAAA;AACT;AAEoB;AACT,EAAA;AACA,EAAA;AACgB,kBAAA;AACR,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AAAA;AAEE,kBAAA;AAAA;AAEE,kBAAA;AAAA;AAEF,kBAAA;AAEuC,EAAA;AAC9C,IAAA;AACA,IAAA;AACG,IAAA;AACA,IAAA;AAEG,IAAA;AACA,IAAA;AACE,IAAA;AACA,IAAA;AACD,IAAA;AACA,IAAA;AACE,IAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAED,MAAA;AACA,QAAA;AACJ,QAAA;AACE,QAAA;AACf,MAAA;AACiB,MAAA;AACA,QAAA;AACJ,QAAA;AACE,QAAA;AACf,MAAA;AACD,IAAA;AACkB,IAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAEL,MAAA;AACE,QAAA;AACE,UAAA;AACJ,MAAA;AACE,QAAA;AACE,UAAA;AAClB,IAAA;AACH,EAAA;AAE8B,EAAA;AAClB,IAAA;AACM,IAAA;AAClB,EAAA;AAC8B,EAAA;AAClB,IAAA;AACM,IAAA;AAClB,EAAA;AAAA;AAGkC,EAAA;AACZ,IAAA;AACJ,IAAA;AACG,IAAA;AACF,MAAA;AACC,MAAA;AACA,MAAA;AAEH,MAAA;AACE,QAAA;AACE,UAAA;AAEJ,MAAA;AACE,QAAA;AACE,UAAA;AACZ,IAAA;AACU,MAAA;AACC,MAAA;AACA,MAAA;AACH,MAAA;AACE,QAAA;AACE,UAAA;AACJ,MAAA;AACE,QAAA;AACE,UAAA;AACnB,IAAA;AACF,EAAA;AAAA;AAGiE,EAAA;AAC3C,IAAA;AACD,MAAA;AACC,MAAA;AACA,MAAA;AACD,MAAA;AACF,MAAA;AACjB,IAAA;AACF,EAAA;AAAA;AAG2B,EAAA;AACZ,IAAA;AACQ,IAAA;AACT,IAAA;AACM,IAAA;AACA,IAAA;AACF,IAAA;AAEZ,IAAA;AACa,IAAA;AACA,MAAA;AACC,MAAA;AAEA,QAAA;AACF,UAAA;AACC,UAAA;AACA,QAAA;AACb,QAAA;AACF,MAAA;AACc,MAAA;AACG,QAAA;AACE,QAAA;AAEP,QAAA;AACV,QAAA;AACF,MAAA;AACc,MAAA;AACO,MAAA;AACR,MAAA;AACI,MAAA;AACR,MAAA;AACX,IAAA;AACO,IAAA;AACT,EAAA;AAAA;AAGgD,EAAA;AAC1B,IAAA;AACA,IAAA;AACD,IAAA;AACA,IAAA;AACF,IAAA;AACN,IAAA;AACQ,IAAA;AACG,MAAA;AACF,MAAA;AACA,MAAA;AACZ,MAAA;AACQ,MAAA;AACI,MAAA;AAET,MAAA;AACG,MAAA;AACR,MAAA;AACA,MAAA;AACN,IAAA;AACO,IAAA;AACT,EAAA;AAAA;AAAA;AAAA;AAAA;AAMqC,EAAA;AAChB,IAAA;AACC,IAAA;AACJ,IAAA;AACE,IAAA;AACL,IAAA;AACG,IAAA;AACL,IAAA;AACC,IAAA;AACQ,IAAA;AACA,MAAA;AACA,MAAA;AACD,MAAA;AACD,MAAA;AAEL,MAAA;AACM,MAAA;AACjB,MAAA;AACF,IAAA;AACiB,IAAA;AACN,IAAA;AACA,IAAA;AAGe,IAAA;AACP,MAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACH,MAAA;AACC,MAAA;AACC,QAAA;AACAC,QAAAA;AACjB,MAAA;AAIe,MAAA;AACG,MAAA;AACD,MAAA;AACV,MAAA;AACT,IAAA;AAEc,IAAA;AACE,MAAA;AACD,MAAA;AACE,MAAA;AACD,MAAA;AACC,MAAA;AACD,MAAA;AAEA,MAAA;AACA,MAAA;AACG,MAAA;AACnB,IAAA;AAEc,IAAA;AAEI,IAAA;AACE,MAAA;AACA,MAAA;AACJ,MAAA;AACR,MAAA;AACQ,MAAA;AACA,MAAA;AACC,MAAA;AACH,MAAA;AACC,MAAA;AACf,IAAA;AAKkB,IAAA;AACV,MAAA;AACY,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACJ,MAAA;AACA,MAAA;AACA,MAAA;AACC,MAAA;AACD,MAAA;AACE,MAAA;AACA,MAAA;AACC,MAAA;AACnB,IAAA;AACgB,IAAA;AACIC,MAAAA;AACAA,MAAAA;AACD,MAAA;AACP,MAAA;AACC,MAAA;AACOA,MAAAA;AACAA,MAAAA;AACH,MAAA;AACE,MAAA;AACF,MAAA;AACC,QAAA;AACA,QAAA;AACA,QAAA;AACA,QAAA;AAChB,MAAA;AACF,IAAA;AACY,IAAA;AACI,IAAA;AACC,IAAA;AACA,IAAA;AACD,MAAA;AACC,MAAA;AACN,MAAA;AAGM,MAAA;AACA,MAAA;AACF,MAAA;AACM,MAAA;AACA,MAAA;AACT,QAAA;AACS,QAAA;AACjB,QAAA;AACF,MAAA;AACiB,MAAA;AACC,MAAA;AAEF,MAAA;AACF,QAAA;AACF,QAAA;AACI,QAAA;AACC,QAAA;AACA,QAAA;AACJ,QAAA;AACC,QAAA;AACD,QAAA;AACE,UAAA;AACA,UAAA;AACA,UAAA;AACD,UAAA;AACZ,QAAA;AACF,MAAA;AACF,IAAA;AACe,IAAA;AACW,IAAA;AAClB,IAAA;AACC,IAAA;AACM,MAAA;AACG,MAAA;AACH,MAAA;AACC,QAAA;AACZ,QAAA;AACF,MAAA;AACI,MAAA;AACN,IAAA;AACe,IAAA;AACa,IAAA;AACb,MAAA;AACI,MAAA;AACA,MAAA;AAClB,IAAA;AACkB,IAAA;AACrB,EAAA;AACF;AAOgD;AAC3B,EAAA;AACC,EAAA;AACJ,IAAA;AACM,IAAA;AACH,MAAA;AACG,MAAA;AACD,MAAA;AACD,MAAA;AACD,MAAA;AACG,MAAA;AACA,MAAA;AACA,MAAA;AAEJ,MAAA;AACI,QAAA;AACF,QAAA;AACEC,UAAAA;AACH,UAAA;AACH,YAAA;AACI,YAAA;AACZ,UAAA;AACA,UAAA;AACF,QAAA;AACF,MAAA;AAEkB,MAAA;AACD,QAAA;AACO,QAAA;AACN,QAAA;AACR,UAAA;AACI,UAAA;AACV,UAAA;AACF,QAAA;AACF,MAAA;AAEiB,MAAA;AACA,QAAA;AACO,QAAA;AACP,QAAA;AACP,UAAA;AACI,UAAA;AACV,UAAA;AACF,QAAA;AACF,MAAA;AAGc,MAAA;AACE,QAAA;AACH,QAAA;AACH,UAAA;AACI,UAAA;AACZ,QAAA;AACF,MAAA;AACF,IAAA;AACc,IAAA;AAChB,EAAA;AACO,EAAA;AACT;AAMwC;AACvB,EAAA;AACI,EAAA;AACG,EAAA;AACT,EAAA;AACC,EAAA;AACQ,EAAA;AACsB,EAAA;AAEtB,EAAA;AACF,EAAA;AACH,EAAA;AACI,IAAA;AACH,IAAA;AACI,MAAA;AACA,MAAA;AACD,MAAA;AACC,MAAA;AACD,MAAA;AACnB,IAAA;AACF,EAAA;AAEmB,EAAA;AACC,EAAA;AACF,EAAA;AACD,IAAA;AACC,IAAA;AACI,MAAA;AACF,MAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACpB,IAAA;AACF,EAAA;AACO,EAAA;AACT;AAUE;AAIe,EAAA;AACI,EAAA;AACE,EAAA;AACC,EAAA;AACsB,EAAA;AACtB,EAAA;AAEL,EAAA;AAIE,EAAA;AACC,EAAA;AACN,EAAA;AACI,IAAA;AACA,MAAA;AACI,MAAA;AACA,MAAA;AACpB,IAAA;AACoB,EAAA;AACF,EAAA;AACP,EAAA;AACK,IAAA;AACI,MAAA;AACJ,MAAA;AACG,MAAA;AACnB,IAAA;AACK,EAAA;AACT;AAGyB;AACD,EAAA;AACN,EAAA;AACG,IAAA;AACA,IAAA;AACA,IAAA;AACL,IAAA;AACG,IAAA;AACjB,EAAA;AACO,EAAA;AACT;AZmgBwB;AACA;AansCkC;AACpD,EAAA;AACM,IAAA;AACE,IAAA;AACI,IAAA;AACR,IAAA;AACM,IAAA;AACM,IAAA;AACpB,EAAA;AACI,EAAA;AACM,IAAA;AACQ,IAAA;AACF,IAAA;AACR,IAAA;AACM,IAAA;AACM,IAAA;AACpB,EAAA;AACF;AAoBgC;AAIN;AACX,EAAA;AACM,EAAA;AACL,EAAA;AACP,EAAA;AACW,IAAA;AACE,IAAA;AACH,IAAA;AACK,IAAA;AACT,IAAA;AACA,IAAA;AACb,EAAA;AACF;AAGwD;AAyVnB;AACf,EAAA;AACF,EAAA;AACpB;AAGwC;AAUf;AASE,EAAA;AACA,EAAA;AACH,EAAA;AACJ,IAAA;AACC,MAAA;AACU,QAAA;AACR,QAAA;AACA,QAAA;AACJ,MAAA;AACI,QAAA;AACH,QAAA;AACd,MAAA;AACF,IAAA;AACD,EAAA;AACa,EAAA;AACQ,EAAA;AACC,EAAA;AACI,EAAA;AACnB,EAAA;AACW,EAAA;AACE,IAAA;AACJ,IAAA;AACA,IAAA;AACb,MAAA;AACA,MAAA;AACF,IAAA;AACc,IAAA;AACK,IAAA;AACR,IAAA;AACI,MAAA;AACI,MAAA;AACH,MAAA;AACf,IAAA;AACU,IAAA;AACb,EAAA;AACqB,EAAA;AACC,EAAA;AACF,EAAA;AACD,EAAA;AACE,EAAA;AACvB;AAG+D;AACtC,EAAA;AACJ,EAAA;AACD,EAAA;AACpB;AA2EyB;AACD,EAAA;AACN,EAAA;AACiB,EAAA;AACpB,EAAA;AACQ,EAAA;AACA,EAAA;AACJ,EAAA;AACY,EAAA;AACd,EAAA;AACY,EAAA;AACV,EAAA;AACsB,EAAA;AAEjB,EAAA;AACL,IAAA;AACE,IAAA;AACD,IAAA;AACZ,IAAA;AACsB,IAAA;AACb,MAAA;AACI,MAAA;AACA,MAAA;AACG,MAAA;AACpB,IAAA;AACoB,IAAA;AACF,MAAA;AACD,QAAA;AACU,UAAA;AACR,YAAA;AACL,YAAA;AACC,YAAA;AACC,YAAA;AACF,YAAA;AACK,YAAA;AACH,YAAA;AACD,YAAA;AACD,YAAA;AACA,YAAA;AACR,UAAA;AACU,UAAA;AACI,UAAA;AACF,UAAA;AACF,UAAA;AACJ,UAAA;AACO,YAAA;AACD,YAAA;AACA,YAAA;AACA,YAAA;AACE,YAAA;AACd,UAAA;AACA,UAAA;AACF,QAAA;AACK,QAAA;AACU,QAAA;AACP,UAAA;AACA,UAAA;AACM,UAAA;AACA,UAAA;AACC,UAAA;AACP,UAAA;AACA,UAAA;AACO,YAAA;AACL,YAAA;AACE,YAAA;AACA,cAAA;AACE,cAAA;AACR,cAAA;AACE,gBAAA;AACO,gBAAA;AACH,gBAAA;AACF,kBAAA;AACK,kBAAA;AACP,gBAAA;AACK,gBAAA;AACP,cAAA;AACK,cAAA;AACP,YAAA;AACK,UAAA;AACM,YAAA;AACF,cAAA;AACC,cAAA;AACV,YAAA;AACQ,YAAA;AACI,YAAA;AACd,UAAA;AACA,UAAA;AACF,QAAA;AACa,QAAA;AACG,UAAA;AACA,UAAA;AACH,UAAA;AACD,UAAA;AACA,UAAA;AACA,UAAA;AACE,UAAA;AACZ,UAAA;AACF,QAAA;AACc,QAAA;AACE,UAAA;AACF,UAAA;AACF,UAAA;AACC,UAAA;AACX,UAAA;AACF,QAAA;AACa,QAAA;AACA,UAAA;AACG,UAAA;AACF,UAAA;AACF,UAAA;AACV,UAAA;AACF,QAAA;AACK,QAAA;AACQ,UAAA;AACX,UAAA;AACG,QAAA;AACO,UAAA;AACV,UAAA;AACF,QAAA;AACE,UAAA;AACJ,MAAA;AACD,IAAA;AACgB,IAAA;AACA,IAAA;AACF,IAAA;AACH,IAAA;AACC,IAAA;AACA,MAAA;AACO,MAAA;AACA,MAAA;AACA,MAAA;AACpB,IAAA;AACgB,IAAA;AACA,MAAA;AACA,MAAA;AACE,MAAA;AACJ,MAAA;AACA,MAAA;AACA,MAAA;AACd,IAAA;AACM,IAAA;AACA,IAAA;AAEJ,IAAA;AAOc,IAAA;AACD,IAAA;AACK,MAAA;AACF,MAAA;AAChB,MAAA;AACA,MAAA;AACA,MAAA;AACa,MAAA;AACD,MAAA;AACG,MAAA;AAChB,IAAA;AACF,EAAA;AACM,EAAA;AACT;AAKwB;AACZ,EAAA;AACY,EAAA;AACxB;AAEU;AACA;AAsBY;AACA,EAAA;AACC,EAAA;AACP,EAAA;AACA,EAAA;AAChB;AAGc;AACK;AAGN;AAEI;AAEM;AAEN;AAEA;AAEQ;AAKL;AAKH;AAEE;AAKE;AAKP;AAEK;AAEC;AAEA;AAEE;AACH,EAAA;AACH,EAAA;AAChB;AACmD;AAClB;AACa;AAEb;AAEU;AACnB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACH,EAAA;AACrB;AAEkB;AACD;AAEO;AAER;AAEM;AACZ,EAAA;AACa,EAAA;AACH,IAAA;AACE,MAAA;AACA,MAAA;AACD,MAAA;AACD,MAAA;AACA,MAAA;AACG,MAAA;AACnB,IAAA;AACK,EAAA;AACT;AAEwC;AAChB,EAAA;AACD,EAAA;AACvB;AAcgC;AACnB,EAAA;AACP,EAAA;AACM,EAAA;AACI,EAAA;AACM,EAAA;AACF,IAAA;AACV,IAAA;AACc,IAAA;AACD,IAAA;AACN,IAAA;AACO,IAAA;AACD,IAAA;AACL,IAAA;AACP,IAAA;AACT,EAAA;AAE2C,EAAA;AAC7C;AAKmD;AAC5B,EAAA;AAEF,EAAA;AACC,EAAA;AACyB,EAAA;AAChC,EAAA;AACQ,EAAA;AACN,EAAA;AACI,EAAA;AACrB;AAC6D;AACf;AAC5B;AAEC;AACW,EAAA;AACf,EAAA;AACQ,EAAA;AACA,IAAA;AACC,IAAA;AACtB,EAAA;AACO,EAAA;AACT;AAEyC;AAC5B,EAAA;AACU,EAAA;AACF,IAAA;AACA,IAAA;AACG,MAAA;AACA,MAAA;AACpB,IAAA;AACQ,IAAA;AACV,EAAA;AACqB,EAAA;AACvB;AAMoB;AACI,EAAA;AACI,EAAA;AACR,IAAA;AACA,IAAA;AACC,IAAA;AACnB,EAAA;AACmB,EAAA;AACA,IAAA;AACV,IAAA;AACU,MAAA;AACA,MAAA;AACjB,IAAA;AACD,EAAA;AAC6B,EAAA;AACVJ,EAAAA;AACHA,IAAAA;AACI,IAAA;AACF,IAAA;AACG,IAAA;AACtB,EAAA;AACgBA,EAAAA;AACT,EAAA;AACT;AAE2B;AACJ,EAAA;AACP,EAAA;AACA,EAAA;AACCK,EAAAA;AAEK,EAAA;AACD,EAAA;AACG,EAAA;AACN,EAAA;AACa,EAAA;AACT,IAAA;AACC,IAAA;AACZ,IAAA;AACT,EAAA;AAC6BJ,EAAAA;AAEV,EAAA;AACC,EAAA;AACR,EAAA;AAIQ,IAAA;AACA,IAAA;AACJ,IAAA;AAChB,EAAA;AACgB,EAAA;AAClB;AAWgB;AAEI;AAEH;AACO,EAAA;AACA,EAAA;AACH,EAAA;AACE,EAAA;AACC,EAAA;AACL,EAAA;AACK,EAAA;AACA,EAAA;AACN,EAAA;AACG,EAAA;AACiB,EAAA;AAChB,EAAA;AACA,EAAA;AACC,EAAA;AAEJ,EAAA;AACKK,EAAAA;AAGG,EAAA;AACJ,EAAA;AACa,EAAA;AACb,IAAA;AACrB,EAAA;AACmB,EAAA;AACH,EAAA;AACI,EAAA;AACmB,EAAA;AACnB,EAAA;AACA,EAAA;AACD,EAAA;AACH,EAAA;AACC,EAAA;AACG,EAAA;AACA,EAAA;AACmB,EAAA;AACrB,EAAA;AAGE,EAAA;AACC,EAAA;AACL,EAAA;AACI,IAAA;AACE,IAAA;AACtB,EAAA;AACmB,EAAA;AACD,IAAA;AACA,MAAA;AACD,MAAA;AACK,MAAA;AACpB,IAAA;AACiB,EAAA;AACH,EAAA;AACE,IAAA;AACT,IAAA;AACT,EAAA;AACiB,EAAA;AACC,IAAA;AAClB,EAAA;AACmB,EAAA;AACS,EAAA;AACN,EAAA;AACL,EAAA;AACG,EAAA;AACD,EAAA;AACD,IAAA;AAClB,EAAA;AACgB,EAAA;AACG,EAAA;AACL,IAAA;AACO,IAAA;AACD,MAAA;AACJ,MAAA;AACK,MAAA;AACL,MAAA;AACd,IAAA;AACgB,IAAA;AACC,MAAA;AACD,MAAA;AAChB,IAAA;AACc,IAAA;AAChB,EAAA;AACgB,EAAA;AACD,EAAA;AACF,IAAA;AACG,IAAA;AAChB,EAAA;AAGmB,EAAA;AACE,EAAA;AACL,EAAA;AACM,IAAA;AACA,IAAA;AACH,IAAA;AACnB,EAAA;AACsC,EAAA;AAIzB,EAAA;AACG,EAAA;AACA,EAAA;AACA,EAAA;AACW,EAAA;AAER,EAAA;AACF,EAAA;AACK,IAAA;AACtB,EAAA;AAKiBC,EAAAA;AACW,IAAA;AACb,IAAA;AACK,IAAA;AACO,IAAA;AACL,MAAA;AACA,MAAA;AACF,MAAA;AACL,QAAA;AACE,QAAA;AACN,QAAA;AACI,QAAA;AACX,MAAA;AACF,IAAA;AACK,IAAA;AACE,IAAA;AACT,EAAA;AACyB,EAAA;AACA,EAAA;AACZ,EAAA;AACO,EAAA;AACE,IAAA;AACI,IAAA;AACL,IAAA;AACN,IAAA;AACM,MAAA;AACC,MAAA;AACP,MAAA;AACC,MAAA;AACG,MAAA;AACjB,IAAA;AACc,IAAA;AACD,IAAA;AACO,IAAA;AACF,IAAA;AAED,IAAA;AACP,MAAA;AACQ,MAAA;AACD,QAAA;AACA,QAAA;AACA,QAAA;AACA,QAAA;AACL,QAAA;AACR,QAAA;AACF,MAAA;AACF,IAAA;AACmB,IAAA;AACA,IAAA;AACrB,EAAA;AACgB,EAAA;AAGK,EAAA;AACF,EAAA;AACA,IAAA;AACD,MAAA;AACGC,MAAAA;AACnB,IAAA;AAC0B,EAAA;AACV,IAAA;AACG,IAAA;AACrB,EAAA;AAEgB,EAAA;AACD,IAAA;AACO,IAAA;AACtB,EAAA;AAIsC,EAAA;AACvB,EAAA;AAEI,EAAA;AACmB,EAAA;AACtB,EAAA;AAEJ,IAAA;AACA,IAAA;AACM,IAAA;AACK,IAAA;AACD,MAAA;AACE,MAAA;AACnB,IAAA;AACH,EAAA;AACc,EAAA;AACA,EAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAChB,EAAA;AAEiB,EAAA;AACA,EAAA;AAED,EAAA;AAGI,EAAA;AACgC,EAAA;AACvB,EAAA;AACb,EAAA;AAIA,EAAA;AACK,IAAA;AACH,IAAA;AACG,IAAA;AACH,IAAA;AACE,IAAA;AACC,IAAA;AACD,IAAA;AACJ,IAAA;AAChB,EAAA;AACqB,EAAA;AACF,EAAA;AACC,EAAA;AACE,IAAA;AACN,IAAA;AAChB,EAAA;AACmB,EAAA;AACD,EAAA;AACC,EAAA;AAIA,EAAA;AAOU,EAAA;AACJ,EAAA;AAEG,EAAA;AAEZ,EAAA;AAED,EAAA;AACC,EAAA;AACA,EAAA;AACD,IAAA;AAEK,IAAA;AACA,IAAA;AACa,IAAA;AAEf,IAAA;AACF,IAAA;AACD,MAAA;AACI,QAAA;AACA,QAAA;AACCF,QAAAA;AAChB,MAAA;AACa,MAAA;AACG,MAAA;AACjB,IAAA;AACiB,IAAA;AACL,IAAA;AACoB,IAAA;AACd,IAAA;AACP,MAAA;AAEK,MAAA;AACD,MAAA;AACT,MAAA;AACP,IAAA;AACiB,IAAA;AACnB,EAAA;AAmB2B,EAAA;AACZ,IAAA;AACsB,IAAA;AACnB,IAAA;AACF,IAAA;AACP,IAAA;AACT,EAAA;AACuB,EAAA;AACR,EAAA;AACY,EAAA;AAEP,EAAA;AACA,IAAA;AACK,IAAA;AACR,IAAA;AACK,IAAA;AAChB,IAAA;AAEY,IAAA;AACA,MAAA;AACI,MAAA;AACP,MAAA;AACM,QAAA;AACA,QAAA;AACF,QAAA;AACE,QAAA;AACD,QAAA;AACH,UAAA;AACK,UAAA;AACA,UAAA;AAChB,QAAA;AACF,MAAA;AACF,IAAA;AAEgB,IAAA;AACA,MAAA;AAEH,MAAA;AACC,QAAA;AACC,QAAA;AACE,UAAA;AACF,UAAA;AACK,UAAA;AACd,UAAA;AACF,QAAA;AACF,MAAA;AACF,IAAA;AAEK,IAAA;AACQ,MAAA;AACC,QAAA;AACC,QAAA;AACE,UAAA;AACF,UAAA;AACK,UAAA;AACd,UAAA;AACF,QAAA;AACF,MAAA;AACc,IAAA;AAClB,EAAA;AACsB,EAAA;AAGtB,EAAA;AACkB,IAAA;AACA,IAAA;AACG,IAAA;AACH,IAAA;AACD,MAAA;AACG,MAAA;AACL,MAAA;AACF,MAAA;AACO,MAAA;AACF,QAAA;AACI,QAAA;AACR,UAAA;AACQ,UAAA;AACA,UAAA;AACA,UAAA;AAChB,QAAA;AACF,MAAA;AACgB,MAAA;AAClB,IAAA;AACF,EAAA;AAKgB,EAAA;AAChB,EAAA;AACmB,IAAA;AACA,IAAA;AACF,IAAA;AACC,IAAA;AACI,MAAA;AACP,MAAA;AACb,IAAA;AACgB,IAAA;AACI,MAAA;AACF,MAAA;AACF,MAAA;AACE,MAAA;AAClB,IAAA;AACF,EAAA;AAEoB,EAAA;AAOJ,EAAA;AAEA,EAAA;AACZ,EAAA;AACe,EAAA;AACH,IAAA;AACG,IAAA;AACH,IAAA;AACM,MAAA;AACJ,MAAA;AACG,MAAA;AACnB,IAAA;AACY,IAAA;AACE,MAAA;AACZ,MAAA;AACF,IAAA;AACF,EAAA;AACO,EAAA;AAEU,EAAA;AACC,IAAA;AACC,IAAA;AACG,IAAA;AACL,IAAA;AASF,IAAA;AACa,IAAA;AAEU,IAAA;AAClB,MAAA;AACAA,MAAAA;AAClB,IAAA;AAEmBC,IAAAA;AAEJ,IAAA;AACuB,IAAA;AAC5B,MAAA;AACS,MAAA;AACD,QAAA;AACH,QAAA;AACA,QAAA;AACI,QAAA;AACC,QAAA;AACD,QAAA;AACA,QAAA;AACD,QAAA;AACT,QAAA;AACN,MAAA;AACH,IAAA;AACY,IAAA;AAEG,IAAA;AACI,IAAA;AACD,MAAA;AACA,QAAA;AACF,UAAA;AACG,UAAA;AACd,QAAA;AACaC,QAAAA;AAChB,MAAA;AACgB,IAAA;AACC,IAAA;AACF,MAAA;AACC,QAAA;AACE,QAAA;AAClB,MAAA;AACY,MAAA;AAEE,MAAA;AACC,MAAA;AACE,QAAA;AACD,QAAA;AAChB,MAAA;AACF,IAAA;AAGY,IAAA;AACK,IAAA;AACH,IAAA;AACK,IAAA;AACD,MAAA;AACC,QAAA;AACP,QAAA;AACM,QAAA;AACE,QAAA;AACA,QAAA;AACZ,QAAA;AACO,QAAA;AACA,QAAA;AACG,QAAA;AACF,QAAA;AACG,QAAA;AACjB,MAAA;AACF,IAAA;AACW,IAAA;AAEQ,IAAA;AACJ,IAAA;AACC,IAAA;AAII,IAAA;AAED,IAAA;AAGQ,IAAA;AACP,MAAA;AACD,MAAA;AACgB,MAAA;AACrB,MAAA;AACI,QAAA;AACH,QAAA;AAEC,QAAA;AACG,QAAA;AACC,QAAA;AAClB,MAAA;AACY,MAAA;AACI,MAAA;AACC,QAAA;AACA,QAAA;AACjB,MAAA;AACO,MAAA;AACT,IAAA;AACc,IAAA;AACI,IAAA;AACD,IAAA;AACF,MAAA;AACK,MAAA;AACpB,IAAA;AAGyB,IAAA;AACR,IAAA;AACA,IAAA;AACJ,IAAA;AACI,IAAA;AACA,IAAA;AACA,IAAA;AAKC,IAAA;AACE,IAAA;AACH,MAAA;AACD,MAAA;AACA,MAAA;AAChB,IAAA;AACiB,IAAA;AACC,IAAA;AACM,IAAA;AACR,IAAA;AACD,MAAA;AACG,MAAA;AACH,MAAA;AAEI,QAAA;AACf,QAAA;AACF,MAAA;AACa,MAAA;AACC,MAAA;AACG,MAAA;AACD,MAAA;AACE,QAAA;AACH,UAAA;AACA,UAAA;AACE,UAAA;AACC,YAAA;AAEF,YAAA;AACZ,UAAA;AACF,QAAA;AACe,MAAA;AACD,MAAA;AACE,MAAA;AACpB,IAAA;AACmB,IAAA;AACR,IAAA;AACK,IAAA;AACE,IAAA;AACD,IAAA;AACD,IAAA;AACL,IAAA;AACF,IAAA;AACA,IAAA;AACU,IAAA;AACA,MAAA;AACA,MAAA;AACP,MAAA;AACZ,IAAA;AACiB,IAAA;AACA,IAAA;AACA,IAAA;AAIH,IAAA;AACG,MAAA;AACH,QAAA;AACG,QAAA;AACCF,QAAAA;AAChB,MAAA;AACgB,MAAA;AAClB,IAAA;AACgB,IAAA;AACG,MAAA;AACA,MAAA;AACnB,IAAA;AAEgB,IAAA;AAEC,IAAA;AACF,MAAA;AACK,MAAA;AACpB,IAAA;AACiB,IAAA;AACE,MAAA;AACH,MAAA;AACI,MAAA;AACD,MAAA;AACnB,IAAA;AAEgC,IAAA;AACf,MAAA;AACC,MAAA;AACjB,IAAA;AACiB,IAAA;AACD,IAAA;AACD,IAAA;AACH,MAAA;AACM,MAAA;AACnB,IAAA;AACgB,IAAA;AAEE,IAAA;AACC,MAAA;AACC,MAAA;AACA,MAAA;AACpB,IAAA;AAEM,IAAA;AAKY,IAAA;AACC,MAAA;AACJ,MAAA;AACI,MAAA;AACJ,MAAA;AACG,MAAA;AACC,MAAA;AACF,MAAA;AACR,MAAA;AACK,QAAA;AACM,QAAA;AAClB,MAAA;AACF,IAAA;AACmB,IAAA;AACN,MAAA;AACO,MAAA;AACD,MAAA;AACnB,IAAA;AACoB,IAAA;AACd,IAAA;AACc,MAAA;AACD,MAAA;AACA,MAAA;AACA,MAAA;AACL,MAAA;AACG,MAAA;AACjB,IAAA;AAW0B,IAAA;AACX,MAAA;AACA,MAAA;AACI,MAAA;AACAA,MAAAA;AACb,MAAA;AACA,MAAA;AACO,MAAA;AACM,QAAA;AACC,QAAA;AACH,QAAA;AACD,QAAA;AACD,MAAA;AACE,QAAA;AACC,QAAA;AACT,MAAA;AACU,QAAA;AACR,QAAA;AACT,MAAA;AACgB,MAAA;AACC,MAAA;AACL,QAAA;AACE,QAAA;AACF,QAAA;AACH,QAAA;AACR,MAAA;AACe,MAAA;AACjB,IAAA;AACiB,IAAA;AAIAA,IAAAA;AAEJ,IAAA;AACE,IAAA;AACG,MAAA;AACD,MAAA;AAClB,IAAA;AAec,IAAA;AACK,IAAA;AAEF,IAAA;AACU,IAAA;AACT,MAAA;AAClB,IAAA;AACgB,IAAA;AACH,MAAA;AACF,MAAA;AACE,MAAA;AACE,QAAA;AACI,UAAA;AACA,UAAA;AACA,UAAA;AACL,YAAA;AACA,YAAA;AACA,YAAA;AACF,YAAA;AACM,YAAA;AACC,YAAA;AACL,YAAA;AACA,YAAA;AACA,YAAA;AACA,YAAA;AACI,YAAA;AACX,UAAA;AACKG,UAAAA;AAGA,UAAA;AACA,UAAA;AACE,YAAA;AACK,YAAA;AACC,cAAA;AACJ,cAAA;AACF,cAAA;AACK,cAAA;AACX,YAAA;AACF,UAAA;AACa,UAAA;AACA,UAAA;AACf,QAAA;AACJ,IAAA;AAEkB,IAAA;AACH,MAAA;AACG,MAAA;AAClB,IAAA;AACiB,IAAA;AACF,MAAA;AACE,MAAA;AACY,MAAA;AACb,MAAA;AACH,MAAA;AAEI,MAAA;AACT,MAAA;AACA,MAAA;AAEU,MAAA;AAEA,MAAA;AACD,MAAA;AACH,QAAA;AACI,UAAA;AACP,UAAA;AACQ,UAAA;AACF,UAAA;AACZ,QAAA;AACQ,MAAA;AACM,QAAA;AACF,QAAA;AACC,QAAA;AACD,QAAA;AACH,QAAA;AACK,UAAA;AAEA,UAAA;AACP,UAAA;AACe,UAAA;AACT,UAAA;AACE,UAAA;AACf,QAAA;AACH,MAAA;AACO,MAAA;AACT,IAAA;AACiB,IAAA;AAGG,IAAA;AACH,IAAA;AACQ,IAAA;AACA,IAAA;AACT,IAAA;AACT,MAAA;AACa,MAAA;AACF,MAAA;AAClB,IAAA;AACgB,IAAA;AACE,IAAA;AACF,IAAA;AACA,IAAA;AACA,MAAA;AACI,MAAA;AACpB,IAAA;AACgB,IAAA;AACD,MAAA;AACE,MAAA;AACf,MAAA;AACF,IAAA;AACgB,IAAA;AACD,MAAA;AACG,MAAA;AAChB,MAAA;AACF,IAAA;AACgB,IAAA;AACe,IAAA;AAChB,IAAA;AACCC,IAAAA;AACA,MAAA;AACG,MAAA;AACnB,IAAA;AACa,IAAA;AACI,IAAA;AACE,MAAA;AACA,MAAA;AACnB,IAAA;AACgB,IAAA;AACA,IAAA;AACH,MAAA;AACK,MAAA;AAClB,IAAA;AACgB,IAAA;AACE,MAAA;AACL,MAAA;AACC,QAAA;AACI,QAAA;AAChB,MAAA;AACU,MAAA;AACOJ,MAAAA;AACnB,IAAA;AAEiB,IAAA;AACE,MAAA;AACH,MAAA;AAChB,IAAA;AACgB,IAAA;AAE+C,IAAA;AAC9C,MAAA;AACC,MAAA;AACA,QAAA;AACD,QAAA;AACC,QAAA;AACD,QAAA;AACH,QAAA;AACM,QAAA;AACN,QAAA;AACX,MAAA;AACH,IAAA;AACgB,IAAA;AAGQ,IAAA;AACJ,MAAA;AACN,MAAA;AACI,MAAA;AACjB,IAAA;AACiB,IAAA;AACA,MAAA;AACP,QAAA;AACL,UAAA;AACY,YAAA;AACA,YAAA;AACZ,UAAA;AACS,UAAA;AACX,QAAA;AACJ,IAAA;AAEkB,IAAA;AAC6D,IAAA;AACtD,IAAA;AACN,IAAA;AACD,IAAA;AAID,IAAA;AACE,IAAA;AACA,MAAA;AACA,MAAA;AACN,MAAA;AACA,MAAA;AACL,MAAA;AACA,MAAA;AACQ,MAAA;AAGZ,MAAA;AAOH,IAAA;AAEiB,IAAA;AACN,MAAA;AACM,MAAA;AACE,MAAA;AACD,MAAA;AACC,MAAA;AACpB,IAAA;AAKoB,IAAA;AACA,MAAA;AACN,MAAA;AACF,MAAA;AACD,MAAA;AAGN,MAAA;AAEW,QAAA;AACA,QAAA;AACY,QAAA;AACE,QAAA;AACR,QAAA;AACA,QAAA;AACjB,MAAA;AACuB,MAAA;AACF,MAAA;AACR,MAAA;AACF,MAAA;AACE,QAAA;AACH,QAAA;AACD,QAAA;AACI,QAAA;AACD,QAAA;AACX,QAAA;AACA,QAAA;AACW,QAAA;AACN,UAAA;AACA,UAAA;AACD,UAAA;AACO,UAAA;AACb,UAAA;AACA,UAAA;AACW,UAAA;AACI,UAAA;AACV,UAAA;AACC,UAAA;AACD,UAAA;AACE,UAAA;AACT,QAAA;AACa,QAAA;AACD,QAAA;AACI,UAAA;AACJ,UAAA;AACA,UAAA;AAEC,UAAA;AACD,UAAA;AACL,QAAA;AAES,UAAA;AACN,YAAA;AAEA,YAAA;AACA,YAAA;AACK,YAAA;AACH,cAAA;AACA,cAAA;AACC,cAAA;AAGD,cAAA;AAIA,cAAA;AACD,gBAAA;AACA,gBAAA;AACK,gBAAA;AACV,cAAA;AAGM,cAAA;AACE,gBAAA;AACA,gBAAA;AACD,gBAAA;AAIC,gBAAA;AACJ,kBAAA;AACM,oBAAA;AACJ,oBAAA;AACA,oBAAA;AACI,oBAAA;AAEA,oBAAA;AACA,oBAAA;AACN,kBAAA;AACA,kBAAA;AACF,gBAAA;AACM,gBAAA;AACC,gBAAA;AACT,cAAA;AACM,cAAA;AACG,cAAA;AACX,YAAA;AACO,YAAA;AACT,UAAA;AACY,UAAA;AAEA,YAAA;AACJ,YAAA;AACA,YAAA;AACM,YAAA;AACH,YAAA;AACE,cAAA;AACC,cAAA;AACJ,cAAA;AACR,YAAA;AACK,UAAA;AACO,YAAA;AACH,YAAA;AACE,cAAA;AACA,cAAA;AACX,YAAA;AACF,UAAA;AACF,QAAA;AACgB,QAAA;AACD,UAAA;AACE,UAAA;AAEL,UAAA;AACA,UAAA;AACG,UAAA;AACA,UAAA;AACJ,UAAA;AACE,YAAA;AACG,YAAA;AACA,YAAA;AACA,YAAA;AACA,YAAA;AACH,YAAA;AACX,UAAA;AACa,UAAA;AACf,QAAA;AACU,QAAA;AACA,QAAA;AACE,QAAA;AACE,QAAA;AACC,QAAA;AACH,QAAA;AACd,MAAA;AACmB,MAAA;AACnB,IAAA;AAEY,IAAA;AACM,IAAA;AAChB,MAAA;AACe,MAAA;AACL,MAAA;AACI,MAAA;AACC,MAAA;AACG,QAAA;AAEF,QAAA;AACE,QAAA;AACL,QAAA;AACb,MAAA;AACF,IAAA;AACM,IAAA;AAEa,IAAA;AACD,IAAA;AAIF,IAAA;AACH,IAAA;AACgB,IAAA;AACb,IAAA;AACCI,IAAAA;AACD,MAAA;AACC,MAAA;AACjB,IAAA;AACmB,IAAA;AACF,IAAA;AACG,MAAA;AACA,MAAA;AACH,MAAA;AACE,MAAA;AACH,MAAA;AACG,MAAA;AACnB,IAAA;AACgB,IAAA;AACA,IAAA;AACI,MAAA;AACN,MAAA;AAEM,MAAA;AACD,MAAA;AACnB,IAAA;AACkBH,IAAAA;AACE,MAAA;AACJ,MAAA;AAChB,IAAA;AAGe,IAAA;AACA,IAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACC,MAAA;AACD,MAAA;AACH,MAAA;AACG,MAAA;AACJ,MAAA;AACA,MAAA;AACC,MAAA;AACG,MAAA;AACA,MAAA;AACnB,IAAA;AACkB,IAAA;AACF,IAAA;AAEE,IAAA;AAKD,IAAA;AACA,MAAA;AACE,MAAA;AACnB,IAAA;AAKeA,IAAAA;AAEA,MAAA;AACIA,MAAAA;AACA,MAAA;AACP,MAAA;AACO,MAAA;AACDI,MAAAA;AAClB,IAAA;AAC0B,IAAA;AACV,MAAA;AAChB,IAAA;AACiB,IAAA;AACD,IAAA;AACG,MAAA;AACA,MAAA;AACF,QAAA;AACA,QAAA;AACf,MAAA;AACF,IAAA;AAEgB,IAAA;AACG,MAAA;AACA,MAAA;AACH,MAAA;AACC,MAAA;AAEC,MAAA;AACT,MAAA;AACT,IAAA;AAEiB,IAAA;AACE,MAAA;AACD,MAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACnB,IAAA;AAGoB,IAAA;AACA,IAAA;AAEJ,IAAA;AACH,MAAA;AACA,MAAA;AACE,QAAA;AACI,QAAA;AACjB,MAAA;AACF,IAAA;AAEkB,IAAA;AACA,IAAA;AACD,IAAA;AACF,IAAA;AAI8D,IAAA;AAC9D,IAAA;AAEK,IAAA;AAEd,IAAA;AAEsB,IAAA;AAEV,IAAA;AACA,MAAA;AACP,QAAA;AACL,UAAA;AACW,YAAA;AACG,YAAA;AACA,YAAA;AACA,YAAA;AACH,YAAA;AACX,UAAA;AACS,UAAA;AACX,QAAA;AACJ,IAAA;AACoB,IAAA;AACA,MAAA;AACP,MAAA;AACG,MAAA;AACI,MAAA;AACD,MAAA;AACR,MAAA;AACX,IAAA;AAEgB,IAAA;AAEW,IAAA;AAGH,IAAA;AAIJ,IAAA;AACL,MAAA;AACN,MAAA;AACK,QAAA;AACI,QAAA;AACD,QAAA;AACG,QAAA;AAGlB,MAAA;AACF,IAAA;AAEc,IAAA;AACC,MAAA;AAEE,MAAA;AACC,MAAA;AACF,QAAA;AACC,QAAA;AACC,UAAA;AACC,UAAA;AACO,YAAA;AACR,YAAA;AACQ,YAAA;AACP,YAAA;AACD,YAAA;AACH,YAAA;AACT,UAAA;AACF,QAAA;AACU,QAAA;AACZ,MAAA;AACO,MAAA;AACT,IAAA;AAKoB,IAAA;AACJ,MAAA;AAEE,MAAA;AACH,MAAA;AACf,IAAA;AAUE,IAAA;AAKW,MAAA;AACE,QAAA;AACI,QAAA;AACjB,MAAA;AACO,MAAA;AACT,IAAA;AAEM,IAAA;AAOQ,MAAA;AACI,MAAA;AACD,MAAA;AACC,MAAA;AACR,QAAA;AACM,QAAA;AACE,QAAA;AACH,QAAA;AACK,QAAA;AAEF,QAAA;AACK,QAAA;AAIH,QAAA;AAIFC,QAAAA;AAGD,QAAA;AACU,UAAA;AACf,UAAA;AACK,UAAA;AACb,QAAA;AACF,MAAA;AACO,MAAA;AACT,IAAA;AAEkB,IAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACO,QAAA;AACT,UAAA;AACA,UAAA;AACZ,QAAA;AACgB,QAAA;AAClB,MAAA;AACO,MAAA;AACT,IAAA;AAEoB,IAAA;AACD,MAAA;AACN,MAAA;AACE,MAAA;AACK,MAAA;AACJ,MAAA;AACF,MAAA;AACI,MAAA;AAEV,MAAA;AACG,MAAA;AACH,MAAA;AACsB,MAAA;AAEtB,MAAA;AACQ,MAAA;AAEE,MAAA;AACH,MAAA;AACI,MAAA;AACC,MAAA;AAGD,MAAA;AACF,QAAA;AACC,QAAA;AAED,QAAA;AACE,QAAA;AAED,QAAA;AACE,QAAA;AACA,QAAA;AAClB,MAAA;AAEgB,MAAA;AAEA,MAAA;AACJ,QAAA;AACA,QAAA;AACK,QAAA;AACH,QAAA;AACA,QAAA;AAEN,QAAA;AACO,UAAA;AACG,UAAA;AACA,UAAA;AAChB,QAAA;AACsB,QAAA;AACb,UAAA;AACA,UAAA;AACT,QAAA;AACa,QAAA;AACG,QAAA;AAC2B,QAAA;AAC3B,UAAA;AACF,UAAA;AACA,UAAA;AAAiK;AAE/J,UAAA;AAAmI;AAEnI,UAAA;AAKhB,QAAA;AAEgB,QAAA;AAEN,UAAA;AACI,UAAA;AACI,UAAA;AACf,QAAA;AAEiB,QAAA;AAGN,QAAA;AACF,QAAA;AACI,UAAA;AACA,UAAA;AACR,UAAA;AACG,UAAA;AACT,UAAA;AACA,UAAA;AACA,UAAA;AACyC,UAAA;AACpC,UAAA;AACC,UAAA;AACR,QAAA;AAEe,QAAA;AACA,QAAA;AACF,QAAA;AACP,QAAA;AACS,UAAA;AACA,UAAA;AACA,UAAA;AACJ,UAAA;AACX,QAAA;AAEgB,QAAA;AACA,UAAA;AACD,UAAA;AACQ,UAAA;AACP,UAAA;AAER,UAAA;AAEG,UAAA;AACX,QAAA;AACe,QAAA;AACjB,MAAA;AAEe,MAAA;AACE,QAAA;AACL,QAAA;AACG,QAAA;AACD,QAAA;AACd,MAAA;AACc,MAAA;AACC,QAAA;AACD,QAAA;AACF,QAAA;AACA,QAAA;AAGC,QAAA;AACL,UAAA;AACQC,YAAAA;AACD,YAAA;AACb,UAAA;AACc,UAAA;AACF,YAAA;AACA,YAAA;AACF,UAAA;AACI,UAAA;AACD,UAAA;AACf,QAAA;AAGW,QAAA;AACK,UAAA;AAEA,UAAA;AACJ,UAAA;AACF,YAAA;AACF,YAAA;AACN,UAAA;AACF,QAAA;AAEE,QAAA;AAES,QAAA;AACG,UAAA;AACG,UAAA;AACF,UAAA;AACC,YAAA;AACJ,YAAA;AACA,YAAA;AACT,UAAA;AACD,UAAA;AACF,QAAA;AACc,QAAA;AACA,QAAA;AAEE,QAAA;AACN,QAAA;AACD,QAAA;AACO,QAAA;AACH,QAAA;AACA,QAAA;AACD,QAAA;AACI,QAAA;AACD,QAAA;AACjB,MAAA;AAEkB,MAAA;AAE8B,MAAA;AAC7B,MAAA;AACA,QAAA;AACA,QAAA;AACA,QAAA;AACD,QAAA;AACH,QAAA;AACE,QAAA;AACf,MAAA;AAEiB,MAAA;AAET,QAAA;AACJ,UAAA;AACF,QAAA;AACe,QAAA;AACA,QAAA;AACR,QAAA;AACT,MAAA;AAEM,MAAA;AACU,QAAA;AACF,QAAA;AACE,QAAA;AACF,QAAA;AACG,QAAA;AACF,QAAA;AACf,MAAA;AAOkB,MAAA;AACD,QAAA;AACJ,QAAA;AACG,QAAA;AACD,UAAA;AACC,UAAA;AACD,UAAA;AACE,UAAA;AACD,UAAA;AACE,UAAA;AACD,UAAA;AACA,UAAA;AACf,QAAA;AACgB,QAAA;AACH,UAAA;AACE,UAAA;AACD,UAAA;AACA,UAAA;AACD,UAAA;AACG,UAAA;AACH,UAAA;AACC,UAAA;AACE,UAAA;AACA,UAAA;AACH,UAAA;AACG,UAAA;AACF,UAAA;AACC,UAAA;AACN,UAAA;AACT,QAAA;AACgB,QAAA;AACV,QAAA;AACS,QAAA;AACD,QAAA;AACR,QAAA;AACM,UAAA;AACI,UAAA;AAEP,UAAA;AAGR,QAAA;AACY,QAAA;AAEG,QAAA;AACA,UAAA;AACF,YAAA;AACH,YAAA;AACT,UAAA;AACc,QAAA;AACJ,UAAA;AACH,UAAA;AACE,UAAA;AACX,QAAA;AACgB,QAAA;AAEJ,QAAA;AACD,QAAA;AACA,QAAA;AACK,QAAA;AACH,UAAA;AACC,UAAA;AACA,UAAA;AAED,UAAA;AACG,UAAA;AACR,UAAA;AACO,UAAA;AACA,UAAA;AACE,UAAA;AAAyD,YAAA;AAEpE,cAAA;AACQC,gBAAAA;AACC,gBAAA;AACR,cAAA;AACH,YAAA;AACF,UAAA;AACc,UAAA;AACR,UAAA;AAEH,UAAA;AAKM,YAAA;AACI,UAAA;AACD,UAAA;AACD,UAAA;AACF,UAAA;AACK,UAAA;AAChB,QAAA;AACa,QAAA;AACN,QAAA;AACT,MAAA;AAKgB,MAAA;AACC,QAAA;AAEA,QAAA;AACH,QAAA;AACI,QAAA;AACH,QAAA;AACA,QAAA;AACD,QAAA;AACH,QAAA;AACI,QAAA;AACS,QAAA;AACX,QAAA;AACI,UAAA;AACD,UAAA;AACD,UAAA;AACE,YAAA;AACHA,cAAAA;AACA,cAAA;AACF,cAAA;AACN,YAAA;AACJ,QAAA;AACc,QAAA;AACC,QAAA;AAEb,QAAA;AAIS,QAAA;AACG,QAAA;AACC,UAAA;AACA,UAAA;AACF,UAAA;AACA,UAAA;AACX,UAAA;AACF,QAAA;AACS,QAAA;AACM,QAAA;AACH,QAAA;AACd,MAAA;AAGgB,MAAA;AACC,QAAA;AACA,QAAA;AACA,QAAA;AACA,QAAA;AACH,QAAA;AACC,UAAA;AACX,UAAA;AACF,QAAA;AACa,QAAA;AACC,QAAA;AAEP,QAAA;AAIS,QAAA;AAClB,MAAA;AACiB,MAAA;AACnB,IAAA;AAGA,IAAA;AAIiB,MAAA;AACE,MAAA;AACD,MAAA;AACE,MAAA;AACP,MAAA;AACM,QAAA;AACA,QAAA;AACjB,MAAA;AACc,MAAA;AACZC,QAAAA;AACc,QAAA;AACP,QAAA;AACO,QAAA;AACF,QAAA;AACG,UAAA;AACF,UAAA;AACb,QAAA;AACF,MAAA;AACM,MAAA;AAEQ,MAAA;AACA,MAAA;AAChB,IAAA;AAIgC,IAAA;AAGd,MAAA;AACG,MAAA;AACH,QAAA;AACD,QAAA;AACA,QAAA;AACG,QAAA;AACE,QAAA;AAClB,MAAA;AACY,MAAA;AACG,MAAA;AACJC,MAAAA;AACE,MAAA;AACI,MAAA;AACJ,QAAA;AACK,QAAA;AAClB,MAAA;AACkB,MAAA;AACJ,MAAA;AACa,MAAA;AAEV,MAAA;AACH,MAAA;AACI,MAAA;AAEI,MAAA;AACd,QAAA;AACR,MAAA;AACa,MAAA;AACG,QAAA;AACA,QAAA;AACR,QAAA;AACC,QAAA;AACM,QAAA;AACP,QAAA;AACO,UAAA;AACA,UAAA;AACb,QAAA;AACe,QAAA;AACE,QAAA;AACZ,QAAA;AACC,QAAA;AACP,MAAA;AACiB,MAAA;AACJ,MAAA;AACW,MAAA;AACT,MAAA;AACjB,IAAA;AAIa,IAAA;AACI,IAAA;AACD,MAAA;AACF,MAAA;AACD,MAAA;AACA,QAAA;AACZ,QAAA;AACF,MAAA;AACiB,MAAA;AACF,MAAA;AACA,MAAA;AACC,QAAA;AACA,QAAA;AACC,UAAA;AACD,UAAA;AACE,YAAA;AACH,YAAA;AACA,YAAA;AACC,YAAA;AACZ,UAAA;AACO,UAAA;AACN,QAAA;AACY,QAAA;AACJ,QAAA;AACH,QAAA;AACM,UAAA;AACE,UAAA;AACd,UAAA;AACF,QAAA;AACF,MAAA;AAEY,MAAA;AACG,MAAA;AACH,MAAA;AACE,MAAA;AACQ,MAAA;AACC,MAAA;AACrB,QAAA;AACW,QAAA;AACE,QAAA;AACf,MAAA;AACiB,MAAA;AACL,MAAA;AACd,IAAA;AAIiB,IAAA;AACF,IAAA;AACc,IAAA;AAGR,MAAA;AACH,MAAA;AACF,MAAA;AAEV,MAAA;AAKK,MAAA;AACF,QAAA;AACH,QAAA;AACe,QAAA;AACA,QAAA;AACC,QAAA;AAChB,QAAA;AACc,QAAA;AACd,QAAA;AACgB,QAAA;AAClB,MAAA;AACD,IAAA;AACc,IAAA;AACC,MAAA;AACA,MAAA;AACT,MAAA;AACR,IAAA;AAC8B,IAAA;AACJ,IAAA;AACX,IAAA;AACE,MAAA;AACH,QAAA;AACE,QAAA;AACC,QAAA;AACC,QAAA;AACA,QAAA;AACC,QAAA;AAClB,MAAA;AAGgB,IAAA;AACJ,MAAA;AACM,QAAA;AACD,QAAA;AAChB,MAAA;AACH,IAAA;AACe,IAAA;AACC,IAAA;AACD,MAAA;AACH,MAAA;AACM,MAAA;AACA,MAAA;AAClB,IAAA;AACgB,IAAA;AACG,MAAA;AACC,MAAA;AACpB,IAAA;AAC2B,IAAA;AACG,IAAA;AACD,IAAA;AACb,IAAA;AACH,MAAA;AACK,QAAA;AACH,QAAA;AACc,QAAA;AACV,QAAA;AACC,QAAA;AACV,QAAA;AACU,QAAA;AACD,UAAA;AACA,UAAA;AACP,UAAA;AACQ,UAAA;AACF,UAAA;AACN,UAAA;AACO,UAAA;AACA,UAAA;AACT,UAAA;AACA,UAAA;AACC,UAAA;AACG,YAAA;AACA,YAAA;AACE,YAAA;AACF,YAAA;AACR,UAAA;AACY,UAAA;AACA,YAAA;AACH,YAAA;AACP,YAAA;AACM,YAAA;AACN,YAAA;AACA,YAAA;AACA,YAAA;AACY,YAAA;AACA,YAAA;AACA,YAAA;AACR,YAAA;AACA,YAAA;AACL,UAAA;AACH,QAAA;AACF,MAAA;AAGmC,IAAA;AACnB,IAAA;AACF,IAAA;AACN,MAAA;AACS,MAAA;AACD,MAAA;AACE,MAAA;AACpB,IAAA;AACyB,IAAA;AACL,MAAA;AACN,MAAA;AACH,MAAA;AACO,QAAA;AACE,QAAA;AAClB,MAAA;AACa,MAAA;AACD,MAAA;AACM,MAAA;AACJ,MAAA;AACI,MAAA;AACF,MAAA;AACjB,IAAA;AAC0B,IAAA;AAGX,IAAA;AACD,MAAA;AACC,MAAA;AACI,QAAA;AACF,QAAA;AACP,QAAA;AACR,MAAA;AACF,IAAA;AACyB,IAAA;AACX,MAAA;AACI,MAAA;AACC,QAAA;AACH,QAAA;AACF,QAAA;AACG,QAAA;AACF,QAAA;AACE,QAAA;AACE,QAAA;AACH,QAAA;AACE,QAAA;AACTC,QAAAA;AACSA,QAAAA;AACT,QAAA;AACO,QAAA;AACA,QAAA;AACP,QAAA;AACC,QAAA;AACL,UAAA;AACQ,YAAA;AACA,YAAA;AACG,YAAA;AACD,YAAA;AACF,YAAA;AACI,YAAA;AACE,YAAA;AACZ,YAAA;AACS,YAAA;AACH,YAAA;AACG,YAAA;AACL,YAAA;AACN,UAAA;AACF,QAAA;AACD,MAAA;AACF,IAAA;AAGgB,IAAA;AACmB,IAAA;AACnB,MAAA;AACR,MAAA;AACI,QAAA;AACD,QAAA;AACC,QAAA;AACD,QAAA;AACF,QAAA;AACG,QAAA;AACK,QAAA;AACN,QAAA;AACO,QAAA;AACf,QAAA;AACK,QAAA;AACW,QAAA;AACA,QAAA;AAClB,MAAA;AACD,IAAA;AAC6B,IAAA;AAC5BV,MAAAA;AACY,MAAA;AACH,MAAA;AACC,MAAA;AAGI,QAAA;AACK,QAAA;AAChB,MAAA;AACH,IAAA;AACwB,IAAA;AAErB,MAAA;AAES,QAAA;AACF,QAAA;AACE,QAAA;AACF,QAAA;AACE,QAAA;AACO,QAAA;AACP,QAAA;AACO,QAAA;AACF,QAAA;AACb,MAAA;AACN,IAAA;AAEmC,IAAA;AACnB,IAAA;AACE,MAAA;AACF,QAAA;AACI,QAAA;AACF,UAAA;AACJ,YAAA;AACF,YAAA;AACO,YAAA;AACD,YAAA;AACA,YAAA;AACE,YAAA;AACA,YAAA;AACD,YAAA;AACb,UAAA;AACJ,MAAA;AAG2B,IAAA;AACT,IAAA;AACF,MAAA;AACE,MAAA;AACJ,MAAA;AACF,MAAA;AACA,MAAA;AACU,MAAA;AACT,MAAA;AACL,QAAA;AACS,QAAA;AACF,QAAA;AACA,QAAA;AACE,QAAA;AACA,QAAA;AACH,QAAA;AACF,UAAA;AACA,UAAA;AACD,UAAA;AACA,UAAA;AACP,UAAA;AACM,UAAA;AACQ,UAAA;AACH,UAAA;AACD,UAAA;AACV,UAAA;AACA,UAAA;AACA,UAAA;AACY,UAAA;AACZA,UAAAA;AACA,UAAA;AACW,UAAA;AACD,UAAA;AACX,QAAA;AACH,MAAA;AACF,IAAA;AAGqC,IAAA;AACrB,IAAA;AACH,MAAA;AACK,MAAA;AACA,MAAA;AACF,MAAA;AACF,MAAA;AACC,MAAA;AACC,MAAA;AACE,MAAA;AACD,QAAA;AACP,QAAA;AACU,QAAA;AACX,UAAA;AACI,UAAA;AACD,UAAA;AACA,UAAA;AACQ,UAAA;AACA,UAAA;AACT,UAAA;AACC,UAAA;AACO,UAAA;AACC,UAAA;AACA,UAAA;AACJ,UAAA;AACV,UAAA;AACA,UAAA;AACD,QAAA;AACH,MAAA;AACF,IAAA;AAG6B,IAAA;AACT,IAAA;AACJ,MAAA;AACA,MAAA;AACI,QAAA;AACF,QAAA;AACC,QAAA;AACD,QAAA;AACF,QAAA;AACI,QAAA;AACD,UAAA;AACC,UAAA;AACA,UAAA;AACF,UAAA;AACN,UAAA;AACK,UAAA;AACA,UAAA;AACE,YAAA;AACL,YAAA;AACA,YAAA;AACA,YAAA;AACA,YAAA;AACA,YAAA;AACAW,YAAAA;AACA,YAAA;AACA,YAAA;AACM,YAAA;AACH,cAAA;AACJ,cAAA;AACI,cAAA;AACF,cAAA;AACL,cAAA;AACA,cAAA;AACM,cAAA;AACN,cAAA;AACA,cAAA;AACA,cAAA;AACO,cAAA;AACP,cAAA;AACIA,cAAAA;AACD,cAAA;AACJ,YAAA;AACD,YAAA;AACF,UAAA;AACU,UAAA;AACG,UAAA;AACT,UAAA;AACAC,UAAAA;AACA,UAAA;AACQ,UAAA;AAEJ,YAAA;AACK,YAAA;AACL,YAAA;AACA,YAAA;AACK,YAAA;AACL,YAAA;AACR,UAAA;AACY,UAAA;AACP,YAAA;AACH,YAAA;AACA,YAAA;AACM,YAAA;AACN,YAAA;AACA,YAAA;AACA,YAAA;AAAA;AAEY,YAAA;AACN,YAAA;AACKA,YAAAA;AACR,YAAA;AACJ,UAAA;AACH,QAAA;AACD,MAAA;AACH,IAAA;AAKsB,IAAA;AACJ,MAAA;AACb,MAAA;AACQ,MAAA;AACA,MAAA;AACA,MAAA;AAAmE;AAE5D,MAAA;AACH,MAAA;AACC,QAAA;AACA,QAAA;AACf,MAAA;AACa,MAAA;AAChB,IAAA;AACmD,IAAA;AAC/B,MAAA;AACJ,MAAA;AACE,MAAA;AACH,MAAA;AACE,MAAA;AACF,MAAA;AACC,QAAA;AACH,QAAA;AACV,MAAA;AACH,IAAA;AACkB,IAAA;AACQ,IAAA;AAMN,IAAA;AAEJX,IAAAA;AACE,MAAA;AACA,MAAA;AACK,MAAA;AACP,MAAA;AACI,MAAA;AACD,MAAA;AACF,QAAA;AACD,UAAA;AACA,UAAA;AACI,UAAA;AAChB,QAAA;AACe,MAAA;AACnB,IAAA;AACgB,IAAA;AACA,MAAA;AACP,MAAA;AACF,QAAA;AACH,QAAA;AACA,QAAA;AACY,QAAA;AACD,QAAA;AACG,QAAA;AACd,QAAA;AACG,QAAA;AACL,MAAA;AACF,IAAA;AAC2B,IAAA;AACV,IAAA;AAEuF,IAAA;AAGzF,IAAA;AACA,MAAA;AACK,QAAA;AACH,UAAA;AACE,0BAAA;AACf,QAAA;AACF,MAAA;AAGkB,IAAA;AACA,MAAA;AACV,MAAA;AACQ,MAAA;AACA,MAAA;AACD,QAAA;AACG,QAAA;AACD,QAAA;AACP,QAAA;AACK,QAAA;AACD,QAAA;AACI,UAAA;AACd,UAAA;AACF,QAAA;AACgB,QAAA;AACJ,QAAA;AACU,QAAA;AACL,UAAA;AACH,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AACd,QAAA;AACW,QAAA;AACA,QAAA;AACE,wBAAA;AACf,MAAA;AACF,IAAA;AAIgB,IAAA;AACE,MAAA;AACD,QAAA;AACF,QAAA;AACE,QAAA;AACD,QAAA;AACI,UAAA;AACd,UAAA;AACF,QAAA;AACgB,QAAA;AACJ,QAAA;AACW,QAAA;AACP,QAAA;AAEA,QAAA;AACD,UAAA;AACA,UAAA;AACD,UAAA;AAGd,QAAA;AACgB,QAAA;AAGA,QAAA;AACR,UAAA;AACA,UAAA;AACK,UAAA;AACb,QAAA;AAEgB,QAAA;AAEH,QAAA;AACC,QAAA;AACH,QAAA;AACA,QAAA;AACE,wBAAA;AACf,MAAA;AAG+B,IAAA;AAC5B,IAAA;AACa,MAAA;AACD,QAAA;AACE,QAAA;AACJ,QAAA;AACK,UAAA;AACT,UAAA;AACQ,UAAA;AACC,UAAA;AAChB,QAAA;AACM,QAAA;AACK,QAAA;AACC,UAAA;AACJ,UAAA;AACO,UAAA;AACC,UAAA;AACJ,UAAA;AACJ,UAAA;AACI,UAAA;AACE,UAAA;AACD,UAAA;AACG,UAAA;AACF,UAAA;AACU,UAAA;AACR,YAAA;AACP,YAAA;AACA,YAAA;AACK,YAAA;AACA,YAAA;AACA,YAAA;AACZ,UAAA;AACW,UAAA;AACE,0BAAA;AACC,UAAA;AACR,UAAA;AACQ,UAAA;AACF,UAAA;AACJ,YAAA;AACH,YAAA;AACM,YAAA;AACD,YAAA;AACF,YAAA;AACK,YAAA;AACX,YAAA;AACM,YAAA;AACO,YAAA;AACT,YAAA;AACL,UAAA;AACU,UAAA;AACb,QAAA;AACF,MAAA;AAC4B,IAAA;AAIF,IAAA;AACX,MAAA;AACG,MAAA;AACpB,IAAA;AAEgB,IAAA;AACE,MAAA;AACb,MAAA;AAEQ,MAAA;AAEQ,QAAA;AACC,QAAA;AACA,QAAA;AACjB,MAAA;AACgB,MAAA;AACrB,IAAA;AACK,IAAA;AACe,MAAA;AACF,QAAA;AACJ,QAAA;AACK,QAAA;AACF,QAAA;AACC,QAAA;AACE,QAAA;AAEH,QAAA;AACG,QAAA;AACR,QAAA;AACO,QAAA;AACC,QAAA;AAGF,QAAA;AACA,QAAA;AAEE,QAAA;AACL,UAAA;AACG,UAAA;AACL,UAAA;AACT,QAAA;AAEe,QAAA;AACC,QAAA;AAEA,QAAA;AAEN,UAAA;AACG,YAAA;AACA,YAAA;AACX,UAAA;AACM,UAAA;AACF,UAAA;AACO,UAAA;AACb,QAAA;AACa,QAAA;AACF,QAAA;AACb,MAAA;AAG+B,IAAA;AACd,MAAA;AACH,MAAA;AACE,MAAA;AACF,MAAA;AACD,MAAA;AACI,MAAA;AACH,MAAA;AACG,MAAA;AACK,MAAA;AACL,QAAA;AACD,QAAA;AACCF,QAAAA;AACD,QAAA;AAChB,MAAA;AACW,MAAA;AACO,sBAAA;AACF,MAAA;AACF,MAAA;AACA,MAAA;AACG,MAAA;AAClB,IAAA;AAGa,IAAA;AACI,MAAA;AACR,MAAA;AACU,MAAA;AACA,MAAA;AACD,MAAA;AACD,MAAA;AACjB,IAAA;AAGe,IAAA;AACmC,IAAA;AAC/B,MAAA;AACJ,MAAA;AACE,MAAA;AACD,MAAA;AACjB,IAAA;AACkB,IAAA;AACC,IAAA;AACA,IAAA;AACD,IAAA;AAEJ,IAAA;AACA,MAAA;AACI,MAAA;AACD,QAAA;AACG,QAAA;AACR,QAAA;AACM,QAAA;AACE,UAAA;AACH,UAAA;AACA,UAAA;AACZ,QAAA;AACH,MAAA;AACc,MAAA;AAChB,IAAA;AAEO,IAAA;AACC,MAAA;AACO,MAAA;AACN,MAAA;AACC,MAAA;AACE,MAAA;AACF,MAAA;AACI,MAAA;AACJ,MAAA;AACC,MAAA;AACC,MAAA;AACD,MAAA;AACD,MAAA;AACD,MAAA;AACP,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACS,MAAA;AACT,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACO,MAAA;AACP,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACF,IAAA;AAEmC,IAAA;AACjB,MAAA;AACC,MAAA;AACnB,IAAA;AACF,EAAA;AAGoB,EAAA;AACE,IAAA;AACH,MAAA;AACA,MAAA;AACD,MAAA;AAChB,IAAA;AACO,IAAA;AACT,EAAA;AACF;Ab+LwB;AACA;Acr0Hc;AASxB;AACP,EAAA;AACA,EAAA;AACC,EAAA;AACA,EAAA;AACC,EAAA;AACC,EAAA;AACH,EAAA;AACC,EAAA;AACA,EAAA;AACC,EAAA;AACC,EAAA;AACF,EAAA;AACG,EAAA;AACF,EAAA;AACA,EAAA;AACD,EAAA;AACA,EAAA;AACC,EAAA;AACT;AAGwB;AAoCC;AACD,EAAA;AACA,EAAA;AACe,EAAA;AACrB,EAAA;AACS,EAAA;AAEA,EAAA;AACI,EAAA;AAED,EAAA;AACP,EAAA;AAEO,IAAA;AAEA,IAAA;AAEX,IAAA;AACC,IAAA;AACE,MAAA;AACT,QAAA;AACS,UAAA;AACE,UAAA;AACD,YAAA;AACA,YAAA;AACC,YAAA;AACd,UAAA;AACA,UAAA;AACG,QAAA;AACU,QAAA;AACD,UAAA;AACE,UAAA;AACF,UAAA;AACF,UAAA;AACJ,UAAA;AACQ,YAAA;AACN,YAAA;AACA,YAAA;AAEI,YAAA;AACH,cAAA;AACK,cAAA;AACA,YAAA;AACZ,YAAA;AACF,UAAA;AACc,UAAA;AACR,UAAA;AACK,UAAA;AACY,UAAA;AACZ,UAAA;AACC,UAAA;AACZ,UAAA;AACF,QAAA;AACK,QAAA;AACW,UAAA;AACA,YAAA;AACd,UAAA;AACG,QAAA;AACU,UAAA;AACb,UAAA;AACG,QAAA;AACS,UAAA;AACZ,UAAA;AACG,QAAA;AACS,UAAA;AACZ,UAAA;AACG,QAAA;AAEQ,UAAA;AACX,UAAA;AACF,QAAA;AACE,UAAA;AACJ,MAAA;AACF,IAAA;AACgB,IAAA;AACjB,EAAA;AACoB,EAAA;AACvB;AAMmB;AAsBS;AACP,EAAA;AACU,EAAA;AACT,EAAA;AACF,EAAA;AACX,EAAA;AAAA;AAEL,IAAA;AACA,IAAA;AACA,IAAA;AACiB,IAAA;AACjB,IAAA;AACe,IAAA;AACf,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACe,IAAA;AAAe;AAE9B,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAA;AAEA,IAAA;AACA,IAAA;AACA,IAAA;AAAoD;AAEpD,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAA4L;AAE5L,IAAA;AACA,IAAA;AAAmF;AAEnF,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACgB,IAAA;AAChB,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACO,EAAA;AACX;AAGwB;AACH,EAAA;AACX,EAAA;AACU,EAAA;AACP,EAAA;AACS,EAAA;AACC,EAAA;AACvB;AAU+B;AACT,EAAA;AACE,EAAA;AACF,EAAA;AACA,EAAA;AACJ,EAAA;AAEK,EAAA;AACH,EAAA;AACA,EAAA;AACJ,EAAA;AACK,EAAA;AACA,EAAA;AACJ,EAAA;AACK,EAAA;AACE,EAAA;AACJ,EAAA;AACA,EAAA;AACJ,EAAA;AACQ,EAAA;AAER,EAAA;AACG,IAAA;AACA,IAAA;AACS,IAAA;AACP,IAAA;AACV,IAAA;AACT,EAAA;AAEgC,EAAA;AACf,IAAA;AACA,IAAA;AACC,IAAA;AACT,IAAA;AACT,EAAA;AACiBc,EAAAA;AACC,IAAA;AACA,IAAA;AACJ,IAAA;AACOA,IAAAA;AACAA,IAAAA;AACD,IAAA;AACJ,MAAA;AACI,MAAA;AACT,MAAA;AACT,IAAA;AACkB,IAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACJ,MAAA;AACE,QAAA;AACD,QAAA;AACL,QAAA;AACT,MAAA;AACiB,MAAA;AACA,MAAA;AACV,MAAA;AACT,IAAA;AACmB,IAAA;AACA,IAAA;AACF,IAAA;AACA,IAAA;AACC,IAAA;AACC,IAAA;AACH,IAAA;AACT,IAAA;AACT,EAAA;AAEiB,EAAA;AACA,EAAA;AACK,EAAA;AACA,EAAA;AACL,EAAA;AAEA,EAAA;AAEa,EAAA;AACb,IAAA;AACA,IAAA;AACK,IAAA;AACA,IAAA;AACH,IAAA;AACD,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACC,IAAA;AACJ,IAAA;AACM,IAAA;AACA,IAAA;AACZ,IAAA;AACT,EAAA;AAEkB,EAAA;AACD,IAAA;AACK,IAAA;AACA,IAAA;AACL,IAAA;AACA,IAAA;AACR,IAAA;AACT,EAAA;AAEI,EAAA;AAC0B,EAAA;AACvB,EAAA;AACL,IAAA;AACc,IAAA;AACE,MAAA;AACJ,QAAA;AACQ,QAAA;AAClB,MAAA;AACM,MAAA;AACQ,MAAA;AACA,MAAA;AACT,MAAA;AACM,QAAA;AACA,QAAA;AACX,MAAA;AAE8B,MAAA;AAC1BhB,MAAAA;AACc,MAAA;AACD,QAAA;AACT,QAAA;AACM,QAAA;AACJ,QAAA;AACK,UAAA;AACJ,UAAA;AACP,UAAA;AACF,QAAA;AACK,QAAA;AACQ,QAAA;AACA,UAAA;AACN,UAAA;AACMA,UAAAA;AACb,QAAA;AACY,QAAA;AACd,MAAA;AACM,MAAA;AACR,IAAA;AACF,EAAA;AACF;AdquHwB;AACA;Ae3oIoB;AAAA;AAE5B,EAAA;AAA+E;AAE3E,EAAA;AAEd,IAAA;AACmB,IAAA;AACP,IAAA;AACb,EAAA;AAAA;AAEY,EAAA;AAA6C;AAE5C,EAAA;AAClB;Af4oIwB;AACA;AACA;AACA","file":"/Users/cardene/Desktop/projects/dragon-3711-release-0-75-0/packages/dragon/dist/light/pipe-EZX6P3SM.cjs","sourcesContent":[null,"/**\n * 換算の描き方 (#3389、#3398)。\n *\n * `calc` を行う関係者が 2 つ以上の槽を持つ時、最初の 2 つの槽の間に変換器を置き、短い管で両方の槽と結ぶ。\n * 変換器は全ての段に置き、計算した段だけ値の色で光る。入る値と出る値と比率は、その段の吹き出しが大きく書く。\n * この file は配管の図を描く部品 (`render/pipe.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeConverter } from \"../../kinds/pipe/layout\";\nimport { PIPE_LOOK } from \"../../look/pipe\";\nimport { r1 } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\n\n/** 変換器の印の大きさの元。印は半径がこの値の時の形で書き、半径に合わせて縮める */\nconst BASE = PIPE_LOOK.converter.r;\n\n/** 変換器。`attrs` は部品の印 */\nexport function converter(c: PipeConverter, attrs: string): string {\n const k = c.r / BASE;\n const at = (x: number, y: number): string => `${r1(c.cx + x * k)} ${r1(c.cy + y * k)}`;\n const swirl = `M ${at(-13, -7)} A ${r1(14 * k)} ${r1(14 * k)} 0 0 1 ${at(11, -10)} M ${at(13, 7)} A ${r1(14 * k)} ${r1(14 * k)} 0 0 1 ${at(-11, 10)}`;\n const tips = `M ${at(11, -16)} L ${at(12, -9)} L ${at(5, -10)} Z M ${at(-11, 16)} L ${at(-12, 9)} L ${at(-5, 10)} Z`;\n return (\n `<g${attrs} class=\"dg-pp-conv${c.active ? \" dg-pp-cur\" : \"\"}\" style=\"${cs(c.active ? \"amber\" : \"slate\")}\">` +\n `<path class=\"dg-pp-cstub\" d=\"M ${r1(c.left)} ${r1(c.cy)} H ${r1(c.cx - c.r)} M ${r1(c.cx + c.r)} ${r1(c.cy)} H ${r1(c.right)}\"/>` +\n `<circle class=\"dg-pp-cface\" cx=\"${r1(c.cx)}\" cy=\"${r1(c.cy)}\" r=\"${r1(c.r)}\"/><path class=\"dg-pp-cswirl\" d=\"${swirl}\"/><path class=\"dg-pp-ctip\" d=\"${tips}\"/></g>`\n );\n}\n","/**\n * 配管の図の弁が描く形を囲む四角と、取っ手の向き (#3418)。\n *\n * 弁は管の上の 2 つの三角 (胴) と、管から立つ軸と、軸の先の取っ手で描く (`blocks/hold/draw.ts` の `valve`)。\n * 取っ手は閉じた時に管と直角に立ち、開いた時に管の向きに倒れるため、両方の向きの四角を持つ。\n * 軸と取っ手は管の上 (縦の管は右) に立て、上の側にほかの線が通る弁は下 (縦の管は左) に立てる (`under`)。\n * 並べ方 (`kinds/pipe/layout.ts`) は弁の置き場所をほかの線から離す時に、決まりの表 (`pipe-rules.ts`) は弁とほかの線の間を測る時に、同じ四角を読む\n */\nimport type { Point, Rect } from \"./layout/scene\";\nimport { PIPE_LOOK } from \"./look/pipe\";\n\nconst V = PIPE_LOOK.valve;\n\n/** 取っ手の軸の点。管から `stem` 離れた所 */\nexport function valvePivot(x: number, y: number, vertical: boolean, under: boolean): Point {\n const s = under ? -1 : 1;\n return vertical ? [x + s * V.stem, y] : [x, y - s * V.stem];\n}\n\n/** 取っ手の向き (度)。閉じた取っ手は管と直角に外へ立ち、開いた取っ手は管の向き (横の管は右、縦の管は下) に倒れる */\nexport function valveLever(vertical: boolean, opened: boolean, under: boolean): number {\n if (opened) return vertical ? 90 : 0;\n if (vertical) return under ? 180 : 0;\n return under ? 90 : -90;\n}\n\n/** 弁の胴と、軸と閉じた取っ手と、開いた取っ手を囲む四角 */\nexport function valveRects(x: number, y: number, vertical: boolean, under = false): Rect[] {\n const h = V.leverH / 2;\n const [px, py] = valvePivot(x, y, vertical, under);\n const reach = V.stem + V.lever - h;\n if (vertical)\n return [\n { x: x - V.half, y: y - V.r, w: V.half * 2, h: V.r * 2 },\n under ? { x: x - reach, y: y - h, w: reach, h: V.leverH } : { x, y: y - h, w: reach, h: V.leverH },\n { x: px - h, y: py - h, w: V.leverH, h: V.lever },\n ];\n return [\n { x: x - V.r, y: y - V.half, w: V.r * 2, h: V.half * 2 },\n under ? { x: x - h, y, w: V.leverH, h: reach } : { x: x - h, y: y - reach, w: V.leverH, h: reach },\n { x: px - h, y: py - h, w: V.lever, h: V.leverH },\n ];\n}\n","/**\n * 取り消しの描き方 (#3389、#3398)。\n *\n * `revert` の段で、落ちた呼び出しの内側の変更 (槽、値の札、イベント、流れた分) は取り消しの印を付けて元の値へ戻る。\n * 戻った槽は桃色の縁で描き、取り消す前の水位に桃色の点線を引く。落ちた理由は、その段の吹き出しが桃色の縁で大きく書く。\n * この file は槽の描き方 (`hold/draw.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport { r1 } from \"../../render/parts\";\n\n/** 取り消す前の水位の線。槽の左の外から右の外まで */\nexport const undoneMark = (x1: number, x2: number, y: number): string =>\n `<line class=\"dg-pp-mark dg-pp-mark-rolled\" x1=\"${r1(x1)}\" y1=\"${r1(y)}\" x2=\"${r1(x2)}\" y2=\"${r1(y)}\"/>`;\n","/**\n * 槽と値の管の描き方 (#3389、#3398)。\n *\n * 残高は持ち主の槽で描く。ガラスの中に、つやと 5 本の目盛りとトークンの名前を描き、水位は量に比例させ、液の色はトークンごとに分ける。\n * 槽の下に 3 桁ごとに区切った大きな数 (今の残高) を書き、変わった段から確定するまで、その下に増えた分か減った分と暫定の語を添える。確定した段は確定の語を添える (#3418)。\n * 暫定の槽は増えた分を斜線で、減った分を点線の枠で示し、前の水位に点線を引く。確定した槽は緑の縁、取り消した槽は桃色の縁で描く。\n * 値の管は、持ち主の槽の横の口どうしを結ぶ折れ線で描く (#3418)。トークンの Contract は箱で描き、管の弁の真上に置いて軸で結ぶ。\n * `move` と `[value]` で流れた分は管に沿った点線と向きの印で描き、流れた段は斜線の液の塊が管を通り抜ける。暫定か確定かは管に残さず、点線か実線かと槽の斜線で示す。\n * 弁は 2 つの三角を向かい合わせた形で、取っ手が開くと管の向きに倒れる。弁と計器と名札は呼び出しの管と値の管の両方が使う。\n * 角を落とす色味 (#3344) では、槽とトークンの箱の右上と左下を落とし、つやと取っ手の角を丸めない。\n * この file は配管の図を描く部品 (`render/pipe.ts`) と配管の図のブロックの描き方だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeFlow, PipeLevel, PipeParty, PipeState, PipeTank, PipeText } from \"../../kinds/pipe/layout\";\nimport type { Point, Rect } from \"../../layout/scene\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport { valveLever, valvePivot } from \"../../pipe-valve\";\nimport { EASE, MOTION, type TextStyle } from \"../../look/values\";\nimport { frameShape, partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport type { Frame } from \"../../render/motion\";\nimport { type Ctx, r1, write } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport { undoneMark } from \"../revert/draw\";\n\nconst P = PIPE_LOOK;\nconst T = PIPE_TYPE;\n\n/** 印ごとの色の役。変わっていない物と暫定の物は値の色 */\nexport const STATE_COLOR = { none: \"amber\", provisional: \"amber\", final: \"green\", rolled: \"rose\" } as const satisfies Record<PipeState, string>;\n\n/** 図の中の定義の名札。図ごとに分ける */\nexport const defId = (ctx: Ctx, what: string): string => `dg-p${what}-${ctx.id}`;\n/** 槽の内側を切り抜く形の名札 */\nconst clipId = (ctx: Ctx, t: Pick<PipeTank, \"party\" | \"token\">): string => defId(ctx, `c-${`${t.party}-${t.token}`.replace(/[^\\w-]/gu, \"_\")}`);\n\n/**\n * 配管の図の定義。地の点、トークンの液の色ごとの斜線、液の深さの陰、丸の名札の色の移り、槽の内側の切り抜き。\n * 液の色は `--pp-tone<番号>` の変数で、配管の図の規則 (`render/pipe.ts`) が値の色から作る\n */\nexport function pipeDefs(ctx: Ctx, tanks: readonly PipeTank[]): string {\n const s = P.flow.stripe;\n const hatches = [0, 1, 2]\n .map(\n (k) =>\n `<pattern id=\"${defId(ctx, `h${k}`)}\" width=\"${s}\" height=\"${s}\" patternUnits=\"userSpaceOnUse\" patternTransform=\"rotate(45)\">` +\n `<rect class=\"dg-pp-hb\" style=\"--pp-t:var(--pp-tone${k})\" width=\"${s}\" height=\"${s}\"/><line class=\"dg-pp-hl\" style=\"--pp-t:var(--pp-tone${k})\" x1=\"0\" y1=\"0\" x2=\"0\" y2=\"${s}\"/></pattern>`,\n )\n .join(\"\");\n const top = Math.min(...tanks.map((t) => t.y), 0);\n const bottom = Math.max(...tanks.map((t) => t.y + t.h), 1);\n const clips = tanks\n .map((t) => {\n const pad = P.tank.pad;\n const inner = { x: t.x + pad, y: t.y + pad, w: t.w - pad * 2, h: t.h - pad * 2 };\n return `<clipPath id=\"${clipId(ctx, t)}\">${frameShape(ctx.corner, \"\", inner, `<rect x=\"${r1(inner.x)}\" y=\"${r1(inner.y)}\" width=\"${r1(inner.w)}\" height=\"${r1(inner.h)}\" rx=\"${P.tank.innerRadius}\"/>`)}</clipPath>`;\n })\n .join(\"\");\n return (\n `<pattern id=\"${defId(ctx, \"grid\")}\" width=\"${P.grid.step}\" height=\"${P.grid.step}\" patternUnits=\"userSpaceOnUse\"><circle class=\"dg-pp-gdot\" cx=\"${P.grid.dot}\" cy=\"${P.grid.dot}\" r=\"${P.grid.dot}\"/></pattern>` +\n hatches +\n `<linearGradient id=\"${defId(ctx, \"deep\")}\" gradientUnits=\"userSpaceOnUse\" x1=\"0\" y1=\"${r1(top)}\" x2=\"0\" y2=\"${r1(bottom)}\"><stop offset=\"0\" class=\"dg-pp-d0\"/><stop offset=\"1\" class=\"dg-pp-d1\"/></linearGradient>` +\n `<linearGradient id=\"${defId(ctx, \"av\")}\" x1=\"0\" y1=\"0\" x2=\"1\" y2=\"1\"><stop offset=\"0\" class=\"dg-pp-a0\"/><stop offset=\"1\" class=\"dg-pp-a1\"/></linearGradient>` +\n clips\n );\n}\n\n/** 地の点 */\nexport const grid = (ctx: Ctx, width: number, height: number): string =>\n `<rect class=\"dg-pp-grid\" fill=\"url(#${defId(ctx, \"grid\")})\" x=\"0\" y=\"0\" width=\"${r1(width)}\" height=\"${r1(height)}\"/>`;\n\n/** 字。並べ方が字の大きさを替えた時 (狭い枠の大きな字) は、その大きさを字に書く */\nexport function sizedText(ctx: Ctx, cls: string, t: PipeText, style: TextStyle, shown: Shown[]): string {\n const drawn = write(ctx.ink, cls, t.x, t.base, t.text, { ...style, size: t.h }, shown);\n return Math.abs(t.h - style.size) < 0.05 ? drawn : drawn.replace(\"<text \", `<text style=\"font-size:${r1(t.h)}px\" `);\n}\n\n/** 四角 */\nconst rect = (cls: string, r: Rect, radius: number, extra = \"\"): string =>\n `<rect class=\"${cls}\" x=\"${r1(r.x)}\" y=\"${r1(r.y)}\" width=\"${r1(Math.max(0, r.w))}\" height=\"${r1(Math.max(0, r.h))}\" rx=\"${radius}\"${extra}/>`;\n/** 箱の形。角を落とす色味では右上と左下を落とした形で描く */\nconst frame = (ctx: Ctx, cls: string, r: Rect, radius: number, extra = \"\"): string => frameShape(ctx.corner, ` class=\"${cls}\"${extra}`, r, rect(cls, r, radius, extra));\n\n/**\n * 槽。ガラスと、中に入れる水 (`inside`) と、液の深さの陰と、つやと目盛りとトークンの名前。\n * `edge` は縁の色 (`final` は確定、`rolled` は取り消し、空は変わらない縁)\n */\nexport function tank(t: PipeTank, edge: \"final\" | \"rolled\" | \"\", inside: string, ctx: Ctx, shown: Shown[], attrs: string): string {\n const h = t.h;\n const ticks = Array.from({ length: P.tank.tick.count - 1 }, (_, k) => {\n const y = t.y + ((k + 1) * h) / P.tank.tick.count;\n return `<line class=\"dg-pp-tick\" data-pipe-tick=\"\" x1=\"${r1(t.x + t.w - P.tank.tick.from)}\" y1=\"${r1(y)}\" x2=\"${r1(t.x + t.w - P.tank.tick.to)}\" y2=\"${r1(y)}\"/>`;\n }).join(\"\");\n const pad = P.tank.pad;\n return (\n `<g${attrs}${edge ? ` style=\"${cs(edge === \"final\" ? \"green\" : \"rose\")}\"` : \"\"}>` +\n frame(ctx, `dg-pp-glass${edge ? \" dg-pp-glass-on\" : \"\"}`, t, P.tank.radius) +\n inside +\n `<rect class=\"dg-pp-deep\" fill=\"url(#${defId(ctx, \"deep\")})\" clip-path=\"url(#${clipId(ctx, t)})\" x=\"${r1(t.x + pad)}\" y=\"${r1(t.y + pad)}\" width=\"${r1(t.w - pad * 2)}\" height=\"${r1(h - pad * 2)}\"/>` +\n rect(\"dg-pp-shine\", { x: t.x + P.tank.shine.x, y: t.y + P.tank.shine.y, w: P.tank.shine.w, h: h - P.tank.shine.short }, partRadius(ctx.corner, P.tank.shine.w / 2), ' data-pipe-shine=\"\"') +\n ticks +\n write(ctx.ink, \"dg-pp-tok\", t.title.x, t.title.base, t.title.text, T.tankTitle, shown) +\n `</g>`\n );\n}\n\n/**\n * 水と、槽の下の数と、増えた分か減った分と語。`at` を渡すと、その時刻に水が段の始まりの水位 (`from`) から今の水位へ動く。\n * 暫定で増えた分は斜線の帯が下から伸び、暫定で減った分は液が縮んで点線の枠が残り、ほかは水面がそのまま上下する。\n * 水は切り抜きの下の端より下まで伸ばし、下がる時にも底が空かないようにする\n */\nexport function level(lv: PipeLevel, t: PipeTank, ctx: Ctx, shown: Shown[], attrs: string, at?: number): string {\n const bottom = t.y + t.h - P.tank.pad;\n const deep = t.h;\n const tone = `--pp-t:var(--pp-tone${t.tone})`;\n const body = (top: number, cls = \"dg-pp-liq\", extra = \"\"): string =>\n `<rect class=\"${cls}\" style=\"${tone}\" x=\"${r1(lv.x)}\" y=\"${r1(top)}\" width=\"${r1(lv.w)}\" height=\"${r1(bottom - top + deep)}\"${extra}/>`;\n const now = lv.y;\n const old = lv.base?.y;\n const from = at === undefined ? undefined : lv.from;\n /** 時刻 `at` から `transform` を `a` から `b` へ動かす部品。`oy` は伸び縮みの元の高さ */\n const moving = (markup: string, a: string, b: string, oy: number): string => {\n if (at === undefined) return markup;\n const frames: Frame[] = [\n [0, { transform: a }],\n [at, { transform: a }, EASE.out],\n [at + MOTION.pipe.level, { transform: b }],\n [ctx.m.total, { transform: b }],\n ];\n return `<g class=\"dg-a\" style=\"transform-origin:${r1(lv.x + lv.w / 2)}px ${r1(oy)}px;${ctx.m.kf(frames)}\">${markup}</g>`;\n };\n const parts: string[] = [];\n if (lv.state === \"provisional\" && old !== undefined && lv.h > (lv.base?.h ?? 0)) {\n const hat = `<rect class=\"dg-pp-hat\" fill=\"url(#${defId(ctx, `h${t.tone}`)})\" x=\"${r1(lv.x)}\" y=\"${r1(now)}\" width=\"${r1(lv.w)}\" height=\"${r1(old - now + 1)}\"/>`;\n parts.push(body(old), from ? moving(hat, \"scaleY(0)\", \"scaleY(1)\", old) : hat);\n } else if (lv.state === \"provisional\" && old !== undefined && lv.h < (lv.base?.h ?? 0)) {\n parts.push(lv.h > 0 ? body(now) : \"\");\n if (from && from.y < now)\n parts.push(moving(`<rect class=\"dg-pp-liq\" style=\"${tone}\" x=\"${r1(lv.x)}\" y=\"${r1(from.y)}\" width=\"${r1(lv.w)}\" height=\"${r1(now - from.y + 1)}\"/>`, \"scaleY(1)\", \"scaleY(0)\", now));\n parts.push(`<rect class=\"dg-pp-ghost\" x=\"${r1(lv.x)}\" y=\"${r1(old)}\" width=\"${r1(lv.w)}\" height=\"${r1(now - old)}\"/>`);\n } else if (from) parts.push(moving(body(now), `translateY(${r1(from.y - now)}px)`, \"translateY(0)\", now));\n else if (lv.h > 0) parts.push(body(now));\n const water = `<g clip-path=\"url(#${clipId(ctx, t)})\">${parts.join(\"\")}</g>`;\n const marks: string[] = [];\n if (old !== undefined && lv.state === \"provisional\")\n marks.push(`<line class=\"dg-pp-mark\" x1=\"${r1(t.x - P.tank.markOut)}\" y1=\"${r1(old)}\" x2=\"${r1(t.x + t.w + P.tank.markOut)}\" y2=\"${r1(old)}\"/>`);\n if (old !== undefined && lv.state === \"rolled\") marks.push(undoneMark(t.x - P.tank.markOut, t.x + t.w + P.tank.markOut, old));\n const sub =\n (lv.delta ? write(ctx.ink, \"dg-pp-dlt\", lv.delta.x, lv.delta.base, lv.delta.text, T.delta, shown) : \"\") +\n (lv.tag ? write(ctx.ink, \"dg-pp-tagw\", lv.tag.x, lv.tag.base, lv.tag.text, T.tag, shown) : \"\");\n return (\n `<g${attrs} class=\"dg-pp-lv dg-pp-lv-${lv.state}\" style=\"${cs(STATE_COLOR[lv.state])}\">${water}${marks.join(\"\")}` +\n `${sizedText(ctx, \"dg-pp-num\", lv.text, T.amount, shown)}${sub}</g>`\n );\n}\n\n/** 値の管。持ち主の槽の横の口どうしを結ぶ折れ線を、外の管と中の管の 2 本で描く。`attrs` は部品の印 (`data-pipe-value` など) */\nexport function valuePipe(points: readonly Point[], attrs = \"\"): string {\n const d = `M ${points.map((p) => `${r1(p[0])} ${r1(p[1])}`).join(\" L \")}`;\n return `<g${attrs}><path class=\"dg-pp-pcase\" d=\"${d}\"/><path class=\"dg-pp-pcore\" d=\"${d}\"/></g>`;\n}\n\n/**\n * 弁。2 つの三角を向かい合わせた形と、軸と取っ手。`vertical` は縦に走る管の弁。\n * 取っ手は閉じた時に管と直角に立ち、開いた時に管の向きに倒れる。`turn` を渡すと取っ手がその style の動きで回り、`open` を渡すとその style の間だけ弁が開いた色になる。\n * `under` は軸と取っ手を管の下 (縦の管は左) に立てる。\n * `ctx` は取っ手の角の形を読む。\n * `attrs` は取っ手の印 (`data-pipe-lever` など)\n */\nexport function valve(x: number, y: number, vertical: boolean, opened: boolean, attrs: string, ctx: Ctx, turn = \"\", open = \"\", under = false): string {\n const V = P.valve;\n const body = vertical\n ? `M ${r1(x - V.half)} ${r1(y - V.r)} L ${r1(x + V.half)} ${r1(y - V.r)} L ${r1(x)} ${r1(y)} Z M ${r1(x - V.half)} ${r1(y + V.r)} L ${r1(x + V.half)} ${r1(y + V.r)} L ${r1(x)} ${r1(y)} Z`\n : `M ${r1(x - V.r)} ${r1(y - V.half)} L ${r1(x - V.r)} ${r1(y + V.half)} L ${r1(x)} ${r1(y)} Z M ${r1(x + V.r)} ${r1(y - V.half)} L ${r1(x + V.r)} ${r1(y + V.half)} L ${r1(x)} ${r1(y)} Z`;\n const [px, py] = valvePivot(x, y, vertical, under);\n const angle = leverAngle(vertical, opened, under);\n const origin = `transform-origin:${r1(px)}px ${r1(py)}px`;\n const lever = `<rect class=\"dg-pp-lever\" x=\"${r1(px - V.leverH / 2)}\" y=\"${r1(py - V.leverH / 2)}\" width=\"${V.lever}\" height=\"${V.leverH}\" rx=\"${partRadius(ctx.corner, V.leverH / 2)}\"/>`;\n const turned = turn ? `<g${attrs} class=\"dg-a\" style=\"${origin};${turn}\">${lever}</g>` : `<g${attrs} transform=\"rotate(${angle} ${r1(px)} ${r1(py)})\">${lever}</g>`;\n return (\n `<g class=\"dg-pp-vlv\"><line class=\"dg-pp-vstem\" x1=\"${r1(x)}\" y1=\"${r1(y)}\" x2=\"${r1(px)}\" y2=\"${r1(py)}\"/>${turned}` +\n `<circle class=\"dg-pp-pivot\" cx=\"${r1(px)}\" cy=\"${r1(py)}\" r=\"${V.pivot}\"/><path class=\"dg-pp-vbody\" d=\"${body}\"/>` +\n (open ? `<path class=\"dg-pp-vbody dg-pp-vopen dg-a\" style=\"${open}\" d=\"${body}\"/>` : opened ? `<path class=\"dg-pp-vbody dg-pp-vopen\" d=\"${body}\"/>` : \"\") +\n `</g>`\n );\n}\n\n/** 取っ手の向き (度)。閉じた取っ手は管と直角、開いた取っ手は管の向き。向きの決め方は弁の形と共に `pipe-valve.ts` が持つ */\nexport const leverAngle = (vertical: boolean, opened: boolean, under = false): number => valveLever(vertical, opened, under);\n\n/** トークンの箱。名前と、弁から箱へ上る軸。箱の中の値は値の札の描き方 (`write/draw.ts`) が描く。名前は関係者の名前と同じく `dg-sn` も持つ */\nexport function tokenBox(p: PipeParty, on: boolean, valveAt: Point | undefined, ctx: Ctx, shown: Shown[], attrs: string): string {\n const cx = p.x + p.w / 2;\n const stem = valveAt ? `<line class=\"dg-pp-tstem\" x1=\"${r1(cx)}\" y1=\"${r1(valveAt[1] - P.bus.valveUp)}\" x2=\"${r1(cx)}\" y2=\"${r1(p.y + p.h / 2)}\"/>` : \"\";\n return (\n `<g${attrs} class=\"dg-pp-tokv${on ? \" dg-pp-on\" : \"\"}\">${stem}${frame(ctx, \"dg-pp-act\", p, P.token.radius)}` +\n `${write(ctx.ink, \"dg-sn dg-pp-actn\", p.label.x, p.label.base, p.label.text, T.party, shown)}</g>`\n );\n}\n\n/** 点の並びの上の、始まりから `d` 進んだ所 */\nexport function pointAlong(points: readonly Point[], d: number): Point {\n let left = d;\n for (let i = 1; i < points.length; i++) {\n const a = points[i - 1] as Point;\n const b = points[i] as Point;\n const len = Math.hypot(b[0] - a[0], b[1] - a[1]);\n if (left <= len || i === points.length - 1) {\n const k = len === 0 ? 0 : Math.min(1, left / len);\n return [a[0] + (b[0] - a[0]) * k, a[1] + (b[1] - a[1]) * k];\n }\n left -= len;\n }\n return points[0] ?? [0, 0];\n}\n\n/**\n * 流れた分。管に沿った点線と向きの印。暫定の分は点線、確定した分は実線、取り消した分は桃色で描く。\n * `at` を渡すと、その時刻に斜線の液の塊が管の始まりから終わりへ通り抜ける。塊は `data-pipe-slug` と段の番号を持つ。`attrs` は部品の印。\n * 塊は管の道筋を長さ 1 と数えた破線の 1 本で、破線のずれを動かして送る。折れた管でも向きを計算せずに道筋どおり曲がるため (試作の4配管と同じ作り)\n */\nexport function flow(f: PipeFlow, ctx: Ctx, attrs: string, at?: number): string {\n const d = `M ${f.points.map((p) => `${r1(p[0])} ${r1(p[1])}`).join(\" L \")}`;\n const a = P.flow.chevron;\n const { x, y, dir, vertical } = f.arrow;\n const chevron = vertical\n ? `M ${r1(x - a)} ${r1(y - a * dir * 0.7)} l ${a} ${r1(a * dir * 1.15)} l ${a} ${r1(-a * dir * 1.15)}`\n : `M ${r1(x - a * dir * 0.7)} ${r1(y - a)} l ${r1(a * dir * 1.15)} ${a} l ${r1(-a * dir * 1.15)} ${a}`;\n const tone = `--pp-t:var(--pp-tone${f.tone})`;\n let blob = \"\";\n if (at !== undefined) {\n // 塊が管の始まりの手前に隠れている時のずれと、終わりの先へ抜けた時のずれ\n const before = P.flow.slug;\n const after = -1;\n const end = at + MOTION.pipe.slug;\n const frames: Frame[] = [\n [0, { opacity: 0, \"stroke-dashoffset\": before }],\n [at, { opacity: 0, \"stroke-dashoffset\": before }, EASE.inOut],\n [at + MOTION.pipe.slug * 0.15, { opacity: 1 }],\n [end - MOTION.pipe.slug * 0.15, { opacity: 1 }],\n [end, { \"stroke-dashoffset\": after }],\n [end + MOTION.fade, { opacity: 0 }],\n [ctx.m.total, { opacity: 0, \"stroke-dashoffset\": after }],\n ];\n blob = `<path class=\"dg-pp-slug dg-a\" data-pipe-slug=\"\" data-pipe-step=\"${f.step}\" pathLength=\"1\" stroke=\"url(#${defId(ctx, `h${f.tone}`)})\" style=\"${tone};${ctx.m.kf(frames)}\" d=\"${d}\"/>`;\n }\n return (\n `<g${attrs} class=\"dg-pp-trace dg-pp-trace-${f.state}\" style=\"${tone};${cs(STATE_COLOR[f.state])}\">` +\n `<path class=\"dg-pp-tline\" d=\"${d}\"/><path class=\"dg-pp-chev\" d=\"${chevron}\"/>${blob}</g>`\n );\n}\n\n/** 点の並びの最後を `cut` だけ手前で止める。矢じりの先と線の端を重ねないため */\nexport function shortened(points: Point[], cut: number): Point[] {\n const out = points.map((p): Point => [p[0], p[1]]);\n const last = out[out.length - 1] as Point;\n const before = out[out.length - 2] as Point;\n const len = Math.hypot(last[0] - before[0], last[1] - before[1]) || 1;\n out[out.length - 1] = [last[0] - ((last[0] - before[0]) / len) * cut, last[1] - ((last[1] - before[1]) / len) * cut];\n return out;\n}\n","/**\n * 値の札の描き方 (#3389、#3398)。\n *\n * 残高でない値は値の札で描く。トークンの Contract が持つ値は、トークンの箱の中の名前の下に値の名前と値を 1 行ずつ書き、\n * 書き替えた値は前の値を消し線で残して矢印で今の値へつなぐ。ほかの関係者の値は、持ち主の槽の並びに札を置き、名前と大きな値を書き、\n * 書き替えた値は札の下に前の値を消し線で残して暫定か確定か取り消しの語を添える。確定した札は緑の縁、取り消した札は桃色の縁で描く。\n * `write` の段では、書いた者の名札から書き替えた札まで書き込む管を引く。処理を借りる呼び出しの内側の書き込みは、呼んだ側の札へ向く。\n * この file は配管の図を描く部品 (`render/pipe.ts`) と配管の図のブロックの描き方だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipePlate, PipeWrite } from \"../../kinds/pipe/layout\";\nimport type { Rect } from \"../../layout/scene\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport { frameShape } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { type Ctx, pathOf, r1, write } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport { shortened, STATE_COLOR } from \"../hold/draw\";\n\nconst P = PIPE_LOOK;\nconst T = PIPE_TYPE;\n\n/** 和文を含む字に足す class。等幅の字は和文を持たないので、和文の字で描く */\nexport const wide = (text: string): string => ([...text].some((ch) => (ch.codePointAt(0) ?? 0) >= 0x2e80) ? \" dg-pp-j\" : \"\");\n\nconst strike = (r: Rect): string => `<rect class=\"dg-pp-strike\" x=\"${r1(r.x)}\" y=\"${r1(r.y)}\" width=\"${r1(r.w)}\" height=\"${r1(r.h)}\"/>`;\n\n/** 値の札。`attrs` は部品の印 (段の始まりの写しは持たない) */\nexport function plate(p: PipePlate, ctx: Ctx, shown: Shown[], attrs: string): string {\n const changed = p.was !== undefined;\n if (p.boxed) {\n const was = p.was && p.arrow ? write(ctx.ink, \"dg-pp-tvw\", p.was.x, p.was.base, p.was.text, T.keyValue, shown) + (p.strike ? strike(p.strike) : \"\") + write(ctx.ink, \"dg-pp-tva\", p.arrow.x, p.arrow.base, p.arrow.text, T.keyValue, shown) : \"\";\n return (\n `<g${attrs} class=\"dg-pp-tplate dg-pp-tplate-${p.state}\" style=\"${cs(STATE_COLOR[p.state])}\">` +\n write(ctx.ink, `dg-pp-tkey${wide(p.label.text)}`, p.label.x, p.label.base, p.label.text, T.key, shown) +\n was +\n write(ctx.ink, `dg-pp-tval${changed ? \" dg-pp-tval-on\" : \"\"}${wide(p.text.text)}`, p.text.x, p.text.base, p.text.text, T.keyValue, shown) +\n `</g>`\n );\n }\n const sub =\n p.was && p.tag\n ? write(ctx.ink, `dg-pp-was${wide(p.was.text)}`, p.was.x, p.was.base, p.was.text, T.sub, shown) +\n (p.strike ? strike(p.strike) : \"\") +\n write(ctx.ink, \"dg-pp-tagw\", p.tag.x, p.tag.base, p.tag.text, T.tag, shown)\n : \"\";\n // 札の名前と値の字は、札の枠と一緒に描いた四角で記録する。崩れの確かめが、札の枠に接する字を探す (#3526)\n const frame = { name: p.name, rect: { x: p.x, y: p.y, w: p.w, h: p.h } };\n for (const t of [p.label, p.text]) ctx.ink.push({ text: t.text, rect: { x: t.x, y: t.y, w: t.w, h: t.h }, shown, frame });\n return (\n `<g${attrs} class=\"dg-pp-plate dg-pp-plate-${p.state}\" style=\"${cs(STATE_COLOR[p.state])}\">` +\n frameShape(ctx.corner, ' class=\"dg-pp-pbox\"', p, `<rect class=\"dg-pp-pbox\" x=\"${r1(p.x)}\" y=\"${r1(p.y)}\" width=\"${r1(p.w)}\" height=\"${r1(p.h)}\" rx=\"${P.plate.radius}\"/>`) +\n write(undefined, `dg-pp-tok${wide(p.label.text)}`, p.label.x, p.label.base, p.label.text, T.tankTitle, shown) +\n write(undefined, `dg-pp-pv${wide(p.text.text)}`, p.text.x, p.text.base, p.text.text, T.plateValue, shown) +\n `${sub}</g>`\n );\n}\n\n/** 書き込む管。書いた者の名札の下から、書き替えた札の上の端まで */\nexport function writePipe(w: PipeWrite, ctx: Ctx, attrs: string): string {\n const a = P.flow.chevron;\n const [ex, ey] = w.points[w.points.length - 1] ?? [0, 0];\n return (\n `<g${attrs} style=\"${cs(\"amber\")}\"><path class=\"dg-pp-wr\" d=\"${pathOf(shortened(w.points, a), ctx.corner)}\"/>` +\n `<path class=\"dg-pp-wh\" d=\"M ${r1(ex - a)} ${r1(ey - a)} L ${r1(ex)} ${r1(ey)} L ${r1(ex + a)} ${r1(ey - a)} Z\"/></g>`\n );\n}\n","/**\n * 確認の描き方 (#3389、#3398)。\n *\n * `check` を行う者ごとに 1 つの計器を、その者を呼んだ管の上か、トークンの Contract の値の管の上に置く。\n * 計器は落ちる側と通る側の目盛りの帯と針を持ち、確かめた段で針が振れて、通ったか (緑のレ点) 落ちたか (桃色の ×) の印が付く。\n * 確かめた段の後も針と印を残し、値の管の計器は比べた式を上に残す。\n * 畳んだ箱の札 (`card`) も同じ札の形で描くので、この file が持ち、畳みのブロックの描き方が読む。\n * この file は配管の図を描く部品 (`render/pipe.ts`) と配管の図のブロックの描き方だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeGauge, PipeText } from \"../../kinds/pipe/layout\";\nimport type { Rect } from \"../../layout/scene\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport type { ColorKey } from \"../../look/values\";\nimport { partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { type Ctx, r1, write } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport { wide } from \"../write/draw\";\n\nconst P = PIPE_LOOK;\nconst G = PIPE_LOOK.gauge;\n\n/** 畳んだ箱の札の左の印 (2 枚の重なった紙)。`(x, y)` が真ん中 */\nconst foldIcon = (x: number, y: number): string =>\n `<path class=\"dg-pp-ic\" d=\"M ${r1(x - 8)} ${r1(y - 3)} h 12 v 11 h -12 Z M ${r1(x - 4)} ${r1(y - 3)} v -5 h 12 v 11 h -4\"/>`;\n\n/** 札。枠と左の印と、上の小さな字 (`title`) と下の大きな字 (`value`) */\nexport function card(c: Rect & { title: PipeText; value: PipeText }, color: ColorKey, ctx: Ctx, shown: Shown[], attrs: string, cls = \"dg-pp-card\"): string {\n return (\n `<g${attrs} style=\"${cs(color)}\">` +\n `<rect class=\"${cls}\" x=\"${r1(c.x)}\" y=\"${r1(c.y)}\" width=\"${r1(c.w)}\" height=\"${r1(c.h)}\" rx=\"${partRadius(ctx.corner, P.radius)}\" ${ctx.sh}/>` +\n foldIcon(c.x + P.card.padX + P.card.icon / 2, c.y + c.h / 2) +\n write(ctx.ink, `dg-pp-k1${wide(c.title.text)}`, c.title.x, c.title.base, c.title.text, PIPE_TYPE.cardTitle, shown) +\n write(ctx.ink, `dg-pp-k2 dg-pp-k3${wide(c.value.text)}`, c.value.x, c.value.base, c.value.text, PIPE_TYPE.fold, shown) +\n `</g>`\n );\n}\n\n/** 円の弧。`a0` 度から `a1` 度まで、真上を 0 度に右回り */\nfunction arc(cx: number, cy: number, a0: number, a1: number, r: number): string {\n const at = (a: number): [number, number] => [cx + r * Math.sin((a * Math.PI) / 180), cy - r * Math.cos((a * Math.PI) / 180)];\n const [x0, y0] = at(a0);\n const [x1, y1] = at(a1);\n return `M ${r1(x0)} ${r1(y0)} A ${r1(r)} ${r1(r)} 0 ${a1 - a0 > 180 ? 1 : 0} 1 ${r1(x1)} ${r1(y1)}`;\n}\n\n/**\n * 計器。`swing` を渡すと針がその style の動きで振れ、`lit` を渡すと通ったかの印がその style の動きで出る。\n * 針は `data-pipe-needle`、印は `data-pipe-lamp` を持つ。`attrs` は部品の印\n */\nexport function gauge(g: PipeGauge, ctx: Ctx, shown: Shown[], attrs: string, swing = \"\", lit = \"\"): string {\n const { cx, cy, r } = g;\n const needle = `<path class=\"dg-pp-needle\" d=\"M ${r1(cx - 2.5)} ${r1(cy)} L ${r1(cx)} ${r1(cy - r + G.needle)} L ${r1(cx + 2.5)} ${r1(cy)} Z\"/>`;\n const turned = swing\n ? `<g class=\"dg-a\" data-pipe-needle=\"\" style=\"transform-origin:${r1(cx)}px ${r1(cy)}px;${swing}\">${needle}</g>`\n : `<g data-pipe-needle=\"\" transform=\"rotate(${g.angle} ${r1(cx)} ${r1(cy)})\">${needle}</g>`;\n const { x: lx, y: ly, r: lr } = g.lamp;\n const mark = g.ok\n ? `M ${r1(lx - 5)} ${r1(ly)} l 3.5 4 l 7 -8`\n : `M ${r1(lx - 4.5)} ${r1(ly - 4.5)} l 9 9 M ${r1(lx + 4.5)} ${r1(ly - 4.5)} l -9 9`;\n const lamp = `<g data-pipe-lamp=\"\"${lit ? ` class=\"dg-a\" style=\"${lit}\"` : \"\"}><circle class=\"dg-pp-lamp\" cx=\"${r1(lx)}\" cy=\"${r1(ly)}\" r=\"${lr}\"/><path class=\"dg-pp-lampm\" d=\"${mark}\"/></g>`;\n return (\n `<g${attrs} class=\"dg-pp-gauge${g.ok ? \"\" : \" dg-pp-gfail\"}\" style=\"${cs(g.ok ? \"violet\" : \"rose\")}\">` +\n (g.stem ? `<line class=\"dg-pp-gstem\" x1=\"${r1(cx)}\" y1=\"${r1(g.stem.y1)}\" x2=\"${r1(cx)}\" y2=\"${r1(g.stem.y2)}\"/>` : \"\") +\n `<circle class=\"dg-pp-face\" cx=\"${r1(cx)}\" cy=\"${r1(cy)}\" r=\"${r}\"/>` +\n `<path class=\"dg-pp-zone dg-pp-zbad\" d=\"${arc(cx, cy, -125, -12, r - G.zone)}\"/><path class=\"dg-pp-zone dg-pp-zgood\" d=\"${arc(cx, cy, -4, 125, r - G.zone)}\"/>` +\n `${turned}<circle class=\"dg-pp-hub\" cx=\"${r1(cx)}\" cy=\"${r1(cy)}\" r=\"${G.hub}\"/>${lamp}` +\n `</g>`\n );\n}\n","/**\n * イベントの描き方 (#3389)。\n *\n * 出したイベントは図の上の端のイベントの列に `<出した者の名前>.<イベントの名前>` の札で積み、出した段だけ引数を札の中に出す。\n * 暫定の札は点線の縁、確定した札は緑の縁、取り消した札は桃色の縁と消し線で描く。`emit` の段では、出した者の名札をイベントの色 (桃色) の輪で囲む。\n * この file は配管の図を描く部品 (`render/pipe.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeEventChip, PipePill } from \"../../kinds/pipe/layout\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport { partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { type Ctx, esc, r1, write } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport { STATE_COLOR } from \"../hold/draw\";\nimport { wide } from \"../write/draw\";\n\nconst P = PIPE_LOOK;\n\n/** イベントの札。`attrs` は部品の印。引数の字は `data-pipe-args` を持つ */\nexport function eventChip(e: PipeEventChip, ctx: Ctx, shown: Shown[], attrs: string): string {\n const color = e.state === \"none\" ? \"rose\" : STATE_COLOR[e.state];\n const strike = e.state === \"rolled\" ? `<rect class=\"dg-pp-x\" x=\"${r1(e.text.x)}\" y=\"${r1(e.text.y + e.text.h * 0.55)}\" width=\"${r1(e.text.w)}\" height=\"1.25\"/>` : \"\";\n let args = \"\";\n if (e.args) {\n ctx.ink.push({ text: e.args.text, rect: { x: e.args.x, y: e.args.y, w: e.args.w, h: e.args.h }, shown });\n args = `<text class=\"dg-pp-ca${wide(e.args.text)}\" data-pipe-args=\"\" x=\"${r1(e.args.x)}\" y=\"${r1(e.args.base)}\">${esc(e.args.text)}</text>`;\n }\n return (\n `<g${attrs} style=\"${cs(color)}\">` +\n `<rect class=\"dg-pp-chip dg-pp-chip-${e.state}\" x=\"${r1(e.x)}\" y=\"${r1(e.y)}\" width=\"${r1(e.w)}\" height=\"${r1(e.h)}\" rx=\"${partRadius(ctx.corner, 4)}\"/>` +\n `${write(ctx.ink, `dg-pp-ct${wide(e.text.text)}`, e.text.x, e.text.base, e.text.text, PIPE_TYPE.chip, shown)}${args}${strike}</g>`\n );\n}\n\n/** イベントを出した者の名札を囲む輪。`radius` は名札の角 (丸の名札は渡さない) */\nexport function ring(pill: PipePill, attrs: string, ctx: Ctx, radius?: number): string {\n const pad = P.ring.width + 1;\n const h = pill.h + pad * 2;\n const rx = radius === undefined ? h / 2 : radius + pad;\n return `<rect${attrs} class=\"dg-pp-ring\" style=\"${cs(\"rose\")}\" x=\"${r1(pill.x - pad)}\" y=\"${r1(pill.y - pad)}\" width=\"${r1(pill.w + pad * 2)}\" height=\"${r1(h)}\" rx=\"${partRadius(ctx.corner, rx)}\"/>`;\n}\n","/**\n * 畳みの描き方 (#3389)。\n *\n * `[fold]` の呼び出しの内側の段は 1 つの段にまとめ、呼ばれた者の下の空いた所に点線の縁の箱を出す。箱は内側の段の数と、内側の段にしか出ない関係者の数を書き、\n * 押すと内側の段を開いて描き直す (再生の部品が `data-pipe-fold` を見る)。まとめた段の槽と値の札とイベントは、内側の出来事を全て当てた後の値で描く。\n * この file は配管の図を描く部品 (`render/pipe.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeFoldBox } from \"../../kinds/pipe/layout\";\nimport type { Shown } from \"../../render/ink\";\nimport type { Ctx } from \"../../render/parts\";\nimport { card } from \"../check/draw\";\n\n/** 畳んだ箱。押すと開く */\nexport function foldBox(f: PipeFoldBox, ctx: Ctx, shown: Shown[], attrs: string): string {\n return card(f, \"blue\", ctx, shown, `${attrs} data-pipe-fold=\"${f.call}\" role=\"button\"`, \"dg-pp-card dg-pp-fold\");\n}\n","/**\n * 呼び出しの種類の描き方 (#3389)。\n *\n * 呼び出しの種類は呼び出しの管の見た目で分ける。処理を借りる呼び出し (`[call: delegate]`) の管は芯を抜いた 2 本線、\n * 書き込めない呼び出し (`[call: static]`) の管は普通の管の半分の太さで描く (太さは並べ方が `width` に持つ)。\n * この file は呼び出しの管の描き方 (`return/draw.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport { PIPE_LOOK } from \"../../look/pipe\";\nimport { r1 } from \"../../render/parts\";\n\n/** 処理を借りる管の芯。管の道 `d` の上に地の色の細い線を重ね、2 本線に見せる。ほかの種類は何も描かない */\nexport function kindCore(lane: { kind: string; width: number }, d: string): string {\n return lane.kind === \"delegate\" ? `<path class=\"dg-pp-core\" stroke-width=\"${r1(lane.width * PIPE_LOOK.call.core)}\" d=\"${d}\"/>` : \"\";\n}\n","/**\n * 呼び出しの管の描き方 (#3389、#3398)。\n *\n * 呼んだ者ごとに 1 本の本管を引き、呼ぶ相手ごとに枝を分ける。管は太い外の管で描き、枝の根元に弁を置く。\n * 開いている呼び出しは、呼んだ者を出た所から呼ばれた者の名札まで呼び出しの色 (青) で光り、開いた時刻に弁の取っ手が倒れる。\n * 戻ると光が消えて取っ手が立つ。一番外の呼び出しが戻って全てが確定した段は、送り手から出る管を確定の色 (緑) で光らせる。\n * 呼び出しの種類の見た目 (処理を借りる管の 2 本線、書き込めない管の細さ) は呼び出しの種類のブロックの描き方 (`call/draw.ts`) が持つ。\n * この file は配管の図を描く部品 (`render/pipe.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeMain } from \"../../kinds/pipe/layout\";\nimport type { Point } from \"../../layout/scene\";\nimport { r1 } from \"../../render/parts\";\nimport { kindCore } from \"../call/draw\";\nimport { cs } from \"../color/draw\";\n\n/** 点の並びの道。角は丸めず、管の継ぎ目の形のまま描く */\nconst lineOf = (points: readonly Point[]): string => `M ${points.map((p) => `${r1(p[0])} ${r1(p[1])}`).join(\" L \")}`;\n\n/** 本管と枝の外の管 */\nexport function callCase(main: PipeMain): string {\n const d = [main.points, ...main.branches.map((b) => b.points)]\n .filter((p) => p.length > 1)\n .map(lineOf)\n .join(\" \");\n return `<path class=\"dg-pp-ccase\" d=\"${d}\"/>`;\n}\n\n/**\n * 光る管。`attrs` は部品の印 (`data-pipe-branch`、`data-pipe-call`、`data-pipe-pipe`)、`shown` は見える間の style。\n * 太さを `stroke-width` に書き、確定した段の管 (`good`) は確定の色で描く。`draw` を渡すと、管がその style の動きで呼んだ者の側から光っていく\n */\nexport function litPipe(lane: { kind: string; width: number; points: Point[] }, attrs: string, shown: string, good = false, draw = \"\"): string {\n const d = lineOf(lane.points);\n const drawn = draw ? ` pathLength=\"1\" stroke-dasharray=\"1\"` : \"\";\n return (\n `<g class=\"dg-a\" style=\"${shown}\"><path${attrs} class=\"dg-pp-cflow${draw ? \" dg-a\" : \"\"}\" style=\"${cs(good ? \"green\" : \"blue\")}${draw ? `;${draw}` : \"\"}\"${drawn} stroke-width=\"${lane.width}\" d=\"${d}\"/>` +\n `${kindCore(lane, d)}</g>`\n );\n}\n","/**\n * 配管の図 (#3389) を描く部品。見た目の元は Tracelyth の第6回の試作の「4 配管」(#3398) で、色と字は値の表から読む。\n *\n * 段ごとの絵 (`data-pipe-frame`) に、その段の部品を全て描き、段が替わる時に次の段の絵を重ねてから前の段の絵を消す。\n * 段ごとに変わらない部品 (地の点、槽の囲い、呼び出しの管の外の管、名札から槽へ下りる点線) は段の絵の下に 1 度だけ描く。\n * 段の中で変わる部品 (水位と数、値の札、イベントの札、流れた分、光る管と弁、計器、図の中の札) は、変えた出来事の時刻に替わる。\n * 前の段の値はその時刻まで同じ所に残し、部品の印 (`data-pipe-*`) は替わった後の部品だけが持つ。\n * その段で動かなかった槽と値の管と値の札と名札は薄く描き、計器と流れた分とイベントの札は薄くしない (#3418)。\n *\n * 呼び出しの管は値の管の下をくぐる (#3418)。全ての段の光る呼び出しの管を先に描き (`data-pipe-layer=\"calls\"`)、くぐる所の印を重ね、\n * その後に段ごとの絵で値の管を描く。値の管の外の管がくぐる所の呼び出しの管を覆う。\n * 部品の形はブロックの描き方 (`blocks/<名前>/draw.ts`) が描き、この file は並べ方の置き場所と時刻を渡して組む。\n * 段ごとの絵は下から順に、値の管、流れた分、トークンの箱と弁、槽と水、変換器、値の札と書き込む管、呼び出しの管の弁、計器、名札と輪、\n * イベントの札、図の中の札 (流れた量、計器の式、入力と出力の印)、戻り値の札、畳んだ箱を重ねる。\n * 配管の図の見た目の規則は配管の図の SVG にだけ書き、ほかの図の SVG と頁が最初に読む script に入れない (列の図と同じ訳)。\n */\nimport { avatar, cabinet } from \"../blocks/box/draw\";\nimport { converter } from \"../blocks/calc/draw\";\nimport { gauge } from \"../blocks/check/draw\";\nimport { cs } from \"../blocks/color/draw\";\nimport { eventChip, ring } from \"../blocks/emit/draw\";\nimport { foldBox } from \"../blocks/fold/draw\";\nimport { defId, flow, grid, leverAngle, level, pipeDefs, sizedText, STATE_COLOR, tank, tokenBox, valuePipe, valve } from \"../blocks/hold/draw\";\nimport { callCase, litPipe } from \"../blocks/return/draw\";\nimport { plate, wide, writePipe } from \"../blocks/write/draw\";\nimport type { PipeChip, PipeGauge, PipeLayout, PipeLevel } from \"../kinds/pipe/layout\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../look/pipe\";\nimport { type ColorKey, EASE, LOOK, MOTION } from \"../look/values\";\nimport { valveRects } from \"../pipe-valve\";\nimport type { Timeline } from \"../timeline\";\nimport { frameShape, partRadius } from \"./corner\";\nimport { ALWAYS, type Shown } from \"./ink\";\nimport type { Frame } from \"./motion\";\nimport { type Ctx, cssFont as font, r1 } from \"./parts\";\n\nconst P = PIPE_LOOK;\nconst T = PIPE_TYPE;\nconst S = LOOK.stroke;\nconst M = MOTION.pipe;\n\n/** 呼び出しの色、値の色、鉛筆の色 (暫定の印) を混ぜる式 */\nconst mix = (a: string, pct: number, b: string): string => `color-mix(in srgb,${a} ${pct}%,${b})`;\n\n/**\n * 配管の図の部品の見た目。どの値も値の表から読む。配管の図の SVG にだけ書く。\n * 試作の色の役は、呼び出しを `--c-blue`、値を `--c-amber`、確かめるを `--c-violet`、確定を `--c-green`、取り消しを `--c-rose`、暫定の印を `--c-slate` に当てる\n */\nconst PIPE_CSS = [\n // 液の色。トークンごとに 3 つの色を順に使う\n `.dg-pp{--pp-tone0:var(--c-amber);--pp-tone1:${mix(\"var(--c-amber)\", 48, \"var(--ink2)\")};--pp-tone2:${mix(\"var(--c-rose)\", 70, \"var(--c-amber)\")}}`,\n `.dg-pp-gdot{fill:${mix(\"var(--line)\", 60, \"transparent\")}}`,\n `.dg-pp-housing{fill:${mix(\"var(--surf)\", 55, \"transparent\")};stroke:var(--line);stroke-width:${S.hair + 0.5};stroke-dasharray:6 6}`,\n // 値の管と流れた分\n `.dg-pp-pcase{fill:none;stroke:var(--line);stroke-width:${P.bus.case};stroke-linejoin:round}`,\n `.dg-pp-pcore{fill:none;stroke:var(--bg);stroke-width:${P.bus.core};stroke-linejoin:round}`,\n `.dg-pp-tline{fill:none;stroke:var(--pp-t);stroke-width:${P.flow.width};stroke-linecap:round;stroke-linejoin:round;stroke-dasharray:${P.flow.dash}}`,\n `.dg-pp-chev{fill:none;stroke:var(--pp-t);stroke-width:${P.flow.width - 0.5};stroke-linecap:round;stroke-linejoin:round}`,\n \".dg-pp-trace-final .dg-pp-tline{stroke-dasharray:none;opacity:.6}\",\n \".dg-pp-trace-rolled .dg-pp-tline,.dg-pp-trace-rolled .dg-pp-chev{stroke:var(--c-rose)}\",\n `.dg-pp-slug{fill:none;stroke-width:${P.bus.core - 4};stroke-linejoin:round;stroke-dasharray:${P.flow.slug} ${1 + P.flow.slug}}`,\n // くぐる所。呼び出しの管を値の管の縁で切る\n `.dg-pp-under{stroke:var(--bg);stroke-width:${S.edgeOn + 1.5}}`,\n // 斜線と液\n `.dg-pp-hb{fill:${mix(\"var(--pp-t)\", 26, \"transparent\")}}`,\n `.dg-pp-hl{stroke:var(--pp-t);stroke-width:${P.flow.width}}`,\n \".dg-pp-d0{stop-color:var(--bg);stop-opacity:0}\",\n \".dg-pp-d1{stop-color:var(--bg);stop-opacity:.38}\",\n \".dg-pp-a0{stop-color:var(--c-amber)}\",\n \".dg-pp-a1{stop-color:var(--c-blue)}\",\n // 槽\n `.dg-pp-glass{fill:${mix(\"var(--surf)\", 80, \"transparent\")};stroke:var(--line);stroke-width:${S.edgeOn + 0.5}}`,\n \".dg-pp-glass-on{stroke:var(--c)}\",\n \".dg-pp-deep{pointer-events:none}\",\n \".dg-pp-liq{fill:var(--pp-t)}\",\n `.dg-pp-ghost{fill:none;stroke:var(--t-slate);stroke-width:${S.edgeOn};stroke-dasharray:5 5}`,\n `.dg-pp-mark{stroke:var(--t-slate);stroke-width:${S.edgeOn};stroke-dasharray:3 5}`,\n \".dg-pp-mark-rolled{stroke:var(--c-rose)}\",\n `.dg-pp-shine{fill:${mix(\"var(--ink)\", 9, \"transparent\")}}`,\n `.dg-pp-tick{stroke:${mix(\"var(--ink)\", 22, \"transparent\")};stroke-width:${S.hair + 0.5}}`,\n `.dg-pp-tok{${font(T.tankTitle)};letter-spacing:${P.tank.titleTrack}em;fill:var(--mute)}`,\n `.dg-pp-num{${font(T.amount)};fill:var(--ink)}`,\n `.dg-pp-was{${font(T.sub)};fill:var(--mute)}`,\n `.dg-pp-dlt{${font(T.delta)};fill:var(--ct)}`,\n \".dg-pp-strike{fill:var(--mute)}\",\n `.dg-pp-tagw{${font(T.tag)};fill:var(--t-slate)}`,\n \".dg-pp-lv-final .dg-pp-num,.dg-pp-lv-final .dg-pp-tagw,.dg-pp-lv-rolled .dg-pp-num,.dg-pp-lv-rolled .dg-pp-tagw{fill:var(--ct)}\",\n \".dg-pp-lv-provisional .dg-pp-dlt{fill:var(--ink2)}\",\n // 呼び出しの管と弁\n `.dg-pp-ccase{fill:none;stroke:var(--line);stroke-width:${P.call.case};stroke-linecap:round;stroke-linejoin:round}`,\n \".dg-pp-cflow{fill:none;stroke:var(--c);stroke-linecap:round;stroke-linejoin:round}\",\n \".dg-pp-core{fill:none;stroke:var(--bg);stroke-linecap:round;stroke-linejoin:round}\",\n `.dg-pp-vbody{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn};stroke-linejoin:round}`,\n \".dg-pp-vopen{fill:var(--c-blue);stroke:var(--c-blue)}\",\n \".dg-pp-vval .dg-pp-vopen{fill:var(--c-amber);stroke:var(--c-amber)}\",\n `.dg-pp-vstem{stroke:var(--line);stroke-width:${S.edgeOn + 1}}`,\n \".dg-pp-lever{fill:var(--mute)}\",\n `.dg-pp-pivot{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn}}`,\n // トークンの箱と中の値\n `.dg-pp-act{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn}}`,\n `.dg-pp-tokv.dg-pp-on .dg-pp-act{stroke:var(--c-blue);stroke-width:${S.edgeOn + 1}}`,\n `.dg-pp-tstem{stroke:var(--line);stroke-width:${S.edgeOn + 2}}`,\n `.dg-pp-actn{${font(T.party)};fill:var(--ink)}`,\n `.dg-pp-tkey{${font(T.key)};fill:var(--mute)}`,\n `.dg-pp-tvw,.dg-pp-tva{${font(T.keyValue)};fill:var(--mute)}`,\n `.dg-pp-tval{${font(T.keyValue)};fill:var(--ink)}`,\n \".dg-pp-tval-on{fill:var(--ct)}\",\n // 値の札と書き込む管\n `.dg-pp-pbox{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn + 0.5}}`,\n \".dg-pp-plate-provisional .dg-pp-pbox{stroke:var(--c);stroke-dasharray:5 4}\",\n \".dg-pp-plate-final .dg-pp-pbox,.dg-pp-plate-rolled .dg-pp-pbox{stroke:var(--c)}\",\n `.dg-pp-pv{${font(T.plateValue)};fill:var(--ink)}`,\n \".dg-pp-plate-final .dg-pp-pv,.dg-pp-plate-rolled .dg-pp-pv,.dg-pp-plate-final .dg-pp-tagw,.dg-pp-plate-rolled .dg-pp-tagw{fill:var(--ct)}\",\n `.dg-pp-wr{fill:none;stroke:var(--c);stroke-width:${S.on};stroke-dasharray:4 3}`,\n \".dg-pp-wh{fill:var(--c)}\",\n // 計器\n `.dg-pp-face{fill:var(--surf);stroke:var(--c);stroke-width:${S.edgeOn + 0.5}}`,\n `.dg-pp-gfail .dg-pp-face{stroke-width:${S.edgeOn + 1.5}}`,\n `.dg-pp-gstem{stroke:var(--line);stroke-width:${S.edgeOn + 2}}`,\n `.dg-pp-zone{fill:none;stroke-width:${P.gauge.zone - 1};stroke-linecap:round}`,\n `.dg-pp-zbad{stroke:${mix(\"var(--c-rose)\", 55, \"transparent\")}}`,\n `.dg-pp-zgood{stroke:${mix(\"var(--c-green)\", 70, \"transparent\")}}`,\n \".dg-pp-needle,.dg-pp-hub{fill:var(--ink)}\",\n \".dg-pp-lamp{fill:var(--c-green)}\",\n \".dg-pp-gfail .dg-pp-lamp{fill:var(--c-rose)}\",\n `.dg-pp-lampm{fill:none;stroke:var(--on-c);stroke-width:${S.edgeOn + 0.6};stroke-linecap:round;stroke-linejoin:round}`,\n // 変換器\n `.dg-pp-cstub{fill:none;stroke:var(--line);stroke-width:${P.bus.stub}}`,\n `.dg-pp-cface{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn + 0.5}}`,\n `.dg-pp-cswirl{fill:none;stroke:var(--mute);stroke-width:${S.edgeOn + 1};stroke-linecap:round}`,\n \".dg-pp-ctip{fill:var(--mute)}\",\n `.dg-pp-cur .dg-pp-cface{stroke:var(--c);stroke-width:${S.edgeOn + 1.5}}`,\n \".dg-pp-cur .dg-pp-cswirl{stroke:var(--c)}\",\n \".dg-pp-cur .dg-pp-ctip{fill:var(--c)}\",\n // 名札\n `.dg-pp-halo{fill:none;stroke:var(--c-blue);stroke-width:${S.edgeOn + 0.5};opacity:0}`,\n \".dg-pp-who.dg-pp-on .dg-pp-halo{opacity:.7}\",\n `.dg-pp-glyph{${font(T.initial)};fill:var(--on-c)}`,\n `.dg-pp-pname{${font(T.party)};fill:var(--ink)}`,\n `.dg-pp-tie{fill:none;stroke:var(--line);stroke-width:${S.edgeOn};stroke-dasharray:2 6;stroke-linecap:round}`,\n `.dg-pp-cabr{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn + 0.5}}`,\n `.dg-pp-cab.dg-pp-pool .dg-pp-cabr{stroke:${mix(\"var(--c-amber)\", 60, \"var(--line)\")}}`,\n `.dg-pp-cab.dg-pp-on .dg-pp-cabr{stroke:var(--c-blue);stroke-width:${S.edgeOn + 1.5}}`,\n `.dg-pp-cabg{${font(T.mark)};fill:var(--ink2)}`,\n `.dg-pp-cgl{fill:none;stroke:var(--ink2);stroke-width:${S.glyph};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-pp-cabn{${font(T.party)};fill:var(--ink)}`,\n `.dg-pp-ring{fill:none;stroke:var(--c);stroke-width:${P.ring.width}}`,\n // イベントの札\n `.dg-pp-chip{fill:var(--surf);stroke:var(--c);stroke-width:${S.on}}`,\n \".dg-pp-chip-provisional{stroke-dasharray:3 2}\",\n `.dg-pp-ct{${font(T.chip)};fill:var(--ct)}`,\n `.dg-pp-ca{${font(T.args)};fill:var(--mute)}`,\n \".dg-pp-x{fill:var(--mute)}\",\n // 図の中の札。流れた量、計器の式、入力と出力の印、戻り値\n `.dg-pp-lab{fill:var(--surf);stroke:var(--c);stroke-width:${S.on}}`,\n \".dg-pp-lab-provisional .dg-pp-lab{stroke-dasharray:3 2}\",\n `.dg-pp-labt{${font(T.chip)};fill:var(--ct)}`,\n `.dg-pp-io .dg-pp-labt{${font(T.io)}}`,\n \".dg-pp-io .dg-pp-lab{fill:var(--bg)}\",\n // 畳んだ箱\n `.dg-pp-card{fill:var(--surf);stroke:var(--c);stroke-width:${S.arrow}}`,\n \".dg-pp-fold{stroke-dasharray:5 3;cursor:pointer}\",\n `.dg-pp-ic{fill:none;stroke:var(--c);stroke-width:${S.glyph};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-pp-k1{${font(T.cardTitle)};fill:var(--mute)}`,\n `.dg-pp-k2{${font(T.cardValue)};fill:var(--ct)}`,\n `.dg-pp-k3{${font(T.fold)}}`,\n \".dg-pp-j{font-family:var(--sans)}\",\n].join(\"\");\n\n/** 図の中の札の色の役。流れた量は印の色、計器の式は確かめる色か落ちた色、入力と出力の印は暫定の印の色、戻り値は呼び出しの色 */\nconst chipColor = (c: PipeChip): ColorKey =>\n c.kind === \"amount\" ? STATE_COLOR[c.state ?? \"none\"] : c.kind === \"formula\" ? (c.ok === false ? \"rose\" : \"violet\") : c.kind === \"io\" ? \"slate\" : \"blue\";\n\n/** 図の中の札。角の丸みは並べ方が決め (#3418)、字は並べ方が決めた大きさで書く */\nfunction chipPart(c: PipeChip, ctx: Ctx, shown: Shown[], attrs: string): string {\n return (\n `<g${attrs} class=\"dg-pp-labg dg-pp-${c.kind}${c.state ? ` dg-pp-lab-${c.state}` : \"\"}\" style=\"${cs(chipColor(c))}\">` +\n `<rect class=\"dg-pp-lab\" x=\"${r1(c.x)}\" y=\"${r1(c.y)}\" width=\"${r1(c.w)}\" height=\"${r1(c.h)}\" rx=\"${partRadius(ctx.corner, c.rx)}\"/>` +\n `${sizedText(ctx, `dg-pp-labt${wide(c.text)}`, c.label, c.kind === \"io\" ? T.io : T.chip, shown)}</g>`\n );\n}\n\n/** 計器が描く形。針の盤と、通ったかの印と、値の管から上る軸 */\nconst gaugeRects = (g: PipeGauge) => [\n { x: g.x, y: g.y, w: g.w, h: g.h },\n { x: g.lamp.x - g.lamp.r, y: g.lamp.y - g.lamp.r, w: g.lamp.r * 2, h: g.lamp.r * 2 },\n ...(g.stem ? [{ x: g.cx - 2, y: Math.min(g.stem.y1, g.stem.y2), w: 4, h: Math.abs(g.stem.y2 - g.stem.y1) }] : []),\n];\n\n/**\n * 段ごとに変わらない部品 (名札、呼び出しの管、弁) を、崩れの確かめのために `pieces` へ記録する (#3523)。\n * 呼び出しの管と弁の段は、その管が呼び出しを初めて運ぶ段にする\n */\nfunction recordPieces(layout: PipeLayout, pieces: NonNullable<Ctx[\"pieces\"]>): void {\n const names = new Map(layout.parties.map((p) => [p.id, p.name]));\n const nameOf = (id: string): string => names.get(id) ?? id;\n for (const p of layout.parties) {\n const corner = p.shape === \"round\" ? p.w / 2 : p.shape === \"token\" ? P.token.radius : P.cabinet.radius;\n pieces.push({ kind: \"box\", name: p.name, rect: { x: p.x, y: p.y, w: p.w, h: p.h }, corner, shown: ALWAYS });\n }\n for (const main of layout.mains)\n for (const br of main.branches) {\n const steps = layout.lanes.filter((x) => x.from === main.from && x.to === br.to).map((x) => x.step + 1);\n const step = steps.length > 0 ? Math.min(...steps) : 1;\n const from = nameOf(main.from);\n const to = nameOf(br.to);\n pieces.push({ kind: \"pipe\", from, to, step, points: br.points, half: P.call.case / 2, shown: ALWAYS });\n const [body, ...lever] = valveRects(br.valve.x, br.valve.y, br.valve.vertical, br.valve.under);\n if (body) pieces.push({ kind: \"valve\", from, to, step, body, lever, shown: ALWAYS });\n }\n for (const bus of layout.buses) {\n const v = bus.valve;\n if (!v) continue;\n const [body, ...lever] = valveRects(v.x, v.y, false, false);\n if (body) pieces.push({ kind: \"valve\", from: nameOf(v.party), body, lever, shown: ALWAYS });\n }\n}\n\n/** 槽の縁の色。確定した槽は確定の縁、取り消した槽は取り消しの縁 */\nconst edgeOf = (lv: PipeLevel | undefined): \"final\" | \"rolled\" | \"\" => (lv?.state === \"final\" ? \"final\" : lv?.state === \"rolled\" ? \"rolled\" : \"\");\n\nexport function drawPipe(layout: PipeLayout, timeline: Timeline, ctx: Ctx): { base: string; css: string } {\n const { m } = ctx;\n const f = MOTION.fade;\n const lastStep = timeline.steps.length - 1;\n const parties = new Map(layout.parties.map((p) => [p.id, p]));\n const pooled = new Set(layout.housings.map((h) => h.party));\n const look = { P, T };\n const timeOf = (s: number, event: number | undefined): number | undefined =>\n event === undefined ? undefined : timeline.events.find((t) => t.step === s && t.event === event)?.at;\n /** 取っ手の向きの keyframes。`moves` は時刻と、その時刻に弁が開くか */\n const rotation = (start: number, moves: [number, number][], prop: (v: number) => string, length: number): string => {\n const frames: Frame[] = [[0, { transform: prop(start) }]];\n let now = start;\n for (const [t, to] of moves) {\n frames.push([t, { transform: prop(now) }, EASE.inOut], [t + length, { transform: prop(to) }]);\n now = to;\n }\n frames.push([m.total, { transform: prop(now) }]);\n return m.kf(frames);\n };\n const deg = (v: number): string => `rotate(${r1(v)}deg)`;\n /** 段ごとの見える間 */\n const spanOf = (s: number): { a: number; b: number } => ({\n a: s === 0 ? 0 : (timeline.steps[s]?.start ?? 0),\n b: s === lastStep ? timeline.last : (timeline.steps[s]?.end ?? 0) + f,\n });\n const attrsOf = (s: number, attrs: Record<string, string | number>): string =>\n Object.entries({ ...attrs, step: s })\n .map(([k, v]) => ` data-pipe-${k}=\"${String(v).replace(/&/gu, \"&amp;\").replace(/\"/gu, \"&quot;\").replace(/</gu, \"&lt;\").replace(/>/gu, \"&gt;\")}\"`)\n .join(\"\");\n /** その段で動かなかった部品を薄く描く */\n const dimmed = (lit: boolean, markup: string): string => (lit ? markup : `<g opacity=\"${P.dim}\">${markup}</g>`);\n /** 流れた分が通る値の管の番号 */\n const pipeOfFlow = (fl: { token: string; from: string; to: string }): number =>\n layout.valuePipes.findIndex((p) => p.token === fl.token && ((p.from === fl.from && p.to === fl.to) || (p.from === fl.to && p.to === fl.from)));\n if (ctx.pieces) recordPieces(layout, ctx.pieces);\n\n // 段ごとに変わらない部品\n const out: string[] = [\n `<defs>${pipeDefs(ctx, layout.tanks)}</defs>`,\n grid(ctx, layout.width, layout.height),\n ...layout.housings.map((h) => {\n const attrs = ` class=\"dg-pp-housing\" data-pipe-housing=\"${h.party}\"`;\n return frameShape(ctx.corner, attrs, h, `<rect${attrs} x=\"${r1(h.x)}\" y=\"${r1(h.y)}\" width=\"${r1(h.w)}\" height=\"${r1(h.h)}\" rx=\"${P.tank.radius + P.housing.pad / 2}\"/>`);\n }),\n ...layout.mains.map(callCase),\n ...layout.ties.map((t) => `<path class=\"dg-pp-tie\" d=\"M ${r1(t.x)} ${r1(t.y1)} V ${r1(t.y2)}\"/>`),\n ];\n\n // 光る呼び出しの管。全ての段の分を値の管より先に描き、値の管の下をくぐらせる\n timeline.steps.forEach((_, s) => {\n const { a, b } = spanOf(s);\n const on = (attrs: Record<string, string | number>): string => attrsOf(s, attrs);\n const parts: string[] = [];\n for (const lane of layout.lanes.filter((x) => x.step === s)) {\n const opened = timeOf(s, lane.opened);\n const shut = timeOf(s, lane.shut);\n const shownAt = m.vis(opened ?? a, shut ?? b);\n const draw =\n opened === undefined\n ? \"\"\n : m.kf([\n [0, { \"stroke-dashoffset\": 1 }],\n [opened, { \"stroke-dashoffset\": 1 }, EASE.out],\n [opened + MOTION.draw, { \"stroke-dashoffset\": 0 }],\n [m.total, { \"stroke-dashoffset\": 0 }],\n ]);\n parts.push(litPipe(lane, on({ branch: `${lane.from}>${lane.to}`, call: lane.call, pipe: \"open\" }), shownAt, false, draw));\n }\n // 一番外の呼び出しが戻って全てが確定した段は、送り手から出る管を確定の色で光らせる\n for (const c of layout.calls.filter((x) => x.depth === 0 && x.close?.how === \"return\" && x.close.step === s)) {\n const t = timeOf(s, c.close?.event) ?? a;\n parts.push(litPipe({ kind: c.kind, width: c.width, points: c.lit }, on({ branch: `${c.from}>${c.to}`, call: c.index, pipe: \"done\" }), m.vis(t, b), true));\n }\n out.push(`<g class=\"dg-a\" data-pipe-frame=\"${s}\" data-pipe-layer=\"calls\" style=\"${m.vis(a, b)}\">${parts.join(\"\")}</g>`);\n });\n // くぐる所。値の管の縁で呼び出しの管を切る\n const half = P.bus.case / 2 + 2;\n const cut = P.call.case / 2 + 2;\n for (const k of layout.crossings) {\n const d = k.vertical\n ? `M ${r1(k.x - cut)} ${r1(k.y - half)} H ${r1(k.x + cut)} M ${r1(k.x - cut)} ${r1(k.y + half)} H ${r1(k.x + cut)}`\n : `M ${r1(k.x - half)} ${r1(k.y - cut)} V ${r1(k.y + cut)} M ${r1(k.x + half)} ${r1(k.y - cut)} V ${r1(k.y + cut)}`;\n out.push(`<path class=\"dg-pp-under\" data-pipe-crossing=\"${k.call}\" data-pipe-token=\"${k.token}\" data-pipe-under=\"${k.pipe}\" d=\"${d}\"/>`);\n }\n\n timeline.steps.forEach((span, s) => {\n const { a, b } = spanOf(s);\n const whole: Shown[] = [[a, b + f]];\n const since = (t: number | undefined): Shown[] => (t === undefined ? whole : [[t, b + f]]);\n const until = (t: number): Shown[] => [[a, t + f]];\n /** 時刻 `t` に出る部品。時刻を持たない部品は段の絵と一緒に出る */\n const appear = (t: number | undefined, markup: string): string => (t === undefined ? markup : `<g class=\"dg-a\" style=\"${m.vis(t, b)}\">${markup}</g>`);\n /** 段の始まりから時刻 `t` まで見える部品 */\n const vanish = (t: number, markup: string): string => `<g class=\"dg-a\" style=\"${m.vis(a, t)}\">${markup}</g>`;\n const on = (attrs: Record<string, string | number>): string => attrsOf(s, attrs);\n const pillOf = (party: string) => layout.pills.find((p) => p.step === s && p.party === party);\n const parts: string[] = [];\n const here = layout.flows.filter((x) => x.step === s);\n const moved = (k: number): boolean => here.some((fl) => pipeOfFlow(fl) === k && (fl.fresh || fl.event !== undefined));\n\n // 値の管。その段で流れた管と、流れた分の印が替わった管だけを濃く描く\n layout.valuePipes.forEach((pipe, k) => parts.push(dimmed(moved(k), valuePipe(pipe.points, on({ value: pipe.token, pipe: k })))));\n for (const stub of layout.stubs) parts.push(dimmed(false, valuePipe(stub.points, on({ stub: stub.token }))));\n // 値の管を流れた分。この段で流れた分は、出来事の時刻に斜線の液の塊が管を通り抜ける\n for (const fl of here) {\n const attrs = on({ flow: `${fl.from}>${fl.to}`, token: fl.token, state: fl.state });\n const t = timeOf(s, fl.event);\n const prev = layout.flows.find((x) => x.step === s - 1 && x.id === fl.id);\n if (t !== undefined && prev) parts.push(vanish(t, flow(prev, ctx, \"\")));\n parts.push(appear(t, flow(fl, ctx, attrs, fl.fresh ? t : undefined)));\n }\n // トークンの箱と、値の管の弁。この段で値を移したトークンの弁は、移した時刻に開く\n for (const bus of layout.buses) {\n const v = bus.valve;\n if (!v) continue;\n const times = here\n .filter((x) => x.fresh && x.token === bus.token)\n .map((x) => timeOf(s, x.event))\n .filter((t): t is number => t !== undefined)\n .sort((x, y) => x - y);\n const at = times[0];\n const turn = at === undefined ? \"\" : rotation(leverAngle(false, false), [[at, leverAngle(false, true)]], deg, M.lever);\n const open = at === undefined ? \"\" : m.vis(at, b);\n parts.push(`<g class=\"dg-pp-vval\">${valve(v.x, v.y, false, false, on({ lever: v.party }), ctx, turn, open)}</g>`);\n }\n for (const p of layout.parties.filter((x) => x.shape === \"token\")) {\n const v = layout.buses.find((x) => x.valve?.party === p.id)?.valve;\n const involved = pillOf(p.id)?.involved ?? false;\n parts.push(dimmed(involved, tokenBox(p, involved, v ? [v.x, v.y] : undefined, ctx, whole, on({ party: p.id, role: p.role }))));\n }\n // 槽と水。水と数は、変わった出来事の時刻に段の始まりの値から今の値へ替わる\n for (const g of layout.glasses.filter((x) => x.step === s)) {\n const lv = layout.levels.find((l) => l.step === s && l.party === g.party && l.token === g.token);\n let inside = \"\";\n if (lv) {\n const attrs = on({ level: lv.party, token: lv.token, state: lv.state });\n const t = timeOf(s, lv.event);\n const prev = s > 0 ? layout.levels.find((l) => l.step === s - 1 && l.party === g.party && l.token === g.token) : undefined;\n inside =\n t === undefined || !prev\n ? level(lv, g, ctx, whole, attrs)\n : vanish(t, level(prev, g, ctx, until(t), \"\")) + appear(t, level(lv, g, ctx, since(t), attrs, lv.from ? t : undefined));\n }\n const lit = lv?.event !== undefined || layout.converters.some((c) => c.step === s && c.party === g.party && c.active);\n parts.push(dimmed(lit, tank(g, edgeOf(lv), inside, ctx, whole, on({ tank: g.party, token: g.token }))));\n }\n for (const c of layout.converters.filter((x) => x.step === s)) parts.push(dimmed(c.active, converter(c, on({ converter: c.party }))));\n // 値の札と書き込む管\n for (const w of layout.writes.filter((x) => x.step === s)) parts.push(appear(timeOf(s, w.event), writePipe(w, ctx, on({ write: w.to, name: w.name }))));\n for (const p of layout.plates.filter((x) => x.step === s)) {\n const attrs = on({ plate: p.party, name: p.name, state: p.state });\n const t = timeOf(s, p.event);\n const prev = s > 0 ? layout.plates.find((x) => x.step === s - 1 && x.party === p.party && x.name === p.name) : undefined;\n const lit = p.event !== undefined || p.boxed;\n if (t === undefined || !prev) {\n parts.push(dimmed(lit, plate(p, ctx, whole, attrs)));\n continue;\n }\n parts.push(dimmed(lit, vanish(t, plate(prev, ctx, until(t), \"\")) + appear(t, plate(p, ctx, since(t), attrs))));\n }\n // 呼び出しの管の弁。呼び出しが開いた時刻に取っ手が倒れ、戻った時刻に立つ\n for (const main of layout.mains)\n for (const br of main.branches) {\n const lanes = layout.lanes.filter((x) => x.step === s && x.from === main.from && x.to === br.to);\n const start = lanes.some((x) => x.opened === undefined);\n const moves = lanes\n .flatMap((x): [number, boolean][] => [\n ...(timeOf(s, x.opened) === undefined ? [] : [[timeOf(s, x.opened) as number, true] as [number, boolean]]),\n ...(timeOf(s, x.shut) === undefined ? [] : [[timeOf(s, x.shut) as number, false] as [number, boolean]]),\n ])\n .sort((x, y) => x[0] - y[0]);\n const end = moves.length > 0 ? (moves[moves.length - 1] as [number, boolean])[1] : start;\n const vertical = br.valve.vertical;\n const under = br.valve.under;\n const turn =\n moves.length === 0\n ? \"\"\n : rotation(\n leverAngle(vertical, start, under),\n moves.map(([t, opened]): [number, number] => [t, leverAngle(vertical, opened, under)]),\n deg,\n M.lever,\n );\n let open = \"\";\n if (moves.length > 0) {\n const frames: Frame[] = [[0, { opacity: start ? 1 : 0 }]];\n let now = start;\n for (const [t, opened] of moves) {\n frames.push([t, { opacity: now ? 1 : 0 }], [t + f, { opacity: opened ? 1 : 0 }]);\n now = opened;\n }\n frames.push([m.total, { opacity: now ? 1 : 0 }]);\n open = m.kf(frames);\n }\n parts.push(valve(br.valve.x, br.valve.y, vertical, moves.length === 0 ? end : false, on({ lever: `${main.from}>${br.to}` }), ctx, turn, open, under));\n }\n // 計器。確かめた段は、確かめた時刻に針が振れて通ったかの印が付く。計器は薄くしない\n for (const g of layout.gauges.filter((x) => x.step === s)) {\n ctx.pieces?.push({ kind: \"gauge\", box: parties.get(g.party)?.name ?? g.party, rects: gaugeRects(g), shown: whole });\n const attrs = on({ gauge: g.party, ok: String(g.ok) });\n const t = g.fresh ? timeOf(s, g.event) : undefined;\n if (t === undefined) {\n parts.push(gauge(g, ctx, whole, attrs));\n continue;\n }\n const over = g.angle + (g.ok ? 22 : -26);\n const swing = m.kf([\n [0, { transform: deg(g.from) }],\n [t, { transform: deg(g.from) }, EASE.inOut],\n [t + M.needle * 0.5, { transform: deg(over) }, EASE.inOut],\n [t + M.needle, { transform: deg(g.angle) }],\n [m.total, { transform: deg(g.angle) }],\n ]);\n const lit = `transform-origin:${r1(g.lamp.x)}px ${r1(g.lamp.y)}px;${m.pop(t + M.lamp, b)}`;\n parts.push(gauge(g, ctx, whole, attrs, swing, lit));\n }\n // 名札と輪\n for (const p of layout.parties.filter((x) => x.shape !== \"token\")) {\n const involved = pillOf(p.id)?.involved ?? false;\n const attrs = on({ party: p.id, role: p.role });\n parts.push(\n dimmed(\n involved,\n p.shape === \"round\"\n ? avatar(p, involved, ctx, whole, attrs, look, `url(#${defId(ctx, \"av\")})`)\n : cabinet(p, involved, pooled.has(p.id), ctx, whole, attrs, look),\n ),\n );\n }\n for (const r of layout.rings.filter((x) => x.step === s)) {\n const p = parties.get(r.party);\n const pill = pillOf(r.party);\n if (!p || !pill) continue;\n const radius = p.shape === \"round\" ? undefined : p.shape === \"token\" ? P.token.radius : P.cabinet.radius;\n const round = p.shape === \"round\" ? { ...pill, x: pill.x + pill.w / 2 - P.avatar.halo, y: pill.y + pill.h / 2 - P.avatar.halo, w: P.avatar.halo * 2, h: P.avatar.halo * 2 } : pill;\n parts.push(appear(timeOf(s, r.event), ring(round, on({ ring: r.party }), ctx, radius)));\n }\n // イベントの札。出した者の箱の横に出る\n for (const e of layout.events.filter((x) => x.step === s)) {\n const attrs = on({ event: `${e.party}.${e.name}`, state: e.state });\n const t = timeOf(s, e.event);\n const prev = layout.events.find((x) => x.step === s - 1 && x.id === e.id);\n if (t !== undefined && prev) parts.push(vanish(t, eventChip(prev, ctx, until(t), \"\")));\n parts.push(appear(t, eventChip(e, ctx, since(t), attrs)));\n }\n // 図の中の札。流れた量と計器の式は変えた出来事の時刻に出す。済んだ段の流れた量は薄くする\n for (const c of layout.chips.filter((x) => x.step === s && x.kind !== \"event\" && x.kind !== \"return\")) {\n const t = timeOf(s, c.event);\n parts.push(dimmed(c.kind !== \"amount\" || c.event !== undefined, appear(t, chipPart(c, ctx, since(t), on({ chip: c.kind, ...(c.token ? { token: c.token } : {}) })))));\n }\n // 戻り値の札。戻した時刻に呼ばれた側を出て、呼び出しの管を伝って呼んだ側へ戻る\n for (const c of layout.chips.filter((x) => x.step === s && x.kind === \"return\" && x.path && x.path.length > 1)) {\n const path = c.path as [number, number][];\n const t0 = timeOf(s, c.event) ?? a;\n const still = timeline.stills[s] ?? span.end;\n const t1 = Math.max(t0 + 0.2, Math.min(t0 + M.slug + M.level, still - 0.05));\n const [sx, sy] = path[0] as [number, number];\n const total = path.slice(1).reduce((sum, p, i) => sum + Math.abs(p[0] - (path[i] as [number, number])[0]) + Math.abs(p[1] - (path[i] as [number, number])[1]), 0) || 1;\n const frames: Frame[] = [\n [0, { transform: \"translate(0,0)\" }],\n [t0, { transform: \"translate(0,0)\" }],\n ];\n let walked = 0;\n path.slice(1).forEach((p, i) => {\n const q = path[i] as [number, number];\n walked += Math.abs(p[0] - q[0]) + Math.abs(p[1] - q[1]);\n frames.push([t0 + ((t1 - t0) * walked) / total, { transform: `translate(${r1(p[0] - sx)}px,${r1(p[1] - sy)}px)` }]);\n });\n const [ex, ey] = path[path.length - 1] as [number, number];\n frames.push([m.total, { transform: `translate(${r1(ex - sx)}px,${r1(ey - sy)}px)` }]);\n // 札の字は止め絵で止まる所に記録する。描く所は動き出す所で、動きが止まる所まで運ぶ (#3523)\n const drawnFrom = ctx.ink.length;\n parts.push(\n `<g class=\"dg-a\" style=\"${m.vis(t0, t1 + f)}\"><g class=\"dg-a\" data-pipe-return-chip=\"\" data-pipe-step=\"${s}\" data-pipe-x=\"${r1(sx)}\" data-pipe-y=\"${r1(sy)}\" style=\"${m.kf(frames)}\">` +\n `${chipPart(c, ctx, [[t0, t1 + f]], \"\")}</g></g>`,\n );\n for (const ink of ctx.ink.slice(drawnFrom)) ink.rect = { ...ink.rect, x: ink.rect.x + ex - sx, y: ink.rect.y + ey - sy };\n // 描く方は t1+f まで濃く見せて t1+2f にかけて消すので、崩れの検査も t1+2f まで見えているとみなす (#3607)\n ctx.pieces?.push({ kind: \"chip\", text: c.text, rect: { x: c.x + ex - sx, y: c.y + ey - sy, w: c.w, h: c.h }, shown: [[t1, t1 + 2 * f]] });\n }\n // 畳んだ箱\n for (const fold of layout.folds.filter((x) => x.step === s)) parts.push(foldBox(fold, ctx, whole, ` data-pipe-step=\"${s}\"`));\n out.push(`<g class=\"dg-a\" data-pipe-frame=\"${s}\" style=\"${m.vis(a, b)}\">${parts.join(\"\")}</g>`);\n });\n return { base: `<g class=\"dg-pp\">${out.join(\"\")}</g>`, css: PIPE_CSS };\n}\n","/**\n * 配管の図の管の道を、縦と横の線の格子の上で探す (#3418)。\n *\n * 管は格子の点から隣の点へ縦か横に進み、折れるたびに値を足す。後ろへは戻らない。\n * 障害の四角 (広げた縁を含む) の中を通る道と、置いた線と重なるか近すぎる道は選ばない。\n * 置いた線を直角に越えてよいかと越える時の値は、頼む側 (`Ask.cross`) が線の種類ごとに決める。値の管はほかの値の管を越えず、呼び出しの管は値の管を越えてよい。\n * 重なってよい組 (`group`) が同じ線どうしは、重なって走る道を選べる。同じ者から出る呼び出しの管は 1 本の本管を分け合い、\n * 同じ槽を端に持つ同じトークンの値の管は 1 本の幹を分け合う。重なって走る所は値を減らして数え (`Ask.share`)、幹から枝が分かれる形にする。\n * 同じ組の線も、直角に突き抜けて越える道は選ばない。突き抜けると十字の継ぎ目に見え、どの枝がどこへ行くかが読めない。\n * 並べ方 (`layout.ts`) が格子の線と障害と管の端を渡し、この file は道だけを返す。部品の置き場所は決めない\n */\nimport type { Point, Rect } from \"./layout/scene\";\n\n/** 進む向き。0 が右、1 が下、2 が左、3 が上 */\nexport type Dir = 0 | 1 | 2 | 3;\nconst DX = [1, 0, -1, 0] as const;\nconst DY = [0, 1, 0, -1] as const;\n/** 置いた線の種類。値の管、呼び出しの管、名札から囲いへの点線、トークンの箱から管への短い管、書き込む管、呼び出しの管の弁が描く形の縁 */\nexport type LineKind = \"value\" | \"call\" | \"tie\" | \"stub\" | \"write\" | \"valve\";\n\n/** 置いた線の 1 本の線分。`group` が同じ線どうしは重なってよい */\nexport interface Laid {\n a: Point;\n b: Point;\n owner: string;\n group: string;\n kind: LineKind;\n width: number;\n}\n\n/** 管の端。始まりは `at` から `dir` の向きに出て、終わりは `dir` の向きに進んで `at` に入る。`cost` はこの端を使う時に足す値 */\nexport interface End {\n at: Point;\n dir: Dir;\n cost?: number;\n}\n\nexport interface Ask {\n owner: string;\n group: string;\n kind: LineKind;\n width: number;\n starts: readonly End[];\n ends: readonly End[];\n /** 通ってよい障害の番号 */\n allow?: ReadonlySet<number>;\n /** 置いた線を直角に越える時に足す値。`undefined` は越えない */\n cross: (l: Laid) => number | undefined;\n /** 平行な線と縁どうしの間の下限 */\n gap: number;\n /** 折れる時に足す値 */\n bend: number;\n /**\n * 障害の縁と、ほかの線の隣の筋に沿って走る時に、長さを減らす割合。0 より大きいと、管は縁と先に引いた管に寄り添って束になり、\n * 内側から順に引いた管が入れ子に並ぶ。値が同じ道が幾つも在る時に、どれを選ぶかを決める\n */\n hug?: number;\n /**\n * 同じ組の置いた線と重なって走る辺の長さに掛ける割合。1 より小さいと、後から引く管は先に引いた同じ組の管の道を幹として共に通り、\n * 相手の近くで枝分かれする。省くと 1 で、重なっても値は減らない\n */\n share?: number;\n}\n\n/** 道を探す障害。`pad` だけ広げた四角の中を通らない */\nexport interface Obstacle {\n rect: Rect;\n pad: number;\n}\n\nconst near = (a: number, b: number): boolean => Math.abs(a - b) < 0.5;\n\n/** 並べた数の中で `v` 以上の最初の番号 */\nfunction lowerBound(list: readonly number[], v: number): number {\n let lo = 0;\n let hi = list.length;\n while (lo < hi) {\n const mid = (lo + hi) >> 1;\n if ((list[mid] as number) < v) lo = mid + 1;\n else hi = mid;\n }\n return lo;\n}\n\n/** 数を並べ、`min` より近い数を 1 つにまとめる。`keep` の数は必ず残す */\nexport function gridLines(values: readonly number[], keep: readonly number[], min: number): number[] {\n // 残す値は丸めない。丸めると槽の縁が縁の内側へずれ、口から外へ出る辺が槽の中と数えられる\n const out: number[] = [];\n for (const v of [...keep].sort((a, b) => a - b)) if (out.length === 0 || v - (out[out.length - 1] as number) > 0.01) out.push(v);\n for (const v of [...values].sort((a, b) => a - b)) {\n const i = lowerBound(out, v);\n const lo = out[i - 1];\n const hi = out[i];\n if ((lo !== undefined && v - lo < min) || (hi !== undefined && hi - v < min)) continue;\n out.splice(i, 0, v);\n }\n return out;\n}\n\n/**\n * 値の小さい順に取り出す山。値が同じ物の順は、入れ替えて並べ直す山と同じ。\n * 入れた時の道の値 (`g`) も持ち、取り出した物の `g` を `poppedG` で返す。\n * 道を探すたびに山を作らず、型付きの配列を使い回す (#3472)。並べ方は配列で持っていた時と同じで、取り出す順は変わらない\n */\nclass Heap {\n private costs = new Float64Array(1024);\n private states = new Int32Array(1024);\n private gs = new Float64Array(1024);\n private n = 0;\n /** 最後に取り出した物を入れた時の道の値 */\n poppedG = 0;\n\n clear(): void {\n this.n = 0;\n }\n\n size(): number {\n return this.n;\n }\n\n push(cost: number, state: number, g: number): void {\n if (this.n === this.costs.length) this.grow();\n const { costs, states, gs } = this;\n let i = this.n++;\n while (i > 0) {\n const p = (i - 1) >> 1;\n const pc = costs[p] as number;\n if (pc <= cost) break;\n costs[i] = pc;\n states[i] = states[p] as number;\n gs[i] = gs[p] as number;\n i = p;\n }\n costs[i] = cost;\n states[i] = state;\n gs[i] = g;\n }\n\n pop(): number {\n const { costs, states, gs } = this;\n const top = states[0] as number;\n this.poppedG = gs[0] as number;\n const m = --this.n;\n if (m > 0) {\n const lastC = costs[m] as number;\n const lastS = states[m] as number;\n const lastG = gs[m] as number;\n let i = 0;\n for (;;) {\n const l = i * 2 + 1;\n const r = l + 1;\n let k = i;\n let kc = lastC;\n if (l < m && (costs[l] as number) < kc) {\n k = l;\n kc = costs[l] as number;\n }\n if (r < m && (costs[r] as number) < kc) {\n k = r;\n kc = costs[r] as number;\n }\n if (k === i) break;\n costs[i] = kc;\n states[i] = states[k] as number;\n gs[i] = gs[k] as number;\n i = k;\n }\n costs[i] = lastC;\n states[i] = lastS;\n gs[i] = lastG;\n }\n return top;\n }\n\n private grow(): void {\n const size = this.costs.length * 2;\n const costs = new Float64Array(size);\n const states = new Int32Array(size);\n const gs = new Float64Array(size);\n costs.set(this.costs);\n states.set(this.states);\n gs.set(this.gs);\n this.costs = costs;\n this.states = states;\n this.gs = gs;\n }\n}\nconst open = new Heap();\n\n/**\n * 置いた線と格子の辺の関わり。`cross` は直角に越えるか触れる、`along` は平行に `d` だけ離れて並ぶ。\n * `cross` の `d` は、辺が線分の端の間を越える時 0、線分の端に触れる時 1\n */\ninterface Mark {\n laid: number;\n rel: \"cross\" | \"along\";\n d: number;\n}\n\n/** 障害も印も無い辺が返す空の列。辺ごとに空の配列を作らない (#3472) */\nconst NONE: readonly never[] = [];\n\n/** 道を探す作業の配列。格子の点の数で決まる大きさを持ち、Router を作り直しても使い回す (#3472) */\ninterface Work {\n seen: Uint32Array;\n best: Float64Array;\n from: Int32Array;\n goal: Uint32Array;\n goalCost: Float64Array;\n hSeen: Uint32Array;\n hCost: Float64Array;\n vSeen: Uint32Array;\n vCost: Float64Array;\n hHug: Uint8Array;\n vHug: Uint8Array;\n hJoin: Int32Array;\n vJoin: Int32Array;\n /** 点ごとの終わりまでの見積もりと、それを求めた探しの番号 */\n guessSeen: Uint32Array;\n guessVal: Float64Array;\n}\nlet shared: Work | undefined;\n/** 道を探すたびに 1 つ進める番号。作業の配列を Router の間で使い回すため、全ての Router で 1 つの番号を数える */\nlet epoch = 0;\n\n/** `cells` 個の格子の点を探せる作業の配列。前に作った配列が足りる時は使い回す */\nfunction workFor(cells: number): Work {\n if (shared && shared.hSeen.length >= cells) return shared;\n const size = cells * 4;\n shared = {\n seen: new Uint32Array(size),\n best: new Float64Array(size),\n from: new Int32Array(size),\n goal: new Uint32Array(size),\n goalCost: new Float64Array(size),\n hSeen: new Uint32Array(cells),\n hCost: new Float64Array(cells),\n vSeen: new Uint32Array(cells),\n vCost: new Float64Array(cells),\n hHug: new Uint8Array(cells),\n vHug: new Uint8Array(cells),\n hJoin: new Int32Array(cells),\n vJoin: new Int32Array(cells),\n guessSeen: new Uint32Array(cells),\n guessVal: new Float64Array(cells),\n };\n // 新しい配列の番号は全て 0 なので、0 より大きい番号から数え直す\n epoch = 0;\n return shared;\n}\n\nexport class Router {\n readonly xs: readonly number[];\n readonly ys: readonly number[];\n readonly laid: Laid[] = [];\n private readonly nx: number;\n private readonly ny: number;\n /** 横の辺 (i, j)-(i+1, j) と縦の辺 (i, j)-(i, j+1) が通る障害。障害の無い辺は持たない (#3472) */\n private readonly hObs: (number[] | undefined)[];\n private readonly vObs: (number[] | undefined)[];\n private readonly hMarks: (Mark[] | undefined)[];\n private readonly vMarks: (Mark[] | undefined)[];\n /** 障害の広げた縁の上を通る辺 */\n private readonly hRail: Uint8Array;\n private readonly vRail: Uint8Array;\n /** `edgeCost` が最後に見た辺が、縁かほかの線の隣の筋か */\n private lastRail = false;\n /** `edgeCost` が最後に見た辺が、同じ組の置いた線と重なって走るか */\n private lastShared = false;\n /** `edgeCost` が最後に見た辺が直角に越えるか触れる、同じ組の置いた線分の番号。無ければ -1 */\n private lastJoin = -1;\n\n constructor(xs: readonly number[], ys: readonly number[], obstacles: readonly Obstacle[]) {\n this.xs = xs;\n this.ys = ys;\n this.nx = xs.length;\n this.ny = ys.length;\n // 辺の数だけ空の配列を作ると、開いた箱を持つ図では Router ごとに 10 万個を超え、作るだけで描く時間の 1 割を使った (#3472)\n this.hObs = new Array<number[] | undefined>(this.nx * this.ny);\n this.vObs = new Array<number[] | undefined>(this.nx * this.ny);\n this.hMarks = new Array<Mark[] | undefined>(this.nx * this.ny);\n this.vMarks = new Array<Mark[] | undefined>(this.nx * this.ny);\n this.hRail = new Uint8Array(this.nx * this.ny);\n this.vRail = new Uint8Array(this.nx * this.ny);\n obstacles.forEach((o) => {\n const x0 = o.rect.x - o.pad;\n const x1 = o.rect.x + o.rect.w + o.pad;\n const y0 = o.rect.y - o.pad;\n const y1 = o.rect.y + o.rect.h + o.pad;\n // 上と下の縁の上を走る横の辺と、左と右の縁の上を走る縦の辺\n for (const y of [y0, y1]) {\n const j = this.iy(y);\n if (j < 0) continue;\n for (let i = Math.max(0, lowerBound(xs, x0 - 0.25)); i < this.nx - 1 && (xs[i + 1] as number) <= x1 + 0.25; i++) this.hRail[j * this.nx + i] = 1;\n }\n for (const x of [x0, x1]) {\n const i = this.ix(x);\n if (i < 0) continue;\n for (let j = Math.max(0, lowerBound(ys, y0 - 0.25)); j < this.ny - 1 && (ys[j + 1] as number) <= y1 + 0.25; j++) this.vRail[j * this.nx + i] = 1;\n }\n });\n obstacles.forEach((o, k) => {\n const x0 = o.rect.x - o.pad;\n const x1 = o.rect.x + o.rect.w + o.pad;\n const y0 = o.rect.y - o.pad;\n const y1 = o.rect.y + o.rect.h + o.pad;\n // 横の辺は、高さが四角の中で、横の範囲が四角と重なる物\n for (let j = lowerBound(ys, y0 + 1e-6); j < this.ny && (ys[j] as number) < y1 - 1e-6; j++)\n for (let i = Math.max(0, lowerBound(xs, x0) - 1); i < this.nx - 1 && (xs[i] as number) < x1 - 1e-6; i++)\n if ((xs[i + 1] as number) > x0 + 1e-6) (this.hObs[j * this.nx + i] ??= []).push(k);\n for (let i = lowerBound(xs, x0 + 1e-6); i < this.nx && (xs[i] as number) < x1 - 1e-6; i++)\n for (let j = Math.max(0, lowerBound(ys, y0) - 1); j < this.ny - 1 && (ys[j] as number) < y1 - 1e-6; j++)\n if ((ys[j + 1] as number) > y0 + 1e-6) (this.vObs[j * this.nx + i] ??= []).push(k);\n });\n }\n\n private ix(x: number): number {\n const i = lowerBound(this.xs, x - 0.25);\n return i < this.nx && near(this.xs[i] as number, x) ? i : -1;\n }\n private iy(y: number): number {\n const j = lowerBound(this.ys, y - 0.25);\n return j < this.ny && near(this.ys[j] as number, y) ? j : -1;\n }\n\n /** 線分を置き、関わる格子の辺に印を付ける。線分は縦か横 */\n private mark(index: number): void {\n const l = this.laid[index] as Laid;\n const reach = l.width / 2 + 40;\n if (near(l.a[1], l.b[1])) {\n const y = l.a[1];\n const lo = Math.min(l.a[0], l.b[0]);\n const hi = Math.max(l.a[0], l.b[0]);\n // 縦の辺のうち、線分の横の範囲の中を通り、高さが線分にかかる物\n for (let i = lowerBound(this.xs, lo - 0.25); i < this.nx && (this.xs[i] as number) <= hi + 0.25; i++)\n for (let j = Math.max(0, lowerBound(this.ys, y) - 1); j < this.ny - 1 && (this.ys[j] as number) <= y + 0.25; j++)\n if ((this.ys[j + 1] as number) >= y - 0.25) (this.vMarks[j * this.nx + i] ??= []).push({ laid: index, rel: \"cross\", d: (this.xs[i] as number) > lo + 0.5 && (this.xs[i] as number) < hi - 0.5 ? 0 : 1 });\n // 横の辺のうち、近くを平行に走る物\n for (let j = lowerBound(this.ys, y - reach); j < this.ny && (this.ys[j] as number) <= y + reach; j++)\n for (let i = Math.max(0, lowerBound(this.xs, lo) - 1); i < this.nx - 1 && (this.xs[i] as number) < hi; i++)\n if ((this.xs[i + 1] as number) > lo) (this.hMarks[j * this.nx + i] ??= []).push({ laid: index, rel: \"along\", d: Math.abs((this.ys[j] as number) - y) });\n } else {\n const x = l.a[0];\n const lo = Math.min(l.a[1], l.b[1]);\n const hi = Math.max(l.a[1], l.b[1]);\n for (let j = lowerBound(this.ys, lo - 0.25); j < this.ny && (this.ys[j] as number) <= hi + 0.25; j++)\n for (let i = Math.max(0, lowerBound(this.xs, x) - 1); i < this.nx - 1 && (this.xs[i] as number) <= x + 0.25; i++)\n if ((this.xs[i + 1] as number) >= x - 0.25) (this.hMarks[j * this.nx + i] ??= []).push({ laid: index, rel: \"cross\", d: (this.ys[j] as number) > lo + 0.5 && (this.ys[j] as number) < hi - 0.5 ? 0 : 1 });\n for (let i = lowerBound(this.xs, x - reach); i < this.nx && (this.xs[i] as number) <= x + reach; i++)\n for (let j = Math.max(0, lowerBound(this.ys, lo) - 1); j < this.ny - 1 && (this.ys[j] as number) < hi; j++)\n if ((this.ys[j + 1] as number) > lo) (this.vMarks[j * this.nx + i] ??= []).push({ laid: index, rel: \"along\", d: Math.abs((this.xs[i] as number) - x) });\n }\n }\n\n /** 線を置く。後から探す道は、この線と重ならず、越えるかは頼む側が決める */\n lay(points: readonly Point[], line: Omit<Laid, \"a\" | \"b\">): void {\n for (let k = 1; k < points.length; k++) {\n const a = points[k - 1] as Point;\n const b = points[k] as Point;\n if (near(a[0], b[0]) && near(a[1], b[1])) continue;\n this.laid.push({ ...line, a, b });\n this.mark(this.laid.length - 1);\n }\n }\n\n /** 辺を通る時に足す値。通れない辺は `undefined` */\n private edgeCost(ask: Ask, horizontal: boolean, index: number): number | undefined {\n const obs = (horizontal ? this.hObs : this.vObs)[index] ?? NONE;\n for (const o of obs) if (!ask.allow?.has(o)) return undefined;\n let extra = 0;\n this.lastRail = ((horizontal ? this.hRail : this.vRail)[index] as number) === 1;\n this.lastShared = false;\n this.lastJoin = -1;\n /** この辺で越える値を足した組。幹を共に通る何本もの線を越える時も、1 本を越える値だけを足す */\n let charged: string[] | undefined;\n for (const m of (horizontal ? this.hMarks : this.vMarks)[index] ?? NONE) {\n const l = this.laid[m.laid] as Laid;\n if (l.group === ask.group) {\n // 同じ組の線は重ねて共に通ってよいが、少しずれて並ぶと二重の線に見えるため、重ならない時は間を取る\n if (m.rel === \"along\") {\n if (m.d > 0.5 && m.d < (l.width + ask.width) / 2 + ask.gap) return undefined;\n if (m.d <= 0.5) this.lastShared = true;\n } else if (m.d === 0 && this.lastJoin < 0) this.lastJoin = m.laid;\n continue;\n }\n if (m.rel === \"along\") {\n const least = (l.width + ask.width) / 2 + ask.gap;\n if (m.d < least) return undefined;\n // 隣の筋。間の下限から、この線の太さの分までの離れ\n if (m.d < least + ask.width) this.lastRail = true;\n continue;\n }\n const c = ask.cross(l);\n if (c === undefined) return undefined;\n if (charged?.includes(l.group)) continue;\n (charged ??= []).push(l.group);\n extra += c;\n }\n return extra;\n }\n\n /** 格子の上の真っすぐな線分 a-b を、頼む側の決まりで通れるか。端が格子に無い時は通れないとする */\n passable(ask: Ask, a: Point, b: Point): boolean {\n let i = this.ix(a[0]);\n let j = this.iy(a[1]);\n const ti = this.ix(b[0]);\n const tj = this.iy(b[1]);\n if (i < 0 || j < 0 || ti < 0 || tj < 0 || (i !== ti && j !== tj)) return false;\n let join = -1;\n while (i !== ti || j !== tj) {\n const d: Dir = ti > i ? 0 : ti < i ? 2 : tj > j ? 1 : 3;\n const ni = i + DX[d];\n const nj = j + DY[d];\n const horizontal = d === 0 || d === 2;\n const index = horizontal ? j * this.nx + Math.min(i, ni) : Math.min(j, nj) * this.nx + i;\n if (this.edgeCost(ask, horizontal, index) === undefined) return false;\n // 同じ組の線を突き抜けない\n if (this.lastJoin >= 0 && this.lastJoin === join) return false;\n join = this.lastJoin;\n i = ni;\n j = nj;\n }\n return true;\n }\n\n /**\n * 始まりの端のどれかから終わりの端のどれかまでの、値の最も小さい道。端は格子の点に在る。\n * 道が無ければ `undefined`。返す点は折れる所だけ\n */\n route(ask: Ask): Point[] | undefined {\n const { nx, ny } = this;\n const { seen, best, from, goal, goalCost, hSeen, hCost, vSeen, vCost, hHug, vHug, hJoin, vJoin, guessSeen, guessVal } = workFor(nx * ny);\n const hug = ask.hug ?? 0;\n const share = ask.share ?? 1;\n const ep = ++epoch;\n const bestOf = (st: number): number => (seen[st] === ep ? (best[st] as number) : Number.POSITIVE_INFINITY);\n open.clear();\n let goals = 0;\n for (const e of ask.ends) {\n const i = this.ix(e.at[0]);\n const j = this.iy(e.at[1]);\n if (i < 0 || j < 0) continue;\n const st = (j * nx + i) * 4 + e.dir;\n // 同じ点と向きの終わりが 2 つ在る時は、後に書いた方の値を使う\n goal[st] = ep;\n goalCost[st] = e.cost ?? 0;\n goals++;\n }\n if (goals === 0) return undefined;\n const ex = Float64Array.from(ask.ends, (e) => e.at[0]);\n const ey = Float64Array.from(ask.ends, (e) => e.at[1]);\n // 見積もりは点と終わりの端だけで決まるため、同じ探しの中では点ごとに 1 度だけ求める。\n // 山に入れるたびに全ての終わりの端と比べると、開いた箱を持つ図では探しの時間の多くを使った (#3472)\n const guess = (i: number, j: number): number => {\n const node = j * nx + i;\n if (guessSeen[node] === ep) return guessVal[node] as number;\n const x = this.xs[i] as number;\n const y = this.ys[j] as number;\n let m = Number.POSITIVE_INFINITY;\n for (let k = 0; k < ex.length; k++) {\n const v = Math.abs((ex[k] as number) - x) + Math.abs((ey[k] as number) - y);\n if (v < m) m = v;\n }\n // 寄り添う辺は長さを減らして数えるため、見積もりも同じ割合で減らし、見積もりが本当の値を超えないようにする。\n // 同じ組の線と重なる辺はさらに減らして数えるが、見積もりは減らさない。見積もりが本当の値を超える所では、\n // 相手へ向かう幹を先に辿るため幹を共に通る道が早く見つかり、探す点の数も増えない\n const v = m * (1 - hug);\n guessSeen[node] = ep;\n guessVal[node] = v;\n return v;\n };\n /** 辺を通る時に足す値。通れない辺は -1。同じ探しの中では辺の値は変わらないため、1 度だけ求める */\n const edge = (horizontal: boolean, index: number): number => {\n const stamp = horizontal ? hSeen : vSeen;\n const cost = horizontal ? hCost : vCost;\n if (stamp[index] === ep) return cost[index] as number;\n const extra = this.edgeCost(ask, horizontal, index);\n stamp[index] = ep;\n cost[index] = extra === undefined ? -1 : extra;\n // 辺の走り方。0 はほかの線から離れて走る、1 は縁かほかの線の隣の筋に寄り添う、2 は同じ組の線と重なって走る\n (horizontal ? hHug : vHug)[index] = this.lastShared ? 2 : this.lastRail ? 1 : 0;\n (horizontal ? hJoin : vJoin)[index] = this.lastJoin;\n return cost[index];\n };\n /** 辺の長さに掛ける割合 */\n const rate = (run: number): number => (run === 2 ? share : run === 1 ? 1 - hug : 1);\n /** 点 (i, j) から向き d に 1 つ進む値。進めない時は -1 */\n const stepCost = (i: number, j: number, d: Dir): number => {\n const ni = i + DX[d];\n const nj = j + DY[d];\n if (ni < 0 || nj < 0 || ni >= nx || nj >= ny) return -1;\n const horizontal = d === 0 || d === 2;\n const index = horizontal ? j * nx + Math.min(i, ni) : Math.min(j, nj) * nx + i;\n const extra = edge(horizontal, index);\n if (extra < 0) return -1;\n const len = horizontal ? Math.abs((this.xs[ni] as number) - (this.xs[i] as number)) : Math.abs((this.ys[nj] as number) - (this.ys[j] as number));\n return len * rate((horizontal ? hHug : vHug)[index] as number) + extra;\n };\n /**\n * 点 (i, j) へ向き d で入った辺と、そのまま d へ進む辺が、同じ組の同じ線分を直角に越えるか。\n * 越えると同じ組の線を突き抜けて十字の継ぎ目になるため、その進み方を選ばない\n */\n const piercing = (i: number, j: number, d: Dir): boolean => {\n const horizontal = d === 0 || d === 2;\n const pi = i - DX[d];\n const pj = j - DY[d];\n const ni = i + DX[d];\n const nj = j + DY[d];\n if (pi < 0 || pj < 0 || ni < 0 || nj < 0 || pi >= nx || pj >= ny || ni >= nx || nj >= ny) return false;\n const joins = horizontal ? hJoin : vJoin;\n const stamp = horizontal ? hSeen : vSeen;\n const before = horizontal ? j * nx + Math.min(i, pi) : Math.min(j, pj) * nx + i;\n const after = horizontal ? j * nx + Math.min(i, ni) : Math.min(j, nj) * nx + i;\n if (stamp[before] !== ep || stamp[after] !== ep) return false;\n const a = joins[before] as number;\n return a >= 0 && a === joins[after];\n };\n for (const s of ask.starts) {\n const i = this.ix(s.at[0]);\n const j = this.iy(s.at[1]);\n if (i < 0 || j < 0) continue;\n const c = stepCost(i, j, s.dir);\n if (c < 0) continue;\n const ni = i + DX[s.dir];\n const nj = j + DY[s.dir];\n const state = (nj * nx + ni) * 4 + s.dir;\n const g = c + (s.cost ?? 0);\n if (g < bestOf(state)) {\n seen[state] = ep;\n best[state] = g;\n from[state] = -2 - ((j * nx + i) * 4 + s.dir);\n open.push(g + guess(ni, nj), state, g);\n }\n }\n let found = -1;\n let foundCost = Number.POSITIVE_INFINITY;\n const bend = ask.bend;\n while (open.size() > 0) {\n const state = open.pop();\n const g = best[state] as number;\n if (g >= foundCost) break;\n // 後から小さい値で入れ直した状態の古い物は飛ばす。新しい物は値が小さいため先に取り出して同じ値で広げ終えており、\n // 広げ直しても山に入れる物も辺の覚えも変わらない (#3472)。終わりの状態は、新しい物を広げずに終えた時があるため飛ばさない\n const isGoal = goal[state] === ep;\n if (!isGoal && open.poppedG > g) continue;\n const node = state >> 2;\n const d = (state & 3) as Dir;\n if (isGoal && g + (goalCost[state] as number) < foundCost) {\n found = state;\n foundCost = g + (goalCost[state] as number);\n continue;\n }\n const i = node % nx;\n const j = (node - i) / nx;\n // そのまま進む、右へ折れる、左へ折れるの順に試す\n for (let t = 0; t < 3; t++) {\n const nd = (t === 0 ? d : t === 1 ? (d + 1) & 3 : (d + 3) & 3) as Dir;\n const c = stepCost(i, j, nd);\n if (c < 0 || (t === 0 && piercing(i, j, d))) continue;\n const ni = i + DX[nd];\n const nj = j + DY[nd];\n const ng = t === 0 ? g + c : g + c + bend;\n const ns = (nj * nx + ni) * 4 + nd;\n if (seen[ns] !== ep || ng < (best[ns] as number)) {\n seen[ns] = ep;\n best[ns] = ng;\n from[ns] = state;\n open.push(ng + guess(ni, nj), ns, ng);\n }\n }\n }\n if (found < 0) return undefined;\n const states: number[] = [];\n let s = found;\n for (;;) {\n states.push(s);\n const f = from[s] as number;\n if (f <= -2) {\n states.push(-2 - f);\n break;\n }\n s = f;\n }\n states.reverse();\n const pts: Point[] = states.map((st) => {\n const node = st >> 2;\n const i = node % nx;\n return [this.xs[i] as number, this.ys[(node - i) / nx] as number];\n });\n return simplify(pts);\n }\n}\n\n/**\n * 道の途中の、`min` より短い段差を消す。段差の前か後ろの線を段差の分だけずらし、ずらした線が `ok` で通れる時だけ採る。\n * 前と後ろの線が逆向きに走る短い段差 (U の形) は、格子 (`grid`) を渡した時だけ、U の底の線を段差の向きに格子の線までずらして段差を `min` まで伸ばす。\n * 端の点は動かさない\n */\nexport function unjog(points: readonly Point[], min: number, ok: (a: Point, b: Point) => boolean, grid?: { xs: readonly number[]; ys: readonly number[] }): Point[] {\n let pts = simplify(points);\n for (let guard = 0; guard < 8; guard++) {\n let changed = false;\n for (let i = 0; i + 1 < pts.length && !changed; i++) {\n const p = pts[i] as Point;\n const q = pts[i + 1] as Point;\n const len = Math.abs(q[0] - p[0]) + Math.abs(q[1] - p[1]);\n if (len >= min) continue;\n const before = pts[i - 1];\n const after = pts[i + 2];\n const dx = q[0] - p[0];\n const dy = q[1] - p[1];\n // 前と後ろの線が両方在る時は、同じ向きに走る段差 (Z の形) を詰める。逆向き (U の形) を詰めると線が重なるため、U の底をずらして段差を伸ばす\n if (before && after) {\n const sameWay = near(before[0], p[0]) ? Math.sign(p[1] - before[1]) === Math.sign(after[1] - q[1]) : Math.sign(p[0] - before[0]) === Math.sign(after[0] - q[0]);\n if (!sameWay) {\n const grown = grid ? stretch(pts, i, min, ok, grid) : undefined;\n if (grown) {\n pts = grown;\n changed = true;\n }\n continue;\n }\n }\n // 前の線をずらす。前の線の始まり (端の点でもよい) は動かさない\n if (before && i - 2 >= 0) {\n const b2 = pts[i - 2] as Point;\n const moved: Point = [before[0] + dx, before[1] + dy];\n if (ok(b2, moved) && ok(moved, q)) {\n pts = simplify([...pts.slice(0, i - 1), moved, ...pts.slice(i + 1)]);\n changed = true;\n continue;\n }\n }\n // 後ろの線をずらす。後ろの線の終わり (端の点でもよい) は動かさない\n if (after && i + 3 <= pts.length - 1) {\n const a2 = pts[i + 3] as Point;\n const moved: Point = [after[0] - dx, after[1] - dy];\n if (ok(p, moved) && ok(moved, a2)) {\n pts = simplify([...pts.slice(0, i + 1), moved, ...pts.slice(i + 3)]);\n changed = true;\n continue;\n }\n }\n // 詰められない Z の形の段差は、前の線を段差と逆の向きへ、または後ろの線を段差の向きへずらして `min` まで伸ばす。\n // 前と後ろの線の筋が、それぞれ別の部品の際で決まっていて揃えられない時に残る\n if (before && after && len > 0.5) {\n const grown = widen(pts, i, min, ok, grid);\n if (grown) {\n pts = grown;\n changed = true;\n }\n }\n }\n if (!changed) break;\n }\n return pts;\n}\n\n/**\n * U の形の短い段差 (`pts[i]` から `pts[i + 1]`) を `min` まで伸ばす。段差の後ろの線を段差の向きへ、段差の前の線を逆の向きへ、\n * 格子の線までずらす。ずらした線と、その先の線が `min` 以上で通れる時だけ採る。端の点は動かさない\n */\nfunction stretch(pts: readonly Point[], i: number, min: number, ok: (a: Point, b: Point) => boolean, grid: { xs: readonly number[]; ys: readonly number[] }): Point[] | undefined {\n const p = pts[i] as Point;\n const q = pts[i + 1] as Point;\n const vertical = near(p[0], q[0]);\n const axis = vertical ? 1 : 0;\n const lines = vertical ? grid.ys : grid.xs;\n const dir = Math.sign(q[axis] - p[axis]);\n const at = (v: Point, c: number): Point => (vertical ? [v[0], c] : [c, v[1]]);\n // 段差の終わりを先へ。後ろの線 (q から after) を段差の向きにずらし、その先の線 (after から a2) が短くなる\n const after = pts[i + 2];\n const a2 = pts[i + 3];\n if (after && a2) {\n const ends = lines.filter((c) => (c - p[axis]) * dir >= min).sort((u, v) => Math.abs(u - p[axis]) - Math.abs(v - p[axis]));\n for (const c of ends.slice(0, 4)) {\n const q2 = at(q, c);\n const after2 = at(after, c);\n const rest = (a2[axis] - c) * Math.sign(a2[axis] - after[axis]);\n if (rest < min || Math.sign(a2[axis] - c) !== Math.sign(a2[axis] - after[axis])) continue;\n if (ok(p, q2) && ok(q2, after2) && ok(after2, a2)) return simplify([...pts.slice(0, i + 1), q2, after2, ...pts.slice(i + 3)]);\n }\n }\n // 段差の始まりを手前へ。前の線 (before から p) を段差の逆の向きにずらし、その手前の線 (b2 から before) が短くなる\n const before = pts[i - 1];\n const b2 = pts[i - 2];\n if (before && b2) {\n const starts = lines.filter((c) => (q[axis] - c) * dir >= min).sort((u, v) => Math.abs(u - q[axis]) - Math.abs(v - q[axis]));\n for (const c of starts.slice(0, 4)) {\n const p2 = at(p, c);\n const before2 = at(before, c);\n const rest = (c - b2[axis]) * Math.sign(before[axis] - b2[axis]);\n if (rest < min || Math.sign(c - b2[axis]) !== Math.sign(before[axis] - b2[axis])) continue;\n if (ok(b2, before2) && ok(before2, p2) && ok(p2, q)) return simplify([...pts.slice(0, i - 1), before2, p2, ...pts.slice(i + 1)]);\n }\n }\n return undefined;\n}\n\n/**\n * Z の形の短い段差 (`pts[i]` から `pts[i + 1]`) を `min` まで伸ばす。段差の前の線を段差と逆の向きへずらすか、\n * 後ろの線を段差の向きへずらす。ずらす先は、格子 (`grid`) を渡した時は格子の線、渡さない時は段差がちょうど `min` になる所。\n * ずらした線と、その前と後ろの線が `ok` で通れる時だけ採る。端の点は動かさない\n */\nfunction widen(\n pts: readonly Point[],\n i: number,\n min: number,\n ok: (a: Point, b: Point) => boolean,\n grid?: { xs: readonly number[]; ys: readonly number[] },\n): Point[] | undefined {\n const p = pts[i] as Point;\n const q = pts[i + 1] as Point;\n const axis = near(p[0], q[0]) ? 1 : 0;\n const dir = Math.sign(q[axis] - p[axis]);\n const at = (v: Point, c: number): Point => (axis === 1 ? [v[0], c] : [c, v[1]]);\n const lines = grid ? (axis === 1 ? grid.ys : grid.xs) : undefined;\n /** 基の点 `from` から `dir` の逆 (`sign` が -1) か同じ向き (1) へ、`min` 以上離れた筋。近い順 */\n const targets = (from: number, sign: number): number[] =>\n lines\n ? lines.filter((c) => (c - from) * sign * dir >= min - 0.5).sort((u, v) => Math.abs(u - from) - Math.abs(v - from)).slice(0, 4)\n : [from + sign * dir * min];\n const before = pts[i - 1];\n const b2 = pts[i - 2];\n if (before && b2)\n for (const c of targets(q[axis], -1)) {\n const mb = at(before, c);\n const mp = at(p, c);\n if (ok(b2, mb) && ok(mb, mp) && ok(mp, q)) return simplify([...pts.slice(0, i - 1), mb, mp, ...pts.slice(i + 1)]);\n }\n const after = pts[i + 2];\n const a2 = pts[i + 3];\n if (after && a2)\n for (const c of targets(p[axis], 1)) {\n const mq = at(q, c);\n const ma = at(after, c);\n if (ok(p, mq) && ok(mq, ma) && ok(ma, a2)) return simplify([...pts.slice(0, i + 1), mq, ma, ...pts.slice(i + 3)]);\n }\n return undefined;\n}\n\n/** 一直線に並ぶ点を外し、折れる所と端だけを残す */\nexport function simplify(points: readonly Point[]): Point[] {\n const out: Point[] = [];\n for (const p of points) {\n const last = out[out.length - 1];\n if (last && near(last[0], p[0]) && near(last[1], p[1])) continue;\n const prev = out[out.length - 2];\n if (prev && last && ((near(prev[0], last[0]) && near(last[0], p[0])) || (near(prev[1], last[1]) && near(last[1], p[1])))) out[out.length - 1] = p;\n else out.push(p);\n }\n return out;\n}\n","/**\n * 配管の図の置き場所の形と、段ごとの値を当てる手順 (#3389、#3418)。見た目の元は Tracelyth の第6回の試作の「4 配管」(#3398)。\n *\n * 関係者の種類は行から導く。残高の単位に名前を書かれた関係者はトークンの Contract、最初の呼び出しを呼んだ者は送り手、\n * ほかに呼ぶか呼ばれる者は Contract、どちらでもない者は口座。\n * 段の中の出来事は記法を読む所と同じ手順 (`PipeRun`) に当て、段ごとの残高と値と、変更が暫定か確定か取り消しかを作る。\n * 変更は一番外の呼び出しが戻った段で確定し、落ちた呼び出しの内側の変更は、落ちた段で取り消しの印を付けて元の値へ戻る。\n * `[fold]` の呼び出しの内側の段は、描く前に 1 つの段へまとめる (`foldPipe`)。\n *\n * 部品の置き場所を組む手順 (`layoutPipe`) は、槽と値の札を持ち主ごとの囲いにまとめ、流れでつながる囲いを隣に並べる。\n * 流れが輪になる時は、輪の 1 つを下の段に置いて輪にする。\n * 名札は自分の囲いの真上に置き、呼び出しの深さで行を下げる。トークンの箱は自分のトークンの値の管の横に走る所に載せる。\n * 値の管は槽の横の口どうしを結び、ほかの値の管と交わらない。呼び出しの管は値の管を直角に 1 回だけくぐり、名札と槽を横切らない。\n * 管の道は `pipe-route.ts` が格子の上で探す。道が見つからない時は、囲いの間と管の道を広げて組み直す。\n * 決まりの表 (`pipe-rules.ts`) は組んだ置き場所を後から測る。組み方は表を読まず、表の値が守れる間を空けて置く。\n * 狭い枠では、図を枠の幅に縮めても槽の残高と今の段の値が読める大きさの字で組み直す。\n * 並べ方は描き方を読まない。描く部品は `render/pipe.ts` とブロックの描き方が持つ (#3418)。\n */\nimport { ETH } from \"../../blocks/definition-values\";\nimport { joinWords } from \"../../figure-text\";\nimport { textWidth } from \"../../layout/measure\";\nimport type { Layout, Point, Rect } from \"../../layout/scene\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport type { TextStyle } from \"../../look/values\";\nimport { type Ask, type Dir, type End, gridLines, type Laid, type Obstacle, Router, simplify, unjog } from \"../../pipe-route\";\nimport { checkPasses, isFault, keyOf, minus, PipeRun, rateOf } from \"../../pipe-run\";\nimport { valveRects } from \"../../pipe-valve\";\nimport type { CheckOp, DiagramModel, PipeCallKind, PipeCheck, PipeFold, Step } from \"../../schema\";\nimport { DEFAULT_LANG, type NotationLang } from \"../../words\";\n\n\n/** 変更の印。`none` は変わっていない、`provisional` は暫定、`final` は確定、`rolled` は取り消し */\nexport type PipeState = \"none\" | \"provisional\" | \"final\" | \"rolled\";\n/** 関係者の種類 */\nexport type PipeRole = \"sender\" | \"contract\" | \"token\" | \"account\";\n/** 名札の形。`round` は丸の名札、`cabinet` は Contract の箱、`token` はトークンの箱 */\nexport type PipeShape = \"round\" | \"cabinet\" | \"token\";\n\n/** 配管の図の言葉。図の原本は語を持たないので、描く時の言葉で引く */\nexport interface PipeWords {\n tags: Record<Exclude<PipeState, \"none\">, string>;\n /** 始めた人が払った槽の印と、受け取った槽の印 */\n io: { in: string; out: string };\n fold: (steps: number, parties: number) => string;\n open: string;\n foldTitle: (name: string) => string;\n join: (titles: readonly string[]) => string;\n}\n\nexport const PIPE_TEXT: Record<NotationLang, PipeWords> = {\n ja: {\n tags: { provisional: \"暫定\", final: \"確定\", rolled: \"取り消し\" },\n io: { in: \"入力\", out: \"出力\" },\n fold: (steps, parties) => `内側の${steps}段と${parties}人`,\n open: \"押すと開く\",\n foldTitle: (name) => `${name}の内側をまとめて進む`,\n join: (titles) => `${titles.join(\"。\")}。`,\n },\n en: {\n tags: { provisional: \"Pending\", final: \"Final\", rolled: \"Undone\" },\n io: { in: \"In\", out: \"Out\" },\n fold: (steps, parties) => `${steps} ${steps === 1 ? \"step\" : \"steps\"} and ${parties} ${parties === 1 ? \"party\" : \"parties\"} inside`,\n open: \"Click to open\",\n foldTitle: (name) => `Inside ${name}, folded`,\n join: (titles) => `${titles.join(\". \")}.`,\n },\n};\n\n/**\n * 呼ぶ側が渡す配管の図の語 (#3584)。画面を持つ側が自分の語 (成功、リバートなど) で描くために、`RenderOptions` の `words.pipe` で渡す。\n * 一部だけ渡せ、渡さない語は描く言葉の語 (`PIPE_TEXT`) で描く。数と名前が入る文は `{steps}`、`{parties}`、`{name}` の所に差し込む\n */\nexport interface PipeWordsInput {\n /** 槽の下の数に添える語。`provisional` は暫定、`final` は確定、`rolled` は取り消し */\n tags?: Partial<Record<Exclude<PipeState, \"none\">, string>>;\n /** 始めた人が払った槽の札 (`in`) と、受け取った槽の札 (`out`) */\n io?: Partial<Record<\"in\" | \"out\", string>>;\n /** 内側の段をまとめた枠の文。`{steps}` に内側の段の数、`{parties}` に内側の関係者の数を差し込む */\n fold?: string;\n /** まとめた枠を押すと開くことを知らせる語 */\n open?: string;\n /** まとめた段の題。`{name}` に呼ばれた関係者の名前を差し込む */\n foldTitle?: string;\n}\n\n/** `{鍵}` の所に値を差し込む。値を持たない鍵は書いたまま残す */\nconst fill = (template: string, values: Record<string, string | number>): string =>\n template.replace(/\\{(\\w+)\\}/gu, (whole, key: string) => (key in values ? String(values[key]) : whole));\n\n/** 描く言葉の語に、呼ぶ側が渡した語を重ねる (#3584) */\nexport function pipeWords(lang: NotationLang, given?: PipeWordsInput): PipeWords {\n const base = PIPE_TEXT[lang];\n if (!given) return base;\n const { fold, foldTitle } = given;\n return {\n tags: { ...base.tags, ...given.tags },\n io: { ...base.io, ...given.io },\n fold: fold === undefined ? base.fold : (steps, parties) => fill(fold, { steps, parties }),\n open: given.open ?? base.open,\n foldTitle: foldTitle === undefined ? base.foldTitle : (name) => fill(foldTitle, { name }),\n join: base.join,\n };\n}\n\n/** 比べ方の字。`>=` は `≥` のように、読む時の字にする */\nexport const OP_TEXT: Record<CheckOp, string> = { \">=\": \"≥\", \"<=\": \"≤\", \"==\": \"=\", \"!=\": \"≠\", \">\": \">\", \"<\": \"<\" };\n\n/** 字。`base` は基準線で、字は `x` から左寄せで書く */\nexport interface PipeText extends Rect {\n text: string;\n base: number;\n}\n\n/** 段の中の出来事の場所。その段で起きた物だけが持ち、描く所はこの出来事の時刻に出す */\nexport interface PipeAt {\n step: number;\n event?: number;\n}\n\nexport interface PipeParty extends Rect {\n id: string;\n name: string;\n role: PipeRole;\n icon?: string;\n shape: PipeShape;\n /** 名札の行。一番上が 0。トークンの箱は持たない */\n row?: number;\n /** 名前の字。丸の名札は丸の下、箱は箱の中に書く */\n label: PipeText;\n /** 槽か値の札を持つか */\n holder: boolean;\n}\nexport interface PipeColumn extends Rect {\n party: string;\n step: number;\n folded: boolean;\n}\n/** 段ごとの名札。`active` は段の終わりにいちばん内側で開いている呼び出しの呼ばれた者、`involved` はその段の出来事に出る者 */\nexport interface PipePill extends Rect {\n party: string;\n step: number;\n folded: boolean;\n active: boolean;\n involved: boolean;\n}\nexport interface PipeTank extends Rect {\n party: string;\n token: string;\n title: PipeText;\n /** 液の色の番号。トークンごとに 3 つの色を順に使う */\n tone: number;\n}\n/** 段ごとの槽 */\nexport interface PipeGlass extends PipeTank {\n step: number;\n}\nexport interface PipeLevel extends Rect, PipeAt {\n party: string;\n token: string;\n amount: string;\n state: PipeState;\n /** 槽の下の今の残高。3 桁ごとに区切る */\n text: PipeText;\n /** 残高の下の増えた分か減った分 (`+100 USDC`)。変わった段から確定するまでと、確定と取り消しの段に出す。狭い枠では出さない */\n delta?: PipeText;\n /** 増減の下に添える暫定か確定か取り消しの語 */\n tag?: PipeText;\n /** 前の量の水位。前の数を持つ槽だけが持つ */\n base?: Rect;\n /** 段の始まりの水位。この段で変わった槽だけが持つ */\n from?: Rect;\n}\n/** トークンごとの管の横に走る所。トークンの箱を載せる管の所で、弁 (`valve`) はトークンの Contract の弁。`ETH` の管と、トークンの箱を描かない管は弁を持たない */\nexport interface PipeBus {\n token: string;\n y: number;\n x1: number;\n x2: number;\n valve?: { party: string; x: number; y: number };\n}\n/** 値の管の口。槽の左か右の縁の上の点 */\nexport interface PipePort {\n party: string;\n token: string;\n side: \"left\" | \"right\";\n x: number;\n y: number;\n}\n/**\n * 値の管。持ち主の槽の横の口どうしを結ぶ折れ線。`from` と `to` は最初に流れた向き。\n * `group` は幹の組で、同じ組の管は根の槽の口を共に出て 1 本の幹を重なって通り、相手の近くで枝分かれする。組の違う管とは重ならない\n */\nexport interface PipeValuePipe {\n token: string;\n from: string;\n to: string;\n points: Point[];\n ports: [PipePort, PipePort];\n tone: number;\n group: string;\n}\n/** 値の管を持たないトークンの箱を、持ち主の槽へ結ぶ短い管 */\nexport interface PipeStub {\n token: string;\n points: Point[];\n}\n/** 呼び出しの管が値の管の下をくぐる所。`pipe` は値の管 (`valuePipes`) の番号、`vertical` は呼び出しの管が縦に走るか */\nexport interface PipeCrossing {\n call: number;\n token: string;\n pipe: number;\n x: number;\n y: number;\n vertical: boolean;\n}\n/**\n * 図の中の札。`kind` は役で、流れた量 (`amount`)、イベント (`event`)、戻り値 (`return`)、計器の式 (`formula`)、入力と出力の印 (`io`)。\n * `size` は字の大きさ、`rx` は角の丸み (どちらも図の座標)。戻り値の札は呼び出しの管 (`path`) を伝って動き、呼んだ側に着いて消える\n */\nexport interface PipeChip extends Rect, PipeAt {\n kind: \"amount\" | \"event\" | \"return\" | \"formula\" | \"io\" | \"delta\";\n text: string;\n size: number;\n rx: number;\n label: PipeText;\n party?: string;\n token?: string;\n /**\n * 流れた量の札が名指す流れ (`PipeFlow` の `id`、#3528)。崩れの確かめが、札と流れの管の離れを測る。\n * 狭い枠の図の下の帯に並べた札は、管から離して置くと決めた札なので持たない\n */\n flow?: number;\n /** 札の色の役。`state` は流れた量とイベントの印、`ok` は計器の式の結果 */\n state?: PipeState;\n ok?: boolean;\n tone?: number;\n /** 戻り値の札が伝う道 (呼ばれた側から呼んだ側へ) と、戻した呼び出しの番号 */\n path?: Point[];\n call?: number;\n}\nexport interface PipeBusAt extends PipeBus {\n step: number;\n}\nexport interface PipeFlow extends PipeAt {\n /** 流れた分の番号。同じ流れた分を段をまたいで引く */\n id: number;\n step: number;\n token: string;\n from: string;\n to: string;\n amount: string;\n state: PipeState;\n points: Point[];\n /** 向きの印の場所と向き。`vertical` は縦に走る所の印で、`dir` は右か下へ流れる時 1、左か上へ -1 */\n arrow: { x: number; y: number; dir: 1 | -1; vertical: boolean };\n tone: number;\n /** この段で流れたか。流れた段は斜線の液の塊が管を通り抜ける */\n fresh: boolean;\n}\nexport interface PipeCallLane {\n index: number;\n step: number;\n event: number;\n from: string;\n to: string;\n depth: number;\n /** 呼んだ者の本管の高さ */\n y: number;\n kind: \"call\" | PipeCallKind;\n width: number;\n /** 呼んだ者の真ん中から本管を通り、枝の端まで */\n points: Point[];\n /** 光る管の道。呼んだ者の名札を出た所から、枝の端まで */\n lit: Point[];\n value?: string;\n close?: { step: number; event: number; how: \"return\" | \"revert\" };\n}\n/**\n * 本管の枝。弁 (`valve`) は枝の上の、ほかの線から離れた所に置く。`vertical` は弁を置いた所が縦に走るか、\n * `under` は取っ手を管の下 (縦の管では左) に立てるか。取っ手は上 (縦の管では右) の側にほかの線が通る時に下の側へ立てる\n */\nexport interface PipeBranch {\n to: string;\n points: Point[];\n valve: { x: number; y: number; vertical: boolean; under: boolean };\n}\n/** 同じ関係者から出る呼び出しの本管 */\nexport interface PipeMain {\n from: string;\n y: number;\n points: Point[];\n branches: PipeBranch[];\n}\n/** 段ごとの開いている呼び出し。`opened` はこの段で開いた出来事、`shut` はこの段で閉じた出来事 */\nexport interface PipeLane {\n call: number;\n step: number;\n from: string;\n to: string;\n kind: \"call\" | PipeCallKind;\n width: number;\n points: Point[];\n opened?: number;\n shut?: number;\n}\nexport interface PipePlate extends Rect, PipeAt {\n party: string;\n name: string;\n value: string;\n state: PipeState;\n /** トークンの箱の中の値か */\n boxed: boolean;\n label: PipeText;\n text: PipeText;\n was?: PipeText;\n strike?: Rect;\n /** 前の値と今の値の間の矢印。トークンの箱の中の値だけが持つ */\n arrow?: PipeText;\n /** 前の値に添える語。トークンの箱の外の値だけが持つ */\n tag?: PipeText;\n}\nexport interface PipeWrite {\n step: number;\n event: number;\n from: string;\n to: string;\n name: string;\n points: Point[];\n}\n/** 計器。`on` は載せる管 (`call` は呼び出しの管、`value` は値の管、`party` は呼ばれない者の名札の横)。式は図の中の札 (`formula`) が持つ */\nexport interface PipeGauge extends Rect {\n party: string;\n step: number;\n event: number;\n ok: boolean;\n on: \"call\" | \"value\" | \"party\";\n cx: number;\n cy: number;\n r: number;\n /** その段で確かめたか。確かめた段は針が振れて印が付く */\n fresh: boolean;\n /** 段の始まりと終わりの針の向き (度) */\n from: number;\n angle: number;\n /** 通ったかの印 */\n lamp: { x: number; y: number; r: number };\n /** 値の管から計器までの軸 */\n stem?: { y1: number; y2: number };\n}\nexport interface PipeEventChip extends Rect, PipeAt {\n /** 出した順の番号。同じ札を段をまたいで引く */\n id: number;\n party: string;\n name: string;\n emitted: number;\n state: PipeState;\n text: PipeText;\n args?: PipeText;\n}\n/** 変換器。`calc` を行う関係者の 2 つの槽の間に、全ての段で置き、計算した段だけ `active` */\nexport interface PipeConverter extends Rect {\n party: string;\n step: number;\n calc: number;\n event?: number;\n in: string;\n out: string;\n rate: string;\n active: boolean;\n cx: number;\n cy: number;\n r: number;\n /** 左の槽の右の縁と右の槽の左の縁。変換器と槽を短い管で結ぶ */\n left: number;\n right: number;\n}\n/** 持ち主ごとの槽と値の札の点線の囲い。`row` は囲いの段 (一番上が 0) */\nexport interface PipeHousing extends Rect {\n party: string;\n row: number;\n}\n/** 名札から自分の槽へ下りる点線 */\nexport interface PipeTie {\n party: string;\n x: number;\n y1: number;\n y2: number;\n}\nexport interface PipeFoldBox extends Rect {\n party: string;\n step: number;\n call: number;\n steps: number;\n parties: number;\n title: PipeText;\n value: PipeText;\n text: PipeText;\n}\nexport interface PipeRing {\n party: string;\n step: number;\n event: number;\n}\nexport interface PipeLayout extends Layout {\n kind: \"pipe\";\n /** 広い枠は縮めずに横に長いまま並べ、狭い枠は枠の幅に縮める */\n arrangement: \"wide\" | \"fit\";\n parties: PipeParty[];\n columns: PipeColumn[];\n pills: PipePill[];\n tanks: PipeTank[];\n glasses: PipeGlass[];\n levels: PipeLevel[];\n buses: PipeBus[];\n pipes: PipeBusAt[];\n flows: PipeFlow[];\n calls: PipeCallLane[];\n mains: PipeMain[];\n lanes: PipeLane[];\n plates: PipePlate[];\n writes: PipeWrite[];\n gauges: PipeGauge[];\n /** 図の上の確認の印。第6回の形は計器に結果を残すので、図の上には描かない */\n checks: [];\n events: PipeEventChip[];\n converters: PipeConverter[];\n housings: PipeHousing[];\n ties: PipeTie[];\n folds: PipeFoldBox[];\n rings: PipeRing[];\n valuePipes: PipeValuePipe[];\n stubs: PipeStub[];\n crossings: PipeCrossing[];\n chips: PipeChip[];\n /** 狭い枠に合わせて並べたか。狭い枠は図を枠の幅に縮めて全体を出す */\n narrow: boolean;\n /** 段ごとに動く関係者を囲む所。再生の部品が横に送る時と、寄って追う窓が段ごとに見る */\n focus: (Rect & { step: number })[];\n}\n\nexport interface PipeLayoutOptions {\n lang?: NotationLang;\n /** 呼ぶ側が渡す語 (#3584)。渡さない語は `lang` の語で描く */\n words?: PipeWordsInput;\n /** 描く枠の幅。`PIPE_LOOK.narrow.frame` より狭い枠では、槽の残高と今の段の値を大きな字で出す */\n width?: number;\n}\n\n// ---- 字\n\nexport function textAt(text: string, x: number, base: number, style: TextStyle, anchor: \"start\" | \"middle\" = \"start\"): PipeText {\n const w = textWidth(text, style);\n return { text, x: anchor === \"middle\" ? x - w / 2 : x, y: base - style.size * 0.8, w, h: style.size, base };\n}\n\n/** 高さ `h` の札の上の端 `top` から、字の真ん中を札の真ん中に置く基準線 */\nexport const middleBase = (top: number, h: number, style: TextStyle): number => top + h / 2 + style.size * 0.35;\n\n// ---- 畳む\n\n/**\n * `[fold]` の呼び出しの内側の段を 1 つの段にまとめる。内側の段は、畳んだ呼び出しを開いた段の次の段から閉じた段の前の段まで。\n * `open` に番号 (出てきた順) を持つ呼び出しは畳まない。まとめた段は内側の段の出来事を順に持ち、題と本文は描く時の言葉で作る。\n * 畳んだ呼び出しの内側の `[fold]` の呼び出しは、外の箱に入るので畳まない。\n * 箱ごとに、内側の段にだけ出て、まとめなかった段に出ない関係者を `hidden` に持つ。宣言しただけで段に出ない関係者は内側に数えない\n */\nexport function foldPipe(diagram: DiagramModel, open: readonly number[] = [], lang: NotationLang = DEFAULT_LANG, given?: PipeWordsInput): DiagramModel {\n interface Opened {\n index: number;\n step: number;\n from: string;\n to: string;\n fold: boolean;\n close?: number;\n }\n const calls: Opened[] = [];\n const stack: Opened[] = [];\n diagram.steps.forEach((step, s) => {\n for (const e of step.events) {\n if (e.type === \"call\") {\n const call: Opened = { index: calls.length, step: s, from: e.from, to: e.to, fold: e.fold === true };\n calls.push(call);\n stack.push(call);\n } else if (e.type === \"return\" || e.type === \"revert\") {\n const closed = stack.pop();\n if (closed) closed.close = s;\n }\n }\n });\n const words = pipeWords(lang, given);\n const names = new Map(diagram.boxes.map((b) => [b.id, b.name]));\n const steps: Step[] = [];\n const folds: PipeFold[] = [];\n let s = 0;\n while (s < diagram.steps.length) {\n steps.push(diagram.steps[s] as Step);\n const folded = calls.find((c) => c.fold && c.step === s && c.close !== undefined && c.close - s >= 2 && !open.includes(c.index));\n if (!folded || folded.close === undefined) {\n s++;\n continue;\n }\n const inner = diagram.steps.slice(s + 1, folded.close);\n folds.push({ call: folded.index, step: steps.length, from: s + 1, to: folded.close - 1, hidden: [] });\n steps.push({\n title: words.foldTitle(names.get(folded.to) ?? folded.to),\n body: words.join(inner.map((step) => step.title)),\n events: inner.flatMap((step) => step.events),\n });\n s = folded.close;\n }\n if (folds.length === 0) return diagram;\n const boxed = new Set(folds.map((f) => f.step));\n const outside = new Set(steps.flatMap((step, k) => (boxed.has(k) ? [] : step.events.flatMap(partiesOf))));\n for (const fold of folds) fold.hidden = [...new Set((steps[fold.step] as Step).events.flatMap(partiesOf))].filter((id) => !outside.has(id));\n return { ...diagram, steps, pipe: { holds: diagram.pipe?.holds ?? [], folds } };\n}\n\n/** 出来事に出る関係者。呼び出しの両端と、行の頭の者と、`move` の送り手と受け手 */\nexport function partiesOf(e: Step[\"events\"][number]): string[] {\n if (e.type === \"call\") return [e.from, e.to];\n if (!(\"box\" in e)) return [];\n return e.type === \"move\" ? [e.box, e.from, e.to] : [e.box];\n}\n\n// ---- 段ごとの値を当てる\n\nexport interface CallRec {\n index: number;\n step: number;\n event: number;\n from: string;\n to: string;\n depth: number;\n kind: \"call\" | PipeCallKind;\n label?: string;\n value?: string;\n inner: boolean;\n close?: { step: number; event: number; how: \"return\" | \"revert\" };\n}\nexport interface FlowRec {\n id: number;\n step: number;\n event: number;\n token: string;\n from: string;\n to: string;\n amount: string;\n}\nexport interface EmitRec {\n id: number;\n step: number;\n event: number;\n party: string;\n name: string;\n args?: string[];\n}\nexport interface CheckRec {\n step: number;\n event: number;\n party: string;\n ok: boolean;\n check: Pick<PipeCheck, \"left\" | \"op\" | \"right\">;\n}\nexport interface CalcRec {\n step: number;\n event: number;\n party: string;\n input: string;\n output: string;\n rate: string;\n}\nexport interface Snap {\n balances: Map<string, string>;\n values: Map<string, string>;\n /** 鍵の印。鍵は `b<持ち主>|<トークン>`、`v<持ち主>|<名前>`、`e<イベントの番号>`、`f<流れた分の番号>` */\n states: Map<string, PipeState>;\n was: Map<string, string>;\n /** この段で変わった鍵と、変えた出来事 */\n changed: Map<string, number>;\n emitted: number[];\n active?: string;\n status?: { kind: \"pending\" | \"final\" | \"rolled\" | \"partial\"; count: number; event?: number };\n}\n\nexport interface Simulated {\n calls: CallRec[];\n flows: FlowRec[];\n emits: EmitRec[];\n checks: CheckRec[];\n calcs: CalcRec[];\n writes: { step: number; event: number; from: string; to: string; name: string }[];\n reverts: { step: number; event: number; party: string; reason?: string }[];\n returns: { step: number; event: number; call: number; value: string }[];\n snaps: Snap[];\n tokens: Map<string, string>;\n}\n\nexport function simulate(diagram: DiagramModel, foldSteps: ReadonlySet<number>): Simulated {\n const holds = diagram.pipe?.holds ?? [];\n const run = new PipeRun(diagram.boxes, holds);\n const out: Simulated = { calls: [], flows: [], emits: [], checks: [], calcs: [], writes: [], reverts: [], returns: [], snaps: [], tokens: new Map(run.tokens) };\n const base = new Map<string, string>();\n for (const [k, v] of run.balances) base.set(`b${k}`, v);\n for (const [k, v] of run.values) base.set(`v${k}`, v);\n const prevBase = new Map<string, string>();\n const sets: Set<string>[] = [new Set()];\n const finals = new Set<string>();\n const opened: CallRec[] = [];\n const valueOf = (k: string): string | undefined => (k.startsWith(\"b\") ? run.balances.get(k.slice(1)) : k.startsWith(\"v\") ? run.values.get(k.slice(1)) : undefined);\n const stored = (k: string): boolean => k.startsWith(\"b\") || k.startsWith(\"v\");\n\n diagram.steps.forEach((step, s) => {\n const rolled = new Map<string, string>();\n const finalNow = new Set<string>();\n const changed = new Map<string, number>();\n let statusEvent: number | undefined;\n const touch = (k: string, e: number): void => {\n (sets[sets.length - 1] as Set<string>).add(k);\n finals.delete(k);\n rolled.delete(k);\n if (!changed.has(k)) changed.set(k, e);\n };\n step.events.forEach((e, ei) => {\n switch (e.type) {\n case \"call\": {\n const rec: CallRec = {\n index: out.calls.length,\n step: s,\n event: ei,\n from: e.from,\n to: e.to,\n depth: run.frames.length,\n kind: e.call ?? \"call\",\n inner: foldSteps.has(s),\n ...(e.label !== undefined ? { label: e.label } : {}),\n ...(e.value !== undefined ? { value: e.value } : {}),\n };\n out.calls.push(rec);\n if (run.call(e)) break;\n opened.push(rec);\n sets.push(new Set());\n if (e.value !== undefined) {\n const id = out.flows.length;\n out.flows.push({ id, step: s, event: ei, token: ETH, from: e.from, to: e.to, amount: e.value });\n touch(`b${keyOf(e.from, ETH)}`, ei);\n touch(`b${keyOf(e.to, ETH)}`, ei);\n touch(`f${id}`, ei);\n }\n break;\n }\n case \"return\":\n case \"revert\": {\n const before = run.snapshot();\n const closed = run.close(e.box, e.type);\n if (isFault(closed)) break;\n const rec = opened.pop();\n if (rec) rec.close = { step: s, event: ei, how: e.type };\n const inside = sets.pop() ?? new Set<string>();\n if (e.type === \"return\") {\n for (const k of inside) (sets[sets.length - 1] as Set<string>).add(k);\n if (e.value !== undefined && rec) out.returns.push({ step: s, event: ei, call: rec.index, value: e.value });\n if (run.frames.length === 0) {\n const root = sets[0] as Set<string>;\n if ([...root].some(stored)) statusEvent = ei;\n for (const k of root) {\n finalNow.add(k);\n finals.add(k);\n if (stored(k)) {\n prevBase.set(k, base.get(k) ?? \"\");\n base.set(k, valueOf(k) ?? \"\");\n }\n if (!changed.has(k)) changed.set(k, ei);\n }\n root.clear();\n }\n } else {\n for (const k of inside) {\n rolled.set(k, k.startsWith(\"b\") ? (before.balances.get(k.slice(1)) ?? \"\") : k.startsWith(\"v\") ? (before.values.get(k.slice(1)) ?? \"\") : \"\");\n changed.set(k, ei);\n }\n if ([...inside].some(stored)) statusEvent = ei;\n out.reverts.push({ step: s, event: ei, party: e.box, ...(e.reason !== undefined ? { reason: e.reason } : {}) });\n }\n break;\n }\n case \"move\": {\n if (run.move(e)) break;\n const token = run.tokens.get(e.box) ?? \"\";\n const id = out.flows.length;\n out.flows.push({ id, step: s, event: ei, token, from: e.from, to: e.to, amount: e.amount });\n touch(`b${keyOf(e.from, token)}`, ei);\n touch(`b${keyOf(e.to, token)}`, ei);\n touch(`f${id}`, ei);\n break;\n }\n case \"write\": {\n const owner = run.write(e);\n if (isFault(owner)) break;\n touch(`v${keyOf(owner, e.name)}`, ei);\n out.writes.push({ step: s, event: ei, from: e.box, to: owner, name: e.name });\n break;\n }\n case \"emit\": {\n const id = run.emit();\n if (isFault(id)) break;\n touch(`e${id}`, ei);\n out.emits.push({ id, step: s, event: ei, party: e.box, name: e.name, ...(e.args ? { args: e.args } : {}) });\n break;\n }\n case \"check\":\n out.checks.push({ step: s, event: ei, party: e.box, ok: checkPasses(e), check: e });\n break;\n case \"calc\":\n out.calcs.push({ step: s, event: ei, party: e.box, input: e.in, output: e.out, rate: rateOf(e.in, e.out) });\n break;\n default:\n break;\n }\n });\n const pending = (k: string): boolean => sets.some((set) => set.has(k));\n const stateOf = (k: string): PipeState => (rolled.has(k) ? \"rolled\" : pending(k) ? \"provisional\" : finals.has(k) ? \"final\" : \"none\");\n const states = new Map<string, PipeState>();\n const was = new Map<string, string>();\n const keys = [\n ...[...run.balances.keys()].map((k) => `b${k}`),\n ...[...run.values.keys()].map((k) => `v${k}`),\n ...out.emits.map((x) => `e${x.id}`),\n ...out.flows.map((x) => `f${x.id}`),\n ];\n for (const k of keys) {\n const state = stateOf(k);\n states.set(k, state);\n if (!stored(k)) continue;\n const now = valueOf(k);\n const old = state === \"rolled\" ? rolled.get(k) : state === \"provisional\" ? base.get(k) : state === \"final\" ? prevBase.get(k) : undefined;\n if (old !== undefined && old !== now) was.set(k, old);\n }\n const rolledStored = [...rolled.keys()].filter(stored).length;\n const pendingStored = keys.filter((k) => stored(k) && pending(k)).length;\n const status: Snap[\"status\"] =\n rolledStored > 0\n ? { kind: run.frames.length === 0 ? \"rolled\" : \"partial\", count: rolledStored, ...(statusEvent !== undefined ? { event: statusEvent } : {}) }\n : [...finalNow].some(stored)\n ? { kind: \"final\", count: 0, ...(statusEvent !== undefined ? { event: statusEvent } : {}) }\n : pendingStored > 0\n ? { kind: \"pending\", count: pendingStored }\n : undefined;\n const top = run.frames[run.frames.length - 1];\n out.snaps.push({\n balances: new Map(run.balances),\n values: new Map(run.values),\n states,\n was,\n changed,\n emitted: [...new Set([...run.emitted, ...[...rolled.keys()].filter((k) => k.startsWith(\"e\")).map((k) => Number(k.slice(1)))])].sort((a, b) => a - b),\n ...(top ? { active: top.to } : {}),\n ...(status ? { status } : {}),\n });\n });\n return out;\n}\n\n// ---- 字の形\n\n/** 量の字を 3 桁ごとに区切る (#3398)。数でない字はそのまま */\nexport function grouped(amount: string): string {\n const m = /^(-?)(\\d+)(\\.\\d+)?$/u.exec(amount);\n return m ? `${m[1] ?? \"\"}${(m[2] ?? \"\").replace(/\\B(?=(\\d{3})+(?!\\d))/gu, \",\")}${m[3] ?? \"\"}` : amount;\n}\n\nconst P = PIPE_LOOK;\nconst T = PIPE_TYPE;\n\n/** 字の大きさ。狭い枠では、縮めても読める大きさに上げる */\ninterface Sizes {\n amount: number;\n chip: number;\n}\n\n/** 組む時の間の広さ。管が通らない時に広げて組み直す */\ninterface Plan {\n /** 囲いの間に足す幅 */\n gap: number;\n /** 管を通す道の下限の数 */\n lanes: number;\n /** 名札の行の間に足す高さ */\n rows: number;\n /** 囲いの外側の道の数 */\n outer: number;\n /** 最後の組み方。値の管がほかの値の管を越えてよい (決まりの表が違反に数える) */\n last: boolean;\n}\n\nconst PLANS: Plan[] = [\n { gap: 0, lanes: 1, rows: 0, outer: 2, last: false },\n { gap: P.lane.pitch, lanes: 2, rows: P.lane.pitch, outer: 3, last: false },\n { gap: P.lane.pitch * 2, lanes: 3, rows: P.lane.pitch, outer: P.lane.outer, last: false },\n { gap: P.lane.pitch * 2, lanes: 3, rows: P.lane.pitch, outer: P.lane.outer, last: true },\n];\n\n/** 組んだ置き場所の覚え。色味を替えて描き直す時と、同じ図を何度も描く時に組み直さない */\nconst CACHE = new Map<string, PipeLayout>();\nconst CACHE_SIZE = 48;\n\n/** 札の高さ。入力と出力の印は囲いの上の余白に収める */\nconst IO_H = 20;\n/** 平行な管の縁どうしの間と、管と部品の間 */\nconst LINE_GAP = 10;\n/** 呼び出しの管の上の弁と計器の間 */\nconst SPACING = P.call.room;\n/** 呼び出しの管は、呼ばれた側の縁からこの長さ手前で向きを揃えてから入る */\nconst APPROACH = 18;\n/** 部品どうしの間の下限 */\nconst PART_GAP = 8;\n/** 同じ横から出る管の高さの間。管の太さと平行な管の縁どうしの間 */\nconst LANE_STEP = P.call.case + LINE_GAP;\n/**\n * 呼び出しの管が箱の縁の角から離れる長さ。管の太さの半分と角の丸み。\n * これより角に近い所から出入りする管は角の丸みにかかり、箱の縁の後ろを通って見える (#3523)\n */\nconst cornerRoom = (radius: number): number => P.call.case / 2 + radius;\n/**\n * 一番上の行の名札の上の空き。名札を越えて上の口へ下りる管が、口の手前の線 (`APPROACH`) の 1 本上を、\n * 図の上の縁から管の太さ 1 本分離れて通る (#3523)\n */\nconst TOP_ROOM = APPROACH + P.call.case + P.call.case / 2 + P.call.case;\n/** 呼び出しの管の弁が描く形 (胴と軸と取っ手) と、ほかの線の縁の間の下限。決まりの表 (`valve-clearance`) と同じ値 */\nconst VALVE_ROOM = 3;\n/**\n * 上の行の者から真下の行の者へ下りる呼び出しの管の、弁を縦に置ける長さ。弁の胴を下りる前の横の線 (同じ者の管が共に通る) から離し、\n * 下へ倒れる開いた取っ手を呼ばれた側の名札から離す。弁の置き場所は 4px 刻みで探すため、その 1 刻みを足す\n */\nconst VALVE_DROP = P.call.case / 2 + VALVE_ROOM + P.valve.r + 4 + (P.valve.lever - P.valve.leverH / 2) + VALVE_ROOM;\n/**\n * 幹を共に通る値の管が、先に引いた同じ組の管と重なって走る所の長さに掛ける割合。\n * 小さいほど幹を長く共に通る。重なった所を離れて並ぶ道より安くし、遠回りしてまで共に通らない値にする\n */\nconst SHARE = 0.3;\n/** 値の管が折れる時に足す値 */\nconst BEND_VALUE = 60;\n/** 弁を置くために引き直す呼び出しの管の、元の道の長さに対する長さの上限 */\nconst DETOUR_RATE = 1.5;\n/** ほかの管の弁に譲る呼び出しの管が、名札の縁から出て折れるまでの短い長さ。自分の弁が両側に決まりの間を空けて載る */\nconst SHORT_RUN = P.valve.r * 2 + P.call.room + VALVE_ROOM * 2;\n\nconst amountNumber = (amount: string | undefined): number => {\n const n = Number(amount);\n return Number.isFinite(n) ? n : 0;\n};\nconst mean = (xs: readonly number[]): number => xs.reduce((a, b) => a + b, 0) / xs.length;\nconst sized = (style: TextStyle, size: number): TextStyle => ({ ...style, size });\nconst grow = (r: Rect, d: number): Rect => ({ x: r.x - d, y: r.y - d, w: r.w + d * 2, h: r.h + d * 2 });\n/** 2 つの四角が `d` より離れているか */\nconst apart = (a: Rect, b: Rect, d: number): boolean => a.x + a.w + d <= b.x || b.x + b.w + d <= a.x || a.y + a.h + d <= b.y || b.y + b.h + d <= a.y;\n/** 線分と四角 (`pad` だけ広げた) が重なるか。線分は縦か横 */\nfunction hits(a: Point, b: Point, r: Rect, pad: number): boolean {\n const x0 = Math.min(a[0], b[0]) - pad;\n const x1 = Math.max(a[0], b[0]) + pad;\n const y0 = Math.min(a[1], b[1]) - pad;\n const y1 = Math.max(a[1], b[1]) + pad;\n return x1 > r.x && x0 < r.x + r.w && y1 > r.y && y0 < r.y + r.h;\n}\n/** 折れの数の上限。決まりの表の `bends` と同じ値 */\nconst MAX_BENDS = 4;\nconst bendsOf = (points: readonly Point[]): number => Math.max(0, simplify(points).length - 2);\n/** 流れた量の札を管に沿って置く所 (線分の長さに対する割合)。真ん中に近い順に試し、どれも塞がる時は細かく刻んだ所を試す */\nconst AMOUNT_AT = [0.5, 0.3, 0.7, 0.15, 0.85, 0.4, 0.6, 0.2, 0.8, 0.1, 0.9, 0.25, 0.75, 0.35, 0.65, 0.45, 0.55, 0.05, 0.95];\n/** 呼び出しの管が 1 本の値の管を 2 度越える時に、探し直す道でその管の組を越える値 */\nconst REVISIT = 2000;\n/** 折れ線 `p` が折れ線 `q` を直角に越える回数。端どうしで触れるだけの所は数えない */\nfunction crossedTimes(p: readonly Point[], q: readonly Point[]): number {\n let n = 0;\n for (const [a, b] of segs(p))\n for (const [u, v] of segs(q)) {\n const fa = flat(a, b);\n if (fa === flat(u, v)) continue;\n const [h1, h2, v1, v2] = fa ? [a, b, u, v] : [u, v, a, b];\n const x = v1[0];\n const y = h1[1];\n if (x > Math.min(h1[0], h2[0]) + 1e-6 && x < Math.max(h1[0], h2[0]) - 1e-6 && y > Math.min(v1[1], v2[1]) + 1e-6 && y < Math.max(v1[1], v2[1]) - 1e-6) n++;\n }\n return n;\n}\n/** 前から順に比べて、最初に違う値で `a` が小さいか */\nconst lessThan = (a: readonly number[], b: readonly number[]): boolean => {\n const i = a.findIndex((v, j) => v !== b[j]);\n return i >= 0 && (a[i] as number) < (b[i] as number);\n};\n/** 管を引く順を試した 1 回。`score` は前から比べて小さいほど良い */\nexport interface OrderTry<L, R> {\n list: L;\n got: R;\n score: number[];\n}\n/**\n * 管を引く順を最大 4 通り試し、最良の回を返す。回ごとに `run` で引き、`score` を前から比べて小さい回を最良とする。\n * `next` が次の順を返さない回 (直す管が無い) と、前に試した順に戻った時と、前の最良より良くならなかった回でやめる (#3603)。\n * 良くならなかった回の後に別の順を試しても、配管の見本の全てで悪い管は減らず、狭い幅で箱を開いた図では\n * 最後に諦める組み方のために道を探す時間の多くを使っていた。\n * `ran` は最後に引いた順で、最良の順と違う時は、呼ぶ側が最良の順で引き直す (道の覚えは最後に引いた順の物が残るため)\n */\nexport function tryOrders<L, R>(first: L, keyOf: (list: L) => string, run: (list: L) => R, score: (got: R) => number[], next: (list: L, got: R) => L | undefined): { best: OrderTry<L, R>; ran: L } {\n let list = first;\n let best: OrderTry<L, R> | undefined;\n let ran = list;\n const tried = new Set<string>();\n for (let round = 0; round < 4 && !tried.has(keyOf(list)); round++) {\n tried.add(keyOf(list));\n ran = list;\n const got = run(list);\n const s = score(got);\n if (best && !lessThan(s, best.score)) break;\n best = { list, got, score: s };\n const after = next(list, got);\n if (after === undefined) break;\n list = after;\n }\n // 初めの回は前に試した順が無いので必ず引き、最良は必ず在る\n return { best: best as OrderTry<L, R>, ran };\n}\n/**\n * 道を探し、仕上げた道の折れが上限を超える時は、折れを重く数えて探し直す。折れが減った時だけ探し直した道を採る。\n * 長さより折れの少なさを優先した道は遠回りになることがあるため、上限を超えた時だけ使う\n */\nfunction fewerBends<T extends { points: Point[] }>(router: Router, ask: Ask, finish: (path: Point[]) => T | undefined): T | undefined {\n const first = router.route(ask);\n // 道が無い時は、折れの重さを変えても道は無い\n if (!first) return undefined;\n const done = finish(first);\n const count = (t: T | undefined): number => (t === undefined ? Number.POSITIVE_INFINITY : bendsOf(t.points));\n if (done !== undefined && count(done) <= MAX_BENDS) return done;\n const again = router.route({ ...ask, bend: ask.bend * 10 });\n const redone = again ? finish(again) : undefined;\n return count(redone) < count(done) ? redone : done;\n}\nconst segs = (points: readonly Point[]): [Point, Point][] => points.slice(1).map((b, i) => [points[i] as Point, b]);\nconst flat = (a: Point, b: Point): boolean => Math.abs(a[1] - b[1]) < 0.5;\nconst lengthOf = (points: readonly Point[]): number => segs(points).reduce((s, [a, b]) => s + Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]), 0);\n/** 点の並びを、始まりから `d` 進んだ所から先だけにする */\nfunction fromAlong(points: readonly Point[], d: number): Point[] {\n const out: Point[] = [along(points, d)];\n let walked = 0;\n for (const [a, b] of segs(points)) {\n walked += Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (walked > d) out.push(b);\n }\n return out;\n}\n/** 点の並びの上の、始まりから `d` 進んだ所 */\nfunction along(points: readonly Point[], d: number): Point {\n let left = d;\n for (const [a, b] of segs(points)) {\n const len = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (left <= len) {\n const k = len === 0 ? 0 : left / len;\n return [a[0] + (b[0] - a[0]) * k, a[1] + (b[1] - a[1]) * k];\n }\n left -= len;\n }\n return points[points.length - 1] ?? [0, 0];\n}\n\n/**\n * 縦と横の折れ線を、進む向きの左へ `d` だけずらす。角は 2 本のずらした線の交わる所に置く。\n * 同じ管を同じ段に流れた分をずらして重ねない時に使う\n */\nfunction offsetPath(points: readonly Point[], d: number): Point[] {\n if (d === 0 || points.length < 2) return points.map((p): Point => [p[0], p[1]]);\n const normal = (a: Point, b: Point): Point => {\n const dx = Math.sign(b[0] - a[0]);\n const dy = Math.sign(b[1] - a[1]);\n return [dy * d, -dx * d];\n };\n const parts = segs(points).map(([a, b]) => {\n const [nx, ny] = normal(a, b);\n return [\n [a[0] + nx, a[1] + ny],\n [b[0] + nx, b[1] + ny],\n ] as [Point, Point];\n });\n const out: Point[] = [(parts[0] as [Point, Point])[0]];\n for (let k = 1; k < parts.length; k++) {\n const [, pb] = parts[k - 1] as [Point, Point];\n const [qa] = parts[k] as [Point, Point];\n const prevFlat = Math.abs((parts[k - 1] as [Point, Point])[0][1] - pb[1]) < 0.5;\n out.push(prevFlat ? [qa[0], pb[1]] : [pb[0], qa[1]]);\n }\n out.push((parts[parts.length - 1] as [Point, Point])[1]);\n return out;\n}\n\nexport function layoutPipe(diagram: DiagramModel, options: PipeLayoutOptions = {}): PipeLayout {\n const lang = options.lang ?? DEFAULT_LANG;\n const words = pipeWords(lang, options.words);\n const frame = options.width;\n const narrow = frame !== undefined && frame < P.narrow.frame;\n // 渡した語で札の幅が変わるので、語も覚えの鍵に入れる (#3584)\n const said = `${lang}|${JSON.stringify(options.words ?? {})}`;\n const key = `${said}|${narrow ? frame : \"wide\"}|${JSON.stringify(diagram)}`;\n const hit = CACHE.get(key);\n if (hit) return hit;\n const remember = (k: string, layout: PipeLayout): PipeLayout => {\n if (CACHE.size >= CACHE_SIZE) CACHE.delete(CACHE.keys().next().value as string);\n CACHE.set(k, layout);\n return layout;\n };\n let sizes: Sizes = { amount: T.amount.size, chip: T.chip.size };\n // 狭い枠も、字の大きさを決めるために広い枠の図を先に組む。広い枠で描いた図が覚えに在ればそれを使う\n const wideKey = `${said}|wide|${JSON.stringify(diagram)}`;\n let out = CACHE.get(wideKey) ?? remember(wideKey, compose(diagram, words, sizes, false));\n if (narrow) {\n // 広い枠の図を枠の幅へ縮めた時に、画面で `px` の大きさに見える字で 1 度だけ組み直す。組み方は広い枠で組めた組み方から試す。\n // 大きな字で図が広がると縮める割合も変わるが、くり返して合わせない。札の多い図では字を上げるほど図が広がり、\n // 字が際限なく大きくなるため (aggregator は 10726px の幅に 293px の字まで広がった)。要る大きさより少し大きく組み、広がる分を見込む\n const want = Math.ceil(((P.narrow.px * out.width) / frame) * NARROW_OVER * 10) / 10;\n sizes = { amount: Math.max(T.amount.size, want), chip: Math.max(T.chip.size, want) };\n out = compose(diagram, words, sizes, true, PLAN_OF.get(out) ?? 0);\n }\n return narrow ? remember(key, out) : out;\n}\n\n/** 値の管の定め。同じトークンの、同じ 2 人の間の流れは 1 本の管を通る */\ninterface Def {\n token: string;\n from: string;\n to: string;\n flows: FlowRec[];\n}\n\n/** 組んだ図がどの組み方 (`PLANS` の番号) で組めたか */\nconst PLAN_OF = new WeakMap<PipeLayout, number>();\n/** 狭い枠の字を、要る大きさよりどれだけ大きく組むか */\nconst NARROW_OVER = 1.06;\n\nfunction compose(diagram: DiagramModel, words: PipeWords, sizes: Sizes, narrow: boolean, from = 0): PipeLayout {\n const folds = diagram.pipe?.folds ?? [];\n const foldSteps = new Set(folds.map((f) => f.step));\n const hidden = new Set(folds.flatMap((f) => f.hidden));\n const sim = simulate(diagram, foldSteps);\n const steps = diagram.steps.length;\n const stepList = Array.from({ length: steps }, (_, s) => s);\n const holds = diagram.pipe?.holds ?? [];\n const names = new Map(diagram.boxes.map((b) => [b.id, b.name]));\n const nameOf = (id: string): string => names.get(id) ?? id;\n const declaredAt = new Map(diagram.boxes.map((b, i) => [b.id, i]));\n const snapOf = (s: number): Snap => sim.snaps[s] as Snap;\n const amountStyle = sized(T.amount, sizes.amount);\n const chipStyle = T.chip;\n const chipH = P.chip.h;\n /** 狭い枠の、図の下の帯に出す大きな札の字 */\n const bigStyle = sized(T.chip, sizes.chip);\n const bigH = Math.max(P.chip.h, Math.ceil(sizes.chip * 1.6));\n\n // 関係者の並びと種類と形。畳んだ箱の内側にしか出ない関係者は並べない\n const order: string[] = [];\n const declared = new Set(diagram.boxes.map((b) => b.id));\n const see = (id: string): void => {\n if (declared.has(id) && !hidden.has(id) && !order.includes(id)) order.push(id);\n };\n for (const step of diagram.steps) for (const e of step.events) for (const id of partiesOf(e)) see(id);\n for (const b of diagram.boxes) see(b.id);\n const visible = new Set(order);\n const isBox = (id: string): boolean => sim.tokens.has(id);\n const callers = new Set(sim.calls.flatMap((c) => [c.from, c.to]));\n const callees = new Set(sim.calls.map((c) => c.to));\n const sender = sim.calls[0]?.from;\n const roleOf = (id: string): PipeRole => (isBox(id) ? \"token\" : id === sender ? \"sender\" : callers.has(id) ? \"contract\" : \"account\");\n const shapeOf = (id: string): PipeShape => (isBox(id) ? \"token\" : id === sender || !callees.has(id) ? \"round\" : \"cabinet\");\n const depthOf = new Map<string, number>(sender === undefined ? [] : [[sender, 0]]);\n for (const c of sim.calls) if (!depthOf.has(c.to)) depthOf.set(c.to, c.depth);\n const rowOf = (id: string): number => (shapeOf(id) === \"cabinet\" ? (depthOf.get(id) ?? 0) : 0);\n const shown = sim.calls.filter((c) => !c.inner && visible.has(c.from) && visible.has(c.to));\n\n // 槽と値の札。トークンの箱は槽を持たず、箱の中に値を書く\n const tanksOf = new Map<string, string[]>(order.map((id) => [id, []]));\n const platesOf = new Map<string, string[]>(order.map((id) => [id, []]));\n for (const h of holds) {\n if (\"token\" in h) tanksOf.get(h.box)?.push(h.token);\n else platesOf.get(h.box)?.push(h.name);\n }\n for (const snap of sim.snaps)\n for (const k of snap.balances.keys()) {\n const cut = k.indexOf(\"|\");\n const list = tanksOf.get(k.slice(0, cut));\n if (list && !list.includes(k.slice(cut + 1))) list.push(k.slice(cut + 1));\n }\n const tokenParty = new Map([...sim.tokens].map(([id, token]) => [token, id]));\n const varies = (party: string, token: string): boolean => {\n const initial = holds.flatMap((h) => (\"token\" in h && h.box === party && h.token === token ? [h.amount] : []))[0];\n return new Set([initial, ...sim.snaps.map((snap) => snap.balances.get(keyOf(party, token)))]).size > 1;\n };\n const gone = new Set(\n [...tokenParty].filter(([token, id]) => hidden.has(id) && !order.some((party) => (tanksOf.get(party) ?? []).includes(token) && varies(party, token))).map(([token]) => token),\n );\n for (const [party, list] of tanksOf) tanksOf.set(party, isBox(party) ? [] : list.filter((token) => !gone.has(token)));\n const has = (party: string, token: string): boolean => (tanksOf.get(party) ?? []).includes(token);\n const holders = order.filter((id) => !isBox(id) && ((tanksOf.get(id) ?? []).length > 0 || (platesOf.get(id) ?? []).length > 0));\n holders.sort((a, b) => (a === sender ? -1 : b === sender ? 1 : (declaredAt.get(a) ?? 0) - (declaredAt.get(b) ?? 0)));\n const holding = new Set(holders);\n const tokens = [...new Set(order.flatMap((id) => tanksOf.get(id) ?? []))].sort(\n (a, b) => holds.findIndex((h) => \"token\" in h && h.token === a) - holds.findIndex((h) => \"token\" in h && h.token === b),\n );\n const toneOf = (token: string): number => Math.max(0, tokens.indexOf(token)) % 3;\n const historyOf = (key: string): string[] => {\n const all = new Set<string>();\n for (const snap of sim.snaps) {\n const now = key.startsWith(\"b\") ? snap.balances.get(key.slice(1)) : snap.values.get(key.slice(1));\n if (now !== undefined) all.add(now);\n const was = snap.was.get(key);\n if (was !== undefined) all.add(was);\n }\n for (const h of holds) {\n if (\"token\" in h && key === `b${keyOf(h.box, h.token)}`) all.add(h.amount);\n if (\"name\" in h && key === `v${keyOf(h.box, h.name)}`) all.add(h.value);\n }\n return [...all];\n };\n const widest = (texts: readonly string[], style: TextStyle): number => Math.max(0, ...texts.map((t) => textWidth(t, style)));\n const boxOf = (token: string): string | undefined => {\n const id = tokenParty.get(token);\n return id !== undefined && visible.has(id) ? id : undefined;\n };\n\n // 値の管。同じトークンの同じ 2 人の間の流れは 1 本の管を通る\n const moving = sim.flows.filter((f) => !foldSteps.has(f.step) && f.from !== f.to && has(f.from, f.token) && has(f.to, f.token));\n const defs: Def[] = [];\n for (const f of moving) {\n const d = defs.find((x) => x.token === f.token && ((x.from === f.from && x.to === f.to) || (x.from === f.to && x.to === f.from)));\n if (d) d.flows.push(f);\n else defs.push({ token: f.token, from: f.from, to: f.to, flows: [f] });\n }\n const defOf = (f: FlowRec): number => defs.findIndex((d) => d.token === f.token && d.flows.includes(f));\n\n // ---- 囲いの段と並び\n\n const rank = new Map<string, number>();\n for (const f of moving) for (const id of [f.from, f.to]) if (!rank.has(id)) rank.set(id, rank.size);\n for (const h of holders) if (!rank.has(h)) rank.set(h, rank.size);\n const rankOf = (id: string): number => rank.get(id) ?? 0;\n const linked = (a: string, b: string): boolean => defs.some((d) => (d.from === a && d.to === b) || (d.from === b && d.to === a));\n // 隣の者の並び。呼び出しの浅い者を先に、同じ深さは流れに先に出た者を先にする。呼ばれない者は呼ばれる者の後\n const callDepth = (id: string): number => depthOf.get(id) ?? Number.POSITIVE_INFINITY;\n const nbrs = new Map(\n holders.map((a) => [a, holders.filter((b) => b !== a && linked(a, b)).sort((x, y) => callDepth(x) - callDepth(y) || rankOf(x) - rankOf(y))]),\n );\n /**\n * `from` から伸びる一番長い道。同じ長さの道は、呼び出しの浅い者を先に通る道。\n * 名札の行は呼び出しの深さで下がるため、浅い者の囲いを上の段に並べると、浅い者どうしの呼び出しの管が上の段の中で短く済む\n */\n const longest = (from: string, avoid: ReadonlySet<string>): string[] => {\n let best: string[] = [from];\n let budget = 20000;\n const path = [from];\n const walk = (): void => {\n if (--budget < 0) return;\n if (path.length > best.length) best = [...path];\n for (const n of nbrs.get(path[path.length - 1] as string) ?? []) {\n if (path.includes(n) || avoid.has(n)) continue;\n path.push(n);\n walk();\n path.pop();\n }\n };\n walk();\n return best;\n };\n const band0: string[] = [];\n const band1: string[] = [];\n const done = new Set<string>();\n for (const seed of [...holders].sort((a, b) => rankOf(a) - rankOf(b))) {\n if (done.has(seed)) continue;\n const comp: string[] = [];\n const queue = [seed];\n while (queue.length > 0) {\n const id = queue.shift() as string;\n if (done.has(id)) continue;\n done.add(id);\n comp.push(id);\n queue.push(...(nbrs.get(id) ?? []));\n }\n const start = sender !== undefined && comp.includes(sender) ? sender : seed;\n const path = longest(start, new Set());\n const ext = longest(start, new Set(path)).slice(1);\n const chain = [...ext.reverse(), ...path];\n // 隣どうしが 3 人とも流れでつながる所は、後から流れに出た者を下の段に下ろして輪にする\n for (let again = true; again; ) {\n again = false;\n for (let i = 1; i < chain.length - 1; i++) {\n const tri = [chain[i - 1], chain[i], chain[i + 1]] as string[];\n if (!(linked(tri[0] as string, tri[1] as string) && linked(tri[1] as string, tri[2] as string) && linked(tri[0] as string, tri[2] as string))) continue;\n const drop = tri.filter((x) => x !== start).sort((a, b) => rankOf(b) - rankOf(a))[0] as string;\n chain.splice(chain.indexOf(drop), 1);\n again = true;\n break;\n }\n }\n band0.push(...chain);\n band1.push(...comp.filter((id) => !chain.includes(id)));\n }\n const bandOf = (id: string): 0 | 1 | undefined => (band0.includes(id) ? 0 : band1.includes(id) ? 1 : undefined);\n\n // 槽の並び。流れの相手が左に居る槽を左に置く\n const posGuess = new Map<string, number>(band0.map((id, i) => [id, i]));\n for (let pass = 0; pass < 2; pass++)\n for (const id of band1) {\n const near = (nbrs.get(id) ?? []).flatMap((n) => (posGuess.has(n) && (pass > 0 || bandOf(n) === 0) ? [posGuess.get(n) as number] : []));\n posGuess.set(id, near.length > 0 ? mean(near) : band0.length / 2);\n }\n const scoreOf = (h: string, token: string): number => {\n const ds = defs.filter((d) => d.token === token && (d.from === h || d.to === h)).map((d) => (posGuess.get(d.from === h ? d.to : d.from) ?? 0) - (posGuess.get(h) ?? 0));\n return ds.length > 0 ? mean(ds) : 0;\n };\n // 相手が同じ向きに居る槽どうしは、相手が左に居る時は逆の順に並べる。向かい合う 2 つの囲いで並びが鏡になり、管が入れ子になって交わらない\n for (const h of holders) {\n const list = tanksOf.get(h) ?? [];\n list.sort((a, b) => scoreOf(h, a) - scoreOf(h, b) || (scoreOf(h, a) < 0 ? -1 : 1) * (tokens.indexOf(a) - tokens.indexOf(b)));\n }\n\n // ---- 部品の大きさ\n\n const nameW = (id: string): number => textWidth(nameOf(id), T.party);\n const arrowW = textWidth(\"→\", T.keyValue);\n /** 呼ぶ者の数。トークンの箱は呼ぶ者ごとに上から入る口を 1 つずつ持てる幅にする。横の 2 つの口は、下の段から来る管が箱の上へ回る道に残す */\n const inboundOf = (id: string): number => new Set(shown.filter((c) => c.to === id && c.from !== id).map((c) => c.from)).size;\n const topsW = (id: string): number => 2 * (Math.ceil((inboundOf(id) - 1) / 2) * (P.call.case + LINE_GAP) + P.call.case);\n const tokenW = (id: string): number =>\n Math.max(\n P.token.w,\n topsW(id),\n nameW(id) + P.token.nameW,\n ...(platesOf.get(id) ?? []).flatMap((name) => {\n const history = historyOf(`v${keyOf(id, name)}`);\n return [textWidth(name, T.key) + P.token.keyW, widest(history, T.keyValue) * 2 + arrowW + P.token.arrowGap * 2 + P.token.keyW];\n }),\n );\n const tokenH = (id: string): number => P.token.h + P.token.line * (platesOf.get(id) ?? []).length;\n const sizeOf = (id: string): { w: number; h: number } => {\n const shape = shapeOf(id);\n if (shape === \"token\") return { w: tokenW(id), h: tokenH(id) };\n if (shape === \"round\") return { w: P.avatar.size, h: P.avatar.size };\n return { w: P.cabinet.pad + nameW(id) + P.cabinet.end, h: P.cabinet.h };\n };\n /** 名札の上と下の張り出し (真ん中から)。丸の名札は下に名前を書く */\n const aboveOf = (id: string): number => sizeOf(id).h / 2;\n const belowOf = (id: string): number => (shapeOf(id) === \"round\" ? P.avatar.nameY + T.party.size * 0.35 : sizeOf(id).h / 2);\n /** 名札が横に占める幅。丸の名札は下に書く名前の幅まで */\n const roomOf = (id: string): number => (shapeOf(id) === \"round\" ? Math.max(P.avatar.size, nameW(id) + 8) : sizeOf(id).w);\n\n // イベントの札の字。同じ者が同じ段に同じ名前のイベントを 2 つ以上出した時は、1 つの札にまとめて数を添える\n const chipTextOf = (e: EmitRec): string => `${nameOf(e.party)}.${e.name}`;\n const argsOf = (e: EmitRec): string | undefined => (e.args && e.args.length > 0 ? e.args.join(\", \") : undefined);\n const chipW = (text: string, style: TextStyle = chipStyle): number => P.chip.padX * 2 + textWidth(text, style);\n const eventW = (party: string): number =>\n narrow ? 0 : Math.max(0, ...sim.emits.filter((e) => e.party === party).map((e) => chipW(`${chipTextOf(e)} ×9`) + (argsOf(e) ? P.chip.argsGap + textWidth(argsOf(e) ?? \"\", T.args) : 0)));\n\n // 計器。値を払う前の確認は、払う値の管に載せる (#3398)\n const paysOn = (party: string): string | undefined => {\n if (sim.tokens.has(party)) return undefined;\n const own = sim.checks.filter((c) => c.party === party);\n const first = Math.min(...own.map((c) => c.step));\n const unitOf = (s: string): string | undefined => s.trim().split(/\\s+/u).pop();\n const units = new Set(own.flatMap((c) => [unitOf(c.check.left), unitOf(c.check.right)]));\n const pay = moving.find((f) => f.from === party && f.step >= first && units.has(f.token));\n const box = pay ? boxOf(pay.token) : undefined;\n return pay && box !== undefined && !sim.checks.some((c) => c.party === box) ? pay.token : undefined;\n };\n const checkers = [...new Set(sim.checks.map((c) => c.party))].filter((id) => visible.has(id));\n const gaugeToken = new Map<string, string>();\n for (const party of checkers) {\n const token = isBox(party) ? sim.tokens.get(party) : paysOn(party);\n if (token !== undefined && boxOf(token) !== undefined && !gone.has(token)) gaugeToken.set(party, token);\n }\n const formulaOf = (c: CheckRec): string => `${c.check.left} ${OP_TEXT[c.check.op]} ${c.check.right}`;\n const formulaW = (party: string): number => Math.max(0, ...sim.checks.filter((c) => c.party === party).map((c) => chipW(formulaOf(c))));\n const gaugeColW = (party: string): number => Math.max(P.gauge.r * 2 + P.gauge.lampGap + P.gauge.lamp * 2, formulaW(party));\n\n // ---- 囲いの中身。槽を並べ、値の札を後ろに置く\n\n const housingH = P.housing.top + P.tank.h + Math.max(P.housing.text, narrow ? Math.ceil(sizes.amount * 1.25) + P.housing.pad : 0);\n interface Inner {\n tanks: { token: string; dx: number; w: number }[];\n plates: { name: string; dx: number; w: number }[];\n w: number;\n }\n /** 槽の下の残高の行の幅と、その下の増減と語の行の幅。狭い枠は増減と語を描かない */\n const balanceW = (h: string, token: string): number => widest(historyOf(`b${keyOf(h, token)}`).map(grouped), amountStyle);\n const subW = (h: string, token: string): number =>\n narrow ? 0 : Math.max(widest(historyOf(`b${keyOf(h, token)}`).map((v) => joinWords(`+${grouped(v)}`, token)), T.delta), ...Object.values(words.tags).map((t) => textWidth(t, T.tag)));\n const numberW = (h: string, token: string): number => Math.max(balanceW(h, token), subW(h, token));\n /** 槽の名前の幅。名前は字の間を空けて描く */\n const titleW = (token: string): number => textWidth(token, T.tankTitle) + [...token].length * T.tankTitle.size * P.tank.titleTrack;\n /** 槽の幅。名前が長い時は、名前がつやと目盛りにかからない幅まで広げる */\n const tankW = (token: string): number => Math.max(P.tank.w, Math.ceil(titleW(token)) + (P.tank.shine.x + P.tank.shine.w + PART_GAP) * 2);\n const innerOf = new Map<string, Inner>();\n for (const h of holders) {\n const list = tanksOf.get(h) ?? [];\n // 槽の下の数は槽より広いことがある。端の槽の数が囲いからはみ出さないよう、囲いの縁から槽までを数の半分まで空ける\n const overhang = (token: string): number => Math.max(0, numberW(h, token) / 2 - tankW(token) / 2);\n let x = P.housing.pad + (list[0] === undefined ? 0 : overhang(list[0]));\n const tanks: Inner[\"tanks\"] = [];\n // 真ん中の槽の管は内側の口から出て、槽の間を下りて囲いの外へ出る。その槽の両隣の間を管 1 本分広げる\n const middle = (k: number): boolean => k > 0 && k < list.length - 1 && defs.some((d) => d.token === list[k] && (d.from === h || d.to === h));\n list.forEach((token, j) => {\n if (j > 0) {\n const prev = list[j - 1] as string;\n const pass = middle(j - 1) || middle(j) ? P.bus.case + LINE_GAP * 2 + PART_GAP : 0;\n x += Math.max(P.tank.inner, (numberW(h, prev) + numberW(h, token)) / 2 + PART_GAP * 2 - (tankW(prev) + tankW(token)) / 2 + pass);\n }\n tanks.push({ token, dx: x, w: tankW(token) });\n x += tankW(token);\n });\n const last = list[list.length - 1];\n if (last !== undefined && (platesOf.get(h) ?? []).length === 0) x += overhang(last);\n const plates: Inner[\"plates\"] = [];\n for (const name of platesOf.get(h) ?? []) {\n if (tanks.length > 0 || plates.length > 0) x += P.plate.gap;\n // 札の名前は槽の名前と同じく字の間を空けて描くので、字の間を含む幅で測る (#3526)\n const w = Math.max(P.plate.w, titleW(name) + P.plate.padX, widest(historyOf(`v${keyOf(h, name)}`), T.plateValue) + P.plate.padX);\n plates.push({ name, dx: x, w });\n x += w;\n }\n innerOf.set(h, { tanks, plates, w: x + P.housing.pad });\n }\n\n // ---- トークンの箱を載せる管。隣の囲いを結ぶ管か、囲いの外側の口から横に出る管に載せる\n\n interface Home {\n token: string;\n box: string;\n /** 載せる管 (`defs` の番号)。管を持たない箱は持ち主の槽から短い管を引く */\n def?: number;\n /** 管が横に走る所の端の持ち主と向き。`gap` は隣の囲いの間 */\n party: string;\n side: \"left\" | \"right\";\n gap: boolean;\n /** 箱と計器とイベントの札の列の幅 */\n w: number;\n gauges: string[];\n /** 載せる管が出る口の高さの番号 (`P.tank.ports` の番号) */\n slot: number;\n }\n const sideOf = (h: string, token: string): (\"left\" | \"right\")[] => {\n const list = tanksOf.get(h) ?? [];\n const out: (\"left\" | \"right\")[] = [];\n if (list[0] === token && (innerOf.get(h)?.tanks.length ?? 0) > 0) out.push(\"left\");\n if (list[list.length - 1] === token && (platesOf.get(h) ?? []).length === 0) out.push(\"right\");\n return out;\n };\n const homes: Home[] = [];\n const docked = new Set<string>();\n const colW = (box: string, gauges: readonly string[]): number =>\n gauges.reduce((s, g) => s + gaugeColW(g) + PART_GAP, 0) + tokenW(box) + Math.max(0, eventW(box) + PART_GAP - tokenW(box) / 2) + PART_GAP * 2;\n for (const token of tokens) {\n const box = boxOf(token);\n if (box === undefined) continue;\n const gauges = checkers.filter((c) => gaugeToken.get(c) === token);\n const w = colW(box, gauges);\n let home: Home | undefined;\n // 隣どうしの囲いを結ぶ管\n for (const [k, d] of defs.entries()) {\n if (home || d.token !== token) continue;\n const [a, b] = [d.from, d.to];\n for (const band of [band0, band1]) {\n const i = band.indexOf(a);\n const j = band.indexOf(b);\n if (i < 0 || j < 0 || Math.abs(i - j) !== 1) continue;\n const [l, r] = i < j ? [a, b] : [b, a];\n if (sideOf(l, token).includes(\"right\") && sideOf(r, token).includes(\"left\") && !docked.has(`${l}|right`)) {\n home = { token, box, def: k, party: l, side: \"right\", gap: true, w, gauges, slot: 0 };\n docked.add(`${l}|right`);\n docked.add(`${r}|left`);\n }\n }\n }\n // 囲いの外側の口から横に出る管\n for (const [k, d] of defs.entries()) {\n if (home || d.token !== token) continue;\n // 段をまたぐ管は下の段の囲いに載せる。上の段は名札と囲いで横に長く、下の段は横が空いている\n for (const party of [d.from, d.to].sort((x, y) => (bandOf(y) ?? -1) - (bandOf(x) ?? -1))) {\n if (home) break;\n for (const side of sideOf(party, token)) {\n if (docked.has(`${party}|${side}`)) continue;\n home = { token, box, def: k, party, side, gap: false, w, gauges, slot: 0 };\n docked.add(`${party}|${side}`);\n break;\n }\n }\n }\n // 管を持たない箱は、持ち主の槽から短い管を引く\n if (!home)\n for (const party of holders.filter((h) => has(h, token))) {\n if (home) break;\n for (const side of sideOf(party, token)) {\n if (docked.has(`${party}|${side}`)) continue;\n home = { token, box, party, side, gap: false, w, gauges, slot: 0 };\n docked.add(`${party}|${side}`);\n break;\n }\n }\n if (home) homes.push(home);\n }\n const homeOfBox = new Map(homes.map((h) => [h.box, h]));\n // 箱を載せる管の口の高さ。同じ槽のほかの管が下の段へ向かう時は一番上の口に、上の段へ向かう時は一番下の口に載せる。\n // 真ん中の口に載せると、ほかの管が下へ出られる口が半分になり、残りは箱の管を越える\n {\n const slots = P.tank.ports as readonly number[];\n const topSlot = slots.indexOf(Math.min(...slots));\n const bottomSlot = slots.indexOf(Math.max(...slots));\n for (const m of homes) {\n const d0 = m.def === undefined ? undefined : defs[m.def];\n const ends = [m.party, ...(m.gap && d0 ? [d0.from === m.party ? d0.to : d0.from] : [])];\n let down = 0;\n let up = 0;\n for (const [k, d] of defs.entries()) {\n if (k === m.def || d.token !== m.token) continue;\n for (const e of ends) {\n if (d.from !== e && d.to !== e) continue;\n const diff = (bandOf(d.from === e ? d.to : d.from) ?? 0) - (bandOf(e) ?? 0);\n if (diff > 0) down++;\n if (diff < 0) up++;\n }\n }\n m.slot = down > up ? topSlot : up > down ? bottomSlot : 0;\n }\n }\n\n // 値の管の幹の組。同じトークンで同じ槽を端に持つ管が 2 本以上在る時、その槽を根にした組にし、管は根の槽の口を共に出て 1 本の幹を通り、\n // 相手の近くで枝分かれする。何本もの管が平行に並ぶ束にしない。両端が根になれる管は、管の多い方の槽の組に入れる。\n // トークンの箱を載せる管は箱の下を横に走る所を持つため、組に入れない\n const trunkOf = new Map<number, string>();\n {\n const homeDefs = new Set(homes.flatMap((m) => (m.def === undefined ? [] : [m.def])));\n const tankKey = (party: string, token: string): string => `t:${party}|${token}`;\n const degree = new Map<string, number>();\n for (const [k, d] of defs.entries()) {\n if (homeDefs.has(k)) continue;\n for (const party of [d.from, d.to]) degree.set(tankKey(party, d.token), (degree.get(tankKey(party, d.token)) ?? 0) + 1);\n }\n for (const [k, d] of defs.entries()) {\n if (homeDefs.has(k)) continue;\n const [a, b] = [tankKey(d.from, d.token), tankKey(d.to, d.token)];\n const root = (degree.get(b) ?? 0) > (degree.get(a) ?? 0) ? b : a;\n if ((degree.get(root) ?? 0) >= 2) trunkOf.set(k, root);\n }\n }\n /** 値の管の組。幹を共に通る管は根の槽の組、ほかは管ごとの組 */\n const groupOfDef = (k: number): string => trunkOf.get(k) ?? `v${k}`;\n\n // ---- 組む。管が通らない時は、間を広げて組み直す\n // 戻り値の札が管に収まらなかった時は、その管の2人の間を札の幅だけ広げ、同じ組み方で1度だけ組み直す (#3607)。\n // 札の幅を全ての戻り値の管に前もって足すと、収まっていた図まで広がるので、収まらなかった管だけに足す\n\n /** 戻り値の札が収まらなかった管 (`呼んだ者>呼ばれた者`) と、2人の間に足す長さ */\n const roomFor = new Map<string, number>();\n /** 組んでいる途中で戻り値の札が収まらなかった管と、足す長さ */\n const cramped = new Map<string, number>();\n let result: PipeLayout | undefined;\n for (const plan of PLANS.slice(from)) {\n cramped.clear();\n result = attempt(plan);\n if (result && cramped.size > 0) {\n for (const [pipe, room] of cramped) roomFor.set(pipe, Math.max(roomFor.get(pipe) ?? 0, room));\n cramped.clear();\n result = attempt(plan) ?? result;\n }\n if (result) {\n PLAN_OF.set(result, PLANS.indexOf(plan));\n break;\n }\n }\n return result as PipeLayout;\n\n function attempt(plan: Plan): PipeLayout | undefined {\n const pitch = P.lane.pitch;\n const corridor = plan.outer * pitch;\n const throughBand = band1.length > 0 || defs.some((d) => !isAdjacent(d));\n const laneW = (throughBand ? plan.lanes : 0) * pitch;\n\n // 横の置き場。囲いの列の幅は、囲いと名札とトークンの箱の列の広い方\n interface Col {\n id: string;\n x: number;\n w: number;\n hx: number;\n }\n const cols = new Map<string, Col>();\n const dockW = (h: string, side: \"left\" | \"right\"): number =>\n homes.filter((m) => !m.gap && m.party === h && m.side === side).reduce((s, m) => s + m.w + P.lane.clear * 2, 0);\n const gapW = (l: string): number => {\n const between = homes.filter((m) => m.gap && m.party === l);\n return Math.max(P.housing.gap, between.reduce((s, m) => s + m.w, 0) + P.lane.clear * 2) + laneW + plan.gap;\n };\n /** 前の組みで戻り値の札が収まらなかった、`from` と `to` の間の管に足す長さ。どちら向きの管でも足す (#3607) */\n const returnRun = (from: string, to: string): number =>\n (roomFor.get(`${from}>${to}`) ?? 0) + (roomFor.get(`${to}>${from}`) ?? 0);\n const roomW = (h: string): number => roomOf(h) + eventW(h) + PART_GAP;\n const lay = (band: readonly string[], start: number, want?: Map<string, number>): void => {\n let x = start;\n band.forEach((h, i) => {\n const inner = innerOf.get(h) as Inner;\n const lw = dockW(h, \"left\");\n const rw = dockW(h, \"right\");\n const w = Math.max(lw + inner.w + rw, roomW(h) + lw + rw);\n if (i > 0) x += gapW(band[i - 1] as string) + returnRun(band[i - 1] as string, h);\n const wanted = want?.get(h);\n if (wanted !== undefined) x = Math.max(x, wanted - w / 2);\n cols.set(h, { id: h, x, w, hx: x + lw + (w - lw - rw - inner.w) / 2 });\n x += w;\n });\n };\n lay(band0, 0);\n // 下の段の囲いは、流れでつながる上の段の囲いの真ん中の下に寄せる\n const anchor = new Map<string, number>();\n for (let pass = 0; pass < 2; pass++)\n for (const h of band1) {\n const near = (nbrs.get(h) ?? []).flatMap((n) => {\n const c = cols.get(n);\n return c && (pass > 0 || bandOf(n) === 0) ? [c.x + c.w / 2] : anchor.has(n) ? [anchor.get(n) as number] : [];\n });\n anchor.set(h, near.length > 0 ? mean(near) : (cols.get(band0[0] as string)?.x ?? 0));\n }\n const lower = [...band1].sort((a, b) => (anchor.get(a) ?? 0) - (anchor.get(b) ?? 0) || rankOf(a) - rankOf(b));\n if (lower.length > 0) {\n const halfW = (h: string): number => {\n const inner = innerOf.get(h) as Inner;\n return Math.max(dockW(h, \"left\") + inner.w + dockW(h, \"right\"), roomW(h) + dockW(h, \"left\") + dockW(h, \"right\")) / 2;\n };\n lay(lower, (anchor.get(lower[0] as string) ?? 0) - halfW(lower[0] as string), anchor);\n // 寄せた分の偏りを均す。下の段の真ん中を、寄せたい所の真ん中に合わせる\n const shift = mean(lower.map((h) => (anchor.get(h) ?? 0) - ((cols.get(h)?.x ?? 0) + (cols.get(h)?.w ?? 0) / 2)));\n if (shift < 0) for (const h of lower) {\n const c = cols.get(h) as Col;\n cols.set(h, { ...c, x: c.x + shift, hx: c.hx + shift });\n }\n }\n\n // 名札の行の横の置き場。囲いを持つ者は自分の囲いの真上、ほかは呼ぶ相手と呼ばれる相手の真ん中\n const xOf = new Map<string, number>();\n for (const [id, c] of cols) xOf.set(id, c.hx + (innerOf.get(id) as Inner).w / 2);\n const homeX = new Map<string, number>();\n const placeHomes = (): void => {\n for (const m of homes) {\n const c = cols.get(m.party);\n if (!c) continue;\n const inner = innerOf.get(m.party) as Inner;\n const gaugesW = m.gauges.reduce((s, g) => s + gaugeColW(g) + PART_GAP, 0);\n const boxLeft = (left: number): number => left + PART_GAP + gaugesW;\n let left: number;\n if (m.gap) left = c.hx + inner.w + (gapW(m.party) - laneW - plan.gap - m.w) / 2;\n else if (m.side === \"right\") left = c.hx + inner.w + P.lane.clear + homes.filter((x) => !x.gap && x.party === m.party && x.side === \"right\" && homes.indexOf(x) < homes.indexOf(m)).reduce((s, x) => s + x.w, 0);\n else left = c.hx - P.lane.clear - m.w - homes.filter((x) => !x.gap && x.party === m.party && x.side === \"left\" && homes.indexOf(x) < homes.indexOf(m)).reduce((s, x) => s + x.w, 0);\n homeX.set(m.box, left);\n xOf.set(m.box, boxLeft(left) + tokenW(m.box) / 2);\n }\n };\n placeHomes();\n\n const tagParties = order.filter((id) => !isBox(id) && bandOf(id) !== 1);\n const others = tagParties.filter((id) => !holding.has(id));\n const nearOf = (id: string): number[] =>\n [...new Set(shown.flatMap((c) => (c.to === id ? [c.from] : c.from === id ? [c.to] : [])))]\n .filter((n) => n !== id)\n .flatMap((n) => (xOf.has(n) ? [xOf.get(n) as number] : []));\n const maxRow = Math.max(0, ...tagParties.map(rowOf));\n /** 呼ぶ者が名札の横から出て向きを変えるまでの長さ。呼ばない者は 0 */\n const callerRun = (id: string): number =>\n Math.max(0, ...shown.filter((c) => c.from === id).map((c) => P.call.valveAt + P.valve.r + SPACING + (checkers.includes(c.to) && !gaugeToken.has(c.to) ? P.gauge.r * 2 + SPACING : 0)));\n /** 同じ行の名札と、上の行から自分の囲いへ下りる点線を避けて、`want` に一番近い所 */\n const freeX = (id: string, want: number): number => {\n const row = rowOf(id);\n const w = roomOf(id) + eventW(id);\n const occ: [number, number][] = [];\n for (const [other, cx] of xOf) {\n if (other === id || isBox(other) || bandOf(other) === 1) continue;\n const ow = roomOf(other);\n // 呼ぶ者の横には、弁を載せて向きを変えるまでの長さと、呼ばれた側の手前で向きを揃える長さを空ける\n const gap = Math.max(P.cabinet.gap + plan.gap / 2, callerRun(id) + callerRun(other) + returnRun(id, other) + APPROACH + PART_GAP);\n if (rowOf(other) === row) occ.push([cx - ow / 2 - gap, cx + ow / 2 + eventW(other) + gap]);\n if (holding.has(other) && rowOf(other) < row) occ.push([cx - P.lane.clear * 2, cx + P.lane.clear * 2]);\n }\n const ok = (cx: number): boolean => occ.every(([a, b]) => cx + w - roomOf(id) / 2 < a || cx - roomOf(id) / 2 > b);\n for (let d = 0; d < 1e5; d += 6) {\n if (ok(want + d)) return want + d;\n if (ok(want - d)) return want - d;\n }\n return want;\n };\n const later = others.filter((id) => nearOf(id).length === 0);\n for (const id of [...others.filter((id) => !later.includes(id))].sort((a, b) => rowOf(a) - rowOf(b))) xOf.set(id, freeX(id, mean(nearOf(id))));\n for (const id of later) {\n const near = nearOf(id);\n xOf.set(id, freeX(id, near.length > 0 ? mean(near) : (cols.get(band0[0] as string)?.x ?? 0)));\n }\n // 名札は、呼ぶ相手が上の行に居る時に、その相手の点線に重ならないよう、自分の囲いを持たない者だけを動かした\n // 一番左を図の左の余白に合わせる\n const lefts: number[] = [];\n for (const [id, c] of cols) lefts.push(c.x, (xOf.get(id) ?? 0) - roomOf(id) / 2);\n for (const id of others) lefts.push((xOf.get(id) ?? 0) - roomOf(id) / 2);\n const dx = P.edge + corridor - Math.min(...lefts, 0);\n for (const [id, c] of cols) cols.set(id, { ...c, x: c.x + dx, hx: c.hx + dx });\n for (const [id, x] of xOf) xOf.set(id, x + dx);\n for (const [id, x] of homeX) homeX.set(id, x + dx);\n\n // ---- 縦の置き場\n\n // 呼び出しの管の計器を載せる行。計器を載せる管は呼んだ者の行を横に出る\n const callGauge = new Map<string, number>();\n for (const party of checkers) {\n if (gaugeToken.has(party)) continue;\n const first = shown.find((c) => c.to === party);\n if (first && !isBox(party) && bandOf(first.from) !== 1) callGauge.set(party, rowOf(first.from));\n }\n const rowsWith = new Set(callGauge.values());\n const gaugeUp = P.gauge.r + P.chip.off + chipH;\n const rowY: number[] = [];\n for (let r = 0; r <= maxRow; r++) {\n const here = tagParties.filter((id) => rowOf(id) === r);\n const up = Math.max(P.row.top - (r === 0 ? 0 : P.row.top), ...here.map(aboveOf), rowsWith.has(r) ? gaugeUp : 0);\n if (r === 0) {\n // 一番上の行の名札は、図の上の縁から `TOP_ROOM` 離す。名札を越えて上の口へ下りる管が図の外を回らないように (#3523)\n rowY.push(Math.max(P.margin + Math.max(P.row.top, up + PART_GAP), ...here.map((id) => TOP_ROOM + aboveOf(id))));\n continue;\n }\n const prev = tagParties.filter((id) => rowOf(id) === r - 1);\n const prevY = rowY[r - 1] as number;\n let need = P.row.pitch + plan.rows;\n for (const a of prev)\n for (const b of here) {\n const ax = xOf.get(a) ?? 0;\n const bx = xOf.get(b) ?? 0;\n if (Math.abs(ax - bx) < (roomOf(a) + roomOf(b)) / 2 + P.lane.clear * 4) {\n need = Math.max(need, belowOf(a) + aboveOf(b) + P.lane.clear * 3 + plan.rows);\n // 真下の者を呼ぶ管は、名札の下の側の高さから出て下りる。下りる所に自分の弁を縦に置ける高さを取る\n if (shown.some((c) => c.from === a && c.to === b)) need = Math.max(need, P.call.case + LINE_GAP + VALVE_DROP + aboveOf(b) + plan.rows);\n }\n }\n if (rowsWith.has(r - 1)) need = Math.max(need, P.gauge.r + Math.max(...here.map(aboveOf), 0) + P.lane.clear * 2);\n need = Math.max(need, up + Math.max(0, ...prev.map(belowOf)) + PART_GAP);\n rowY.push(prevY + need);\n }\n const rowsBottom = Math.max(...tagParties.map((id) => (rowY[rowOf(id)] as number) + belowOf(id)), P.margin);\n const H0 = rowsBottom + P.band.tag + (throughBand ? plan.rows / 2 : 0);\n const B0 = H0 + housingH;\n const crossBand = defs.filter((d) => !isAdjacent(d)).length;\n const channel = (n: number): number => (n === 0 ? 0 : Math.max(P.band.next, (n + plan.lanes) * pitch + P.lane.clear));\n const C0 = B0 + channel(band1.length > 0 ? crossBand + 1 : crossBand);\n let tag1 = C0;\n let H1 = C0;\n let B1 = C0;\n if (band1.length > 0) {\n tag1 = C0 + Math.max(...band1.map(aboveOf)) + P.lane.clear;\n H1 = tag1 + Math.max(...band1.map(belowOf)) + P.band.tag;\n B1 = H1 + housingH;\n }\n const C1 = band1.length > 0 ? B1 + channel(crossBand) : C0;\n const yOfBand = (h: string): number => (bandOf(h) === 1 ? H1 : H0);\n const tankTop = (h: string): number => yOfBand(h) + P.housing.top;\n\n // ---- 部品の四角\n\n const cyOf = (id: string): number => {\n if (isBox(id)) {\n const m = homeOfBox.get(id);\n const busY = m ? tankTop(m.party) + (P.tank.ports[m.slot] as number) : rowY[0] as number;\n return busY - P.token.up - tokenH(id) / 2;\n }\n return bandOf(id) === 1 ? tag1 : (rowY[rowOf(id)] as number);\n };\n const rectOf = (id: string): Rect => {\n const { w, h } = sizeOf(id);\n return { x: (xOf.get(id) ?? 0) - w / 2, y: cyOf(id) - h / 2, w, h };\n };\n // 下の段の名札は自分の囲いの真上\n for (const h of band1) xOf.set(h, (cols.get(h)?.hx ?? 0) + (innerOf.get(h)?.w ?? 0) / 2);\n // 槽を持たないトークンの箱は、呼ぶ相手の行に置く\n for (const id of order.filter((x) => isBox(x) && !homeOfBox.has(x))) {\n const near = nearOf(id);\n xOf.set(id, freeX(id, near.length > 0 ? mean(near) : P.edge));\n }\n const labelOf = (id: string): Rect => {\n const r = rectOf(id);\n if (shapeOf(id) !== \"round\") return r;\n const w = nameW(id);\n return { x: Math.min(r.x, r.x + r.w / 2 - w / 2), y: r.y, w: Math.max(r.w, w), h: P.avatar.size / 2 + belowOf(id) };\n };\n\n const housings: PipeHousing[] = holders.map((h) => {\n const c = cols.get(h) as Col;\n return { party: h, row: bandOf(h) ?? 0, x: c.hx, y: yOfBand(h), w: (innerOf.get(h) as Inner).w, h: housingH };\n });\n const housingOf = new Map(housings.map((h) => [h.party, h]));\n const tankRect = new Map<string, Rect>();\n for (const h of holders) {\n const hs = housingOf.get(h) as PipeHousing;\n for (const t of (innerOf.get(h) as Inner).tanks) tankRect.set(keyOf(h, t.token), { x: hs.x + t.dx, y: tankTop(h), w: t.w, h: P.tank.h });\n }\n const tankOf = (party: string, token: string): Rect => tankRect.get(keyOf(party, token)) ?? { x: 0, y: 0, w: 0, h: 0 };\n /** 槽の下の字の帯。残高と増減と語 */\n const textBand = (party: string, token: string): Rect => {\n const t = tankOf(party, token);\n const w = numberW(party, token) + 4;\n return { x: t.x + t.w / 2 - w / 2, y: t.y + t.h + 4, w, h: housingH - P.housing.top - P.tank.h - 6 };\n };\n /** 槽の下の残高の基準線。槽の下の端から `numberY` 下で、残高の字を大きくした枠では字の高さに合わせて下げる */\n const numberBaseOf = (t: Rect): number => t.y + t.h + Math.max(P.tank.numberY, sizes.amount + 6);\n /**\n * 槽の下の字の帯を、残高の行と、その下の増減と語の行に分けた四角 (#3528)。図の中の札だけがこの形で避ける。\n * 帯 1 つで避けると、残高の行の横の空き (増減の行より狭い残高の横) まで塞ぎ、槽から出る管の際に流れた量の札を置けない\n */\n const textRows = (party: string, token: string): Rect[] => {\n const t = tankOf(party, token);\n const band = textBand(party, token);\n const cx = t.x + t.w / 2;\n const base = numberBaseOf(t);\n const balance = balanceW(party, token) + 4;\n const sub = subW(party, token) + 4;\n const subTop = base + P.tank.deltaY - T.delta.size * 0.8;\n return [\n { x: cx - balance / 2, y: band.y, w: balance, h: base + amountStyle.size * 0.2 - band.y },\n { x: cx - sub / 2, y: subTop, w: sub, h: band.y + band.h - subTop },\n ];\n };\n const plateRect = (party: string, name: string): Rect | undefined => {\n const hs = housingOf.get(party);\n const p = innerOf.get(party)?.plates.find((x) => x.name === name);\n return hs && p ? { x: hs.x + p.dx, y: tankTop(party) + P.plate.top, w: p.w, h: P.tank.h - P.plate.short } : undefined;\n };\n const calcParties = new Set(sim.calcs.map((c) => c.party));\n const converterRect = (party: string): Rect | undefined => {\n const [ta, tb] = (innerOf.get(party)?.tanks ?? []).slice(0, 2);\n if (!calcParties.has(party) || !ta || !tb) return undefined;\n const a = tankOf(party, ta.token);\n const b = tankOf(party, tb.token);\n const r = P.converter.r;\n return { x: (a.x + a.w + b.x) / 2 - r, y: a.y + a.h / 2 - r, w: r * 2, h: r * 2 };\n };\n\n // トークンの箱と、箱の管の横に走る所と、値の管に載せる計器\n interface Bay {\n home: Home;\n left: number;\n y: number;\n x1: number;\n x2: number;\n gauges: { party: string; cx: number; cy: number; col: { x: number; w: number } }[];\n }\n const bays: Bay[] = homes.flatMap((m) => {\n const left = homeX.get(m.box);\n if (left === undefined || !cols.has(m.party)) return [];\n const t = tankOf(m.party, m.token);\n const y = t.y + (P.tank.ports[m.slot] as number);\n let x1: number;\n let x2: number;\n if (m.gap) {\n const d = defs[m.def as number] as Def;\n const other = d.from === m.party ? d.to : d.from;\n x1 = t.x + t.w;\n x2 = tankOf(other, m.token).x;\n } else if (m.side === \"right\") {\n x1 = t.x + t.w;\n x2 = left + m.w + (m.def === undefined ? 0 : P.lane.clear);\n } else {\n x1 = left - (m.def === undefined ? 0 : P.lane.clear);\n x2 = t.x;\n }\n let gx = left + PART_GAP;\n const gauges = m.gauges.map((party) => {\n const w = gaugeColW(party);\n const g = { party, cx: gx + w / 2 - (P.gauge.lampGap + P.gauge.lamp * 2) / 2, cy: y - P.gauge.up, col: { x: gx, w } };\n gx += w + PART_GAP;\n return g;\n });\n return [{ home: m, left, y, x1, x2, gauges }];\n });\n const bayOf = new Map(bays.map((b) => [b.home.box, b]));\n\n // ---- 値の管の道\n\n const portSlots = P.tank.ports as readonly number[];\n /** 使った口と、使った管の組。同じ組の管は口を共に使う */\n const taken = new Map<string, string>();\n const portAt = (party: string, token: string, side: \"left\" | \"right\", k: number): PipePort => {\n const t = tankOf(party, token);\n return { party, token, side, x: side === \"left\" ? t.x : t.x + t.w, y: t.y + (portSlots[k] as number) };\n };\n /** 槽の口の候補。外側の縁の口を先に、内側の縁の口を後に試す */\n /**\n * 槽の口の候補。外側の縁の口は、囲いの外の `exit` まで真っすぐ出てから道を探す。\n * 内側の縁の口は囲いの中から道を探すため、外側の口で道が無い時だけ使う\n */\n interface PortChoice {\n port: PipePort;\n cost: number;\n exit: Point;\n inner: boolean;\n }\n // 槽の外側の縁の口の割り当て。同じ縁から別の段へ向かう管が並ぶ時、外の筋を通る管ほど上の口から出し、内の筋の管を越えないようにする。\n // 縁から出た管は、相手の口がこちらを向いていれば進んだ向きのまま入り (進み続ける管)、向こうを向いていれば行き過ぎてから戻って入る (戻る管)。\n // 進み続ける管は戻る管より外を通り、近い相手ほど外を通る。戻る管は遠い相手ほど大きく回るため外を通る。上の段へ向かう管は上下を逆にする\n const yRank = portSlots.map((_, k) => k).sort((a, b) => (portSlots[a] as number) - (portSlots[b] as number));\n const preferSlot = new Map<string, number>();\n /** 管が縁のそばを走る筋の内からの順。内の筋の管から引き、外の管がその外に寄り添う */\n const laneRank = new Map<number, number>();\n const rankUp = (k: number, r: number): void => {\n laneRank.set(k, Math.max(laneRank.get(k) ?? 0, r));\n };\n for (const h of holders) {\n const hs = housingOf.get(h);\n if (!hs) continue;\n for (const token of tanksOf.get(h) ?? [])\n for (const side of sideOf(h, token)) {\n const dock = homes.find((m) => m.token === token && ((m.party === h && m.side === side) || (m.gap && side === \"left\" && m.def !== undefined && [defs[m.def]?.from, defs[m.def]?.to].includes(h) && m.party !== h)));\n const free = yRank.filter((k) => k !== dock?.slot);\n const rows = defs.flatMap((d, k) => {\n if (d.token !== token || (d.from !== h && d.to !== h) || k === dock?.def) return [];\n const partner = d.from === h ? d.to : d.from;\n const vertical = (bandOf(partner) ?? 0) - (bandOf(h) ?? 0);\n if (vertical === 0 || !tankRect.has(keyOf(partner, token))) return [];\n const t = tankOf(partner, token);\n const px = t.x + t.w / 2;\n const sides = sideOf(partner, token);\n const facing = sides.length === 1 ? sides[0] : px > hs.x + hs.w / 2 ? \"left\" : \"right\";\n const continuing = (side === \"right\") === (facing === \"left\");\n const dist = Math.abs(px - (side === \"right\" ? hs.x + hs.w : hs.x));\n return [{ k, vertical, continuing, dist }];\n });\n const order = (list: typeof rows): typeof rows =>\n [...list].sort((a, b) => Number(b.continuing) - Number(a.continuing) || (a.continuing ? a.dist - b.dist : b.dist - a.dist));\n // この槽を根にする幹の組の管は、1 つの口を共に使う。組は組の中で先に並んだ管の所に置く\n const laneKey = (r: (typeof rows)[number]): string => (trunkOf.get(r.k) === `t:${h}|${token}` ? `t:${h}|${token}` : `k${r.k}`);\n const assign = (list: typeof rows, slotAt: (i: number) => number | undefined): void => {\n const keys = [...new Set(list.map(laneKey))];\n for (const r of list) {\n const i = keys.indexOf(laneKey(r));\n const slot = slotAt(i);\n if (slot !== undefined) preferSlot.set(`${r.k}|${h}|${side}`, slot);\n rankUp(r.k, keys.length - 1 - i);\n }\n };\n assign(order(rows.filter((r) => r.vertical > 0)), (i) => free[i]);\n assign(order(rows.filter((r) => r.vertical < 0)), (i) => free[free.length - 1 - i]);\n }\n }\n /** 口の値。割り当てた口が在る時は、割り当てから離れた口ほど重い */\n const slotCost = (def: number | undefined, party: string, side: \"left\" | \"right\", k: number): number => {\n const want = def === undefined ? undefined : preferSlot.get(`${def}|${party}|${side}`);\n return want === undefined ? k * 24 : Math.abs(yRank.indexOf(k) - yRank.indexOf(want)) * 24;\n };\n const portsOf = (party: string, token: string, def?: number): PortChoice[] => {\n const list = tanksOf.get(party) ?? [];\n const j = list.indexOf(token);\n const out: PortChoice[] = [];\n const outer = sideOf(party, token);\n const hs = housingOf.get(party);\n // 最後の槽の右に値の札が並ぶ時は、札の下を通れる口だけを外側の口にする。札は槽より低く、下に隙間がある\n const plates = platesOf.get(party) ?? [];\n const plateBottom = P.plate.top + (P.tank.h - P.plate.short);\n const underPlate = (k: number): boolean => (portSlots[k] as number) - P.bus.case / 2 - LINE_GAP >= plateBottom;\n /** 口を使えるか。使った口は、同じ組の管だけが共に使う */\n const usable = (key: string): boolean => !taken.has(key) || (def !== undefined && taken.get(key) === groupOfDef(def));\n /** 同じ組の管が使った口は値を足さず、幹を共に通らせる */\n const shared = (key: string): boolean => def !== undefined && taken.get(key) === groupOfDef(def);\n if (j === list.length - 1 && plates.length > 0 && hs)\n portSlots.forEach((_, k) => {\n const key = `${party}|${token}|right|${k}`;\n if (!underPlate(k) || !usable(key)) return;\n const port = portAt(party, token, \"right\", k);\n out.push({ port, cost: shared(key) ? 0 : k * 24, exit: [hs.x + hs.w + vPadOut, port.y], inner: false });\n });\n for (const side of [\"left\", \"right\"] as const) {\n const inner = !outer.includes(side);\n if (inner && side === \"right\" && j === list.length - 1 && plates.length > 0) continue;\n if (inner && (side === \"left\" ? j === 0 : j === list.length - 1)) continue;\n if (inner && converterRect(party) && (side === \"left\" ? j === 1 : j === 0)) continue;\n portSlots.forEach((_, k) => {\n const port = portAt(party, token, side, k);\n // 内側の口は、隣の槽との間の真ん中まで出てから道を探す。口の際で折れる短い線を作らない\n const next = list[side === \"left\" ? j - 1 : j + 1];\n const gapMid = next !== undefined ? (side === \"left\" ? (tankOf(party, next).x + tankOf(party, next).w + port.x) / 2 : (port.x + tankOf(party, next).x) / 2) : port.x;\n const exit: Point = !hs ? [port.x, port.y] : inner ? [gapMid, port.y] : [side === \"left\" ? hs.x - vPadOut : hs.x + hs.w + vPadOut, port.y];\n const key = `${party}|${token}|${side}|${k}`;\n if (usable(key)) out.push({ port, cost: shared(key) ? 0 : inner ? k * 24 + 400 : slotCost(def, party, side, k), exit, inner });\n });\n }\n return out;\n };\n const keyPort = (p: PipePort): string => `${p.party}|${p.token}|${p.side}|${portSlots.indexOf(p.y - tankOf(p.party, p.token).y)}`;\n\n // 格子。管の道に使う縦と横の線\n const width0 = Math.max(...[...cols.values()].map((c) => c.x + c.w), ...[...xOf.entries()].map(([id, x]) => x + roomOf(id) / 2 + eventW(id))) + P.edge + corridor;\n const height0 = (band1.length > 0 ? C1 : C0 > B0 ? C0 : B0) + P.margin;\n const keepX: number[] = [];\n const keepY: number[] = [];\n for (const [k, t] of tankRect) {\n void k;\n keepX.push(t.x, t.x + t.w);\n for (const s of portSlots) keepY.push(t.y + s);\n }\n for (const b of bays) keepX.push(b.x1, b.x2);\n const vPadOut = P.bus.case / 2 + P.lane.clear;\n for (const h of housings) keepX.push(h.x - vPadOut, h.x + h.w + vPadOut);\n for (const h of housings) {\n const inner = innerOf.get(h.party) as Inner;\n inner.tanks.slice(1).forEach((t, j) => keepX.push(h.x + ((inner.tanks[j] as { dx: number; w: number }).dx + (inner.tanks[j] as { dx: number; w: number }).w + t.dx) / 2));\n }\n const valueXs = gridLines(\n Array.from({ length: Math.ceil(width0 / (pitch / 2)) + 1 }, (_, i) => i * (pitch / 2)),\n keepX.flatMap((x) => [x]),\n 6,\n );\n const valueYs = gridLines(\n Array.from({ length: Math.ceil(height0 / (pitch / 2)) + 1 }, (_, i) => i * (pitch / 2)),\n [...keepY, B0 + pitch / 2, C0 - pitch / 2, ...(band1.length > 0 ? [B1 + pitch / 2, C1 - pitch / 2] : [])],\n 6,\n );\n const vHalf = P.bus.case / 2;\n const obstacles: Obstacle[] = [];\n const ownObs = new Map<string, number[]>();\n const addObs = (rect: Rect, pad: number, owner?: string): void => {\n if (owner !== undefined) ownObs.set(owner, [...(ownObs.get(owner) ?? []), obstacles.length]);\n obstacles.push({ rect, pad });\n };\n const vPad = vHalf + P.lane.clear;\n for (const id of order) {\n if (!visible.has(id) || (isBox(id) && !homeOfBox.has(id) && !xOf.has(id))) continue;\n addObs(labelOf(id), vPad);\n }\n for (const h of housings) addObs(h, vPad, `h:${h.party}`);\n for (const [k, t] of tankRect) {\n addObs(t, 0);\n addObs(t, vPad, `t:${k}`);\n }\n for (const h of holders) {\n for (const t of tanksOf.get(h) ?? []) addObs(textBand(h, t), PART_GAP);\n for (const name of platesOf.get(h) ?? []) {\n const r = plateRect(h, name);\n if (r) addObs(r, P.lane.clear);\n }\n const c = converterRect(h);\n if (c) addObs(c, P.lane.clear);\n }\n /** トークンの箱の列。箱と軸と計器と式の札の場所。管の上の余白より上 */\n const bayRect = (b: Bay): Rect => {\n const top = Math.min(cyOf(b.home.box) - tokenH(b.home.box) / 2, ...b.gauges.map((g) => g.cy - P.gauge.r - P.chip.off - chipH));\n return { x: b.left, y: top, w: b.home.w, h: b.y - vHalf - LINE_GAP - top };\n };\n for (const b of bays) addObs(bayRect(b), 0);\n /** 入力と出力の印。始めた人が払った槽と受け取った槽の、囲いの上の余白に置く。値の管はこの印を避ける */\n function ioMarks(): { token: string; text: string; r: Rect }[] {\n if (sender === undefined || !holding.has(sender)) return [];\n return (tanksOf.get(sender) ?? []).flatMap((token) => {\n const first = amountNumber(holds.flatMap((h) => (\"token\" in h && h.box === sender && h.token === token ? [h.amount] : []))[0]);\n const last = amountNumber(snapOf(steps - 1).balances.get(keyOf(sender, token)));\n if (first === last) return [];\n const text = first > last ? words.io.in : words.io.out;\n const t = tankOf(sender, token);\n const w = chipW(text, T.io);\n return [{ token, text, r: { x: t.x + t.w / 2 - w / 2, y: yOfBand(sender) + (P.housing.top - IO_H) / 2 - 2, w, h: IO_H } }];\n });\n }\n for (const m of ioMarks()) addObs(m.r, vPad);\n\n // ---- 名札から自分の囲いへ下りる点線。値の管も呼び出しの管もまたがない\n const ties: PipeTie[] = holders.map((h) => {\n const r = rectOf(h);\n const top = shapeOf(h) === \"round\" ? r.y + r.h / 2 + belowOf(h) + P.tie.gap : r.y + r.h + P.tie.gap;\n return { party: h, x: r.x + r.w / 2, y1: top, y2: yOfBand(h) };\n });\n const tieLines = (router: Router): void => {\n for (const t of ties)\n router.lay(\n [\n [t.x, t.y1],\n [t.x, t.y2],\n ],\n { owner: `tie:${t.party}`, group: `tie:${t.party}`, kind: \"tie\", width: 2 },\n );\n };\n\n let valueRouter = new Router(valueXs, valueYs, obstacles);\n let routes: { def: number; points: Point[]; ports: [PipePort, PipePort] }[] = [];\n let stubs: PipeStub[] = [];\n const lineOwner = (k: number): string => `v${k}`;\n const layValue = (k: number, points: Point[]): void => valueRouter.lay(points, { owner: lineOwner(k), group: groupOfDef(k), kind: \"value\", width: P.bus.case });\n // 箱を載せる管は先に置く。隣の囲いを結ぶ管は横に 1 本、外側の口から出る管は箱の下を横に走ってから道を探す。\n // 幹を共に通る組の管は、組の中で一番近い管の順の所にまとめて置き、組の中では近い相手の管から引く。\n // 近い相手への管は根の囲いのそばで下りて幹になり、遠い相手の管は幹を共に通って先で分かれる。根から離れた所で下りる幹は、ほかの囲いの名札を囲んで呼び出しの管の道を塞ぐ\n const members = (k: number): number[] => (trunkOf.has(k) ? [...defs.keys()].filter((x) => trunkOf.get(x) === trunkOf.get(k)) : [k]);\n const order2 = [...defs.keys()].sort((a, b) => {\n const ha = homes.some((m) => m.def === a) ? 0 : 1;\n const hb = homes.some((m) => m.def === b) ? 0 : 1;\n const da = isAdjacent(defs[a] as Def) ? 0 : 1;\n const db = isAdjacent(defs[b] as Def) ? 0 : 1;\n const rankOfGroup = (k: number): number => Math.min(...members(k).map((x) => laneRank.get(x) ?? 0));\n const spanOfGroup = (k: number): number => Math.min(...members(k).map(spanOf));\n const lead = (k: number): number => Math.min(...members(k));\n return (\n ha - hb ||\n da - db ||\n rankOfGroup(a) - rankOfGroup(b) ||\n spanOfGroup(a) - spanOfGroup(b) ||\n lead(a) - lead(b) ||\n spanOf(a) - spanOf(b) ||\n a - b\n );\n });\n /** 道の長さのうち、端と端の真っすぐな隔たりを超えた分 */\n const detourOf = (points: readonly Point[]): number => {\n let len = 0;\n for (let i = 1; i < points.length; i++) len += Math.abs((points[i] as Point)[0] - (points[i - 1] as Point)[0]) + Math.abs((points[i] as Point)[1] - (points[i - 1] as Point)[1]);\n const a = points[0] as Point;\n const b = points[points.length - 1] as Point;\n return len - Math.abs(b[0] - a[0]) - Math.abs(b[1] - a[1]);\n };\n /**\n * 値の管を `list` の順に引く。先に引いた管が後の管の口を囲むと道が無くなるか遠回りになるため、\n * 呼ぶ側は道の無かった管と遠回りした管を前に出して引き直す。`fallback` の時だけ道の無い管を下の道の折れ線で結ぶ\n */\n const routeValues = (list: readonly number[], fallback: boolean): { failed: number[]; bent: number[]; detours: Map<number, number> } => {\n valueRouter = new Router(valueXs, valueYs, obstacles);\n taken.clear();\n routes = [];\n tieLines(valueRouter);\n // 管を持たない箱の短い管。口は先に押さえる\n stubs = bays\n .filter((b) => b.home.def === undefined)\n .map((b) => {\n const a = portAt(b.home.party, b.home.token, b.home.side, b.home.slot);\n taken.set(keyPort(a), `s${b.home.token}`);\n const end: Point = [b.home.side === \"left\" ? b.x1 : b.x2, a.y];\n const points: Point[] = b.home.side === \"left\" ? [end, [a.x, a.y]] : [[a.x, a.y], end];\n valueRouter.lay(points, { owner: `s${b.home.token}`, group: `s${b.home.token}`, kind: \"stub\", width: P.bus.case });\n return { token: b.home.token, points };\n });\n const failed: number[] = [];\n const bent: number[] = [];\n const detours = new Map<number, number>();\n for (const k of list) {\n const d = defs[k] as Def;\n const home = homes.find((m) => m.def === k);\n const bay = home ? bayOf.get(home.box) : undefined;\n const dirOut = (side: \"left\" | \"right\"): Dir => (side === \"left\" ? 2 : 0);\n const dirIn = (side: \"left\" | \"right\"): Dir => (side === \"left\" ? 0 : 2);\n let points: Point[] | undefined;\n let ports: [PipePort, PipePort] | undefined;\n const askOf = (starts: End[], ends: End[], allow: number[]): Ask => ({\n owner: lineOwner(k),\n group: groupOfDef(k),\n kind: \"value\",\n width: P.bus.case,\n starts,\n ends,\n allow: new Set(allow),\n cross: (l) => (l.kind !== \"tie\" && plan.last ? 5000 : undefined),\n gap: LINE_GAP,\n bend: BEND_VALUE,\n hug: 0.02,\n share: SHARE,\n });\n const own = (party: string, token: string): number[] => [...(ownObs.get(`h:${party}`) ?? []), ...(ownObs.get(`t:${keyOf(party, token)}`) ?? [])];\n if (home && bay && home.gap) {\n const other = d.from === home.party ? d.to : d.from;\n const a = portAt(home.party, d.token, \"right\", home.slot);\n const b = portAt(other, d.token, \"left\", home.slot);\n // 点は送る側から受ける側へ並べる。流れの向きは点の並びで決まる\n points = d.from === home.party ? [[a.x, a.y], [b.x, b.y]] : [[b.x, b.y], [a.x, a.y]];\n ports = d.from === home.party ? [a, b] : [b, a];\n } else {\n /** 口の候補どうしを結ぶ。外側の口だけで道が無い時に限り、内側の口と囲いの中を使う */\n const join = (sa: PortChoice[], sb: PortChoice[]): { points: Point[]; a: PipePort; b: PipePort } | undefined => {\n const same = (p: PortChoice, q: Point): boolean => Math.abs(p.exit[0] - q[0]) < 0.5 && Math.abs(p.exit[1] - q[1]) < 0.5;\n // 口から外の点までの線は道を探さずに引くため、先に引いた管がその線を越える口は使わない\n const stubAsk = askOf([], [], [...own(d.from, d.token), ...own(d.to, d.token)]);\n const clear = (p: PortChoice): boolean => same(p, [p.port.x, p.port.y]) || valueRouter.passable(stubAsk, [p.port.x, p.port.y], p.exit);\n for (const loose of [false, true]) {\n const xa = sa.filter((p) => (loose || !p.inner) && clear(p));\n const xb = sb.filter((p) => (loose || !p.inner) && clear(p));\n if (xa.length === 0 || xb.length === 0 || (loose && xa.every((p) => !p.inner) && xb.every((p) => !p.inner))) continue;\n // 内側の口は槽の間を上か下へ抜ける。外側の口は外の点から横に進むほか、外の点で上か下へ折れてよい。\n // 外の点の筋を同じ組の幹が通る時は、外の点で幹に入る。1 つ先の点まで出てから折れると、幹の際で行って戻る段差になる\n const turns = (p: PortChoice, straight: Dir): End[] =>\n p.inner\n ? ([1, 3] as Dir[]).map((dir) => ({ at: p.exit, dir, cost: p.cost }))\n : [{ at: p.exit, dir: straight, cost: p.cost }, ...([1, 3] as Dir[]).map((dir) => ({ at: p.exit, dir, cost: p.cost + BEND_VALUE }))];\n const request = askOf(\n xa.flatMap((p) => turns(p, dirOut(p.port.side))),\n xb.flatMap((p) => turns(p, dirIn(p.port.side))),\n loose ? [...own(d.from, d.token), ...own(d.to, d.token)] : [],\n );\n // 道の途中の短い段差を消す。口の点は動かさず、外の点は口から外の点までの線の上で口の側へ動かしてよい。\n // 幹を共に通る管は外の点が決まっているため、幹の筋と外の点の筋が少しずれると、外の点の手前に短い段差が残る\n const finish = (path: Point[]): { points: Point[]; a: PipePort; b: PipePort } | undefined => {\n const pa = xa.find((p) => same(p, path[0] as Point));\n const pb = xb.find((p) => same(p, path[path.length - 1] as Point));\n if (!pa || !pb) return undefined;\n /**\n * 線が通れるか。口から外の点までの線の上の所は道を探さずに引くため通れるとし、外の点より先の所は道を探す時と同じく測る\n */\n const passes = (u: Point, v: Point): boolean => {\n for (const c of [pa, pb]) {\n if (Math.abs(u[1] - c.port.y) >= 0.5 || Math.abs(v[1] - c.port.y) >= 0.5) continue;\n const [lo, hi] = [Math.min(c.port.x, c.exit[0]), Math.max(c.port.x, c.exit[0])];\n const [s0, s1] = [Math.min(u[0], v[0]), Math.max(u[0], v[0])];\n if (s0 >= lo - 0.5 && s1 <= hi + 0.5) return true;\n // 外の点をまたいで外へ伸びる線は、外の点から先の所だけを測る\n if (s0 >= lo - 0.5 && s0 <= hi + 0.5) return valueRouter.passable(request, [hi, c.port.y], [s1, c.port.y]);\n if (s1 >= lo - 0.5 && s1 <= hi + 0.5) return valueRouter.passable(request, [lo, c.port.y], [s0, c.port.y]);\n }\n return valueRouter.passable(request, u, v);\n };\n const full = unjog([[pa.port.x, pa.port.y], ...path, [pb.port.x, pb.port.y]], 16, passes, valueRouter);\n return { points: simplify(full), a: pa.port, b: pb.port };\n };\n const got = fewerBends(valueRouter, request, finish);\n if (got) return got;\n }\n return undefined;\n };\n if (home && bay) {\n // 箱を載せる管は、箱の下を横に走って箱の列の端から道を探す\n const a = portAt(home.party, d.token, home.side, home.slot);\n const dock: PortChoice = { port: a, cost: 0, exit: [home.side === \"left\" ? bay.x1 : bay.x2, a.y], inner: false };\n const other = d.from === home.party ? d.to : d.from;\n const got = join([dock], portsOf(other, d.token, k));\n if (got) {\n points = got.points;\n ports = d.from === home.party ? [got.a, got.b] : [got.b, got.a];\n if (d.from !== home.party) points = [...points].reverse();\n }\n } else {\n const got = join(portsOf(d.from, d.token, k), portsOf(d.to, d.token, k));\n if (got) {\n points = got.points;\n ports = [got.a, got.b];\n }\n }\n }\n if (!points || !ports || !ports[0] || !ports[1]) {\n failed.push(k);\n if (!fallback) continue;\n // 最後の組み方でも道が無い時は、下の道を通る折れ線で結ぶ。決まりの表が違反に数える\n const a = portsOf(d.from, d.token)[0]?.port ?? portAt(d.from, d.token, \"right\", 0);\n const b = portsOf(d.to, d.token)[0]?.port ?? portAt(d.to, d.token, \"left\", 0);\n const out = (p: PipePort): number => p.x + (p.side === \"left\" ? -1 : 1) * (vHalf + P.lane.clear * 2);\n const low = (band1.length > 0 ? C1 : C0) - pitch / 2;\n points = [\n [a.x, a.y],\n [out(a), a.y],\n [out(a), low],\n [out(b), low],\n [out(b), b.y],\n [b.x, b.y],\n ];\n ports = [a, b];\n }\n taken.set(keyPort(ports[0]), groupOfDef(k));\n taken.set(keyPort(ports[1]), groupOfDef(k));\n layValue(k, points);\n routes[k] = { def: k, points, ports };\n detours.set(k, detourOf(points));\n if (bendsOf(points) > MAX_BENDS) bent.push(k);\n }\n return { failed, bent, detours };\n };\n // 道の無い管と曲がりすぎた管と遠回りした管を前に出して、引く順を最大 4 通り試す。道の無い管が少なく、曲がりすぎた管が少なく、遠回りが短い順を採る\n const FAR = 240;\n const { best, ran } = tryOrders(\n order2,\n (list) => list.join(\",\"),\n (list) => routeValues(list, false),\n (got) => [got.failed.length, got.bent.length, [...got.detours.values()].reduce((s, v) => s + v, 0)],\n (list, got) => {\n const far = [...got.detours.entries()].filter(([, v]) => v > FAR).sort((a, b) => b[1] - a[1]).map(([k]) => k);\n // 隣の囲いを結ぶ管は道を探さず真っすぐ引くため、いつも先頭に置く\n const fixed = list.filter((k) => homes.some((m) => m.def === k && m.gap));\n const bad = [...new Set([...got.failed, ...got.bent, ...far])].filter((k) => !fixed.includes(k));\n return bad.length === 0 ? undefined : [...fixed, ...bad, ...list.filter((k) => !bad.includes(k) && !fixed.includes(k))];\n },\n );\n const valuesFailed = best.got.failed.length;\n // 道が無いか曲がりすぎた管が残る時は、間を広げた組み方で組み直す\n if (valuesFailed + best.got.bent.length > 0 && !plan.last) return undefined;\n if (best.list !== ran || valuesFailed > 0) routeValues(best.list, valuesFailed > 0);\n\n // ---- 呼び出しの管の道\n\n const cHalf = P.call.case / 2;\n const cPad = cHalf + P.lane.clear;\n const callObs: Obstacle[] = [];\n const callOwn = new Map<string, number[]>();\n const addCall = (rect: Rect, pad: number, owner?: string): void => {\n if (owner !== undefined) callOwn.set(owner, [...(callOwn.get(owner) ?? []), callObs.length]);\n callObs.push({ rect, pad });\n };\n const partyRects = new Map<string, Rect>();\n for (const id of order) {\n if (isBox(id) && !homeOfBox.has(id) && !xOf.has(id)) continue;\n const r = labelOf(id);\n partyRects.set(id, r);\n addCall(rectOf(id), 0);\n if (shapeOf(id) === \"round\") addCall({ ...r, y: r.y + P.avatar.size }, cPad);\n addCall(rectOf(id), cPad, id);\n }\n for (const h of housings) addCall(h, cPad, `h:${h.party}`);\n for (const b of bays) {\n const r = bayRect(b);\n const box = rectOf(b.home.box);\n // 箱の左の計器と式の札の場所\n if (box.x - r.x > 1) addCall({ x: r.x, y: r.y, w: box.x - r.x - PART_GAP / 2, h: r.h }, cPad);\n addCall({ x: box.x + box.w / 2 - 3, y: box.y + box.h, w: 6, h: b.y - box.y - box.h }, cPad);\n }\n const startRun = (from: string, to: string): number => {\n const gaugeHere = callGauge.has(to) && shown.find((c) => c.to === to)?.from === from;\n return P.call.valveAt + P.valve.r + SPACING + (gaugeHere ? P.gauge.r * 2 + SPACING : 0);\n };\n // 呼び出しの管の格子。名札の縁と真ん中と出入りの点を残し、値の管の格子の線で埋める。\n // 埋める線は残す線から 16 より離す。近い線が並ぶと、線の間で折れる短い段差ができる\n const callXs = new Set<number>();\n const callYs = new Set<number>();\n const callEnds = new Map<string, { starts: End[]; ends: End[]; rect: Rect }>();\n for (const id of partyRects.keys()) {\n const r = rectOf(id);\n const cy = cyOf(id);\n const cx = r.x + r.w / 2;\n callXs.add(r.x);\n callXs.add(r.x + r.w);\n callXs.add(cx);\n callYs.add(cy);\n callYs.add(r.y);\n callYs.add(r.y + r.h);\n callEnds.set(id, { starts: [], ends: [], rect: r });\n }\n const branches = [...new Map(shown.map((c) => [`${c.from}>${c.to}`, c])).values()];\n const topSlot = LANE_STEP;\n /** 名札の角の丸み。丸の名札は縁を円とし、崩れの検査が測る丸みと揃える (#3607) */\n const cornerOf = (id: string): number => (shapeOf(id) === \"cabinet\" ? P.cabinet.radius : shapeOf(id) === \"token\" ? P.token.radius : rectOf(id).h / 2);\n /**\n * 同じ者の同じ横から出る k 本目の管の高さのずれ。真ん中、上、下の順。\n * 縁の角から `cornerRoom` 離れた所に収まらない時は真ん中にし、管を角の丸みにかけない (#3523)\n */\n const laneOff = (id: string, k: number): number => {\n const o = [0, -topSlot, topSlot][k] ?? 0;\n return Math.abs(o) + cornerRoom(cornerOf(id)) <= rectOf(id).h / 2 ? o : 0;\n };\n /**\n * 名札の横から出て向きを決めるまでの長さ。弁を載せる分を取るが、呼ばれた側が真横の近くに居る時は、\n * 呼ばれた側の手前で向きを揃えられるよう縮める\n */\n const runOf = (from: string, to: string, side: 0 | 2, k = 0): number => {\n // 同じ横から k 本の管が先に出ている時は、弁 1 つ分ずつ長く出て、先の管の弁と並ばないようにする\n const base = startRun(from, to) + k * (P.valve.r * 2 + SPACING);\n const a = rectOf(from);\n const b = rectOf(to);\n const g = side === 0 ? b.x - (a.x + a.w) : a.x - (b.x + b.w);\n const room = g - 18 - 4;\n return g > 0 && room < base && room > cPadOf() + 1 ? room : base;\n };\n function cPadOf(): number {\n return P.call.case / 2 + P.lane.clear;\n }\n for (const id of partyRects.keys()) for (const o of [-topSlot, topSlot]) callYs.add(cyOf(id) + o);\n for (const c of branches) {\n const a = rectOf(c.from);\n for (const k of [0, 1, 2, 3]) {\n callXs.add(a.x - runOf(c.from, c.to, 2, k));\n callXs.add(a.x + a.w + runOf(c.from, c.to, 0, k));\n }\n }\n /** 上から入る口。真ん中と、幅が足りる名札は左右にも置く。呼ぶ者が多い名札や、真上が塞がる名札に入れるように */\n const topsOf = (id: string): number[] => {\n const r = rectOf(id);\n const bx = r.x + r.w / 2;\n if (shapeOf(id) === \"round\") return [bx];\n const out = [bx];\n // 左右の口も、縁の角から `cornerRoom` 離れた所までに置く\n for (let k = 1; k * topSlot <= r.w / 2 - cornerRoom(cornerOf(id)); k++) out.push(bx - k * topSlot, bx + k * topSlot);\n return out;\n };\n // 呼ばれた側へは、縁から `APPROACH` 手前の点で向きを揃えてから入る。縁の際で折れる短い線を作らない\n for (const id of partyRects.keys()) {\n const r = rectOf(id);\n for (const x of topsOf(id)) callXs.add(x);\n callXs.add(r.x - APPROACH);\n callXs.add(r.x + r.w + APPROACH);\n callYs.add(r.y - APPROACH);\n callYs.add(r.y + r.h + APPROACH);\n }\n // 一番上の段の名札を上から越えて、上の口へ下りる管の線。口の手前の線の 1 本上に置く。\n // 一番上の段の名札の上の縁が揃うと、図の上の縁との間にこの線のほかの線が残らない (#3523)\n const topRow = Math.min(...[...partyRects.keys()].map((id) => rectOf(id).y));\n callYs.add(topRow - APPROACH - P.call.case);\n // 書き込む管が札の上で折れる所\n for (const h of holders) {\n callYs.add(yOfBand(h) + (P.housing.top - IO_H) / 2 - 2);\n for (const name of platesOf.get(h) ?? []) {\n const pr = plateRect(h, name);\n if (pr) callXs.add(pr.x + pr.w / 2);\n }\n }\n // 図の上の縁と左の縁に沿う線は使わない。そこを通る管は半分が図の外に出て切れる (#3523)\n const callXList = gridLines(valueXs, [...callXs], 16).filter((x) => x >= P.call.case);\n const callYList = gridLines(valueYs, [...callYs], 16).filter((y) => y >= P.call.case);\n let callRouter = new Router(callXList, callYList, callObs);\n let callPath = new Map<string, Point[]>();\n\n // 呼び出しの管の弁。全ての呼び出しの管を引いた後に置く。弁を置けない管を引き直す時は、置いた弁の形を間を空けて通る障害にし、\n // 書き込む管を引く時は、弁の形の縁を越えない線として置く。後から引く管が弁の形から離れて通るため、弁がほかの線に載らない\n const onCall: { at: Point; half: number; tall: number; branch: string }[] = [];\n const valves = new Map<string, Point>();\n /** 取っ手を管の下 (縦の管では左) に立てた弁 */\n const underValves = new Set<string>();\n /** 縦に走る所に置いた弁 */\n const uprightValves = new Set<string>();\n /** 置いた弁が描く形 */\n const valveShapes: Rect[] = [];\n /** 弁が描く形の縁を、後から引く線が越えない線として置く */\n const layValve = (router: Router, key: string, at: Point, under: boolean, vertical: boolean): void => {\n for (const r of valveRects(at[0], at[1], vertical, under))\n router.lay(\n [\n [r.x, r.y],\n [r.x + r.w, r.y],\n [r.x + r.w, r.y + r.h],\n [r.x, r.y + r.h],\n [r.x, r.y],\n ],\n { owner: `valve:${key}`, group: `valve:${key}`, kind: \"valve\", width: 0 },\n );\n };\n const placeValve = (key: string, at: Point, under: boolean, vertical = false): void => {\n valves.set(key, at);\n if (under) underValves.add(key);\n if (vertical) uprightValves.add(key);\n onCall.push({ at, half: vertical ? P.valve.half : P.valve.r, tall: vertical ? P.valve.r : P.valve.half, branch: key });\n valveShapes.push(...valveRects(at[0], at[1], vertical, under));\n layValve(callRouter, key, at, under, vertical);\n };\n /** 弁と計器の縦の半分。弁は横に長い */\n const tallOf = (half: number): number => (half === P.valve.r ? P.valve.half : half);\n /** 横の半分が `half`、縦の半分が `tall` の四角と、置いた弁と計器の四角の縁の間が、決まりの間を超えるか。決まりの表と同じく、横と縦の隔たりの大きい方で測る */\n const freeBox = (p: Point, half: number, tall: number): boolean =>\n onCall.every((o) => Math.max(Math.abs(o.at[0] - p[0]) - o.half - half, Math.abs(o.at[1] - p[1]) - o.tall - tall) >= SPACING);\n /** 弁と計器の四角どうしの縁の間が、決まりの間を超えるか */\n const free = (p: Point, half: number): boolean => freeBox(p, half, tallOf(half));\n /**\n * 置いた線のうち、`branch` の管でない物。`mine` の時は同じ者から出た管も含める (計器は同じ者の管が分かれる所に置かない)\n */\n const otherLines = (branch: string, mine = false, skip: ReadonlySet<string> = new Set()): { points: Point[]; half: number; sibling?: boolean }[] => {\n const from = branch.split(\">\")[0];\n return [\n ...routes.flatMap((r) => (r ? [{ points: r.points, half: P.bus.case / 2 }] : [])),\n ...stubs.map((s) => ({ points: s.points, half: P.bus.case / 2 })),\n ...ties.map((t) => ({ points: [[t.x, t.y1], [t.x, t.y2]] as Point[], half: 1 })),\n ...[...callPath.entries()]\n .filter(([k]) => k !== branch && !skip.has(k) && (mine || k.split(\">\")[0] !== from))\n .map(([k, points]) => ({ points, half: cHalf, sibling: k.split(\">\")[0] === from })),\n ];\n };\n /** 道の上で、横に走る所の、ほかの弁と計器と線から離れた所。`from` は道の始まりからの距離の下限 */\n const spot = (points: Point[], half: number, from: number, avoid: readonly Point[][] = [], branch = \"\"): Point | undefined => {\n let walked = 0;\n // 計器は、同じ者から出た管とも重ならない所に置く。弁は同じ者の管が共に通る所を `avoid` で避ける\n const others = otherLines(branch, half === P.gauge.r);\n for (const [a, b] of segs(points)) {\n const len = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (flat(a, b) && len >= half * 2 + SPACING) {\n const dir = Math.sign(b[0] - a[0]);\n for (let t = Math.max(half + SPACING / 2, from - walked); t <= len - half - SPACING / 2; t += 4) {\n const p: Point = [a[0] + dir * t, a[1]];\n if (!free(p, half)) continue;\n const box: Rect = { x: p[0] - half, y: p[1] - tallOf(half), w: half * 2, h: tallOf(half) * 2 };\n if (others.some((l) => segs(l.points).some(([u, v]) => hits(u, v, box, l.half + 2)))) continue;\n if (avoid.some((q) => segs(q).some(([u, v]) => flat(u, v) && Math.abs(u[1] - p[1]) < 0.5 && p[0] >= Math.min(u[0], v[0]) - half && p[0] <= Math.max(u[0], v[0]) + half))) continue;\n return p;\n }\n }\n walked += len;\n }\n return undefined;\n };\n /**\n * 弁が描く形 (胴と軸と、閉じた取っ手と開いた取っ手) が、`lines` の全ての線から離れるか。胴は `body`、軸と取っ手は `VALVE_ROOM` 離す。\n * 同じ者から出る管も数える。同じ者の管が共に通る本管の上の弁は、どの枝の弁か読めない\n */\n const valveClear = (p: Point, vertical: boolean, under: boolean, lines: readonly { parts: [Point, Point][]; half: number }[], body: number): boolean => {\n const rects = valveRects(p[0], p[1], vertical, under);\n // 取っ手どうしも重ねない\n if (rects.some((r) => valveShapes.some((o) => !apart(r, o, VALVE_ROOM)))) return false;\n return lines.every((l) => l.parts.every(([u, v]) => rects.every((r, i) => !hits(u, v, r, l.half + (i === 0 ? body : VALVE_ROOM)))));\n };\n /**\n * 道の上の、ほかの弁と計器から決まりの間を空け、弁の形がほかの線から離れる所と、取っ手を下 (縦の管では左) に立てるか。\n * 横に走る所にも縦に走る所にも置き、弁は管の向きに合わせて描く。同じ者の管と共に通る幹から分かれた枝は、\n * 分かれた先が縦に走ることが多く、自分の枝に弁を置くには縦の所に置く。\n * 始まりに近い所から選び、同じ所では取っ手を上 (縦の管では右) に立てる方を先に試す。`skip` の管の線は測らない。\n * 先に胴がほかの線から管と部品の間 (`LINE_GAP`) 離れる所を道の全体で探し、無い時だけ `VALVE_ROOM` まで寄せた所を探す (#3523)。\n * 隣を平行に走る管から `VALVE_ROOM` しか離れない胴は、隣の管に触れて見える\n */\n const valveSpot = (\n points: Point[],\n branch: string,\n skip: ReadonlySet<string> = new Set(),\n shared = false,\n ): { at: Point; under: boolean; vertical: boolean } | undefined => {\n for (const body of [LINE_GAP, VALVE_ROOM]) {\n const at = valveSpotWith(points, branch, skip, shared, body);\n if (at) return at;\n }\n return undefined;\n };\n /** 胴をほかの線から `body` 離す、`valveSpot` の 1 回の探し */\n const valveSpotWith = (\n points: Point[],\n branch: string,\n skip: ReadonlySet<string>,\n shared: boolean,\n body: number,\n ): { at: Point; under: boolean; vertical: boolean } | undefined => {\n const r = P.valve.r;\n const reach = P.valve.stem + P.valve.lever + VALVE_ROOM;\n const others = otherLines(branch, true, skip);\n for (const [a, b] of segs(points)) {\n const vertical = !flat(a, b);\n const len = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (len < r * 2 + SPACING) continue;\n const dx = Math.sign(b[0] - a[0]);\n const dy = Math.sign(b[1] - a[1]);\n // 弁の形が届く所の近くを通る線だけを測る\n const along = len + (P.valve.lever + VALVE_ROOM) * 2;\n const near: Rect = vertical\n ? { x: a[0] - reach, y: Math.min(a[1], b[1]) - P.valve.lever - VALVE_ROOM, w: reach * 2, h: along }\n : { x: Math.min(a[0], b[0]) - P.valve.lever - VALVE_ROOM, y: a[1] - reach, w: along, h: reach * 2 };\n /** `shared` の時は、この所で重なって走る同じ者の管の線分を測らない (弁が本管に載る) */\n const onHere = (u: Point, v: Point): boolean =>\n vertical\n ? !flat(u, v) && Math.abs(u[0] - a[0]) < 0.5 && Math.max(u[1], v[1]) > Math.min(a[1], b[1]) && Math.min(u[1], v[1]) < Math.max(a[1], b[1])\n : flat(u, v) && Math.abs(u[1] - a[1]) < 0.5 && Math.max(u[0], v[0]) > Math.min(a[0], b[0]) && Math.min(u[0], v[0]) < Math.max(a[0], b[0]);\n const lines = others\n .map((l) => (shared && l.sibling ? { ...l, points: [] as Point[], parts: segs(l.points).filter(([u, v]) => !onHere(u, v)) } : { ...l, parts: segs(l.points) }))\n .filter((l) => l.parts.some(([u, v]) => hits(u, v, near, l.half)));\n for (let t = r + SPACING / 2; t <= len - r - SPACING / 2; t += 4) {\n const p: Point = [a[0] + dx * t, a[1] + dy * t];\n if (!(vertical ? freeBox(p, P.valve.half, r) : freeBox(p, r, P.valve.half))) continue;\n for (const under of [false, true]) if (valveClear(p, vertical, under, lines, body)) return { at: p, under, vertical };\n }\n }\n return undefined;\n };\n /** 呼び出しの管の道を探す前に置く線。値の管と短い管と点線 */\n const callBase = (router: Router): Router => {\n for (const r of routes) if (r) router.lay(r.points, { owner: lineOwner(r.def), group: groupOfDef(r.def), kind: \"value\", width: P.bus.case });\n for (const s of stubs) router.lay(s.points, { owner: `s${s.token}`, group: `s${s.token}`, kind: \"stub\", width: P.bus.case });\n for (const t of ties) {\n const tie: Point[] = [\n [t.x, t.y1],\n [t.x, t.y2],\n ];\n router.lay(tie, { owner: `tie:${t.party}`, group: `tie:${t.party}`, kind: \"tie\", width: 2 });\n }\n return router;\n };\n /** 呼び出しの管を `list` の順に引く。道の無かった管を返す */\n const routeCalls = (list: readonly (typeof branches)[number][], fallback: boolean): { failed: string[]; bent: string[]; twice: string[]; cramped: string[] } => {\n callRouter = new Router(callXList, callYList, callObs);\n callPath = new Map();\n valves.clear();\n underValves.clear();\n uprightValves.clear();\n valveShapes.length = 0;\n onCall.length = 0;\n /** ほかの線から離れた所が無く、弁を置けなかった呼び出し */\n const crampedCalls: string[] = [];\n callBase(callRouter);\n const failedCalls: string[] = [];\n const bentCalls: string[] = [];\n /** 1 本の値の管を 2 度越えた呼び出し */\n const twiceCalls: string[] = [];\n const lanes = new Map<string, number>();\n /** 名札の横の、入る管が使った所 (`id|向き|高さ`) と、出る管が使った所。入る管と出る管は同じ所を使わない */\n const entered = new Set<string>();\n const left = new Set<string>();\n const sideKey = (id: string, side: 0 | 2, y: number): string => `${id}|${side}|${Math.round(y)}`;\n const sideUsed = (set: ReadonlySet<string>, id: string, side: 0 | 2): boolean => [...set].some((k) => k.startsWith(`${id}|${side}|`));\n /** 出る管の高さ。同じ者の管は同じ高さを共に使ってよいが、入る管が使った高さは避ける */\n /** 出る管の高さの候補。入る管が使った高さを除き、まだ使っていない高さ、呼ぶ相手の高さに近い方の順 */\n const startYs = (id: string, side: 0 | 2, toward: number): number[] => {\n const base = cyOf(id);\n const used = (y: number): number => Number(left.has(sideKey(id, side, y)));\n // 入る管が使った横からは出ない。同じ横に出入りが並ぶと、入る管の計器を置く所が無くなる\n if (sideUsed(entered, id, side)) return [];\n const ys = [...new Set([0, 1, 2].map((k) => base + laneOff(id, k)))];\n // 使った高さの隣の高さは後にする。隣どうしの管に載せた弁は、胴が隣の管の縁に触れる (#3523)\n const taken = ys.filter((y) => used(y) === 1);\n const beside = (y: number): number => Number(used(y) === 0 && taken.some((u) => Math.abs(u - y) < topSlot * 2 - 0.5));\n return ys.sort((a, b) => used(a) - used(b) || beside(a) - beside(b) || Math.abs(a - toward) - Math.abs(b - toward));\n };\n /** 呼び出しが入った所 (`id|向き|高さ`)。引き直す管は、自分が入った所を外して入る口を選び直す */\n const entryOf = new Map<string, string>();\n /** 呼び出し `c` の道を探す問いと、探した道を名札の縁から呼ばれた側の縁までの線に仕上げる処理 */\n const planOf = (c: (typeof branches)[number]) => {\n const a = rectOf(c.from);\n const b = rectOf(c.to);\n const toward = b.x + b.w / 2 >= a.x + a.w / 2 ? 0 : 2;\n const ysR = startYs(c.from, 0, cyOf(c.to));\n const ysL = startYs(c.from, 2, cyOf(c.to));\n // 始まりの点では、そのまま進むほかに上か下へ折れてよい。縁から始まりの点までの横の線が弁を載せる所になる\n const startsAt = (at: Point, dir: 0 | 2, cost: number): End[] => [\n { at, dir, cost },\n { at, dir: 1, cost: cost + 50 },\n { at, dir: 3, cost: cost + 50 },\n ];\n const starts: End[] = [\n ...ysR.flatMap((y, i) => startsAt([a.x + a.w + runOf(c.from, c.to, 0, lanes.get(`${c.from}|0`) ?? 0), y], 0, (toward === 0 ? 0 : 80) + i * 30)),\n ...ysL.flatMap((y, i) => startsAt([a.x - runOf(c.from, c.to, 2, lanes.get(`${c.from}|2`) ?? 0), y], 2, (toward === 2 ? 0 : 80) + i * 30)),\n ];\n const bx = b.x + b.w / 2;\n const by = cyOf(c.to);\n const entries: (End & { edge: Point })[] = [\n ...topsOf(c.to).map((x, i): End & { edge: Point } => ({ at: [x, b.y - APPROACH], dir: 1, cost: Math.ceil(i / 2) * 8, edge: [x, b.y] })),\n ...(entered.has(sideKey(c.to, 2, by)) || sideUsed(left, c.to, 2) ? [] : [{ at: [b.x - APPROACH, by] as Point, dir: 0 as Dir, cost: 20, edge: [b.x, by] as Point }]),\n ...(entered.has(sideKey(c.to, 0, by)) || sideUsed(left, c.to, 0) ? [] : [{ at: [b.x + b.w + APPROACH, by] as Point, dir: 2 as Dir, cost: 20, edge: [b.x + b.w, by] as Point }]),\n // 下から入る口は、囲いへ下りる点線と重なるため、囲いを持つ者には置かない\n ...(isBox(c.to) || holding.has(c.to) ? [] : [{ at: [bx, b.y + b.h + APPROACH] as Point, dir: 3 as Dir, cost: 60, edge: [bx, b.y + b.h] as Point }]),\n // トークンの箱の下の真ん中は管の弁へ下りる軸が在る。幅の広い箱は、軸と弁から離れた下の口を持つ\n ...(isBox(c.to)\n ? topsOf(c.to)\n .filter((x) => Math.abs(x - bx) >= P.valve.r + P.call.case / 2 + LINE_GAP)\n .map((x, i): End & { edge: Point } => ({ at: [x, b.y + b.h + APPROACH], dir: 3, cost: 60 + i * 8, edge: [x, b.y + b.h] }))\n : []),\n ];\n // 呼ばれた側がさらに呼ぶ時は、その相手の方の横を自分の出る管に残すため、その横から入りにくくする\n const facing = (side: 0 | 2): boolean =>\n branches.some((x) => {\n if (x.from !== c.to) return false;\n const t = rectOf(x.to);\n return (t.x + t.w / 2 >= b.x + b.w / 2 ? 0 : 2) === side;\n });\n // 左から入る (向き 0) のは左の横、右から入る (向き 2) のは右の横\n const ends: End[] = entries.map(({ at, dir, cost }) => ({ at, dir, cost: (dir === 0 && facing(2)) || (dir === 2 && facing(0)) ? (cost ?? 0) + 300 : cost }));\n // 呼ばれた側へは縁の手前の点で向きを揃えて入るため、呼ばれた側の縁は通さない。縁に沿って走る線を作らない。\n // 呼ぶ側の名札の縁は、名札の際から出る 2 度目の試しだけ通す。1 度目から通すと、名札の下を回って自分の点線をまたぐ\n const allow = new Set<number>();\n const ask = {\n owner: `c:${c.from}>${c.to}`,\n group: `c:${c.from}`,\n kind: \"call\" as const,\n width: P.call.case,\n starts,\n ends,\n allow,\n cross: (l: Laid): number | undefined => (l.kind === \"value\" || l.kind === \"stub\" ? 300 : l.kind === \"call\" ? 400 : undefined),\n gap: LINE_GAP,\n bend: 50,\n };\n // 名札の縁から始まりの点までの線は道を探さずに引くため、点線や線をまたがないかを先に確かめる\n const ownAsk = { ...ask, allow: new Set([...allow, ...(callOwn.get(c.from) ?? [])]) };\n const edgeOf = (st: End): Point => [st.at[0] > a.x + a.w / 2 ? a.x + a.w : a.x, st.at[1]];\n ask.starts = starts.filter((st) => callRouter.passable(ownAsk, edgeOf(st), st.at));\n const callFinish = (path: Point[]): { points: Point[]; raw: Point[] } => {\n const head = path[0] as Point;\n const tail = path[path.length - 1] as Point;\n const into = entries.find((e) => Math.abs(e.at[0] - tail[0]) < 0.5 && Math.abs(e.at[1] - tail[1]) < 0.5);\n return { points: simplify([edgeOf({ at: head, dir: 0 }), ...path, ...(into ? [into.edge] : [])]), raw: path };\n };\n /** 探した道を、名札の縁から呼ばれた側の縁までの線にする。縁の際の短い段差は消す */\n const finish = (path: Point[]): { points: Point[]; entry: (End & { edge: Point }) | undefined } => {\n const first = path[0] as Point;\n const last = path[path.length - 1] as Point;\n const edge: Point = [first[0] > a.x + a.w / 2 ? a.x + a.w : a.x, first[1]];\n const entry = entries.find((e) => Math.abs(e.at[0] - last[0]) < 0.5 && Math.abs(e.at[1] - last[1]) < 0.5);\n // ずらした線が通れる時だけ消す。呼ばれた側の手前の点から縁までの線は、道を探さずに引く線なので通れるとする\n const approach = (u: Point, v: Point): boolean =>\n entry !== undefined && Math.abs(u[0] - entry.at[0]) < 0.5 && Math.abs(u[1] - entry.at[1]) < 0.5 && Math.abs(v[0] - entry.edge[0]) < 0.5 && Math.abs(v[1] - entry.edge[1]) < 0.5;\n return { points: unjog([edge, ...path, ...(entry ? [entry.edge] : [])], 16, (u, v) => approach(u, v) || callRouter.passable(ownAsk, u, v), callRouter), entry };\n };\n return { a, b, bx, toward, ysR, ysL, startsAt, starts, ask, ownAsk, edgeOf, callFinish, finish, allow };\n };\n /** 入った所を覚える。左から入る (向き 0) のは左の横、右から入る (向き 2) のは右の横 */\n const enter = (key: string, to: string, entry: (End & { edge: Point }) | undefined): void => {\n if (!entry || (entry.dir !== 0 && entry.dir !== 2)) return;\n const k = sideKey(to, entry.dir === 0 ? 2 : 0, entry.at[1]);\n entered.add(k);\n entryOf.set(key, k);\n };\n for (const c of list) {\n const key = `${c.from}>${c.to}`;\n const { a, b, bx, toward, ysR, ysL, startsAt, starts, ask, ownAsk, edgeOf, callFinish, finish, allow } = planOf(c);\n const ay0 = cyOf(c.from);\n let found = fewerBends(callRouter, ask, callFinish);\n // 弁を載せる長さの所で上か下へ折れられず、曲がりすぎた時は、別の長さで出る始まりも加えて探し直す。\n // 短い始まりは先の管と同じ所で折れて共に通り、弁は共に通らない所へ置く。折れが減った時だけ採る\n if (found && bendsOf(found.points) > MAX_BENDS) {\n const longer = (side: 0 | 2, ys: number[], x: (k: number) => number): End[] => {\n const now = lanes.get(`${c.from}|${side}`) ?? 0;\n return [0, 1, 2, 3].filter((k) => k !== now).flatMap((k) => ys.flatMap((y, i) => startsAt([x(k), y], side, (toward === side ? 0 : 80) + i * 30 + 60)));\n };\n const extra = [\n ...longer(0, ysR, (k) => a.x + a.w + runOf(c.from, c.to, 0, k)),\n ...longer(2, ysL, (k) => a.x - runOf(c.from, c.to, 2, k)),\n ].filter((st) => callRouter.passable(ownAsk, edgeOf(st), st.at));\n const again = extra.length > 0 ? fewerBends(callRouter, { ...ask, starts: [...ask.starts, ...extra] }, callFinish) : undefined;\n if (again && bendsOf(again.points) < bendsOf(found.points)) found = again;\n }\n // 1 本の値の管を 2 度越えた時は、その管の組を越える値を重くして探し直す。越える値は辺ごとに組で 1 度だけ数えるため、\n // 幹を何度も越える道が、1 本ずつ越える道より安く見えることがある。2 度越える管が減り、折れが上限を超えない時だけ採る\n if (found) {\n const twice = (points: readonly Point[]): Set<string> =>\n new Set(routes.flatMap((r) => (r && crossedTimes(points, r.points) > 1 ? [groupOfDef(r.def)] : [])));\n const heavy = twice(found.points);\n if (heavy.size > 0) {\n const again = fewerBends(callRouter, { ...ask, cross: (l: Laid) => (heavy.has(l.group) ? REVISIT : ask.cross(l)) }, callFinish);\n if (again && bendsOf(again.points) <= MAX_BENDS && twice(again.points).size < heavy.size) found = again;\n }\n }\n const path =\n found?.raw ??\n callRouter.route({ ...ask, allow: new Set([...allow, ...(callOwn.get(c.from) ?? [])]), starts: starts.filter((st) => st.dir === 0 || st.dir === 2).map((st) => ({ ...st, at: edgeOf(st) })) });\n if (!path) {\n failedCalls.push(key);\n if (!fallback) continue;\n callPath.set(key, [\n [a.x + a.w, ay0],\n [bx, ay0],\n [bx, b.y],\n ]);\n continue;\n }\n const first = path[0] as Point;\n const right = first[0] > a.x + a.w / 2;\n // 同じ横から出た管の数。次の管は高さが違っても弁 1 つ分長く出て、弁を横にずらす\n const laneKey = `${c.from}|${right ? 0 : 2}`;\n lanes.set(laneKey, (lanes.get(laneKey) ?? 0) + 1);\n left.add(sideKey(c.from, right ? 0 : 2, first[1]));\n const { points: simple, entry } = finish(path);\n enter(key, c.to, entry);\n callPath.set(key, simple);\n if (bendsOf(simple) > MAX_BENDS) bentCalls.push(key);\n if (routes.some((r) => r && crossedTimes(simple, r.points) > 1)) twiceCalls.push(key);\n callRouter.lay(simple, { owner: ask.owner, group: ask.group, kind: \"call\", width: P.call.case });\n }\n // 弁は、載せられる横の線が短い管から先に置く。長い管は後から空いた所を選べる\n const roomOn = (c: (typeof branches)[number]): number =>\n segs(callPath.get(`${c.from}>${c.to}`) ?? []).reduce((sum, [a, b]) => sum + (flat(a, b) ? Math.abs(b[0] - a[0]) : 0), 0);\n const waiting: (typeof branches)[number][] = [];\n for (const c of [...list].sort((a, b) => roomOn(a) - roomOn(b))) {\n const key = `${c.from}>${c.to}`;\n const points = callPath.get(key);\n if (!points || valves.has(key)) continue;\n const clear = valveSpot(points, key);\n if (clear) placeValve(key, clear.at, clear.under, clear.vertical);\n else waiting.push(c);\n }\n /** 値の管と点線と置いた呼び出しの管と弁で、道を探す道具を作り直す */\n const rebuild = (xs: readonly number[] = callXList, ys: readonly number[] = callYList): Router => {\n // 置いた弁の形は、管の縁が決まりの間を空けて通る障害にする。線として置くと、形の角の際を通る管を止められない\n const valveObs = [...valves].flatMap(([k, at]) =>\n valveRects(at[0], at[1], uprightValves.has(k), underValves.has(k)).map((rect): Obstacle => ({ rect, pad: cHalf + VALVE_ROOM })),\n );\n const router = callBase(new Router(xs, ys, [...callObs, ...valveObs]));\n for (const [k, points] of callPath) router.lay(points, { owner: `c:${k}`, group: `c:${k.split(\">\")[0]}`, kind: \"call\", width: P.call.case });\n return router;\n };\n /** 置いた弁を外す */\n const unplaceValve = (key: string): void => {\n valves.delete(key);\n underValves.delete(key);\n uprightValves.delete(key);\n valveShapes.length = 0;\n for (const [k, at] of valves) valveShapes.push(...valveRects(at[0], at[1], uprightValves.has(k), underValves.has(k)));\n for (let i = onCall.length - 1; i >= 0; i--) if (onCall[i]?.branch === key) onCall.splice(i, 1);\n };\n /**\n * 弁を置けない管 `c` のために、ほかの呼び出しの管を引き直す。ほかの呼び出しの管の線と弁を測らずに `c` の弁の置き場所を取り、\n * その場所を塞ぐ管 (2 本まで) を、取った弁を越えない道で引き直す。同じ者の管が同じ横に詰めて出る時や、\n * ほかの者の管が弁の真上を並んで走る時は、取っ手を塞いで弁を置けないため、先に引いた管を譲らせる。\n * 引き直した管が弁を置け、折れと長さが元の道を大きく超えず、1 本の値の管を 2 度越えない時だけ採り、採らない時は元に戻す\n */\n const yieldFor = (c: (typeof branches)[number], key: string, old: Point[]): boolean => {\n const rivals = new Set([...callPath.keys()].filter((k) => k !== key));\n if (rivals.size === 0) return false;\n const saved = {\n paths: new Map(callPath),\n valves: new Map(valves),\n under: new Set(underValves),\n upright: new Set(uprightValves),\n shapes: [...valveShapes],\n on: [...onCall],\n entered: new Set(entered),\n entryOf: new Map(entryOf),\n };\n const restore = (): false => {\n callPath = new Map(saved.paths);\n valves.clear();\n for (const [k, v] of saved.valves) valves.set(k, v);\n underValves.clear();\n for (const k of saved.under) underValves.add(k);\n uprightValves.clear();\n for (const k of saved.upright) uprightValves.add(k);\n valveShapes.splice(0, valveShapes.length, ...saved.shapes);\n onCall.splice(0, onCall.length, ...saved.on);\n entered.clear();\n for (const k of saved.entered) entered.add(k);\n entryOf.clear();\n for (const [k, v] of saved.entryOf) entryOf.set(k, v);\n callRouter = rebuild();\n return false;\n };\n for (const k of rivals) unplaceValve(k);\n const reserved = valveSpot(old, key, rivals);\n if (!reserved) return restore();\n const rects = valveRects(reserved.at[0], reserved.at[1], reserved.vertical, reserved.under);\n const blocking = [...rivals].filter((k) => {\n const v = saved.valves.get(k);\n const shape = v ? valveRects(v[0], v[1], saved.upright.has(k), saved.under.has(k)) : [];\n return (\n segs(callPath.get(k) as Point[]).some(([u, v2]) => rects.some((r) => hits(u, v2, r, cHalf + VALVE_ROOM))) ||\n shape.some((s) => rects.some((r) => !apart(s, r, VALVE_ROOM)))\n );\n });\n if (blocking.length === 0 || blocking.length > 2) return restore();\n // 塞がない管の弁は元の所に戻す\n for (const k of rivals)\n if (!blocking.includes(k)) {\n const v = saved.valves.get(k);\n if (v) placeValve(k, v, saved.under.has(k), saved.upright.has(k));\n }\n for (const k of blocking) {\n const e = entryOf.get(k);\n if (e) entered.delete(e);\n callPath.delete(k);\n }\n placeValve(key, reserved.at, reserved.under, reserved.vertical);\n // 取った弁の形の際を通る筋を格子に足す。格子の筋が弁の形から遠いと、譲る管は弁の手前で折れられず大きく回る\n const off = cHalf + LINE_GAP + 1;\n const xs = gridLines(rects.flatMap((r) => [r.x - off, r.x + r.w + off]), callXList, 4);\n const ys = gridLines(rects.flatMap((r) => [r.y - off, r.y + r.h + off]), callYList, 4);\n for (const k of blocking) {\n const bc = list.find((x) => `${x.from}>${x.to}` === k);\n const was = saved.paths.get(k);\n if (!bc || !was) return restore();\n // 譲る管は、自分の弁が載る長さだけ出て折れる短い始まりも使う。いつもの長さで出ると、取った弁の取っ手の上を通る\n const ra = rectOf(bc.from);\n const runs = [SHORT_RUN, (SHORT_RUN + startRun(bc.from, bc.to)) / 2];\n const startX = (side: 0 | 2, run: number): number => (side === 0 ? ra.x + ra.w + run : ra.x - run);\n callRouter = rebuild(gridLines([...xs, ...runs.flatMap((run) => [startX(0, run), startX(2, run)])], callXList, 4), ys);\n const plan = planOf(bc);\n const short = ([[0, plan.ysR], [2, plan.ysL]] as const).flatMap(([side, list2]) =>\n list2.flatMap((y, i) =>\n runs.flatMap((run) => {\n const at: Point = [startX(side, run), y];\n return callRouter.passable(plan.ownAsk, plan.edgeOf({ at, dir: side }), at) ? plan.startsAt(at, side, (plan.toward === side ? 0 : 80) + i * 30 + 40) : [];\n }),\n ),\n );\n const found = fewerBends(callRouter, { ...plan.ask, starts: [...plan.ask.starts, ...short] }, plan.callFinish);\n const redone = found ? plan.finish(found.raw) : undefined;\n if (\n !redone ||\n bendsOf(redone.points) > Math.min(MAX_BENDS, bendsOf(was) + 1) ||\n lengthOf(redone.points) > lengthOf(was) * DETOUR_RATE ||\n routes.some((r) => r && crossedTimes(redone.points, r.points) > 1)\n )\n return restore();\n callPath.set(k, redone.points);\n enter(k, bc.to, redone.entry);\n const at = valveSpot(redone.points, k);\n if (!at) return restore();\n placeValve(k, at.at, at.under, at.vertical);\n }\n callRouter = rebuild();\n return true;\n };\n // 弁を置けなかった管は、ほかの管と置いた弁をそのままにして、弁を置ける始まりの線を持つ始まりから引き直す。\n // 始まりの線は名札の縁から始まりの点までの横の線で、長く出る始まりも試す。引き直した道に弁を置け、\n // 折れが上限を超えず、1 本の値の管を 2 度越えず、元の道より大きく回らない時だけ採る。\n // 大きく回る道は、ほかの者の名札を囲んで計器の置き場所を塞ぎ、弁 1 つの空きより読みにくい\n for (const c of waiting) {\n const key = `${c.from}>${c.to}`;\n // 先の管の兄弟として引き直し、弁を置いた管は飛ばす\n if (valves.has(key)) continue;\n const old = callPath.get(key) as Point[];\n callPath.delete(key);\n callRouter = rebuild();\n callPath.set(key, old);\n const was = entryOf.get(key);\n if (was) entered.delete(was);\n const plan = planOf(c);\n const tries: End[] = [];\n for (const side of [0, 2] as const) {\n if (sideUsed(entered, c.from, side)) continue;\n const ys = [...new Set([0, 1, 2].map((k) => cyOf(c.from) + laneOff(c.from, k)))];\n for (const k of [0, 1, 2, 3])\n for (const y of ys) {\n const at: Point = [side === 0 ? plan.a.x + plan.a.w + runOf(c.from, c.to, 0, k) : plan.a.x - runOf(c.from, c.to, 2, k), y];\n const edge = plan.edgeOf({ at, dir: side });\n if (callRouter.passable(plan.ownAsk, edge, at) && valveSpot([edge, at], key)) tries.push(...plan.startsAt(at, side, (plan.toward === side ? 0 : 80) + k * 30));\n }\n }\n const found = tries.length > 0 ? fewerBends(callRouter, { ...plan.ask, starts: tries }, plan.callFinish) : undefined;\n const redone = found ? plan.finish(found.raw) : undefined;\n const fits =\n redone &&\n bendsOf(redone.points) <= Math.min(MAX_BENDS, bendsOf(old) + 1) &&\n lengthOf(redone.points) <= lengthOf(old) * DETOUR_RATE &&\n !routes.some((r) => r && crossedTimes(redone.points, r.points) > 1);\n const at = fits ? valveSpot(redone.points, key) : undefined;\n if (redone && at) {\n callPath.set(key, redone.points);\n enter(key, c.to, redone.entry);\n callRouter.lay(redone.points, { owner: plan.ask.owner, group: plan.ask.group, kind: \"call\", width: P.call.case });\n placeValve(key, at.at, at.under, at.vertical);\n continue;\n }\n if (was) entered.add(was);\n callRouter.lay(old, { owner: plan.ask.owner, group: plan.ask.group, kind: \"call\", width: P.call.case });\n yieldFor(c, key, old);\n }\n // 自分だけが通る所に離れた所の無い弁は、同じ者の管と重なって走る本管の上の、ほかの線と弁から離れた所に置く。\n // それも無い時は、ほかの弁と計器から決まりの間を空け、同じ者の管が共に通る所を避けて置く。決まりの表が違反に数える\n for (const c of waiting) {\n const key = `${c.from}>${c.to}`;\n const points = callPath.get(key);\n if (!points || valves.has(key)) continue;\n const onMain = valveSpot(points, key, new Set(), true);\n if (onMain) {\n placeValve(key, onMain.at, onMain.under, onMain.vertical);\n continue;\n }\n crampedCalls.push(key);\n const mine = [...callPath.entries()].filter(([k]) => k !== key && k.split(\">\")[0] === c.from && valves.has(k)).map(([, q]) => q);\n const at =\n spot(points, P.valve.r, P.call.valveAt, mine, key) ??\n spot(points, P.valve.r, P.call.valveAt, [], key) ??\n spot(points, P.valve.r, 0, [], key) ??\n along(points, Math.min(P.call.valveAt, lengthOf(points) / 2));\n placeValve(key, at, false);\n }\n return { failed: failedCalls, bent: bentCalls, twice: twiceCalls, cramped: crampedCalls };\n };\n // 道の無い呼び出しと曲がりすぎた呼び出しと 1 本の値の管を 2 度越えた呼び出しと弁を置けなかった呼び出しを前に出して、引く順を最大 4 通り試す。\n // 道の無い管が少なく、曲がりすぎた管が少なく、2 度越えた管が少なく、弁を置けなかった管が少ない順を採る\n {\n // 同じ者が呼ぶ管は、呼ばれた側が横に近い順に引く。ほかの者の管との順は変えない。\n // 先に引いた管が曲がる向きに近い高さを取り、後の管はその外の高さから出るので、同じ横から出る管が入れ子に曲がり、\n // 1 本の管を共に通らない (#3523)\n const reach = (c: (typeof branches)[number]): number => Math.abs(rectOf(c.to).x + rectOf(c.to).w / 2 - (rectOf(c.from).x + rectOf(c.from).w / 2));\n const callList = [...branches];\n const slotsOf = new Map<string, number[]>();\n branches.forEach((c, i) => slotsOf.set(c.from, [...(slotsOf.get(c.from) ?? []), i]));\n for (const slots of slotsOf.values()) {\n const nearer = slots.map((i) => branches[i] as (typeof branches)[number]).sort((a, b) => reach(a) - reach(b));\n slots.forEach((slot, k) => (callList[slot] = nearer[k] as (typeof branches)[number]));\n }\n const { best: bestCalls, ran: ranCalls } = tryOrders(\n callList,\n (l) => l.map((c) => `${c.from}>${c.to}`).join(\",\"),\n (l) => routeCalls(l, false),\n (got) => [got.failed.length, got.bent.length, got.twice.length, got.cramped.length],\n (l, got) => {\n const bad = [...new Set([...got.failed, ...got.bent, ...got.twice, ...got.cramped])];\n return bad.length === 0 ? undefined : [...l.filter((c) => bad.includes(`${c.from}>${c.to}`)), ...l.filter((c) => !bad.includes(`${c.from}>${c.to}`))];\n },\n );\n const callsFailed = bestCalls.got.failed.length;\n // 道が無いか、曲がりすぎたか、1 本の値の管を 2 度越えたか、弁を置けなかった管が残る時は、間を広げた組み方で組み直す\n if (bestCalls.score.reduce((s, v) => s + v, 0) > 0 && !plan.last) return undefined;\n if (bestCalls.list !== ranCalls || callsFailed > 0) routeCalls(bestCalls.list, callsFailed > 0);\n }\n\n // ---- 書き込む管\n\n const writes: PipeWrite[] = sim.writes\n .filter((w) => !foldSteps.has(w.step) && visible.has(w.from))\n .flatMap((w) => {\n const plate = isBox(w.to) ? undefined : plateRect(w.to, w.name);\n if (isBox(w.to)) {\n const box = rectOf(w.to);\n const i = (platesOf.get(w.to) ?? []).indexOf(w.name);\n if (i < 0) return [];\n const y = box.y + P.token.keyY + P.token.line * i - T.key.size;\n return [{ ...w, points: [[box.x + box.w / 2, y], [box.x + box.w / 2, y]] as Point[] }];\n }\n if (!plate) return [];\n const writer = rectOf(w.from);\n const px = plate.x + plate.w / 2;\n const turn = yOfBand(w.to) + (P.housing.top - IO_H) / 2 - 2;\n if (w.from === w.to) {\n const hs = housingOf.get(w.to) as PipeHousing;\n return [{ ...w, points: [[px, hs.y + P.housing.top - P.write.turn], [px, plate.y]] as Point[] }];\n }\n const wx = writer.x + writer.w / 2;\n const start = shapeOf(w.from) === \"round\" ? writer.y + writer.h / 2 + belowOf(w.from) : writer.y + writer.h;\n const straight: Point[] = [[wx, start], [wx, turn], [px, turn], [px, plate.y]];\n // 書き手の下から真っすぐ下りると名札を通る時は、名札と点線を避けて道を探す\n const blocked = [...partyRects.entries()].some(([id, r]) => id !== w.from && id !== w.to && segs(straight).some(([a, b]) => hits(a, b, r, 2)));\n if (!blocked) return [{ ...w, points: straight }];\n const cy = cyOf(w.from);\n // 横から出る時は、縁の手前で上か下へ折れてよい。書き込む管は細く、隣の点線の際を通れる\n const sides: End[] = [writer.x - APPROACH, writer.x + writer.w + APPROACH].flatMap((x): End[] =>\n ([x < wx ? 2 : 0, 1, 3] as Dir[]).map((dir) => ({ at: [x, cy] as Point, dir, cost: 20 })),\n );\n const path = callRouter.route({\n owner: `w:${w.from}>${w.to}.${w.name}`,\n group: `w:${w.from}>${w.to}.${w.name}`,\n kind: \"write\",\n width: 3,\n starts: [...(holding.has(w.from) ? [] : [{ at: [wx, writer.y + writer.h + APPROACH] as Point, dir: 1 as Dir, cost: 0 }]), ...sides],\n ends: [\n { at: [px, turn], dir: 0, cost: 0 },\n { at: [px, turn], dir: 2, cost: 0 },\n ],\n allow: new Set(callOwn.get(`h:${w.to}`) ?? []),\n cross: (l) => (l.kind === \"tie\" || l.kind === \"valve\" ? undefined : 40),\n gap: 4,\n bend: 40,\n });\n if (!path) return [{ ...w, points: straight }];\n const first = path[0] as Point;\n const edge: Point = Math.abs(first[0] - wx) < 0.5 ? [wx, start] : [first[0] < wx ? writer.x : writer.x + writer.w, cy];\n return [{ ...w, points: simplify([edge, ...path, [px, plate.y]]) }];\n });\n\n // ---- 呼び出しの管の弁と計器。管が横に走る所に、決まりの間を空けて置く\n\n const gaugeAt = new Map<string, { on: PipeGauge[\"on\"]; cx: number; cy: number; stem?: { y1: number; y2: number }; col?: { x: number; w: number } }>();\n for (const party of checkers) {\n const bay = bays.find((b) => b.gauges.some((g) => g.party === party));\n const g = bay?.gauges.find((x) => x.party === party);\n if (bay && g) {\n gaugeAt.set(party, { on: \"value\", cx: g.cx, cy: g.cy, stem: { y1: g.cy + P.gauge.r, y2: bay.y - P.gauge.stemGap }, col: g.col });\n continue;\n }\n const incoming = shown.find((c) => c.to === party);\n const points = incoming ? callPath.get(`${incoming.from}>${incoming.to}`) : undefined;\n if (points && !isBox(party)) {\n const valve = valves.get(`${incoming?.from}>${incoming?.to}`) as Point;\n const dist = (() => {\n let walked = 0;\n for (const [a, b] of segs(points)) {\n const len = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (Math.abs(valve[1] - a[1]) < 0.5 && flat(a, b) && valve[0] >= Math.min(a[0], b[0]) && valve[0] <= Math.max(a[0], b[0])) return walked + Math.abs(valve[0] - a[0]);\n if (Math.abs(valve[0] - a[0]) < 0.5 && !flat(a, b) && valve[1] >= Math.min(a[1], b[1]) && valve[1] <= Math.max(a[1], b[1])) return walked + Math.abs(valve[1] - a[1]);\n walked += len;\n }\n return 0;\n })();\n const branch = `${incoming?.from}>${incoming?.to}`;\n const at = spot(points, P.gauge.r, dist + P.valve.r + SPACING + P.gauge.r, [], branch) ?? spot(points, P.gauge.r, 0, [], branch);\n if (at) {\n gaugeAt.set(party, { on: \"call\", cx: at[0], cy: at[1] });\n onCall.push({ at, half: P.gauge.r, tall: P.gauge.r, branch });\n continue;\n }\n }\n // 管に載せられない時は名札の横に置く。線と重ならない向きを選ぶ\n const box = rectOf(party);\n const cy = box.y + box.h / 2;\n const r = P.gauge.r;\n const lines = otherLines(\"\", true);\n const right: Point = [box.x + box.w + P.gauge.lampGap + r, cy];\n const tries: Point[] = [\n right,\n [box.x - P.gauge.lampGap - r - P.gauge.lamp * 2, cy],\n [box.x + box.w / 2, box.y - P.gauge.lampGap - r],\n ];\n const at = tries.find(([x, y]) => !lines.some((l) => segs(l.points).some(([u, v]) => hits(u, v, { x: x - r, y: y - r, w: r * 2 + P.gauge.lampGap + P.gauge.lamp * 2, h: r * 2 }, l.half + 2)))) ?? right;\n gaugeAt.set(party, { on: \"party\", cx: at[0], cy: at[1] });\n }\n\n // ---- 部品\n\n const widthAll = width0;\n const height = height0;\n const parties: PipeParty[] = order\n .filter((id) => partyRects.has(id))\n .map((id) => {\n const r = rectOf(id);\n const shape = shapeOf(id);\n const box = diagram.boxes.find((b) => b.id === id);\n const label =\n shape === \"round\"\n ? textAt(nameOf(id), r.x + r.w / 2, cyOf(id) + P.avatar.nameY, T.party, \"middle\")\n : shape === \"token\"\n ? textAt(nameOf(id), r.x + r.w / 2, r.y + P.token.nameY, T.party, \"middle\")\n : textAt(nameOf(id), r.x + P.cabinet.name, cyOf(id) + T.party.size * 0.4, T.party);\n return {\n ...r,\n id,\n name: nameOf(id),\n role: roleOf(id),\n ...(box?.icon ? { icon: box.icon } : {}),\n shape,\n ...(shape === \"token\" ? {} : { row: bandOf(id) === 1 ? maxRow + 1 : rowOf(id) }),\n label,\n holder: holding.has(id),\n };\n });\n const involved = diagram.steps.map((step, s) => {\n const set = new Set(step.events.flatMap(partiesOf));\n for (const c of shown) if (c.close?.step === s) set.add(c.to);\n return set;\n });\n const columns: PipeColumn[] = [];\n const pills: PipePill[] = [];\n for (const s of stepList)\n for (const p of parties) {\n const hs = housingOf.get(p.id);\n const left = hs ? Math.min(hs.x, p.x) : p.x;\n const right = hs ? Math.max(hs.x + hs.w, p.x + p.w) : p.x + p.w;\n const bottom = hs ? hs.y + hs.h : p.y + p.h;\n columns.push({ party: p.id, step: s, x: left, y: p.y, w: right - left, h: bottom - p.y, folded: false });\n pills.push({ x: p.x, y: p.y, w: p.w, h: p.h, party: p.id, step: s, folded: false, active: snapOf(s).active === p.id, involved: (involved[s] as Set<string>).has(p.id) });\n }\n\n // 槽と水位。水位の物差しは、トークンごとに並べた槽の一番多い量で作る\n const scale = new Map(\n tokens.map((token) => {\n const amounts = holders.filter((h) => has(h, token)).flatMap((h) => historyOf(`b${keyOf(h, token)}`).map(amountNumber));\n return [token, Math.max(0, ...amounts)];\n }),\n );\n const room = P.tank.h - P.tank.pad * 2;\n const levelH = (token: string, amount: string | undefined): number => {\n const most = scale.get(token) ?? 0;\n const n = amountNumber(amount);\n if (!(n > 0) || most <= 0) return 0;\n return Math.min(room, Math.max(P.tank.least, (n / most) * room * P.tank.fill));\n };\n const liquid = (glass: Rect, token: string, amount: string | undefined): Rect => {\n const h = levelH(token, amount);\n return { x: glass.x + P.tank.pad, y: glass.y + glass.h - P.tank.pad - h, w: glass.w - P.tank.pad * 2, h };\n };\n const tanks: PipeTank[] = [];\n const glasses: PipeGlass[] = [];\n const levels: PipeLevel[] = [];\n for (const h of holders)\n for (const token of tanksOf.get(h) ?? []) {\n const glass = tankOf(h, token);\n const cx = glass.x + glass.w / 2;\n const tank: PipeTank = { ...glass, party: h, token, title: { ...textAt(token, cx, glass.y + P.tank.titleY, T.tankTitle, \"middle\"), x: cx - titleW(token) / 2, w: titleW(token) }, tone: toneOf(token) };\n tanks.push(tank);\n const key = `b${keyOf(h, token)}`;\n const numberBase = numberBaseOf(glass);\n for (const s of stepList) {\n glasses.push({ ...tank, step: s });\n const snap = snapOf(s);\n const amount = snap.balances.get(keyOf(h, token)) ?? \"0\";\n const state = snap.states.get(key) ?? \"none\";\n const old = snap.was.get(key);\n const changedAt = snap.changed.get(key);\n const prev = s > 0 ? snapOf(s - 1).balances.get(keyOf(h, token)) : undefined;\n const text = textAt(grouped(amount), cx, numberBase, amountStyle, \"middle\");\n let delta: PipeText | undefined;\n let tag: PipeText | undefined;\n if (!narrow && old !== undefined && state !== \"none\") {\n const diff = minus(amount, old);\n const sign = diff.startsWith(\"-\") ? \"−\" : \"+\";\n delta = textAt(joinWords(`${sign}${grouped(diff.replace(/^-/u, \"\"))}`, token), cx, numberBase + P.tank.deltaY, T.delta, \"middle\");\n tag = textAt(words.tags[state], cx, numberBase + P.tank.deltaY + P.tank.tagY, T.tag, \"middle\");\n }\n levels.push({\n ...liquid(glass, token, amount),\n party: h,\n token,\n step: s,\n amount,\n state,\n text,\n ...(delta ? { delta } : {}),\n ...(tag ? { tag } : {}),\n ...(old !== undefined && state !== \"none\" ? { base: liquid(glass, token, old) } : {}),\n ...(changedAt !== undefined ? { event: changedAt } : {}),\n ...(changedAt !== undefined && prev !== undefined && prev !== amount ? { from: liquid(glass, token, prev) } : {}),\n });\n }\n }\n\n // 値の管と、トークンの箱を載せる所と弁\n const valuePipes: PipeValuePipe[] = [];\n const pipeIndex = new Map<number, number>();\n for (const r of routes) {\n if (!r) continue;\n const d = defs[r.def] as Def;\n pipeIndex.set(r.def, valuePipes.length);\n valuePipes.push({ token: d.token, from: d.from, to: d.to, points: r.points, ports: r.ports, tone: toneOf(d.token), group: groupOfDef(r.def) });\n }\n const buses: PipeBus[] = tokens.map((token) => {\n const box = boxOf(token);\n const bay = box !== undefined ? bayOf.get(box) : undefined;\n if (bay) {\n const valve = token === ETH ? undefined : { party: bay.home.box, x: xOf.get(bay.home.box) ?? 0, y: bay.y };\n return { token, y: bay.y, x1: Math.min(bay.x1, bay.x2), x2: Math.max(bay.x1, bay.x2), ...(valve ? { valve } : {}) };\n }\n const pipe = valuePipes.find((p) => p.token === token);\n const seg = pipe ? segs(pipe.points).filter(([a, b]) => flat(a, b)).sort(([a, b], [c, d]) => Math.abs(d[0] - c[0]) - Math.abs(b[0] - a[0]))[0] : undefined;\n if (seg) return { token, y: seg[0][1], x1: Math.min(seg[0][0], seg[1][0]), x2: Math.max(seg[0][0], seg[1][0]) };\n const owner = holders.find((h) => has(h, token));\n const t = owner ? tankOf(owner, token) : { x: 0, y: 0, w: 0, h: 0 };\n return { token, y: t.y + (portSlots[0] as number), x1: t.x, x2: t.x + t.w };\n });\n const pipes: PipeBusAt[] = stepList.flatMap((s) => buses.map((b) => ({ ...b, step: s })));\n\n // 流れた分。段ごとに、暫定と取り消しの分と、その段で確定した分を描く。同じ管を同じ段に流れた分は管の中でずらす\n const shownAt = stepList.map((s) => {\n const snap = snapOf(s);\n return moving.filter((f) => {\n if (f.step > s) return false;\n const state = snap.states.get(`f${f.id}`);\n return state === \"provisional\" || state === \"rolled\" || (state === \"final\" && snap.changed.has(`f${f.id}`));\n });\n });\n const flows: PipeFlow[] = stepList.flatMap((s) => {\n const used = new Map<number, number>();\n return (shownAt[s] ?? []).flatMap((f): PipeFlow[] => {\n const k = defOf(f);\n const pipe = valuePipes[pipeIndex.get(k) ?? -1];\n if (!pipe) return [];\n const track = used.get(k) ?? 0;\n used.set(k, track + 1);\n const shift = track === 0 ? 0 : (track % 2 === 1 ? -1 : 1) * Math.ceil(track / 2) * P.flow.track;\n const forward = pipe.from === f.from;\n const base = forward ? pipe.points : [...pipe.points].reverse();\n const points = offsetPath(base, shift);\n const longest = segs(points).sort(([a, b], [c, d]) => Math.abs(d[0] - c[0]) + Math.abs(d[1] - c[1]) - (Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1])))[0] as [Point, Point];\n const [a, b] = longest;\n const vertical = !flat(a, b);\n const dir = (vertical ? Math.sign(b[1] - a[1]) : Math.sign(b[0] - a[0])) >= 0 ? 1 : -1;\n const snap = snapOf(s);\n const changedAt = snap.changed.get(`f${f.id}`);\n return [\n {\n id: f.id,\n step: s,\n token: f.token,\n from: f.from,\n to: f.to,\n amount: f.amount,\n state: snap.states.get(`f${f.id}`) ?? \"none\",\n points,\n arrow: { x: (a[0] + b[0]) / 2, y: (a[1] + b[1]) / 2, dir, vertical },\n tone: toneOf(f.token),\n fresh: f.step === s,\n ...(changedAt !== undefined ? { event: changedAt } : {}),\n },\n ];\n });\n });\n\n // 呼び出しの管\n const widthOf = (kind: PipeCallLane[\"kind\"]): number => (kind === \"static\" ? P.call.flow / 2 : P.call.flow);\n const calls: PipeCallLane[] = shown.map((c) => {\n const points = callPath.get(`${c.from}>${c.to}`) as Point[];\n return {\n index: c.index,\n step: c.step,\n event: c.event,\n from: c.from,\n to: c.to,\n depth: c.depth,\n y: cyOf(c.from),\n kind: c.kind,\n width: widthOf(c.kind),\n points,\n lit: points,\n ...(c.value !== undefined ? { value: c.value } : {}),\n ...(c.close ? { close: c.close } : {}),\n };\n });\n const mains: PipeMain[] = [...new Set(branches.map((c) => c.from))].map((from) => ({\n from,\n y: cyOf(from),\n points: [],\n branches: branches\n .filter((c) => c.from === from)\n .map((c) => {\n const v = valves.get(`${c.from}>${c.to}`) as Point;\n return { to: c.to, points: callPath.get(`${c.from}>${c.to}`) as Point[], valve: { x: v[0], y: v[1], vertical: uprightValves.has(`${c.from}>${c.to}`), under: underValves.has(`${c.from}>${c.to}`) } };\n }),\n }));\n const lanes: PipeLane[] = stepList.flatMap((s) =>\n shown\n .filter((c) => c.step <= s && (c.close === undefined || c.close.step >= s))\n .map((c) => ({\n call: c.index,\n step: s,\n from: c.from,\n to: c.to,\n kind: c.kind,\n width: widthOf(c.kind),\n points: callPath.get(`${c.from}>${c.to}`) as Point[],\n ...(c.step === s ? { opened: c.event } : {}),\n ...(c.close?.step === s ? { shut: c.close.event } : {}),\n })),\n );\n // 呼び出しの管が値の管の下をくぐる所\n const crossings: PipeCrossing[] = [];\n for (const c of calls)\n for (const [pi, pipe] of [...valuePipes.entries(), ...stubs.map((s, i): [number, { token: string; points: Point[] }] => [-1 - i, s])]) {\n if (pi < 0) continue;\n for (const [a, b] of segs(c.points))\n for (const [u, v] of segs(pipe.points)) {\n const callFlat = flat(a, b);\n if (callFlat === flat(u, v)) continue;\n const [h1, h2, v1, v2] = callFlat ? [a, b, u, v] : [u, v, a, b];\n const x = v1[0];\n const y = h1[1];\n const inH = x > Math.min(h1[0], h2[0]) + 1e-6 && x < Math.max(h1[0], h2[0]) - 1e-6;\n const inV = y > Math.min(v1[1], v2[1]) + 1e-6 && y < Math.max(v1[1], v2[1]) - 1e-6;\n if (inH && inV) crossings.push({ call: c.index, token: pipe.token, pipe: pi, x, y, vertical: !callFlat });\n }\n }\n\n // 計器。確かめる者ごとに 1 つ、最初に確かめた段から最後の段まで置き、針と通ったかの印を残す\n const gauges: PipeGauge[] = [];\n for (const party of checkers) {\n const own = sim.checks.filter((c) => c.party === party);\n const firstStep = Math.min(...own.map((c) => c.step));\n const place = gaugeAt.get(party);\n if (!place) continue;\n const r = P.gauge.r;\n let angle: number = P.gauge.unseen;\n for (let s = firstStep; s < steps; s++) {\n const doneHere = own.filter((c) => c.step <= s);\n const latest = doneHere[doneHere.length - 1] as CheckRec;\n const here = own.filter((c) => c.step === s);\n const from = angle;\n angle = latest.ok ? P.gauge.ok : P.gauge.fail;\n const { cx, cy } = place;\n gauges.push({\n x: cx - r,\n y: cy - r,\n w: r * 2,\n h: r * 2,\n party,\n step: s,\n event: (here[0] ?? latest).event,\n ok: latest.ok,\n on: place.on,\n cx,\n cy,\n r,\n fresh: here.length > 0 && !foldSteps.has(s),\n from,\n angle,\n lamp: { x: cx + r + P.gauge.lampGap, y: cy - r + 4, r: P.gauge.lamp },\n ...(place.stem ? { stem: place.stem } : {}),\n });\n }\n }\n\n // 変換器\n const converters: PipeConverter[] = [];\n for (const h of holders) {\n const rc = converterRect(h);\n const own = sim.calcs.filter((c) => c.party === h);\n const [first] = own;\n const [ta] = (innerOf.get(h) as Inner).tanks;\n if (!rc || !first || !ta) continue;\n const left = tankOf(h, ta.token).x + tankOf(h, ta.token).w;\n const right = left + (rc.x - left) * 2 + rc.w;\n for (const s of stepList) {\n const here = own.filter((c) => c.step === s && !foldSteps.has(s));\n const shownCalc = here[0] ?? [...own].reverse().find((c) => c.step <= s) ?? first;\n converters.push({\n ...rc,\n party: h,\n step: s,\n calc: shownCalc.step,\n ...(here[0] ? { event: here[0].event } : {}),\n in: shownCalc.input,\n out: shownCalc.output,\n rate: shownCalc.rate,\n active: here.length > 0,\n cx: rc.x + rc.w / 2,\n cy: rc.y + rc.h / 2,\n r: rc.w / 2,\n left,\n right,\n });\n }\n }\n\n // 値の札。トークンの箱の値は箱の中の名前の下に、ほかは持ち主の囲いの中に置く\n const plates: PipePlate[] = [];\n for (const party of order) {\n const boxed = isBox(party);\n (platesOf.get(party) ?? []).forEach((name, i) => {\n const key = `v${keyOf(party, name)}`;\n const spot0 = boxed ? undefined : plateRect(party, name);\n if (!boxed && !spot0) return;\n if (boxed && !partyRects.has(party)) return;\n const box = rectOf(party);\n for (const s of stepList) {\n const snap = snapOf(s);\n const value = snap.values.get(keyOf(party, name)) ?? \"\";\n const state = snap.states.get(key) ?? \"none\";\n const old = state === \"none\" ? undefined : snap.was.get(key);\n const changedAt = snap.changed.get(key);\n const at = changedAt !== undefined ? { event: changedAt } : {};\n if (boxed) {\n const cx = box.x + box.w / 2;\n const keyBase = box.y + P.token.keyY + P.token.line * i;\n const base = keyBase + P.token.valueY;\n const valueW = textWidth(value, T.keyValue);\n const total = old === undefined ? valueW : textWidth(old, T.keyValue) + P.token.arrowGap * 2 + arrowW + valueW;\n const start = cx - total / 2;\n const was = old === undefined ? undefined : textAt(old, start, base, T.keyValue);\n const arrow = was ? textAt(\"→\", was.x + was.w + P.token.arrowGap, base, T.keyValue) : undefined;\n const text = textAt(value, arrow ? arrow.x + arrow.w + P.token.arrowGap : start, base, T.keyValue);\n plates.push({\n x: box.x + P.token.plateX,\n y: keyBase - T.key.size,\n w: box.w - P.token.plateX * 2,\n h: P.token.valueY + T.key.size + T.keyValue.size * 0.3,\n party,\n name,\n step: s,\n value,\n state,\n boxed,\n label: textAt(name, cx, keyBase, T.key, \"middle\"),\n text,\n ...(was && arrow ? { was, arrow, strike: { x: was.x - 1, y: was.y + was.h * 0.55, w: was.w + 2, h: 1.5 } } : {}),\n ...at,\n });\n continue;\n }\n const p = spot0 as Rect;\n const cx = p.x + p.w / 2;\n let was: PipeText | undefined;\n let strike: Rect | undefined;\n let tag: PipeText | undefined;\n if (old !== undefined && state !== \"none\") {\n // 前の値と語は槽の数字と同じ行に置く。札のすぐ下は、槽の右の口から出る管が札の下を通る所\n const base = tankTop(party) + P.tank.h + P.tank.numberY;\n const ww = textWidth(old, T.sub);\n const total = ww + PART_GAP + textWidth(words.tags[state], T.tag);\n was = textAt(old, cx - total / 2, base, T.sub);\n strike = { x: was.x - 1, y: was.y + was.h * 0.55, w: was.w + 2, h: 1.5 };\n tag = textAt(words.tags[state], was.x + was.w + PART_GAP, base, T.tag);\n }\n plates.push({\n ...p,\n party,\n name,\n step: s,\n value,\n state,\n boxed,\n // 名前は字の間を含む幅の真ん中を札の真ん中に置く (#3526)\n label: { ...textAt(name, cx, p.y + P.plate.nameY, T.tankTitle), x: cx - titleW(name) / 2, w: titleW(name) },\n text: textAt(value, cx, p.y + p.h / 2 + P.plate.valueY, T.plateValue, \"middle\"),\n ...(was && strike && tag ? { was, strike, tag } : {}),\n ...at,\n });\n }\n });\n }\n\n // ---- 図の中の札\n\n /** 札を置かない所。部品と、置いた線と、同じ段に置いた札 */\n const fixed: Rect[] = [\n ...parties.map((p) => labelOf(p.id)),\n ...tanks,\n ...holders.flatMap((h) => (tanksOf.get(h) ?? []).flatMap((t) => textRows(h, t))),\n ...holders.flatMap((h) => (platesOf.get(h) ?? []).flatMap((n) => (plateRect(h, n) ? [grow(plateRect(h, n) as Rect, 0)] : []))),\n ...holders.flatMap((h) => (converterRect(h) ? [converterRect(h) as Rect] : [])),\n // 値の札の前の値と語は、札の下の槽の数字と同じ行に在る\n ...plates.flatMap((pl) => [pl.was, pl.tag].filter((t): t is PipeText => t !== undefined)),\n ...[...gaugeAt.values()].flatMap((g) => [\n { x: g.cx - P.gauge.r, y: g.cy - P.gauge.r, w: P.gauge.r * 2, h: P.gauge.r * 2 },\n { x: g.cx + P.gauge.r + P.gauge.lampGap - P.gauge.lamp, y: g.cy - P.gauge.r + 4 - P.gauge.lamp, w: P.gauge.lamp * 2, h: P.gauge.lamp * 2 },\n ]),\n ...[...valves.values()].map(([x, y]) => ({ x: x - P.valve.r, y: y - P.valve.stem - P.valve.lever, w: P.valve.r * 2 + P.valve.lever, h: P.valve.stem + P.valve.lever + P.valve.half })),\n ];\n const lines: { points: Point[]; half: number }[] = [\n ...valuePipes.map((p) => ({ points: p.points, half: vHalf })),\n ...stubs.map((p) => ({ points: p.points, half: vHalf })),\n ...[...callPath.values()].map((p) => ({ points: p, half: cHalf })),\n ...ties.map((t) => ({ points: [[t.x, t.y1], [t.x, t.y2]] as Point[], half: 1 })),\n ...writes.map((w) => ({ points: w.points, half: 1.5 })),\n ...bays.map((b) => {\n const box = rectOf(b.home.box);\n return { points: [[box.x + box.w / 2, box.y + box.h], [box.x + box.w / 2, b.y]] as Point[], half: 2 };\n }),\n ];\n const inFigure = (r: Rect): boolean => r.x >= P.margin && r.y >= P.margin && r.x + r.w <= widthAll - P.margin && r.y + r.h <= height - P.margin;\n const clearOf = (r: Rect, placed: readonly Rect[]): boolean =>\n inFigure(r) &&\n fixed.every((o) => apart(r, o, PART_GAP)) &&\n placed.every((o) => apart(r, o, PART_GAP)) &&\n lines.every((l) => segs(l.points).every(([a, b]) => !hits(a, b, r, l.half + 4))) &&\n housings.every((hs) => apart(r, hs, PART_GAP) || (r.x >= hs.x && r.x + r.w <= hs.x + hs.w && r.y >= hs.y && r.y + r.h <= hs.y + hs.h));\n const firstClear = (tries: readonly Rect[], placed: readonly Rect[]): Rect => tries.find((r) => clearOf(r, placed)) ?? (tries[0] as Rect);\n /** `near` の周りに w × h の札を置く候補。近い順。先に挙げた候補で空きが無い時に使う */\n const around = (near: Rect, w: number, h: number): Rect[] => {\n const cx = near.x + near.w / 2;\n const cy = near.y + near.h / 2;\n const out: Rect[] = [];\n const stepX = 12;\n const stepY = h + 4;\n for (let i = -8; i <= 8; i++)\n for (let j = -6; j <= 6; j++) {\n const x = cx - w / 2 + i * (near.w / 2 + w / 2 + stepX) / 2 + Math.sign(i) * stepX * Math.max(0, Math.abs(i) - 2);\n const y = cy - h / 2 + j * stepY;\n out.push({ x, y, w, h });\n }\n return out.sort((a, b) => Math.hypot(a.x + w / 2 - cx, (a.y + h / 2 - cy) * 1.5) - Math.hypot(b.x + w / 2 - cx, (b.y + h / 2 - cy) * 1.5));\n };\n const chipOf = (kind: PipeChip[\"kind\"], text: string, r: Rect, step: number, extra: Partial<PipeChip> = {}, big = false): PipeChip => {\n const style = kind === \"io\" ? T.io : big ? bigStyle : chipStyle;\n return {\n ...r,\n kind,\n text,\n size: style.size,\n rx: P.chip.rx,\n label: textAt(text, r.x + r.w / 2, middleBase(r.y, r.h, style), style, \"middle\"),\n step,\n ...extra,\n };\n };\n const chips: PipeChip[] = [];\n const placedAt = stepList.map((): Rect[] => []);\n /** 狭い枠の、図の下の帯に出す札。置き場所は図の大きさを決めた後に決める */\n const banded: { kind: \"amount\" | \"formula\"; text: string; step: number; extra: Partial<PipeChip> }[] = [];\n\n // 入力と出力の印。始めた人が払った槽と受け取った槽の、囲いの上の余白に置く\n if (sender !== undefined)\n for (const { token, text, r } of ioMarks()) {\n for (const s of stepList) {\n chips.push(chipOf(\"io\", text, r, s, { party: sender, token }));\n placedAt[s]?.push(r);\n }\n }\n\n // 計器の式。値の管の計器は確かめた段から後も残し、呼び出しの管の計器は確かめた段だけ出す。狭い枠は確かめた段だけ\n for (const party of checkers) {\n const g = gaugeAt.get(party);\n if (!g) continue;\n const own = sim.checks.filter((c) => c.party === party);\n for (const s of stepList) {\n const here = own.filter((c) => c.step === s);\n const latest = [...own].reverse().find((c) => c.step <= s);\n const c = here[here.length - 1] ?? (g.on === \"value\" && !narrow ? latest : undefined);\n if (!c) continue;\n const text = formulaOf(c);\n if (narrow) {\n banded.push({ kind: \"formula\", text, step: s, extra: { party, ok: c.ok } });\n continue;\n }\n const w = chipW(text);\n const r = P.gauge.r;\n const tries: Rect[] = [\n ...(g.col ? [{ x: g.col.x + (g.col.w - w) / 2, y: g.cy - r - P.chip.off - chipH, w, h: chipH }] : []),\n { x: g.cx - w / 2, y: g.cy - r - P.chip.off - chipH, w, h: chipH },\n { x: g.cx - w / 2, y: g.cy + r + P.chip.off, w, h: chipH },\n { x: g.cx + r + P.gauge.lampGap + P.gauge.lamp * 2 + P.chip.off, y: g.cy - r - chipH, w, h: chipH },\n { x: g.cx - r - P.chip.off - w, y: g.cy - r - chipH, w, h: chipH },\n ...around({ x: g.cx - r, y: g.cy - r, w: r * 2, h: r * 2 }, w, chipH),\n ];\n const at = firstClear(tries, placedAt[s] ?? []);\n chips.push(chipOf(\"formula\", text, at, s, { party, ok: c.ok }));\n placedAt[s]?.push(at);\n }\n }\n\n // 流れた量。値の管の近くに、単位つきで置く。狭い枠はその段で流れた分だけ。\n // 広い枠は済んだ段の分も残すが、その段で流れた分を先に置き、管の際の空きを先に取らせる\n for (const s of stepList)\n for (const f of flows.filter((x) => x.step === s && (!narrow || x.fresh)).sort((a, b) => Number(b.fresh) - Number(a.fresh))) {\n const pipe = valuePipes[pipeIndex.get(defOf(moving.find((m) => m.id === f.id) as FlowRec)) ?? -1];\n if (!pipe) continue;\n const text = joinWords(grouped(f.amount), f.token);\n if (narrow) {\n banded.push({ kind: \"amount\", text, step: s, extra: { token: f.token, state: f.state, tone: f.tone, ...(f.event !== undefined ? { event: f.event } : {}) } });\n continue;\n }\n const w = chipW(text);\n const off = vHalf + P.chip.off;\n const tries: Rect[] = [];\n const ordered = segs(pipe.points).sort(([a, b], [c, d]) => Number(!flat(a, b)) - Number(!flat(c, d)) || Math.abs(d[0] - c[0]) + Math.abs(d[1] - c[1]) - (Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1])));\n /** 線分 a-b の割合 k の所から、管の真ん中から d 離した両脇の札の四角。横の管は下と上、縦の管は右と左の順 */\n const beside = (a: Point, b: Point, k: number, d: number): Rect[] => {\n const x = a[0] + (b[0] - a[0]) * k;\n const y = a[1] + (b[1] - a[1]) * k;\n return flat(a, b)\n ? [{ x: x - w / 2, y: y + d, w, h: chipH }, { x: x - w / 2, y: y - d - chipH, w, h: chipH }]\n : [{ x: x + d, y: y - chipH / 2, w, h: chipH }, { x: x - d - w, y: y - chipH / 2, w, h: chipH }];\n };\n for (const [a, b] of ordered) for (const k of AMOUNT_AT) tries.push(...beside(a, b, k, off));\n // 決めた割合の所が全て塞がる時は、管の際のまま線分に沿って細かくずらし、真ん中に近い所から試す (#3528)。\n // 束の外側まで離すと、札と管の間にほかの管や部品が入り、どの流れの量か読み手が取り違える\n for (const [a, b] of ordered) {\n const length = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n const shifts = Array.from({ length: Math.floor(length / P.chip.slide) + 1 }, (_, i) => i * P.chip.slide).sort((p, q) => Math.abs(p - length / 2) - Math.abs(q - length / 2));\n for (const t of shifts) tries.push(...beside(a, b, t / length, off));\n }\n // 管の際が束ねた管で塞がる時は、束の外側まで離した所を試す\n for (const [a, b] of ordered) for (const far of [1, 2, 3, 4, 5]) for (const k of AMOUNT_AT) tries.push(...beside(a, b, k, off + far * (chipH + PART_GAP)));\n // それでも空きが無い時は、一番長い線分の真ん中の近くの空きに置く\n const [la, lb] = ordered[0] ?? [];\n if (la && lb) tries.push(...around({ x: (la[0] + lb[0]) / 2, y: (la[1] + lb[1]) / 2, w: 0, h: 0 }, w, chipH));\n const at = firstClear(tries, placedAt[s] ?? []);\n chips.push(chipOf(\"amount\", text, at, s, { token: f.token, flow: f.id, state: f.state, tone: f.tone, ...(f.event !== undefined ? { event: f.event } : {}) }));\n placedAt[s]?.push(at);\n }\n\n // イベントの札。出した者の箱の横に置く。同じ者が同じ名前のイベントを 2 つ以上出した段は 1 つにまとめる\n const events: PipeEventChip[] = [];\n if (!narrow)\n for (const s of stepList) {\n const snap = snapOf(s);\n const groups = new Map<string, EmitRec[]>();\n for (const id of snap.emitted) {\n const e = sim.emits[id] as EmitRec;\n if (!partyRects.has(e.party)) continue;\n const k = `${e.party}|${e.name}`;\n groups.set(k, [...(groups.get(k) ?? []), e]);\n }\n const besideCount = new Map<string, number>();\n for (const list of groups.values()) {\n const e = list[list.length - 1] as EmitRec;\n const merged = list.length > 1;\n const text = merged ? `${chipTextOf(e)} ×${list.length}` : chipTextOf(e);\n const args = !merged && e.step === s ? argsOf(e) : undefined;\n const w = chipW(text) + (args ? P.chip.argsGap + textWidth(args, T.args) : 0);\n const emitter = rectOf(e.party);\n const n = besideCount.get(e.party) ?? 0;\n besideCount.set(e.party, n + 1);\n const cx = emitter.x + emitter.w / 2;\n const below = isBox(e.party) ? emitter.y + emitter.h + PART_GAP + n * (chipH + 4) : emitter.y + emitter.h + PART_GAP;\n const mid = emitter.y + emitter.h / 2 - chipH / 2 + n * (chipH + 4);\n const tries: Rect[] = [\n ...(isBox(e.party) ? [{ x: cx + 6, y: below, w, h: chipH }, { x: cx - 6 - w, y: below, w, h: chipH }] : []),\n { x: emitter.x + emitter.w + P.chip.beside, y: mid, w, h: chipH },\n { x: emitter.x - P.chip.beside - w, y: mid, w, h: chipH },\n { x: cx + 6, y: emitter.y + emitter.h + PART_GAP + n * (chipH + 4), w, h: chipH },\n { x: cx - 6 - w, y: emitter.y + emitter.h + PART_GAP + n * (chipH + 4), w, h: chipH },\n ...around(emitter, w, chipH),\n ];\n const at = firstClear(tries, placedAt[s] ?? []);\n placedAt[s]?.push(at);\n const textR = textAt(text, at.x + P.chip.padX, middleBase(at.y, at.h, chipStyle), chipStyle);\n const changedAt = list.map((x) => snap.changed.get(`e${x.id}`)).find((x) => x !== undefined);\n const state = list.map((x) => snap.states.get(`e${x.id}`) ?? \"none\").reduce((a, b) => (a === \"provisional\" || b === \"provisional\" ? \"provisional\" : b));\n events.push({\n id: e.id,\n ...at,\n party: e.party,\n name: e.name,\n step: s,\n emitted: e.step,\n state,\n text: textR,\n ...(args ? { args: textAt(args, textR.x + textR.w + P.chip.argsGap, middleBase(at.y, at.h, T.args), T.args) } : {}),\n ...(changedAt !== undefined ? { event: changedAt } : {}),\n });\n chips.push(chipOf(\"event\", text, at, s, { party: e.party, state, ...(changedAt !== undefined ? { event: changedAt } : {}) }));\n }\n }\n const rings: PipeRing[] = sim.emits.filter((e) => !foldSteps.has(e.step) && visible.has(e.party)).map((e) => ({ party: e.party, step: e.step, event: e.event }));\n\n // 戻り値の札。呼ばれた側から呼び出しの管を伝って呼んだ側へ戻る\n /** 戻り値の札が着く所で避ける弁の形。呼び出しの管の弁とトークンの箱の弁の、胴と軸と閉じた取っ手と開いた取っ手 */\n const valveBlocks: Rect[] = [\n ...[...valves].flatMap(([k, [x, y]]) => valveRects(x, y, uprightValves.has(k), underValves.has(k))),\n ...buses.flatMap((b) => (b.valve ? valveRects(b.valve.x, b.valve.y, false, false) : [])),\n ];\n /** 段 `s` に戻り値の札が着く所で避ける部品。箱と名前の字、弁、その段の計器 (盤と通ったかの印と軸)、その段に置いた札 */\n const blocks = (s: number): Rect[] => [\n ...parties.map((p) => labelOf(p.id)),\n ...valveBlocks,\n ...gauges\n .filter((g) => g.step === s)\n .flatMap((g) => [\n { x: g.x, y: g.y, w: g.w, h: g.h },\n { x: g.lamp.x - g.lamp.r, y: g.lamp.y - g.lamp.r, w: g.lamp.r * 2, h: g.lamp.r * 2 },\n ...(g.stem ? [{ x: g.cx - 2, y: g.stem.y1, w: 4, h: g.stem.y2 - g.stem.y1 }] : []),\n ]),\n ...(placedAt[s] ?? []),\n ];\n if (!narrow)\n for (const ret of sim.returns) {\n const c = sim.calls[ret.call];\n if (!c || foldSteps.has(ret.step) || !ret.value) continue;\n const points = callPath.get(`${c.from}>${c.to}`);\n if (!points) continue;\n const back = [...points].reverse();\n const w = chipW(ret.value);\n // 呼ばれた側の名前の字に札がかからない所まで管に沿って進み、そこから動き出す。横から入る管では、縁の真ん中が名前の字の隣に在る\n const name = parties.find((p) => p.id === c.to)?.label;\n const rectAt = ([x, y]: Point): Rect => ({ x: x - w / 2, y: y - chipH / 2, w, h: chipH });\n let d = 0;\n while (name && d < lengthOf(back) / 2 && !apart(rectAt(along(back, d)), name, PART_GAP / 2)) d += 2;\n const started = d > 0 ? fromAlong(back, d) : back;\n // 着く所は、呼んだ側から管を遡り、箱と弁と計器とその段に置いた札のどれからも離れた最初の所にする (#3523)。\n // 呼んだ側の名札の手前には呼び出しの弁と計器が並ぶため、名札の手前で止めた札はそれらを隠していた\n const whole = lengthOf(started);\n const avoid = blocks(ret.step);\n /** 呼んだ側から遡り、どの部品からも `gap` 離れた最初の所までの長さ。無い時は `whole` */\n const backTo = (gap: number): number => {\n let at = 0;\n while (at < whole && !avoid.every((o) => apart(rectAt(along(started, whole - at)), o, gap))) at += 2;\n return at;\n };\n // 離れた所が無い短い管では、部品の縁に触れても重ならない所にする\n let e = backTo(PART_GAP / 2);\n if (e >= whole) e = backTo(0);\n // どこにも空きが無い時は、今までどおり呼んだ側の名札に札が載らない手前で止める。崩れの確かめが札と部品の重なりを知らせる\n if (e >= whole) {\n // 次の組みで、この管の2人の間を札の幅だけ広げる\n cramped.set(\n `${c.from}>${c.to}`,\n Math.max(cramped.get(`${c.from}>${c.to}`) ?? 0, w + PART_GAP),\n );\n const caller = labelOf(c.from);\n e = 0;\n while (e < whole / 2 && !apart(rectAt(along(started, whole - e)), caller, 2)) e += 2;\n }\n const path = e > 0 ? fromAlong([...started].reverse(), e).reverse() : started;\n chips.push(chipOf(\"return\", ret.value, rectAt(path[0] as Point), ret.step, { party: c.to, path, call: c.index, event: ret.event }));\n }\n\n // 畳んだ箱。呼ばれた者の下の空いた所に置く\n const foldBoxes: PipeFoldBox[] = folds.flatMap((fold) => {\n const call = sim.calls[fold.call];\n const party = call?.to ?? \"\";\n if (!partyRects.has(party)) return [];\n const count = fold.to - fold.from + 1;\n const text = words.fold(count, fold.hidden.length);\n const w = P.card.padX * 2 + P.card.icon + P.card.gap + Math.max(textWidth(words.open, T.cardTitle), textWidth(text, T.fold));\n const owner = rectOf(party);\n const cx = owner.x + owner.w / 2;\n const tries: Rect[] = [\n { x: owner.x + owner.w + P.card.top, y: owner.y + owner.h / 2 - P.card.h / 2, w, h: P.card.h },\n { x: cx - w / 2, y: owner.y + owner.h + P.card.top, w, h: P.card.h },\n { x: owner.x - P.card.top - w, y: owner.y + owner.h / 2 - P.card.h / 2, w, h: P.card.h },\n { x: cx - w / 2, y: owner.y - P.card.top - P.card.h, w, h: P.card.h },\n ];\n const at = firstClear(tries, placedAt[fold.step] ?? []);\n placedAt[fold.step]?.push(at);\n const left = at.x + P.card.padX + P.card.icon + P.card.gap;\n const title = textAt(words.open, left, at.y + P.card.titleY, T.cardTitle);\n const value = textAt(text, left, at.y + P.card.valueY, T.fold);\n return [{ ...at, party, step: fold.step, call: fold.call, steps: count, parties: fold.hidden.length, title, value, text: value }];\n });\n\n // 段ごとに関わる関係者を囲む所\n const focus = stepList.flatMap((s) => {\n const ids = [...new Set((diagram.steps[s] as Step).events.flatMap(partiesOf))].filter((id) => partyRects.has(id));\n if (ids.length === 0) return [];\n const rects = ids.map(rectOf);\n const left = Math.min(...rects.map((r) => r.x));\n const top = Math.min(...rects.map((r) => r.y));\n return [{ step: s, x: left, y: top, w: Math.max(...rects.map((r) => r.x + r.w)) - left, h: Math.max(...rects.map((r) => r.y + r.h)) - top }];\n });\n\n // 図の大きさは、置いた札と引いた管まで含める\n const all = [...chips.filter((c) => c.kind !== \"return\"), ...foldBoxes, ...gauges];\n const drawn: { points: Point[]; half: number }[] = [\n ...valuePipes.map((p) => ({ points: p.points, half: vHalf })),\n ...stubs.map((p) => ({ points: p.points, half: vHalf })),\n ...[...callPath.values()].map((points) => ({ points, half: cHalf })),\n ...writes.map((w) => ({ points: w.points, half: 1.5 })),\n ];\n const lineRight = Math.max(0, ...drawn.flatMap((l) => l.points.map((p) => p[0] + l.half + P.edge)));\n const lineBottom = Math.max(0, ...drawn.flatMap((l) => l.points.map((p) => p[1] + l.half + P.edge)));\n const widthFinal = Math.max(widthAll, lineRight, ...all.map((r) => r.x + r.w + P.margin));\n let heightFinal = Math.max(height, lineBottom, ...all.map((r) => r.y + r.h + P.margin));\n // 狭い枠は、今の段で動いた値を図の下の帯に大きな字で出す\n if (narrow && banded.length > 0) {\n const top = heightFinal - P.margin + P.narrow.gap;\n for (const s of stepList) {\n const here = banded.filter((b) => b.step === s);\n const ws = here.map((b) => chipW(b.text, bigStyle));\n let x = widthFinal / 2 - (ws.reduce((a, b) => a + b, 0) + P.chip.gap * Math.max(0, here.length - 1)) / 2;\n here.forEach((b, i) => {\n const w = ws[i] as number;\n chips.push(chipOf(b.kind, b.text, { x, y: top, w, h: bigH }, s, b.extra, true));\n x += w + P.chip.gap;\n });\n }\n heightFinal = top + bigH + P.margin;\n }\n\n return {\n kind: \"pipe\",\n arrangement: narrow ? \"fit\" : \"wide\",\n width: widthFinal,\n height: heightFinal,\n regions: [],\n boxes: [],\n lifelines: [],\n edges: [],\n labels: [],\n actions: [],\n badges: [],\n paths: [],\n ends: [],\n parties,\n columns,\n pills,\n tanks,\n glasses,\n levels,\n buses,\n pipes,\n flows,\n calls,\n mains,\n lanes,\n plates,\n writes,\n gauges,\n checks: [],\n events,\n converters,\n housings,\n ties,\n folds: foldBoxes,\n rings,\n valuePipes,\n stubs,\n crossings,\n chips,\n narrow,\n focus,\n };\n\n function spanOf(k: number): number {\n const d = defs[k] as Def;\n return Math.abs((cols.get(d.from)?.x ?? 0) - (cols.get(d.to)?.x ?? 0)) + (bandOf(d.from) === bandOf(d.to) ? 0 : 1e4);\n }\n }\n\n /** 隣どうしの囲いを結ぶ管か。同じ段で並びが隣の 2 人の間の管 */\n function isAdjacent(d: Def): boolean {\n for (const band of [band0, band1]) {\n const i = band.indexOf(d.from);\n const j = band.indexOf(d.to);\n if (i >= 0 && j >= 0 && Math.abs(i - j) === 1) return true;\n }\n return false;\n }\n}\n\n","/**\n * 配管の図 (`pipe`、#3418) の再生の部品の、図の下に置く段の動きと呼び出しの結果 (#3450)。\n *\n * 再生の部品 (`player.ts`) が見せている図の段 (畳んだ箱を開いた後は開いた図の段) を頭から当て、段ごとに矢印を作る。\n * 矢印は送る側、量か名前、受ける側と、何をしたかの札を持つ。値が動く段は動いた値を実線の矢印で出し、確かめた式と取り消しも出す。\n * 値が動かず確かめも取り消しも無い段は、呼び出しと返した値を点線の矢印で出し、計算と記録も出す。\n * 同じ段で戻った呼び出しは、返した側から返した値の矢印 1 本にまとめる。値が動く段で呼び出しを出すと、\n * 1 つの動きが「呼ぶ」「送る」「返す」の 3 本に割れて読めなくなるため。\n * 確かめは満たすかの札を式の前に置いた 1 行の枠にする。同じ理由で続けて取り消した呼び出しは、取り消した側から戻る先までの\n * 道 1 本の枠にまとめ、理由を 1 回だけ小さく出す。取り消しを矢印ごとに分けて理由を大きく出すと、携帯の幅で枠が詰まるため。\n *\n * 要点 (`gist`) を書いた段は、矢印の後ろに要点の札を置く (#3464)。札は名札と要点の文を 1 つの枠に並べ、枠の幅に関わらず同じ形で出す。\n * 配管の図は段の本文を見せないので、本文にしか無い要点が画面から消えないよう、書き手が段ごとに選んで出す。\n * 呼び出しの結果は畳んで置き、開くと先頭にいちばん外の呼び出し (取引) を、その下に今の段までに戻った内側の呼び出しを、\n * 呼ばれた側、中身、返した値の 3 列で出す。返した値が無いか `true` だけの呼び出しは、その段の矢印に値の動きとして出ているため出さない。\n * 今の段で戻った行に `data-state=\"now\"` を付ける。\n * 出来事は描く部品の並べ方と同じ手順 (`PipeRun`) に当て、当てられない出来事は図と同じく矢印にも結果にも出さない。\n * 字は渡した言葉 (`FIGURE_TEXT`) で出す。この file は配管の図の描く部品と同じ塊 (`kinds/pipe.ts`) に入り、\n * 再生の部品は配管の図を描けた後に登録簿から引いて置く。見た目は置く時に頁へ 1 度だけ入れる。\n */\nimport { FIGURE_TEXT, joinWords } from \"./figure-text\";\nimport { OP_TEXT } from \"./kinds/pipe/layout\";\nimport { LOOK, TYPE } from \"./look/values\";\nimport { checkPasses, isFault, PipeRun } from \"./pipe-run\";\nimport type { Styles } from \"./adopt-css\";\nimport { cssFont as font } from \"./render/parts\";\nimport type { DiagramModel } from \"./schema\";\nimport type { NotationLang } from \"./words\";\n\nconst px = (v: number): string => `${v}px`;\n\n/**\n * 段の動きの見た目。矢印どうしの間と矢印の上下の余白、名前と矢印の間、矢印の線の太さと先の長さ、量と線と札の間、\n * 矢印の欄と結果の間、矢印の欄と結果の最も広い幅、確かめと取り消しの枠の左右と上下の余白と角の丸みと枠どうしの間、\n * 取り消しの道の矢印の長さと名前との間、結果の 1 つの欄の上下と左右の余白、今の段の行の左の印の太さ、\n * 要点の札の上の間と上下の余白 (#3464)。\n * 広い枠でも矢印と結果を枠の全幅に伸ばさない。送る側と受ける側が離れると、どの名前がどの量に付くかを目で追えなくなるため\n */\nconst FLOWS = {\n row: 8,\n gap: 10,\n line: 2,\n head: 7,\n inner: 3,\n record: 12,\n max: 520,\n boxX: 10,\n boxY: 8,\n round: 6,\n boxGap: 4,\n link: 16,\n linkGap: 6,\n cellY: 6,\n cellX: 10,\n mark: 3,\n gist: 8,\n gistY: 7,\n} as const;\n\n/** 枠と行に敷く色の濃さ (%)。確かめを満たした枠、満たさない枠と取り消しの枠、取引の枠、今の段の行、要点の札 */\nconst TINT = { pass: 9, fail: 9, deal: 10, now: 8, gist: 8 } as const;\n\n/** 矢印の種類。値が動く、確かめる、取り消す、呼ぶ、返す、計算する、記録を出す */\nexport type FlowKind = \"move\" | \"check\" | \"revert\" | \"call\" | \"return\" | \"calc\" | \"emit\";\n\n/**\n * 段の下に出す矢印の 1 本。`line` は実線 (値が動く) か点線 (呼び出しと返した値と取り消し) か線無し (確かめと計算と記録)。\n * 取り消しは `from` が取り消した側、`to` が戻る先、`via` が道の途中で取り消しを伝えた関係者、`amount` が理由 (無い時は空)\n */\nexport interface StepFlow {\n kind: FlowKind;\n line: \"solid\" | \"dashed\" | \"none\";\n from: string;\n amount: string;\n to: string;\n tag: string;\n via?: string[];\n}\n\n/** 記録の 1 行。`step` は呼び出しを開いた段、`depth` は開いた時に開いていた呼び出しの数、`close` は閉じた段と返した値か取り消したか */\nexport interface CallRow {\n step: number;\n depth: number;\n from: string;\n to: string;\n label?: string;\n close?: { step: number; value?: string; reverted: boolean };\n}\n\n/** 記録の行と、段ごとの矢印 */\nexport interface CallList {\n rows: CallRow[];\n flows: StepFlow[][];\n}\n\n/** 図 `model` の段を頭から当て、記録の行を出てきた順に作り、段ごとの矢印を作る */\nexport function callList(model: DiagramModel, lang: NotationLang): CallList {\n const w = FIGURE_TEXT[lang];\n const names = new Map(model.boxes.map((b) => [b.id, b.name]));\n const name = (id: string): string => names.get(id) ?? id;\n const run = new PipeRun(model.boxes, model.pipe?.holds ?? []);\n const rows: CallRow[] = [];\n /** 開いている呼び出しの行の番号。手順の開いている呼び出しと同じ順に積む */\n const stack: number[] = [];\n const flows: StepFlow[][] = [];\n /** いちばん内側で開いている呼び出しの呼ばれた側。計算と記録をした者 */\n const actor = (): string => rows[stack[stack.length - 1] ?? -1]?.to ?? \"\";\n model.steps.forEach((step, s) => {\n /** 値の動きと確かめと取り消し。1 つでもあれば、この段はこれだけを出す */\n const main: StepFlow[] = [];\n /** 呼び出しと返した値と計算と記録。値が動かず確かめも取り消しも無い段に出す */\n const rest: StepFlow[] = [];\n /** この段で開いた呼び出しの行の番号から、その呼び出しの矢印の `rest` の中の位置 */\n const opened = new Map<number, number>();\n for (const e of step.events) {\n switch (e.type) {\n case \"call\":\n rows.push({ step: s, depth: stack.length, from: name(e.from), to: name(e.to), ...(e.label !== undefined ? { label: e.label } : {}) });\n if (!run.call(e)) {\n stack.push(rows.length - 1);\n opened.set(rows.length - 1, rest.length);\n rest.push({ kind: \"call\", line: \"dashed\", from: name(e.from), amount: e.label ?? w.callNone, to: name(e.to), tag: w.flowTags.call });\n }\n break;\n case \"return\":\n case \"revert\": {\n if (isFault(run.close(e.box, e.type))) break;\n const index = stack.pop() ?? -1;\n const row = rows[index];\n if (!row) break;\n if (e.type === \"revert\") {\n row.close = { step: s, reverted: true };\n const reason = e.reason ?? \"\";\n const last = main[main.length - 1];\n // 1 つ内側の取り消しが戻った先が、同じ理由で続けて取り消した時は、道を 1 人分延ばす\n if (last?.kind === \"revert\" && last.amount === reason && last.to === row.to) {\n last.via = [...(last.via ?? []), last.to];\n last.to = row.from;\n } else main.push({ kind: \"revert\", line: \"dashed\", from: row.to, amount: reason, to: row.from, tag: w.reverted, via: [] });\n break;\n }\n row.close = { step: s, ...(e.value !== undefined ? { value: e.value } : {}), reverted: false };\n const output = e.value ?? w.callNone;\n const at = opened.get(index);\n const back: StepFlow = { kind: \"return\", line: \"dashed\", from: row.to, amount: output, to: row.from, tag: at === undefined ? w.flowTags.return : w.returnOf(row.label ?? w.callNone) };\n if (at === undefined) rest.push(back);\n else rest[at] = back;\n break;\n }\n case \"move\":\n if (!run.move(e))\n main.push({ kind: \"move\", line: \"solid\", from: name(e.from), amount: joinWords(e.amount, run.tokens.get(e.box) ?? name(e.box)), to: name(e.to), tag: w.flowTags.move });\n break;\n case \"emit\":\n if (!isFault(run.emit())) rest.push({ kind: \"emit\", line: \"none\", from: actor(), amount: `${e.name}(${(e.args ?? []).join(\", \")})`, to: \"\", tag: w.flowTags.emit });\n break;\n case \"check\":\n main.push({ kind: \"check\", line: \"none\", from: \"\", amount: `${e.left} ${OP_TEXT[e.op]} ${e.right}`, to: \"\", tag: checkPasses(e) ? w.checkPass : w.checkFail });\n break;\n case \"calc\":\n rest.push({ kind: \"calc\", line: \"none\", from: actor(), amount: `${e.in} → ${e.out}`, to: \"\", tag: w.flowTags.calc });\n break;\n case \"write\":\n // 矢印にも結果にも出さないが、後の出来事を図と同じ値の上で当てるために書き替える\n run.write(e);\n break;\n default:\n break;\n }\n }\n flows.push(main.length > 0 ? main : rest);\n });\n return { rows, flows };\n}\n\n/**\n * 結果の一覧に出す内側の呼び出しか。取り消したか、`true` 以外の値を返した呼び出しを出す。\n * 返した値が無いか `true` だけの呼び出し (トークンを送るなど) は、その段の矢印に値の動きとして出ている\n */\nconst hasResult = (row: CallRow): boolean => row.close !== undefined && (row.close.reverted || (row.close.value !== undefined && row.close.value !== \"true\"));\n\n/** 書き出した頁で段の矢印と要点の札と呼び出しの結果と拡大の度合いの札が出しうる字。字の file に残す */\nexport function pipeTexts(model: DiagramModel, lang: NotationLang): string[] {\n const w = FIGURE_TEXT[lang];\n const { rows, flows } = callList(model, lang);\n return [\n w.calls,\n w.deal,\n w.waiting,\n w.reverted,\n w.gist,\n ...model.steps.flatMap((step) => (step.gist === undefined ? [] : [step.gist])),\n \"→\",\n ...rows.flatMap((row) => [row.from, row.to, row.label ?? w.callNone, row.close?.value ?? \"\"]),\n ...flows.flat().flatMap((flow) => [flow.from, flow.amount, flow.to, flow.tag, ...(flow.via ?? [])]),\n // 拡大の度合いの札 (`125%`)\n \"0123456789%\",\n ];\n}\n\n/** 段の動きと要点の札と呼び出しの結果の見た目。置く時に頁へ 1 度だけ入れる */\nfunction callsCss(): string {\n const line = `${px(FLOWS.line)} solid var(--mute)`;\n const tint = (color: string, percent: number): string => `color-mix(in srgb,var(${color}) ${percent}%,transparent)`;\n const strong = TYPE.button.weight;\n const name = TYPE.boxName.weight;\n return [\n // 矢印は送る側、量と線と札、受ける側の 3 つの欄に並べ、量が長い時は真ん中の欄の中で折る\n `.dg-fl{display:flex;flex-direction:column;max-width:${px(FLOWS.max)}}`,\n `.dg-f{display:grid;grid-template-columns:auto minmax(0,1fr) auto;align-items:center;column-gap:${px(FLOWS.gap)};padding:${px(FLOWS.row)} 0}`,\n `.dg-f+.dg-f{border-top:${px(LOOK.stroke.hair)} solid var(--hair)}`,\n `.dg-ff,.dg-ft{${font(TYPE.stepBody)};font-weight:${strong};color:var(--ink);white-space:nowrap}`,\n `.dg-fm{display:flex;flex-direction:column;align-items:center;text-align:center;gap:${px(FLOWS.inner)};min-width:0}`,\n `.dg-fa{${font(TYPE.button)};color:var(--ink);overflow-wrap:anywhere}`,\n `.dg-fx{align-self:stretch;position:relative;border-top:${line};margin-right:${px(FLOWS.head)}}`,\n `.dg-fx::after{content:\"\";position:absolute;right:-${px(FLOWS.head)};top:-${px(FLOWS.head / 2 + FLOWS.line / 2)};border:${px(FLOWS.head / 2)} solid transparent;border-left:${px(FLOWS.head)} solid var(--mute);border-right:0}`,\n `.dg-f[data-line=\"dashed\"] .dg-fx{border-top-style:dashed}`,\n `.dg-f[data-line=\"none\"] .dg-fx{display:none}`,\n `.dg-fg{${font(TYPE.fieldName)};color:var(--mute)}`,\n // 確かめと取り消しは色を薄く敷いた枠に入れ、満たすかと取り消しの札を先に置く\n `.dg-f[data-kind=\"check\"],.dg-f[data-kind=\"revert\"]{border-top:0;border-radius:${px(FLOWS.round)};padding:${px(FLOWS.boxY)} ${px(FLOWS.boxX)};margin:${px(FLOWS.boxGap)} 0}`,\n `.dg-f[data-kind=\"check\"]{display:flex;align-items:center;justify-content:space-between;gap:${px(FLOWS.gap)};background:${tint(\"--t-green\", TINT.pass)}}`,\n `.dg-f[data-kind=\"check\"][data-pass=\"false\"],.dg-f[data-kind=\"revert\"]{background:${tint(\"--t-rose\", TINT.fail)}}`,\n `.dg-f[data-kind=\"check\"] .dg-fg,.dg-f[data-kind=\"revert\"] .dg-fg{${font(TYPE.stripTitle)};color:var(--t-green);white-space:nowrap}`,\n `.dg-f[data-kind=\"check\"][data-pass=\"false\"] .dg-fg,.dg-f[data-kind=\"revert\"] .dg-fg{color:var(--t-rose)}`,\n `.dg-f[data-kind=\"check\"] .dg-fa{text-align:right;font-variant-numeric:tabular-nums}`,\n // 取り消しは札と理由を 1 行に、理由は等幅の小さな字で 1 回だけ出し、その下に取り消しが伝わった道を出す\n `.dg-f[data-kind=\"revert\"]{display:block}`,\n `.dg-fh{display:flex;flex-wrap:wrap;align-items:baseline;column-gap:${px(FLOWS.gap)}}`,\n `.dg-f[data-kind=\"revert\"] .dg-fa{${font(TYPE.label)};color:var(--t-rose);overflow-wrap:anywhere}`,\n // 道は矢印と次の名前を組にして折り、名前の途中では折らない\n `.dg-fp{display:flex;flex-wrap:wrap;align-items:center;column-gap:${px(FLOWS.linkGap)};row-gap:${px(FLOWS.inner)};margin-top:${px(FLOWS.linkGap)};${font(TYPE.stepBodyNarrow)};font-weight:${name};color:var(--ink)}`,\n `.dg-fs{display:inline-flex;align-items:center;gap:${px(FLOWS.linkGap)};white-space:nowrap}`,\n `.dg-fk{display:inline-block;position:relative;width:${px(FLOWS.link)};border-top:${px(FLOWS.line)} dashed var(--t-rose);margin-right:${px(FLOWS.head)}}`,\n `.dg-fk::after{content:\"\";position:absolute;right:-${px(FLOWS.head)};top:-${px(FLOWS.head / 2 + FLOWS.line / 2)};border:${px(FLOWS.head / 2)} solid transparent;border-left:${px(FLOWS.head)} solid var(--t-rose);border-right:0}`,\n // 要点の札は矢印の欄と同じ幅までの薄い青の枠に、太字の名札と要点の文を続けて書き、長い文は枠の中で折る\n `.dg-gs{margin-top:${px(FLOWS.gist)};max-width:${px(FLOWS.max)};padding:${px(FLOWS.gistY)} ${px(FLOWS.boxX)};border-radius:${px(FLOWS.round)};background:${tint(\"--c-blue\", TINT.gist)};${font(TYPE.stepBodyNarrow)};color:var(--ink);overflow-wrap:anywhere}`,\n `.dg-gsl{font-weight:${strong};color:var(--c-blue);margin-right:${px(FLOWS.linkGap)}}`,\n // 呼び出しの結果は畳み、開くと取引の枠と、戻った内側の呼び出しを 3 列で揃えて出す\n `.dg-cr{margin-top:${px(FLOWS.record)};max-width:${px(FLOWS.max)};${font(TYPE.stepBodyNarrow)};color:var(--ink)}`,\n `.dg-cr>summary{cursor:pointer;color:var(--c-blue)}`,\n `.dg-ctx{margin-top:${px(FLOWS.linkGap)};padding:${px(FLOWS.boxY)} ${px(FLOWS.boxX)};border-radius:${px(FLOWS.round)};background:${tint(\"--mute\", TINT.deal)}}`,\n `.dg-ctx[data-state=\"now\"]{box-shadow:inset ${px(FLOWS.mark)} 0 0 var(--c-blue)}`,\n `.dg-ctt{display:flex;justify-content:space-between;align-items:baseline;gap:${px(FLOWS.gap)}}`,\n `.dg-cdl{${font(TYPE.fieldName)};color:var(--mute);margin-right:${px(FLOWS.linkGap)}}`,\n `.dg-cn{font-weight:${name}}`,\n `.dg-ctv{color:var(--mute);white-space:nowrap}`,\n `.dg-ctx[data-result] .dg-ctv{color:var(--ink);font-weight:${strong}}`,\n `.dg-crg{display:grid;grid-template-columns:max-content minmax(0,1fr) max-content;margin-top:${px(FLOWS.linkGap)}}`,\n `.dg-crg>[data-dragon=\"call\"]{display:contents}`,\n `.dg-crg>[data-dragon=\"call\"]>span{padding:${px(FLOWS.cellY)} ${px(FLOWS.cellX)};border-top:${px(LOOK.stroke.hair)} solid var(--hair)}`,\n `.dg-crg>[data-dragon=\"call\"]:first-child>span{border-top:0}`,\n `.dg-crg>[data-dragon=\"call\"]>span:first-child{border-left:${px(FLOWS.mark)} solid transparent}`,\n `.dg-crg .dg-cw{color:var(--mute);overflow-wrap:anywhere}`,\n `.dg-crg .dg-cv{text-align:right;white-space:nowrap;font-variant-numeric:tabular-nums}`,\n `.dg-crg>[data-state=\"now\"]>span{background:${tint(\"--c-blue\", TINT.now)}}`,\n `.dg-crg>[data-state=\"now\"]>span:first-child{border-left-color:var(--c-blue)}`,\n `.dg-crg>[data-state=\"now\"] .dg-cw{color:var(--ink)}`,\n `.dg-crg>[data-state=\"now\"] .dg-cv{font-weight:${strong}}`,\n `.dg-ctx[data-result=\"reverted\"] .dg-ctv,.dg-crg>[data-result=\"reverted\"] .dg-cv{color:var(--t-rose)}`,\n ].join(\"\");\n}\n\n/** 呼び出しの見た目を入れる。口`styles`を渡された時は口で図を置いた所の根 (帯の内側) へ入れ、無い時は文書の頭へ入れる (#3695) */\nfunction ensureCallsCss(doc: Document, styles?: Styles): void {\n if (styles) return styles.adopt(\"dragon-pipe-css\", callsCss());\n if (doc.getElementById(\"dragon-pipe-css\")) return;\n const style = doc.createElement(\"style\");\n style.id = \"dragon-pipe-css\";\n style.textContent = callsCss();\n doc.head.appendChild(style);\n}\n\nexport interface PipeCalls {\n /** 図の下に置く、段の矢印と要点の札と呼び出しの結果の入れ物 */\n readonly element: HTMLElement;\n /** 図 `model` の段 `step` (0 から) の矢印と要点の札と、その段までの呼び出しの結果を出す。描き直した図を渡すと作り直す */\n show(model: DiagramModel, step: number): void;\n}\n\n/** 段の矢印と要点の札と呼び出しの結果を作る。置く所は再生の部品が決める */\nexport function mountPipeCalls(doc: Document, styles: Styles | undefined, lang: NotationLang): PipeCalls {\n ensureCallsCss(doc, styles);\n const w = FIGURE_TEXT[lang];\n const element = doc.createElement(\"div\");\n element.className = \"dg-calls\";\n element.dataset.dragon = \"calls\";\n // 置いた頁の言葉と違っても、矢印と結果を図の言葉の声で読ませる\n element.setAttribute(\"lang\", lang);\n const board = doc.createElement(\"div\");\n board.className = \"dg-fl\";\n board.dataset.dragon = \"flows\";\n const record = doc.createElement(\"details\");\n record.className = \"dg-cr\";\n record.dataset.dragon = \"call-record\";\n const summary = doc.createElement(\"summary\");\n summary.textContent = w.calls;\n const lines = doc.createElement(\"div\");\n lines.className = \"dg-crl\";\n record.append(summary, lines);\n element.append(board, record);\n\n const span = (className: string, part: string | undefined, text: string): HTMLSpanElement => {\n const el = doc.createElement(\"span\");\n el.className = className;\n if (part !== undefined) el.dataset.dragon = part;\n el.textContent = text;\n return el;\n };\n /** 取り消しの道と矢印の印。読み上げでは名前だけを読ませる */\n const link = (): HTMLElement => {\n const el = doc.createElement(\"span\");\n el.className = \"dg-fk\";\n el.setAttribute(\"aria-hidden\", \"true\");\n return el;\n };\n const arrowOf = (flow: StepFlow): HTMLElement => {\n const row = doc.createElement(\"div\");\n row.className = \"dg-f\";\n row.dataset.dragon = \"flow\";\n row.dataset.kind = flow.kind;\n row.dataset.line = flow.line;\n if (flow.kind === \"check\") {\n row.dataset.pass = String(flow.tag === w.checkPass);\n row.append(span(\"dg-fg\", \"flow-tag\", flow.tag), span(\"dg-fa\", \"flow-amount\", flow.amount));\n return row;\n }\n if (flow.kind === \"revert\") {\n const head = doc.createElement(\"div\");\n head.className = \"dg-fh\";\n head.append(span(\"dg-fg\", \"flow-tag\", flow.tag), ...(flow.amount === \"\" ? [] : [span(\"dg-fa\", \"flow-amount\", flow.amount)]));\n const path = doc.createElement(\"div\");\n path.className = \"dg-fp\";\n const hop = (part: string, who: string): HTMLElement => {\n const unit = span(\"dg-fs\", undefined, \"\");\n unit.append(link(), span(\"\", part, who));\n return unit;\n };\n path.append(span(\"\", \"flow-from\", flow.from), ...(flow.via ?? []).map((who) => hop(\"flow-via\", who)), hop(\"flow-to\", flow.to));\n row.append(head, path);\n return row;\n }\n const middle = doc.createElement(\"span\");\n middle.className = \"dg-fm\";\n const line = doc.createElement(\"span\");\n line.className = \"dg-fx\";\n line.setAttribute(\"aria-hidden\", \"true\");\n middle.append(span(\"dg-fa\", \"flow-amount\", flow.amount), line, span(\"dg-fg\", \"flow-tag\", flow.tag));\n row.append(span(\"dg-ff\", \"flow-from\", flow.from), middle, span(\"dg-ft\", \"flow-to\", flow.to));\n return row;\n };\n // 要点の札。要点を書いた段だけ、矢印と呼び出しの結果の間に置き、書かない段では外す\n const gist = doc.createElement(\"div\");\n gist.className = \"dg-gs\";\n gist.dataset.dragon = \"gist\";\n const gistText = span(\"\", \"gist-text\", \"\");\n gist.append(span(\"dg-gsl\", \"gist-label\", w.gist), gistText);\n /** 戻った呼び出しの返した値の欄の字。取り消した呼び出しは取り消しと出す */\n const valueOf = (row: CallRow): string => (row.close?.reverted ? w.reverted : (row.close?.value ?? w.callNone));\n /** いちばん外の呼び出し (取引) の枠。呼んだ側、呼ばれた側、返した値か返り待ちと、その下に中身 */\n const dealOf = (row: CallRow, returned: boolean, now: boolean): HTMLElement => {\n const el = doc.createElement(\"div\");\n el.className = \"dg-ctx\";\n el.dataset.dragon = \"call-tx\";\n if (now) el.dataset.state = \"now\";\n if (returned) el.dataset.result = row.close?.reverted ? \"reverted\" : \"returned\";\n const top = doc.createElement(\"div\");\n top.className = \"dg-ctt\";\n const who = doc.createElement(\"span\");\n who.append(span(\"dg-cdl\", undefined, w.deal), span(\"dg-cn\", \"call-from\", row.from), \" → \", span(\"dg-cn\", \"call-to\", row.to));\n top.append(who, span(\"dg-ctv\", \"call-value\", returned ? valueOf(row) : w.waiting));\n const what = doc.createElement(\"div\");\n what.dataset.dragon = \"call-what\";\n what.textContent = row.label ?? w.callNone;\n el.append(top, what);\n return el;\n };\n /** 戻った内側の呼び出しの行。呼ばれた側、中身、返した値の 3 列 */\n const resultOf = (row: CallRow, now: boolean): HTMLElement => {\n const el = doc.createElement(\"div\");\n el.dataset.dragon = \"call\";\n if (now) el.dataset.state = \"now\";\n if (row.close?.reverted) el.dataset.result = \"reverted\";\n el.append(span(\"dg-cn\", \"call-to\", row.to), span(\"dg-cw\", \"call-what\", row.label ?? w.callNone), span(\"dg-cv\", \"call-value\", valueOf(row)));\n return el;\n };\n\n let shown: DiagramModel | undefined;\n let list: CallList = { rows: [], flows: [] };\n return {\n element,\n show: (model, step) => {\n if (model !== shown) {\n shown = model;\n list = callList(model, lang);\n }\n board.replaceChildren(...(list.flows[step] ?? []).map(arrowOf));\n const point = model.steps[step]?.gist;\n if (point === undefined) gist.remove();\n else {\n gistText.textContent = point;\n if (gist.parentNode === null) record.before(gist);\n }\n // 取引ごとに枠を置き、その下にその取引の中で戻った呼び出しを並べる\n const parts: HTMLElement[] = [];\n let grid: HTMLElement | undefined;\n for (const row of list.rows) {\n if (row.step > step) continue;\n const returned = row.close !== undefined && row.close.step <= step;\n const now = returned && row.close?.step === step;\n if (row.depth === 0) {\n parts.push(dealOf(row, returned, now));\n grid = undefined;\n continue;\n }\n if (!returned || !hasResult(row)) continue;\n if (grid === undefined) {\n grid = doc.createElement(\"div\");\n grid.className = \"dg-crg\";\n parts.push(grid);\n }\n grid.append(resultOf(row, now));\n }\n lines.replaceChildren(...parts);\n },\n };\n}\n","/** 配管の図の描く部品の組 (#3389、#3656)。並べ方と畳み方は図の種類の置き場 (`kinds/pipe/layout.ts`)、描き方は `render/pipe.ts` が持つ */\nimport { drawPipe } from \"../render/pipe\";\nimport type { KindParts } from \"./parts\";\nimport { foldPipe, layoutPipe, type PipeLayout } from \"./pipe/layout\";\n\nexport const parts: KindParts<PipeLayout> = {\n // `[fold]` の呼び出しの内側の段を、開くと頼まれていなければ 1 つの段にまとめてから並べる\n fold: (model, options, lang) => foldPipe(model, options.open ?? [], lang, options.words?.pipe),\n // 幅に関わらず横に長いまま並べ、再生の部品が枠の中を横に送る (#3398)\n layout: (diagram, lang, options) =>\n layoutPipe(diagram, {\n lang,\n ...(options.words?.pipe === undefined ? {} : { words: options.words.pipe }),\n ...(options.width === undefined ? {} : { width: options.width }),\n }),\n // 段ごとに図の全てを 1 枚の絵に描くので、描き方が全ての層を持つ\n draw: (layout, _diagram, ctx) => drawPipe(layout, ctx.t, ctx),\n // その段に関わる関係者の列を見る\n focus: (layout, _diagram, step) => layout.focus.filter((f) => f.step === step),\n};\n\n/** 配管の図の再生の部品の、図の下の段の矢印と呼び出しの結果 (#3418、#3450)。再生の部品は配管の図を描けた後に、登録簿から引いて置く */\nexport { mountPipeCalls, type PipeCalls } from \"../pipe-player\";\n"]}
1
+ {"version":3,"sources":["/Users/cardene/Desktop/projects/dragon-3715-release-0-76-0/packages/dragon/dist/light/pipe-EZX6P3SM.cjs","../../src/blocks/calc/draw.ts","../../src/pipe-valve.ts","../../src/blocks/revert/draw.ts","../../src/blocks/hold/draw.ts","../../src/blocks/write/draw.ts","../../src/blocks/check/draw.ts","../../src/blocks/emit/draw.ts","../../src/blocks/fold/draw.ts","../../src/blocks/call/draw.ts","../../src/blocks/return/draw.ts","../../src/render/pipe.ts","../../src/pipe-route.ts","../../src/kinds/pipe/layout.ts","../../src/pipe-player.ts","../../src/kinds/pipe.ts"],"names":["parts","T","v","s","grid","frame","P","from","near","order","rect","room","others","lanes","at","callList","plate","longest","was","strike","flow"],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACA;AC1CA,IAAM,KAAA,EAAO,2BAAA,CAAU,SAAA,CAAU,CAAA;AAG1B,SAAS,SAAA,CAAU,CAAA,EAAkB,KAAA,EAAuB;AACjE,EAAA,MAAM,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,IAAA;AAChB,EAAA,MAAM,GAAA,EAAK,CAAC,CAAA,EAAW,CAAA,EAAA,GAAsB,CAAA,EAAA;AACvB,EAAA;AACD,EAAA;AAET,EAAA;AAId;ADsCwB;AACA;AEtDJ;AAGkB;AAClB,EAAA;AACC,EAAA;AACrB;AAG2B;AACN,EAAA;AACE,EAAA;AACD,EAAA;AACtB;AAGsC;AACf,EAAA;AACJ,EAAA;AACD,EAAA;AACZ,EAAA;AACK,IAAA;AACY,MAAA;AACA,MAAA;AACD,MAAA;AAClB,IAAA;AACK,EAAA;AACY,IAAA;AACG,IAAA;AACJ,IAAA;AAClB,EAAA;AACF;AFkDwB;AACA;AGnFe;AHqFf;AACA;AIxEd;AACA;AAGmB;AAGG;AAEN;AAMS;AAChB,EAAA;AACG,EAAA;AAGd,IAAA;AAGI,EAAA;AACW,EAAA;AACD,EAAA;AAEjB,EAAA;AACoB,IAAA;AACA,IAAA;AACZ,IAAA;AAED,EAAA;AAER,EAAA;AAMJ;AAG8C;AAIV;AACd,EAAA;AACE,EAAA;AACxB;AAGoC;AAGE;AAM2B;AACnD,EAAA;AACQ,EAAA;AACA,IAAA;AACX,IAAA;AACC,EAAA;AACS,EAAA;AAEJ,EAAA;AASjB;AAOkD;AAC3B,EAAA;AACN,EAAA;AACF,EAAA;AACc,EAAA;AAEZ,EAAA;AACM,EAAA;AACD,EAAA;AAEJ,EAAA;AACQ,IAAA;AACE,IAAA;AACL,MAAA;AACC,MAAA;AACA,MAAA;AACF,MAAA;AAClB,IAAA;AACO,IAAA;AACT,EAAA;AACyB,EAAA;AACR,EAAA;AACH,IAAA;AACO,IAAA;AACP,EAAA;AACM,IAAA;AACD,IAAA;AACJ,MAAA;AACF,IAAA;AACIA,EAAAA;AACEA,EAAAA;AACL,EAAA;AACW,EAAA;AACA,EAAA;AACZ,IAAA;AACY,EAAA;AAEnB,EAAA;AAGM,EAAA;AAGd;AAG0B;AACF,EAAA;AACL,EAAA;AACnB;AAS4C;AAC9B,EAAA;AACC,EAAA;AAGI,EAAA;AACH,EAAA;AACC,EAAA;AACD,EAAA;AACQ,EAAA;AAEpB,EAAA;AAKJ;AAG2B;AAGY;AAClB,EAAA;AACN,EAAA;AAED,EAAA;AAGd;AAuB4C;AACzB,EAAA;AACA,EAAA;AACE,EAAA;AACH,EAAA;AAGH,EAAA;AACF,EAAA;AACW,EAAA;AAEH,IAAA;AACH,IAAA;AACG,IAAA;AACO,IAAA;AACJ,MAAA;AACF,MAAA;AACE,MAAA;AACJ,MAAA;AACN,MAAA;AACM,MAAA;AACE,MAAA;AAClB,IAAA;AACO,IAAA;AACT,EAAA;AAEY,EAAA;AAGd;AAG0B;AACL,EAAA;AACE,EAAA;AACF,EAAA;AACF,EAAA;AACK,EAAA;AACf,EAAA;AACT;AJtCwB;AACA;AK5Md;AACA;AAGsC;AAEZ;AAGU;AAC1B,EAAA;AACL,EAAA;AACG,IAAA;AAEF,IAAA;AAMd,EAAA;AAEW,EAAA;AAMK,EAAA;AACG,EAAA;AAEP,EAAA;AAMd;AAGwC;AACrB,EAAA;AACE,EAAA;AAEP,EAAA;AAGd;ALkLwB;AACA;AMjOd;AACU;AAGS;AAIyD;AAExE,EAAA;AAOd;AAGqC;AACU,EAAA;AACvB,EAAA;AACA,EAAA;AACA,EAAA;AACxB;AAM8C;AACtB,EAAA;AACP,EAAA;AACA,EAAA;AAGO,EAAA;AAElB,EAAA;AAES,EAAA;AAED,EAAA;AAOd;ANqMwB;AACA;AO3Pd;AAGkC;AAC1B,EAAA;AACC,EAAA;AACN,EAAA;AACC,EAAA;AACK,IAAA;AACR,IAAA;AACT,EAAA;AAEY,EAAA;AAId;AAGqC;AAChB,EAAA;AACA,EAAA;AACG,EAAA;AACF,EAAA;AACtB;APqPwB;AACA;AQjRgB;AACvB,EAAA;AACjB;ARmRwB;AACA;ASxRwC;AACzC,EAAA;AACvB;AT0RwB;AACA;AUxRR;AAGiC;AAC/B,EAAA;AAIT,EAAA;AACT;AAMgF;AACxD,EAAA;AACD,EAAA;AAEnB,EAAA;AAGJ;AV6QwB;AACA;AWjRd;AACA;AACK;AACE;AAGoB;AAMpB;AAAA;AAEf,EAAA;AACoB,EAAA;AACpB,EAAA;AAA4G;AAE5G,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAA6H;AAE7H,EAAA;AAA4D;AAEtC,EAAA;AACtB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAA;AAEqB,EAAA;AACrB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACqB,EAAA;AACC,EAAA;AACHC,EAAAA;AACAA,EAAAA;AACAA,EAAAA;AACAA,EAAAA;AACnB,EAAA;AACe,EAAA;AACf,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAyE;AAEzE,EAAA;AACA,EAAA;AACA,EAAA;AACe,EAAA;AACA,EAAA;AACf,EAAA;AACe,EAAA;AACf,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACkBA,EAAAA;AAClB,EAAA;AACA,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACsB,EAAA;AACtB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAwE;AAExE,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACgB,EAAA;AACA,EAAA;AAChB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACe,EAAA;AACf,EAAA;AACe,EAAA;AACf,EAAA;AAAkE;AAElE,EAAA;AACA,EAAA;AACkBA,EAAAA;AACAA,EAAAA;AAClB,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACe,EAAA;AACf,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACkBA,EAAAA;AACAA,EAAAA;AACAA,EAAAA;AAClB,EAAA;AACO;AAIP;AAG6B;AAEjB,EAAA;AAId;AAGqC;AACd,EAAA;AACH,EAAA;AACG,EAAA;AACvB;AAMsB;AACE,EAAA;AACN,EAAA;AACA,EAAA;AACG,IAAA;AACG,IAAA;AACtB,EAAA;AACmB,EAAA;AACA,IAAA;AACD,MAAA;AACD,MAAA;AACA,MAAA;AACK,MAAA;AACJ,MAAA;AACE,MAAA;AACC,MAAA;AACnB,IAAA;AACgB,EAAA;AACF,IAAA;AACN,IAAA;AACQ,IAAA;AACC,IAAA;AACnB,EAAA;AACF;AAGwE;AAE/C;AACT,EAAA;AACG,EAAA;AACA,EAAA;AACG,EAAA;AACD,EAAA;AACD,EAAA;AACS,EAAA;AAGT,EAAA;AACa,IAAA;AACnB,IAAA;AACO,IAAA;AACG,MAAA;AACZ,MAAA;AACR,IAAA;AACe,IAAA;AACG,IAAA;AACpB,EAAA;AACmC,EAAA;AAEnB,EAAA;AACI,IAAA;AACE,IAAA;AACtB,EAAA;AAC4B,EAAA;AAKE,EAAA;AAEV,EAAA;AAEJ,EAAA;AAGM,EAAA;AACF,IAAA;AACD,IAAA;AACE,IAAA;AACH,MAAA;AACI,MAAA;AACnB,IAAA;AACmB,IAAA;AACA,IAAA;AACtB,EAAA;AAGe,EAAA;AACI,IAAA;AACL,IAAA;AACa,IAAA;AACN,IAAA;AACF,MAAA;AACF,MAAA;AACK,MAAA;AAEhB,MAAA;AAGY,QAAA;AACK,QAAA;AACD,QAAA;AACE,QAAA;AACb,MAAA;AACI,MAAA;AACb,IAAA;AAEgB,IAAA;AACG,MAAA;AACN,MAAA;AACb,IAAA;AACS,IAAA;AACV,EAAA;AAEkB,EAAA;AACA,EAAA;AACH,EAAA;AACF,IAAA;AAGH,IAAA;AACX,EAAA;AAEe,EAAA;AACI,IAAA;AACW,IAAA;AACb,IAAA;AACA,IAAA;AAEwB,IAAA;AAEZ,IAAA;AACf,IAAA;AACI,IAAA;AACS,IAAA;AACL,IAAA;AACL,IAAA;AAGG,IAAA;AACC,IAAA;AAEF,IAAA;AACE,MAAA;AACA,MAAA;AACJ,MAAA;AACH,MAAA;AACC,MAAA;AACb,IAAA;AAEkB,IAAA;AACF,MAAA;AACN,MAAA;AACM,MAAA;AAKI,MAAA;AACL,MAAA;AACA,MAAA;AACF,MAAA;AACb,IAAA;AACgB,IAAA;AACG,MAAA;AACA,MAAA;AACN,MAAA;AACb,IAAA;AAEgB,IAAA;AACI,MAAA;AACL,MAAA;AACL,MAAA;AACQ,QAAA;AACJ,QAAA;AACG,QAAA;AAEL,QAAA;AAGV,MAAA;AACgB,MAAA;AACL,MAAA;AACb,IAAA;AACgB,IAAA;AAEA,IAAA;AACA,IAAA;AACG,MAAA;AACA,MAAA;AACA,MAAA;AACH,MAAA;AACJ,MAAA;AACG,QAAA;AACX,QAAA;AACF,MAAA;AACW,MAAA;AACb,IAAA;AAEmB,IAAA;AACA,MAAA;AACD,QAAA;AACA,QAAA;AACA,QAAA;AAEI,UAAA;AACA,UAAA;AAEN,QAAA;AACA,QAAA;AACN,QAAA;AACQ,QAAA;AAEZ,QAAA;AAGiB,UAAA;AACC,UAAA;AACZ,UAAA;AACE,UAAA;AACJ,QAAA;AACK,QAAA;AACD,QAAA;AACF,UAAA;AACI,UAAA;AACE,UAAA;AACE,YAAA;AACN,YAAA;AACR,UAAA;AACa,UAAA;AACD,UAAA;AACd,QAAA;AACW,QAAA;AACb,MAAA;AAEc,IAAA;AACG,sBAAA;AACA,MAAA;AACL,MAAA;AACS,MAAA;AACR,QAAA;AACX,QAAA;AACF,MAAA;AACe,MAAA;AACC,MAAA;AACR,QAAA;AACA,QAAA;AACU,QAAA;AACD,QAAA;AACH,QAAA;AACb,MAAA;AACW,MAAA;AACK,MAAA;AACnB,IAAA;AAEgB,IAAA;AACG,MAAA;AACA,MAAA;AACX,MAAA;AACJ,QAAA;AACE,UAAA;AACY,UAAA;AAGd,QAAA;AACF,MAAA;AACF,IAAA;AACgB,IAAA;AACI,MAAA;AACL,MAAA;AACI,MAAA;AACA,MAAA;AACD,MAAA;AACL,MAAA;AACb,IAAA;AAEgB,IAAA;AACG,MAAA;AACA,MAAA;AACJ,MAAA;AACH,MAAA;AACC,MAAA;AACb,IAAA;AAEgB,IAAA;AACG,MAAA;AACN,MAAA;AACb,IAAA;AAEgB,IAAA;AACC,MAAA;AACG,MAAA;AACJ,MAAA;AACE,MAAA;AACC,MAAA;AACH,MAAA;AACU,MAAA;AAChB,QAAA;AACC,QAAA;AACT,MAAA;AACa,MAAA;AACC,MAAA;AACI,QAAA;AACD,QAAA;AACF,QAAA;AACd,MAAA;AACgB,MAAA;AACF,MAAA;AAEG,MAAA;AACZ,MAAA;AACJ,QAAA;AAEF,MAAA;AACkB,MAAA;AAED,sBAAA;AACnB,IAAA;AAEmB,IAAA;AACV,IAAA;AACV,EAAA;AACc,EAAA;AACjB;AXoMwB;AACA;AYhrBD;AACA;AAsDyB;AAG5B;AACT,EAAA;AACK,EAAA;AACE,EAAA;AACI,IAAA;AACa,IAAA;AACrB,IAAA;AACZ,EAAA;AACO,EAAA;AACT;AAG0B;AAED,EAAA;AACH,EAAA;AACA,EAAA;AACR,IAAA;AACU,IAAA;AACJ,IAAA;AACJ,IAAA;AACM,IAAA;AACpB,EAAA;AACO,EAAA;AACT;AAOW;AACW,iBAAA;AACC,kBAAA;AACS,kBAAA;AAClB,kBAAA;AAAA;AAEF,kBAAA;AAEI,EAAA;AACH,IAAA;AACX,EAAA;AAEe,EAAA;AACD,IAAA;AACd,EAAA;AAEmD,EAAA;AAC7B,IAAA;AACL,IAAA;AACF,IAAA;AACC,IAAA;AACG,MAAA;AACG,MAAA;AACF,MAAA;AACL,MAAA;AACC,MAAA;AACA,MAAA;AACR,MAAA;AACN,IAAA;AACW,IAAA;AACC,IAAA;AACJ,IAAA;AACV,EAAA;AAEc,EAAA;AACG,IAAA;AACK,IAAA;AACD,IAAA;AACF,IAAA;AACN,IAAA;AACK,MAAA;AACA,MAAA;AACI,MAAA;AACV,MAAA;AACC,MAAA;AACO,QAAA;AACA,QAAA;AACN,QAAA;AACC,QAAA;AACK,QAAA;AACR,UAAA;AACQ,UAAA;AACd,QAAA;AACc,QAAA;AACR,UAAA;AACQ,UAAA;AACd,QAAA;AACa,QAAA;AACF,QAAA;AACC,QAAA;AACA,QAAA;AACR,QAAA;AACN,MAAA;AACW,MAAA;AACC,MAAA;AACJ,MAAA;AACV,IAAA;AACO,IAAA;AACT,EAAA;AAEqB,EAAA;AACD,IAAA;AACA,IAAA;AACC,IAAA;AACJ,IAAA;AACK,IAAA;AACJ,IAAA;AACF,IAAA;AACD,IAAA;AACC,IAAA;AACJ,IAAA;AACZ,EAAA;AACF;AACsB;AAaU;AAqB5B;AAEQ;AAG0B;AACf,EAAA;AACA,EAAA;AACZ,EAAA;AACG,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACI,IAAA;AACH,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACD,IAAA;AACA,IAAA;AACC,IAAA;AACA,IAAA;AACI,IAAA;AACD,IAAA;AAChB,EAAA;AAEQ,EAAA;AACD,EAAA;AACT;AAEoB;AACT,EAAA;AACA,EAAA;AACgB,kBAAA;AACR,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AAAA;AAEA,EAAA;AACA,EAAA;AAAA;AAEE,kBAAA;AAAA;AAEE,kBAAA;AAAA;AAEF,kBAAA;AAEuC,EAAA;AAC9C,IAAA;AACA,IAAA;AACG,IAAA;AACA,IAAA;AAEG,IAAA;AACA,IAAA;AACE,IAAA;AACA,IAAA;AACD,IAAA;AACA,IAAA;AACE,IAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAED,MAAA;AACA,QAAA;AACJ,QAAA;AACE,QAAA;AACf,MAAA;AACiB,MAAA;AACA,QAAA;AACJ,QAAA;AACE,QAAA;AACf,MAAA;AACD,IAAA;AACkB,IAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AAEL,MAAA;AACE,QAAA;AACE,UAAA;AACJ,MAAA;AACE,QAAA;AACE,UAAA;AAClB,IAAA;AACH,EAAA;AAE8B,EAAA;AAClB,IAAA;AACM,IAAA;AAClB,EAAA;AAC8B,EAAA;AAClB,IAAA;AACM,IAAA;AAClB,EAAA;AAAA;AAGkC,EAAA;AACZ,IAAA;AACJ,IAAA;AACG,IAAA;AACF,MAAA;AACC,MAAA;AACA,MAAA;AAEH,MAAA;AACE,QAAA;AACE,UAAA;AAEJ,MAAA;AACE,QAAA;AACE,UAAA;AACZ,IAAA;AACU,MAAA;AACC,MAAA;AACA,MAAA;AACH,MAAA;AACE,QAAA;AACE,UAAA;AACJ,MAAA;AACE,QAAA;AACE,UAAA;AACnB,IAAA;AACF,EAAA;AAAA;AAGiE,EAAA;AAC3C,IAAA;AACD,MAAA;AACC,MAAA;AACA,MAAA;AACD,MAAA;AACF,MAAA;AACjB,IAAA;AACF,EAAA;AAAA;AAG2B,EAAA;AACZ,IAAA;AACQ,IAAA;AACT,IAAA;AACM,IAAA;AACA,IAAA;AACF,IAAA;AAEZ,IAAA;AACa,IAAA;AACA,MAAA;AACC,MAAA;AAEA,QAAA;AACF,UAAA;AACC,UAAA;AACA,QAAA;AACb,QAAA;AACF,MAAA;AACc,MAAA;AACG,QAAA;AACE,QAAA;AAEP,QAAA;AACV,QAAA;AACF,MAAA;AACc,MAAA;AACO,MAAA;AACR,MAAA;AACI,MAAA;AACR,MAAA;AACX,IAAA;AACO,IAAA;AACT,EAAA;AAAA;AAGgD,EAAA;AAC1B,IAAA;AACA,IAAA;AACD,IAAA;AACA,IAAA;AACF,IAAA;AACN,IAAA;AACQ,IAAA;AACG,MAAA;AACF,MAAA;AACA,MAAA;AACZ,MAAA;AACQ,MAAA;AACI,MAAA;AAET,MAAA;AACG,MAAA;AACR,MAAA;AACA,MAAA;AACN,IAAA;AACO,IAAA;AACT,EAAA;AAAA;AAAA;AAAA;AAAA;AAMqC,EAAA;AAChB,IAAA;AACC,IAAA;AACJ,IAAA;AACE,IAAA;AACL,IAAA;AACG,IAAA;AACL,IAAA;AACC,IAAA;AACQ,IAAA;AACA,MAAA;AACA,MAAA;AACD,MAAA;AACD,MAAA;AAEL,MAAA;AACM,MAAA;AACjB,MAAA;AACF,IAAA;AACiB,IAAA;AACN,IAAA;AACA,IAAA;AAGe,IAAA;AACP,MAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACH,MAAA;AACC,MAAA;AACC,QAAA;AACAC,QAAAA;AACjB,MAAA;AAIe,MAAA;AACG,MAAA;AACD,MAAA;AACV,MAAA;AACT,IAAA;AAEc,IAAA;AACE,MAAA;AACD,MAAA;AACE,MAAA;AACD,MAAA;AACC,MAAA;AACD,MAAA;AAEA,MAAA;AACA,MAAA;AACG,MAAA;AACnB,IAAA;AAEc,IAAA;AAEI,IAAA;AACE,MAAA;AACA,MAAA;AACJ,MAAA;AACR,MAAA;AACQ,MAAA;AACA,MAAA;AACC,MAAA;AACH,MAAA;AACC,MAAA;AACf,IAAA;AAKkB,IAAA;AACV,MAAA;AACY,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACJ,MAAA;AACA,MAAA;AACA,MAAA;AACC,MAAA;AACD,MAAA;AACE,MAAA;AACA,MAAA;AACC,MAAA;AACnB,IAAA;AACgB,IAAA;AACIC,MAAAA;AACAA,MAAAA;AACD,MAAA;AACP,MAAA;AACC,MAAA;AACOA,MAAAA;AACAA,MAAAA;AACH,MAAA;AACE,MAAA;AACF,MAAA;AACC,QAAA;AACA,QAAA;AACA,QAAA;AACA,QAAA;AAChB,MAAA;AACF,IAAA;AACY,IAAA;AACI,IAAA;AACC,IAAA;AACA,IAAA;AACD,MAAA;AACC,MAAA;AACN,MAAA;AAGM,MAAA;AACA,MAAA;AACF,MAAA;AACM,MAAA;AACA,MAAA;AACT,QAAA;AACS,QAAA;AACjB,QAAA;AACF,MAAA;AACiB,MAAA;AACC,MAAA;AAEF,MAAA;AACF,QAAA;AACF,QAAA;AACI,QAAA;AACC,QAAA;AACA,QAAA;AACJ,QAAA;AACC,QAAA;AACD,QAAA;AACE,UAAA;AACA,UAAA;AACA,UAAA;AACD,UAAA;AACZ,QAAA;AACF,MAAA;AACF,IAAA;AACe,IAAA;AACW,IAAA;AAClB,IAAA;AACC,IAAA;AACM,MAAA;AACG,MAAA;AACH,MAAA;AACC,QAAA;AACZ,QAAA;AACF,MAAA;AACI,MAAA;AACN,IAAA;AACe,IAAA;AACa,IAAA;AACb,MAAA;AACI,MAAA;AACA,MAAA;AAClB,IAAA;AACkB,IAAA;AACrB,EAAA;AACF;AAOgD;AAC3B,EAAA;AACC,EAAA;AACJ,IAAA;AACM,IAAA;AACH,MAAA;AACG,MAAA;AACD,MAAA;AACD,MAAA;AACD,MAAA;AACG,MAAA;AACA,MAAA;AACA,MAAA;AAEJ,MAAA;AACI,QAAA;AACF,QAAA;AACEC,UAAAA;AACH,UAAA;AACH,YAAA;AACI,YAAA;AACZ,UAAA;AACA,UAAA;AACF,QAAA;AACF,MAAA;AAEkB,MAAA;AACD,QAAA;AACO,QAAA;AACN,QAAA;AACR,UAAA;AACI,UAAA;AACV,UAAA;AACF,QAAA;AACF,MAAA;AAEiB,MAAA;AACA,QAAA;AACO,QAAA;AACP,QAAA;AACP,UAAA;AACI,UAAA;AACV,UAAA;AACF,QAAA;AACF,MAAA;AAGc,MAAA;AACE,QAAA;AACH,QAAA;AACH,UAAA;AACI,UAAA;AACZ,QAAA;AACF,MAAA;AACF,IAAA;AACc,IAAA;AAChB,EAAA;AACO,EAAA;AACT;AAMwC;AACvB,EAAA;AACI,EAAA;AACG,EAAA;AACT,EAAA;AACC,EAAA;AACQ,EAAA;AACsB,EAAA;AAEtB,EAAA;AACF,EAAA;AACH,EAAA;AACI,IAAA;AACH,IAAA;AACI,MAAA;AACA,MAAA;AACD,MAAA;AACC,MAAA;AACD,MAAA;AACnB,IAAA;AACF,EAAA;AAEmB,EAAA;AACC,EAAA;AACF,EAAA;AACD,IAAA;AACC,IAAA;AACI,MAAA;AACF,MAAA;AACE,MAAA;AACA,MAAA;AACA,MAAA;AACpB,IAAA;AACF,EAAA;AACO,EAAA;AACT;AAUE;AAIe,EAAA;AACI,EAAA;AACE,EAAA;AACC,EAAA;AACsB,EAAA;AACtB,EAAA;AAEL,EAAA;AAIE,EAAA;AACC,EAAA;AACN,EAAA;AACI,IAAA;AACA,MAAA;AACI,MAAA;AACA,MAAA;AACpB,IAAA;AACoB,EAAA;AACF,EAAA;AACP,EAAA;AACK,IAAA;AACI,MAAA;AACJ,MAAA;AACG,MAAA;AACnB,IAAA;AACK,EAAA;AACT;AAGyB;AACD,EAAA;AACN,EAAA;AACG,IAAA;AACA,IAAA;AACA,IAAA;AACL,IAAA;AACG,IAAA;AACjB,EAAA;AACO,EAAA;AACT;AZmgBwB;AACA;AansCkC;AACpD,EAAA;AACM,IAAA;AACE,IAAA;AACI,IAAA;AACR,IAAA;AACM,IAAA;AACM,IAAA;AACpB,EAAA;AACI,EAAA;AACM,IAAA;AACQ,IAAA;AACF,IAAA;AACR,IAAA;AACM,IAAA;AACM,IAAA;AACpB,EAAA;AACF;AAoBgC;AAIN;AACX,EAAA;AACM,EAAA;AACL,EAAA;AACP,EAAA;AACW,IAAA;AACE,IAAA;AACH,IAAA;AACK,IAAA;AACT,IAAA;AACA,IAAA;AACb,EAAA;AACF;AAGwD;AAyVnB;AACf,EAAA;AACF,EAAA;AACpB;AAGwC;AAUf;AASE,EAAA;AACA,EAAA;AACH,EAAA;AACJ,IAAA;AACC,MAAA;AACU,QAAA;AACR,QAAA;AACA,QAAA;AACJ,MAAA;AACI,QAAA;AACH,QAAA;AACd,MAAA;AACF,IAAA;AACD,EAAA;AACa,EAAA;AACQ,EAAA;AACC,EAAA;AACI,EAAA;AACnB,EAAA;AACW,EAAA;AACE,IAAA;AACJ,IAAA;AACA,IAAA;AACb,MAAA;AACA,MAAA;AACF,IAAA;AACc,IAAA;AACK,IAAA;AACR,IAAA;AACI,MAAA;AACI,MAAA;AACH,MAAA;AACf,IAAA;AACU,IAAA;AACb,EAAA;AACqB,EAAA;AACC,EAAA;AACF,EAAA;AACD,EAAA;AACE,EAAA;AACvB;AAG+D;AACtC,EAAA;AACJ,EAAA;AACD,EAAA;AACpB;AA2EyB;AACD,EAAA;AACN,EAAA;AACiB,EAAA;AACpB,EAAA;AACQ,EAAA;AACA,EAAA;AACJ,EAAA;AACY,EAAA;AACd,EAAA;AACY,EAAA;AACV,EAAA;AACsB,EAAA;AAEjB,EAAA;AACL,IAAA;AACE,IAAA;AACD,IAAA;AACZ,IAAA;AACsB,IAAA;AACb,MAAA;AACI,MAAA;AACA,MAAA;AACG,MAAA;AACpB,IAAA;AACoB,IAAA;AACF,MAAA;AACD,QAAA;AACU,UAAA;AACR,YAAA;AACL,YAAA;AACC,YAAA;AACC,YAAA;AACF,YAAA;AACK,YAAA;AACH,YAAA;AACD,YAAA;AACD,YAAA;AACA,YAAA;AACR,UAAA;AACU,UAAA;AACI,UAAA;AACF,UAAA;AACF,UAAA;AACJ,UAAA;AACO,YAAA;AACD,YAAA;AACA,YAAA;AACA,YAAA;AACE,YAAA;AACd,UAAA;AACA,UAAA;AACF,QAAA;AACK,QAAA;AACU,QAAA;AACP,UAAA;AACA,UAAA;AACM,UAAA;AACA,UAAA;AACC,UAAA;AACP,UAAA;AACA,UAAA;AACO,YAAA;AACL,YAAA;AACE,YAAA;AACA,cAAA;AACE,cAAA;AACR,cAAA;AACE,gBAAA;AACO,gBAAA;AACH,gBAAA;AACF,kBAAA;AACK,kBAAA;AACP,gBAAA;AACK,gBAAA;AACP,cAAA;AACK,cAAA;AACP,YAAA;AACK,UAAA;AACM,YAAA;AACF,cAAA;AACC,cAAA;AACV,YAAA;AACQ,YAAA;AACI,YAAA;AACd,UAAA;AACA,UAAA;AACF,QAAA;AACa,QAAA;AACG,UAAA;AACA,UAAA;AACH,UAAA;AACD,UAAA;AACA,UAAA;AACA,UAAA;AACE,UAAA;AACZ,UAAA;AACF,QAAA;AACc,QAAA;AACE,UAAA;AACF,UAAA;AACF,UAAA;AACC,UAAA;AACX,UAAA;AACF,QAAA;AACa,QAAA;AACA,UAAA;AACG,UAAA;AACF,UAAA;AACF,UAAA;AACV,UAAA;AACF,QAAA;AACK,QAAA;AACQ,UAAA;AACX,UAAA;AACG,QAAA;AACO,UAAA;AACV,UAAA;AACF,QAAA;AACE,UAAA;AACJ,MAAA;AACD,IAAA;AACgB,IAAA;AACA,IAAA;AACF,IAAA;AACH,IAAA;AACC,IAAA;AACA,MAAA;AACO,MAAA;AACA,MAAA;AACA,MAAA;AACpB,IAAA;AACgB,IAAA;AACA,MAAA;AACA,MAAA;AACE,MAAA;AACJ,MAAA;AACA,MAAA;AACA,MAAA;AACd,IAAA;AACM,IAAA;AACA,IAAA;AAEJ,IAAA;AAOc,IAAA;AACD,IAAA;AACK,MAAA;AACF,MAAA;AAChB,MAAA;AACA,MAAA;AACA,MAAA;AACa,MAAA;AACD,MAAA;AACG,MAAA;AAChB,IAAA;AACF,EAAA;AACM,EAAA;AACT;AAKwB;AACZ,EAAA;AACY,EAAA;AACxB;AAEU;AACA;AAsBY;AACA,EAAA;AACC,EAAA;AACP,EAAA;AACA,EAAA;AAChB;AAGc;AACK;AAGN;AAEI;AAEM;AAEN;AAEA;AAEQ;AAKL;AAKH;AAEE;AAKE;AAKP;AAEK;AAEC;AAEA;AAEE;AACH,EAAA;AACH,EAAA;AAChB;AACmD;AAClB;AACa;AAEb;AAEU;AACnB,EAAA;AACA,EAAA;AACA,EAAA;AACA,EAAA;AACH,EAAA;AACrB;AAEkB;AACD;AAEO;AAER;AAEM;AACZ,EAAA;AACa,EAAA;AACH,IAAA;AACE,MAAA;AACA,MAAA;AACD,MAAA;AACD,MAAA;AACA,MAAA;AACG,MAAA;AACnB,IAAA;AACK,EAAA;AACT;AAEwC;AAChB,EAAA;AACD,EAAA;AACvB;AAcgC;AACnB,EAAA;AACP,EAAA;AACM,EAAA;AACI,EAAA;AACM,EAAA;AACF,IAAA;AACV,IAAA;AACc,IAAA;AACD,IAAA;AACN,IAAA;AACO,IAAA;AACD,IAAA;AACL,IAAA;AACP,IAAA;AACT,EAAA;AAE2C,EAAA;AAC7C;AAKmD;AAC5B,EAAA;AAEF,EAAA;AACC,EAAA;AACyB,EAAA;AAChC,EAAA;AACQ,EAAA;AACN,EAAA;AACI,EAAA;AACrB;AAC6D;AACf;AAC5B;AAEC;AACW,EAAA;AACf,EAAA;AACQ,EAAA;AACA,IAAA;AACC,IAAA;AACtB,EAAA;AACO,EAAA;AACT;AAEyC;AAC5B,EAAA;AACU,EAAA;AACF,IAAA;AACA,IAAA;AACG,MAAA;AACA,MAAA;AACpB,IAAA;AACQ,IAAA;AACV,EAAA;AACqB,EAAA;AACvB;AAMoB;AACI,EAAA;AACI,EAAA;AACR,IAAA;AACA,IAAA;AACC,IAAA;AACnB,EAAA;AACmB,EAAA;AACA,IAAA;AACV,IAAA;AACU,MAAA;AACA,MAAA;AACjB,IAAA;AACD,EAAA;AAC6B,EAAA;AACVJ,EAAAA;AACHA,IAAAA;AACI,IAAA;AACF,IAAA;AACG,IAAA;AACtB,EAAA;AACgBA,EAAAA;AACT,EAAA;AACT;AAE2B;AACJ,EAAA;AACP,EAAA;AACA,EAAA;AACCK,EAAAA;AAEK,EAAA;AACD,EAAA;AACG,EAAA;AACN,EAAA;AACa,EAAA;AACT,IAAA;AACC,IAAA;AACZ,IAAA;AACT,EAAA;AAC6BJ,EAAAA;AAEV,EAAA;AACC,EAAA;AACR,EAAA;AAIQ,IAAA;AACA,IAAA;AACJ,IAAA;AAChB,EAAA;AACgB,EAAA;AAClB;AAWgB;AAEI;AAEH;AACO,EAAA;AACA,EAAA;AACH,EAAA;AACE,EAAA;AACC,EAAA;AACL,EAAA;AACK,EAAA;AACA,EAAA;AACN,EAAA;AACG,EAAA;AACiB,EAAA;AAChB,EAAA;AACA,EAAA;AACC,EAAA;AAEJ,EAAA;AACKK,EAAAA;AAGG,EAAA;AACJ,EAAA;AACa,EAAA;AACb,IAAA;AACrB,EAAA;AACmB,EAAA;AACH,EAAA;AACI,EAAA;AACmB,EAAA;AACnB,EAAA;AACA,EAAA;AACD,EAAA;AACH,EAAA;AACC,EAAA;AACG,EAAA;AACA,EAAA;AACmB,EAAA;AACrB,EAAA;AAGE,EAAA;AACC,EAAA;AACL,EAAA;AACI,IAAA;AACE,IAAA;AACtB,EAAA;AACmB,EAAA;AACD,IAAA;AACA,MAAA;AACD,MAAA;AACK,MAAA;AACpB,IAAA;AACiB,EAAA;AACH,EAAA;AACE,IAAA;AACT,IAAA;AACT,EAAA;AACiB,EAAA;AACC,IAAA;AAClB,EAAA;AACmB,EAAA;AACS,EAAA;AACN,EAAA;AACL,EAAA;AACG,EAAA;AACD,EAAA;AACD,IAAA;AAClB,EAAA;AACgB,EAAA;AACG,EAAA;AACL,IAAA;AACO,IAAA;AACD,MAAA;AACJ,MAAA;AACK,MAAA;AACL,MAAA;AACd,IAAA;AACgB,IAAA;AACC,MAAA;AACD,MAAA;AAChB,IAAA;AACc,IAAA;AAChB,EAAA;AACgB,EAAA;AACD,EAAA;AACF,IAAA;AACG,IAAA;AAChB,EAAA;AAGmB,EAAA;AACE,EAAA;AACL,EAAA;AACM,IAAA;AACA,IAAA;AACH,IAAA;AACnB,EAAA;AACsC,EAAA;AAIzB,EAAA;AACG,EAAA;AACA,EAAA;AACA,EAAA;AACW,EAAA;AAER,EAAA;AACF,EAAA;AACK,IAAA;AACtB,EAAA;AAKiBC,EAAAA;AACW,IAAA;AACb,IAAA;AACK,IAAA;AACO,IAAA;AACL,MAAA;AACA,MAAA;AACF,MAAA;AACL,QAAA;AACE,QAAA;AACN,QAAA;AACI,QAAA;AACX,MAAA;AACF,IAAA;AACK,IAAA;AACE,IAAA;AACT,EAAA;AACyB,EAAA;AACA,EAAA;AACZ,EAAA;AACO,EAAA;AACE,IAAA;AACI,IAAA;AACL,IAAA;AACN,IAAA;AACM,MAAA;AACC,MAAA;AACP,MAAA;AACC,MAAA;AACG,MAAA;AACjB,IAAA;AACc,IAAA;AACD,IAAA;AACO,IAAA;AACF,IAAA;AAED,IAAA;AACP,MAAA;AACQ,MAAA;AACD,QAAA;AACA,QAAA;AACA,QAAA;AACA,QAAA;AACL,QAAA;AACR,QAAA;AACF,MAAA;AACF,IAAA;AACmB,IAAA;AACA,IAAA;AACrB,EAAA;AACgB,EAAA;AAGK,EAAA;AACF,EAAA;AACA,IAAA;AACD,MAAA;AACGC,MAAAA;AACnB,IAAA;AAC0B,EAAA;AACV,IAAA;AACG,IAAA;AACrB,EAAA;AAEgB,EAAA;AACD,IAAA;AACO,IAAA;AACtB,EAAA;AAIsC,EAAA;AACvB,EAAA;AAEI,EAAA;AACmB,EAAA;AACtB,EAAA;AAEJ,IAAA;AACA,IAAA;AACM,IAAA;AACK,IAAA;AACD,MAAA;AACE,MAAA;AACnB,IAAA;AACH,EAAA;AACc,EAAA;AACA,EAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAChB,EAAA;AAEiB,EAAA;AACA,EAAA;AAED,EAAA;AAGI,EAAA;AACgC,EAAA;AACvB,EAAA;AACb,EAAA;AAIA,EAAA;AACK,IAAA;AACH,IAAA;AACG,IAAA;AACH,IAAA;AACE,IAAA;AACC,IAAA;AACD,IAAA;AACJ,IAAA;AAChB,EAAA;AACqB,EAAA;AACF,EAAA;AACC,EAAA;AACE,IAAA;AACN,IAAA;AAChB,EAAA;AACmB,EAAA;AACD,EAAA;AACC,EAAA;AAIA,EAAA;AAOU,EAAA;AACJ,EAAA;AAEG,EAAA;AAEZ,EAAA;AAED,EAAA;AACC,EAAA;AACA,EAAA;AACD,IAAA;AAEK,IAAA;AACA,IAAA;AACa,IAAA;AAEf,IAAA;AACF,IAAA;AACD,MAAA;AACI,QAAA;AACA,QAAA;AACCF,QAAAA;AAChB,MAAA;AACa,MAAA;AACG,MAAA;AACjB,IAAA;AACiB,IAAA;AACL,IAAA;AACoB,IAAA;AACd,IAAA;AACP,MAAA;AAEK,MAAA;AACD,MAAA;AACT,MAAA;AACP,IAAA;AACiB,IAAA;AACnB,EAAA;AAmB2B,EAAA;AACZ,IAAA;AACsB,IAAA;AACnB,IAAA;AACF,IAAA;AACP,IAAA;AACT,EAAA;AACuB,EAAA;AACR,EAAA;AACY,EAAA;AAEP,EAAA;AACA,IAAA;AACK,IAAA;AACR,IAAA;AACK,IAAA;AAChB,IAAA;AAEY,IAAA;AACA,MAAA;AACI,MAAA;AACP,MAAA;AACM,QAAA;AACA,QAAA;AACF,QAAA;AACE,QAAA;AACD,QAAA;AACH,UAAA;AACK,UAAA;AACA,UAAA;AAChB,QAAA;AACF,MAAA;AACF,IAAA;AAEgB,IAAA;AACA,MAAA;AAEH,MAAA;AACC,QAAA;AACC,QAAA;AACE,UAAA;AACF,UAAA;AACK,UAAA;AACd,UAAA;AACF,QAAA;AACF,MAAA;AACF,IAAA;AAEK,IAAA;AACQ,MAAA;AACC,QAAA;AACC,QAAA;AACE,UAAA;AACF,UAAA;AACK,UAAA;AACd,UAAA;AACF,QAAA;AACF,MAAA;AACc,IAAA;AAClB,EAAA;AACsB,EAAA;AAGtB,EAAA;AACkB,IAAA;AACA,IAAA;AACG,IAAA;AACH,IAAA;AACD,MAAA;AACG,MAAA;AACL,MAAA;AACF,MAAA;AACO,MAAA;AACF,QAAA;AACI,QAAA;AACR,UAAA;AACQ,UAAA;AACA,UAAA;AACA,UAAA;AAChB,QAAA;AACF,MAAA;AACgB,MAAA;AAClB,IAAA;AACF,EAAA;AAKgB,EAAA;AAChB,EAAA;AACmB,IAAA;AACA,IAAA;AACF,IAAA;AACC,IAAA;AACI,MAAA;AACP,MAAA;AACb,IAAA;AACgB,IAAA;AACI,MAAA;AACF,MAAA;AACF,MAAA;AACE,MAAA;AAClB,IAAA;AACF,EAAA;AAEoB,EAAA;AAOJ,EAAA;AAEA,EAAA;AACZ,EAAA;AACe,EAAA;AACH,IAAA;AACG,IAAA;AACH,IAAA;AACM,MAAA;AACJ,MAAA;AACG,MAAA;AACnB,IAAA;AACY,IAAA;AACE,MAAA;AACZ,MAAA;AACF,IAAA;AACF,EAAA;AACO,EAAA;AAEU,EAAA;AACC,IAAA;AACC,IAAA;AACG,IAAA;AACL,IAAA;AASF,IAAA;AACa,IAAA;AAEU,IAAA;AAClB,MAAA;AACAA,MAAAA;AAClB,IAAA;AAEmBC,IAAAA;AAEJ,IAAA;AACuB,IAAA;AAC5B,MAAA;AACS,MAAA;AACD,QAAA;AACH,QAAA;AACA,QAAA;AACI,QAAA;AACC,QAAA;AACD,QAAA;AACA,QAAA;AACD,QAAA;AACT,QAAA;AACN,MAAA;AACH,IAAA;AACY,IAAA;AAEG,IAAA;AACI,IAAA;AACD,MAAA;AACA,QAAA;AACF,UAAA;AACG,UAAA;AACd,QAAA;AACaC,QAAAA;AAChB,MAAA;AACgB,IAAA;AACC,IAAA;AACF,MAAA;AACC,QAAA;AACE,QAAA;AAClB,MAAA;AACY,MAAA;AAEE,MAAA;AACC,MAAA;AACE,QAAA;AACD,QAAA;AAChB,MAAA;AACF,IAAA;AAGY,IAAA;AACK,IAAA;AACH,IAAA;AACK,IAAA;AACD,MAAA;AACC,QAAA;AACP,QAAA;AACM,QAAA;AACE,QAAA;AACA,QAAA;AACZ,QAAA;AACO,QAAA;AACA,QAAA;AACG,QAAA;AACF,QAAA;AACG,QAAA;AACjB,MAAA;AACF,IAAA;AACW,IAAA;AAEQ,IAAA;AACJ,IAAA;AACC,IAAA;AAII,IAAA;AAED,IAAA;AAGQ,IAAA;AACP,MAAA;AACD,MAAA;AACgB,MAAA;AACrB,MAAA;AACI,QAAA;AACH,QAAA;AAEC,QAAA;AACG,QAAA;AACC,QAAA;AAClB,MAAA;AACY,MAAA;AACI,MAAA;AACC,QAAA;AACA,QAAA;AACjB,MAAA;AACO,MAAA;AACT,IAAA;AACc,IAAA;AACI,IAAA;AACD,IAAA;AACF,MAAA;AACK,MAAA;AACpB,IAAA;AAGyB,IAAA;AACR,IAAA;AACA,IAAA;AACJ,IAAA;AACI,IAAA;AACA,IAAA;AACA,IAAA;AAKC,IAAA;AACE,IAAA;AACH,MAAA;AACD,MAAA;AACA,MAAA;AAChB,IAAA;AACiB,IAAA;AACC,IAAA;AACM,IAAA;AACR,IAAA;AACD,MAAA;AACG,MAAA;AACH,MAAA;AAEI,QAAA;AACf,QAAA;AACF,MAAA;AACa,MAAA;AACC,MAAA;AACG,MAAA;AACD,MAAA;AACE,QAAA;AACH,UAAA;AACA,UAAA;AACE,UAAA;AACC,YAAA;AAEF,YAAA;AACZ,UAAA;AACF,QAAA;AACe,MAAA;AACD,MAAA;AACE,MAAA;AACpB,IAAA;AACmB,IAAA;AACR,IAAA;AACK,IAAA;AACE,IAAA;AACD,IAAA;AACD,IAAA;AACL,IAAA;AACF,IAAA;AACA,IAAA;AACU,IAAA;AACA,MAAA;AACA,MAAA;AACP,MAAA;AACZ,IAAA;AACiB,IAAA;AACA,IAAA;AACA,IAAA;AAIH,IAAA;AACG,MAAA;AACH,QAAA;AACG,QAAA;AACCF,QAAAA;AAChB,MAAA;AACgB,MAAA;AAClB,IAAA;AACgB,IAAA;AACG,MAAA;AACA,MAAA;AACnB,IAAA;AAEgB,IAAA;AAEC,IAAA;AACF,MAAA;AACK,MAAA;AACpB,IAAA;AACiB,IAAA;AACE,MAAA;AACH,MAAA;AACI,MAAA;AACD,MAAA;AACnB,IAAA;AAEgC,IAAA;AACf,MAAA;AACC,MAAA;AACjB,IAAA;AACiB,IAAA;AACD,IAAA;AACD,IAAA;AACH,MAAA;AACM,MAAA;AACnB,IAAA;AACgB,IAAA;AAEE,IAAA;AACC,MAAA;AACC,MAAA;AACA,MAAA;AACpB,IAAA;AAEM,IAAA;AAKY,IAAA;AACC,MAAA;AACJ,MAAA;AACI,MAAA;AACJ,MAAA;AACG,MAAA;AACC,MAAA;AACF,MAAA;AACR,MAAA;AACK,QAAA;AACM,QAAA;AAClB,MAAA;AACF,IAAA;AACmB,IAAA;AACN,MAAA;AACO,MAAA;AACD,MAAA;AACnB,IAAA;AACoB,IAAA;AACd,IAAA;AACc,MAAA;AACD,MAAA;AACA,MAAA;AACA,MAAA;AACL,MAAA;AACG,MAAA;AACjB,IAAA;AAW0B,IAAA;AACX,MAAA;AACA,MAAA;AACI,MAAA;AACAA,MAAAA;AACb,MAAA;AACA,MAAA;AACO,MAAA;AACM,QAAA;AACC,QAAA;AACH,QAAA;AACD,QAAA;AACD,MAAA;AACE,QAAA;AACC,QAAA;AACT,MAAA;AACU,QAAA;AACR,QAAA;AACT,MAAA;AACgB,MAAA;AACC,MAAA;AACL,QAAA;AACE,QAAA;AACF,QAAA;AACH,QAAA;AACR,MAAA;AACe,MAAA;AACjB,IAAA;AACiB,IAAA;AAIAA,IAAAA;AAEJ,IAAA;AACE,IAAA;AACG,MAAA;AACD,MAAA;AAClB,IAAA;AAec,IAAA;AACK,IAAA;AAEF,IAAA;AACU,IAAA;AACT,MAAA;AAClB,IAAA;AACgB,IAAA;AACH,MAAA;AACF,MAAA;AACE,MAAA;AACE,QAAA;AACI,UAAA;AACA,UAAA;AACA,UAAA;AACL,YAAA;AACA,YAAA;AACA,YAAA;AACF,YAAA;AACM,YAAA;AACC,YAAA;AACL,YAAA;AACA,YAAA;AACA,YAAA;AACA,YAAA;AACI,YAAA;AACX,UAAA;AACKG,UAAAA;AAGA,UAAA;AACA,UAAA;AACE,YAAA;AACK,YAAA;AACC,cAAA;AACJ,cAAA;AACF,cAAA;AACK,cAAA;AACX,YAAA;AACF,UAAA;AACa,UAAA;AACA,UAAA;AACf,QAAA;AACJ,IAAA;AAEkB,IAAA;AACH,MAAA;AACG,MAAA;AAClB,IAAA;AACiB,IAAA;AACF,MAAA;AACE,MAAA;AACY,MAAA;AACb,MAAA;AACH,MAAA;AAEI,MAAA;AACT,MAAA;AACA,MAAA;AAEU,MAAA;AAEA,MAAA;AACD,MAAA;AACH,QAAA;AACI,UAAA;AACP,UAAA;AACQ,UAAA;AACF,UAAA;AACZ,QAAA;AACQ,MAAA;AACM,QAAA;AACF,QAAA;AACC,QAAA;AACD,QAAA;AACH,QAAA;AACK,UAAA;AAEA,UAAA;AACP,UAAA;AACe,UAAA;AACT,UAAA;AACE,UAAA;AACf,QAAA;AACH,MAAA;AACO,MAAA;AACT,IAAA;AACiB,IAAA;AAGG,IAAA;AACH,IAAA;AACQ,IAAA;AACA,IAAA;AACT,IAAA;AACT,MAAA;AACa,MAAA;AACF,MAAA;AAClB,IAAA;AACgB,IAAA;AACE,IAAA;AACF,IAAA;AACA,IAAA;AACA,MAAA;AACI,MAAA;AACpB,IAAA;AACgB,IAAA;AACD,MAAA;AACE,MAAA;AACf,MAAA;AACF,IAAA;AACgB,IAAA;AACD,MAAA;AACG,MAAA;AAChB,MAAA;AACF,IAAA;AACgB,IAAA;AACe,IAAA;AAChB,IAAA;AACCC,IAAAA;AACA,MAAA;AACG,MAAA;AACnB,IAAA;AACa,IAAA;AACI,IAAA;AACE,MAAA;AACA,MAAA;AACnB,IAAA;AACgB,IAAA;AACA,IAAA;AACH,MAAA;AACK,MAAA;AAClB,IAAA;AACgB,IAAA;AACE,MAAA;AACL,MAAA;AACC,QAAA;AACI,QAAA;AAChB,MAAA;AACU,MAAA;AACOJ,MAAAA;AACnB,IAAA;AAEiB,IAAA;AACE,MAAA;AACH,MAAA;AAChB,IAAA;AACgB,IAAA;AAE+C,IAAA;AAC9C,MAAA;AACC,MAAA;AACA,QAAA;AACD,QAAA;AACC,QAAA;AACD,QAAA;AACH,QAAA;AACM,QAAA;AACN,QAAA;AACX,MAAA;AACH,IAAA;AACgB,IAAA;AAGQ,IAAA;AACJ,MAAA;AACN,MAAA;AACI,MAAA;AACjB,IAAA;AACiB,IAAA;AACA,MAAA;AACP,QAAA;AACL,UAAA;AACY,YAAA;AACA,YAAA;AACZ,UAAA;AACS,UAAA;AACX,QAAA;AACJ,IAAA;AAEkB,IAAA;AAC6D,IAAA;AACtD,IAAA;AACN,IAAA;AACD,IAAA;AAID,IAAA;AACE,IAAA;AACA,MAAA;AACA,MAAA;AACN,MAAA;AACA,MAAA;AACL,MAAA;AACA,MAAA;AACQ,MAAA;AAGZ,MAAA;AAOH,IAAA;AAEiB,IAAA;AACN,MAAA;AACM,MAAA;AACE,MAAA;AACD,MAAA;AACC,MAAA;AACpB,IAAA;AAKoB,IAAA;AACA,MAAA;AACN,MAAA;AACF,MAAA;AACD,MAAA;AAGN,MAAA;AAEW,QAAA;AACA,QAAA;AACY,QAAA;AACE,QAAA;AACR,QAAA;AACA,QAAA;AACjB,MAAA;AACuB,MAAA;AACF,MAAA;AACR,MAAA;AACF,MAAA;AACE,QAAA;AACH,QAAA;AACD,QAAA;AACI,QAAA;AACD,QAAA;AACX,QAAA;AACA,QAAA;AACW,QAAA;AACN,UAAA;AACA,UAAA;AACD,UAAA;AACO,UAAA;AACb,UAAA;AACA,UAAA;AACW,UAAA;AACI,UAAA;AACV,UAAA;AACC,UAAA;AACD,UAAA;AACE,UAAA;AACT,QAAA;AACa,QAAA;AACD,QAAA;AACI,UAAA;AACJ,UAAA;AACA,UAAA;AAEC,UAAA;AACD,UAAA;AACL,QAAA;AAES,UAAA;AACN,YAAA;AAEA,YAAA;AACA,YAAA;AACK,YAAA;AACH,cAAA;AACA,cAAA;AACC,cAAA;AAGD,cAAA;AAIA,cAAA;AACD,gBAAA;AACA,gBAAA;AACK,gBAAA;AACV,cAAA;AAGM,cAAA;AACE,gBAAA;AACA,gBAAA;AACD,gBAAA;AAIC,gBAAA;AACJ,kBAAA;AACM,oBAAA;AACJ,oBAAA;AACA,oBAAA;AACI,oBAAA;AAEA,oBAAA;AACA,oBAAA;AACN,kBAAA;AACA,kBAAA;AACF,gBAAA;AACM,gBAAA;AACC,gBAAA;AACT,cAAA;AACM,cAAA;AACG,cAAA;AACX,YAAA;AACO,YAAA;AACT,UAAA;AACY,UAAA;AAEA,YAAA;AACJ,YAAA;AACA,YAAA;AACM,YAAA;AACH,YAAA;AACE,cAAA;AACC,cAAA;AACJ,cAAA;AACR,YAAA;AACK,UAAA;AACO,YAAA;AACH,YAAA;AACE,cAAA;AACA,cAAA;AACX,YAAA;AACF,UAAA;AACF,QAAA;AACgB,QAAA;AACD,UAAA;AACE,UAAA;AAEL,UAAA;AACA,UAAA;AACG,UAAA;AACA,UAAA;AACJ,UAAA;AACE,YAAA;AACG,YAAA;AACA,YAAA;AACA,YAAA;AACA,YAAA;AACH,YAAA;AACX,UAAA;AACa,UAAA;AACf,QAAA;AACU,QAAA;AACA,QAAA;AACE,QAAA;AACE,QAAA;AACC,QAAA;AACH,QAAA;AACd,MAAA;AACmB,MAAA;AACnB,IAAA;AAEY,IAAA;AACM,IAAA;AAChB,MAAA;AACe,MAAA;AACL,MAAA;AACI,MAAA;AACC,MAAA;AACG,QAAA;AAEF,QAAA;AACE,QAAA;AACL,QAAA;AACb,MAAA;AACF,IAAA;AACM,IAAA;AAEa,IAAA;AACD,IAAA;AAIF,IAAA;AACH,IAAA;AACgB,IAAA;AACb,IAAA;AACCI,IAAAA;AACD,MAAA;AACC,MAAA;AACjB,IAAA;AACmB,IAAA;AACF,IAAA;AACG,MAAA;AACA,MAAA;AACH,MAAA;AACE,MAAA;AACH,MAAA;AACG,MAAA;AACnB,IAAA;AACgB,IAAA;AACA,IAAA;AACI,MAAA;AACN,MAAA;AAEM,MAAA;AACD,MAAA;AACnB,IAAA;AACkBH,IAAAA;AACE,MAAA;AACJ,MAAA;AAChB,IAAA;AAGe,IAAA;AACA,IAAA;AACE,IAAA;AACA,IAAA;AACE,MAAA;AACC,MAAA;AACD,MAAA;AACH,MAAA;AACG,MAAA;AACJ,MAAA;AACA,MAAA;AACC,MAAA;AACG,MAAA;AACA,MAAA;AACnB,IAAA;AACkB,IAAA;AACF,IAAA;AAEE,IAAA;AAKD,IAAA;AACA,MAAA;AACE,MAAA;AACnB,IAAA;AAKeA,IAAAA;AAEA,MAAA;AACIA,MAAAA;AACA,MAAA;AACP,MAAA;AACO,MAAA;AACDI,MAAAA;AAClB,IAAA;AAC0B,IAAA;AACV,MAAA;AAChB,IAAA;AACiB,IAAA;AACD,IAAA;AACG,MAAA;AACA,MAAA;AACF,QAAA;AACA,QAAA;AACf,MAAA;AACF,IAAA;AAEgB,IAAA;AACG,MAAA;AACA,MAAA;AACH,MAAA;AACC,MAAA;AAEC,MAAA;AACT,MAAA;AACT,IAAA;AAEiB,IAAA;AACE,MAAA;AACD,MAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACnB,IAAA;AAGoB,IAAA;AACA,IAAA;AAEJ,IAAA;AACH,MAAA;AACA,MAAA;AACE,QAAA;AACI,QAAA;AACjB,MAAA;AACF,IAAA;AAEkB,IAAA;AACA,IAAA;AACD,IAAA;AACF,IAAA;AAI8D,IAAA;AAC9D,IAAA;AAEK,IAAA;AAEd,IAAA;AAEsB,IAAA;AAEV,IAAA;AACA,MAAA;AACP,QAAA;AACL,UAAA;AACW,YAAA;AACG,YAAA;AACA,YAAA;AACA,YAAA;AACH,YAAA;AACX,UAAA;AACS,UAAA;AACX,QAAA;AACJ,IAAA;AACoB,IAAA;AACA,MAAA;AACP,MAAA;AACG,MAAA;AACI,MAAA;AACD,MAAA;AACR,MAAA;AACX,IAAA;AAEgB,IAAA;AAEW,IAAA;AAGH,IAAA;AAIJ,IAAA;AACL,MAAA;AACN,MAAA;AACK,QAAA;AACI,QAAA;AACD,QAAA;AACG,QAAA;AAGlB,MAAA;AACF,IAAA;AAEc,IAAA;AACC,MAAA;AAEE,MAAA;AACC,MAAA;AACF,QAAA;AACC,QAAA;AACC,UAAA;AACC,UAAA;AACO,YAAA;AACR,YAAA;AACQ,YAAA;AACP,YAAA;AACD,YAAA;AACH,YAAA;AACT,UAAA;AACF,QAAA;AACU,QAAA;AACZ,MAAA;AACO,MAAA;AACT,IAAA;AAKoB,IAAA;AACJ,MAAA;AAEE,MAAA;AACH,MAAA;AACf,IAAA;AAUE,IAAA;AAKW,MAAA;AACE,QAAA;AACI,QAAA;AACjB,MAAA;AACO,MAAA;AACT,IAAA;AAEM,IAAA;AAOQ,MAAA;AACI,MAAA;AACD,MAAA;AACC,MAAA;AACR,QAAA;AACM,QAAA;AACE,QAAA;AACH,QAAA;AACK,QAAA;AAEF,QAAA;AACK,QAAA;AAIH,QAAA;AAIFC,QAAAA;AAGD,QAAA;AACU,UAAA;AACf,UAAA;AACK,UAAA;AACb,QAAA;AACF,MAAA;AACO,MAAA;AACT,IAAA;AAEkB,IAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACO,QAAA;AACT,UAAA;AACA,UAAA;AACZ,QAAA;AACgB,QAAA;AAClB,MAAA;AACO,MAAA;AACT,IAAA;AAEoB,IAAA;AACD,MAAA;AACN,MAAA;AACE,MAAA;AACK,MAAA;AACJ,MAAA;AACF,MAAA;AACI,MAAA;AAEV,MAAA;AACG,MAAA;AACH,MAAA;AACsB,MAAA;AAEtB,MAAA;AACQ,MAAA;AAEE,MAAA;AACH,MAAA;AACI,MAAA;AACC,MAAA;AAGD,MAAA;AACF,QAAA;AACC,QAAA;AAED,QAAA;AACE,QAAA;AAED,QAAA;AACE,QAAA;AACA,QAAA;AAClB,MAAA;AAEgB,MAAA;AAEA,MAAA;AACJ,QAAA;AACA,QAAA;AACK,QAAA;AACH,QAAA;AACA,QAAA;AAEN,QAAA;AACO,UAAA;AACG,UAAA;AACA,UAAA;AAChB,QAAA;AACsB,QAAA;AACb,UAAA;AACA,UAAA;AACT,QAAA;AACa,QAAA;AACG,QAAA;AAC2B,QAAA;AAC3B,UAAA;AACF,UAAA;AACA,UAAA;AAAiK;AAE/J,UAAA;AAAmI;AAEnI,UAAA;AAKhB,QAAA;AAEgB,QAAA;AAEN,UAAA;AACI,UAAA;AACI,UAAA;AACf,QAAA;AAEiB,QAAA;AAGN,QAAA;AACF,QAAA;AACI,UAAA;AACA,UAAA;AACR,UAAA;AACG,UAAA;AACT,UAAA;AACA,UAAA;AACA,UAAA;AACyC,UAAA;AACpC,UAAA;AACC,UAAA;AACR,QAAA;AAEe,QAAA;AACA,QAAA;AACF,QAAA;AACP,QAAA;AACS,UAAA;AACA,UAAA;AACA,UAAA;AACJ,UAAA;AACX,QAAA;AAEgB,QAAA;AACA,UAAA;AACD,UAAA;AACQ,UAAA;AACP,UAAA;AAER,UAAA;AAEG,UAAA;AACX,QAAA;AACe,QAAA;AACjB,MAAA;AAEe,MAAA;AACE,QAAA;AACL,QAAA;AACG,QAAA;AACD,QAAA;AACd,MAAA;AACc,MAAA;AACC,QAAA;AACD,QAAA;AACF,QAAA;AACA,QAAA;AAGC,QAAA;AACL,UAAA;AACQC,YAAAA;AACD,YAAA;AACb,UAAA;AACc,UAAA;AACF,YAAA;AACA,YAAA;AACF,UAAA;AACI,UAAA;AACD,UAAA;AACf,QAAA;AAGW,QAAA;AACK,UAAA;AAEA,UAAA;AACJ,UAAA;AACF,YAAA;AACF,YAAA;AACN,UAAA;AACF,QAAA;AAEE,QAAA;AAES,QAAA;AACG,UAAA;AACG,UAAA;AACF,UAAA;AACC,YAAA;AACJ,YAAA;AACA,YAAA;AACT,UAAA;AACD,UAAA;AACF,QAAA;AACc,QAAA;AACA,QAAA;AAEE,QAAA;AACN,QAAA;AACD,QAAA;AACO,QAAA;AACH,QAAA;AACA,QAAA;AACD,QAAA;AACI,QAAA;AACD,QAAA;AACjB,MAAA;AAEkB,MAAA;AAE8B,MAAA;AAC7B,MAAA;AACA,QAAA;AACA,QAAA;AACA,QAAA;AACD,QAAA;AACH,QAAA;AACE,QAAA;AACf,MAAA;AAEiB,MAAA;AAET,QAAA;AACJ,UAAA;AACF,QAAA;AACe,QAAA;AACA,QAAA;AACR,QAAA;AACT,MAAA;AAEM,MAAA;AACU,QAAA;AACF,QAAA;AACE,QAAA;AACF,QAAA;AACG,QAAA;AACF,QAAA;AACf,MAAA;AAOkB,MAAA;AACD,QAAA;AACJ,QAAA;AACG,QAAA;AACD,UAAA;AACC,UAAA;AACD,UAAA;AACE,UAAA;AACD,UAAA;AACE,UAAA;AACD,UAAA;AACA,UAAA;AACf,QAAA;AACgB,QAAA;AACH,UAAA;AACE,UAAA;AACD,UAAA;AACA,UAAA;AACD,UAAA;AACG,UAAA;AACH,UAAA;AACC,UAAA;AACE,UAAA;AACA,UAAA;AACH,UAAA;AACG,UAAA;AACF,UAAA;AACC,UAAA;AACN,UAAA;AACT,QAAA;AACgB,QAAA;AACV,QAAA;AACS,QAAA;AACD,QAAA;AACR,QAAA;AACM,UAAA;AACI,UAAA;AAEP,UAAA;AAGR,QAAA;AACY,QAAA;AAEG,QAAA;AACA,UAAA;AACF,YAAA;AACH,YAAA;AACT,UAAA;AACc,QAAA;AACJ,UAAA;AACH,UAAA;AACE,UAAA;AACX,QAAA;AACgB,QAAA;AAEJ,QAAA;AACD,QAAA;AACA,QAAA;AACK,QAAA;AACH,UAAA;AACC,UAAA;AACA,UAAA;AAED,UAAA;AACG,UAAA;AACR,UAAA;AACO,UAAA;AACA,UAAA;AACE,UAAA;AAAyD,YAAA;AAEpE,cAAA;AACQC,gBAAAA;AACC,gBAAA;AACR,cAAA;AACH,YAAA;AACF,UAAA;AACc,UAAA;AACR,UAAA;AAEH,UAAA;AAKM,YAAA;AACI,UAAA;AACD,UAAA;AACD,UAAA;AACF,UAAA;AACK,UAAA;AAChB,QAAA;AACa,QAAA;AACN,QAAA;AACT,MAAA;AAKgB,MAAA;AACC,QAAA;AAEA,QAAA;AACH,QAAA;AACI,QAAA;AACH,QAAA;AACA,QAAA;AACD,QAAA;AACH,QAAA;AACI,QAAA;AACS,QAAA;AACX,QAAA;AACI,UAAA;AACD,UAAA;AACD,UAAA;AACE,YAAA;AACHA,cAAAA;AACA,cAAA;AACF,cAAA;AACN,YAAA;AACJ,QAAA;AACc,QAAA;AACC,QAAA;AAEb,QAAA;AAIS,QAAA;AACG,QAAA;AACC,UAAA;AACA,UAAA;AACF,UAAA;AACA,UAAA;AACX,UAAA;AACF,QAAA;AACS,QAAA;AACM,QAAA;AACH,QAAA;AACd,MAAA;AAGgB,MAAA;AACC,QAAA;AACA,QAAA;AACA,QAAA;AACA,QAAA;AACH,QAAA;AACC,UAAA;AACX,UAAA;AACF,QAAA;AACa,QAAA;AACC,QAAA;AAEP,QAAA;AAIS,QAAA;AAClB,MAAA;AACiB,MAAA;AACnB,IAAA;AAGA,IAAA;AAIiB,MAAA;AACE,MAAA;AACD,MAAA;AACE,MAAA;AACP,MAAA;AACM,QAAA;AACA,QAAA;AACjB,MAAA;AACc,MAAA;AACZC,QAAAA;AACc,QAAA;AACP,QAAA;AACO,QAAA;AACF,QAAA;AACG,UAAA;AACF,UAAA;AACb,QAAA;AACF,MAAA;AACM,MAAA;AAEQ,MAAA;AACA,MAAA;AAChB,IAAA;AAIgC,IAAA;AAGd,MAAA;AACG,MAAA;AACH,QAAA;AACD,QAAA;AACA,QAAA;AACG,QAAA;AACE,QAAA;AAClB,MAAA;AACY,MAAA;AACG,MAAA;AACJC,MAAAA;AACE,MAAA;AACI,MAAA;AACJ,QAAA;AACK,QAAA;AAClB,MAAA;AACkB,MAAA;AACJ,MAAA;AACa,MAAA;AAEV,MAAA;AACH,MAAA;AACI,MAAA;AAEI,MAAA;AACd,QAAA;AACR,MAAA;AACa,MAAA;AACG,QAAA;AACA,QAAA;AACR,QAAA;AACC,QAAA;AACM,QAAA;AACP,QAAA;AACO,UAAA;AACA,UAAA;AACb,QAAA;AACe,QAAA;AACE,QAAA;AACZ,QAAA;AACC,QAAA;AACP,MAAA;AACiB,MAAA;AACJ,MAAA;AACW,MAAA;AACT,MAAA;AACjB,IAAA;AAIa,IAAA;AACI,IAAA;AACD,MAAA;AACF,MAAA;AACD,MAAA;AACA,QAAA;AACZ,QAAA;AACF,MAAA;AACiB,MAAA;AACF,MAAA;AACA,MAAA;AACC,QAAA;AACA,QAAA;AACC,UAAA;AACD,UAAA;AACE,YAAA;AACH,YAAA;AACA,YAAA;AACC,YAAA;AACZ,UAAA;AACO,UAAA;AACN,QAAA;AACY,QAAA;AACJ,QAAA;AACH,QAAA;AACM,UAAA;AACE,UAAA;AACd,UAAA;AACF,QAAA;AACF,MAAA;AAEY,MAAA;AACG,MAAA;AACH,MAAA;AACE,MAAA;AACQ,MAAA;AACC,MAAA;AACrB,QAAA;AACW,QAAA;AACE,QAAA;AACf,MAAA;AACiB,MAAA;AACL,MAAA;AACd,IAAA;AAIiB,IAAA;AACF,IAAA;AACc,IAAA;AAGR,MAAA;AACH,MAAA;AACF,MAAA;AAEV,MAAA;AAKK,MAAA;AACF,QAAA;AACH,QAAA;AACe,QAAA;AACA,QAAA;AACC,QAAA;AAChB,QAAA;AACc,QAAA;AACd,QAAA;AACgB,QAAA;AAClB,MAAA;AACD,IAAA;AACc,IAAA;AACC,MAAA;AACA,MAAA;AACT,MAAA;AACR,IAAA;AAC8B,IAAA;AACJ,IAAA;AACX,IAAA;AACE,MAAA;AACH,QAAA;AACE,QAAA;AACC,QAAA;AACC,QAAA;AACA,QAAA;AACC,QAAA;AAClB,MAAA;AAGgB,IAAA;AACJ,MAAA;AACM,QAAA;AACD,QAAA;AAChB,MAAA;AACH,IAAA;AACe,IAAA;AACC,IAAA;AACD,MAAA;AACH,MAAA;AACM,MAAA;AACA,MAAA;AAClB,IAAA;AACgB,IAAA;AACG,MAAA;AACC,MAAA;AACpB,IAAA;AAC2B,IAAA;AACG,IAAA;AACD,IAAA;AACb,IAAA;AACH,MAAA;AACK,QAAA;AACH,QAAA;AACc,QAAA;AACV,QAAA;AACC,QAAA;AACV,QAAA;AACU,QAAA;AACD,UAAA;AACA,UAAA;AACP,UAAA;AACQ,UAAA;AACF,UAAA;AACN,UAAA;AACO,UAAA;AACA,UAAA;AACT,UAAA;AACA,UAAA;AACC,UAAA;AACG,YAAA;AACA,YAAA;AACE,YAAA;AACF,YAAA;AACR,UAAA;AACY,UAAA;AACA,YAAA;AACH,YAAA;AACP,YAAA;AACM,YAAA;AACN,YAAA;AACA,YAAA;AACA,YAAA;AACY,YAAA;AACA,YAAA;AACA,YAAA;AACR,YAAA;AACA,YAAA;AACL,UAAA;AACH,QAAA;AACF,MAAA;AAGmC,IAAA;AACnB,IAAA;AACF,IAAA;AACN,MAAA;AACS,MAAA;AACD,MAAA;AACE,MAAA;AACpB,IAAA;AACyB,IAAA;AACL,MAAA;AACN,MAAA;AACH,MAAA;AACO,QAAA;AACE,QAAA;AAClB,MAAA;AACa,MAAA;AACD,MAAA;AACM,MAAA;AACJ,MAAA;AACI,MAAA;AACF,MAAA;AACjB,IAAA;AAC0B,IAAA;AAGX,IAAA;AACD,MAAA;AACC,MAAA;AACI,QAAA;AACF,QAAA;AACP,QAAA;AACR,MAAA;AACF,IAAA;AACyB,IAAA;AACX,MAAA;AACI,MAAA;AACC,QAAA;AACH,QAAA;AACF,QAAA;AACG,QAAA;AACF,QAAA;AACE,QAAA;AACE,QAAA;AACH,QAAA;AACE,QAAA;AACTC,QAAAA;AACSA,QAAAA;AACT,QAAA;AACO,QAAA;AACA,QAAA;AACP,QAAA;AACC,QAAA;AACL,UAAA;AACQ,YAAA;AACA,YAAA;AACG,YAAA;AACD,YAAA;AACF,YAAA;AACI,YAAA;AACE,YAAA;AACZ,YAAA;AACS,YAAA;AACH,YAAA;AACG,YAAA;AACL,YAAA;AACN,UAAA;AACF,QAAA;AACD,MAAA;AACF,IAAA;AAGgB,IAAA;AACmB,IAAA;AACnB,MAAA;AACR,MAAA;AACI,QAAA;AACD,QAAA;AACC,QAAA;AACD,QAAA;AACF,QAAA;AACG,QAAA;AACK,QAAA;AACN,QAAA;AACO,QAAA;AACf,QAAA;AACK,QAAA;AACW,QAAA;AACA,QAAA;AAClB,MAAA;AACD,IAAA;AAC6B,IAAA;AAC5BV,MAAAA;AACY,MAAA;AACH,MAAA;AACC,MAAA;AAGI,QAAA;AACK,QAAA;AAChB,MAAA;AACH,IAAA;AACwB,IAAA;AAErB,MAAA;AAES,QAAA;AACF,QAAA;AACE,QAAA;AACF,QAAA;AACE,QAAA;AACO,QAAA;AACP,QAAA;AACO,QAAA;AACF,QAAA;AACb,MAAA;AACN,IAAA;AAEmC,IAAA;AACnB,IAAA;AACE,MAAA;AACF,QAAA;AACI,QAAA;AACF,UAAA;AACJ,YAAA;AACF,YAAA;AACO,YAAA;AACD,YAAA;AACA,YAAA;AACE,YAAA;AACA,YAAA;AACD,YAAA;AACb,UAAA;AACJ,MAAA;AAG2B,IAAA;AACT,IAAA;AACF,MAAA;AACE,MAAA;AACJ,MAAA;AACF,MAAA;AACA,MAAA;AACU,MAAA;AACT,MAAA;AACL,QAAA;AACS,QAAA;AACF,QAAA;AACA,QAAA;AACE,QAAA;AACA,QAAA;AACH,QAAA;AACF,UAAA;AACA,UAAA;AACD,UAAA;AACA,UAAA;AACP,UAAA;AACM,UAAA;AACQ,UAAA;AACH,UAAA;AACD,UAAA;AACV,UAAA;AACA,UAAA;AACA,UAAA;AACY,UAAA;AACZA,UAAAA;AACA,UAAA;AACW,UAAA;AACD,UAAA;AACX,QAAA;AACH,MAAA;AACF,IAAA;AAGqC,IAAA;AACrB,IAAA;AACH,MAAA;AACK,MAAA;AACA,MAAA;AACF,MAAA;AACF,MAAA;AACC,MAAA;AACC,MAAA;AACE,MAAA;AACD,QAAA;AACP,QAAA;AACU,QAAA;AACX,UAAA;AACI,UAAA;AACD,UAAA;AACA,UAAA;AACQ,UAAA;AACA,UAAA;AACT,UAAA;AACC,UAAA;AACO,UAAA;AACC,UAAA;AACA,UAAA;AACJ,UAAA;AACV,UAAA;AACA,UAAA;AACD,QAAA;AACH,MAAA;AACF,IAAA;AAG6B,IAAA;AACT,IAAA;AACJ,MAAA;AACA,MAAA;AACI,QAAA;AACF,QAAA;AACC,QAAA;AACD,QAAA;AACF,QAAA;AACI,QAAA;AACD,UAAA;AACC,UAAA;AACA,UAAA;AACF,UAAA;AACN,UAAA;AACK,UAAA;AACA,UAAA;AACE,YAAA;AACL,YAAA;AACA,YAAA;AACA,YAAA;AACA,YAAA;AACA,YAAA;AACAW,YAAAA;AACA,YAAA;AACA,YAAA;AACM,YAAA;AACH,cAAA;AACJ,cAAA;AACI,cAAA;AACF,cAAA;AACL,cAAA;AACA,cAAA;AACM,cAAA;AACN,cAAA;AACA,cAAA;AACA,cAAA;AACO,cAAA;AACP,cAAA;AACIA,cAAAA;AACD,cAAA;AACJ,YAAA;AACD,YAAA;AACF,UAAA;AACU,UAAA;AACG,UAAA;AACT,UAAA;AACAC,UAAAA;AACA,UAAA;AACQ,UAAA;AAEJ,YAAA;AACK,YAAA;AACL,YAAA;AACA,YAAA;AACK,YAAA;AACL,YAAA;AACR,UAAA;AACY,UAAA;AACP,YAAA;AACH,YAAA;AACA,YAAA;AACM,YAAA;AACN,YAAA;AACA,YAAA;AACA,YAAA;AAAA;AAEY,YAAA;AACN,YAAA;AACKA,YAAAA;AACR,YAAA;AACJ,UAAA;AACH,QAAA;AACD,MAAA;AACH,IAAA;AAKsB,IAAA;AACJ,MAAA;AACb,MAAA;AACQ,MAAA;AACA,MAAA;AACA,MAAA;AAAmE;AAE5D,MAAA;AACH,MAAA;AACC,QAAA;AACA,QAAA;AACf,MAAA;AACa,MAAA;AAChB,IAAA;AACmD,IAAA;AAC/B,MAAA;AACJ,MAAA;AACE,MAAA;AACH,MAAA;AACE,MAAA;AACF,MAAA;AACC,QAAA;AACH,QAAA;AACV,MAAA;AACH,IAAA;AACkB,IAAA;AACQ,IAAA;AAMN,IAAA;AAEJX,IAAAA;AACE,MAAA;AACA,MAAA;AACK,MAAA;AACP,MAAA;AACI,MAAA;AACD,MAAA;AACF,QAAA;AACD,UAAA;AACA,UAAA;AACI,UAAA;AAChB,QAAA;AACe,MAAA;AACnB,IAAA;AACgB,IAAA;AACA,MAAA;AACP,MAAA;AACF,QAAA;AACH,QAAA;AACA,QAAA;AACY,QAAA;AACD,QAAA;AACG,QAAA;AACd,QAAA;AACG,QAAA;AACL,MAAA;AACF,IAAA;AAC2B,IAAA;AACV,IAAA;AAEuF,IAAA;AAGzF,IAAA;AACA,MAAA;AACK,QAAA;AACH,UAAA;AACE,0BAAA;AACf,QAAA;AACF,MAAA;AAGkB,IAAA;AACA,MAAA;AACV,MAAA;AACQ,MAAA;AACA,MAAA;AACD,QAAA;AACG,QAAA;AACD,QAAA;AACP,QAAA;AACK,QAAA;AACD,QAAA;AACI,UAAA;AACd,UAAA;AACF,QAAA;AACgB,QAAA;AACJ,QAAA;AACU,QAAA;AACL,UAAA;AACH,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AACd,QAAA;AACW,QAAA;AACA,QAAA;AACE,wBAAA;AACf,MAAA;AACF,IAAA;AAIgB,IAAA;AACE,MAAA;AACD,QAAA;AACF,QAAA;AACE,QAAA;AACD,QAAA;AACI,UAAA;AACd,UAAA;AACF,QAAA;AACgB,QAAA;AACJ,QAAA;AACW,QAAA;AACP,QAAA;AAEA,QAAA;AACD,UAAA;AACA,UAAA;AACD,UAAA;AAGd,QAAA;AACgB,QAAA;AAGA,QAAA;AACR,UAAA;AACA,UAAA;AACK,UAAA;AACb,QAAA;AAEgB,QAAA;AAEH,QAAA;AACC,QAAA;AACH,QAAA;AACA,QAAA;AACE,wBAAA;AACf,MAAA;AAG+B,IAAA;AAC5B,IAAA;AACa,MAAA;AACD,QAAA;AACE,QAAA;AACJ,QAAA;AACK,UAAA;AACT,UAAA;AACQ,UAAA;AACC,UAAA;AAChB,QAAA;AACM,QAAA;AACK,QAAA;AACC,UAAA;AACJ,UAAA;AACO,UAAA;AACC,UAAA;AACJ,UAAA;AACJ,UAAA;AACI,UAAA;AACE,UAAA;AACD,UAAA;AACG,UAAA;AACF,UAAA;AACU,UAAA;AACR,YAAA;AACP,YAAA;AACA,YAAA;AACK,YAAA;AACA,YAAA;AACA,YAAA;AACZ,UAAA;AACW,UAAA;AACE,0BAAA;AACC,UAAA;AACR,UAAA;AACQ,UAAA;AACF,UAAA;AACJ,YAAA;AACH,YAAA;AACM,YAAA;AACD,YAAA;AACF,YAAA;AACK,YAAA;AACX,YAAA;AACM,YAAA;AACO,YAAA;AACT,YAAA;AACL,UAAA;AACU,UAAA;AACb,QAAA;AACF,MAAA;AAC4B,IAAA;AAIF,IAAA;AACX,MAAA;AACG,MAAA;AACpB,IAAA;AAEgB,IAAA;AACE,MAAA;AACb,MAAA;AAEQ,MAAA;AAEQ,QAAA;AACC,QAAA;AACA,QAAA;AACjB,MAAA;AACgB,MAAA;AACrB,IAAA;AACK,IAAA;AACe,MAAA;AACF,QAAA;AACJ,QAAA;AACK,QAAA;AACF,QAAA;AACC,QAAA;AACE,QAAA;AAEH,QAAA;AACG,QAAA;AACR,QAAA;AACO,QAAA;AACC,QAAA;AAGF,QAAA;AACA,QAAA;AAEE,QAAA;AACL,UAAA;AACG,UAAA;AACL,UAAA;AACT,QAAA;AAEe,QAAA;AACC,QAAA;AAEA,QAAA;AAEN,UAAA;AACG,YAAA;AACA,YAAA;AACX,UAAA;AACM,UAAA;AACF,UAAA;AACO,UAAA;AACb,QAAA;AACa,QAAA;AACF,QAAA;AACb,MAAA;AAG+B,IAAA;AACd,MAAA;AACH,MAAA;AACE,MAAA;AACF,MAAA;AACD,MAAA;AACI,MAAA;AACH,MAAA;AACG,MAAA;AACK,MAAA;AACL,QAAA;AACD,QAAA;AACCF,QAAAA;AACD,QAAA;AAChB,MAAA;AACW,MAAA;AACO,sBAAA;AACF,MAAA;AACF,MAAA;AACA,MAAA;AACG,MAAA;AAClB,IAAA;AAGa,IAAA;AACI,MAAA;AACR,MAAA;AACU,MAAA;AACA,MAAA;AACD,MAAA;AACD,MAAA;AACjB,IAAA;AAGe,IAAA;AACmC,IAAA;AAC/B,MAAA;AACJ,MAAA;AACE,MAAA;AACD,MAAA;AACjB,IAAA;AACkB,IAAA;AACC,IAAA;AACA,IAAA;AACD,IAAA;AAEJ,IAAA;AACA,MAAA;AACI,MAAA;AACD,QAAA;AACG,QAAA;AACR,QAAA;AACM,QAAA;AACE,UAAA;AACH,UAAA;AACA,UAAA;AACZ,QAAA;AACH,MAAA;AACc,MAAA;AAChB,IAAA;AAEO,IAAA;AACC,MAAA;AACO,MAAA;AACN,MAAA;AACC,MAAA;AACE,MAAA;AACF,MAAA;AACI,MAAA;AACJ,MAAA;AACC,MAAA;AACC,MAAA;AACD,MAAA;AACD,MAAA;AACD,MAAA;AACP,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACS,MAAA;AACT,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACO,MAAA;AACP,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACF,IAAA;AAEmC,IAAA;AACjB,MAAA;AACC,MAAA;AACnB,IAAA;AACF,EAAA;AAGoB,EAAA;AACE,IAAA;AACH,MAAA;AACA,MAAA;AACD,MAAA;AAChB,IAAA;AACO,IAAA;AACT,EAAA;AACF;Ab+LwB;AACA;Acr0Hc;AASxB;AACP,EAAA;AACA,EAAA;AACC,EAAA;AACA,EAAA;AACC,EAAA;AACC,EAAA;AACH,EAAA;AACC,EAAA;AACA,EAAA;AACC,EAAA;AACC,EAAA;AACF,EAAA;AACG,EAAA;AACF,EAAA;AACA,EAAA;AACD,EAAA;AACA,EAAA;AACC,EAAA;AACT;AAGwB;AAoCC;AACD,EAAA;AACA,EAAA;AACe,EAAA;AACrB,EAAA;AACS,EAAA;AAEA,EAAA;AACI,EAAA;AAED,EAAA;AACP,EAAA;AAEO,IAAA;AAEA,IAAA;AAEX,IAAA;AACC,IAAA;AACE,MAAA;AACT,QAAA;AACS,UAAA;AACE,UAAA;AACD,YAAA;AACA,YAAA;AACC,YAAA;AACd,UAAA;AACA,UAAA;AACG,QAAA;AACU,QAAA;AACD,UAAA;AACE,UAAA;AACF,UAAA;AACF,UAAA;AACJ,UAAA;AACQ,YAAA;AACN,YAAA;AACA,YAAA;AAEI,YAAA;AACH,cAAA;AACK,cAAA;AACA,YAAA;AACZ,YAAA;AACF,UAAA;AACc,UAAA;AACR,UAAA;AACK,UAAA;AACY,UAAA;AACZ,UAAA;AACC,UAAA;AACZ,UAAA;AACF,QAAA;AACK,QAAA;AACW,UAAA;AACA,YAAA;AACd,UAAA;AACG,QAAA;AACU,UAAA;AACb,UAAA;AACG,QAAA;AACS,UAAA;AACZ,UAAA;AACG,QAAA;AACS,UAAA;AACZ,UAAA;AACG,QAAA;AAEQ,UAAA;AACX,UAAA;AACF,QAAA;AACE,UAAA;AACJ,MAAA;AACF,IAAA;AACgB,IAAA;AACjB,EAAA;AACoB,EAAA;AACvB;AAMmB;AAsBS;AACP,EAAA;AACU,EAAA;AACT,EAAA;AACF,EAAA;AACX,EAAA;AAAA;AAEL,IAAA;AACA,IAAA;AACA,IAAA;AACiB,IAAA;AACjB,IAAA;AACe,IAAA;AACf,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACe,IAAA;AAAe;AAE9B,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAAA;AAEA,IAAA;AACA,IAAA;AACA,IAAA;AAAoD;AAEpD,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AAA4L;AAE5L,IAAA;AACA,IAAA;AAAmF;AAEnF,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACgB,IAAA;AAChB,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACO,EAAA;AACX;AAGwB;AACH,EAAA;AACX,EAAA;AACU,EAAA;AACP,EAAA;AACS,EAAA;AACC,EAAA;AACvB;AAU+B;AACT,EAAA;AACE,EAAA;AACF,EAAA;AACA,EAAA;AACJ,EAAA;AAEK,EAAA;AACH,EAAA;AACA,EAAA;AACJ,EAAA;AACK,EAAA;AACA,EAAA;AACJ,EAAA;AACK,EAAA;AACE,EAAA;AACJ,EAAA;AACA,EAAA;AACJ,EAAA;AACQ,EAAA;AAER,EAAA;AACG,IAAA;AACA,IAAA;AACS,IAAA;AACP,IAAA;AACV,IAAA;AACT,EAAA;AAEgC,EAAA;AACf,IAAA;AACA,IAAA;AACC,IAAA;AACT,IAAA;AACT,EAAA;AACiBc,EAAAA;AACC,IAAA;AACA,IAAA;AACJ,IAAA;AACOA,IAAAA;AACAA,IAAAA;AACD,IAAA;AACJ,MAAA;AACI,MAAA;AACT,MAAA;AACT,IAAA;AACkB,IAAA;AACC,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACJ,MAAA;AACE,QAAA;AACD,QAAA;AACL,QAAA;AACT,MAAA;AACiB,MAAA;AACA,MAAA;AACV,MAAA;AACT,IAAA;AACmB,IAAA;AACA,IAAA;AACF,IAAA;AACA,IAAA;AACC,IAAA;AACC,IAAA;AACH,IAAA;AACT,IAAA;AACT,EAAA;AAEiB,EAAA;AACA,EAAA;AACK,EAAA;AACA,EAAA;AACL,EAAA;AAEA,EAAA;AAEa,EAAA;AACb,IAAA;AACA,IAAA;AACK,IAAA;AACA,IAAA;AACH,IAAA;AACD,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACC,IAAA;AACJ,IAAA;AACM,IAAA;AACA,IAAA;AACZ,IAAA;AACT,EAAA;AAEkB,EAAA;AACD,IAAA;AACK,IAAA;AACA,IAAA;AACL,IAAA;AACA,IAAA;AACR,IAAA;AACT,EAAA;AAEI,EAAA;AAC0B,EAAA;AACvB,EAAA;AACL,IAAA;AACc,IAAA;AACE,MAAA;AACJ,QAAA;AACQ,QAAA;AAClB,MAAA;AACM,MAAA;AACQ,MAAA;AACA,MAAA;AACT,MAAA;AACM,QAAA;AACA,QAAA;AACX,MAAA;AAE8B,MAAA;AAC1BhB,MAAAA;AACc,MAAA;AACD,QAAA;AACT,QAAA;AACM,QAAA;AACJ,QAAA;AACK,UAAA;AACJ,UAAA;AACP,UAAA;AACF,QAAA;AACK,QAAA;AACQ,QAAA;AACA,UAAA;AACN,UAAA;AACMA,UAAAA;AACb,QAAA;AACY,QAAA;AACd,MAAA;AACM,MAAA;AACR,IAAA;AACF,EAAA;AACF;AdquHwB;AACA;Ae3oIoB;AAAA;AAE5B,EAAA;AAA+E;AAE3E,EAAA;AAEd,IAAA;AACmB,IAAA;AACP,IAAA;AACb,EAAA;AAAA;AAEY,EAAA;AAA6C;AAE5C,EAAA;AAClB;Af4oIwB;AACA;AACA;AACA","file":"/Users/cardene/Desktop/projects/dragon-3715-release-0-76-0/packages/dragon/dist/light/pipe-EZX6P3SM.cjs","sourcesContent":[null,"/**\n * 換算の描き方 (#3389、#3398)。\n *\n * `calc` を行う関係者が 2 つ以上の槽を持つ時、最初の 2 つの槽の間に変換器を置き、短い管で両方の槽と結ぶ。\n * 変換器は全ての段に置き、計算した段だけ値の色で光る。入る値と出る値と比率は、その段の吹き出しが大きく書く。\n * この file は配管の図を描く部品 (`render/pipe.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeConverter } from \"../../kinds/pipe/layout\";\nimport { PIPE_LOOK } from \"../../look/pipe\";\nimport { r1 } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\n\n/** 変換器の印の大きさの元。印は半径がこの値の時の形で書き、半径に合わせて縮める */\nconst BASE = PIPE_LOOK.converter.r;\n\n/** 変換器。`attrs` は部品の印 */\nexport function converter(c: PipeConverter, attrs: string): string {\n const k = c.r / BASE;\n const at = (x: number, y: number): string => `${r1(c.cx + x * k)} ${r1(c.cy + y * k)}`;\n const swirl = `M ${at(-13, -7)} A ${r1(14 * k)} ${r1(14 * k)} 0 0 1 ${at(11, -10)} M ${at(13, 7)} A ${r1(14 * k)} ${r1(14 * k)} 0 0 1 ${at(-11, 10)}`;\n const tips = `M ${at(11, -16)} L ${at(12, -9)} L ${at(5, -10)} Z M ${at(-11, 16)} L ${at(-12, 9)} L ${at(-5, 10)} Z`;\n return (\n `<g${attrs} class=\"dg-pp-conv${c.active ? \" dg-pp-cur\" : \"\"}\" style=\"${cs(c.active ? \"amber\" : \"slate\")}\">` +\n `<path class=\"dg-pp-cstub\" d=\"M ${r1(c.left)} ${r1(c.cy)} H ${r1(c.cx - c.r)} M ${r1(c.cx + c.r)} ${r1(c.cy)} H ${r1(c.right)}\"/>` +\n `<circle class=\"dg-pp-cface\" cx=\"${r1(c.cx)}\" cy=\"${r1(c.cy)}\" r=\"${r1(c.r)}\"/><path class=\"dg-pp-cswirl\" d=\"${swirl}\"/><path class=\"dg-pp-ctip\" d=\"${tips}\"/></g>`\n );\n}\n","/**\n * 配管の図の弁が描く形を囲む四角と、取っ手の向き (#3418)。\n *\n * 弁は管の上の 2 つの三角 (胴) と、管から立つ軸と、軸の先の取っ手で描く (`blocks/hold/draw.ts` の `valve`)。\n * 取っ手は閉じた時に管と直角に立ち、開いた時に管の向きに倒れるため、両方の向きの四角を持つ。\n * 軸と取っ手は管の上 (縦の管は右) に立て、上の側にほかの線が通る弁は下 (縦の管は左) に立てる (`under`)。\n * 並べ方 (`kinds/pipe/layout.ts`) は弁の置き場所をほかの線から離す時に、決まりの表 (`pipe-rules.ts`) は弁とほかの線の間を測る時に、同じ四角を読む\n */\nimport type { Point, Rect } from \"./layout/scene\";\nimport { PIPE_LOOK } from \"./look/pipe\";\n\nconst V = PIPE_LOOK.valve;\n\n/** 取っ手の軸の点。管から `stem` 離れた所 */\nexport function valvePivot(x: number, y: number, vertical: boolean, under: boolean): Point {\n const s = under ? -1 : 1;\n return vertical ? [x + s * V.stem, y] : [x, y - s * V.stem];\n}\n\n/** 取っ手の向き (度)。閉じた取っ手は管と直角に外へ立ち、開いた取っ手は管の向き (横の管は右、縦の管は下) に倒れる */\nexport function valveLever(vertical: boolean, opened: boolean, under: boolean): number {\n if (opened) return vertical ? 90 : 0;\n if (vertical) return under ? 180 : 0;\n return under ? 90 : -90;\n}\n\n/** 弁の胴と、軸と閉じた取っ手と、開いた取っ手を囲む四角 */\nexport function valveRects(x: number, y: number, vertical: boolean, under = false): Rect[] {\n const h = V.leverH / 2;\n const [px, py] = valvePivot(x, y, vertical, under);\n const reach = V.stem + V.lever - h;\n if (vertical)\n return [\n { x: x - V.half, y: y - V.r, w: V.half * 2, h: V.r * 2 },\n under ? { x: x - reach, y: y - h, w: reach, h: V.leverH } : { x, y: y - h, w: reach, h: V.leverH },\n { x: px - h, y: py - h, w: V.leverH, h: V.lever },\n ];\n return [\n { x: x - V.r, y: y - V.half, w: V.r * 2, h: V.half * 2 },\n under ? { x: x - h, y, w: V.leverH, h: reach } : { x: x - h, y: y - reach, w: V.leverH, h: reach },\n { x: px - h, y: py - h, w: V.lever, h: V.leverH },\n ];\n}\n","/**\n * 取り消しの描き方 (#3389、#3398)。\n *\n * `revert` の段で、落ちた呼び出しの内側の変更 (槽、値の札、イベント、流れた分) は取り消しの印を付けて元の値へ戻る。\n * 戻った槽は桃色の縁で描き、取り消す前の水位に桃色の点線を引く。落ちた理由は、その段の吹き出しが桃色の縁で大きく書く。\n * この file は槽の描き方 (`hold/draw.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport { r1 } from \"../../render/parts\";\n\n/** 取り消す前の水位の線。槽の左の外から右の外まで */\nexport const undoneMark = (x1: number, x2: number, y: number): string =>\n `<line class=\"dg-pp-mark dg-pp-mark-rolled\" x1=\"${r1(x1)}\" y1=\"${r1(y)}\" x2=\"${r1(x2)}\" y2=\"${r1(y)}\"/>`;\n","/**\n * 槽と値の管の描き方 (#3389、#3398)。\n *\n * 残高は持ち主の槽で描く。ガラスの中に、つやと 5 本の目盛りとトークンの名前を描き、水位は量に比例させ、液の色はトークンごとに分ける。\n * 槽の下に 3 桁ごとに区切った大きな数 (今の残高) を書き、変わった段から確定するまで、その下に増えた分か減った分と暫定の語を添える。確定した段は確定の語を添える (#3418)。\n * 暫定の槽は増えた分を斜線で、減った分を点線の枠で示し、前の水位に点線を引く。確定した槽は緑の縁、取り消した槽は桃色の縁で描く。\n * 値の管は、持ち主の槽の横の口どうしを結ぶ折れ線で描く (#3418)。トークンの Contract は箱で描き、管の弁の真上に置いて軸で結ぶ。\n * `move` と `[value]` で流れた分は管に沿った点線と向きの印で描き、流れた段は斜線の液の塊が管を通り抜ける。暫定か確定かは管に残さず、点線か実線かと槽の斜線で示す。\n * 弁は 2 つの三角を向かい合わせた形で、取っ手が開くと管の向きに倒れる。弁と計器と名札は呼び出しの管と値の管の両方が使う。\n * 角を落とす色味 (#3344) では、槽とトークンの箱の右上と左下を落とし、つやと取っ手の角を丸めない。\n * この file は配管の図を描く部品 (`render/pipe.ts`) と配管の図のブロックの描き方だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeFlow, PipeLevel, PipeParty, PipeState, PipeTank, PipeText } from \"../../kinds/pipe/layout\";\nimport type { Point, Rect } from \"../../layout/scene\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport { valveLever, valvePivot } from \"../../pipe-valve\";\nimport { EASE, MOTION, type TextStyle } from \"../../look/values\";\nimport { frameShape, partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport type { Frame } from \"../../render/motion\";\nimport { type Ctx, r1, write } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport { undoneMark } from \"../revert/draw\";\n\nconst P = PIPE_LOOK;\nconst T = PIPE_TYPE;\n\n/** 印ごとの色の役。変わっていない物と暫定の物は値の色 */\nexport const STATE_COLOR = { none: \"amber\", provisional: \"amber\", final: \"green\", rolled: \"rose\" } as const satisfies Record<PipeState, string>;\n\n/** 図の中の定義の名札。図ごとに分ける */\nexport const defId = (ctx: Ctx, what: string): string => `dg-p${what}-${ctx.id}`;\n/** 槽の内側を切り抜く形の名札 */\nconst clipId = (ctx: Ctx, t: Pick<PipeTank, \"party\" | \"token\">): string => defId(ctx, `c-${`${t.party}-${t.token}`.replace(/[^\\w-]/gu, \"_\")}`);\n\n/**\n * 配管の図の定義。地の点、トークンの液の色ごとの斜線、液の深さの陰、丸の名札の色の移り、槽の内側の切り抜き。\n * 液の色は `--pp-tone<番号>` の変数で、配管の図の規則 (`render/pipe.ts`) が値の色から作る\n */\nexport function pipeDefs(ctx: Ctx, tanks: readonly PipeTank[]): string {\n const s = P.flow.stripe;\n const hatches = [0, 1, 2]\n .map(\n (k) =>\n `<pattern id=\"${defId(ctx, `h${k}`)}\" width=\"${s}\" height=\"${s}\" patternUnits=\"userSpaceOnUse\" patternTransform=\"rotate(45)\">` +\n `<rect class=\"dg-pp-hb\" style=\"--pp-t:var(--pp-tone${k})\" width=\"${s}\" height=\"${s}\"/><line class=\"dg-pp-hl\" style=\"--pp-t:var(--pp-tone${k})\" x1=\"0\" y1=\"0\" x2=\"0\" y2=\"${s}\"/></pattern>`,\n )\n .join(\"\");\n const top = Math.min(...tanks.map((t) => t.y), 0);\n const bottom = Math.max(...tanks.map((t) => t.y + t.h), 1);\n const clips = tanks\n .map((t) => {\n const pad = P.tank.pad;\n const inner = { x: t.x + pad, y: t.y + pad, w: t.w - pad * 2, h: t.h - pad * 2 };\n return `<clipPath id=\"${clipId(ctx, t)}\">${frameShape(ctx.corner, \"\", inner, `<rect x=\"${r1(inner.x)}\" y=\"${r1(inner.y)}\" width=\"${r1(inner.w)}\" height=\"${r1(inner.h)}\" rx=\"${P.tank.innerRadius}\"/>`)}</clipPath>`;\n })\n .join(\"\");\n return (\n `<pattern id=\"${defId(ctx, \"grid\")}\" width=\"${P.grid.step}\" height=\"${P.grid.step}\" patternUnits=\"userSpaceOnUse\"><circle class=\"dg-pp-gdot\" cx=\"${P.grid.dot}\" cy=\"${P.grid.dot}\" r=\"${P.grid.dot}\"/></pattern>` +\n hatches +\n `<linearGradient id=\"${defId(ctx, \"deep\")}\" gradientUnits=\"userSpaceOnUse\" x1=\"0\" y1=\"${r1(top)}\" x2=\"0\" y2=\"${r1(bottom)}\"><stop offset=\"0\" class=\"dg-pp-d0\"/><stop offset=\"1\" class=\"dg-pp-d1\"/></linearGradient>` +\n `<linearGradient id=\"${defId(ctx, \"av\")}\" x1=\"0\" y1=\"0\" x2=\"1\" y2=\"1\"><stop offset=\"0\" class=\"dg-pp-a0\"/><stop offset=\"1\" class=\"dg-pp-a1\"/></linearGradient>` +\n clips\n );\n}\n\n/** 地の点 */\nexport const grid = (ctx: Ctx, width: number, height: number): string =>\n `<rect class=\"dg-pp-grid\" fill=\"url(#${defId(ctx, \"grid\")})\" x=\"0\" y=\"0\" width=\"${r1(width)}\" height=\"${r1(height)}\"/>`;\n\n/** 字。並べ方が字の大きさを替えた時 (狭い枠の大きな字) は、その大きさを字に書く */\nexport function sizedText(ctx: Ctx, cls: string, t: PipeText, style: TextStyle, shown: Shown[]): string {\n const drawn = write(ctx.ink, cls, t.x, t.base, t.text, { ...style, size: t.h }, shown);\n return Math.abs(t.h - style.size) < 0.05 ? drawn : drawn.replace(\"<text \", `<text style=\"font-size:${r1(t.h)}px\" `);\n}\n\n/** 四角 */\nconst rect = (cls: string, r: Rect, radius: number, extra = \"\"): string =>\n `<rect class=\"${cls}\" x=\"${r1(r.x)}\" y=\"${r1(r.y)}\" width=\"${r1(Math.max(0, r.w))}\" height=\"${r1(Math.max(0, r.h))}\" rx=\"${radius}\"${extra}/>`;\n/** 箱の形。角を落とす色味では右上と左下を落とした形で描く */\nconst frame = (ctx: Ctx, cls: string, r: Rect, radius: number, extra = \"\"): string => frameShape(ctx.corner, ` class=\"${cls}\"${extra}`, r, rect(cls, r, radius, extra));\n\n/**\n * 槽。ガラスと、中に入れる水 (`inside`) と、液の深さの陰と、つやと目盛りとトークンの名前。\n * `edge` は縁の色 (`final` は確定、`rolled` は取り消し、空は変わらない縁)\n */\nexport function tank(t: PipeTank, edge: \"final\" | \"rolled\" | \"\", inside: string, ctx: Ctx, shown: Shown[], attrs: string): string {\n const h = t.h;\n const ticks = Array.from({ length: P.tank.tick.count - 1 }, (_, k) => {\n const y = t.y + ((k + 1) * h) / P.tank.tick.count;\n return `<line class=\"dg-pp-tick\" data-pipe-tick=\"\" x1=\"${r1(t.x + t.w - P.tank.tick.from)}\" y1=\"${r1(y)}\" x2=\"${r1(t.x + t.w - P.tank.tick.to)}\" y2=\"${r1(y)}\"/>`;\n }).join(\"\");\n const pad = P.tank.pad;\n return (\n `<g${attrs}${edge ? ` style=\"${cs(edge === \"final\" ? \"green\" : \"rose\")}\"` : \"\"}>` +\n frame(ctx, `dg-pp-glass${edge ? \" dg-pp-glass-on\" : \"\"}`, t, P.tank.radius) +\n inside +\n `<rect class=\"dg-pp-deep\" fill=\"url(#${defId(ctx, \"deep\")})\" clip-path=\"url(#${clipId(ctx, t)})\" x=\"${r1(t.x + pad)}\" y=\"${r1(t.y + pad)}\" width=\"${r1(t.w - pad * 2)}\" height=\"${r1(h - pad * 2)}\"/>` +\n rect(\"dg-pp-shine\", { x: t.x + P.tank.shine.x, y: t.y + P.tank.shine.y, w: P.tank.shine.w, h: h - P.tank.shine.short }, partRadius(ctx.corner, P.tank.shine.w / 2), ' data-pipe-shine=\"\"') +\n ticks +\n write(ctx.ink, \"dg-pp-tok\", t.title.x, t.title.base, t.title.text, T.tankTitle, shown) +\n `</g>`\n );\n}\n\n/**\n * 水と、槽の下の数と、増えた分か減った分と語。`at` を渡すと、その時刻に水が段の始まりの水位 (`from`) から今の水位へ動く。\n * 暫定で増えた分は斜線の帯が下から伸び、暫定で減った分は液が縮んで点線の枠が残り、ほかは水面がそのまま上下する。\n * 水は切り抜きの下の端より下まで伸ばし、下がる時にも底が空かないようにする\n */\nexport function level(lv: PipeLevel, t: PipeTank, ctx: Ctx, shown: Shown[], attrs: string, at?: number): string {\n const bottom = t.y + t.h - P.tank.pad;\n const deep = t.h;\n const tone = `--pp-t:var(--pp-tone${t.tone})`;\n const body = (top: number, cls = \"dg-pp-liq\", extra = \"\"): string =>\n `<rect class=\"${cls}\" style=\"${tone}\" x=\"${r1(lv.x)}\" y=\"${r1(top)}\" width=\"${r1(lv.w)}\" height=\"${r1(bottom - top + deep)}\"${extra}/>`;\n const now = lv.y;\n const old = lv.base?.y;\n const from = at === undefined ? undefined : lv.from;\n /** 時刻 `at` から `transform` を `a` から `b` へ動かす部品。`oy` は伸び縮みの元の高さ */\n const moving = (markup: string, a: string, b: string, oy: number): string => {\n if (at === undefined) return markup;\n const frames: Frame[] = [\n [0, { transform: a }],\n [at, { transform: a }, EASE.out],\n [at + MOTION.pipe.level, { transform: b }],\n [ctx.m.total, { transform: b }],\n ];\n return `<g class=\"dg-a\" style=\"transform-origin:${r1(lv.x + lv.w / 2)}px ${r1(oy)}px;${ctx.m.kf(frames)}\">${markup}</g>`;\n };\n const parts: string[] = [];\n if (lv.state === \"provisional\" && old !== undefined && lv.h > (lv.base?.h ?? 0)) {\n const hat = `<rect class=\"dg-pp-hat\" fill=\"url(#${defId(ctx, `h${t.tone}`)})\" x=\"${r1(lv.x)}\" y=\"${r1(now)}\" width=\"${r1(lv.w)}\" height=\"${r1(old - now + 1)}\"/>`;\n parts.push(body(old), from ? moving(hat, \"scaleY(0)\", \"scaleY(1)\", old) : hat);\n } else if (lv.state === \"provisional\" && old !== undefined && lv.h < (lv.base?.h ?? 0)) {\n parts.push(lv.h > 0 ? body(now) : \"\");\n if (from && from.y < now)\n parts.push(moving(`<rect class=\"dg-pp-liq\" style=\"${tone}\" x=\"${r1(lv.x)}\" y=\"${r1(from.y)}\" width=\"${r1(lv.w)}\" height=\"${r1(now - from.y + 1)}\"/>`, \"scaleY(1)\", \"scaleY(0)\", now));\n parts.push(`<rect class=\"dg-pp-ghost\" x=\"${r1(lv.x)}\" y=\"${r1(old)}\" width=\"${r1(lv.w)}\" height=\"${r1(now - old)}\"/>`);\n } else if (from) parts.push(moving(body(now), `translateY(${r1(from.y - now)}px)`, \"translateY(0)\", now));\n else if (lv.h > 0) parts.push(body(now));\n const water = `<g clip-path=\"url(#${clipId(ctx, t)})\">${parts.join(\"\")}</g>`;\n const marks: string[] = [];\n if (old !== undefined && lv.state === \"provisional\")\n marks.push(`<line class=\"dg-pp-mark\" x1=\"${r1(t.x - P.tank.markOut)}\" y1=\"${r1(old)}\" x2=\"${r1(t.x + t.w + P.tank.markOut)}\" y2=\"${r1(old)}\"/>`);\n if (old !== undefined && lv.state === \"rolled\") marks.push(undoneMark(t.x - P.tank.markOut, t.x + t.w + P.tank.markOut, old));\n const sub =\n (lv.delta ? write(ctx.ink, \"dg-pp-dlt\", lv.delta.x, lv.delta.base, lv.delta.text, T.delta, shown) : \"\") +\n (lv.tag ? write(ctx.ink, \"dg-pp-tagw\", lv.tag.x, lv.tag.base, lv.tag.text, T.tag, shown) : \"\");\n return (\n `<g${attrs} class=\"dg-pp-lv dg-pp-lv-${lv.state}\" style=\"${cs(STATE_COLOR[lv.state])}\">${water}${marks.join(\"\")}` +\n `${sizedText(ctx, \"dg-pp-num\", lv.text, T.amount, shown)}${sub}</g>`\n );\n}\n\n/** 値の管。持ち主の槽の横の口どうしを結ぶ折れ線を、外の管と中の管の 2 本で描く。`attrs` は部品の印 (`data-pipe-value` など) */\nexport function valuePipe(points: readonly Point[], attrs = \"\"): string {\n const d = `M ${points.map((p) => `${r1(p[0])} ${r1(p[1])}`).join(\" L \")}`;\n return `<g${attrs}><path class=\"dg-pp-pcase\" d=\"${d}\"/><path class=\"dg-pp-pcore\" d=\"${d}\"/></g>`;\n}\n\n/**\n * 弁。2 つの三角を向かい合わせた形と、軸と取っ手。`vertical` は縦に走る管の弁。\n * 取っ手は閉じた時に管と直角に立ち、開いた時に管の向きに倒れる。`turn` を渡すと取っ手がその style の動きで回り、`open` を渡すとその style の間だけ弁が開いた色になる。\n * `under` は軸と取っ手を管の下 (縦の管は左) に立てる。\n * `ctx` は取っ手の角の形を読む。\n * `attrs` は取っ手の印 (`data-pipe-lever` など)\n */\nexport function valve(x: number, y: number, vertical: boolean, opened: boolean, attrs: string, ctx: Ctx, turn = \"\", open = \"\", under = false): string {\n const V = P.valve;\n const body = vertical\n ? `M ${r1(x - V.half)} ${r1(y - V.r)} L ${r1(x + V.half)} ${r1(y - V.r)} L ${r1(x)} ${r1(y)} Z M ${r1(x - V.half)} ${r1(y + V.r)} L ${r1(x + V.half)} ${r1(y + V.r)} L ${r1(x)} ${r1(y)} Z`\n : `M ${r1(x - V.r)} ${r1(y - V.half)} L ${r1(x - V.r)} ${r1(y + V.half)} L ${r1(x)} ${r1(y)} Z M ${r1(x + V.r)} ${r1(y - V.half)} L ${r1(x + V.r)} ${r1(y + V.half)} L ${r1(x)} ${r1(y)} Z`;\n const [px, py] = valvePivot(x, y, vertical, under);\n const angle = leverAngle(vertical, opened, under);\n const origin = `transform-origin:${r1(px)}px ${r1(py)}px`;\n const lever = `<rect class=\"dg-pp-lever\" x=\"${r1(px - V.leverH / 2)}\" y=\"${r1(py - V.leverH / 2)}\" width=\"${V.lever}\" height=\"${V.leverH}\" rx=\"${partRadius(ctx.corner, V.leverH / 2)}\"/>`;\n const turned = turn ? `<g${attrs} class=\"dg-a\" style=\"${origin};${turn}\">${lever}</g>` : `<g${attrs} transform=\"rotate(${angle} ${r1(px)} ${r1(py)})\">${lever}</g>`;\n return (\n `<g class=\"dg-pp-vlv\"><line class=\"dg-pp-vstem\" x1=\"${r1(x)}\" y1=\"${r1(y)}\" x2=\"${r1(px)}\" y2=\"${r1(py)}\"/>${turned}` +\n `<circle class=\"dg-pp-pivot\" cx=\"${r1(px)}\" cy=\"${r1(py)}\" r=\"${V.pivot}\"/><path class=\"dg-pp-vbody\" d=\"${body}\"/>` +\n (open ? `<path class=\"dg-pp-vbody dg-pp-vopen dg-a\" style=\"${open}\" d=\"${body}\"/>` : opened ? `<path class=\"dg-pp-vbody dg-pp-vopen\" d=\"${body}\"/>` : \"\") +\n `</g>`\n );\n}\n\n/** 取っ手の向き (度)。閉じた取っ手は管と直角、開いた取っ手は管の向き。向きの決め方は弁の形と共に `pipe-valve.ts` が持つ */\nexport const leverAngle = (vertical: boolean, opened: boolean, under = false): number => valveLever(vertical, opened, under);\n\n/** トークンの箱。名前と、弁から箱へ上る軸。箱の中の値は値の札の描き方 (`write/draw.ts`) が描く。名前は関係者の名前と同じく `dg-sn` も持つ */\nexport function tokenBox(p: PipeParty, on: boolean, valveAt: Point | undefined, ctx: Ctx, shown: Shown[], attrs: string): string {\n const cx = p.x + p.w / 2;\n const stem = valveAt ? `<line class=\"dg-pp-tstem\" x1=\"${r1(cx)}\" y1=\"${r1(valveAt[1] - P.bus.valveUp)}\" x2=\"${r1(cx)}\" y2=\"${r1(p.y + p.h / 2)}\"/>` : \"\";\n return (\n `<g${attrs} class=\"dg-pp-tokv${on ? \" dg-pp-on\" : \"\"}\">${stem}${frame(ctx, \"dg-pp-act\", p, P.token.radius)}` +\n `${write(ctx.ink, \"dg-sn dg-pp-actn\", p.label.x, p.label.base, p.label.text, T.party, shown)}</g>`\n );\n}\n\n/** 点の並びの上の、始まりから `d` 進んだ所 */\nexport function pointAlong(points: readonly Point[], d: number): Point {\n let left = d;\n for (let i = 1; i < points.length; i++) {\n const a = points[i - 1] as Point;\n const b = points[i] as Point;\n const len = Math.hypot(b[0] - a[0], b[1] - a[1]);\n if (left <= len || i === points.length - 1) {\n const k = len === 0 ? 0 : Math.min(1, left / len);\n return [a[0] + (b[0] - a[0]) * k, a[1] + (b[1] - a[1]) * k];\n }\n left -= len;\n }\n return points[0] ?? [0, 0];\n}\n\n/**\n * 流れた分。管に沿った点線と向きの印。暫定の分は点線、確定した分は実線、取り消した分は桃色で描く。\n * `at` を渡すと、その時刻に斜線の液の塊が管の始まりから終わりへ通り抜ける。塊は `data-pipe-slug` と段の番号を持つ。`attrs` は部品の印。\n * 塊は管の道筋を長さ 1 と数えた破線の 1 本で、破線のずれを動かして送る。折れた管でも向きを計算せずに道筋どおり曲がるため (試作の4配管と同じ作り)\n */\nexport function flow(f: PipeFlow, ctx: Ctx, attrs: string, at?: number): string {\n const d = `M ${f.points.map((p) => `${r1(p[0])} ${r1(p[1])}`).join(\" L \")}`;\n const a = P.flow.chevron;\n const { x, y, dir, vertical } = f.arrow;\n const chevron = vertical\n ? `M ${r1(x - a)} ${r1(y - a * dir * 0.7)} l ${a} ${r1(a * dir * 1.15)} l ${a} ${r1(-a * dir * 1.15)}`\n : `M ${r1(x - a * dir * 0.7)} ${r1(y - a)} l ${r1(a * dir * 1.15)} ${a} l ${r1(-a * dir * 1.15)} ${a}`;\n const tone = `--pp-t:var(--pp-tone${f.tone})`;\n let blob = \"\";\n if (at !== undefined) {\n // 塊が管の始まりの手前に隠れている時のずれと、終わりの先へ抜けた時のずれ\n const before = P.flow.slug;\n const after = -1;\n const end = at + MOTION.pipe.slug;\n const frames: Frame[] = [\n [0, { opacity: 0, \"stroke-dashoffset\": before }],\n [at, { opacity: 0, \"stroke-dashoffset\": before }, EASE.inOut],\n [at + MOTION.pipe.slug * 0.15, { opacity: 1 }],\n [end - MOTION.pipe.slug * 0.15, { opacity: 1 }],\n [end, { \"stroke-dashoffset\": after }],\n [end + MOTION.fade, { opacity: 0 }],\n [ctx.m.total, { opacity: 0, \"stroke-dashoffset\": after }],\n ];\n blob = `<path class=\"dg-pp-slug dg-a\" data-pipe-slug=\"\" data-pipe-step=\"${f.step}\" pathLength=\"1\" stroke=\"url(#${defId(ctx, `h${f.tone}`)})\" style=\"${tone};${ctx.m.kf(frames)}\" d=\"${d}\"/>`;\n }\n return (\n `<g${attrs} class=\"dg-pp-trace dg-pp-trace-${f.state}\" style=\"${tone};${cs(STATE_COLOR[f.state])}\">` +\n `<path class=\"dg-pp-tline\" d=\"${d}\"/><path class=\"dg-pp-chev\" d=\"${chevron}\"/>${blob}</g>`\n );\n}\n\n/** 点の並びの最後を `cut` だけ手前で止める。矢じりの先と線の端を重ねないため */\nexport function shortened(points: Point[], cut: number): Point[] {\n const out = points.map((p): Point => [p[0], p[1]]);\n const last = out[out.length - 1] as Point;\n const before = out[out.length - 2] as Point;\n const len = Math.hypot(last[0] - before[0], last[1] - before[1]) || 1;\n out[out.length - 1] = [last[0] - ((last[0] - before[0]) / len) * cut, last[1] - ((last[1] - before[1]) / len) * cut];\n return out;\n}\n","/**\n * 値の札の描き方 (#3389、#3398)。\n *\n * 残高でない値は値の札で描く。トークンの Contract が持つ値は、トークンの箱の中の名前の下に値の名前と値を 1 行ずつ書き、\n * 書き替えた値は前の値を消し線で残して矢印で今の値へつなぐ。ほかの関係者の値は、持ち主の槽の並びに札を置き、名前と大きな値を書き、\n * 書き替えた値は札の下に前の値を消し線で残して暫定か確定か取り消しの語を添える。確定した札は緑の縁、取り消した札は桃色の縁で描く。\n * `write` の段では、書いた者の名札から書き替えた札まで書き込む管を引く。処理を借りる呼び出しの内側の書き込みは、呼んだ側の札へ向く。\n * この file は配管の図を描く部品 (`render/pipe.ts`) と配管の図のブロックの描き方だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipePlate, PipeWrite } from \"../../kinds/pipe/layout\";\nimport type { Rect } from \"../../layout/scene\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport { frameShape } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { type Ctx, pathOf, r1, write } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport { shortened, STATE_COLOR } from \"../hold/draw\";\n\nconst P = PIPE_LOOK;\nconst T = PIPE_TYPE;\n\n/** 和文を含む字に足す class。等幅の字は和文を持たないので、和文の字で描く */\nexport const wide = (text: string): string => ([...text].some((ch) => (ch.codePointAt(0) ?? 0) >= 0x2e80) ? \" dg-pp-j\" : \"\");\n\nconst strike = (r: Rect): string => `<rect class=\"dg-pp-strike\" x=\"${r1(r.x)}\" y=\"${r1(r.y)}\" width=\"${r1(r.w)}\" height=\"${r1(r.h)}\"/>`;\n\n/** 値の札。`attrs` は部品の印 (段の始まりの写しは持たない) */\nexport function plate(p: PipePlate, ctx: Ctx, shown: Shown[], attrs: string): string {\n const changed = p.was !== undefined;\n if (p.boxed) {\n const was = p.was && p.arrow ? write(ctx.ink, \"dg-pp-tvw\", p.was.x, p.was.base, p.was.text, T.keyValue, shown) + (p.strike ? strike(p.strike) : \"\") + write(ctx.ink, \"dg-pp-tva\", p.arrow.x, p.arrow.base, p.arrow.text, T.keyValue, shown) : \"\";\n return (\n `<g${attrs} class=\"dg-pp-tplate dg-pp-tplate-${p.state}\" style=\"${cs(STATE_COLOR[p.state])}\">` +\n write(ctx.ink, `dg-pp-tkey${wide(p.label.text)}`, p.label.x, p.label.base, p.label.text, T.key, shown) +\n was +\n write(ctx.ink, `dg-pp-tval${changed ? \" dg-pp-tval-on\" : \"\"}${wide(p.text.text)}`, p.text.x, p.text.base, p.text.text, T.keyValue, shown) +\n `</g>`\n );\n }\n const sub =\n p.was && p.tag\n ? write(ctx.ink, `dg-pp-was${wide(p.was.text)}`, p.was.x, p.was.base, p.was.text, T.sub, shown) +\n (p.strike ? strike(p.strike) : \"\") +\n write(ctx.ink, \"dg-pp-tagw\", p.tag.x, p.tag.base, p.tag.text, T.tag, shown)\n : \"\";\n // 札の名前と値の字は、札の枠と一緒に描いた四角で記録する。崩れの確かめが、札の枠に接する字を探す (#3526)\n const frame = { name: p.name, rect: { x: p.x, y: p.y, w: p.w, h: p.h } };\n for (const t of [p.label, p.text]) ctx.ink.push({ text: t.text, rect: { x: t.x, y: t.y, w: t.w, h: t.h }, shown, frame });\n return (\n `<g${attrs} class=\"dg-pp-plate dg-pp-plate-${p.state}\" style=\"${cs(STATE_COLOR[p.state])}\">` +\n frameShape(ctx.corner, ' class=\"dg-pp-pbox\"', p, `<rect class=\"dg-pp-pbox\" x=\"${r1(p.x)}\" y=\"${r1(p.y)}\" width=\"${r1(p.w)}\" height=\"${r1(p.h)}\" rx=\"${P.plate.radius}\"/>`) +\n write(undefined, `dg-pp-tok${wide(p.label.text)}`, p.label.x, p.label.base, p.label.text, T.tankTitle, shown) +\n write(undefined, `dg-pp-pv${wide(p.text.text)}`, p.text.x, p.text.base, p.text.text, T.plateValue, shown) +\n `${sub}</g>`\n );\n}\n\n/** 書き込む管。書いた者の名札の下から、書き替えた札の上の端まで */\nexport function writePipe(w: PipeWrite, ctx: Ctx, attrs: string): string {\n const a = P.flow.chevron;\n const [ex, ey] = w.points[w.points.length - 1] ?? [0, 0];\n return (\n `<g${attrs} style=\"${cs(\"amber\")}\"><path class=\"dg-pp-wr\" d=\"${pathOf(shortened(w.points, a), ctx.corner)}\"/>` +\n `<path class=\"dg-pp-wh\" d=\"M ${r1(ex - a)} ${r1(ey - a)} L ${r1(ex)} ${r1(ey)} L ${r1(ex + a)} ${r1(ey - a)} Z\"/></g>`\n );\n}\n","/**\n * 確認の描き方 (#3389、#3398)。\n *\n * `check` を行う者ごとに 1 つの計器を、その者を呼んだ管の上か、トークンの Contract の値の管の上に置く。\n * 計器は落ちる側と通る側の目盛りの帯と針を持ち、確かめた段で針が振れて、通ったか (緑のレ点) 落ちたか (桃色の ×) の印が付く。\n * 確かめた段の後も針と印を残し、値の管の計器は比べた式を上に残す。\n * 畳んだ箱の札 (`card`) も同じ札の形で描くので、この file が持ち、畳みのブロックの描き方が読む。\n * この file は配管の図を描く部品 (`render/pipe.ts`) と配管の図のブロックの描き方だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeGauge, PipeText } from \"../../kinds/pipe/layout\";\nimport type { Rect } from \"../../layout/scene\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport type { ColorKey } from \"../../look/values\";\nimport { partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { type Ctx, r1, write } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport { wide } from \"../write/draw\";\n\nconst P = PIPE_LOOK;\nconst G = PIPE_LOOK.gauge;\n\n/** 畳んだ箱の札の左の印 (2 枚の重なった紙)。`(x, y)` が真ん中 */\nconst foldIcon = (x: number, y: number): string =>\n `<path class=\"dg-pp-ic\" d=\"M ${r1(x - 8)} ${r1(y - 3)} h 12 v 11 h -12 Z M ${r1(x - 4)} ${r1(y - 3)} v -5 h 12 v 11 h -4\"/>`;\n\n/** 札。枠と左の印と、上の小さな字 (`title`) と下の大きな字 (`value`) */\nexport function card(c: Rect & { title: PipeText; value: PipeText }, color: ColorKey, ctx: Ctx, shown: Shown[], attrs: string, cls = \"dg-pp-card\"): string {\n return (\n `<g${attrs} style=\"${cs(color)}\">` +\n `<rect class=\"${cls}\" x=\"${r1(c.x)}\" y=\"${r1(c.y)}\" width=\"${r1(c.w)}\" height=\"${r1(c.h)}\" rx=\"${partRadius(ctx.corner, P.radius)}\" ${ctx.sh}/>` +\n foldIcon(c.x + P.card.padX + P.card.icon / 2, c.y + c.h / 2) +\n write(ctx.ink, `dg-pp-k1${wide(c.title.text)}`, c.title.x, c.title.base, c.title.text, PIPE_TYPE.cardTitle, shown) +\n write(ctx.ink, `dg-pp-k2 dg-pp-k3${wide(c.value.text)}`, c.value.x, c.value.base, c.value.text, PIPE_TYPE.fold, shown) +\n `</g>`\n );\n}\n\n/** 円の弧。`a0` 度から `a1` 度まで、真上を 0 度に右回り */\nfunction arc(cx: number, cy: number, a0: number, a1: number, r: number): string {\n const at = (a: number): [number, number] => [cx + r * Math.sin((a * Math.PI) / 180), cy - r * Math.cos((a * Math.PI) / 180)];\n const [x0, y0] = at(a0);\n const [x1, y1] = at(a1);\n return `M ${r1(x0)} ${r1(y0)} A ${r1(r)} ${r1(r)} 0 ${a1 - a0 > 180 ? 1 : 0} 1 ${r1(x1)} ${r1(y1)}`;\n}\n\n/**\n * 計器。`swing` を渡すと針がその style の動きで振れ、`lit` を渡すと通ったかの印がその style の動きで出る。\n * 針は `data-pipe-needle`、印は `data-pipe-lamp` を持つ。`attrs` は部品の印\n */\nexport function gauge(g: PipeGauge, ctx: Ctx, shown: Shown[], attrs: string, swing = \"\", lit = \"\"): string {\n const { cx, cy, r } = g;\n const needle = `<path class=\"dg-pp-needle\" d=\"M ${r1(cx - 2.5)} ${r1(cy)} L ${r1(cx)} ${r1(cy - r + G.needle)} L ${r1(cx + 2.5)} ${r1(cy)} Z\"/>`;\n const turned = swing\n ? `<g class=\"dg-a\" data-pipe-needle=\"\" style=\"transform-origin:${r1(cx)}px ${r1(cy)}px;${swing}\">${needle}</g>`\n : `<g data-pipe-needle=\"\" transform=\"rotate(${g.angle} ${r1(cx)} ${r1(cy)})\">${needle}</g>`;\n const { x: lx, y: ly, r: lr } = g.lamp;\n const mark = g.ok\n ? `M ${r1(lx - 5)} ${r1(ly)} l 3.5 4 l 7 -8`\n : `M ${r1(lx - 4.5)} ${r1(ly - 4.5)} l 9 9 M ${r1(lx + 4.5)} ${r1(ly - 4.5)} l -9 9`;\n const lamp = `<g data-pipe-lamp=\"\"${lit ? ` class=\"dg-a\" style=\"${lit}\"` : \"\"}><circle class=\"dg-pp-lamp\" cx=\"${r1(lx)}\" cy=\"${r1(ly)}\" r=\"${lr}\"/><path class=\"dg-pp-lampm\" d=\"${mark}\"/></g>`;\n return (\n `<g${attrs} class=\"dg-pp-gauge${g.ok ? \"\" : \" dg-pp-gfail\"}\" style=\"${cs(g.ok ? \"violet\" : \"rose\")}\">` +\n (g.stem ? `<line class=\"dg-pp-gstem\" x1=\"${r1(cx)}\" y1=\"${r1(g.stem.y1)}\" x2=\"${r1(cx)}\" y2=\"${r1(g.stem.y2)}\"/>` : \"\") +\n `<circle class=\"dg-pp-face\" cx=\"${r1(cx)}\" cy=\"${r1(cy)}\" r=\"${r}\"/>` +\n `<path class=\"dg-pp-zone dg-pp-zbad\" d=\"${arc(cx, cy, -125, -12, r - G.zone)}\"/><path class=\"dg-pp-zone dg-pp-zgood\" d=\"${arc(cx, cy, -4, 125, r - G.zone)}\"/>` +\n `${turned}<circle class=\"dg-pp-hub\" cx=\"${r1(cx)}\" cy=\"${r1(cy)}\" r=\"${G.hub}\"/>${lamp}` +\n `</g>`\n );\n}\n","/**\n * イベントの描き方 (#3389)。\n *\n * 出したイベントは図の上の端のイベントの列に `<出した者の名前>.<イベントの名前>` の札で積み、出した段だけ引数を札の中に出す。\n * 暫定の札は点線の縁、確定した札は緑の縁、取り消した札は桃色の縁と消し線で描く。`emit` の段では、出した者の名札をイベントの色 (桃色) の輪で囲む。\n * この file は配管の図を描く部品 (`render/pipe.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeEventChip, PipePill } from \"../../kinds/pipe/layout\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport { partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { type Ctx, esc, r1, write } from \"../../render/parts\";\nimport { cs } from \"../color/draw\";\nimport { STATE_COLOR } from \"../hold/draw\";\nimport { wide } from \"../write/draw\";\n\nconst P = PIPE_LOOK;\n\n/** イベントの札。`attrs` は部品の印。引数の字は `data-pipe-args` を持つ */\nexport function eventChip(e: PipeEventChip, ctx: Ctx, shown: Shown[], attrs: string): string {\n const color = e.state === \"none\" ? \"rose\" : STATE_COLOR[e.state];\n const strike = e.state === \"rolled\" ? `<rect class=\"dg-pp-x\" x=\"${r1(e.text.x)}\" y=\"${r1(e.text.y + e.text.h * 0.55)}\" width=\"${r1(e.text.w)}\" height=\"1.25\"/>` : \"\";\n let args = \"\";\n if (e.args) {\n ctx.ink.push({ text: e.args.text, rect: { x: e.args.x, y: e.args.y, w: e.args.w, h: e.args.h }, shown });\n args = `<text class=\"dg-pp-ca${wide(e.args.text)}\" data-pipe-args=\"\" x=\"${r1(e.args.x)}\" y=\"${r1(e.args.base)}\">${esc(e.args.text)}</text>`;\n }\n return (\n `<g${attrs} style=\"${cs(color)}\">` +\n `<rect class=\"dg-pp-chip dg-pp-chip-${e.state}\" x=\"${r1(e.x)}\" y=\"${r1(e.y)}\" width=\"${r1(e.w)}\" height=\"${r1(e.h)}\" rx=\"${partRadius(ctx.corner, 4)}\"/>` +\n `${write(ctx.ink, `dg-pp-ct${wide(e.text.text)}`, e.text.x, e.text.base, e.text.text, PIPE_TYPE.chip, shown)}${args}${strike}</g>`\n );\n}\n\n/** イベントを出した者の名札を囲む輪。`radius` は名札の角 (丸の名札は渡さない) */\nexport function ring(pill: PipePill, attrs: string, ctx: Ctx, radius?: number): string {\n const pad = P.ring.width + 1;\n const h = pill.h + pad * 2;\n const rx = radius === undefined ? h / 2 : radius + pad;\n return `<rect${attrs} class=\"dg-pp-ring\" style=\"${cs(\"rose\")}\" x=\"${r1(pill.x - pad)}\" y=\"${r1(pill.y - pad)}\" width=\"${r1(pill.w + pad * 2)}\" height=\"${r1(h)}\" rx=\"${partRadius(ctx.corner, rx)}\"/>`;\n}\n","/**\n * 畳みの描き方 (#3389)。\n *\n * `[fold]` の呼び出しの内側の段は 1 つの段にまとめ、呼ばれた者の下の空いた所に点線の縁の箱を出す。箱は内側の段の数と、内側の段にしか出ない関係者の数を書き、\n * 押すと内側の段を開いて描き直す (再生の部品が `data-pipe-fold` を見る)。まとめた段の槽と値の札とイベントは、内側の出来事を全て当てた後の値で描く。\n * この file は配管の図を描く部品 (`render/pipe.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeFoldBox } from \"../../kinds/pipe/layout\";\nimport type { Shown } from \"../../render/ink\";\nimport type { Ctx } from \"../../render/parts\";\nimport { card } from \"../check/draw\";\n\n/** 畳んだ箱。押すと開く */\nexport function foldBox(f: PipeFoldBox, ctx: Ctx, shown: Shown[], attrs: string): string {\n return card(f, \"blue\", ctx, shown, `${attrs} data-pipe-fold=\"${f.call}\" role=\"button\"`, \"dg-pp-card dg-pp-fold\");\n}\n","/**\n * 呼び出しの種類の描き方 (#3389)。\n *\n * 呼び出しの種類は呼び出しの管の見た目で分ける。処理を借りる呼び出し (`[call: delegate]`) の管は芯を抜いた 2 本線、\n * 書き込めない呼び出し (`[call: static]`) の管は普通の管の半分の太さで描く (太さは並べ方が `width` に持つ)。\n * この file は呼び出しの管の描き方 (`return/draw.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport { PIPE_LOOK } from \"../../look/pipe\";\nimport { r1 } from \"../../render/parts\";\n\n/** 処理を借りる管の芯。管の道 `d` の上に地の色の細い線を重ね、2 本線に見せる。ほかの種類は何も描かない */\nexport function kindCore(lane: { kind: string; width: number }, d: string): string {\n return lane.kind === \"delegate\" ? `<path class=\"dg-pp-core\" stroke-width=\"${r1(lane.width * PIPE_LOOK.call.core)}\" d=\"${d}\"/>` : \"\";\n}\n","/**\n * 呼び出しの管の描き方 (#3389、#3398)。\n *\n * 呼んだ者ごとに 1 本の本管を引き、呼ぶ相手ごとに枝を分ける。管は太い外の管で描き、枝の根元に弁を置く。\n * 開いている呼び出しは、呼んだ者を出た所から呼ばれた者の名札まで呼び出しの色 (青) で光り、開いた時刻に弁の取っ手が倒れる。\n * 戻ると光が消えて取っ手が立つ。一番外の呼び出しが戻って全てが確定した段は、送り手から出る管を確定の色 (緑) で光らせる。\n * 呼び出しの種類の見た目 (処理を借りる管の 2 本線、書き込めない管の細さ) は呼び出しの種類のブロックの描き方 (`call/draw.ts`) が持つ。\n * この file は配管の図を描く部品 (`render/pipe.ts`) だけが読み、見本帳を開いた時に読む塊に入れない\n */\nimport type { PipeMain } from \"../../kinds/pipe/layout\";\nimport type { Point } from \"../../layout/scene\";\nimport { r1 } from \"../../render/parts\";\nimport { kindCore } from \"../call/draw\";\nimport { cs } from \"../color/draw\";\n\n/** 点の並びの道。角は丸めず、管の継ぎ目の形のまま描く */\nconst lineOf = (points: readonly Point[]): string => `M ${points.map((p) => `${r1(p[0])} ${r1(p[1])}`).join(\" L \")}`;\n\n/** 本管と枝の外の管 */\nexport function callCase(main: PipeMain): string {\n const d = [main.points, ...main.branches.map((b) => b.points)]\n .filter((p) => p.length > 1)\n .map(lineOf)\n .join(\" \");\n return `<path class=\"dg-pp-ccase\" d=\"${d}\"/>`;\n}\n\n/**\n * 光る管。`attrs` は部品の印 (`data-pipe-branch`、`data-pipe-call`、`data-pipe-pipe`)、`shown` は見える間の style。\n * 太さを `stroke-width` に書き、確定した段の管 (`good`) は確定の色で描く。`draw` を渡すと、管がその style の動きで呼んだ者の側から光っていく\n */\nexport function litPipe(lane: { kind: string; width: number; points: Point[] }, attrs: string, shown: string, good = false, draw = \"\"): string {\n const d = lineOf(lane.points);\n const drawn = draw ? ` pathLength=\"1\" stroke-dasharray=\"1\"` : \"\";\n return (\n `<g class=\"dg-a\" style=\"${shown}\"><path${attrs} class=\"dg-pp-cflow${draw ? \" dg-a\" : \"\"}\" style=\"${cs(good ? \"green\" : \"blue\")}${draw ? `;${draw}` : \"\"}\"${drawn} stroke-width=\"${lane.width}\" d=\"${d}\"/>` +\n `${kindCore(lane, d)}</g>`\n );\n}\n","/**\n * 配管の図 (#3389) を描く部品。見た目の元は Tracelyth の第6回の試作の「4 配管」(#3398) で、色と字は値の表から読む。\n *\n * 段ごとの絵 (`data-pipe-frame`) に、その段の部品を全て描き、段が替わる時に次の段の絵を重ねてから前の段の絵を消す。\n * 段ごとに変わらない部品 (地の点、槽の囲い、呼び出しの管の外の管、名札から槽へ下りる点線) は段の絵の下に 1 度だけ描く。\n * 段の中で変わる部品 (水位と数、値の札、イベントの札、流れた分、光る管と弁、計器、図の中の札) は、変えた出来事の時刻に替わる。\n * 前の段の値はその時刻まで同じ所に残し、部品の印 (`data-pipe-*`) は替わった後の部品だけが持つ。\n * その段で動かなかった槽と値の管と値の札と名札は薄く描き、計器と流れた分とイベントの札は薄くしない (#3418)。\n *\n * 呼び出しの管は値の管の下をくぐる (#3418)。全ての段の光る呼び出しの管を先に描き (`data-pipe-layer=\"calls\"`)、くぐる所の印を重ね、\n * その後に段ごとの絵で値の管を描く。値の管の外の管がくぐる所の呼び出しの管を覆う。\n * 部品の形はブロックの描き方 (`blocks/<名前>/draw.ts`) が描き、この file は並べ方の置き場所と時刻を渡して組む。\n * 段ごとの絵は下から順に、値の管、流れた分、トークンの箱と弁、槽と水、変換器、値の札と書き込む管、呼び出しの管の弁、計器、名札と輪、\n * イベントの札、図の中の札 (流れた量、計器の式、入力と出力の印)、戻り値の札、畳んだ箱を重ねる。\n * 配管の図の見た目の規則は配管の図の SVG にだけ書き、ほかの図の SVG と頁が最初に読む script に入れない (列の図と同じ訳)。\n */\nimport { avatar, cabinet } from \"../blocks/box/draw\";\nimport { converter } from \"../blocks/calc/draw\";\nimport { gauge } from \"../blocks/check/draw\";\nimport { cs } from \"../blocks/color/draw\";\nimport { eventChip, ring } from \"../blocks/emit/draw\";\nimport { foldBox } from \"../blocks/fold/draw\";\nimport { defId, flow, grid, leverAngle, level, pipeDefs, sizedText, STATE_COLOR, tank, tokenBox, valuePipe, valve } from \"../blocks/hold/draw\";\nimport { callCase, litPipe } from \"../blocks/return/draw\";\nimport { plate, wide, writePipe } from \"../blocks/write/draw\";\nimport type { PipeChip, PipeGauge, PipeLayout, PipeLevel } from \"../kinds/pipe/layout\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../look/pipe\";\nimport { type ColorKey, EASE, LOOK, MOTION } from \"../look/values\";\nimport { valveRects } from \"../pipe-valve\";\nimport type { Timeline } from \"../timeline\";\nimport { frameShape, partRadius } from \"./corner\";\nimport { ALWAYS, type Shown } from \"./ink\";\nimport type { Frame } from \"./motion\";\nimport { type Ctx, cssFont as font, r1 } from \"./parts\";\n\nconst P = PIPE_LOOK;\nconst T = PIPE_TYPE;\nconst S = LOOK.stroke;\nconst M = MOTION.pipe;\n\n/** 呼び出しの色、値の色、鉛筆の色 (暫定の印) を混ぜる式 */\nconst mix = (a: string, pct: number, b: string): string => `color-mix(in srgb,${a} ${pct}%,${b})`;\n\n/**\n * 配管の図の部品の見た目。どの値も値の表から読む。配管の図の SVG にだけ書く。\n * 試作の色の役は、呼び出しを `--c-blue`、値を `--c-amber`、確かめるを `--c-violet`、確定を `--c-green`、取り消しを `--c-rose`、暫定の印を `--c-slate` に当てる\n */\nconst PIPE_CSS = [\n // 液の色。トークンごとに 3 つの色を順に使う\n `.dg-pp{--pp-tone0:var(--c-amber);--pp-tone1:${mix(\"var(--c-amber)\", 48, \"var(--ink2)\")};--pp-tone2:${mix(\"var(--c-rose)\", 70, \"var(--c-amber)\")}}`,\n `.dg-pp-gdot{fill:${mix(\"var(--line)\", 60, \"transparent\")}}`,\n `.dg-pp-housing{fill:${mix(\"var(--surf)\", 55, \"transparent\")};stroke:var(--line);stroke-width:${S.hair + 0.5};stroke-dasharray:6 6}`,\n // 値の管と流れた分\n `.dg-pp-pcase{fill:none;stroke:var(--line);stroke-width:${P.bus.case};stroke-linejoin:round}`,\n `.dg-pp-pcore{fill:none;stroke:var(--bg);stroke-width:${P.bus.core};stroke-linejoin:round}`,\n `.dg-pp-tline{fill:none;stroke:var(--pp-t);stroke-width:${P.flow.width};stroke-linecap:round;stroke-linejoin:round;stroke-dasharray:${P.flow.dash}}`,\n `.dg-pp-chev{fill:none;stroke:var(--pp-t);stroke-width:${P.flow.width - 0.5};stroke-linecap:round;stroke-linejoin:round}`,\n \".dg-pp-trace-final .dg-pp-tline{stroke-dasharray:none;opacity:.6}\",\n \".dg-pp-trace-rolled .dg-pp-tline,.dg-pp-trace-rolled .dg-pp-chev{stroke:var(--c-rose)}\",\n `.dg-pp-slug{fill:none;stroke-width:${P.bus.core - 4};stroke-linejoin:round;stroke-dasharray:${P.flow.slug} ${1 + P.flow.slug}}`,\n // くぐる所。呼び出しの管を値の管の縁で切る\n `.dg-pp-under{stroke:var(--bg);stroke-width:${S.edgeOn + 1.5}}`,\n // 斜線と液\n `.dg-pp-hb{fill:${mix(\"var(--pp-t)\", 26, \"transparent\")}}`,\n `.dg-pp-hl{stroke:var(--pp-t);stroke-width:${P.flow.width}}`,\n \".dg-pp-d0{stop-color:var(--bg);stop-opacity:0}\",\n \".dg-pp-d1{stop-color:var(--bg);stop-opacity:.38}\",\n \".dg-pp-a0{stop-color:var(--c-amber)}\",\n \".dg-pp-a1{stop-color:var(--c-blue)}\",\n // 槽\n `.dg-pp-glass{fill:${mix(\"var(--surf)\", 80, \"transparent\")};stroke:var(--line);stroke-width:${S.edgeOn + 0.5}}`,\n \".dg-pp-glass-on{stroke:var(--c)}\",\n \".dg-pp-deep{pointer-events:none}\",\n \".dg-pp-liq{fill:var(--pp-t)}\",\n `.dg-pp-ghost{fill:none;stroke:var(--t-slate);stroke-width:${S.edgeOn};stroke-dasharray:5 5}`,\n `.dg-pp-mark{stroke:var(--t-slate);stroke-width:${S.edgeOn};stroke-dasharray:3 5}`,\n \".dg-pp-mark-rolled{stroke:var(--c-rose)}\",\n `.dg-pp-shine{fill:${mix(\"var(--ink)\", 9, \"transparent\")}}`,\n `.dg-pp-tick{stroke:${mix(\"var(--ink)\", 22, \"transparent\")};stroke-width:${S.hair + 0.5}}`,\n `.dg-pp-tok{${font(T.tankTitle)};letter-spacing:${P.tank.titleTrack}em;fill:var(--mute)}`,\n `.dg-pp-num{${font(T.amount)};fill:var(--ink)}`,\n `.dg-pp-was{${font(T.sub)};fill:var(--mute)}`,\n `.dg-pp-dlt{${font(T.delta)};fill:var(--ct)}`,\n \".dg-pp-strike{fill:var(--mute)}\",\n `.dg-pp-tagw{${font(T.tag)};fill:var(--t-slate)}`,\n \".dg-pp-lv-final .dg-pp-num,.dg-pp-lv-final .dg-pp-tagw,.dg-pp-lv-rolled .dg-pp-num,.dg-pp-lv-rolled .dg-pp-tagw{fill:var(--ct)}\",\n \".dg-pp-lv-provisional .dg-pp-dlt{fill:var(--ink2)}\",\n // 呼び出しの管と弁\n `.dg-pp-ccase{fill:none;stroke:var(--line);stroke-width:${P.call.case};stroke-linecap:round;stroke-linejoin:round}`,\n \".dg-pp-cflow{fill:none;stroke:var(--c);stroke-linecap:round;stroke-linejoin:round}\",\n \".dg-pp-core{fill:none;stroke:var(--bg);stroke-linecap:round;stroke-linejoin:round}\",\n `.dg-pp-vbody{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn};stroke-linejoin:round}`,\n \".dg-pp-vopen{fill:var(--c-blue);stroke:var(--c-blue)}\",\n \".dg-pp-vval .dg-pp-vopen{fill:var(--c-amber);stroke:var(--c-amber)}\",\n `.dg-pp-vstem{stroke:var(--line);stroke-width:${S.edgeOn + 1}}`,\n \".dg-pp-lever{fill:var(--mute)}\",\n `.dg-pp-pivot{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn}}`,\n // トークンの箱と中の値\n `.dg-pp-act{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn}}`,\n `.dg-pp-tokv.dg-pp-on .dg-pp-act{stroke:var(--c-blue);stroke-width:${S.edgeOn + 1}}`,\n `.dg-pp-tstem{stroke:var(--line);stroke-width:${S.edgeOn + 2}}`,\n `.dg-pp-actn{${font(T.party)};fill:var(--ink)}`,\n `.dg-pp-tkey{${font(T.key)};fill:var(--mute)}`,\n `.dg-pp-tvw,.dg-pp-tva{${font(T.keyValue)};fill:var(--mute)}`,\n `.dg-pp-tval{${font(T.keyValue)};fill:var(--ink)}`,\n \".dg-pp-tval-on{fill:var(--ct)}\",\n // 値の札と書き込む管\n `.dg-pp-pbox{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn + 0.5}}`,\n \".dg-pp-plate-provisional .dg-pp-pbox{stroke:var(--c);stroke-dasharray:5 4}\",\n \".dg-pp-plate-final .dg-pp-pbox,.dg-pp-plate-rolled .dg-pp-pbox{stroke:var(--c)}\",\n `.dg-pp-pv{${font(T.plateValue)};fill:var(--ink)}`,\n \".dg-pp-plate-final .dg-pp-pv,.dg-pp-plate-rolled .dg-pp-pv,.dg-pp-plate-final .dg-pp-tagw,.dg-pp-plate-rolled .dg-pp-tagw{fill:var(--ct)}\",\n `.dg-pp-wr{fill:none;stroke:var(--c);stroke-width:${S.on};stroke-dasharray:4 3}`,\n \".dg-pp-wh{fill:var(--c)}\",\n // 計器\n `.dg-pp-face{fill:var(--surf);stroke:var(--c);stroke-width:${S.edgeOn + 0.5}}`,\n `.dg-pp-gfail .dg-pp-face{stroke-width:${S.edgeOn + 1.5}}`,\n `.dg-pp-gstem{stroke:var(--line);stroke-width:${S.edgeOn + 2}}`,\n `.dg-pp-zone{fill:none;stroke-width:${P.gauge.zone - 1};stroke-linecap:round}`,\n `.dg-pp-zbad{stroke:${mix(\"var(--c-rose)\", 55, \"transparent\")}}`,\n `.dg-pp-zgood{stroke:${mix(\"var(--c-green)\", 70, \"transparent\")}}`,\n \".dg-pp-needle,.dg-pp-hub{fill:var(--ink)}\",\n \".dg-pp-lamp{fill:var(--c-green)}\",\n \".dg-pp-gfail .dg-pp-lamp{fill:var(--c-rose)}\",\n `.dg-pp-lampm{fill:none;stroke:var(--on-c);stroke-width:${S.edgeOn + 0.6};stroke-linecap:round;stroke-linejoin:round}`,\n // 変換器\n `.dg-pp-cstub{fill:none;stroke:var(--line);stroke-width:${P.bus.stub}}`,\n `.dg-pp-cface{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn + 0.5}}`,\n `.dg-pp-cswirl{fill:none;stroke:var(--mute);stroke-width:${S.edgeOn + 1};stroke-linecap:round}`,\n \".dg-pp-ctip{fill:var(--mute)}\",\n `.dg-pp-cur .dg-pp-cface{stroke:var(--c);stroke-width:${S.edgeOn + 1.5}}`,\n \".dg-pp-cur .dg-pp-cswirl{stroke:var(--c)}\",\n \".dg-pp-cur .dg-pp-ctip{fill:var(--c)}\",\n // 名札\n `.dg-pp-halo{fill:none;stroke:var(--c-blue);stroke-width:${S.edgeOn + 0.5};opacity:0}`,\n \".dg-pp-who.dg-pp-on .dg-pp-halo{opacity:.7}\",\n `.dg-pp-glyph{${font(T.initial)};fill:var(--on-c)}`,\n `.dg-pp-pname{${font(T.party)};fill:var(--ink)}`,\n `.dg-pp-tie{fill:none;stroke:var(--line);stroke-width:${S.edgeOn};stroke-dasharray:2 6;stroke-linecap:round}`,\n `.dg-pp-cabr{fill:var(--surf);stroke:var(--line);stroke-width:${S.edgeOn + 0.5}}`,\n `.dg-pp-cab.dg-pp-pool .dg-pp-cabr{stroke:${mix(\"var(--c-amber)\", 60, \"var(--line)\")}}`,\n `.dg-pp-cab.dg-pp-on .dg-pp-cabr{stroke:var(--c-blue);stroke-width:${S.edgeOn + 1.5}}`,\n `.dg-pp-cabg{${font(T.mark)};fill:var(--ink2)}`,\n `.dg-pp-cgl{fill:none;stroke:var(--ink2);stroke-width:${S.glyph};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-pp-cabn{${font(T.party)};fill:var(--ink)}`,\n `.dg-pp-ring{fill:none;stroke:var(--c);stroke-width:${P.ring.width}}`,\n // イベントの札\n `.dg-pp-chip{fill:var(--surf);stroke:var(--c);stroke-width:${S.on}}`,\n \".dg-pp-chip-provisional{stroke-dasharray:3 2}\",\n `.dg-pp-ct{${font(T.chip)};fill:var(--ct)}`,\n `.dg-pp-ca{${font(T.args)};fill:var(--mute)}`,\n \".dg-pp-x{fill:var(--mute)}\",\n // 図の中の札。流れた量、計器の式、入力と出力の印、戻り値\n `.dg-pp-lab{fill:var(--surf);stroke:var(--c);stroke-width:${S.on}}`,\n \".dg-pp-lab-provisional .dg-pp-lab{stroke-dasharray:3 2}\",\n `.dg-pp-labt{${font(T.chip)};fill:var(--ct)}`,\n `.dg-pp-io .dg-pp-labt{${font(T.io)}}`,\n \".dg-pp-io .dg-pp-lab{fill:var(--bg)}\",\n // 畳んだ箱\n `.dg-pp-card{fill:var(--surf);stroke:var(--c);stroke-width:${S.arrow}}`,\n \".dg-pp-fold{stroke-dasharray:5 3;cursor:pointer}\",\n `.dg-pp-ic{fill:none;stroke:var(--c);stroke-width:${S.glyph};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-pp-k1{${font(T.cardTitle)};fill:var(--mute)}`,\n `.dg-pp-k2{${font(T.cardValue)};fill:var(--ct)}`,\n `.dg-pp-k3{${font(T.fold)}}`,\n \".dg-pp-j{font-family:var(--sans)}\",\n].join(\"\");\n\n/** 図の中の札の色の役。流れた量は印の色、計器の式は確かめる色か落ちた色、入力と出力の印は暫定の印の色、戻り値は呼び出しの色 */\nconst chipColor = (c: PipeChip): ColorKey =>\n c.kind === \"amount\" ? STATE_COLOR[c.state ?? \"none\"] : c.kind === \"formula\" ? (c.ok === false ? \"rose\" : \"violet\") : c.kind === \"io\" ? \"slate\" : \"blue\";\n\n/** 図の中の札。角の丸みは並べ方が決め (#3418)、字は並べ方が決めた大きさで書く */\nfunction chipPart(c: PipeChip, ctx: Ctx, shown: Shown[], attrs: string): string {\n return (\n `<g${attrs} class=\"dg-pp-labg dg-pp-${c.kind}${c.state ? ` dg-pp-lab-${c.state}` : \"\"}\" style=\"${cs(chipColor(c))}\">` +\n `<rect class=\"dg-pp-lab\" x=\"${r1(c.x)}\" y=\"${r1(c.y)}\" width=\"${r1(c.w)}\" height=\"${r1(c.h)}\" rx=\"${partRadius(ctx.corner, c.rx)}\"/>` +\n `${sizedText(ctx, `dg-pp-labt${wide(c.text)}`, c.label, c.kind === \"io\" ? T.io : T.chip, shown)}</g>`\n );\n}\n\n/** 計器が描く形。針の盤と、通ったかの印と、値の管から上る軸 */\nconst gaugeRects = (g: PipeGauge) => [\n { x: g.x, y: g.y, w: g.w, h: g.h },\n { x: g.lamp.x - g.lamp.r, y: g.lamp.y - g.lamp.r, w: g.lamp.r * 2, h: g.lamp.r * 2 },\n ...(g.stem ? [{ x: g.cx - 2, y: Math.min(g.stem.y1, g.stem.y2), w: 4, h: Math.abs(g.stem.y2 - g.stem.y1) }] : []),\n];\n\n/**\n * 段ごとに変わらない部品 (名札、呼び出しの管、弁) を、崩れの確かめのために `pieces` へ記録する (#3523)。\n * 呼び出しの管と弁の段は、その管が呼び出しを初めて運ぶ段にする\n */\nfunction recordPieces(layout: PipeLayout, pieces: NonNullable<Ctx[\"pieces\"]>): void {\n const names = new Map(layout.parties.map((p) => [p.id, p.name]));\n const nameOf = (id: string): string => names.get(id) ?? id;\n for (const p of layout.parties) {\n const corner = p.shape === \"round\" ? p.w / 2 : p.shape === \"token\" ? P.token.radius : P.cabinet.radius;\n pieces.push({ kind: \"box\", name: p.name, rect: { x: p.x, y: p.y, w: p.w, h: p.h }, corner, shown: ALWAYS });\n }\n for (const main of layout.mains)\n for (const br of main.branches) {\n const steps = layout.lanes.filter((x) => x.from === main.from && x.to === br.to).map((x) => x.step + 1);\n const step = steps.length > 0 ? Math.min(...steps) : 1;\n const from = nameOf(main.from);\n const to = nameOf(br.to);\n pieces.push({ kind: \"pipe\", from, to, step, points: br.points, half: P.call.case / 2, shown: ALWAYS });\n const [body, ...lever] = valveRects(br.valve.x, br.valve.y, br.valve.vertical, br.valve.under);\n if (body) pieces.push({ kind: \"valve\", from, to, step, body, lever, shown: ALWAYS });\n }\n for (const bus of layout.buses) {\n const v = bus.valve;\n if (!v) continue;\n const [body, ...lever] = valveRects(v.x, v.y, false, false);\n if (body) pieces.push({ kind: \"valve\", from: nameOf(v.party), body, lever, shown: ALWAYS });\n }\n}\n\n/** 槽の縁の色。確定した槽は確定の縁、取り消した槽は取り消しの縁 */\nconst edgeOf = (lv: PipeLevel | undefined): \"final\" | \"rolled\" | \"\" => (lv?.state === \"final\" ? \"final\" : lv?.state === \"rolled\" ? \"rolled\" : \"\");\n\nexport function drawPipe(layout: PipeLayout, timeline: Timeline, ctx: Ctx): { base: string; css: string } {\n const { m } = ctx;\n const f = MOTION.fade;\n const lastStep = timeline.steps.length - 1;\n const parties = new Map(layout.parties.map((p) => [p.id, p]));\n const pooled = new Set(layout.housings.map((h) => h.party));\n const look = { P, T };\n const timeOf = (s: number, event: number | undefined): number | undefined =>\n event === undefined ? undefined : timeline.events.find((t) => t.step === s && t.event === event)?.at;\n /** 取っ手の向きの keyframes。`moves` は時刻と、その時刻に弁が開くか */\n const rotation = (start: number, moves: [number, number][], prop: (v: number) => string, length: number): string => {\n const frames: Frame[] = [[0, { transform: prop(start) }]];\n let now = start;\n for (const [t, to] of moves) {\n frames.push([t, { transform: prop(now) }, EASE.inOut], [t + length, { transform: prop(to) }]);\n now = to;\n }\n frames.push([m.total, { transform: prop(now) }]);\n return m.kf(frames);\n };\n const deg = (v: number): string => `rotate(${r1(v)}deg)`;\n /** 段ごとの見える間 */\n const spanOf = (s: number): { a: number; b: number } => ({\n a: s === 0 ? 0 : (timeline.steps[s]?.start ?? 0),\n b: s === lastStep ? timeline.last : (timeline.steps[s]?.end ?? 0) + f,\n });\n const attrsOf = (s: number, attrs: Record<string, string | number>): string =>\n Object.entries({ ...attrs, step: s })\n .map(([k, v]) => ` data-pipe-${k}=\"${String(v).replace(/&/gu, \"&amp;\").replace(/\"/gu, \"&quot;\").replace(/</gu, \"&lt;\").replace(/>/gu, \"&gt;\")}\"`)\n .join(\"\");\n /** その段で動かなかった部品を薄く描く */\n const dimmed = (lit: boolean, markup: string): string => (lit ? markup : `<g opacity=\"${P.dim}\">${markup}</g>`);\n /** 流れた分が通る値の管の番号 */\n const pipeOfFlow = (fl: { token: string; from: string; to: string }): number =>\n layout.valuePipes.findIndex((p) => p.token === fl.token && ((p.from === fl.from && p.to === fl.to) || (p.from === fl.to && p.to === fl.from)));\n if (ctx.pieces) recordPieces(layout, ctx.pieces);\n\n // 段ごとに変わらない部品\n const out: string[] = [\n `<defs>${pipeDefs(ctx, layout.tanks)}</defs>`,\n grid(ctx, layout.width, layout.height),\n ...layout.housings.map((h) => {\n const attrs = ` class=\"dg-pp-housing\" data-pipe-housing=\"${h.party}\"`;\n return frameShape(ctx.corner, attrs, h, `<rect${attrs} x=\"${r1(h.x)}\" y=\"${r1(h.y)}\" width=\"${r1(h.w)}\" height=\"${r1(h.h)}\" rx=\"${P.tank.radius + P.housing.pad / 2}\"/>`);\n }),\n ...layout.mains.map(callCase),\n ...layout.ties.map((t) => `<path class=\"dg-pp-tie\" d=\"M ${r1(t.x)} ${r1(t.y1)} V ${r1(t.y2)}\"/>`),\n ];\n\n // 光る呼び出しの管。全ての段の分を値の管より先に描き、値の管の下をくぐらせる\n timeline.steps.forEach((_, s) => {\n const { a, b } = spanOf(s);\n const on = (attrs: Record<string, string | number>): string => attrsOf(s, attrs);\n const parts: string[] = [];\n for (const lane of layout.lanes.filter((x) => x.step === s)) {\n const opened = timeOf(s, lane.opened);\n const shut = timeOf(s, lane.shut);\n const shownAt = m.vis(opened ?? a, shut ?? b);\n const draw =\n opened === undefined\n ? \"\"\n : m.kf([\n [0, { \"stroke-dashoffset\": 1 }],\n [opened, { \"stroke-dashoffset\": 1 }, EASE.out],\n [opened + MOTION.draw, { \"stroke-dashoffset\": 0 }],\n [m.total, { \"stroke-dashoffset\": 0 }],\n ]);\n parts.push(litPipe(lane, on({ branch: `${lane.from}>${lane.to}`, call: lane.call, pipe: \"open\" }), shownAt, false, draw));\n }\n // 一番外の呼び出しが戻って全てが確定した段は、送り手から出る管を確定の色で光らせる\n for (const c of layout.calls.filter((x) => x.depth === 0 && x.close?.how === \"return\" && x.close.step === s)) {\n const t = timeOf(s, c.close?.event) ?? a;\n parts.push(litPipe({ kind: c.kind, width: c.width, points: c.lit }, on({ branch: `${c.from}>${c.to}`, call: c.index, pipe: \"done\" }), m.vis(t, b), true));\n }\n out.push(`<g class=\"dg-a\" data-pipe-frame=\"${s}\" data-pipe-layer=\"calls\" style=\"${m.vis(a, b)}\">${parts.join(\"\")}</g>`);\n });\n // くぐる所。値の管の縁で呼び出しの管を切る\n const half = P.bus.case / 2 + 2;\n const cut = P.call.case / 2 + 2;\n for (const k of layout.crossings) {\n const d = k.vertical\n ? `M ${r1(k.x - cut)} ${r1(k.y - half)} H ${r1(k.x + cut)} M ${r1(k.x - cut)} ${r1(k.y + half)} H ${r1(k.x + cut)}`\n : `M ${r1(k.x - half)} ${r1(k.y - cut)} V ${r1(k.y + cut)} M ${r1(k.x + half)} ${r1(k.y - cut)} V ${r1(k.y + cut)}`;\n out.push(`<path class=\"dg-pp-under\" data-pipe-crossing=\"${k.call}\" data-pipe-token=\"${k.token}\" data-pipe-under=\"${k.pipe}\" d=\"${d}\"/>`);\n }\n\n timeline.steps.forEach((span, s) => {\n const { a, b } = spanOf(s);\n const whole: Shown[] = [[a, b + f]];\n const since = (t: number | undefined): Shown[] => (t === undefined ? whole : [[t, b + f]]);\n const until = (t: number): Shown[] => [[a, t + f]];\n /** 時刻 `t` に出る部品。時刻を持たない部品は段の絵と一緒に出る */\n const appear = (t: number | undefined, markup: string): string => (t === undefined ? markup : `<g class=\"dg-a\" style=\"${m.vis(t, b)}\">${markup}</g>`);\n /** 段の始まりから時刻 `t` まで見える部品 */\n const vanish = (t: number, markup: string): string => `<g class=\"dg-a\" style=\"${m.vis(a, t)}\">${markup}</g>`;\n const on = (attrs: Record<string, string | number>): string => attrsOf(s, attrs);\n const pillOf = (party: string) => layout.pills.find((p) => p.step === s && p.party === party);\n const parts: string[] = [];\n const here = layout.flows.filter((x) => x.step === s);\n const moved = (k: number): boolean => here.some((fl) => pipeOfFlow(fl) === k && (fl.fresh || fl.event !== undefined));\n\n // 値の管。その段で流れた管と、流れた分の印が替わった管だけを濃く描く\n layout.valuePipes.forEach((pipe, k) => parts.push(dimmed(moved(k), valuePipe(pipe.points, on({ value: pipe.token, pipe: k })))));\n for (const stub of layout.stubs) parts.push(dimmed(false, valuePipe(stub.points, on({ stub: stub.token }))));\n // 値の管を流れた分。この段で流れた分は、出来事の時刻に斜線の液の塊が管を通り抜ける\n for (const fl of here) {\n const attrs = on({ flow: `${fl.from}>${fl.to}`, token: fl.token, state: fl.state });\n const t = timeOf(s, fl.event);\n const prev = layout.flows.find((x) => x.step === s - 1 && x.id === fl.id);\n if (t !== undefined && prev) parts.push(vanish(t, flow(prev, ctx, \"\")));\n parts.push(appear(t, flow(fl, ctx, attrs, fl.fresh ? t : undefined)));\n }\n // トークンの箱と、値の管の弁。この段で値を移したトークンの弁は、移した時刻に開く\n for (const bus of layout.buses) {\n const v = bus.valve;\n if (!v) continue;\n const times = here\n .filter((x) => x.fresh && x.token === bus.token)\n .map((x) => timeOf(s, x.event))\n .filter((t): t is number => t !== undefined)\n .sort((x, y) => x - y);\n const at = times[0];\n const turn = at === undefined ? \"\" : rotation(leverAngle(false, false), [[at, leverAngle(false, true)]], deg, M.lever);\n const open = at === undefined ? \"\" : m.vis(at, b);\n parts.push(`<g class=\"dg-pp-vval\">${valve(v.x, v.y, false, false, on({ lever: v.party }), ctx, turn, open)}</g>`);\n }\n for (const p of layout.parties.filter((x) => x.shape === \"token\")) {\n const v = layout.buses.find((x) => x.valve?.party === p.id)?.valve;\n const involved = pillOf(p.id)?.involved ?? false;\n parts.push(dimmed(involved, tokenBox(p, involved, v ? [v.x, v.y] : undefined, ctx, whole, on({ party: p.id, role: p.role }))));\n }\n // 槽と水。水と数は、変わった出来事の時刻に段の始まりの値から今の値へ替わる\n for (const g of layout.glasses.filter((x) => x.step === s)) {\n const lv = layout.levels.find((l) => l.step === s && l.party === g.party && l.token === g.token);\n let inside = \"\";\n if (lv) {\n const attrs = on({ level: lv.party, token: lv.token, state: lv.state });\n const t = timeOf(s, lv.event);\n const prev = s > 0 ? layout.levels.find((l) => l.step === s - 1 && l.party === g.party && l.token === g.token) : undefined;\n inside =\n t === undefined || !prev\n ? level(lv, g, ctx, whole, attrs)\n : vanish(t, level(prev, g, ctx, until(t), \"\")) + appear(t, level(lv, g, ctx, since(t), attrs, lv.from ? t : undefined));\n }\n const lit = lv?.event !== undefined || layout.converters.some((c) => c.step === s && c.party === g.party && c.active);\n parts.push(dimmed(lit, tank(g, edgeOf(lv), inside, ctx, whole, on({ tank: g.party, token: g.token }))));\n }\n for (const c of layout.converters.filter((x) => x.step === s)) parts.push(dimmed(c.active, converter(c, on({ converter: c.party }))));\n // 値の札と書き込む管\n for (const w of layout.writes.filter((x) => x.step === s)) parts.push(appear(timeOf(s, w.event), writePipe(w, ctx, on({ write: w.to, name: w.name }))));\n for (const p of layout.plates.filter((x) => x.step === s)) {\n const attrs = on({ plate: p.party, name: p.name, state: p.state });\n const t = timeOf(s, p.event);\n const prev = s > 0 ? layout.plates.find((x) => x.step === s - 1 && x.party === p.party && x.name === p.name) : undefined;\n const lit = p.event !== undefined || p.boxed;\n if (t === undefined || !prev) {\n parts.push(dimmed(lit, plate(p, ctx, whole, attrs)));\n continue;\n }\n parts.push(dimmed(lit, vanish(t, plate(prev, ctx, until(t), \"\")) + appear(t, plate(p, ctx, since(t), attrs))));\n }\n // 呼び出しの管の弁。呼び出しが開いた時刻に取っ手が倒れ、戻った時刻に立つ\n for (const main of layout.mains)\n for (const br of main.branches) {\n const lanes = layout.lanes.filter((x) => x.step === s && x.from === main.from && x.to === br.to);\n const start = lanes.some((x) => x.opened === undefined);\n const moves = lanes\n .flatMap((x): [number, boolean][] => [\n ...(timeOf(s, x.opened) === undefined ? [] : [[timeOf(s, x.opened) as number, true] as [number, boolean]]),\n ...(timeOf(s, x.shut) === undefined ? [] : [[timeOf(s, x.shut) as number, false] as [number, boolean]]),\n ])\n .sort((x, y) => x[0] - y[0]);\n const end = moves.length > 0 ? (moves[moves.length - 1] as [number, boolean])[1] : start;\n const vertical = br.valve.vertical;\n const under = br.valve.under;\n const turn =\n moves.length === 0\n ? \"\"\n : rotation(\n leverAngle(vertical, start, under),\n moves.map(([t, opened]): [number, number] => [t, leverAngle(vertical, opened, under)]),\n deg,\n M.lever,\n );\n let open = \"\";\n if (moves.length > 0) {\n const frames: Frame[] = [[0, { opacity: start ? 1 : 0 }]];\n let now = start;\n for (const [t, opened] of moves) {\n frames.push([t, { opacity: now ? 1 : 0 }], [t + f, { opacity: opened ? 1 : 0 }]);\n now = opened;\n }\n frames.push([m.total, { opacity: now ? 1 : 0 }]);\n open = m.kf(frames);\n }\n parts.push(valve(br.valve.x, br.valve.y, vertical, moves.length === 0 ? end : false, on({ lever: `${main.from}>${br.to}` }), ctx, turn, open, under));\n }\n // 計器。確かめた段は、確かめた時刻に針が振れて通ったかの印が付く。計器は薄くしない\n for (const g of layout.gauges.filter((x) => x.step === s)) {\n ctx.pieces?.push({ kind: \"gauge\", box: parties.get(g.party)?.name ?? g.party, rects: gaugeRects(g), shown: whole });\n const attrs = on({ gauge: g.party, ok: String(g.ok) });\n const t = g.fresh ? timeOf(s, g.event) : undefined;\n if (t === undefined) {\n parts.push(gauge(g, ctx, whole, attrs));\n continue;\n }\n const over = g.angle + (g.ok ? 22 : -26);\n const swing = m.kf([\n [0, { transform: deg(g.from) }],\n [t, { transform: deg(g.from) }, EASE.inOut],\n [t + M.needle * 0.5, { transform: deg(over) }, EASE.inOut],\n [t + M.needle, { transform: deg(g.angle) }],\n [m.total, { transform: deg(g.angle) }],\n ]);\n const lit = `transform-origin:${r1(g.lamp.x)}px ${r1(g.lamp.y)}px;${m.pop(t + M.lamp, b)}`;\n parts.push(gauge(g, ctx, whole, attrs, swing, lit));\n }\n // 名札と輪\n for (const p of layout.parties.filter((x) => x.shape !== \"token\")) {\n const involved = pillOf(p.id)?.involved ?? false;\n const attrs = on({ party: p.id, role: p.role });\n parts.push(\n dimmed(\n involved,\n p.shape === \"round\"\n ? avatar(p, involved, ctx, whole, attrs, look, `url(#${defId(ctx, \"av\")})`)\n : cabinet(p, involved, pooled.has(p.id), ctx, whole, attrs, look),\n ),\n );\n }\n for (const r of layout.rings.filter((x) => x.step === s)) {\n const p = parties.get(r.party);\n const pill = pillOf(r.party);\n if (!p || !pill) continue;\n const radius = p.shape === \"round\" ? undefined : p.shape === \"token\" ? P.token.radius : P.cabinet.radius;\n const round = p.shape === \"round\" ? { ...pill, x: pill.x + pill.w / 2 - P.avatar.halo, y: pill.y + pill.h / 2 - P.avatar.halo, w: P.avatar.halo * 2, h: P.avatar.halo * 2 } : pill;\n parts.push(appear(timeOf(s, r.event), ring(round, on({ ring: r.party }), ctx, radius)));\n }\n // イベントの札。出した者の箱の横に出る\n for (const e of layout.events.filter((x) => x.step === s)) {\n const attrs = on({ event: `${e.party}.${e.name}`, state: e.state });\n const t = timeOf(s, e.event);\n const prev = layout.events.find((x) => x.step === s - 1 && x.id === e.id);\n if (t !== undefined && prev) parts.push(vanish(t, eventChip(prev, ctx, until(t), \"\")));\n parts.push(appear(t, eventChip(e, ctx, since(t), attrs)));\n }\n // 図の中の札。流れた量と計器の式は変えた出来事の時刻に出す。済んだ段の流れた量は薄くする\n for (const c of layout.chips.filter((x) => x.step === s && x.kind !== \"event\" && x.kind !== \"return\")) {\n const t = timeOf(s, c.event);\n parts.push(dimmed(c.kind !== \"amount\" || c.event !== undefined, appear(t, chipPart(c, ctx, since(t), on({ chip: c.kind, ...(c.token ? { token: c.token } : {}) })))));\n }\n // 戻り値の札。戻した時刻に呼ばれた側を出て、呼び出しの管を伝って呼んだ側へ戻る\n for (const c of layout.chips.filter((x) => x.step === s && x.kind === \"return\" && x.path && x.path.length > 1)) {\n const path = c.path as [number, number][];\n const t0 = timeOf(s, c.event) ?? a;\n const still = timeline.stills[s] ?? span.end;\n const t1 = Math.max(t0 + 0.2, Math.min(t0 + M.slug + M.level, still - 0.05));\n const [sx, sy] = path[0] as [number, number];\n const total = path.slice(1).reduce((sum, p, i) => sum + Math.abs(p[0] - (path[i] as [number, number])[0]) + Math.abs(p[1] - (path[i] as [number, number])[1]), 0) || 1;\n const frames: Frame[] = [\n [0, { transform: \"translate(0,0)\" }],\n [t0, { transform: \"translate(0,0)\" }],\n ];\n let walked = 0;\n path.slice(1).forEach((p, i) => {\n const q = path[i] as [number, number];\n walked += Math.abs(p[0] - q[0]) + Math.abs(p[1] - q[1]);\n frames.push([t0 + ((t1 - t0) * walked) / total, { transform: `translate(${r1(p[0] - sx)}px,${r1(p[1] - sy)}px)` }]);\n });\n const [ex, ey] = path[path.length - 1] as [number, number];\n frames.push([m.total, { transform: `translate(${r1(ex - sx)}px,${r1(ey - sy)}px)` }]);\n // 札の字は止め絵で止まる所に記録する。描く所は動き出す所で、動きが止まる所まで運ぶ (#3523)\n const drawnFrom = ctx.ink.length;\n parts.push(\n `<g class=\"dg-a\" style=\"${m.vis(t0, t1 + f)}\"><g class=\"dg-a\" data-pipe-return-chip=\"\" data-pipe-step=\"${s}\" data-pipe-x=\"${r1(sx)}\" data-pipe-y=\"${r1(sy)}\" style=\"${m.kf(frames)}\">` +\n `${chipPart(c, ctx, [[t0, t1 + f]], \"\")}</g></g>`,\n );\n for (const ink of ctx.ink.slice(drawnFrom)) ink.rect = { ...ink.rect, x: ink.rect.x + ex - sx, y: ink.rect.y + ey - sy };\n // 描く方は t1+f まで濃く見せて t1+2f にかけて消すので、崩れの検査も t1+2f まで見えているとみなす (#3607)\n ctx.pieces?.push({ kind: \"chip\", text: c.text, rect: { x: c.x + ex - sx, y: c.y + ey - sy, w: c.w, h: c.h }, shown: [[t1, t1 + 2 * f]] });\n }\n // 畳んだ箱\n for (const fold of layout.folds.filter((x) => x.step === s)) parts.push(foldBox(fold, ctx, whole, ` data-pipe-step=\"${s}\"`));\n out.push(`<g class=\"dg-a\" data-pipe-frame=\"${s}\" style=\"${m.vis(a, b)}\">${parts.join(\"\")}</g>`);\n });\n return { base: `<g class=\"dg-pp\">${out.join(\"\")}</g>`, css: PIPE_CSS };\n}\n","/**\n * 配管の図の管の道を、縦と横の線の格子の上で探す (#3418)。\n *\n * 管は格子の点から隣の点へ縦か横に進み、折れるたびに値を足す。後ろへは戻らない。\n * 障害の四角 (広げた縁を含む) の中を通る道と、置いた線と重なるか近すぎる道は選ばない。\n * 置いた線を直角に越えてよいかと越える時の値は、頼む側 (`Ask.cross`) が線の種類ごとに決める。値の管はほかの値の管を越えず、呼び出しの管は値の管を越えてよい。\n * 重なってよい組 (`group`) が同じ線どうしは、重なって走る道を選べる。同じ者から出る呼び出しの管は 1 本の本管を分け合い、\n * 同じ槽を端に持つ同じトークンの値の管は 1 本の幹を分け合う。重なって走る所は値を減らして数え (`Ask.share`)、幹から枝が分かれる形にする。\n * 同じ組の線も、直角に突き抜けて越える道は選ばない。突き抜けると十字の継ぎ目に見え、どの枝がどこへ行くかが読めない。\n * 並べ方 (`layout.ts`) が格子の線と障害と管の端を渡し、この file は道だけを返す。部品の置き場所は決めない\n */\nimport type { Point, Rect } from \"./layout/scene\";\n\n/** 進む向き。0 が右、1 が下、2 が左、3 が上 */\nexport type Dir = 0 | 1 | 2 | 3;\nconst DX = [1, 0, -1, 0] as const;\nconst DY = [0, 1, 0, -1] as const;\n/** 置いた線の種類。値の管、呼び出しの管、名札から囲いへの点線、トークンの箱から管への短い管、書き込む管、呼び出しの管の弁が描く形の縁 */\nexport type LineKind = \"value\" | \"call\" | \"tie\" | \"stub\" | \"write\" | \"valve\";\n\n/** 置いた線の 1 本の線分。`group` が同じ線どうしは重なってよい */\nexport interface Laid {\n a: Point;\n b: Point;\n owner: string;\n group: string;\n kind: LineKind;\n width: number;\n}\n\n/** 管の端。始まりは `at` から `dir` の向きに出て、終わりは `dir` の向きに進んで `at` に入る。`cost` はこの端を使う時に足す値 */\nexport interface End {\n at: Point;\n dir: Dir;\n cost?: number;\n}\n\nexport interface Ask {\n owner: string;\n group: string;\n kind: LineKind;\n width: number;\n starts: readonly End[];\n ends: readonly End[];\n /** 通ってよい障害の番号 */\n allow?: ReadonlySet<number>;\n /** 置いた線を直角に越える時に足す値。`undefined` は越えない */\n cross: (l: Laid) => number | undefined;\n /** 平行な線と縁どうしの間の下限 */\n gap: number;\n /** 折れる時に足す値 */\n bend: number;\n /**\n * 障害の縁と、ほかの線の隣の筋に沿って走る時に、長さを減らす割合。0 より大きいと、管は縁と先に引いた管に寄り添って束になり、\n * 内側から順に引いた管が入れ子に並ぶ。値が同じ道が幾つも在る時に、どれを選ぶかを決める\n */\n hug?: number;\n /**\n * 同じ組の置いた線と重なって走る辺の長さに掛ける割合。1 より小さいと、後から引く管は先に引いた同じ組の管の道を幹として共に通り、\n * 相手の近くで枝分かれする。省くと 1 で、重なっても値は減らない\n */\n share?: number;\n}\n\n/** 道を探す障害。`pad` だけ広げた四角の中を通らない */\nexport interface Obstacle {\n rect: Rect;\n pad: number;\n}\n\nconst near = (a: number, b: number): boolean => Math.abs(a - b) < 0.5;\n\n/** 並べた数の中で `v` 以上の最初の番号 */\nfunction lowerBound(list: readonly number[], v: number): number {\n let lo = 0;\n let hi = list.length;\n while (lo < hi) {\n const mid = (lo + hi) >> 1;\n if ((list[mid] as number) < v) lo = mid + 1;\n else hi = mid;\n }\n return lo;\n}\n\n/** 数を並べ、`min` より近い数を 1 つにまとめる。`keep` の数は必ず残す */\nexport function gridLines(values: readonly number[], keep: readonly number[], min: number): number[] {\n // 残す値は丸めない。丸めると槽の縁が縁の内側へずれ、口から外へ出る辺が槽の中と数えられる\n const out: number[] = [];\n for (const v of [...keep].sort((a, b) => a - b)) if (out.length === 0 || v - (out[out.length - 1] as number) > 0.01) out.push(v);\n for (const v of [...values].sort((a, b) => a - b)) {\n const i = lowerBound(out, v);\n const lo = out[i - 1];\n const hi = out[i];\n if ((lo !== undefined && v - lo < min) || (hi !== undefined && hi - v < min)) continue;\n out.splice(i, 0, v);\n }\n return out;\n}\n\n/**\n * 値の小さい順に取り出す山。値が同じ物の順は、入れ替えて並べ直す山と同じ。\n * 入れた時の道の値 (`g`) も持ち、取り出した物の `g` を `poppedG` で返す。\n * 道を探すたびに山を作らず、型付きの配列を使い回す (#3472)。並べ方は配列で持っていた時と同じで、取り出す順は変わらない\n */\nclass Heap {\n private costs = new Float64Array(1024);\n private states = new Int32Array(1024);\n private gs = new Float64Array(1024);\n private n = 0;\n /** 最後に取り出した物を入れた時の道の値 */\n poppedG = 0;\n\n clear(): void {\n this.n = 0;\n }\n\n size(): number {\n return this.n;\n }\n\n push(cost: number, state: number, g: number): void {\n if (this.n === this.costs.length) this.grow();\n const { costs, states, gs } = this;\n let i = this.n++;\n while (i > 0) {\n const p = (i - 1) >> 1;\n const pc = costs[p] as number;\n if (pc <= cost) break;\n costs[i] = pc;\n states[i] = states[p] as number;\n gs[i] = gs[p] as number;\n i = p;\n }\n costs[i] = cost;\n states[i] = state;\n gs[i] = g;\n }\n\n pop(): number {\n const { costs, states, gs } = this;\n const top = states[0] as number;\n this.poppedG = gs[0] as number;\n const m = --this.n;\n if (m > 0) {\n const lastC = costs[m] as number;\n const lastS = states[m] as number;\n const lastG = gs[m] as number;\n let i = 0;\n for (;;) {\n const l = i * 2 + 1;\n const r = l + 1;\n let k = i;\n let kc = lastC;\n if (l < m && (costs[l] as number) < kc) {\n k = l;\n kc = costs[l] as number;\n }\n if (r < m && (costs[r] as number) < kc) {\n k = r;\n kc = costs[r] as number;\n }\n if (k === i) break;\n costs[i] = kc;\n states[i] = states[k] as number;\n gs[i] = gs[k] as number;\n i = k;\n }\n costs[i] = lastC;\n states[i] = lastS;\n gs[i] = lastG;\n }\n return top;\n }\n\n private grow(): void {\n const size = this.costs.length * 2;\n const costs = new Float64Array(size);\n const states = new Int32Array(size);\n const gs = new Float64Array(size);\n costs.set(this.costs);\n states.set(this.states);\n gs.set(this.gs);\n this.costs = costs;\n this.states = states;\n this.gs = gs;\n }\n}\nconst open = new Heap();\n\n/**\n * 置いた線と格子の辺の関わり。`cross` は直角に越えるか触れる、`along` は平行に `d` だけ離れて並ぶ。\n * `cross` の `d` は、辺が線分の端の間を越える時 0、線分の端に触れる時 1\n */\ninterface Mark {\n laid: number;\n rel: \"cross\" | \"along\";\n d: number;\n}\n\n/** 障害も印も無い辺が返す空の列。辺ごとに空の配列を作らない (#3472) */\nconst NONE: readonly never[] = [];\n\n/** 道を探す作業の配列。格子の点の数で決まる大きさを持ち、Router を作り直しても使い回す (#3472) */\ninterface Work {\n seen: Uint32Array;\n best: Float64Array;\n from: Int32Array;\n goal: Uint32Array;\n goalCost: Float64Array;\n hSeen: Uint32Array;\n hCost: Float64Array;\n vSeen: Uint32Array;\n vCost: Float64Array;\n hHug: Uint8Array;\n vHug: Uint8Array;\n hJoin: Int32Array;\n vJoin: Int32Array;\n /** 点ごとの終わりまでの見積もりと、それを求めた探しの番号 */\n guessSeen: Uint32Array;\n guessVal: Float64Array;\n}\nlet shared: Work | undefined;\n/** 道を探すたびに 1 つ進める番号。作業の配列を Router の間で使い回すため、全ての Router で 1 つの番号を数える */\nlet epoch = 0;\n\n/** `cells` 個の格子の点を探せる作業の配列。前に作った配列が足りる時は使い回す */\nfunction workFor(cells: number): Work {\n if (shared && shared.hSeen.length >= cells) return shared;\n const size = cells * 4;\n shared = {\n seen: new Uint32Array(size),\n best: new Float64Array(size),\n from: new Int32Array(size),\n goal: new Uint32Array(size),\n goalCost: new Float64Array(size),\n hSeen: new Uint32Array(cells),\n hCost: new Float64Array(cells),\n vSeen: new Uint32Array(cells),\n vCost: new Float64Array(cells),\n hHug: new Uint8Array(cells),\n vHug: new Uint8Array(cells),\n hJoin: new Int32Array(cells),\n vJoin: new Int32Array(cells),\n guessSeen: new Uint32Array(cells),\n guessVal: new Float64Array(cells),\n };\n // 新しい配列の番号は全て 0 なので、0 より大きい番号から数え直す\n epoch = 0;\n return shared;\n}\n\nexport class Router {\n readonly xs: readonly number[];\n readonly ys: readonly number[];\n readonly laid: Laid[] = [];\n private readonly nx: number;\n private readonly ny: number;\n /** 横の辺 (i, j)-(i+1, j) と縦の辺 (i, j)-(i, j+1) が通る障害。障害の無い辺は持たない (#3472) */\n private readonly hObs: (number[] | undefined)[];\n private readonly vObs: (number[] | undefined)[];\n private readonly hMarks: (Mark[] | undefined)[];\n private readonly vMarks: (Mark[] | undefined)[];\n /** 障害の広げた縁の上を通る辺 */\n private readonly hRail: Uint8Array;\n private readonly vRail: Uint8Array;\n /** `edgeCost` が最後に見た辺が、縁かほかの線の隣の筋か */\n private lastRail = false;\n /** `edgeCost` が最後に見た辺が、同じ組の置いた線と重なって走るか */\n private lastShared = false;\n /** `edgeCost` が最後に見た辺が直角に越えるか触れる、同じ組の置いた線分の番号。無ければ -1 */\n private lastJoin = -1;\n\n constructor(xs: readonly number[], ys: readonly number[], obstacles: readonly Obstacle[]) {\n this.xs = xs;\n this.ys = ys;\n this.nx = xs.length;\n this.ny = ys.length;\n // 辺の数だけ空の配列を作ると、開いた箱を持つ図では Router ごとに 10 万個を超え、作るだけで描く時間の 1 割を使った (#3472)\n this.hObs = new Array<number[] | undefined>(this.nx * this.ny);\n this.vObs = new Array<number[] | undefined>(this.nx * this.ny);\n this.hMarks = new Array<Mark[] | undefined>(this.nx * this.ny);\n this.vMarks = new Array<Mark[] | undefined>(this.nx * this.ny);\n this.hRail = new Uint8Array(this.nx * this.ny);\n this.vRail = new Uint8Array(this.nx * this.ny);\n obstacles.forEach((o) => {\n const x0 = o.rect.x - o.pad;\n const x1 = o.rect.x + o.rect.w + o.pad;\n const y0 = o.rect.y - o.pad;\n const y1 = o.rect.y + o.rect.h + o.pad;\n // 上と下の縁の上を走る横の辺と、左と右の縁の上を走る縦の辺\n for (const y of [y0, y1]) {\n const j = this.iy(y);\n if (j < 0) continue;\n for (let i = Math.max(0, lowerBound(xs, x0 - 0.25)); i < this.nx - 1 && (xs[i + 1] as number) <= x1 + 0.25; i++) this.hRail[j * this.nx + i] = 1;\n }\n for (const x of [x0, x1]) {\n const i = this.ix(x);\n if (i < 0) continue;\n for (let j = Math.max(0, lowerBound(ys, y0 - 0.25)); j < this.ny - 1 && (ys[j + 1] as number) <= y1 + 0.25; j++) this.vRail[j * this.nx + i] = 1;\n }\n });\n obstacles.forEach((o, k) => {\n const x0 = o.rect.x - o.pad;\n const x1 = o.rect.x + o.rect.w + o.pad;\n const y0 = o.rect.y - o.pad;\n const y1 = o.rect.y + o.rect.h + o.pad;\n // 横の辺は、高さが四角の中で、横の範囲が四角と重なる物\n for (let j = lowerBound(ys, y0 + 1e-6); j < this.ny && (ys[j] as number) < y1 - 1e-6; j++)\n for (let i = Math.max(0, lowerBound(xs, x0) - 1); i < this.nx - 1 && (xs[i] as number) < x1 - 1e-6; i++)\n if ((xs[i + 1] as number) > x0 + 1e-6) (this.hObs[j * this.nx + i] ??= []).push(k);\n for (let i = lowerBound(xs, x0 + 1e-6); i < this.nx && (xs[i] as number) < x1 - 1e-6; i++)\n for (let j = Math.max(0, lowerBound(ys, y0) - 1); j < this.ny - 1 && (ys[j] as number) < y1 - 1e-6; j++)\n if ((ys[j + 1] as number) > y0 + 1e-6) (this.vObs[j * this.nx + i] ??= []).push(k);\n });\n }\n\n private ix(x: number): number {\n const i = lowerBound(this.xs, x - 0.25);\n return i < this.nx && near(this.xs[i] as number, x) ? i : -1;\n }\n private iy(y: number): number {\n const j = lowerBound(this.ys, y - 0.25);\n return j < this.ny && near(this.ys[j] as number, y) ? j : -1;\n }\n\n /** 線分を置き、関わる格子の辺に印を付ける。線分は縦か横 */\n private mark(index: number): void {\n const l = this.laid[index] as Laid;\n const reach = l.width / 2 + 40;\n if (near(l.a[1], l.b[1])) {\n const y = l.a[1];\n const lo = Math.min(l.a[0], l.b[0]);\n const hi = Math.max(l.a[0], l.b[0]);\n // 縦の辺のうち、線分の横の範囲の中を通り、高さが線分にかかる物\n for (let i = lowerBound(this.xs, lo - 0.25); i < this.nx && (this.xs[i] as number) <= hi + 0.25; i++)\n for (let j = Math.max(0, lowerBound(this.ys, y) - 1); j < this.ny - 1 && (this.ys[j] as number) <= y + 0.25; j++)\n if ((this.ys[j + 1] as number) >= y - 0.25) (this.vMarks[j * this.nx + i] ??= []).push({ laid: index, rel: \"cross\", d: (this.xs[i] as number) > lo + 0.5 && (this.xs[i] as number) < hi - 0.5 ? 0 : 1 });\n // 横の辺のうち、近くを平行に走る物\n for (let j = lowerBound(this.ys, y - reach); j < this.ny && (this.ys[j] as number) <= y + reach; j++)\n for (let i = Math.max(0, lowerBound(this.xs, lo) - 1); i < this.nx - 1 && (this.xs[i] as number) < hi; i++)\n if ((this.xs[i + 1] as number) > lo) (this.hMarks[j * this.nx + i] ??= []).push({ laid: index, rel: \"along\", d: Math.abs((this.ys[j] as number) - y) });\n } else {\n const x = l.a[0];\n const lo = Math.min(l.a[1], l.b[1]);\n const hi = Math.max(l.a[1], l.b[1]);\n for (let j = lowerBound(this.ys, lo - 0.25); j < this.ny && (this.ys[j] as number) <= hi + 0.25; j++)\n for (let i = Math.max(0, lowerBound(this.xs, x) - 1); i < this.nx - 1 && (this.xs[i] as number) <= x + 0.25; i++)\n if ((this.xs[i + 1] as number) >= x - 0.25) (this.hMarks[j * this.nx + i] ??= []).push({ laid: index, rel: \"cross\", d: (this.ys[j] as number) > lo + 0.5 && (this.ys[j] as number) < hi - 0.5 ? 0 : 1 });\n for (let i = lowerBound(this.xs, x - reach); i < this.nx && (this.xs[i] as number) <= x + reach; i++)\n for (let j = Math.max(0, lowerBound(this.ys, lo) - 1); j < this.ny - 1 && (this.ys[j] as number) < hi; j++)\n if ((this.ys[j + 1] as number) > lo) (this.vMarks[j * this.nx + i] ??= []).push({ laid: index, rel: \"along\", d: Math.abs((this.xs[i] as number) - x) });\n }\n }\n\n /** 線を置く。後から探す道は、この線と重ならず、越えるかは頼む側が決める */\n lay(points: readonly Point[], line: Omit<Laid, \"a\" | \"b\">): void {\n for (let k = 1; k < points.length; k++) {\n const a = points[k - 1] as Point;\n const b = points[k] as Point;\n if (near(a[0], b[0]) && near(a[1], b[1])) continue;\n this.laid.push({ ...line, a, b });\n this.mark(this.laid.length - 1);\n }\n }\n\n /** 辺を通る時に足す値。通れない辺は `undefined` */\n private edgeCost(ask: Ask, horizontal: boolean, index: number): number | undefined {\n const obs = (horizontal ? this.hObs : this.vObs)[index] ?? NONE;\n for (const o of obs) if (!ask.allow?.has(o)) return undefined;\n let extra = 0;\n this.lastRail = ((horizontal ? this.hRail : this.vRail)[index] as number) === 1;\n this.lastShared = false;\n this.lastJoin = -1;\n /** この辺で越える値を足した組。幹を共に通る何本もの線を越える時も、1 本を越える値だけを足す */\n let charged: string[] | undefined;\n for (const m of (horizontal ? this.hMarks : this.vMarks)[index] ?? NONE) {\n const l = this.laid[m.laid] as Laid;\n if (l.group === ask.group) {\n // 同じ組の線は重ねて共に通ってよいが、少しずれて並ぶと二重の線に見えるため、重ならない時は間を取る\n if (m.rel === \"along\") {\n if (m.d > 0.5 && m.d < (l.width + ask.width) / 2 + ask.gap) return undefined;\n if (m.d <= 0.5) this.lastShared = true;\n } else if (m.d === 0 && this.lastJoin < 0) this.lastJoin = m.laid;\n continue;\n }\n if (m.rel === \"along\") {\n const least = (l.width + ask.width) / 2 + ask.gap;\n if (m.d < least) return undefined;\n // 隣の筋。間の下限から、この線の太さの分までの離れ\n if (m.d < least + ask.width) this.lastRail = true;\n continue;\n }\n const c = ask.cross(l);\n if (c === undefined) return undefined;\n if (charged?.includes(l.group)) continue;\n (charged ??= []).push(l.group);\n extra += c;\n }\n return extra;\n }\n\n /** 格子の上の真っすぐな線分 a-b を、頼む側の決まりで通れるか。端が格子に無い時は通れないとする */\n passable(ask: Ask, a: Point, b: Point): boolean {\n let i = this.ix(a[0]);\n let j = this.iy(a[1]);\n const ti = this.ix(b[0]);\n const tj = this.iy(b[1]);\n if (i < 0 || j < 0 || ti < 0 || tj < 0 || (i !== ti && j !== tj)) return false;\n let join = -1;\n while (i !== ti || j !== tj) {\n const d: Dir = ti > i ? 0 : ti < i ? 2 : tj > j ? 1 : 3;\n const ni = i + DX[d];\n const nj = j + DY[d];\n const horizontal = d === 0 || d === 2;\n const index = horizontal ? j * this.nx + Math.min(i, ni) : Math.min(j, nj) * this.nx + i;\n if (this.edgeCost(ask, horizontal, index) === undefined) return false;\n // 同じ組の線を突き抜けない\n if (this.lastJoin >= 0 && this.lastJoin === join) return false;\n join = this.lastJoin;\n i = ni;\n j = nj;\n }\n return true;\n }\n\n /**\n * 始まりの端のどれかから終わりの端のどれかまでの、値の最も小さい道。端は格子の点に在る。\n * 道が無ければ `undefined`。返す点は折れる所だけ\n */\n route(ask: Ask): Point[] | undefined {\n const { nx, ny } = this;\n const { seen, best, from, goal, goalCost, hSeen, hCost, vSeen, vCost, hHug, vHug, hJoin, vJoin, guessSeen, guessVal } = workFor(nx * ny);\n const hug = ask.hug ?? 0;\n const share = ask.share ?? 1;\n const ep = ++epoch;\n const bestOf = (st: number): number => (seen[st] === ep ? (best[st] as number) : Number.POSITIVE_INFINITY);\n open.clear();\n let goals = 0;\n for (const e of ask.ends) {\n const i = this.ix(e.at[0]);\n const j = this.iy(e.at[1]);\n if (i < 0 || j < 0) continue;\n const st = (j * nx + i) * 4 + e.dir;\n // 同じ点と向きの終わりが 2 つ在る時は、後に書いた方の値を使う\n goal[st] = ep;\n goalCost[st] = e.cost ?? 0;\n goals++;\n }\n if (goals === 0) return undefined;\n const ex = Float64Array.from(ask.ends, (e) => e.at[0]);\n const ey = Float64Array.from(ask.ends, (e) => e.at[1]);\n // 見積もりは点と終わりの端だけで決まるため、同じ探しの中では点ごとに 1 度だけ求める。\n // 山に入れるたびに全ての終わりの端と比べると、開いた箱を持つ図では探しの時間の多くを使った (#3472)\n const guess = (i: number, j: number): number => {\n const node = j * nx + i;\n if (guessSeen[node] === ep) return guessVal[node] as number;\n const x = this.xs[i] as number;\n const y = this.ys[j] as number;\n let m = Number.POSITIVE_INFINITY;\n for (let k = 0; k < ex.length; k++) {\n const v = Math.abs((ex[k] as number) - x) + Math.abs((ey[k] as number) - y);\n if (v < m) m = v;\n }\n // 寄り添う辺は長さを減らして数えるため、見積もりも同じ割合で減らし、見積もりが本当の値を超えないようにする。\n // 同じ組の線と重なる辺はさらに減らして数えるが、見積もりは減らさない。見積もりが本当の値を超える所では、\n // 相手へ向かう幹を先に辿るため幹を共に通る道が早く見つかり、探す点の数も増えない\n const v = m * (1 - hug);\n guessSeen[node] = ep;\n guessVal[node] = v;\n return v;\n };\n /** 辺を通る時に足す値。通れない辺は -1。同じ探しの中では辺の値は変わらないため、1 度だけ求める */\n const edge = (horizontal: boolean, index: number): number => {\n const stamp = horizontal ? hSeen : vSeen;\n const cost = horizontal ? hCost : vCost;\n if (stamp[index] === ep) return cost[index] as number;\n const extra = this.edgeCost(ask, horizontal, index);\n stamp[index] = ep;\n cost[index] = extra === undefined ? -1 : extra;\n // 辺の走り方。0 はほかの線から離れて走る、1 は縁かほかの線の隣の筋に寄り添う、2 は同じ組の線と重なって走る\n (horizontal ? hHug : vHug)[index] = this.lastShared ? 2 : this.lastRail ? 1 : 0;\n (horizontal ? hJoin : vJoin)[index] = this.lastJoin;\n return cost[index];\n };\n /** 辺の長さに掛ける割合 */\n const rate = (run: number): number => (run === 2 ? share : run === 1 ? 1 - hug : 1);\n /** 点 (i, j) から向き d に 1 つ進む値。進めない時は -1 */\n const stepCost = (i: number, j: number, d: Dir): number => {\n const ni = i + DX[d];\n const nj = j + DY[d];\n if (ni < 0 || nj < 0 || ni >= nx || nj >= ny) return -1;\n const horizontal = d === 0 || d === 2;\n const index = horizontal ? j * nx + Math.min(i, ni) : Math.min(j, nj) * nx + i;\n const extra = edge(horizontal, index);\n if (extra < 0) return -1;\n const len = horizontal ? Math.abs((this.xs[ni] as number) - (this.xs[i] as number)) : Math.abs((this.ys[nj] as number) - (this.ys[j] as number));\n return len * rate((horizontal ? hHug : vHug)[index] as number) + extra;\n };\n /**\n * 点 (i, j) へ向き d で入った辺と、そのまま d へ進む辺が、同じ組の同じ線分を直角に越えるか。\n * 越えると同じ組の線を突き抜けて十字の継ぎ目になるため、その進み方を選ばない\n */\n const piercing = (i: number, j: number, d: Dir): boolean => {\n const horizontal = d === 0 || d === 2;\n const pi = i - DX[d];\n const pj = j - DY[d];\n const ni = i + DX[d];\n const nj = j + DY[d];\n if (pi < 0 || pj < 0 || ni < 0 || nj < 0 || pi >= nx || pj >= ny || ni >= nx || nj >= ny) return false;\n const joins = horizontal ? hJoin : vJoin;\n const stamp = horizontal ? hSeen : vSeen;\n const before = horizontal ? j * nx + Math.min(i, pi) : Math.min(j, pj) * nx + i;\n const after = horizontal ? j * nx + Math.min(i, ni) : Math.min(j, nj) * nx + i;\n if (stamp[before] !== ep || stamp[after] !== ep) return false;\n const a = joins[before] as number;\n return a >= 0 && a === joins[after];\n };\n for (const s of ask.starts) {\n const i = this.ix(s.at[0]);\n const j = this.iy(s.at[1]);\n if (i < 0 || j < 0) continue;\n const c = stepCost(i, j, s.dir);\n if (c < 0) continue;\n const ni = i + DX[s.dir];\n const nj = j + DY[s.dir];\n const state = (nj * nx + ni) * 4 + s.dir;\n const g = c + (s.cost ?? 0);\n if (g < bestOf(state)) {\n seen[state] = ep;\n best[state] = g;\n from[state] = -2 - ((j * nx + i) * 4 + s.dir);\n open.push(g + guess(ni, nj), state, g);\n }\n }\n let found = -1;\n let foundCost = Number.POSITIVE_INFINITY;\n const bend = ask.bend;\n while (open.size() > 0) {\n const state = open.pop();\n const g = best[state] as number;\n if (g >= foundCost) break;\n // 後から小さい値で入れ直した状態の古い物は飛ばす。新しい物は値が小さいため先に取り出して同じ値で広げ終えており、\n // 広げ直しても山に入れる物も辺の覚えも変わらない (#3472)。終わりの状態は、新しい物を広げずに終えた時があるため飛ばさない\n const isGoal = goal[state] === ep;\n if (!isGoal && open.poppedG > g) continue;\n const node = state >> 2;\n const d = (state & 3) as Dir;\n if (isGoal && g + (goalCost[state] as number) < foundCost) {\n found = state;\n foundCost = g + (goalCost[state] as number);\n continue;\n }\n const i = node % nx;\n const j = (node - i) / nx;\n // そのまま進む、右へ折れる、左へ折れるの順に試す\n for (let t = 0; t < 3; t++) {\n const nd = (t === 0 ? d : t === 1 ? (d + 1) & 3 : (d + 3) & 3) as Dir;\n const c = stepCost(i, j, nd);\n if (c < 0 || (t === 0 && piercing(i, j, d))) continue;\n const ni = i + DX[nd];\n const nj = j + DY[nd];\n const ng = t === 0 ? g + c : g + c + bend;\n const ns = (nj * nx + ni) * 4 + nd;\n if (seen[ns] !== ep || ng < (best[ns] as number)) {\n seen[ns] = ep;\n best[ns] = ng;\n from[ns] = state;\n open.push(ng + guess(ni, nj), ns, ng);\n }\n }\n }\n if (found < 0) return undefined;\n const states: number[] = [];\n let s = found;\n for (;;) {\n states.push(s);\n const f = from[s] as number;\n if (f <= -2) {\n states.push(-2 - f);\n break;\n }\n s = f;\n }\n states.reverse();\n const pts: Point[] = states.map((st) => {\n const node = st >> 2;\n const i = node % nx;\n return [this.xs[i] as number, this.ys[(node - i) / nx] as number];\n });\n return simplify(pts);\n }\n}\n\n/**\n * 道の途中の、`min` より短い段差を消す。段差の前か後ろの線を段差の分だけずらし、ずらした線が `ok` で通れる時だけ採る。\n * 前と後ろの線が逆向きに走る短い段差 (U の形) は、格子 (`grid`) を渡した時だけ、U の底の線を段差の向きに格子の線までずらして段差を `min` まで伸ばす。\n * 端の点は動かさない\n */\nexport function unjog(points: readonly Point[], min: number, ok: (a: Point, b: Point) => boolean, grid?: { xs: readonly number[]; ys: readonly number[] }): Point[] {\n let pts = simplify(points);\n for (let guard = 0; guard < 8; guard++) {\n let changed = false;\n for (let i = 0; i + 1 < pts.length && !changed; i++) {\n const p = pts[i] as Point;\n const q = pts[i + 1] as Point;\n const len = Math.abs(q[0] - p[0]) + Math.abs(q[1] - p[1]);\n if (len >= min) continue;\n const before = pts[i - 1];\n const after = pts[i + 2];\n const dx = q[0] - p[0];\n const dy = q[1] - p[1];\n // 前と後ろの線が両方在る時は、同じ向きに走る段差 (Z の形) を詰める。逆向き (U の形) を詰めると線が重なるため、U の底をずらして段差を伸ばす\n if (before && after) {\n const sameWay = near(before[0], p[0]) ? Math.sign(p[1] - before[1]) === Math.sign(after[1] - q[1]) : Math.sign(p[0] - before[0]) === Math.sign(after[0] - q[0]);\n if (!sameWay) {\n const grown = grid ? stretch(pts, i, min, ok, grid) : undefined;\n if (grown) {\n pts = grown;\n changed = true;\n }\n continue;\n }\n }\n // 前の線をずらす。前の線の始まり (端の点でもよい) は動かさない\n if (before && i - 2 >= 0) {\n const b2 = pts[i - 2] as Point;\n const moved: Point = [before[0] + dx, before[1] + dy];\n if (ok(b2, moved) && ok(moved, q)) {\n pts = simplify([...pts.slice(0, i - 1), moved, ...pts.slice(i + 1)]);\n changed = true;\n continue;\n }\n }\n // 後ろの線をずらす。後ろの線の終わり (端の点でもよい) は動かさない\n if (after && i + 3 <= pts.length - 1) {\n const a2 = pts[i + 3] as Point;\n const moved: Point = [after[0] - dx, after[1] - dy];\n if (ok(p, moved) && ok(moved, a2)) {\n pts = simplify([...pts.slice(0, i + 1), moved, ...pts.slice(i + 3)]);\n changed = true;\n continue;\n }\n }\n // 詰められない Z の形の段差は、前の線を段差と逆の向きへ、または後ろの線を段差の向きへずらして `min` まで伸ばす。\n // 前と後ろの線の筋が、それぞれ別の部品の際で決まっていて揃えられない時に残る\n if (before && after && len > 0.5) {\n const grown = widen(pts, i, min, ok, grid);\n if (grown) {\n pts = grown;\n changed = true;\n }\n }\n }\n if (!changed) break;\n }\n return pts;\n}\n\n/**\n * U の形の短い段差 (`pts[i]` から `pts[i + 1]`) を `min` まで伸ばす。段差の後ろの線を段差の向きへ、段差の前の線を逆の向きへ、\n * 格子の線までずらす。ずらした線と、その先の線が `min` 以上で通れる時だけ採る。端の点は動かさない\n */\nfunction stretch(pts: readonly Point[], i: number, min: number, ok: (a: Point, b: Point) => boolean, grid: { xs: readonly number[]; ys: readonly number[] }): Point[] | undefined {\n const p = pts[i] as Point;\n const q = pts[i + 1] as Point;\n const vertical = near(p[0], q[0]);\n const axis = vertical ? 1 : 0;\n const lines = vertical ? grid.ys : grid.xs;\n const dir = Math.sign(q[axis] - p[axis]);\n const at = (v: Point, c: number): Point => (vertical ? [v[0], c] : [c, v[1]]);\n // 段差の終わりを先へ。後ろの線 (q から after) を段差の向きにずらし、その先の線 (after から a2) が短くなる\n const after = pts[i + 2];\n const a2 = pts[i + 3];\n if (after && a2) {\n const ends = lines.filter((c) => (c - p[axis]) * dir >= min).sort((u, v) => Math.abs(u - p[axis]) - Math.abs(v - p[axis]));\n for (const c of ends.slice(0, 4)) {\n const q2 = at(q, c);\n const after2 = at(after, c);\n const rest = (a2[axis] - c) * Math.sign(a2[axis] - after[axis]);\n if (rest < min || Math.sign(a2[axis] - c) !== Math.sign(a2[axis] - after[axis])) continue;\n if (ok(p, q2) && ok(q2, after2) && ok(after2, a2)) return simplify([...pts.slice(0, i + 1), q2, after2, ...pts.slice(i + 3)]);\n }\n }\n // 段差の始まりを手前へ。前の線 (before から p) を段差の逆の向きにずらし、その手前の線 (b2 から before) が短くなる\n const before = pts[i - 1];\n const b2 = pts[i - 2];\n if (before && b2) {\n const starts = lines.filter((c) => (q[axis] - c) * dir >= min).sort((u, v) => Math.abs(u - q[axis]) - Math.abs(v - q[axis]));\n for (const c of starts.slice(0, 4)) {\n const p2 = at(p, c);\n const before2 = at(before, c);\n const rest = (c - b2[axis]) * Math.sign(before[axis] - b2[axis]);\n if (rest < min || Math.sign(c - b2[axis]) !== Math.sign(before[axis] - b2[axis])) continue;\n if (ok(b2, before2) && ok(before2, p2) && ok(p2, q)) return simplify([...pts.slice(0, i - 1), before2, p2, ...pts.slice(i + 1)]);\n }\n }\n return undefined;\n}\n\n/**\n * Z の形の短い段差 (`pts[i]` から `pts[i + 1]`) を `min` まで伸ばす。段差の前の線を段差と逆の向きへずらすか、\n * 後ろの線を段差の向きへずらす。ずらす先は、格子 (`grid`) を渡した時は格子の線、渡さない時は段差がちょうど `min` になる所。\n * ずらした線と、その前と後ろの線が `ok` で通れる時だけ採る。端の点は動かさない\n */\nfunction widen(\n pts: readonly Point[],\n i: number,\n min: number,\n ok: (a: Point, b: Point) => boolean,\n grid?: { xs: readonly number[]; ys: readonly number[] },\n): Point[] | undefined {\n const p = pts[i] as Point;\n const q = pts[i + 1] as Point;\n const axis = near(p[0], q[0]) ? 1 : 0;\n const dir = Math.sign(q[axis] - p[axis]);\n const at = (v: Point, c: number): Point => (axis === 1 ? [v[0], c] : [c, v[1]]);\n const lines = grid ? (axis === 1 ? grid.ys : grid.xs) : undefined;\n /** 基の点 `from` から `dir` の逆 (`sign` が -1) か同じ向き (1) へ、`min` 以上離れた筋。近い順 */\n const targets = (from: number, sign: number): number[] =>\n lines\n ? lines.filter((c) => (c - from) * sign * dir >= min - 0.5).sort((u, v) => Math.abs(u - from) - Math.abs(v - from)).slice(0, 4)\n : [from + sign * dir * min];\n const before = pts[i - 1];\n const b2 = pts[i - 2];\n if (before && b2)\n for (const c of targets(q[axis], -1)) {\n const mb = at(before, c);\n const mp = at(p, c);\n if (ok(b2, mb) && ok(mb, mp) && ok(mp, q)) return simplify([...pts.slice(0, i - 1), mb, mp, ...pts.slice(i + 1)]);\n }\n const after = pts[i + 2];\n const a2 = pts[i + 3];\n if (after && a2)\n for (const c of targets(p[axis], 1)) {\n const mq = at(q, c);\n const ma = at(after, c);\n if (ok(p, mq) && ok(mq, ma) && ok(ma, a2)) return simplify([...pts.slice(0, i + 1), mq, ma, ...pts.slice(i + 3)]);\n }\n return undefined;\n}\n\n/** 一直線に並ぶ点を外し、折れる所と端だけを残す */\nexport function simplify(points: readonly Point[]): Point[] {\n const out: Point[] = [];\n for (const p of points) {\n const last = out[out.length - 1];\n if (last && near(last[0], p[0]) && near(last[1], p[1])) continue;\n const prev = out[out.length - 2];\n if (prev && last && ((near(prev[0], last[0]) && near(last[0], p[0])) || (near(prev[1], last[1]) && near(last[1], p[1])))) out[out.length - 1] = p;\n else out.push(p);\n }\n return out;\n}\n","/**\n * 配管の図の置き場所の形と、段ごとの値を当てる手順 (#3389、#3418)。見た目の元は Tracelyth の第6回の試作の「4 配管」(#3398)。\n *\n * 関係者の種類は行から導く。残高の単位に名前を書かれた関係者はトークンの Contract、最初の呼び出しを呼んだ者は送り手、\n * ほかに呼ぶか呼ばれる者は Contract、どちらでもない者は口座。\n * 段の中の出来事は記法を読む所と同じ手順 (`PipeRun`) に当て、段ごとの残高と値と、変更が暫定か確定か取り消しかを作る。\n * 変更は一番外の呼び出しが戻った段で確定し、落ちた呼び出しの内側の変更は、落ちた段で取り消しの印を付けて元の値へ戻る。\n * `[fold]` の呼び出しの内側の段は、描く前に 1 つの段へまとめる (`foldPipe`)。\n *\n * 部品の置き場所を組む手順 (`layoutPipe`) は、槽と値の札を持ち主ごとの囲いにまとめ、流れでつながる囲いを隣に並べる。\n * 流れが輪になる時は、輪の 1 つを下の段に置いて輪にする。\n * 名札は自分の囲いの真上に置き、呼び出しの深さで行を下げる。トークンの箱は自分のトークンの値の管の横に走る所に載せる。\n * 値の管は槽の横の口どうしを結び、ほかの値の管と交わらない。呼び出しの管は値の管を直角に 1 回だけくぐり、名札と槽を横切らない。\n * 管の道は `pipe-route.ts` が格子の上で探す。道が見つからない時は、囲いの間と管の道を広げて組み直す。\n * 決まりの表 (`pipe-rules.ts`) は組んだ置き場所を後から測る。組み方は表を読まず、表の値が守れる間を空けて置く。\n * 狭い枠では、図を枠の幅に縮めても槽の残高と今の段の値が読める大きさの字で組み直す。\n * 並べ方は描き方を読まない。描く部品は `render/pipe.ts` とブロックの描き方が持つ (#3418)。\n */\nimport { ETH } from \"../../blocks/definition-values\";\nimport { joinWords } from \"../../figure-text\";\nimport { textWidth } from \"../../layout/measure\";\nimport type { Layout, Point, Rect } from \"../../layout/scene\";\nimport { PIPE_LOOK, PIPE_TYPE } from \"../../look/pipe\";\nimport type { TextStyle } from \"../../look/values\";\nimport { type Ask, type Dir, type End, gridLines, type Laid, type Obstacle, Router, simplify, unjog } from \"../../pipe-route\";\nimport { checkPasses, isFault, keyOf, minus, PipeRun, rateOf } from \"../../pipe-run\";\nimport { valveRects } from \"../../pipe-valve\";\nimport type { CheckOp, DiagramModel, PipeCallKind, PipeCheck, PipeFold, Step } from \"../../schema\";\nimport { DEFAULT_LANG, type NotationLang } from \"../../words\";\n\n\n/** 変更の印。`none` は変わっていない、`provisional` は暫定、`final` は確定、`rolled` は取り消し */\nexport type PipeState = \"none\" | \"provisional\" | \"final\" | \"rolled\";\n/** 関係者の種類 */\nexport type PipeRole = \"sender\" | \"contract\" | \"token\" | \"account\";\n/** 名札の形。`round` は丸の名札、`cabinet` は Contract の箱、`token` はトークンの箱 */\nexport type PipeShape = \"round\" | \"cabinet\" | \"token\";\n\n/** 配管の図の言葉。図の原本は語を持たないので、描く時の言葉で引く */\nexport interface PipeWords {\n tags: Record<Exclude<PipeState, \"none\">, string>;\n /** 始めた人が払った槽の印と、受け取った槽の印 */\n io: { in: string; out: string };\n fold: (steps: number, parties: number) => string;\n open: string;\n foldTitle: (name: string) => string;\n join: (titles: readonly string[]) => string;\n}\n\nexport const PIPE_TEXT: Record<NotationLang, PipeWords> = {\n ja: {\n tags: { provisional: \"暫定\", final: \"確定\", rolled: \"取り消し\" },\n io: { in: \"入力\", out: \"出力\" },\n fold: (steps, parties) => `内側の${steps}段と${parties}人`,\n open: \"押すと開く\",\n foldTitle: (name) => `${name}の内側をまとめて進む`,\n join: (titles) => `${titles.join(\"。\")}。`,\n },\n en: {\n tags: { provisional: \"Pending\", final: \"Final\", rolled: \"Undone\" },\n io: { in: \"In\", out: \"Out\" },\n fold: (steps, parties) => `${steps} ${steps === 1 ? \"step\" : \"steps\"} and ${parties} ${parties === 1 ? \"party\" : \"parties\"} inside`,\n open: \"Click to open\",\n foldTitle: (name) => `Inside ${name}, folded`,\n join: (titles) => `${titles.join(\". \")}.`,\n },\n};\n\n/**\n * 呼ぶ側が渡す配管の図の語 (#3584)。画面を持つ側が自分の語 (成功、リバートなど) で描くために、`RenderOptions` の `words.pipe` で渡す。\n * 一部だけ渡せ、渡さない語は描く言葉の語 (`PIPE_TEXT`) で描く。数と名前が入る文は `{steps}`、`{parties}`、`{name}` の所に差し込む\n */\nexport interface PipeWordsInput {\n /** 槽の下の数に添える語。`provisional` は暫定、`final` は確定、`rolled` は取り消し */\n tags?: Partial<Record<Exclude<PipeState, \"none\">, string>>;\n /** 始めた人が払った槽の札 (`in`) と、受け取った槽の札 (`out`) */\n io?: Partial<Record<\"in\" | \"out\", string>>;\n /** 内側の段をまとめた枠の文。`{steps}` に内側の段の数、`{parties}` に内側の関係者の数を差し込む */\n fold?: string;\n /** まとめた枠を押すと開くことを知らせる語 */\n open?: string;\n /** まとめた段の題。`{name}` に呼ばれた関係者の名前を差し込む */\n foldTitle?: string;\n}\n\n/** `{鍵}` の所に値を差し込む。値を持たない鍵は書いたまま残す */\nconst fill = (template: string, values: Record<string, string | number>): string =>\n template.replace(/\\{(\\w+)\\}/gu, (whole, key: string) => (key in values ? String(values[key]) : whole));\n\n/** 描く言葉の語に、呼ぶ側が渡した語を重ねる (#3584) */\nexport function pipeWords(lang: NotationLang, given?: PipeWordsInput): PipeWords {\n const base = PIPE_TEXT[lang];\n if (!given) return base;\n const { fold, foldTitle } = given;\n return {\n tags: { ...base.tags, ...given.tags },\n io: { ...base.io, ...given.io },\n fold: fold === undefined ? base.fold : (steps, parties) => fill(fold, { steps, parties }),\n open: given.open ?? base.open,\n foldTitle: foldTitle === undefined ? base.foldTitle : (name) => fill(foldTitle, { name }),\n join: base.join,\n };\n}\n\n/** 比べ方の字。`>=` は `≥` のように、読む時の字にする */\nexport const OP_TEXT: Record<CheckOp, string> = { \">=\": \"≥\", \"<=\": \"≤\", \"==\": \"=\", \"!=\": \"≠\", \">\": \">\", \"<\": \"<\" };\n\n/** 字。`base` は基準線で、字は `x` から左寄せで書く */\nexport interface PipeText extends Rect {\n text: string;\n base: number;\n}\n\n/** 段の中の出来事の場所。その段で起きた物だけが持ち、描く所はこの出来事の時刻に出す */\nexport interface PipeAt {\n step: number;\n event?: number;\n}\n\nexport interface PipeParty extends Rect {\n id: string;\n name: string;\n role: PipeRole;\n icon?: string;\n shape: PipeShape;\n /** 名札の行。一番上が 0。トークンの箱は持たない */\n row?: number;\n /** 名前の字。丸の名札は丸の下、箱は箱の中に書く */\n label: PipeText;\n /** 槽か値の札を持つか */\n holder: boolean;\n}\nexport interface PipeColumn extends Rect {\n party: string;\n step: number;\n folded: boolean;\n}\n/** 段ごとの名札。`active` は段の終わりにいちばん内側で開いている呼び出しの呼ばれた者、`involved` はその段の出来事に出る者 */\nexport interface PipePill extends Rect {\n party: string;\n step: number;\n folded: boolean;\n active: boolean;\n involved: boolean;\n}\nexport interface PipeTank extends Rect {\n party: string;\n token: string;\n title: PipeText;\n /** 液の色の番号。トークンごとに 3 つの色を順に使う */\n tone: number;\n}\n/** 段ごとの槽 */\nexport interface PipeGlass extends PipeTank {\n step: number;\n}\nexport interface PipeLevel extends Rect, PipeAt {\n party: string;\n token: string;\n amount: string;\n state: PipeState;\n /** 槽の下の今の残高。3 桁ごとに区切る */\n text: PipeText;\n /** 残高の下の増えた分か減った分 (`+100 USDC`)。変わった段から確定するまでと、確定と取り消しの段に出す。狭い枠では出さない */\n delta?: PipeText;\n /** 増減の下に添える暫定か確定か取り消しの語 */\n tag?: PipeText;\n /** 前の量の水位。前の数を持つ槽だけが持つ */\n base?: Rect;\n /** 段の始まりの水位。この段で変わった槽だけが持つ */\n from?: Rect;\n}\n/** トークンごとの管の横に走る所。トークンの箱を載せる管の所で、弁 (`valve`) はトークンの Contract の弁。`ETH` の管と、トークンの箱を描かない管は弁を持たない */\nexport interface PipeBus {\n token: string;\n y: number;\n x1: number;\n x2: number;\n valve?: { party: string; x: number; y: number };\n}\n/** 値の管の口。槽の左か右の縁の上の点 */\nexport interface PipePort {\n party: string;\n token: string;\n side: \"left\" | \"right\";\n x: number;\n y: number;\n}\n/**\n * 値の管。持ち主の槽の横の口どうしを結ぶ折れ線。`from` と `to` は最初に流れた向き。\n * `group` は幹の組で、同じ組の管は根の槽の口を共に出て 1 本の幹を重なって通り、相手の近くで枝分かれする。組の違う管とは重ならない\n */\nexport interface PipeValuePipe {\n token: string;\n from: string;\n to: string;\n points: Point[];\n ports: [PipePort, PipePort];\n tone: number;\n group: string;\n}\n/** 値の管を持たないトークンの箱を、持ち主の槽へ結ぶ短い管 */\nexport interface PipeStub {\n token: string;\n points: Point[];\n}\n/** 呼び出しの管が値の管の下をくぐる所。`pipe` は値の管 (`valuePipes`) の番号、`vertical` は呼び出しの管が縦に走るか */\nexport interface PipeCrossing {\n call: number;\n token: string;\n pipe: number;\n x: number;\n y: number;\n vertical: boolean;\n}\n/**\n * 図の中の札。`kind` は役で、流れた量 (`amount`)、イベント (`event`)、戻り値 (`return`)、計器の式 (`formula`)、入力と出力の印 (`io`)。\n * `size` は字の大きさ、`rx` は角の丸み (どちらも図の座標)。戻り値の札は呼び出しの管 (`path`) を伝って動き、呼んだ側に着いて消える\n */\nexport interface PipeChip extends Rect, PipeAt {\n kind: \"amount\" | \"event\" | \"return\" | \"formula\" | \"io\" | \"delta\";\n text: string;\n size: number;\n rx: number;\n label: PipeText;\n party?: string;\n token?: string;\n /**\n * 流れた量の札が名指す流れ (`PipeFlow` の `id`、#3528)。崩れの確かめが、札と流れの管の離れを測る。\n * 狭い枠の図の下の帯に並べた札は、管から離して置くと決めた札なので持たない\n */\n flow?: number;\n /** 札の色の役。`state` は流れた量とイベントの印、`ok` は計器の式の結果 */\n state?: PipeState;\n ok?: boolean;\n tone?: number;\n /** 戻り値の札が伝う道 (呼ばれた側から呼んだ側へ) と、戻した呼び出しの番号 */\n path?: Point[];\n call?: number;\n}\nexport interface PipeBusAt extends PipeBus {\n step: number;\n}\nexport interface PipeFlow extends PipeAt {\n /** 流れた分の番号。同じ流れた分を段をまたいで引く */\n id: number;\n step: number;\n token: string;\n from: string;\n to: string;\n amount: string;\n state: PipeState;\n points: Point[];\n /** 向きの印の場所と向き。`vertical` は縦に走る所の印で、`dir` は右か下へ流れる時 1、左か上へ -1 */\n arrow: { x: number; y: number; dir: 1 | -1; vertical: boolean };\n tone: number;\n /** この段で流れたか。流れた段は斜線の液の塊が管を通り抜ける */\n fresh: boolean;\n}\nexport interface PipeCallLane {\n index: number;\n step: number;\n event: number;\n from: string;\n to: string;\n depth: number;\n /** 呼んだ者の本管の高さ */\n y: number;\n kind: \"call\" | PipeCallKind;\n width: number;\n /** 呼んだ者の真ん中から本管を通り、枝の端まで */\n points: Point[];\n /** 光る管の道。呼んだ者の名札を出た所から、枝の端まで */\n lit: Point[];\n value?: string;\n close?: { step: number; event: number; how: \"return\" | \"revert\" };\n}\n/**\n * 本管の枝。弁 (`valve`) は枝の上の、ほかの線から離れた所に置く。`vertical` は弁を置いた所が縦に走るか、\n * `under` は取っ手を管の下 (縦の管では左) に立てるか。取っ手は上 (縦の管では右) の側にほかの線が通る時に下の側へ立てる\n */\nexport interface PipeBranch {\n to: string;\n points: Point[];\n valve: { x: number; y: number; vertical: boolean; under: boolean };\n}\n/** 同じ関係者から出る呼び出しの本管 */\nexport interface PipeMain {\n from: string;\n y: number;\n points: Point[];\n branches: PipeBranch[];\n}\n/** 段ごとの開いている呼び出し。`opened` はこの段で開いた出来事、`shut` はこの段で閉じた出来事 */\nexport interface PipeLane {\n call: number;\n step: number;\n from: string;\n to: string;\n kind: \"call\" | PipeCallKind;\n width: number;\n points: Point[];\n opened?: number;\n shut?: number;\n}\nexport interface PipePlate extends Rect, PipeAt {\n party: string;\n name: string;\n value: string;\n state: PipeState;\n /** トークンの箱の中の値か */\n boxed: boolean;\n label: PipeText;\n text: PipeText;\n was?: PipeText;\n strike?: Rect;\n /** 前の値と今の値の間の矢印。トークンの箱の中の値だけが持つ */\n arrow?: PipeText;\n /** 前の値に添える語。トークンの箱の外の値だけが持つ */\n tag?: PipeText;\n}\nexport interface PipeWrite {\n step: number;\n event: number;\n from: string;\n to: string;\n name: string;\n points: Point[];\n}\n/** 計器。`on` は載せる管 (`call` は呼び出しの管、`value` は値の管、`party` は呼ばれない者の名札の横)。式は図の中の札 (`formula`) が持つ */\nexport interface PipeGauge extends Rect {\n party: string;\n step: number;\n event: number;\n ok: boolean;\n on: \"call\" | \"value\" | \"party\";\n cx: number;\n cy: number;\n r: number;\n /** その段で確かめたか。確かめた段は針が振れて印が付く */\n fresh: boolean;\n /** 段の始まりと終わりの針の向き (度) */\n from: number;\n angle: number;\n /** 通ったかの印 */\n lamp: { x: number; y: number; r: number };\n /** 値の管から計器までの軸 */\n stem?: { y1: number; y2: number };\n}\nexport interface PipeEventChip extends Rect, PipeAt {\n /** 出した順の番号。同じ札を段をまたいで引く */\n id: number;\n party: string;\n name: string;\n emitted: number;\n state: PipeState;\n text: PipeText;\n args?: PipeText;\n}\n/** 変換器。`calc` を行う関係者の 2 つの槽の間に、全ての段で置き、計算した段だけ `active` */\nexport interface PipeConverter extends Rect {\n party: string;\n step: number;\n calc: number;\n event?: number;\n in: string;\n out: string;\n rate: string;\n active: boolean;\n cx: number;\n cy: number;\n r: number;\n /** 左の槽の右の縁と右の槽の左の縁。変換器と槽を短い管で結ぶ */\n left: number;\n right: number;\n}\n/** 持ち主ごとの槽と値の札の点線の囲い。`row` は囲いの段 (一番上が 0) */\nexport interface PipeHousing extends Rect {\n party: string;\n row: number;\n}\n/** 名札から自分の槽へ下りる点線 */\nexport interface PipeTie {\n party: string;\n x: number;\n y1: number;\n y2: number;\n}\nexport interface PipeFoldBox extends Rect {\n party: string;\n step: number;\n call: number;\n steps: number;\n parties: number;\n title: PipeText;\n value: PipeText;\n text: PipeText;\n}\nexport interface PipeRing {\n party: string;\n step: number;\n event: number;\n}\nexport interface PipeLayout extends Layout {\n kind: \"pipe\";\n /** 広い枠は縮めずに横に長いまま並べ、狭い枠は枠の幅に縮める */\n arrangement: \"wide\" | \"fit\";\n parties: PipeParty[];\n columns: PipeColumn[];\n pills: PipePill[];\n tanks: PipeTank[];\n glasses: PipeGlass[];\n levels: PipeLevel[];\n buses: PipeBus[];\n pipes: PipeBusAt[];\n flows: PipeFlow[];\n calls: PipeCallLane[];\n mains: PipeMain[];\n lanes: PipeLane[];\n plates: PipePlate[];\n writes: PipeWrite[];\n gauges: PipeGauge[];\n /** 図の上の確認の印。第6回の形は計器に結果を残すので、図の上には描かない */\n checks: [];\n events: PipeEventChip[];\n converters: PipeConverter[];\n housings: PipeHousing[];\n ties: PipeTie[];\n folds: PipeFoldBox[];\n rings: PipeRing[];\n valuePipes: PipeValuePipe[];\n stubs: PipeStub[];\n crossings: PipeCrossing[];\n chips: PipeChip[];\n /** 狭い枠に合わせて並べたか。狭い枠は図を枠の幅に縮めて全体を出す */\n narrow: boolean;\n /** 段ごとに動く関係者を囲む所。再生の部品が横に送る時と、寄って追う窓が段ごとに見る */\n focus: (Rect & { step: number })[];\n}\n\nexport interface PipeLayoutOptions {\n lang?: NotationLang;\n /** 呼ぶ側が渡す語 (#3584)。渡さない語は `lang` の語で描く */\n words?: PipeWordsInput;\n /** 描く枠の幅。`PIPE_LOOK.narrow.frame` より狭い枠では、槽の残高と今の段の値を大きな字で出す */\n width?: number;\n}\n\n// ---- 字\n\nexport function textAt(text: string, x: number, base: number, style: TextStyle, anchor: \"start\" | \"middle\" = \"start\"): PipeText {\n const w = textWidth(text, style);\n return { text, x: anchor === \"middle\" ? x - w / 2 : x, y: base - style.size * 0.8, w, h: style.size, base };\n}\n\n/** 高さ `h` の札の上の端 `top` から、字の真ん中を札の真ん中に置く基準線 */\nexport const middleBase = (top: number, h: number, style: TextStyle): number => top + h / 2 + style.size * 0.35;\n\n// ---- 畳む\n\n/**\n * `[fold]` の呼び出しの内側の段を 1 つの段にまとめる。内側の段は、畳んだ呼び出しを開いた段の次の段から閉じた段の前の段まで。\n * `open` に番号 (出てきた順) を持つ呼び出しは畳まない。まとめた段は内側の段の出来事を順に持ち、題と本文は描く時の言葉で作る。\n * 畳んだ呼び出しの内側の `[fold]` の呼び出しは、外の箱に入るので畳まない。\n * 箱ごとに、内側の段にだけ出て、まとめなかった段に出ない関係者を `hidden` に持つ。宣言しただけで段に出ない関係者は内側に数えない\n */\nexport function foldPipe(diagram: DiagramModel, open: readonly number[] = [], lang: NotationLang = DEFAULT_LANG, given?: PipeWordsInput): DiagramModel {\n interface Opened {\n index: number;\n step: number;\n from: string;\n to: string;\n fold: boolean;\n close?: number;\n }\n const calls: Opened[] = [];\n const stack: Opened[] = [];\n diagram.steps.forEach((step, s) => {\n for (const e of step.events) {\n if (e.type === \"call\") {\n const call: Opened = { index: calls.length, step: s, from: e.from, to: e.to, fold: e.fold === true };\n calls.push(call);\n stack.push(call);\n } else if (e.type === \"return\" || e.type === \"revert\") {\n const closed = stack.pop();\n if (closed) closed.close = s;\n }\n }\n });\n const words = pipeWords(lang, given);\n const names = new Map(diagram.boxes.map((b) => [b.id, b.name]));\n const steps: Step[] = [];\n const folds: PipeFold[] = [];\n let s = 0;\n while (s < diagram.steps.length) {\n steps.push(diagram.steps[s] as Step);\n const folded = calls.find((c) => c.fold && c.step === s && c.close !== undefined && c.close - s >= 2 && !open.includes(c.index));\n if (!folded || folded.close === undefined) {\n s++;\n continue;\n }\n const inner = diagram.steps.slice(s + 1, folded.close);\n folds.push({ call: folded.index, step: steps.length, from: s + 1, to: folded.close - 1, hidden: [] });\n steps.push({\n title: words.foldTitle(names.get(folded.to) ?? folded.to),\n body: words.join(inner.map((step) => step.title)),\n events: inner.flatMap((step) => step.events),\n });\n s = folded.close;\n }\n if (folds.length === 0) return diagram;\n const boxed = new Set(folds.map((f) => f.step));\n const outside = new Set(steps.flatMap((step, k) => (boxed.has(k) ? [] : step.events.flatMap(partiesOf))));\n for (const fold of folds) fold.hidden = [...new Set((steps[fold.step] as Step).events.flatMap(partiesOf))].filter((id) => !outside.has(id));\n return { ...diagram, steps, pipe: { holds: diagram.pipe?.holds ?? [], folds } };\n}\n\n/** 出来事に出る関係者。呼び出しの両端と、行の頭の者と、`move` の送り手と受け手 */\nexport function partiesOf(e: Step[\"events\"][number]): string[] {\n if (e.type === \"call\") return [e.from, e.to];\n if (!(\"box\" in e)) return [];\n return e.type === \"move\" ? [e.box, e.from, e.to] : [e.box];\n}\n\n// ---- 段ごとの値を当てる\n\nexport interface CallRec {\n index: number;\n step: number;\n event: number;\n from: string;\n to: string;\n depth: number;\n kind: \"call\" | PipeCallKind;\n label?: string;\n value?: string;\n inner: boolean;\n close?: { step: number; event: number; how: \"return\" | \"revert\" };\n}\nexport interface FlowRec {\n id: number;\n step: number;\n event: number;\n token: string;\n from: string;\n to: string;\n amount: string;\n}\nexport interface EmitRec {\n id: number;\n step: number;\n event: number;\n party: string;\n name: string;\n args?: string[];\n}\nexport interface CheckRec {\n step: number;\n event: number;\n party: string;\n ok: boolean;\n check: Pick<PipeCheck, \"left\" | \"op\" | \"right\">;\n}\nexport interface CalcRec {\n step: number;\n event: number;\n party: string;\n input: string;\n output: string;\n rate: string;\n}\nexport interface Snap {\n balances: Map<string, string>;\n values: Map<string, string>;\n /** 鍵の印。鍵は `b<持ち主>|<トークン>`、`v<持ち主>|<名前>`、`e<イベントの番号>`、`f<流れた分の番号>` */\n states: Map<string, PipeState>;\n was: Map<string, string>;\n /** この段で変わった鍵と、変えた出来事 */\n changed: Map<string, number>;\n emitted: number[];\n active?: string;\n status?: { kind: \"pending\" | \"final\" | \"rolled\" | \"partial\"; count: number; event?: number };\n}\n\nexport interface Simulated {\n calls: CallRec[];\n flows: FlowRec[];\n emits: EmitRec[];\n checks: CheckRec[];\n calcs: CalcRec[];\n writes: { step: number; event: number; from: string; to: string; name: string }[];\n reverts: { step: number; event: number; party: string; reason?: string }[];\n returns: { step: number; event: number; call: number; value: string }[];\n snaps: Snap[];\n tokens: Map<string, string>;\n}\n\nexport function simulate(diagram: DiagramModel, foldSteps: ReadonlySet<number>): Simulated {\n const holds = diagram.pipe?.holds ?? [];\n const run = new PipeRun(diagram.boxes, holds);\n const out: Simulated = { calls: [], flows: [], emits: [], checks: [], calcs: [], writes: [], reverts: [], returns: [], snaps: [], tokens: new Map(run.tokens) };\n const base = new Map<string, string>();\n for (const [k, v] of run.balances) base.set(`b${k}`, v);\n for (const [k, v] of run.values) base.set(`v${k}`, v);\n const prevBase = new Map<string, string>();\n const sets: Set<string>[] = [new Set()];\n const finals = new Set<string>();\n const opened: CallRec[] = [];\n const valueOf = (k: string): string | undefined => (k.startsWith(\"b\") ? run.balances.get(k.slice(1)) : k.startsWith(\"v\") ? run.values.get(k.slice(1)) : undefined);\n const stored = (k: string): boolean => k.startsWith(\"b\") || k.startsWith(\"v\");\n\n diagram.steps.forEach((step, s) => {\n const rolled = new Map<string, string>();\n const finalNow = new Set<string>();\n const changed = new Map<string, number>();\n let statusEvent: number | undefined;\n const touch = (k: string, e: number): void => {\n (sets[sets.length - 1] as Set<string>).add(k);\n finals.delete(k);\n rolled.delete(k);\n if (!changed.has(k)) changed.set(k, e);\n };\n step.events.forEach((e, ei) => {\n switch (e.type) {\n case \"call\": {\n const rec: CallRec = {\n index: out.calls.length,\n step: s,\n event: ei,\n from: e.from,\n to: e.to,\n depth: run.frames.length,\n kind: e.call ?? \"call\",\n inner: foldSteps.has(s),\n ...(e.label !== undefined ? { label: e.label } : {}),\n ...(e.value !== undefined ? { value: e.value } : {}),\n };\n out.calls.push(rec);\n if (run.call(e)) break;\n opened.push(rec);\n sets.push(new Set());\n if (e.value !== undefined) {\n const id = out.flows.length;\n out.flows.push({ id, step: s, event: ei, token: ETH, from: e.from, to: e.to, amount: e.value });\n touch(`b${keyOf(e.from, ETH)}`, ei);\n touch(`b${keyOf(e.to, ETH)}`, ei);\n touch(`f${id}`, ei);\n }\n break;\n }\n case \"return\":\n case \"revert\": {\n const before = run.snapshot();\n const closed = run.close(e.box, e.type);\n if (isFault(closed)) break;\n const rec = opened.pop();\n if (rec) rec.close = { step: s, event: ei, how: e.type };\n const inside = sets.pop() ?? new Set<string>();\n if (e.type === \"return\") {\n for (const k of inside) (sets[sets.length - 1] as Set<string>).add(k);\n if (e.value !== undefined && rec) out.returns.push({ step: s, event: ei, call: rec.index, value: e.value });\n if (run.frames.length === 0) {\n const root = sets[0] as Set<string>;\n if ([...root].some(stored)) statusEvent = ei;\n for (const k of root) {\n finalNow.add(k);\n finals.add(k);\n if (stored(k)) {\n prevBase.set(k, base.get(k) ?? \"\");\n base.set(k, valueOf(k) ?? \"\");\n }\n if (!changed.has(k)) changed.set(k, ei);\n }\n root.clear();\n }\n } else {\n for (const k of inside) {\n rolled.set(k, k.startsWith(\"b\") ? (before.balances.get(k.slice(1)) ?? \"\") : k.startsWith(\"v\") ? (before.values.get(k.slice(1)) ?? \"\") : \"\");\n changed.set(k, ei);\n }\n if ([...inside].some(stored)) statusEvent = ei;\n out.reverts.push({ step: s, event: ei, party: e.box, ...(e.reason !== undefined ? { reason: e.reason } : {}) });\n }\n break;\n }\n case \"move\": {\n if (run.move(e)) break;\n const token = run.tokens.get(e.box) ?? \"\";\n const id = out.flows.length;\n out.flows.push({ id, step: s, event: ei, token, from: e.from, to: e.to, amount: e.amount });\n touch(`b${keyOf(e.from, token)}`, ei);\n touch(`b${keyOf(e.to, token)}`, ei);\n touch(`f${id}`, ei);\n break;\n }\n case \"write\": {\n const owner = run.write(e);\n if (isFault(owner)) break;\n touch(`v${keyOf(owner, e.name)}`, ei);\n out.writes.push({ step: s, event: ei, from: e.box, to: owner, name: e.name });\n break;\n }\n case \"emit\": {\n const id = run.emit();\n if (isFault(id)) break;\n touch(`e${id}`, ei);\n out.emits.push({ id, step: s, event: ei, party: e.box, name: e.name, ...(e.args ? { args: e.args } : {}) });\n break;\n }\n case \"check\":\n out.checks.push({ step: s, event: ei, party: e.box, ok: checkPasses(e), check: e });\n break;\n case \"calc\":\n out.calcs.push({ step: s, event: ei, party: e.box, input: e.in, output: e.out, rate: rateOf(e.in, e.out) });\n break;\n default:\n break;\n }\n });\n const pending = (k: string): boolean => sets.some((set) => set.has(k));\n const stateOf = (k: string): PipeState => (rolled.has(k) ? \"rolled\" : pending(k) ? \"provisional\" : finals.has(k) ? \"final\" : \"none\");\n const states = new Map<string, PipeState>();\n const was = new Map<string, string>();\n const keys = [\n ...[...run.balances.keys()].map((k) => `b${k}`),\n ...[...run.values.keys()].map((k) => `v${k}`),\n ...out.emits.map((x) => `e${x.id}`),\n ...out.flows.map((x) => `f${x.id}`),\n ];\n for (const k of keys) {\n const state = stateOf(k);\n states.set(k, state);\n if (!stored(k)) continue;\n const now = valueOf(k);\n const old = state === \"rolled\" ? rolled.get(k) : state === \"provisional\" ? base.get(k) : state === \"final\" ? prevBase.get(k) : undefined;\n if (old !== undefined && old !== now) was.set(k, old);\n }\n const rolledStored = [...rolled.keys()].filter(stored).length;\n const pendingStored = keys.filter((k) => stored(k) && pending(k)).length;\n const status: Snap[\"status\"] =\n rolledStored > 0\n ? { kind: run.frames.length === 0 ? \"rolled\" : \"partial\", count: rolledStored, ...(statusEvent !== undefined ? { event: statusEvent } : {}) }\n : [...finalNow].some(stored)\n ? { kind: \"final\", count: 0, ...(statusEvent !== undefined ? { event: statusEvent } : {}) }\n : pendingStored > 0\n ? { kind: \"pending\", count: pendingStored }\n : undefined;\n const top = run.frames[run.frames.length - 1];\n out.snaps.push({\n balances: new Map(run.balances),\n values: new Map(run.values),\n states,\n was,\n changed,\n emitted: [...new Set([...run.emitted, ...[...rolled.keys()].filter((k) => k.startsWith(\"e\")).map((k) => Number(k.slice(1)))])].sort((a, b) => a - b),\n ...(top ? { active: top.to } : {}),\n ...(status ? { status } : {}),\n });\n });\n return out;\n}\n\n// ---- 字の形\n\n/** 量の字を 3 桁ごとに区切る (#3398)。数でない字はそのまま */\nexport function grouped(amount: string): string {\n const m = /^(-?)(\\d+)(\\.\\d+)?$/u.exec(amount);\n return m ? `${m[1] ?? \"\"}${(m[2] ?? \"\").replace(/\\B(?=(\\d{3})+(?!\\d))/gu, \",\")}${m[3] ?? \"\"}` : amount;\n}\n\nconst P = PIPE_LOOK;\nconst T = PIPE_TYPE;\n\n/** 字の大きさ。狭い枠では、縮めても読める大きさに上げる */\ninterface Sizes {\n amount: number;\n chip: number;\n}\n\n/** 組む時の間の広さ。管が通らない時に広げて組み直す */\ninterface Plan {\n /** 囲いの間に足す幅 */\n gap: number;\n /** 管を通す道の下限の数 */\n lanes: number;\n /** 名札の行の間に足す高さ */\n rows: number;\n /** 囲いの外側の道の数 */\n outer: number;\n /** 最後の組み方。値の管がほかの値の管を越えてよい (決まりの表が違反に数える) */\n last: boolean;\n}\n\nconst PLANS: Plan[] = [\n { gap: 0, lanes: 1, rows: 0, outer: 2, last: false },\n { gap: P.lane.pitch, lanes: 2, rows: P.lane.pitch, outer: 3, last: false },\n { gap: P.lane.pitch * 2, lanes: 3, rows: P.lane.pitch, outer: P.lane.outer, last: false },\n { gap: P.lane.pitch * 2, lanes: 3, rows: P.lane.pitch, outer: P.lane.outer, last: true },\n];\n\n/** 組んだ置き場所の覚え。色味を替えて描き直す時と、同じ図を何度も描く時に組み直さない */\nconst CACHE = new Map<string, PipeLayout>();\nconst CACHE_SIZE = 48;\n\n/** 札の高さ。入力と出力の印は囲いの上の余白に収める */\nconst IO_H = 20;\n/** 平行な管の縁どうしの間と、管と部品の間 */\nconst LINE_GAP = 10;\n/** 呼び出しの管の上の弁と計器の間 */\nconst SPACING = P.call.room;\n/** 呼び出しの管は、呼ばれた側の縁からこの長さ手前で向きを揃えてから入る */\nconst APPROACH = 18;\n/** 部品どうしの間の下限 */\nconst PART_GAP = 8;\n/** 同じ横から出る管の高さの間。管の太さと平行な管の縁どうしの間 */\nconst LANE_STEP = P.call.case + LINE_GAP;\n/**\n * 呼び出しの管が箱の縁の角から離れる長さ。管の太さの半分と角の丸み。\n * これより角に近い所から出入りする管は角の丸みにかかり、箱の縁の後ろを通って見える (#3523)\n */\nconst cornerRoom = (radius: number): number => P.call.case / 2 + radius;\n/**\n * 一番上の行の名札の上の空き。名札を越えて上の口へ下りる管が、口の手前の線 (`APPROACH`) の 1 本上を、\n * 図の上の縁から管の太さ 1 本分離れて通る (#3523)\n */\nconst TOP_ROOM = APPROACH + P.call.case + P.call.case / 2 + P.call.case;\n/** 呼び出しの管の弁が描く形 (胴と軸と取っ手) と、ほかの線の縁の間の下限。決まりの表 (`valve-clearance`) と同じ値 */\nconst VALVE_ROOM = 3;\n/**\n * 上の行の者から真下の行の者へ下りる呼び出しの管の、弁を縦に置ける長さ。弁の胴を下りる前の横の線 (同じ者の管が共に通る) から離し、\n * 下へ倒れる開いた取っ手を呼ばれた側の名札から離す。弁の置き場所は 4px 刻みで探すため、その 1 刻みを足す\n */\nconst VALVE_DROP = P.call.case / 2 + VALVE_ROOM + P.valve.r + 4 + (P.valve.lever - P.valve.leverH / 2) + VALVE_ROOM;\n/**\n * 幹を共に通る値の管が、先に引いた同じ組の管と重なって走る所の長さに掛ける割合。\n * 小さいほど幹を長く共に通る。重なった所を離れて並ぶ道より安くし、遠回りしてまで共に通らない値にする\n */\nconst SHARE = 0.3;\n/** 値の管が折れる時に足す値 */\nconst BEND_VALUE = 60;\n/** 弁を置くために引き直す呼び出しの管の、元の道の長さに対する長さの上限 */\nconst DETOUR_RATE = 1.5;\n/** ほかの管の弁に譲る呼び出しの管が、名札の縁から出て折れるまでの短い長さ。自分の弁が両側に決まりの間を空けて載る */\nconst SHORT_RUN = P.valve.r * 2 + P.call.room + VALVE_ROOM * 2;\n\nconst amountNumber = (amount: string | undefined): number => {\n const n = Number(amount);\n return Number.isFinite(n) ? n : 0;\n};\nconst mean = (xs: readonly number[]): number => xs.reduce((a, b) => a + b, 0) / xs.length;\nconst sized = (style: TextStyle, size: number): TextStyle => ({ ...style, size });\nconst grow = (r: Rect, d: number): Rect => ({ x: r.x - d, y: r.y - d, w: r.w + d * 2, h: r.h + d * 2 });\n/** 2 つの四角が `d` より離れているか */\nconst apart = (a: Rect, b: Rect, d: number): boolean => a.x + a.w + d <= b.x || b.x + b.w + d <= a.x || a.y + a.h + d <= b.y || b.y + b.h + d <= a.y;\n/** 線分と四角 (`pad` だけ広げた) が重なるか。線分は縦か横 */\nfunction hits(a: Point, b: Point, r: Rect, pad: number): boolean {\n const x0 = Math.min(a[0], b[0]) - pad;\n const x1 = Math.max(a[0], b[0]) + pad;\n const y0 = Math.min(a[1], b[1]) - pad;\n const y1 = Math.max(a[1], b[1]) + pad;\n return x1 > r.x && x0 < r.x + r.w && y1 > r.y && y0 < r.y + r.h;\n}\n/** 折れの数の上限。決まりの表の `bends` と同じ値 */\nconst MAX_BENDS = 4;\nconst bendsOf = (points: readonly Point[]): number => Math.max(0, simplify(points).length - 2);\n/** 流れた量の札を管に沿って置く所 (線分の長さに対する割合)。真ん中に近い順に試し、どれも塞がる時は細かく刻んだ所を試す */\nconst AMOUNT_AT = [0.5, 0.3, 0.7, 0.15, 0.85, 0.4, 0.6, 0.2, 0.8, 0.1, 0.9, 0.25, 0.75, 0.35, 0.65, 0.45, 0.55, 0.05, 0.95];\n/** 呼び出しの管が 1 本の値の管を 2 度越える時に、探し直す道でその管の組を越える値 */\nconst REVISIT = 2000;\n/** 折れ線 `p` が折れ線 `q` を直角に越える回数。端どうしで触れるだけの所は数えない */\nfunction crossedTimes(p: readonly Point[], q: readonly Point[]): number {\n let n = 0;\n for (const [a, b] of segs(p))\n for (const [u, v] of segs(q)) {\n const fa = flat(a, b);\n if (fa === flat(u, v)) continue;\n const [h1, h2, v1, v2] = fa ? [a, b, u, v] : [u, v, a, b];\n const x = v1[0];\n const y = h1[1];\n if (x > Math.min(h1[0], h2[0]) + 1e-6 && x < Math.max(h1[0], h2[0]) - 1e-6 && y > Math.min(v1[1], v2[1]) + 1e-6 && y < Math.max(v1[1], v2[1]) - 1e-6) n++;\n }\n return n;\n}\n/** 前から順に比べて、最初に違う値で `a` が小さいか */\nconst lessThan = (a: readonly number[], b: readonly number[]): boolean => {\n const i = a.findIndex((v, j) => v !== b[j]);\n return i >= 0 && (a[i] as number) < (b[i] as number);\n};\n/** 管を引く順を試した 1 回。`score` は前から比べて小さいほど良い */\nexport interface OrderTry<L, R> {\n list: L;\n got: R;\n score: number[];\n}\n/**\n * 管を引く順を最大 4 通り試し、最良の回を返す。回ごとに `run` で引き、`score` を前から比べて小さい回を最良とする。\n * `next` が次の順を返さない回 (直す管が無い) と、前に試した順に戻った時と、前の最良より良くならなかった回でやめる (#3603)。\n * 良くならなかった回の後に別の順を試しても、配管の見本の全てで悪い管は減らず、狭い幅で箱を開いた図では\n * 最後に諦める組み方のために道を探す時間の多くを使っていた。\n * `ran` は最後に引いた順で、最良の順と違う時は、呼ぶ側が最良の順で引き直す (道の覚えは最後に引いた順の物が残るため)\n */\nexport function tryOrders<L, R>(first: L, keyOf: (list: L) => string, run: (list: L) => R, score: (got: R) => number[], next: (list: L, got: R) => L | undefined): { best: OrderTry<L, R>; ran: L } {\n let list = first;\n let best: OrderTry<L, R> | undefined;\n let ran = list;\n const tried = new Set<string>();\n for (let round = 0; round < 4 && !tried.has(keyOf(list)); round++) {\n tried.add(keyOf(list));\n ran = list;\n const got = run(list);\n const s = score(got);\n if (best && !lessThan(s, best.score)) break;\n best = { list, got, score: s };\n const after = next(list, got);\n if (after === undefined) break;\n list = after;\n }\n // 初めの回は前に試した順が無いので必ず引き、最良は必ず在る\n return { best: best as OrderTry<L, R>, ran };\n}\n/**\n * 道を探し、仕上げた道の折れが上限を超える時は、折れを重く数えて探し直す。折れが減った時だけ探し直した道を採る。\n * 長さより折れの少なさを優先した道は遠回りになることがあるため、上限を超えた時だけ使う\n */\nfunction fewerBends<T extends { points: Point[] }>(router: Router, ask: Ask, finish: (path: Point[]) => T | undefined): T | undefined {\n const first = router.route(ask);\n // 道が無い時は、折れの重さを変えても道は無い\n if (!first) return undefined;\n const done = finish(first);\n const count = (t: T | undefined): number => (t === undefined ? Number.POSITIVE_INFINITY : bendsOf(t.points));\n if (done !== undefined && count(done) <= MAX_BENDS) return done;\n const again = router.route({ ...ask, bend: ask.bend * 10 });\n const redone = again ? finish(again) : undefined;\n return count(redone) < count(done) ? redone : done;\n}\nconst segs = (points: readonly Point[]): [Point, Point][] => points.slice(1).map((b, i) => [points[i] as Point, b]);\nconst flat = (a: Point, b: Point): boolean => Math.abs(a[1] - b[1]) < 0.5;\nconst lengthOf = (points: readonly Point[]): number => segs(points).reduce((s, [a, b]) => s + Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]), 0);\n/** 点の並びを、始まりから `d` 進んだ所から先だけにする */\nfunction fromAlong(points: readonly Point[], d: number): Point[] {\n const out: Point[] = [along(points, d)];\n let walked = 0;\n for (const [a, b] of segs(points)) {\n walked += Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (walked > d) out.push(b);\n }\n return out;\n}\n/** 点の並びの上の、始まりから `d` 進んだ所 */\nfunction along(points: readonly Point[], d: number): Point {\n let left = d;\n for (const [a, b] of segs(points)) {\n const len = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (left <= len) {\n const k = len === 0 ? 0 : left / len;\n return [a[0] + (b[0] - a[0]) * k, a[1] + (b[1] - a[1]) * k];\n }\n left -= len;\n }\n return points[points.length - 1] ?? [0, 0];\n}\n\n/**\n * 縦と横の折れ線を、進む向きの左へ `d` だけずらす。角は 2 本のずらした線の交わる所に置く。\n * 同じ管を同じ段に流れた分をずらして重ねない時に使う\n */\nfunction offsetPath(points: readonly Point[], d: number): Point[] {\n if (d === 0 || points.length < 2) return points.map((p): Point => [p[0], p[1]]);\n const normal = (a: Point, b: Point): Point => {\n const dx = Math.sign(b[0] - a[0]);\n const dy = Math.sign(b[1] - a[1]);\n return [dy * d, -dx * d];\n };\n const parts = segs(points).map(([a, b]) => {\n const [nx, ny] = normal(a, b);\n return [\n [a[0] + nx, a[1] + ny],\n [b[0] + nx, b[1] + ny],\n ] as [Point, Point];\n });\n const out: Point[] = [(parts[0] as [Point, Point])[0]];\n for (let k = 1; k < parts.length; k++) {\n const [, pb] = parts[k - 1] as [Point, Point];\n const [qa] = parts[k] as [Point, Point];\n const prevFlat = Math.abs((parts[k - 1] as [Point, Point])[0][1] - pb[1]) < 0.5;\n out.push(prevFlat ? [qa[0], pb[1]] : [pb[0], qa[1]]);\n }\n out.push((parts[parts.length - 1] as [Point, Point])[1]);\n return out;\n}\n\nexport function layoutPipe(diagram: DiagramModel, options: PipeLayoutOptions = {}): PipeLayout {\n const lang = options.lang ?? DEFAULT_LANG;\n const words = pipeWords(lang, options.words);\n const frame = options.width;\n const narrow = frame !== undefined && frame < P.narrow.frame;\n // 渡した語で札の幅が変わるので、語も覚えの鍵に入れる (#3584)\n const said = `${lang}|${JSON.stringify(options.words ?? {})}`;\n const key = `${said}|${narrow ? frame : \"wide\"}|${JSON.stringify(diagram)}`;\n const hit = CACHE.get(key);\n if (hit) return hit;\n const remember = (k: string, layout: PipeLayout): PipeLayout => {\n if (CACHE.size >= CACHE_SIZE) CACHE.delete(CACHE.keys().next().value as string);\n CACHE.set(k, layout);\n return layout;\n };\n let sizes: Sizes = { amount: T.amount.size, chip: T.chip.size };\n // 狭い枠も、字の大きさを決めるために広い枠の図を先に組む。広い枠で描いた図が覚えに在ればそれを使う\n const wideKey = `${said}|wide|${JSON.stringify(diagram)}`;\n let out = CACHE.get(wideKey) ?? remember(wideKey, compose(diagram, words, sizes, false));\n if (narrow) {\n // 広い枠の図を枠の幅へ縮めた時に、画面で `px` の大きさに見える字で 1 度だけ組み直す。組み方は広い枠で組めた組み方から試す。\n // 大きな字で図が広がると縮める割合も変わるが、くり返して合わせない。札の多い図では字を上げるほど図が広がり、\n // 字が際限なく大きくなるため (aggregator は 10726px の幅に 293px の字まで広がった)。要る大きさより少し大きく組み、広がる分を見込む\n const want = Math.ceil(((P.narrow.px * out.width) / frame) * NARROW_OVER * 10) / 10;\n sizes = { amount: Math.max(T.amount.size, want), chip: Math.max(T.chip.size, want) };\n out = compose(diagram, words, sizes, true, PLAN_OF.get(out) ?? 0);\n }\n return narrow ? remember(key, out) : out;\n}\n\n/** 値の管の定め。同じトークンの、同じ 2 人の間の流れは 1 本の管を通る */\ninterface Def {\n token: string;\n from: string;\n to: string;\n flows: FlowRec[];\n}\n\n/** 組んだ図がどの組み方 (`PLANS` の番号) で組めたか */\nconst PLAN_OF = new WeakMap<PipeLayout, number>();\n/** 狭い枠の字を、要る大きさよりどれだけ大きく組むか */\nconst NARROW_OVER = 1.06;\n\nfunction compose(diagram: DiagramModel, words: PipeWords, sizes: Sizes, narrow: boolean, from = 0): PipeLayout {\n const folds = diagram.pipe?.folds ?? [];\n const foldSteps = new Set(folds.map((f) => f.step));\n const hidden = new Set(folds.flatMap((f) => f.hidden));\n const sim = simulate(diagram, foldSteps);\n const steps = diagram.steps.length;\n const stepList = Array.from({ length: steps }, (_, s) => s);\n const holds = diagram.pipe?.holds ?? [];\n const names = new Map(diagram.boxes.map((b) => [b.id, b.name]));\n const nameOf = (id: string): string => names.get(id) ?? id;\n const declaredAt = new Map(diagram.boxes.map((b, i) => [b.id, i]));\n const snapOf = (s: number): Snap => sim.snaps[s] as Snap;\n const amountStyle = sized(T.amount, sizes.amount);\n const chipStyle = T.chip;\n const chipH = P.chip.h;\n /** 狭い枠の、図の下の帯に出す大きな札の字 */\n const bigStyle = sized(T.chip, sizes.chip);\n const bigH = Math.max(P.chip.h, Math.ceil(sizes.chip * 1.6));\n\n // 関係者の並びと種類と形。畳んだ箱の内側にしか出ない関係者は並べない\n const order: string[] = [];\n const declared = new Set(diagram.boxes.map((b) => b.id));\n const see = (id: string): void => {\n if (declared.has(id) && !hidden.has(id) && !order.includes(id)) order.push(id);\n };\n for (const step of diagram.steps) for (const e of step.events) for (const id of partiesOf(e)) see(id);\n for (const b of diagram.boxes) see(b.id);\n const visible = new Set(order);\n const isBox = (id: string): boolean => sim.tokens.has(id);\n const callers = new Set(sim.calls.flatMap((c) => [c.from, c.to]));\n const callees = new Set(sim.calls.map((c) => c.to));\n const sender = sim.calls[0]?.from;\n const roleOf = (id: string): PipeRole => (isBox(id) ? \"token\" : id === sender ? \"sender\" : callers.has(id) ? \"contract\" : \"account\");\n const shapeOf = (id: string): PipeShape => (isBox(id) ? \"token\" : id === sender || !callees.has(id) ? \"round\" : \"cabinet\");\n const depthOf = new Map<string, number>(sender === undefined ? [] : [[sender, 0]]);\n for (const c of sim.calls) if (!depthOf.has(c.to)) depthOf.set(c.to, c.depth);\n const rowOf = (id: string): number => (shapeOf(id) === \"cabinet\" ? (depthOf.get(id) ?? 0) : 0);\n const shown = sim.calls.filter((c) => !c.inner && visible.has(c.from) && visible.has(c.to));\n\n // 槽と値の札。トークンの箱は槽を持たず、箱の中に値を書く\n const tanksOf = new Map<string, string[]>(order.map((id) => [id, []]));\n const platesOf = new Map<string, string[]>(order.map((id) => [id, []]));\n for (const h of holds) {\n if (\"token\" in h) tanksOf.get(h.box)?.push(h.token);\n else platesOf.get(h.box)?.push(h.name);\n }\n for (const snap of sim.snaps)\n for (const k of snap.balances.keys()) {\n const cut = k.indexOf(\"|\");\n const list = tanksOf.get(k.slice(0, cut));\n if (list && !list.includes(k.slice(cut + 1))) list.push(k.slice(cut + 1));\n }\n const tokenParty = new Map([...sim.tokens].map(([id, token]) => [token, id]));\n const varies = (party: string, token: string): boolean => {\n const initial = holds.flatMap((h) => (\"token\" in h && h.box === party && h.token === token ? [h.amount] : []))[0];\n return new Set([initial, ...sim.snaps.map((snap) => snap.balances.get(keyOf(party, token)))]).size > 1;\n };\n const gone = new Set(\n [...tokenParty].filter(([token, id]) => hidden.has(id) && !order.some((party) => (tanksOf.get(party) ?? []).includes(token) && varies(party, token))).map(([token]) => token),\n );\n for (const [party, list] of tanksOf) tanksOf.set(party, isBox(party) ? [] : list.filter((token) => !gone.has(token)));\n const has = (party: string, token: string): boolean => (tanksOf.get(party) ?? []).includes(token);\n const holders = order.filter((id) => !isBox(id) && ((tanksOf.get(id) ?? []).length > 0 || (platesOf.get(id) ?? []).length > 0));\n holders.sort((a, b) => (a === sender ? -1 : b === sender ? 1 : (declaredAt.get(a) ?? 0) - (declaredAt.get(b) ?? 0)));\n const holding = new Set(holders);\n const tokens = [...new Set(order.flatMap((id) => tanksOf.get(id) ?? []))].sort(\n (a, b) => holds.findIndex((h) => \"token\" in h && h.token === a) - holds.findIndex((h) => \"token\" in h && h.token === b),\n );\n const toneOf = (token: string): number => Math.max(0, tokens.indexOf(token)) % 3;\n const historyOf = (key: string): string[] => {\n const all = new Set<string>();\n for (const snap of sim.snaps) {\n const now = key.startsWith(\"b\") ? snap.balances.get(key.slice(1)) : snap.values.get(key.slice(1));\n if (now !== undefined) all.add(now);\n const was = snap.was.get(key);\n if (was !== undefined) all.add(was);\n }\n for (const h of holds) {\n if (\"token\" in h && key === `b${keyOf(h.box, h.token)}`) all.add(h.amount);\n if (\"name\" in h && key === `v${keyOf(h.box, h.name)}`) all.add(h.value);\n }\n return [...all];\n };\n const widest = (texts: readonly string[], style: TextStyle): number => Math.max(0, ...texts.map((t) => textWidth(t, style)));\n const boxOf = (token: string): string | undefined => {\n const id = tokenParty.get(token);\n return id !== undefined && visible.has(id) ? id : undefined;\n };\n\n // 値の管。同じトークンの同じ 2 人の間の流れは 1 本の管を通る\n const moving = sim.flows.filter((f) => !foldSteps.has(f.step) && f.from !== f.to && has(f.from, f.token) && has(f.to, f.token));\n const defs: Def[] = [];\n for (const f of moving) {\n const d = defs.find((x) => x.token === f.token && ((x.from === f.from && x.to === f.to) || (x.from === f.to && x.to === f.from)));\n if (d) d.flows.push(f);\n else defs.push({ token: f.token, from: f.from, to: f.to, flows: [f] });\n }\n const defOf = (f: FlowRec): number => defs.findIndex((d) => d.token === f.token && d.flows.includes(f));\n\n // ---- 囲いの段と並び\n\n const rank = new Map<string, number>();\n for (const f of moving) for (const id of [f.from, f.to]) if (!rank.has(id)) rank.set(id, rank.size);\n for (const h of holders) if (!rank.has(h)) rank.set(h, rank.size);\n const rankOf = (id: string): number => rank.get(id) ?? 0;\n const linked = (a: string, b: string): boolean => defs.some((d) => (d.from === a && d.to === b) || (d.from === b && d.to === a));\n // 隣の者の並び。呼び出しの浅い者を先に、同じ深さは流れに先に出た者を先にする。呼ばれない者は呼ばれる者の後\n const callDepth = (id: string): number => depthOf.get(id) ?? Number.POSITIVE_INFINITY;\n const nbrs = new Map(\n holders.map((a) => [a, holders.filter((b) => b !== a && linked(a, b)).sort((x, y) => callDepth(x) - callDepth(y) || rankOf(x) - rankOf(y))]),\n );\n /**\n * `from` から伸びる一番長い道。同じ長さの道は、呼び出しの浅い者を先に通る道。\n * 名札の行は呼び出しの深さで下がるため、浅い者の囲いを上の段に並べると、浅い者どうしの呼び出しの管が上の段の中で短く済む\n */\n const longest = (from: string, avoid: ReadonlySet<string>): string[] => {\n let best: string[] = [from];\n let budget = 20000;\n const path = [from];\n const walk = (): void => {\n if (--budget < 0) return;\n if (path.length > best.length) best = [...path];\n for (const n of nbrs.get(path[path.length - 1] as string) ?? []) {\n if (path.includes(n) || avoid.has(n)) continue;\n path.push(n);\n walk();\n path.pop();\n }\n };\n walk();\n return best;\n };\n const band0: string[] = [];\n const band1: string[] = [];\n const done = new Set<string>();\n for (const seed of [...holders].sort((a, b) => rankOf(a) - rankOf(b))) {\n if (done.has(seed)) continue;\n const comp: string[] = [];\n const queue = [seed];\n while (queue.length > 0) {\n const id = queue.shift() as string;\n if (done.has(id)) continue;\n done.add(id);\n comp.push(id);\n queue.push(...(nbrs.get(id) ?? []));\n }\n const start = sender !== undefined && comp.includes(sender) ? sender : seed;\n const path = longest(start, new Set());\n const ext = longest(start, new Set(path)).slice(1);\n const chain = [...ext.reverse(), ...path];\n // 隣どうしが 3 人とも流れでつながる所は、後から流れに出た者を下の段に下ろして輪にする\n for (let again = true; again; ) {\n again = false;\n for (let i = 1; i < chain.length - 1; i++) {\n const tri = [chain[i - 1], chain[i], chain[i + 1]] as string[];\n if (!(linked(tri[0] as string, tri[1] as string) && linked(tri[1] as string, tri[2] as string) && linked(tri[0] as string, tri[2] as string))) continue;\n const drop = tri.filter((x) => x !== start).sort((a, b) => rankOf(b) - rankOf(a))[0] as string;\n chain.splice(chain.indexOf(drop), 1);\n again = true;\n break;\n }\n }\n band0.push(...chain);\n band1.push(...comp.filter((id) => !chain.includes(id)));\n }\n const bandOf = (id: string): 0 | 1 | undefined => (band0.includes(id) ? 0 : band1.includes(id) ? 1 : undefined);\n\n // 槽の並び。流れの相手が左に居る槽を左に置く\n const posGuess = new Map<string, number>(band0.map((id, i) => [id, i]));\n for (let pass = 0; pass < 2; pass++)\n for (const id of band1) {\n const near = (nbrs.get(id) ?? []).flatMap((n) => (posGuess.has(n) && (pass > 0 || bandOf(n) === 0) ? [posGuess.get(n) as number] : []));\n posGuess.set(id, near.length > 0 ? mean(near) : band0.length / 2);\n }\n const scoreOf = (h: string, token: string): number => {\n const ds = defs.filter((d) => d.token === token && (d.from === h || d.to === h)).map((d) => (posGuess.get(d.from === h ? d.to : d.from) ?? 0) - (posGuess.get(h) ?? 0));\n return ds.length > 0 ? mean(ds) : 0;\n };\n // 相手が同じ向きに居る槽どうしは、相手が左に居る時は逆の順に並べる。向かい合う 2 つの囲いで並びが鏡になり、管が入れ子になって交わらない\n for (const h of holders) {\n const list = tanksOf.get(h) ?? [];\n list.sort((a, b) => scoreOf(h, a) - scoreOf(h, b) || (scoreOf(h, a) < 0 ? -1 : 1) * (tokens.indexOf(a) - tokens.indexOf(b)));\n }\n\n // ---- 部品の大きさ\n\n const nameW = (id: string): number => textWidth(nameOf(id), T.party);\n const arrowW = textWidth(\"→\", T.keyValue);\n /** 呼ぶ者の数。トークンの箱は呼ぶ者ごとに上から入る口を 1 つずつ持てる幅にする。横の 2 つの口は、下の段から来る管が箱の上へ回る道に残す */\n const inboundOf = (id: string): number => new Set(shown.filter((c) => c.to === id && c.from !== id).map((c) => c.from)).size;\n const topsW = (id: string): number => 2 * (Math.ceil((inboundOf(id) - 1) / 2) * (P.call.case + LINE_GAP) + P.call.case);\n const tokenW = (id: string): number =>\n Math.max(\n P.token.w,\n topsW(id),\n nameW(id) + P.token.nameW,\n ...(platesOf.get(id) ?? []).flatMap((name) => {\n const history = historyOf(`v${keyOf(id, name)}`);\n return [textWidth(name, T.key) + P.token.keyW, widest(history, T.keyValue) * 2 + arrowW + P.token.arrowGap * 2 + P.token.keyW];\n }),\n );\n const tokenH = (id: string): number => P.token.h + P.token.line * (platesOf.get(id) ?? []).length;\n const sizeOf = (id: string): { w: number; h: number } => {\n const shape = shapeOf(id);\n if (shape === \"token\") return { w: tokenW(id), h: tokenH(id) };\n if (shape === \"round\") return { w: P.avatar.size, h: P.avatar.size };\n return { w: P.cabinet.pad + nameW(id) + P.cabinet.end, h: P.cabinet.h };\n };\n /** 名札の上と下の張り出し (真ん中から)。丸の名札は下に名前を書く */\n const aboveOf = (id: string): number => sizeOf(id).h / 2;\n const belowOf = (id: string): number => (shapeOf(id) === \"round\" ? P.avatar.nameY + T.party.size * 0.35 : sizeOf(id).h / 2);\n /** 名札が横に占める幅。丸の名札は下に書く名前の幅まで */\n const roomOf = (id: string): number => (shapeOf(id) === \"round\" ? Math.max(P.avatar.size, nameW(id) + 8) : sizeOf(id).w);\n\n // イベントの札の字。同じ者が同じ段に同じ名前のイベントを 2 つ以上出した時は、1 つの札にまとめて数を添える\n const chipTextOf = (e: EmitRec): string => `${nameOf(e.party)}.${e.name}`;\n const argsOf = (e: EmitRec): string | undefined => (e.args && e.args.length > 0 ? e.args.join(\", \") : undefined);\n const chipW = (text: string, style: TextStyle = chipStyle): number => P.chip.padX * 2 + textWidth(text, style);\n const eventW = (party: string): number =>\n narrow ? 0 : Math.max(0, ...sim.emits.filter((e) => e.party === party).map((e) => chipW(`${chipTextOf(e)} ×9`) + (argsOf(e) ? P.chip.argsGap + textWidth(argsOf(e) ?? \"\", T.args) : 0)));\n\n // 計器。値を払う前の確認は、払う値の管に載せる (#3398)\n const paysOn = (party: string): string | undefined => {\n if (sim.tokens.has(party)) return undefined;\n const own = sim.checks.filter((c) => c.party === party);\n const first = Math.min(...own.map((c) => c.step));\n const unitOf = (s: string): string | undefined => s.trim().split(/\\s+/u).pop();\n const units = new Set(own.flatMap((c) => [unitOf(c.check.left), unitOf(c.check.right)]));\n const pay = moving.find((f) => f.from === party && f.step >= first && units.has(f.token));\n const box = pay ? boxOf(pay.token) : undefined;\n return pay && box !== undefined && !sim.checks.some((c) => c.party === box) ? pay.token : undefined;\n };\n const checkers = [...new Set(sim.checks.map((c) => c.party))].filter((id) => visible.has(id));\n const gaugeToken = new Map<string, string>();\n for (const party of checkers) {\n const token = isBox(party) ? sim.tokens.get(party) : paysOn(party);\n if (token !== undefined && boxOf(token) !== undefined && !gone.has(token)) gaugeToken.set(party, token);\n }\n const formulaOf = (c: CheckRec): string => `${c.check.left} ${OP_TEXT[c.check.op]} ${c.check.right}`;\n const formulaW = (party: string): number => Math.max(0, ...sim.checks.filter((c) => c.party === party).map((c) => chipW(formulaOf(c))));\n const gaugeColW = (party: string): number => Math.max(P.gauge.r * 2 + P.gauge.lampGap + P.gauge.lamp * 2, formulaW(party));\n\n // ---- 囲いの中身。槽を並べ、値の札を後ろに置く\n\n const housingH = P.housing.top + P.tank.h + Math.max(P.housing.text, narrow ? Math.ceil(sizes.amount * 1.25) + P.housing.pad : 0);\n interface Inner {\n tanks: { token: string; dx: number; w: number }[];\n plates: { name: string; dx: number; w: number }[];\n w: number;\n }\n /** 槽の下の残高の行の幅と、その下の増減と語の行の幅。狭い枠は増減と語を描かない */\n const balanceW = (h: string, token: string): number => widest(historyOf(`b${keyOf(h, token)}`).map(grouped), amountStyle);\n const subW = (h: string, token: string): number =>\n narrow ? 0 : Math.max(widest(historyOf(`b${keyOf(h, token)}`).map((v) => joinWords(`+${grouped(v)}`, token)), T.delta), ...Object.values(words.tags).map((t) => textWidth(t, T.tag)));\n const numberW = (h: string, token: string): number => Math.max(balanceW(h, token), subW(h, token));\n /** 槽の名前の幅。名前は字の間を空けて描く */\n const titleW = (token: string): number => textWidth(token, T.tankTitle) + [...token].length * T.tankTitle.size * P.tank.titleTrack;\n /** 槽の幅。名前が長い時は、名前がつやと目盛りにかからない幅まで広げる */\n const tankW = (token: string): number => Math.max(P.tank.w, Math.ceil(titleW(token)) + (P.tank.shine.x + P.tank.shine.w + PART_GAP) * 2);\n const innerOf = new Map<string, Inner>();\n for (const h of holders) {\n const list = tanksOf.get(h) ?? [];\n // 槽の下の数は槽より広いことがある。端の槽の数が囲いからはみ出さないよう、囲いの縁から槽までを数の半分まで空ける\n const overhang = (token: string): number => Math.max(0, numberW(h, token) / 2 - tankW(token) / 2);\n let x = P.housing.pad + (list[0] === undefined ? 0 : overhang(list[0]));\n const tanks: Inner[\"tanks\"] = [];\n // 真ん中の槽の管は内側の口から出て、槽の間を下りて囲いの外へ出る。その槽の両隣の間を管 1 本分広げる\n const middle = (k: number): boolean => k > 0 && k < list.length - 1 && defs.some((d) => d.token === list[k] && (d.from === h || d.to === h));\n list.forEach((token, j) => {\n if (j > 0) {\n const prev = list[j - 1] as string;\n const pass = middle(j - 1) || middle(j) ? P.bus.case + LINE_GAP * 2 + PART_GAP : 0;\n x += Math.max(P.tank.inner, (numberW(h, prev) + numberW(h, token)) / 2 + PART_GAP * 2 - (tankW(prev) + tankW(token)) / 2 + pass);\n }\n tanks.push({ token, dx: x, w: tankW(token) });\n x += tankW(token);\n });\n const last = list[list.length - 1];\n if (last !== undefined && (platesOf.get(h) ?? []).length === 0) x += overhang(last);\n const plates: Inner[\"plates\"] = [];\n for (const name of platesOf.get(h) ?? []) {\n if (tanks.length > 0 || plates.length > 0) x += P.plate.gap;\n // 札の名前は槽の名前と同じく字の間を空けて描くので、字の間を含む幅で測る (#3526)\n const w = Math.max(P.plate.w, titleW(name) + P.plate.padX, widest(historyOf(`v${keyOf(h, name)}`), T.plateValue) + P.plate.padX);\n plates.push({ name, dx: x, w });\n x += w;\n }\n innerOf.set(h, { tanks, plates, w: x + P.housing.pad });\n }\n\n // ---- トークンの箱を載せる管。隣の囲いを結ぶ管か、囲いの外側の口から横に出る管に載せる\n\n interface Home {\n token: string;\n box: string;\n /** 載せる管 (`defs` の番号)。管を持たない箱は持ち主の槽から短い管を引く */\n def?: number;\n /** 管が横に走る所の端の持ち主と向き。`gap` は隣の囲いの間 */\n party: string;\n side: \"left\" | \"right\";\n gap: boolean;\n /** 箱と計器とイベントの札の列の幅 */\n w: number;\n gauges: string[];\n /** 載せる管が出る口の高さの番号 (`P.tank.ports` の番号) */\n slot: number;\n }\n const sideOf = (h: string, token: string): (\"left\" | \"right\")[] => {\n const list = tanksOf.get(h) ?? [];\n const out: (\"left\" | \"right\")[] = [];\n if (list[0] === token && (innerOf.get(h)?.tanks.length ?? 0) > 0) out.push(\"left\");\n if (list[list.length - 1] === token && (platesOf.get(h) ?? []).length === 0) out.push(\"right\");\n return out;\n };\n const homes: Home[] = [];\n const docked = new Set<string>();\n const colW = (box: string, gauges: readonly string[]): number =>\n gauges.reduce((s, g) => s + gaugeColW(g) + PART_GAP, 0) + tokenW(box) + Math.max(0, eventW(box) + PART_GAP - tokenW(box) / 2) + PART_GAP * 2;\n for (const token of tokens) {\n const box = boxOf(token);\n if (box === undefined) continue;\n const gauges = checkers.filter((c) => gaugeToken.get(c) === token);\n const w = colW(box, gauges);\n let home: Home | undefined;\n // 隣どうしの囲いを結ぶ管\n for (const [k, d] of defs.entries()) {\n if (home || d.token !== token) continue;\n const [a, b] = [d.from, d.to];\n for (const band of [band0, band1]) {\n const i = band.indexOf(a);\n const j = band.indexOf(b);\n if (i < 0 || j < 0 || Math.abs(i - j) !== 1) continue;\n const [l, r] = i < j ? [a, b] : [b, a];\n if (sideOf(l, token).includes(\"right\") && sideOf(r, token).includes(\"left\") && !docked.has(`${l}|right`)) {\n home = { token, box, def: k, party: l, side: \"right\", gap: true, w, gauges, slot: 0 };\n docked.add(`${l}|right`);\n docked.add(`${r}|left`);\n }\n }\n }\n // 囲いの外側の口から横に出る管\n for (const [k, d] of defs.entries()) {\n if (home || d.token !== token) continue;\n // 段をまたぐ管は下の段の囲いに載せる。上の段は名札と囲いで横に長く、下の段は横が空いている\n for (const party of [d.from, d.to].sort((x, y) => (bandOf(y) ?? -1) - (bandOf(x) ?? -1))) {\n if (home) break;\n for (const side of sideOf(party, token)) {\n if (docked.has(`${party}|${side}`)) continue;\n home = { token, box, def: k, party, side, gap: false, w, gauges, slot: 0 };\n docked.add(`${party}|${side}`);\n break;\n }\n }\n }\n // 管を持たない箱は、持ち主の槽から短い管を引く\n if (!home)\n for (const party of holders.filter((h) => has(h, token))) {\n if (home) break;\n for (const side of sideOf(party, token)) {\n if (docked.has(`${party}|${side}`)) continue;\n home = { token, box, party, side, gap: false, w, gauges, slot: 0 };\n docked.add(`${party}|${side}`);\n break;\n }\n }\n if (home) homes.push(home);\n }\n const homeOfBox = new Map(homes.map((h) => [h.box, h]));\n // 箱を載せる管の口の高さ。同じ槽のほかの管が下の段へ向かう時は一番上の口に、上の段へ向かう時は一番下の口に載せる。\n // 真ん中の口に載せると、ほかの管が下へ出られる口が半分になり、残りは箱の管を越える\n {\n const slots = P.tank.ports as readonly number[];\n const topSlot = slots.indexOf(Math.min(...slots));\n const bottomSlot = slots.indexOf(Math.max(...slots));\n for (const m of homes) {\n const d0 = m.def === undefined ? undefined : defs[m.def];\n const ends = [m.party, ...(m.gap && d0 ? [d0.from === m.party ? d0.to : d0.from] : [])];\n let down = 0;\n let up = 0;\n for (const [k, d] of defs.entries()) {\n if (k === m.def || d.token !== m.token) continue;\n for (const e of ends) {\n if (d.from !== e && d.to !== e) continue;\n const diff = (bandOf(d.from === e ? d.to : d.from) ?? 0) - (bandOf(e) ?? 0);\n if (diff > 0) down++;\n if (diff < 0) up++;\n }\n }\n m.slot = down > up ? topSlot : up > down ? bottomSlot : 0;\n }\n }\n\n // 値の管の幹の組。同じトークンで同じ槽を端に持つ管が 2 本以上在る時、その槽を根にした組にし、管は根の槽の口を共に出て 1 本の幹を通り、\n // 相手の近くで枝分かれする。何本もの管が平行に並ぶ束にしない。両端が根になれる管は、管の多い方の槽の組に入れる。\n // トークンの箱を載せる管は箱の下を横に走る所を持つため、組に入れない\n const trunkOf = new Map<number, string>();\n {\n const homeDefs = new Set(homes.flatMap((m) => (m.def === undefined ? [] : [m.def])));\n const tankKey = (party: string, token: string): string => `t:${party}|${token}`;\n const degree = new Map<string, number>();\n for (const [k, d] of defs.entries()) {\n if (homeDefs.has(k)) continue;\n for (const party of [d.from, d.to]) degree.set(tankKey(party, d.token), (degree.get(tankKey(party, d.token)) ?? 0) + 1);\n }\n for (const [k, d] of defs.entries()) {\n if (homeDefs.has(k)) continue;\n const [a, b] = [tankKey(d.from, d.token), tankKey(d.to, d.token)];\n const root = (degree.get(b) ?? 0) > (degree.get(a) ?? 0) ? b : a;\n if ((degree.get(root) ?? 0) >= 2) trunkOf.set(k, root);\n }\n }\n /** 値の管の組。幹を共に通る管は根の槽の組、ほかは管ごとの組 */\n const groupOfDef = (k: number): string => trunkOf.get(k) ?? `v${k}`;\n\n // ---- 組む。管が通らない時は、間を広げて組み直す\n // 戻り値の札が管に収まらなかった時は、その管の2人の間を札の幅だけ広げ、同じ組み方で1度だけ組み直す (#3607)。\n // 札の幅を全ての戻り値の管に前もって足すと、収まっていた図まで広がるので、収まらなかった管だけに足す\n\n /** 戻り値の札が収まらなかった管 (`呼んだ者>呼ばれた者`) と、2人の間に足す長さ */\n const roomFor = new Map<string, number>();\n /** 組んでいる途中で戻り値の札が収まらなかった管と、足す長さ */\n const cramped = new Map<string, number>();\n let result: PipeLayout | undefined;\n for (const plan of PLANS.slice(from)) {\n cramped.clear();\n result = attempt(plan);\n if (result && cramped.size > 0) {\n for (const [pipe, room] of cramped) roomFor.set(pipe, Math.max(roomFor.get(pipe) ?? 0, room));\n cramped.clear();\n result = attempt(plan) ?? result;\n }\n if (result) {\n PLAN_OF.set(result, PLANS.indexOf(plan));\n break;\n }\n }\n return result as PipeLayout;\n\n function attempt(plan: Plan): PipeLayout | undefined {\n const pitch = P.lane.pitch;\n const corridor = plan.outer * pitch;\n const throughBand = band1.length > 0 || defs.some((d) => !isAdjacent(d));\n const laneW = (throughBand ? plan.lanes : 0) * pitch;\n\n // 横の置き場。囲いの列の幅は、囲いと名札とトークンの箱の列の広い方\n interface Col {\n id: string;\n x: number;\n w: number;\n hx: number;\n }\n const cols = new Map<string, Col>();\n const dockW = (h: string, side: \"left\" | \"right\"): number =>\n homes.filter((m) => !m.gap && m.party === h && m.side === side).reduce((s, m) => s + m.w + P.lane.clear * 2, 0);\n const gapW = (l: string): number => {\n const between = homes.filter((m) => m.gap && m.party === l);\n return Math.max(P.housing.gap, between.reduce((s, m) => s + m.w, 0) + P.lane.clear * 2) + laneW + plan.gap;\n };\n /** 前の組みで戻り値の札が収まらなかった、`from` と `to` の間の管に足す長さ。どちら向きの管でも足す (#3607) */\n const returnRun = (from: string, to: string): number =>\n (roomFor.get(`${from}>${to}`) ?? 0) + (roomFor.get(`${to}>${from}`) ?? 0);\n const roomW = (h: string): number => roomOf(h) + eventW(h) + PART_GAP;\n const lay = (band: readonly string[], start: number, want?: Map<string, number>): void => {\n let x = start;\n band.forEach((h, i) => {\n const inner = innerOf.get(h) as Inner;\n const lw = dockW(h, \"left\");\n const rw = dockW(h, \"right\");\n const w = Math.max(lw + inner.w + rw, roomW(h) + lw + rw);\n if (i > 0) x += gapW(band[i - 1] as string) + returnRun(band[i - 1] as string, h);\n const wanted = want?.get(h);\n if (wanted !== undefined) x = Math.max(x, wanted - w / 2);\n cols.set(h, { id: h, x, w, hx: x + lw + (w - lw - rw - inner.w) / 2 });\n x += w;\n });\n };\n lay(band0, 0);\n // 下の段の囲いは、流れでつながる上の段の囲いの真ん中の下に寄せる\n const anchor = new Map<string, number>();\n for (let pass = 0; pass < 2; pass++)\n for (const h of band1) {\n const near = (nbrs.get(h) ?? []).flatMap((n) => {\n const c = cols.get(n);\n return c && (pass > 0 || bandOf(n) === 0) ? [c.x + c.w / 2] : anchor.has(n) ? [anchor.get(n) as number] : [];\n });\n anchor.set(h, near.length > 0 ? mean(near) : (cols.get(band0[0] as string)?.x ?? 0));\n }\n const lower = [...band1].sort((a, b) => (anchor.get(a) ?? 0) - (anchor.get(b) ?? 0) || rankOf(a) - rankOf(b));\n if (lower.length > 0) {\n const halfW = (h: string): number => {\n const inner = innerOf.get(h) as Inner;\n return Math.max(dockW(h, \"left\") + inner.w + dockW(h, \"right\"), roomW(h) + dockW(h, \"left\") + dockW(h, \"right\")) / 2;\n };\n lay(lower, (anchor.get(lower[0] as string) ?? 0) - halfW(lower[0] as string), anchor);\n // 寄せた分の偏りを均す。下の段の真ん中を、寄せたい所の真ん中に合わせる\n const shift = mean(lower.map((h) => (anchor.get(h) ?? 0) - ((cols.get(h)?.x ?? 0) + (cols.get(h)?.w ?? 0) / 2)));\n if (shift < 0) for (const h of lower) {\n const c = cols.get(h) as Col;\n cols.set(h, { ...c, x: c.x + shift, hx: c.hx + shift });\n }\n }\n\n // 名札の行の横の置き場。囲いを持つ者は自分の囲いの真上、ほかは呼ぶ相手と呼ばれる相手の真ん中\n const xOf = new Map<string, number>();\n for (const [id, c] of cols) xOf.set(id, c.hx + (innerOf.get(id) as Inner).w / 2);\n const homeX = new Map<string, number>();\n const placeHomes = (): void => {\n for (const m of homes) {\n const c = cols.get(m.party);\n if (!c) continue;\n const inner = innerOf.get(m.party) as Inner;\n const gaugesW = m.gauges.reduce((s, g) => s + gaugeColW(g) + PART_GAP, 0);\n const boxLeft = (left: number): number => left + PART_GAP + gaugesW;\n let left: number;\n if (m.gap) left = c.hx + inner.w + (gapW(m.party) - laneW - plan.gap - m.w) / 2;\n else if (m.side === \"right\") left = c.hx + inner.w + P.lane.clear + homes.filter((x) => !x.gap && x.party === m.party && x.side === \"right\" && homes.indexOf(x) < homes.indexOf(m)).reduce((s, x) => s + x.w, 0);\n else left = c.hx - P.lane.clear - m.w - homes.filter((x) => !x.gap && x.party === m.party && x.side === \"left\" && homes.indexOf(x) < homes.indexOf(m)).reduce((s, x) => s + x.w, 0);\n homeX.set(m.box, left);\n xOf.set(m.box, boxLeft(left) + tokenW(m.box) / 2);\n }\n };\n placeHomes();\n\n const tagParties = order.filter((id) => !isBox(id) && bandOf(id) !== 1);\n const others = tagParties.filter((id) => !holding.has(id));\n const nearOf = (id: string): number[] =>\n [...new Set(shown.flatMap((c) => (c.to === id ? [c.from] : c.from === id ? [c.to] : [])))]\n .filter((n) => n !== id)\n .flatMap((n) => (xOf.has(n) ? [xOf.get(n) as number] : []));\n const maxRow = Math.max(0, ...tagParties.map(rowOf));\n /** 呼ぶ者が名札の横から出て向きを変えるまでの長さ。呼ばない者は 0 */\n const callerRun = (id: string): number =>\n Math.max(0, ...shown.filter((c) => c.from === id).map((c) => P.call.valveAt + P.valve.r + SPACING + (checkers.includes(c.to) && !gaugeToken.has(c.to) ? P.gauge.r * 2 + SPACING : 0)));\n /** 同じ行の名札と、上の行から自分の囲いへ下りる点線を避けて、`want` に一番近い所 */\n const freeX = (id: string, want: number): number => {\n const row = rowOf(id);\n const w = roomOf(id) + eventW(id);\n const occ: [number, number][] = [];\n for (const [other, cx] of xOf) {\n if (other === id || isBox(other) || bandOf(other) === 1) continue;\n const ow = roomOf(other);\n // 呼ぶ者の横には、弁を載せて向きを変えるまでの長さと、呼ばれた側の手前で向きを揃える長さを空ける\n const gap = Math.max(P.cabinet.gap + plan.gap / 2, callerRun(id) + callerRun(other) + returnRun(id, other) + APPROACH + PART_GAP);\n if (rowOf(other) === row) occ.push([cx - ow / 2 - gap, cx + ow / 2 + eventW(other) + gap]);\n if (holding.has(other) && rowOf(other) < row) occ.push([cx - P.lane.clear * 2, cx + P.lane.clear * 2]);\n }\n const ok = (cx: number): boolean => occ.every(([a, b]) => cx + w - roomOf(id) / 2 < a || cx - roomOf(id) / 2 > b);\n for (let d = 0; d < 1e5; d += 6) {\n if (ok(want + d)) return want + d;\n if (ok(want - d)) return want - d;\n }\n return want;\n };\n const later = others.filter((id) => nearOf(id).length === 0);\n for (const id of [...others.filter((id) => !later.includes(id))].sort((a, b) => rowOf(a) - rowOf(b))) xOf.set(id, freeX(id, mean(nearOf(id))));\n for (const id of later) {\n const near = nearOf(id);\n xOf.set(id, freeX(id, near.length > 0 ? mean(near) : (cols.get(band0[0] as string)?.x ?? 0)));\n }\n // 名札は、呼ぶ相手が上の行に居る時に、その相手の点線に重ならないよう、自分の囲いを持たない者だけを動かした\n // 一番左を図の左の余白に合わせる\n const lefts: number[] = [];\n for (const [id, c] of cols) lefts.push(c.x, (xOf.get(id) ?? 0) - roomOf(id) / 2);\n for (const id of others) lefts.push((xOf.get(id) ?? 0) - roomOf(id) / 2);\n const dx = P.edge + corridor - Math.min(...lefts, 0);\n for (const [id, c] of cols) cols.set(id, { ...c, x: c.x + dx, hx: c.hx + dx });\n for (const [id, x] of xOf) xOf.set(id, x + dx);\n for (const [id, x] of homeX) homeX.set(id, x + dx);\n\n // ---- 縦の置き場\n\n // 呼び出しの管の計器を載せる行。計器を載せる管は呼んだ者の行を横に出る\n const callGauge = new Map<string, number>();\n for (const party of checkers) {\n if (gaugeToken.has(party)) continue;\n const first = shown.find((c) => c.to === party);\n if (first && !isBox(party) && bandOf(first.from) !== 1) callGauge.set(party, rowOf(first.from));\n }\n const rowsWith = new Set(callGauge.values());\n const gaugeUp = P.gauge.r + P.chip.off + chipH;\n const rowY: number[] = [];\n for (let r = 0; r <= maxRow; r++) {\n const here = tagParties.filter((id) => rowOf(id) === r);\n const up = Math.max(P.row.top - (r === 0 ? 0 : P.row.top), ...here.map(aboveOf), rowsWith.has(r) ? gaugeUp : 0);\n if (r === 0) {\n // 一番上の行の名札は、図の上の縁から `TOP_ROOM` 離す。名札を越えて上の口へ下りる管が図の外を回らないように (#3523)\n rowY.push(Math.max(P.margin + Math.max(P.row.top, up + PART_GAP), ...here.map((id) => TOP_ROOM + aboveOf(id))));\n continue;\n }\n const prev = tagParties.filter((id) => rowOf(id) === r - 1);\n const prevY = rowY[r - 1] as number;\n let need = P.row.pitch + plan.rows;\n for (const a of prev)\n for (const b of here) {\n const ax = xOf.get(a) ?? 0;\n const bx = xOf.get(b) ?? 0;\n if (Math.abs(ax - bx) < (roomOf(a) + roomOf(b)) / 2 + P.lane.clear * 4) {\n need = Math.max(need, belowOf(a) + aboveOf(b) + P.lane.clear * 3 + plan.rows);\n // 真下の者を呼ぶ管は、名札の下の側の高さから出て下りる。下りる所に自分の弁を縦に置ける高さを取る\n if (shown.some((c) => c.from === a && c.to === b)) need = Math.max(need, P.call.case + LINE_GAP + VALVE_DROP + aboveOf(b) + plan.rows);\n }\n }\n if (rowsWith.has(r - 1)) need = Math.max(need, P.gauge.r + Math.max(...here.map(aboveOf), 0) + P.lane.clear * 2);\n need = Math.max(need, up + Math.max(0, ...prev.map(belowOf)) + PART_GAP);\n rowY.push(prevY + need);\n }\n const rowsBottom = Math.max(...tagParties.map((id) => (rowY[rowOf(id)] as number) + belowOf(id)), P.margin);\n const H0 = rowsBottom + P.band.tag + (throughBand ? plan.rows / 2 : 0);\n const B0 = H0 + housingH;\n const crossBand = defs.filter((d) => !isAdjacent(d)).length;\n const channel = (n: number): number => (n === 0 ? 0 : Math.max(P.band.next, (n + plan.lanes) * pitch + P.lane.clear));\n const C0 = B0 + channel(band1.length > 0 ? crossBand + 1 : crossBand);\n let tag1 = C0;\n let H1 = C0;\n let B1 = C0;\n if (band1.length > 0) {\n tag1 = C0 + Math.max(...band1.map(aboveOf)) + P.lane.clear;\n H1 = tag1 + Math.max(...band1.map(belowOf)) + P.band.tag;\n B1 = H1 + housingH;\n }\n const C1 = band1.length > 0 ? B1 + channel(crossBand) : C0;\n const yOfBand = (h: string): number => (bandOf(h) === 1 ? H1 : H0);\n const tankTop = (h: string): number => yOfBand(h) + P.housing.top;\n\n // ---- 部品の四角\n\n const cyOf = (id: string): number => {\n if (isBox(id)) {\n const m = homeOfBox.get(id);\n const busY = m ? tankTop(m.party) + (P.tank.ports[m.slot] as number) : rowY[0] as number;\n return busY - P.token.up - tokenH(id) / 2;\n }\n return bandOf(id) === 1 ? tag1 : (rowY[rowOf(id)] as number);\n };\n const rectOf = (id: string): Rect => {\n const { w, h } = sizeOf(id);\n return { x: (xOf.get(id) ?? 0) - w / 2, y: cyOf(id) - h / 2, w, h };\n };\n // 下の段の名札は自分の囲いの真上\n for (const h of band1) xOf.set(h, (cols.get(h)?.hx ?? 0) + (innerOf.get(h)?.w ?? 0) / 2);\n // 槽を持たないトークンの箱は、呼ぶ相手の行に置く\n for (const id of order.filter((x) => isBox(x) && !homeOfBox.has(x))) {\n const near = nearOf(id);\n xOf.set(id, freeX(id, near.length > 0 ? mean(near) : P.edge));\n }\n const labelOf = (id: string): Rect => {\n const r = rectOf(id);\n if (shapeOf(id) !== \"round\") return r;\n const w = nameW(id);\n return { x: Math.min(r.x, r.x + r.w / 2 - w / 2), y: r.y, w: Math.max(r.w, w), h: P.avatar.size / 2 + belowOf(id) };\n };\n\n const housings: PipeHousing[] = holders.map((h) => {\n const c = cols.get(h) as Col;\n return { party: h, row: bandOf(h) ?? 0, x: c.hx, y: yOfBand(h), w: (innerOf.get(h) as Inner).w, h: housingH };\n });\n const housingOf = new Map(housings.map((h) => [h.party, h]));\n const tankRect = new Map<string, Rect>();\n for (const h of holders) {\n const hs = housingOf.get(h) as PipeHousing;\n for (const t of (innerOf.get(h) as Inner).tanks) tankRect.set(keyOf(h, t.token), { x: hs.x + t.dx, y: tankTop(h), w: t.w, h: P.tank.h });\n }\n const tankOf = (party: string, token: string): Rect => tankRect.get(keyOf(party, token)) ?? { x: 0, y: 0, w: 0, h: 0 };\n /** 槽の下の字の帯。残高と増減と語 */\n const textBand = (party: string, token: string): Rect => {\n const t = tankOf(party, token);\n const w = numberW(party, token) + 4;\n return { x: t.x + t.w / 2 - w / 2, y: t.y + t.h + 4, w, h: housingH - P.housing.top - P.tank.h - 6 };\n };\n /** 槽の下の残高の基準線。槽の下の端から `numberY` 下で、残高の字を大きくした枠では字の高さに合わせて下げる */\n const numberBaseOf = (t: Rect): number => t.y + t.h + Math.max(P.tank.numberY, sizes.amount + 6);\n /**\n * 槽の下の字の帯を、残高の行と、その下の増減と語の行に分けた四角 (#3528)。図の中の札だけがこの形で避ける。\n * 帯 1 つで避けると、残高の行の横の空き (増減の行より狭い残高の横) まで塞ぎ、槽から出る管の際に流れた量の札を置けない\n */\n const textRows = (party: string, token: string): Rect[] => {\n const t = tankOf(party, token);\n const band = textBand(party, token);\n const cx = t.x + t.w / 2;\n const base = numberBaseOf(t);\n const balance = balanceW(party, token) + 4;\n const sub = subW(party, token) + 4;\n const subTop = base + P.tank.deltaY - T.delta.size * 0.8;\n return [\n { x: cx - balance / 2, y: band.y, w: balance, h: base + amountStyle.size * 0.2 - band.y },\n { x: cx - sub / 2, y: subTop, w: sub, h: band.y + band.h - subTop },\n ];\n };\n const plateRect = (party: string, name: string): Rect | undefined => {\n const hs = housingOf.get(party);\n const p = innerOf.get(party)?.plates.find((x) => x.name === name);\n return hs && p ? { x: hs.x + p.dx, y: tankTop(party) + P.plate.top, w: p.w, h: P.tank.h - P.plate.short } : undefined;\n };\n const calcParties = new Set(sim.calcs.map((c) => c.party));\n const converterRect = (party: string): Rect | undefined => {\n const [ta, tb] = (innerOf.get(party)?.tanks ?? []).slice(0, 2);\n if (!calcParties.has(party) || !ta || !tb) return undefined;\n const a = tankOf(party, ta.token);\n const b = tankOf(party, tb.token);\n const r = P.converter.r;\n return { x: (a.x + a.w + b.x) / 2 - r, y: a.y + a.h / 2 - r, w: r * 2, h: r * 2 };\n };\n\n // トークンの箱と、箱の管の横に走る所と、値の管に載せる計器\n interface Bay {\n home: Home;\n left: number;\n y: number;\n x1: number;\n x2: number;\n gauges: { party: string; cx: number; cy: number; col: { x: number; w: number } }[];\n }\n const bays: Bay[] = homes.flatMap((m) => {\n const left = homeX.get(m.box);\n if (left === undefined || !cols.has(m.party)) return [];\n const t = tankOf(m.party, m.token);\n const y = t.y + (P.tank.ports[m.slot] as number);\n let x1: number;\n let x2: number;\n if (m.gap) {\n const d = defs[m.def as number] as Def;\n const other = d.from === m.party ? d.to : d.from;\n x1 = t.x + t.w;\n x2 = tankOf(other, m.token).x;\n } else if (m.side === \"right\") {\n x1 = t.x + t.w;\n x2 = left + m.w + (m.def === undefined ? 0 : P.lane.clear);\n } else {\n x1 = left - (m.def === undefined ? 0 : P.lane.clear);\n x2 = t.x;\n }\n let gx = left + PART_GAP;\n const gauges = m.gauges.map((party) => {\n const w = gaugeColW(party);\n const g = { party, cx: gx + w / 2 - (P.gauge.lampGap + P.gauge.lamp * 2) / 2, cy: y - P.gauge.up, col: { x: gx, w } };\n gx += w + PART_GAP;\n return g;\n });\n return [{ home: m, left, y, x1, x2, gauges }];\n });\n const bayOf = new Map(bays.map((b) => [b.home.box, b]));\n\n // ---- 値の管の道\n\n const portSlots = P.tank.ports as readonly number[];\n /** 使った口と、使った管の組。同じ組の管は口を共に使う */\n const taken = new Map<string, string>();\n const portAt = (party: string, token: string, side: \"left\" | \"right\", k: number): PipePort => {\n const t = tankOf(party, token);\n return { party, token, side, x: side === \"left\" ? t.x : t.x + t.w, y: t.y + (portSlots[k] as number) };\n };\n /** 槽の口の候補。外側の縁の口を先に、内側の縁の口を後に試す */\n /**\n * 槽の口の候補。外側の縁の口は、囲いの外の `exit` まで真っすぐ出てから道を探す。\n * 内側の縁の口は囲いの中から道を探すため、外側の口で道が無い時だけ使う\n */\n interface PortChoice {\n port: PipePort;\n cost: number;\n exit: Point;\n inner: boolean;\n }\n // 槽の外側の縁の口の割り当て。同じ縁から別の段へ向かう管が並ぶ時、外の筋を通る管ほど上の口から出し、内の筋の管を越えないようにする。\n // 縁から出た管は、相手の口がこちらを向いていれば進んだ向きのまま入り (進み続ける管)、向こうを向いていれば行き過ぎてから戻って入る (戻る管)。\n // 進み続ける管は戻る管より外を通り、近い相手ほど外を通る。戻る管は遠い相手ほど大きく回るため外を通る。上の段へ向かう管は上下を逆にする\n const yRank = portSlots.map((_, k) => k).sort((a, b) => (portSlots[a] as number) - (portSlots[b] as number));\n const preferSlot = new Map<string, number>();\n /** 管が縁のそばを走る筋の内からの順。内の筋の管から引き、外の管がその外に寄り添う */\n const laneRank = new Map<number, number>();\n const rankUp = (k: number, r: number): void => {\n laneRank.set(k, Math.max(laneRank.get(k) ?? 0, r));\n };\n for (const h of holders) {\n const hs = housingOf.get(h);\n if (!hs) continue;\n for (const token of tanksOf.get(h) ?? [])\n for (const side of sideOf(h, token)) {\n const dock = homes.find((m) => m.token === token && ((m.party === h && m.side === side) || (m.gap && side === \"left\" && m.def !== undefined && [defs[m.def]?.from, defs[m.def]?.to].includes(h) && m.party !== h)));\n const free = yRank.filter((k) => k !== dock?.slot);\n const rows = defs.flatMap((d, k) => {\n if (d.token !== token || (d.from !== h && d.to !== h) || k === dock?.def) return [];\n const partner = d.from === h ? d.to : d.from;\n const vertical = (bandOf(partner) ?? 0) - (bandOf(h) ?? 0);\n if (vertical === 0 || !tankRect.has(keyOf(partner, token))) return [];\n const t = tankOf(partner, token);\n const px = t.x + t.w / 2;\n const sides = sideOf(partner, token);\n const facing = sides.length === 1 ? sides[0] : px > hs.x + hs.w / 2 ? \"left\" : \"right\";\n const continuing = (side === \"right\") === (facing === \"left\");\n const dist = Math.abs(px - (side === \"right\" ? hs.x + hs.w : hs.x));\n return [{ k, vertical, continuing, dist }];\n });\n const order = (list: typeof rows): typeof rows =>\n [...list].sort((a, b) => Number(b.continuing) - Number(a.continuing) || (a.continuing ? a.dist - b.dist : b.dist - a.dist));\n // この槽を根にする幹の組の管は、1 つの口を共に使う。組は組の中で先に並んだ管の所に置く\n const laneKey = (r: (typeof rows)[number]): string => (trunkOf.get(r.k) === `t:${h}|${token}` ? `t:${h}|${token}` : `k${r.k}`);\n const assign = (list: typeof rows, slotAt: (i: number) => number | undefined): void => {\n const keys = [...new Set(list.map(laneKey))];\n for (const r of list) {\n const i = keys.indexOf(laneKey(r));\n const slot = slotAt(i);\n if (slot !== undefined) preferSlot.set(`${r.k}|${h}|${side}`, slot);\n rankUp(r.k, keys.length - 1 - i);\n }\n };\n assign(order(rows.filter((r) => r.vertical > 0)), (i) => free[i]);\n assign(order(rows.filter((r) => r.vertical < 0)), (i) => free[free.length - 1 - i]);\n }\n }\n /** 口の値。割り当てた口が在る時は、割り当てから離れた口ほど重い */\n const slotCost = (def: number | undefined, party: string, side: \"left\" | \"right\", k: number): number => {\n const want = def === undefined ? undefined : preferSlot.get(`${def}|${party}|${side}`);\n return want === undefined ? k * 24 : Math.abs(yRank.indexOf(k) - yRank.indexOf(want)) * 24;\n };\n const portsOf = (party: string, token: string, def?: number): PortChoice[] => {\n const list = tanksOf.get(party) ?? [];\n const j = list.indexOf(token);\n const out: PortChoice[] = [];\n const outer = sideOf(party, token);\n const hs = housingOf.get(party);\n // 最後の槽の右に値の札が並ぶ時は、札の下を通れる口だけを外側の口にする。札は槽より低く、下に隙間がある\n const plates = platesOf.get(party) ?? [];\n const plateBottom = P.plate.top + (P.tank.h - P.plate.short);\n const underPlate = (k: number): boolean => (portSlots[k] as number) - P.bus.case / 2 - LINE_GAP >= plateBottom;\n /** 口を使えるか。使った口は、同じ組の管だけが共に使う */\n const usable = (key: string): boolean => !taken.has(key) || (def !== undefined && taken.get(key) === groupOfDef(def));\n /** 同じ組の管が使った口は値を足さず、幹を共に通らせる */\n const shared = (key: string): boolean => def !== undefined && taken.get(key) === groupOfDef(def);\n if (j === list.length - 1 && plates.length > 0 && hs)\n portSlots.forEach((_, k) => {\n const key = `${party}|${token}|right|${k}`;\n if (!underPlate(k) || !usable(key)) return;\n const port = portAt(party, token, \"right\", k);\n out.push({ port, cost: shared(key) ? 0 : k * 24, exit: [hs.x + hs.w + vPadOut, port.y], inner: false });\n });\n for (const side of [\"left\", \"right\"] as const) {\n const inner = !outer.includes(side);\n if (inner && side === \"right\" && j === list.length - 1 && plates.length > 0) continue;\n if (inner && (side === \"left\" ? j === 0 : j === list.length - 1)) continue;\n if (inner && converterRect(party) && (side === \"left\" ? j === 1 : j === 0)) continue;\n portSlots.forEach((_, k) => {\n const port = portAt(party, token, side, k);\n // 内側の口は、隣の槽との間の真ん中まで出てから道を探す。口の際で折れる短い線を作らない\n const next = list[side === \"left\" ? j - 1 : j + 1];\n const gapMid = next !== undefined ? (side === \"left\" ? (tankOf(party, next).x + tankOf(party, next).w + port.x) / 2 : (port.x + tankOf(party, next).x) / 2) : port.x;\n const exit: Point = !hs ? [port.x, port.y] : inner ? [gapMid, port.y] : [side === \"left\" ? hs.x - vPadOut : hs.x + hs.w + vPadOut, port.y];\n const key = `${party}|${token}|${side}|${k}`;\n if (usable(key)) out.push({ port, cost: shared(key) ? 0 : inner ? k * 24 + 400 : slotCost(def, party, side, k), exit, inner });\n });\n }\n return out;\n };\n const keyPort = (p: PipePort): string => `${p.party}|${p.token}|${p.side}|${portSlots.indexOf(p.y - tankOf(p.party, p.token).y)}`;\n\n // 格子。管の道に使う縦と横の線\n const width0 = Math.max(...[...cols.values()].map((c) => c.x + c.w), ...[...xOf.entries()].map(([id, x]) => x + roomOf(id) / 2 + eventW(id))) + P.edge + corridor;\n const height0 = (band1.length > 0 ? C1 : C0 > B0 ? C0 : B0) + P.margin;\n const keepX: number[] = [];\n const keepY: number[] = [];\n for (const [k, t] of tankRect) {\n void k;\n keepX.push(t.x, t.x + t.w);\n for (const s of portSlots) keepY.push(t.y + s);\n }\n for (const b of bays) keepX.push(b.x1, b.x2);\n const vPadOut = P.bus.case / 2 + P.lane.clear;\n for (const h of housings) keepX.push(h.x - vPadOut, h.x + h.w + vPadOut);\n for (const h of housings) {\n const inner = innerOf.get(h.party) as Inner;\n inner.tanks.slice(1).forEach((t, j) => keepX.push(h.x + ((inner.tanks[j] as { dx: number; w: number }).dx + (inner.tanks[j] as { dx: number; w: number }).w + t.dx) / 2));\n }\n const valueXs = gridLines(\n Array.from({ length: Math.ceil(width0 / (pitch / 2)) + 1 }, (_, i) => i * (pitch / 2)),\n keepX.flatMap((x) => [x]),\n 6,\n );\n const valueYs = gridLines(\n Array.from({ length: Math.ceil(height0 / (pitch / 2)) + 1 }, (_, i) => i * (pitch / 2)),\n [...keepY, B0 + pitch / 2, C0 - pitch / 2, ...(band1.length > 0 ? [B1 + pitch / 2, C1 - pitch / 2] : [])],\n 6,\n );\n const vHalf = P.bus.case / 2;\n const obstacles: Obstacle[] = [];\n const ownObs = new Map<string, number[]>();\n const addObs = (rect: Rect, pad: number, owner?: string): void => {\n if (owner !== undefined) ownObs.set(owner, [...(ownObs.get(owner) ?? []), obstacles.length]);\n obstacles.push({ rect, pad });\n };\n const vPad = vHalf + P.lane.clear;\n for (const id of order) {\n if (!visible.has(id) || (isBox(id) && !homeOfBox.has(id) && !xOf.has(id))) continue;\n addObs(labelOf(id), vPad);\n }\n for (const h of housings) addObs(h, vPad, `h:${h.party}`);\n for (const [k, t] of tankRect) {\n addObs(t, 0);\n addObs(t, vPad, `t:${k}`);\n }\n for (const h of holders) {\n for (const t of tanksOf.get(h) ?? []) addObs(textBand(h, t), PART_GAP);\n for (const name of platesOf.get(h) ?? []) {\n const r = plateRect(h, name);\n if (r) addObs(r, P.lane.clear);\n }\n const c = converterRect(h);\n if (c) addObs(c, P.lane.clear);\n }\n /** トークンの箱の列。箱と軸と計器と式の札の場所。管の上の余白より上 */\n const bayRect = (b: Bay): Rect => {\n const top = Math.min(cyOf(b.home.box) - tokenH(b.home.box) / 2, ...b.gauges.map((g) => g.cy - P.gauge.r - P.chip.off - chipH));\n return { x: b.left, y: top, w: b.home.w, h: b.y - vHalf - LINE_GAP - top };\n };\n for (const b of bays) addObs(bayRect(b), 0);\n /** 入力と出力の印。始めた人が払った槽と受け取った槽の、囲いの上の余白に置く。値の管はこの印を避ける */\n function ioMarks(): { token: string; text: string; r: Rect }[] {\n if (sender === undefined || !holding.has(sender)) return [];\n return (tanksOf.get(sender) ?? []).flatMap((token) => {\n const first = amountNumber(holds.flatMap((h) => (\"token\" in h && h.box === sender && h.token === token ? [h.amount] : []))[0]);\n const last = amountNumber(snapOf(steps - 1).balances.get(keyOf(sender, token)));\n if (first === last) return [];\n const text = first > last ? words.io.in : words.io.out;\n const t = tankOf(sender, token);\n const w = chipW(text, T.io);\n return [{ token, text, r: { x: t.x + t.w / 2 - w / 2, y: yOfBand(sender) + (P.housing.top - IO_H) / 2 - 2, w, h: IO_H } }];\n });\n }\n for (const m of ioMarks()) addObs(m.r, vPad);\n\n // ---- 名札から自分の囲いへ下りる点線。値の管も呼び出しの管もまたがない\n const ties: PipeTie[] = holders.map((h) => {\n const r = rectOf(h);\n const top = shapeOf(h) === \"round\" ? r.y + r.h / 2 + belowOf(h) + P.tie.gap : r.y + r.h + P.tie.gap;\n return { party: h, x: r.x + r.w / 2, y1: top, y2: yOfBand(h) };\n });\n const tieLines = (router: Router): void => {\n for (const t of ties)\n router.lay(\n [\n [t.x, t.y1],\n [t.x, t.y2],\n ],\n { owner: `tie:${t.party}`, group: `tie:${t.party}`, kind: \"tie\", width: 2 },\n );\n };\n\n let valueRouter = new Router(valueXs, valueYs, obstacles);\n let routes: { def: number; points: Point[]; ports: [PipePort, PipePort] }[] = [];\n let stubs: PipeStub[] = [];\n const lineOwner = (k: number): string => `v${k}`;\n const layValue = (k: number, points: Point[]): void => valueRouter.lay(points, { owner: lineOwner(k), group: groupOfDef(k), kind: \"value\", width: P.bus.case });\n // 箱を載せる管は先に置く。隣の囲いを結ぶ管は横に 1 本、外側の口から出る管は箱の下を横に走ってから道を探す。\n // 幹を共に通る組の管は、組の中で一番近い管の順の所にまとめて置き、組の中では近い相手の管から引く。\n // 近い相手への管は根の囲いのそばで下りて幹になり、遠い相手の管は幹を共に通って先で分かれる。根から離れた所で下りる幹は、ほかの囲いの名札を囲んで呼び出しの管の道を塞ぐ\n const members = (k: number): number[] => (trunkOf.has(k) ? [...defs.keys()].filter((x) => trunkOf.get(x) === trunkOf.get(k)) : [k]);\n const order2 = [...defs.keys()].sort((a, b) => {\n const ha = homes.some((m) => m.def === a) ? 0 : 1;\n const hb = homes.some((m) => m.def === b) ? 0 : 1;\n const da = isAdjacent(defs[a] as Def) ? 0 : 1;\n const db = isAdjacent(defs[b] as Def) ? 0 : 1;\n const rankOfGroup = (k: number): number => Math.min(...members(k).map((x) => laneRank.get(x) ?? 0));\n const spanOfGroup = (k: number): number => Math.min(...members(k).map(spanOf));\n const lead = (k: number): number => Math.min(...members(k));\n return (\n ha - hb ||\n da - db ||\n rankOfGroup(a) - rankOfGroup(b) ||\n spanOfGroup(a) - spanOfGroup(b) ||\n lead(a) - lead(b) ||\n spanOf(a) - spanOf(b) ||\n a - b\n );\n });\n /** 道の長さのうち、端と端の真っすぐな隔たりを超えた分 */\n const detourOf = (points: readonly Point[]): number => {\n let len = 0;\n for (let i = 1; i < points.length; i++) len += Math.abs((points[i] as Point)[0] - (points[i - 1] as Point)[0]) + Math.abs((points[i] as Point)[1] - (points[i - 1] as Point)[1]);\n const a = points[0] as Point;\n const b = points[points.length - 1] as Point;\n return len - Math.abs(b[0] - a[0]) - Math.abs(b[1] - a[1]);\n };\n /**\n * 値の管を `list` の順に引く。先に引いた管が後の管の口を囲むと道が無くなるか遠回りになるため、\n * 呼ぶ側は道の無かった管と遠回りした管を前に出して引き直す。`fallback` の時だけ道の無い管を下の道の折れ線で結ぶ\n */\n const routeValues = (list: readonly number[], fallback: boolean): { failed: number[]; bent: number[]; detours: Map<number, number> } => {\n valueRouter = new Router(valueXs, valueYs, obstacles);\n taken.clear();\n routes = [];\n tieLines(valueRouter);\n // 管を持たない箱の短い管。口は先に押さえる\n stubs = bays\n .filter((b) => b.home.def === undefined)\n .map((b) => {\n const a = portAt(b.home.party, b.home.token, b.home.side, b.home.slot);\n taken.set(keyPort(a), `s${b.home.token}`);\n const end: Point = [b.home.side === \"left\" ? b.x1 : b.x2, a.y];\n const points: Point[] = b.home.side === \"left\" ? [end, [a.x, a.y]] : [[a.x, a.y], end];\n valueRouter.lay(points, { owner: `s${b.home.token}`, group: `s${b.home.token}`, kind: \"stub\", width: P.bus.case });\n return { token: b.home.token, points };\n });\n const failed: number[] = [];\n const bent: number[] = [];\n const detours = new Map<number, number>();\n for (const k of list) {\n const d = defs[k] as Def;\n const home = homes.find((m) => m.def === k);\n const bay = home ? bayOf.get(home.box) : undefined;\n const dirOut = (side: \"left\" | \"right\"): Dir => (side === \"left\" ? 2 : 0);\n const dirIn = (side: \"left\" | \"right\"): Dir => (side === \"left\" ? 0 : 2);\n let points: Point[] | undefined;\n let ports: [PipePort, PipePort] | undefined;\n const askOf = (starts: End[], ends: End[], allow: number[]): Ask => ({\n owner: lineOwner(k),\n group: groupOfDef(k),\n kind: \"value\",\n width: P.bus.case,\n starts,\n ends,\n allow: new Set(allow),\n cross: (l) => (l.kind !== \"tie\" && plan.last ? 5000 : undefined),\n gap: LINE_GAP,\n bend: BEND_VALUE,\n hug: 0.02,\n share: SHARE,\n });\n const own = (party: string, token: string): number[] => [...(ownObs.get(`h:${party}`) ?? []), ...(ownObs.get(`t:${keyOf(party, token)}`) ?? [])];\n if (home && bay && home.gap) {\n const other = d.from === home.party ? d.to : d.from;\n const a = portAt(home.party, d.token, \"right\", home.slot);\n const b = portAt(other, d.token, \"left\", home.slot);\n // 点は送る側から受ける側へ並べる。流れの向きは点の並びで決まる\n points = d.from === home.party ? [[a.x, a.y], [b.x, b.y]] : [[b.x, b.y], [a.x, a.y]];\n ports = d.from === home.party ? [a, b] : [b, a];\n } else {\n /** 口の候補どうしを結ぶ。外側の口だけで道が無い時に限り、内側の口と囲いの中を使う */\n const join = (sa: PortChoice[], sb: PortChoice[]): { points: Point[]; a: PipePort; b: PipePort } | undefined => {\n const same = (p: PortChoice, q: Point): boolean => Math.abs(p.exit[0] - q[0]) < 0.5 && Math.abs(p.exit[1] - q[1]) < 0.5;\n // 口から外の点までの線は道を探さずに引くため、先に引いた管がその線を越える口は使わない\n const stubAsk = askOf([], [], [...own(d.from, d.token), ...own(d.to, d.token)]);\n const clear = (p: PortChoice): boolean => same(p, [p.port.x, p.port.y]) || valueRouter.passable(stubAsk, [p.port.x, p.port.y], p.exit);\n for (const loose of [false, true]) {\n const xa = sa.filter((p) => (loose || !p.inner) && clear(p));\n const xb = sb.filter((p) => (loose || !p.inner) && clear(p));\n if (xa.length === 0 || xb.length === 0 || (loose && xa.every((p) => !p.inner) && xb.every((p) => !p.inner))) continue;\n // 内側の口は槽の間を上か下へ抜ける。外側の口は外の点から横に進むほか、外の点で上か下へ折れてよい。\n // 外の点の筋を同じ組の幹が通る時は、外の点で幹に入る。1 つ先の点まで出てから折れると、幹の際で行って戻る段差になる\n const turns = (p: PortChoice, straight: Dir): End[] =>\n p.inner\n ? ([1, 3] as Dir[]).map((dir) => ({ at: p.exit, dir, cost: p.cost }))\n : [{ at: p.exit, dir: straight, cost: p.cost }, ...([1, 3] as Dir[]).map((dir) => ({ at: p.exit, dir, cost: p.cost + BEND_VALUE }))];\n const request = askOf(\n xa.flatMap((p) => turns(p, dirOut(p.port.side))),\n xb.flatMap((p) => turns(p, dirIn(p.port.side))),\n loose ? [...own(d.from, d.token), ...own(d.to, d.token)] : [],\n );\n // 道の途中の短い段差を消す。口の点は動かさず、外の点は口から外の点までの線の上で口の側へ動かしてよい。\n // 幹を共に通る管は外の点が決まっているため、幹の筋と外の点の筋が少しずれると、外の点の手前に短い段差が残る\n const finish = (path: Point[]): { points: Point[]; a: PipePort; b: PipePort } | undefined => {\n const pa = xa.find((p) => same(p, path[0] as Point));\n const pb = xb.find((p) => same(p, path[path.length - 1] as Point));\n if (!pa || !pb) return undefined;\n /**\n * 線が通れるか。口から外の点までの線の上の所は道を探さずに引くため通れるとし、外の点より先の所は道を探す時と同じく測る\n */\n const passes = (u: Point, v: Point): boolean => {\n for (const c of [pa, pb]) {\n if (Math.abs(u[1] - c.port.y) >= 0.5 || Math.abs(v[1] - c.port.y) >= 0.5) continue;\n const [lo, hi] = [Math.min(c.port.x, c.exit[0]), Math.max(c.port.x, c.exit[0])];\n const [s0, s1] = [Math.min(u[0], v[0]), Math.max(u[0], v[0])];\n if (s0 >= lo - 0.5 && s1 <= hi + 0.5) return true;\n // 外の点をまたいで外へ伸びる線は、外の点から先の所だけを測る\n if (s0 >= lo - 0.5 && s0 <= hi + 0.5) return valueRouter.passable(request, [hi, c.port.y], [s1, c.port.y]);\n if (s1 >= lo - 0.5 && s1 <= hi + 0.5) return valueRouter.passable(request, [lo, c.port.y], [s0, c.port.y]);\n }\n return valueRouter.passable(request, u, v);\n };\n const full = unjog([[pa.port.x, pa.port.y], ...path, [pb.port.x, pb.port.y]], 16, passes, valueRouter);\n return { points: simplify(full), a: pa.port, b: pb.port };\n };\n const got = fewerBends(valueRouter, request, finish);\n if (got) return got;\n }\n return undefined;\n };\n if (home && bay) {\n // 箱を載せる管は、箱の下を横に走って箱の列の端から道を探す\n const a = portAt(home.party, d.token, home.side, home.slot);\n const dock: PortChoice = { port: a, cost: 0, exit: [home.side === \"left\" ? bay.x1 : bay.x2, a.y], inner: false };\n const other = d.from === home.party ? d.to : d.from;\n const got = join([dock], portsOf(other, d.token, k));\n if (got) {\n points = got.points;\n ports = d.from === home.party ? [got.a, got.b] : [got.b, got.a];\n if (d.from !== home.party) points = [...points].reverse();\n }\n } else {\n const got = join(portsOf(d.from, d.token, k), portsOf(d.to, d.token, k));\n if (got) {\n points = got.points;\n ports = [got.a, got.b];\n }\n }\n }\n if (!points || !ports || !ports[0] || !ports[1]) {\n failed.push(k);\n if (!fallback) continue;\n // 最後の組み方でも道が無い時は、下の道を通る折れ線で結ぶ。決まりの表が違反に数える\n const a = portsOf(d.from, d.token)[0]?.port ?? portAt(d.from, d.token, \"right\", 0);\n const b = portsOf(d.to, d.token)[0]?.port ?? portAt(d.to, d.token, \"left\", 0);\n const out = (p: PipePort): number => p.x + (p.side === \"left\" ? -1 : 1) * (vHalf + P.lane.clear * 2);\n const low = (band1.length > 0 ? C1 : C0) - pitch / 2;\n points = [\n [a.x, a.y],\n [out(a), a.y],\n [out(a), low],\n [out(b), low],\n [out(b), b.y],\n [b.x, b.y],\n ];\n ports = [a, b];\n }\n taken.set(keyPort(ports[0]), groupOfDef(k));\n taken.set(keyPort(ports[1]), groupOfDef(k));\n layValue(k, points);\n routes[k] = { def: k, points, ports };\n detours.set(k, detourOf(points));\n if (bendsOf(points) > MAX_BENDS) bent.push(k);\n }\n return { failed, bent, detours };\n };\n // 道の無い管と曲がりすぎた管と遠回りした管を前に出して、引く順を最大 4 通り試す。道の無い管が少なく、曲がりすぎた管が少なく、遠回りが短い順を採る\n const FAR = 240;\n const { best, ran } = tryOrders(\n order2,\n (list) => list.join(\",\"),\n (list) => routeValues(list, false),\n (got) => [got.failed.length, got.bent.length, [...got.detours.values()].reduce((s, v) => s + v, 0)],\n (list, got) => {\n const far = [...got.detours.entries()].filter(([, v]) => v > FAR).sort((a, b) => b[1] - a[1]).map(([k]) => k);\n // 隣の囲いを結ぶ管は道を探さず真っすぐ引くため、いつも先頭に置く\n const fixed = list.filter((k) => homes.some((m) => m.def === k && m.gap));\n const bad = [...new Set([...got.failed, ...got.bent, ...far])].filter((k) => !fixed.includes(k));\n return bad.length === 0 ? undefined : [...fixed, ...bad, ...list.filter((k) => !bad.includes(k) && !fixed.includes(k))];\n },\n );\n const valuesFailed = best.got.failed.length;\n // 道が無いか曲がりすぎた管が残る時は、間を広げた組み方で組み直す\n if (valuesFailed + best.got.bent.length > 0 && !plan.last) return undefined;\n if (best.list !== ran || valuesFailed > 0) routeValues(best.list, valuesFailed > 0);\n\n // ---- 呼び出しの管の道\n\n const cHalf = P.call.case / 2;\n const cPad = cHalf + P.lane.clear;\n const callObs: Obstacle[] = [];\n const callOwn = new Map<string, number[]>();\n const addCall = (rect: Rect, pad: number, owner?: string): void => {\n if (owner !== undefined) callOwn.set(owner, [...(callOwn.get(owner) ?? []), callObs.length]);\n callObs.push({ rect, pad });\n };\n const partyRects = new Map<string, Rect>();\n for (const id of order) {\n if (isBox(id) && !homeOfBox.has(id) && !xOf.has(id)) continue;\n const r = labelOf(id);\n partyRects.set(id, r);\n addCall(rectOf(id), 0);\n if (shapeOf(id) === \"round\") addCall({ ...r, y: r.y + P.avatar.size }, cPad);\n addCall(rectOf(id), cPad, id);\n }\n for (const h of housings) addCall(h, cPad, `h:${h.party}`);\n for (const b of bays) {\n const r = bayRect(b);\n const box = rectOf(b.home.box);\n // 箱の左の計器と式の札の場所\n if (box.x - r.x > 1) addCall({ x: r.x, y: r.y, w: box.x - r.x - PART_GAP / 2, h: r.h }, cPad);\n addCall({ x: box.x + box.w / 2 - 3, y: box.y + box.h, w: 6, h: b.y - box.y - box.h }, cPad);\n }\n const startRun = (from: string, to: string): number => {\n const gaugeHere = callGauge.has(to) && shown.find((c) => c.to === to)?.from === from;\n return P.call.valveAt + P.valve.r + SPACING + (gaugeHere ? P.gauge.r * 2 + SPACING : 0);\n };\n // 呼び出しの管の格子。名札の縁と真ん中と出入りの点を残し、値の管の格子の線で埋める。\n // 埋める線は残す線から 16 より離す。近い線が並ぶと、線の間で折れる短い段差ができる\n const callXs = new Set<number>();\n const callYs = new Set<number>();\n const callEnds = new Map<string, { starts: End[]; ends: End[]; rect: Rect }>();\n for (const id of partyRects.keys()) {\n const r = rectOf(id);\n const cy = cyOf(id);\n const cx = r.x + r.w / 2;\n callXs.add(r.x);\n callXs.add(r.x + r.w);\n callXs.add(cx);\n callYs.add(cy);\n callYs.add(r.y);\n callYs.add(r.y + r.h);\n callEnds.set(id, { starts: [], ends: [], rect: r });\n }\n const branches = [...new Map(shown.map((c) => [`${c.from}>${c.to}`, c])).values()];\n const topSlot = LANE_STEP;\n /** 名札の角の丸み。丸の名札は縁を円とし、崩れの検査が測る丸みと揃える (#3607) */\n const cornerOf = (id: string): number => (shapeOf(id) === \"cabinet\" ? P.cabinet.radius : shapeOf(id) === \"token\" ? P.token.radius : rectOf(id).h / 2);\n /**\n * 同じ者の同じ横から出る k 本目の管の高さのずれ。真ん中、上、下の順。\n * 縁の角から `cornerRoom` 離れた所に収まらない時は真ん中にし、管を角の丸みにかけない (#3523)\n */\n const laneOff = (id: string, k: number): number => {\n const o = [0, -topSlot, topSlot][k] ?? 0;\n return Math.abs(o) + cornerRoom(cornerOf(id)) <= rectOf(id).h / 2 ? o : 0;\n };\n /**\n * 名札の横から出て向きを決めるまでの長さ。弁を載せる分を取るが、呼ばれた側が真横の近くに居る時は、\n * 呼ばれた側の手前で向きを揃えられるよう縮める\n */\n const runOf = (from: string, to: string, side: 0 | 2, k = 0): number => {\n // 同じ横から k 本の管が先に出ている時は、弁 1 つ分ずつ長く出て、先の管の弁と並ばないようにする\n const base = startRun(from, to) + k * (P.valve.r * 2 + SPACING);\n const a = rectOf(from);\n const b = rectOf(to);\n const g = side === 0 ? b.x - (a.x + a.w) : a.x - (b.x + b.w);\n const room = g - 18 - 4;\n return g > 0 && room < base && room > cPadOf() + 1 ? room : base;\n };\n function cPadOf(): number {\n return P.call.case / 2 + P.lane.clear;\n }\n for (const id of partyRects.keys()) for (const o of [-topSlot, topSlot]) callYs.add(cyOf(id) + o);\n for (const c of branches) {\n const a = rectOf(c.from);\n for (const k of [0, 1, 2, 3]) {\n callXs.add(a.x - runOf(c.from, c.to, 2, k));\n callXs.add(a.x + a.w + runOf(c.from, c.to, 0, k));\n }\n }\n /** 上から入る口。真ん中と、幅が足りる名札は左右にも置く。呼ぶ者が多い名札や、真上が塞がる名札に入れるように */\n const topsOf = (id: string): number[] => {\n const r = rectOf(id);\n const bx = r.x + r.w / 2;\n if (shapeOf(id) === \"round\") return [bx];\n const out = [bx];\n // 左右の口も、縁の角から `cornerRoom` 離れた所までに置く\n for (let k = 1; k * topSlot <= r.w / 2 - cornerRoom(cornerOf(id)); k++) out.push(bx - k * topSlot, bx + k * topSlot);\n return out;\n };\n // 呼ばれた側へは、縁から `APPROACH` 手前の点で向きを揃えてから入る。縁の際で折れる短い線を作らない\n for (const id of partyRects.keys()) {\n const r = rectOf(id);\n for (const x of topsOf(id)) callXs.add(x);\n callXs.add(r.x - APPROACH);\n callXs.add(r.x + r.w + APPROACH);\n callYs.add(r.y - APPROACH);\n callYs.add(r.y + r.h + APPROACH);\n }\n // 一番上の段の名札を上から越えて、上の口へ下りる管の線。口の手前の線の 1 本上に置く。\n // 一番上の段の名札の上の縁が揃うと、図の上の縁との間にこの線のほかの線が残らない (#3523)\n const topRow = Math.min(...[...partyRects.keys()].map((id) => rectOf(id).y));\n callYs.add(topRow - APPROACH - P.call.case);\n // 書き込む管が札の上で折れる所\n for (const h of holders) {\n callYs.add(yOfBand(h) + (P.housing.top - IO_H) / 2 - 2);\n for (const name of platesOf.get(h) ?? []) {\n const pr = plateRect(h, name);\n if (pr) callXs.add(pr.x + pr.w / 2);\n }\n }\n // 図の上の縁と左の縁に沿う線は使わない。そこを通る管は半分が図の外に出て切れる (#3523)\n const callXList = gridLines(valueXs, [...callXs], 16).filter((x) => x >= P.call.case);\n const callYList = gridLines(valueYs, [...callYs], 16).filter((y) => y >= P.call.case);\n let callRouter = new Router(callXList, callYList, callObs);\n let callPath = new Map<string, Point[]>();\n\n // 呼び出しの管の弁。全ての呼び出しの管を引いた後に置く。弁を置けない管を引き直す時は、置いた弁の形を間を空けて通る障害にし、\n // 書き込む管を引く時は、弁の形の縁を越えない線として置く。後から引く管が弁の形から離れて通るため、弁がほかの線に載らない\n const onCall: { at: Point; half: number; tall: number; branch: string }[] = [];\n const valves = new Map<string, Point>();\n /** 取っ手を管の下 (縦の管では左) に立てた弁 */\n const underValves = new Set<string>();\n /** 縦に走る所に置いた弁 */\n const uprightValves = new Set<string>();\n /** 置いた弁が描く形 */\n const valveShapes: Rect[] = [];\n /** 弁が描く形の縁を、後から引く線が越えない線として置く */\n const layValve = (router: Router, key: string, at: Point, under: boolean, vertical: boolean): void => {\n for (const r of valveRects(at[0], at[1], vertical, under))\n router.lay(\n [\n [r.x, r.y],\n [r.x + r.w, r.y],\n [r.x + r.w, r.y + r.h],\n [r.x, r.y + r.h],\n [r.x, r.y],\n ],\n { owner: `valve:${key}`, group: `valve:${key}`, kind: \"valve\", width: 0 },\n );\n };\n const placeValve = (key: string, at: Point, under: boolean, vertical = false): void => {\n valves.set(key, at);\n if (under) underValves.add(key);\n if (vertical) uprightValves.add(key);\n onCall.push({ at, half: vertical ? P.valve.half : P.valve.r, tall: vertical ? P.valve.r : P.valve.half, branch: key });\n valveShapes.push(...valveRects(at[0], at[1], vertical, under));\n layValve(callRouter, key, at, under, vertical);\n };\n /** 弁と計器の縦の半分。弁は横に長い */\n const tallOf = (half: number): number => (half === P.valve.r ? P.valve.half : half);\n /** 横の半分が `half`、縦の半分が `tall` の四角と、置いた弁と計器の四角の縁の間が、決まりの間を超えるか。決まりの表と同じく、横と縦の隔たりの大きい方で測る */\n const freeBox = (p: Point, half: number, tall: number): boolean =>\n onCall.every((o) => Math.max(Math.abs(o.at[0] - p[0]) - o.half - half, Math.abs(o.at[1] - p[1]) - o.tall - tall) >= SPACING);\n /** 弁と計器の四角どうしの縁の間が、決まりの間を超えるか */\n const free = (p: Point, half: number): boolean => freeBox(p, half, tallOf(half));\n /**\n * 置いた線のうち、`branch` の管でない物。`mine` の時は同じ者から出た管も含める (計器は同じ者の管が分かれる所に置かない)\n */\n const otherLines = (branch: string, mine = false, skip: ReadonlySet<string> = new Set()): { points: Point[]; half: number; sibling?: boolean }[] => {\n const from = branch.split(\">\")[0];\n return [\n ...routes.flatMap((r) => (r ? [{ points: r.points, half: P.bus.case / 2 }] : [])),\n ...stubs.map((s) => ({ points: s.points, half: P.bus.case / 2 })),\n ...ties.map((t) => ({ points: [[t.x, t.y1], [t.x, t.y2]] as Point[], half: 1 })),\n ...[...callPath.entries()]\n .filter(([k]) => k !== branch && !skip.has(k) && (mine || k.split(\">\")[0] !== from))\n .map(([k, points]) => ({ points, half: cHalf, sibling: k.split(\">\")[0] === from })),\n ];\n };\n /** 道の上で、横に走る所の、ほかの弁と計器と線から離れた所。`from` は道の始まりからの距離の下限 */\n const spot = (points: Point[], half: number, from: number, avoid: readonly Point[][] = [], branch = \"\"): Point | undefined => {\n let walked = 0;\n // 計器は、同じ者から出た管とも重ならない所に置く。弁は同じ者の管が共に通る所を `avoid` で避ける\n const others = otherLines(branch, half === P.gauge.r);\n for (const [a, b] of segs(points)) {\n const len = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (flat(a, b) && len >= half * 2 + SPACING) {\n const dir = Math.sign(b[0] - a[0]);\n for (let t = Math.max(half + SPACING / 2, from - walked); t <= len - half - SPACING / 2; t += 4) {\n const p: Point = [a[0] + dir * t, a[1]];\n if (!free(p, half)) continue;\n const box: Rect = { x: p[0] - half, y: p[1] - tallOf(half), w: half * 2, h: tallOf(half) * 2 };\n if (others.some((l) => segs(l.points).some(([u, v]) => hits(u, v, box, l.half + 2)))) continue;\n if (avoid.some((q) => segs(q).some(([u, v]) => flat(u, v) && Math.abs(u[1] - p[1]) < 0.5 && p[0] >= Math.min(u[0], v[0]) - half && p[0] <= Math.max(u[0], v[0]) + half))) continue;\n return p;\n }\n }\n walked += len;\n }\n return undefined;\n };\n /**\n * 弁が描く形 (胴と軸と、閉じた取っ手と開いた取っ手) が、`lines` の全ての線から離れるか。胴は `body`、軸と取っ手は `VALVE_ROOM` 離す。\n * 同じ者から出る管も数える。同じ者の管が共に通る本管の上の弁は、どの枝の弁か読めない\n */\n const valveClear = (p: Point, vertical: boolean, under: boolean, lines: readonly { parts: [Point, Point][]; half: number }[], body: number): boolean => {\n const rects = valveRects(p[0], p[1], vertical, under);\n // 取っ手どうしも重ねない\n if (rects.some((r) => valveShapes.some((o) => !apart(r, o, VALVE_ROOM)))) return false;\n return lines.every((l) => l.parts.every(([u, v]) => rects.every((r, i) => !hits(u, v, r, l.half + (i === 0 ? body : VALVE_ROOM)))));\n };\n /**\n * 道の上の、ほかの弁と計器から決まりの間を空け、弁の形がほかの線から離れる所と、取っ手を下 (縦の管では左) に立てるか。\n * 横に走る所にも縦に走る所にも置き、弁は管の向きに合わせて描く。同じ者の管と共に通る幹から分かれた枝は、\n * 分かれた先が縦に走ることが多く、自分の枝に弁を置くには縦の所に置く。\n * 始まりに近い所から選び、同じ所では取っ手を上 (縦の管では右) に立てる方を先に試す。`skip` の管の線は測らない。\n * 先に胴がほかの線から管と部品の間 (`LINE_GAP`) 離れる所を道の全体で探し、無い時だけ `VALVE_ROOM` まで寄せた所を探す (#3523)。\n * 隣を平行に走る管から `VALVE_ROOM` しか離れない胴は、隣の管に触れて見える\n */\n const valveSpot = (\n points: Point[],\n branch: string,\n skip: ReadonlySet<string> = new Set(),\n shared = false,\n ): { at: Point; under: boolean; vertical: boolean } | undefined => {\n for (const body of [LINE_GAP, VALVE_ROOM]) {\n const at = valveSpotWith(points, branch, skip, shared, body);\n if (at) return at;\n }\n return undefined;\n };\n /** 胴をほかの線から `body` 離す、`valveSpot` の 1 回の探し */\n const valveSpotWith = (\n points: Point[],\n branch: string,\n skip: ReadonlySet<string>,\n shared: boolean,\n body: number,\n ): { at: Point; under: boolean; vertical: boolean } | undefined => {\n const r = P.valve.r;\n const reach = P.valve.stem + P.valve.lever + VALVE_ROOM;\n const others = otherLines(branch, true, skip);\n for (const [a, b] of segs(points)) {\n const vertical = !flat(a, b);\n const len = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (len < r * 2 + SPACING) continue;\n const dx = Math.sign(b[0] - a[0]);\n const dy = Math.sign(b[1] - a[1]);\n // 弁の形が届く所の近くを通る線だけを測る\n const along = len + (P.valve.lever + VALVE_ROOM) * 2;\n const near: Rect = vertical\n ? { x: a[0] - reach, y: Math.min(a[1], b[1]) - P.valve.lever - VALVE_ROOM, w: reach * 2, h: along }\n : { x: Math.min(a[0], b[0]) - P.valve.lever - VALVE_ROOM, y: a[1] - reach, w: along, h: reach * 2 };\n /** `shared` の時は、この所で重なって走る同じ者の管の線分を測らない (弁が本管に載る) */\n const onHere = (u: Point, v: Point): boolean =>\n vertical\n ? !flat(u, v) && Math.abs(u[0] - a[0]) < 0.5 && Math.max(u[1], v[1]) > Math.min(a[1], b[1]) && Math.min(u[1], v[1]) < Math.max(a[1], b[1])\n : flat(u, v) && Math.abs(u[1] - a[1]) < 0.5 && Math.max(u[0], v[0]) > Math.min(a[0], b[0]) && Math.min(u[0], v[0]) < Math.max(a[0], b[0]);\n const lines = others\n .map((l) => (shared && l.sibling ? { ...l, points: [] as Point[], parts: segs(l.points).filter(([u, v]) => !onHere(u, v)) } : { ...l, parts: segs(l.points) }))\n .filter((l) => l.parts.some(([u, v]) => hits(u, v, near, l.half)));\n for (let t = r + SPACING / 2; t <= len - r - SPACING / 2; t += 4) {\n const p: Point = [a[0] + dx * t, a[1] + dy * t];\n if (!(vertical ? freeBox(p, P.valve.half, r) : freeBox(p, r, P.valve.half))) continue;\n for (const under of [false, true]) if (valveClear(p, vertical, under, lines, body)) return { at: p, under, vertical };\n }\n }\n return undefined;\n };\n /** 呼び出しの管の道を探す前に置く線。値の管と短い管と点線 */\n const callBase = (router: Router): Router => {\n for (const r of routes) if (r) router.lay(r.points, { owner: lineOwner(r.def), group: groupOfDef(r.def), kind: \"value\", width: P.bus.case });\n for (const s of stubs) router.lay(s.points, { owner: `s${s.token}`, group: `s${s.token}`, kind: \"stub\", width: P.bus.case });\n for (const t of ties) {\n const tie: Point[] = [\n [t.x, t.y1],\n [t.x, t.y2],\n ];\n router.lay(tie, { owner: `tie:${t.party}`, group: `tie:${t.party}`, kind: \"tie\", width: 2 });\n }\n return router;\n };\n /** 呼び出しの管を `list` の順に引く。道の無かった管を返す */\n const routeCalls = (list: readonly (typeof branches)[number][], fallback: boolean): { failed: string[]; bent: string[]; twice: string[]; cramped: string[] } => {\n callRouter = new Router(callXList, callYList, callObs);\n callPath = new Map();\n valves.clear();\n underValves.clear();\n uprightValves.clear();\n valveShapes.length = 0;\n onCall.length = 0;\n /** ほかの線から離れた所が無く、弁を置けなかった呼び出し */\n const crampedCalls: string[] = [];\n callBase(callRouter);\n const failedCalls: string[] = [];\n const bentCalls: string[] = [];\n /** 1 本の値の管を 2 度越えた呼び出し */\n const twiceCalls: string[] = [];\n const lanes = new Map<string, number>();\n /** 名札の横の、入る管が使った所 (`id|向き|高さ`) と、出る管が使った所。入る管と出る管は同じ所を使わない */\n const entered = new Set<string>();\n const left = new Set<string>();\n const sideKey = (id: string, side: 0 | 2, y: number): string => `${id}|${side}|${Math.round(y)}`;\n const sideUsed = (set: ReadonlySet<string>, id: string, side: 0 | 2): boolean => [...set].some((k) => k.startsWith(`${id}|${side}|`));\n /** 出る管の高さ。同じ者の管は同じ高さを共に使ってよいが、入る管が使った高さは避ける */\n /** 出る管の高さの候補。入る管が使った高さを除き、まだ使っていない高さ、呼ぶ相手の高さに近い方の順 */\n const startYs = (id: string, side: 0 | 2, toward: number): number[] => {\n const base = cyOf(id);\n const used = (y: number): number => Number(left.has(sideKey(id, side, y)));\n // 入る管が使った横からは出ない。同じ横に出入りが並ぶと、入る管の計器を置く所が無くなる\n if (sideUsed(entered, id, side)) return [];\n const ys = [...new Set([0, 1, 2].map((k) => base + laneOff(id, k)))];\n // 使った高さの隣の高さは後にする。隣どうしの管に載せた弁は、胴が隣の管の縁に触れる (#3523)\n const taken = ys.filter((y) => used(y) === 1);\n const beside = (y: number): number => Number(used(y) === 0 && taken.some((u) => Math.abs(u - y) < topSlot * 2 - 0.5));\n return ys.sort((a, b) => used(a) - used(b) || beside(a) - beside(b) || Math.abs(a - toward) - Math.abs(b - toward));\n };\n /** 呼び出しが入った所 (`id|向き|高さ`)。引き直す管は、自分が入った所を外して入る口を選び直す */\n const entryOf = new Map<string, string>();\n /** 呼び出し `c` の道を探す問いと、探した道を名札の縁から呼ばれた側の縁までの線に仕上げる処理 */\n const planOf = (c: (typeof branches)[number]) => {\n const a = rectOf(c.from);\n const b = rectOf(c.to);\n const toward = b.x + b.w / 2 >= a.x + a.w / 2 ? 0 : 2;\n const ysR = startYs(c.from, 0, cyOf(c.to));\n const ysL = startYs(c.from, 2, cyOf(c.to));\n // 始まりの点では、そのまま進むほかに上か下へ折れてよい。縁から始まりの点までの横の線が弁を載せる所になる\n const startsAt = (at: Point, dir: 0 | 2, cost: number): End[] => [\n { at, dir, cost },\n { at, dir: 1, cost: cost + 50 },\n { at, dir: 3, cost: cost + 50 },\n ];\n const starts: End[] = [\n ...ysR.flatMap((y, i) => startsAt([a.x + a.w + runOf(c.from, c.to, 0, lanes.get(`${c.from}|0`) ?? 0), y], 0, (toward === 0 ? 0 : 80) + i * 30)),\n ...ysL.flatMap((y, i) => startsAt([a.x - runOf(c.from, c.to, 2, lanes.get(`${c.from}|2`) ?? 0), y], 2, (toward === 2 ? 0 : 80) + i * 30)),\n ];\n const bx = b.x + b.w / 2;\n const by = cyOf(c.to);\n const entries: (End & { edge: Point })[] = [\n ...topsOf(c.to).map((x, i): End & { edge: Point } => ({ at: [x, b.y - APPROACH], dir: 1, cost: Math.ceil(i / 2) * 8, edge: [x, b.y] })),\n ...(entered.has(sideKey(c.to, 2, by)) || sideUsed(left, c.to, 2) ? [] : [{ at: [b.x - APPROACH, by] as Point, dir: 0 as Dir, cost: 20, edge: [b.x, by] as Point }]),\n ...(entered.has(sideKey(c.to, 0, by)) || sideUsed(left, c.to, 0) ? [] : [{ at: [b.x + b.w + APPROACH, by] as Point, dir: 2 as Dir, cost: 20, edge: [b.x + b.w, by] as Point }]),\n // 下から入る口は、囲いへ下りる点線と重なるため、囲いを持つ者には置かない\n ...(isBox(c.to) || holding.has(c.to) ? [] : [{ at: [bx, b.y + b.h + APPROACH] as Point, dir: 3 as Dir, cost: 60, edge: [bx, b.y + b.h] as Point }]),\n // トークンの箱の下の真ん中は管の弁へ下りる軸が在る。幅の広い箱は、軸と弁から離れた下の口を持つ\n ...(isBox(c.to)\n ? topsOf(c.to)\n .filter((x) => Math.abs(x - bx) >= P.valve.r + P.call.case / 2 + LINE_GAP)\n .map((x, i): End & { edge: Point } => ({ at: [x, b.y + b.h + APPROACH], dir: 3, cost: 60 + i * 8, edge: [x, b.y + b.h] }))\n : []),\n ];\n // 呼ばれた側がさらに呼ぶ時は、その相手の方の横を自分の出る管に残すため、その横から入りにくくする\n const facing = (side: 0 | 2): boolean =>\n branches.some((x) => {\n if (x.from !== c.to) return false;\n const t = rectOf(x.to);\n return (t.x + t.w / 2 >= b.x + b.w / 2 ? 0 : 2) === side;\n });\n // 左から入る (向き 0) のは左の横、右から入る (向き 2) のは右の横\n const ends: End[] = entries.map(({ at, dir, cost }) => ({ at, dir, cost: (dir === 0 && facing(2)) || (dir === 2 && facing(0)) ? (cost ?? 0) + 300 : cost }));\n // 呼ばれた側へは縁の手前の点で向きを揃えて入るため、呼ばれた側の縁は通さない。縁に沿って走る線を作らない。\n // 呼ぶ側の名札の縁は、名札の際から出る 2 度目の試しだけ通す。1 度目から通すと、名札の下を回って自分の点線をまたぐ\n const allow = new Set<number>();\n const ask = {\n owner: `c:${c.from}>${c.to}`,\n group: `c:${c.from}`,\n kind: \"call\" as const,\n width: P.call.case,\n starts,\n ends,\n allow,\n cross: (l: Laid): number | undefined => (l.kind === \"value\" || l.kind === \"stub\" ? 300 : l.kind === \"call\" ? 400 : undefined),\n gap: LINE_GAP,\n bend: 50,\n };\n // 名札の縁から始まりの点までの線は道を探さずに引くため、点線や線をまたがないかを先に確かめる\n const ownAsk = { ...ask, allow: new Set([...allow, ...(callOwn.get(c.from) ?? [])]) };\n const edgeOf = (st: End): Point => [st.at[0] > a.x + a.w / 2 ? a.x + a.w : a.x, st.at[1]];\n ask.starts = starts.filter((st) => callRouter.passable(ownAsk, edgeOf(st), st.at));\n const callFinish = (path: Point[]): { points: Point[]; raw: Point[] } => {\n const head = path[0] as Point;\n const tail = path[path.length - 1] as Point;\n const into = entries.find((e) => Math.abs(e.at[0] - tail[0]) < 0.5 && Math.abs(e.at[1] - tail[1]) < 0.5);\n return { points: simplify([edgeOf({ at: head, dir: 0 }), ...path, ...(into ? [into.edge] : [])]), raw: path };\n };\n /** 探した道を、名札の縁から呼ばれた側の縁までの線にする。縁の際の短い段差は消す */\n const finish = (path: Point[]): { points: Point[]; entry: (End & { edge: Point }) | undefined } => {\n const first = path[0] as Point;\n const last = path[path.length - 1] as Point;\n const edge: Point = [first[0] > a.x + a.w / 2 ? a.x + a.w : a.x, first[1]];\n const entry = entries.find((e) => Math.abs(e.at[0] - last[0]) < 0.5 && Math.abs(e.at[1] - last[1]) < 0.5);\n // ずらした線が通れる時だけ消す。呼ばれた側の手前の点から縁までの線は、道を探さずに引く線なので通れるとする\n const approach = (u: Point, v: Point): boolean =>\n entry !== undefined && Math.abs(u[0] - entry.at[0]) < 0.5 && Math.abs(u[1] - entry.at[1]) < 0.5 && Math.abs(v[0] - entry.edge[0]) < 0.5 && Math.abs(v[1] - entry.edge[1]) < 0.5;\n return { points: unjog([edge, ...path, ...(entry ? [entry.edge] : [])], 16, (u, v) => approach(u, v) || callRouter.passable(ownAsk, u, v), callRouter), entry };\n };\n return { a, b, bx, toward, ysR, ysL, startsAt, starts, ask, ownAsk, edgeOf, callFinish, finish, allow };\n };\n /** 入った所を覚える。左から入る (向き 0) のは左の横、右から入る (向き 2) のは右の横 */\n const enter = (key: string, to: string, entry: (End & { edge: Point }) | undefined): void => {\n if (!entry || (entry.dir !== 0 && entry.dir !== 2)) return;\n const k = sideKey(to, entry.dir === 0 ? 2 : 0, entry.at[1]);\n entered.add(k);\n entryOf.set(key, k);\n };\n for (const c of list) {\n const key = `${c.from}>${c.to}`;\n const { a, b, bx, toward, ysR, ysL, startsAt, starts, ask, ownAsk, edgeOf, callFinish, finish, allow } = planOf(c);\n const ay0 = cyOf(c.from);\n let found = fewerBends(callRouter, ask, callFinish);\n // 弁を載せる長さの所で上か下へ折れられず、曲がりすぎた時は、別の長さで出る始まりも加えて探し直す。\n // 短い始まりは先の管と同じ所で折れて共に通り、弁は共に通らない所へ置く。折れが減った時だけ採る\n if (found && bendsOf(found.points) > MAX_BENDS) {\n const longer = (side: 0 | 2, ys: number[], x: (k: number) => number): End[] => {\n const now = lanes.get(`${c.from}|${side}`) ?? 0;\n return [0, 1, 2, 3].filter((k) => k !== now).flatMap((k) => ys.flatMap((y, i) => startsAt([x(k), y], side, (toward === side ? 0 : 80) + i * 30 + 60)));\n };\n const extra = [\n ...longer(0, ysR, (k) => a.x + a.w + runOf(c.from, c.to, 0, k)),\n ...longer(2, ysL, (k) => a.x - runOf(c.from, c.to, 2, k)),\n ].filter((st) => callRouter.passable(ownAsk, edgeOf(st), st.at));\n const again = extra.length > 0 ? fewerBends(callRouter, { ...ask, starts: [...ask.starts, ...extra] }, callFinish) : undefined;\n if (again && bendsOf(again.points) < bendsOf(found.points)) found = again;\n }\n // 1 本の値の管を 2 度越えた時は、その管の組を越える値を重くして探し直す。越える値は辺ごとに組で 1 度だけ数えるため、\n // 幹を何度も越える道が、1 本ずつ越える道より安く見えることがある。2 度越える管が減り、折れが上限を超えない時だけ採る\n if (found) {\n const twice = (points: readonly Point[]): Set<string> =>\n new Set(routes.flatMap((r) => (r && crossedTimes(points, r.points) > 1 ? [groupOfDef(r.def)] : [])));\n const heavy = twice(found.points);\n if (heavy.size > 0) {\n const again = fewerBends(callRouter, { ...ask, cross: (l: Laid) => (heavy.has(l.group) ? REVISIT : ask.cross(l)) }, callFinish);\n if (again && bendsOf(again.points) <= MAX_BENDS && twice(again.points).size < heavy.size) found = again;\n }\n }\n const path =\n found?.raw ??\n callRouter.route({ ...ask, allow: new Set([...allow, ...(callOwn.get(c.from) ?? [])]), starts: starts.filter((st) => st.dir === 0 || st.dir === 2).map((st) => ({ ...st, at: edgeOf(st) })) });\n if (!path) {\n failedCalls.push(key);\n if (!fallback) continue;\n callPath.set(key, [\n [a.x + a.w, ay0],\n [bx, ay0],\n [bx, b.y],\n ]);\n continue;\n }\n const first = path[0] as Point;\n const right = first[0] > a.x + a.w / 2;\n // 同じ横から出た管の数。次の管は高さが違っても弁 1 つ分長く出て、弁を横にずらす\n const laneKey = `${c.from}|${right ? 0 : 2}`;\n lanes.set(laneKey, (lanes.get(laneKey) ?? 0) + 1);\n left.add(sideKey(c.from, right ? 0 : 2, first[1]));\n const { points: simple, entry } = finish(path);\n enter(key, c.to, entry);\n callPath.set(key, simple);\n if (bendsOf(simple) > MAX_BENDS) bentCalls.push(key);\n if (routes.some((r) => r && crossedTimes(simple, r.points) > 1)) twiceCalls.push(key);\n callRouter.lay(simple, { owner: ask.owner, group: ask.group, kind: \"call\", width: P.call.case });\n }\n // 弁は、載せられる横の線が短い管から先に置く。長い管は後から空いた所を選べる\n const roomOn = (c: (typeof branches)[number]): number =>\n segs(callPath.get(`${c.from}>${c.to}`) ?? []).reduce((sum, [a, b]) => sum + (flat(a, b) ? Math.abs(b[0] - a[0]) : 0), 0);\n const waiting: (typeof branches)[number][] = [];\n for (const c of [...list].sort((a, b) => roomOn(a) - roomOn(b))) {\n const key = `${c.from}>${c.to}`;\n const points = callPath.get(key);\n if (!points || valves.has(key)) continue;\n const clear = valveSpot(points, key);\n if (clear) placeValve(key, clear.at, clear.under, clear.vertical);\n else waiting.push(c);\n }\n /** 値の管と点線と置いた呼び出しの管と弁で、道を探す道具を作り直す */\n const rebuild = (xs: readonly number[] = callXList, ys: readonly number[] = callYList): Router => {\n // 置いた弁の形は、管の縁が決まりの間を空けて通る障害にする。線として置くと、形の角の際を通る管を止められない\n const valveObs = [...valves].flatMap(([k, at]) =>\n valveRects(at[0], at[1], uprightValves.has(k), underValves.has(k)).map((rect): Obstacle => ({ rect, pad: cHalf + VALVE_ROOM })),\n );\n const router = callBase(new Router(xs, ys, [...callObs, ...valveObs]));\n for (const [k, points] of callPath) router.lay(points, { owner: `c:${k}`, group: `c:${k.split(\">\")[0]}`, kind: \"call\", width: P.call.case });\n return router;\n };\n /** 置いた弁を外す */\n const unplaceValve = (key: string): void => {\n valves.delete(key);\n underValves.delete(key);\n uprightValves.delete(key);\n valveShapes.length = 0;\n for (const [k, at] of valves) valveShapes.push(...valveRects(at[0], at[1], uprightValves.has(k), underValves.has(k)));\n for (let i = onCall.length - 1; i >= 0; i--) if (onCall[i]?.branch === key) onCall.splice(i, 1);\n };\n /**\n * 弁を置けない管 `c` のために、ほかの呼び出しの管を引き直す。ほかの呼び出しの管の線と弁を測らずに `c` の弁の置き場所を取り、\n * その場所を塞ぐ管 (2 本まで) を、取った弁を越えない道で引き直す。同じ者の管が同じ横に詰めて出る時や、\n * ほかの者の管が弁の真上を並んで走る時は、取っ手を塞いで弁を置けないため、先に引いた管を譲らせる。\n * 引き直した管が弁を置け、折れと長さが元の道を大きく超えず、1 本の値の管を 2 度越えない時だけ採り、採らない時は元に戻す\n */\n const yieldFor = (c: (typeof branches)[number], key: string, old: Point[]): boolean => {\n const rivals = new Set([...callPath.keys()].filter((k) => k !== key));\n if (rivals.size === 0) return false;\n const saved = {\n paths: new Map(callPath),\n valves: new Map(valves),\n under: new Set(underValves),\n upright: new Set(uprightValves),\n shapes: [...valveShapes],\n on: [...onCall],\n entered: new Set(entered),\n entryOf: new Map(entryOf),\n };\n const restore = (): false => {\n callPath = new Map(saved.paths);\n valves.clear();\n for (const [k, v] of saved.valves) valves.set(k, v);\n underValves.clear();\n for (const k of saved.under) underValves.add(k);\n uprightValves.clear();\n for (const k of saved.upright) uprightValves.add(k);\n valveShapes.splice(0, valveShapes.length, ...saved.shapes);\n onCall.splice(0, onCall.length, ...saved.on);\n entered.clear();\n for (const k of saved.entered) entered.add(k);\n entryOf.clear();\n for (const [k, v] of saved.entryOf) entryOf.set(k, v);\n callRouter = rebuild();\n return false;\n };\n for (const k of rivals) unplaceValve(k);\n const reserved = valveSpot(old, key, rivals);\n if (!reserved) return restore();\n const rects = valveRects(reserved.at[0], reserved.at[1], reserved.vertical, reserved.under);\n const blocking = [...rivals].filter((k) => {\n const v = saved.valves.get(k);\n const shape = v ? valveRects(v[0], v[1], saved.upright.has(k), saved.under.has(k)) : [];\n return (\n segs(callPath.get(k) as Point[]).some(([u, v2]) => rects.some((r) => hits(u, v2, r, cHalf + VALVE_ROOM))) ||\n shape.some((s) => rects.some((r) => !apart(s, r, VALVE_ROOM)))\n );\n });\n if (blocking.length === 0 || blocking.length > 2) return restore();\n // 塞がない管の弁は元の所に戻す\n for (const k of rivals)\n if (!blocking.includes(k)) {\n const v = saved.valves.get(k);\n if (v) placeValve(k, v, saved.under.has(k), saved.upright.has(k));\n }\n for (const k of blocking) {\n const e = entryOf.get(k);\n if (e) entered.delete(e);\n callPath.delete(k);\n }\n placeValve(key, reserved.at, reserved.under, reserved.vertical);\n // 取った弁の形の際を通る筋を格子に足す。格子の筋が弁の形から遠いと、譲る管は弁の手前で折れられず大きく回る\n const off = cHalf + LINE_GAP + 1;\n const xs = gridLines(rects.flatMap((r) => [r.x - off, r.x + r.w + off]), callXList, 4);\n const ys = gridLines(rects.flatMap((r) => [r.y - off, r.y + r.h + off]), callYList, 4);\n for (const k of blocking) {\n const bc = list.find((x) => `${x.from}>${x.to}` === k);\n const was = saved.paths.get(k);\n if (!bc || !was) return restore();\n // 譲る管は、自分の弁が載る長さだけ出て折れる短い始まりも使う。いつもの長さで出ると、取った弁の取っ手の上を通る\n const ra = rectOf(bc.from);\n const runs = [SHORT_RUN, (SHORT_RUN + startRun(bc.from, bc.to)) / 2];\n const startX = (side: 0 | 2, run: number): number => (side === 0 ? ra.x + ra.w + run : ra.x - run);\n callRouter = rebuild(gridLines([...xs, ...runs.flatMap((run) => [startX(0, run), startX(2, run)])], callXList, 4), ys);\n const plan = planOf(bc);\n const short = ([[0, plan.ysR], [2, plan.ysL]] as const).flatMap(([side, list2]) =>\n list2.flatMap((y, i) =>\n runs.flatMap((run) => {\n const at: Point = [startX(side, run), y];\n return callRouter.passable(plan.ownAsk, plan.edgeOf({ at, dir: side }), at) ? plan.startsAt(at, side, (plan.toward === side ? 0 : 80) + i * 30 + 40) : [];\n }),\n ),\n );\n const found = fewerBends(callRouter, { ...plan.ask, starts: [...plan.ask.starts, ...short] }, plan.callFinish);\n const redone = found ? plan.finish(found.raw) : undefined;\n if (\n !redone ||\n bendsOf(redone.points) > Math.min(MAX_BENDS, bendsOf(was) + 1) ||\n lengthOf(redone.points) > lengthOf(was) * DETOUR_RATE ||\n routes.some((r) => r && crossedTimes(redone.points, r.points) > 1)\n )\n return restore();\n callPath.set(k, redone.points);\n enter(k, bc.to, redone.entry);\n const at = valveSpot(redone.points, k);\n if (!at) return restore();\n placeValve(k, at.at, at.under, at.vertical);\n }\n callRouter = rebuild();\n return true;\n };\n // 弁を置けなかった管は、ほかの管と置いた弁をそのままにして、弁を置ける始まりの線を持つ始まりから引き直す。\n // 始まりの線は名札の縁から始まりの点までの横の線で、長く出る始まりも試す。引き直した道に弁を置け、\n // 折れが上限を超えず、1 本の値の管を 2 度越えず、元の道より大きく回らない時だけ採る。\n // 大きく回る道は、ほかの者の名札を囲んで計器の置き場所を塞ぎ、弁 1 つの空きより読みにくい\n for (const c of waiting) {\n const key = `${c.from}>${c.to}`;\n // 先の管の兄弟として引き直し、弁を置いた管は飛ばす\n if (valves.has(key)) continue;\n const old = callPath.get(key) as Point[];\n callPath.delete(key);\n callRouter = rebuild();\n callPath.set(key, old);\n const was = entryOf.get(key);\n if (was) entered.delete(was);\n const plan = planOf(c);\n const tries: End[] = [];\n for (const side of [0, 2] as const) {\n if (sideUsed(entered, c.from, side)) continue;\n const ys = [...new Set([0, 1, 2].map((k) => cyOf(c.from) + laneOff(c.from, k)))];\n for (const k of [0, 1, 2, 3])\n for (const y of ys) {\n const at: Point = [side === 0 ? plan.a.x + plan.a.w + runOf(c.from, c.to, 0, k) : plan.a.x - runOf(c.from, c.to, 2, k), y];\n const edge = plan.edgeOf({ at, dir: side });\n if (callRouter.passable(plan.ownAsk, edge, at) && valveSpot([edge, at], key)) tries.push(...plan.startsAt(at, side, (plan.toward === side ? 0 : 80) + k * 30));\n }\n }\n const found = tries.length > 0 ? fewerBends(callRouter, { ...plan.ask, starts: tries }, plan.callFinish) : undefined;\n const redone = found ? plan.finish(found.raw) : undefined;\n const fits =\n redone &&\n bendsOf(redone.points) <= Math.min(MAX_BENDS, bendsOf(old) + 1) &&\n lengthOf(redone.points) <= lengthOf(old) * DETOUR_RATE &&\n !routes.some((r) => r && crossedTimes(redone.points, r.points) > 1);\n const at = fits ? valveSpot(redone.points, key) : undefined;\n if (redone && at) {\n callPath.set(key, redone.points);\n enter(key, c.to, redone.entry);\n callRouter.lay(redone.points, { owner: plan.ask.owner, group: plan.ask.group, kind: \"call\", width: P.call.case });\n placeValve(key, at.at, at.under, at.vertical);\n continue;\n }\n if (was) entered.add(was);\n callRouter.lay(old, { owner: plan.ask.owner, group: plan.ask.group, kind: \"call\", width: P.call.case });\n yieldFor(c, key, old);\n }\n // 自分だけが通る所に離れた所の無い弁は、同じ者の管と重なって走る本管の上の、ほかの線と弁から離れた所に置く。\n // それも無い時は、ほかの弁と計器から決まりの間を空け、同じ者の管が共に通る所を避けて置く。決まりの表が違反に数える\n for (const c of waiting) {\n const key = `${c.from}>${c.to}`;\n const points = callPath.get(key);\n if (!points || valves.has(key)) continue;\n const onMain = valveSpot(points, key, new Set(), true);\n if (onMain) {\n placeValve(key, onMain.at, onMain.under, onMain.vertical);\n continue;\n }\n crampedCalls.push(key);\n const mine = [...callPath.entries()].filter(([k]) => k !== key && k.split(\">\")[0] === c.from && valves.has(k)).map(([, q]) => q);\n const at =\n spot(points, P.valve.r, P.call.valveAt, mine, key) ??\n spot(points, P.valve.r, P.call.valveAt, [], key) ??\n spot(points, P.valve.r, 0, [], key) ??\n along(points, Math.min(P.call.valveAt, lengthOf(points) / 2));\n placeValve(key, at, false);\n }\n return { failed: failedCalls, bent: bentCalls, twice: twiceCalls, cramped: crampedCalls };\n };\n // 道の無い呼び出しと曲がりすぎた呼び出しと 1 本の値の管を 2 度越えた呼び出しと弁を置けなかった呼び出しを前に出して、引く順を最大 4 通り試す。\n // 道の無い管が少なく、曲がりすぎた管が少なく、2 度越えた管が少なく、弁を置けなかった管が少ない順を採る\n {\n // 同じ者が呼ぶ管は、呼ばれた側が横に近い順に引く。ほかの者の管との順は変えない。\n // 先に引いた管が曲がる向きに近い高さを取り、後の管はその外の高さから出るので、同じ横から出る管が入れ子に曲がり、\n // 1 本の管を共に通らない (#3523)\n const reach = (c: (typeof branches)[number]): number => Math.abs(rectOf(c.to).x + rectOf(c.to).w / 2 - (rectOf(c.from).x + rectOf(c.from).w / 2));\n const callList = [...branches];\n const slotsOf = new Map<string, number[]>();\n branches.forEach((c, i) => slotsOf.set(c.from, [...(slotsOf.get(c.from) ?? []), i]));\n for (const slots of slotsOf.values()) {\n const nearer = slots.map((i) => branches[i] as (typeof branches)[number]).sort((a, b) => reach(a) - reach(b));\n slots.forEach((slot, k) => (callList[slot] = nearer[k] as (typeof branches)[number]));\n }\n const { best: bestCalls, ran: ranCalls } = tryOrders(\n callList,\n (l) => l.map((c) => `${c.from}>${c.to}`).join(\",\"),\n (l) => routeCalls(l, false),\n (got) => [got.failed.length, got.bent.length, got.twice.length, got.cramped.length],\n (l, got) => {\n const bad = [...new Set([...got.failed, ...got.bent, ...got.twice, ...got.cramped])];\n return bad.length === 0 ? undefined : [...l.filter((c) => bad.includes(`${c.from}>${c.to}`)), ...l.filter((c) => !bad.includes(`${c.from}>${c.to}`))];\n },\n );\n const callsFailed = bestCalls.got.failed.length;\n // 道が無いか、曲がりすぎたか、1 本の値の管を 2 度越えたか、弁を置けなかった管が残る時は、間を広げた組み方で組み直す\n if (bestCalls.score.reduce((s, v) => s + v, 0) > 0 && !plan.last) return undefined;\n if (bestCalls.list !== ranCalls || callsFailed > 0) routeCalls(bestCalls.list, callsFailed > 0);\n }\n\n // ---- 書き込む管\n\n const writes: PipeWrite[] = sim.writes\n .filter((w) => !foldSteps.has(w.step) && visible.has(w.from))\n .flatMap((w) => {\n const plate = isBox(w.to) ? undefined : plateRect(w.to, w.name);\n if (isBox(w.to)) {\n const box = rectOf(w.to);\n const i = (platesOf.get(w.to) ?? []).indexOf(w.name);\n if (i < 0) return [];\n const y = box.y + P.token.keyY + P.token.line * i - T.key.size;\n return [{ ...w, points: [[box.x + box.w / 2, y], [box.x + box.w / 2, y]] as Point[] }];\n }\n if (!plate) return [];\n const writer = rectOf(w.from);\n const px = plate.x + plate.w / 2;\n const turn = yOfBand(w.to) + (P.housing.top - IO_H) / 2 - 2;\n if (w.from === w.to) {\n const hs = housingOf.get(w.to) as PipeHousing;\n return [{ ...w, points: [[px, hs.y + P.housing.top - P.write.turn], [px, plate.y]] as Point[] }];\n }\n const wx = writer.x + writer.w / 2;\n const start = shapeOf(w.from) === \"round\" ? writer.y + writer.h / 2 + belowOf(w.from) : writer.y + writer.h;\n const straight: Point[] = [[wx, start], [wx, turn], [px, turn], [px, plate.y]];\n // 書き手の下から真っすぐ下りると名札を通る時は、名札と点線を避けて道を探す\n const blocked = [...partyRects.entries()].some(([id, r]) => id !== w.from && id !== w.to && segs(straight).some(([a, b]) => hits(a, b, r, 2)));\n if (!blocked) return [{ ...w, points: straight }];\n const cy = cyOf(w.from);\n // 横から出る時は、縁の手前で上か下へ折れてよい。書き込む管は細く、隣の点線の際を通れる\n const sides: End[] = [writer.x - APPROACH, writer.x + writer.w + APPROACH].flatMap((x): End[] =>\n ([x < wx ? 2 : 0, 1, 3] as Dir[]).map((dir) => ({ at: [x, cy] as Point, dir, cost: 20 })),\n );\n const path = callRouter.route({\n owner: `w:${w.from}>${w.to}.${w.name}`,\n group: `w:${w.from}>${w.to}.${w.name}`,\n kind: \"write\",\n width: 3,\n starts: [...(holding.has(w.from) ? [] : [{ at: [wx, writer.y + writer.h + APPROACH] as Point, dir: 1 as Dir, cost: 0 }]), ...sides],\n ends: [\n { at: [px, turn], dir: 0, cost: 0 },\n { at: [px, turn], dir: 2, cost: 0 },\n ],\n allow: new Set(callOwn.get(`h:${w.to}`) ?? []),\n cross: (l) => (l.kind === \"tie\" || l.kind === \"valve\" ? undefined : 40),\n gap: 4,\n bend: 40,\n });\n if (!path) return [{ ...w, points: straight }];\n const first = path[0] as Point;\n const edge: Point = Math.abs(first[0] - wx) < 0.5 ? [wx, start] : [first[0] < wx ? writer.x : writer.x + writer.w, cy];\n return [{ ...w, points: simplify([edge, ...path, [px, plate.y]]) }];\n });\n\n // ---- 呼び出しの管の弁と計器。管が横に走る所に、決まりの間を空けて置く\n\n const gaugeAt = new Map<string, { on: PipeGauge[\"on\"]; cx: number; cy: number; stem?: { y1: number; y2: number }; col?: { x: number; w: number } }>();\n for (const party of checkers) {\n const bay = bays.find((b) => b.gauges.some((g) => g.party === party));\n const g = bay?.gauges.find((x) => x.party === party);\n if (bay && g) {\n gaugeAt.set(party, { on: \"value\", cx: g.cx, cy: g.cy, stem: { y1: g.cy + P.gauge.r, y2: bay.y - P.gauge.stemGap }, col: g.col });\n continue;\n }\n const incoming = shown.find((c) => c.to === party);\n const points = incoming ? callPath.get(`${incoming.from}>${incoming.to}`) : undefined;\n if (points && !isBox(party)) {\n const valve = valves.get(`${incoming?.from}>${incoming?.to}`) as Point;\n const dist = (() => {\n let walked = 0;\n for (const [a, b] of segs(points)) {\n const len = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n if (Math.abs(valve[1] - a[1]) < 0.5 && flat(a, b) && valve[0] >= Math.min(a[0], b[0]) && valve[0] <= Math.max(a[0], b[0])) return walked + Math.abs(valve[0] - a[0]);\n if (Math.abs(valve[0] - a[0]) < 0.5 && !flat(a, b) && valve[1] >= Math.min(a[1], b[1]) && valve[1] <= Math.max(a[1], b[1])) return walked + Math.abs(valve[1] - a[1]);\n walked += len;\n }\n return 0;\n })();\n const branch = `${incoming?.from}>${incoming?.to}`;\n const at = spot(points, P.gauge.r, dist + P.valve.r + SPACING + P.gauge.r, [], branch) ?? spot(points, P.gauge.r, 0, [], branch);\n if (at) {\n gaugeAt.set(party, { on: \"call\", cx: at[0], cy: at[1] });\n onCall.push({ at, half: P.gauge.r, tall: P.gauge.r, branch });\n continue;\n }\n }\n // 管に載せられない時は名札の横に置く。線と重ならない向きを選ぶ\n const box = rectOf(party);\n const cy = box.y + box.h / 2;\n const r = P.gauge.r;\n const lines = otherLines(\"\", true);\n const right: Point = [box.x + box.w + P.gauge.lampGap + r, cy];\n const tries: Point[] = [\n right,\n [box.x - P.gauge.lampGap - r - P.gauge.lamp * 2, cy],\n [box.x + box.w / 2, box.y - P.gauge.lampGap - r],\n ];\n const at = tries.find(([x, y]) => !lines.some((l) => segs(l.points).some(([u, v]) => hits(u, v, { x: x - r, y: y - r, w: r * 2 + P.gauge.lampGap + P.gauge.lamp * 2, h: r * 2 }, l.half + 2)))) ?? right;\n gaugeAt.set(party, { on: \"party\", cx: at[0], cy: at[1] });\n }\n\n // ---- 部品\n\n const widthAll = width0;\n const height = height0;\n const parties: PipeParty[] = order\n .filter((id) => partyRects.has(id))\n .map((id) => {\n const r = rectOf(id);\n const shape = shapeOf(id);\n const box = diagram.boxes.find((b) => b.id === id);\n const label =\n shape === \"round\"\n ? textAt(nameOf(id), r.x + r.w / 2, cyOf(id) + P.avatar.nameY, T.party, \"middle\")\n : shape === \"token\"\n ? textAt(nameOf(id), r.x + r.w / 2, r.y + P.token.nameY, T.party, \"middle\")\n : textAt(nameOf(id), r.x + P.cabinet.name, cyOf(id) + T.party.size * 0.4, T.party);\n return {\n ...r,\n id,\n name: nameOf(id),\n role: roleOf(id),\n ...(box?.icon ? { icon: box.icon } : {}),\n shape,\n ...(shape === \"token\" ? {} : { row: bandOf(id) === 1 ? maxRow + 1 : rowOf(id) }),\n label,\n holder: holding.has(id),\n };\n });\n const involved = diagram.steps.map((step, s) => {\n const set = new Set(step.events.flatMap(partiesOf));\n for (const c of shown) if (c.close?.step === s) set.add(c.to);\n return set;\n });\n const columns: PipeColumn[] = [];\n const pills: PipePill[] = [];\n for (const s of stepList)\n for (const p of parties) {\n const hs = housingOf.get(p.id);\n const left = hs ? Math.min(hs.x, p.x) : p.x;\n const right = hs ? Math.max(hs.x + hs.w, p.x + p.w) : p.x + p.w;\n const bottom = hs ? hs.y + hs.h : p.y + p.h;\n columns.push({ party: p.id, step: s, x: left, y: p.y, w: right - left, h: bottom - p.y, folded: false });\n pills.push({ x: p.x, y: p.y, w: p.w, h: p.h, party: p.id, step: s, folded: false, active: snapOf(s).active === p.id, involved: (involved[s] as Set<string>).has(p.id) });\n }\n\n // 槽と水位。水位の物差しは、トークンごとに並べた槽の一番多い量で作る\n const scale = new Map(\n tokens.map((token) => {\n const amounts = holders.filter((h) => has(h, token)).flatMap((h) => historyOf(`b${keyOf(h, token)}`).map(amountNumber));\n return [token, Math.max(0, ...amounts)];\n }),\n );\n const room = P.tank.h - P.tank.pad * 2;\n const levelH = (token: string, amount: string | undefined): number => {\n const most = scale.get(token) ?? 0;\n const n = amountNumber(amount);\n if (!(n > 0) || most <= 0) return 0;\n return Math.min(room, Math.max(P.tank.least, (n / most) * room * P.tank.fill));\n };\n const liquid = (glass: Rect, token: string, amount: string | undefined): Rect => {\n const h = levelH(token, amount);\n return { x: glass.x + P.tank.pad, y: glass.y + glass.h - P.tank.pad - h, w: glass.w - P.tank.pad * 2, h };\n };\n const tanks: PipeTank[] = [];\n const glasses: PipeGlass[] = [];\n const levels: PipeLevel[] = [];\n for (const h of holders)\n for (const token of tanksOf.get(h) ?? []) {\n const glass = tankOf(h, token);\n const cx = glass.x + glass.w / 2;\n const tank: PipeTank = { ...glass, party: h, token, title: { ...textAt(token, cx, glass.y + P.tank.titleY, T.tankTitle, \"middle\"), x: cx - titleW(token) / 2, w: titleW(token) }, tone: toneOf(token) };\n tanks.push(tank);\n const key = `b${keyOf(h, token)}`;\n const numberBase = numberBaseOf(glass);\n for (const s of stepList) {\n glasses.push({ ...tank, step: s });\n const snap = snapOf(s);\n const amount = snap.balances.get(keyOf(h, token)) ?? \"0\";\n const state = snap.states.get(key) ?? \"none\";\n const old = snap.was.get(key);\n const changedAt = snap.changed.get(key);\n const prev = s > 0 ? snapOf(s - 1).balances.get(keyOf(h, token)) : undefined;\n const text = textAt(grouped(amount), cx, numberBase, amountStyle, \"middle\");\n let delta: PipeText | undefined;\n let tag: PipeText | undefined;\n if (!narrow && old !== undefined && state !== \"none\") {\n const diff = minus(amount, old);\n const sign = diff.startsWith(\"-\") ? \"−\" : \"+\";\n delta = textAt(joinWords(`${sign}${grouped(diff.replace(/^-/u, \"\"))}`, token), cx, numberBase + P.tank.deltaY, T.delta, \"middle\");\n tag = textAt(words.tags[state], cx, numberBase + P.tank.deltaY + P.tank.tagY, T.tag, \"middle\");\n }\n levels.push({\n ...liquid(glass, token, amount),\n party: h,\n token,\n step: s,\n amount,\n state,\n text,\n ...(delta ? { delta } : {}),\n ...(tag ? { tag } : {}),\n ...(old !== undefined && state !== \"none\" ? { base: liquid(glass, token, old) } : {}),\n ...(changedAt !== undefined ? { event: changedAt } : {}),\n ...(changedAt !== undefined && prev !== undefined && prev !== amount ? { from: liquid(glass, token, prev) } : {}),\n });\n }\n }\n\n // 値の管と、トークンの箱を載せる所と弁\n const valuePipes: PipeValuePipe[] = [];\n const pipeIndex = new Map<number, number>();\n for (const r of routes) {\n if (!r) continue;\n const d = defs[r.def] as Def;\n pipeIndex.set(r.def, valuePipes.length);\n valuePipes.push({ token: d.token, from: d.from, to: d.to, points: r.points, ports: r.ports, tone: toneOf(d.token), group: groupOfDef(r.def) });\n }\n const buses: PipeBus[] = tokens.map((token) => {\n const box = boxOf(token);\n const bay = box !== undefined ? bayOf.get(box) : undefined;\n if (bay) {\n const valve = token === ETH ? undefined : { party: bay.home.box, x: xOf.get(bay.home.box) ?? 0, y: bay.y };\n return { token, y: bay.y, x1: Math.min(bay.x1, bay.x2), x2: Math.max(bay.x1, bay.x2), ...(valve ? { valve } : {}) };\n }\n const pipe = valuePipes.find((p) => p.token === token);\n const seg = pipe ? segs(pipe.points).filter(([a, b]) => flat(a, b)).sort(([a, b], [c, d]) => Math.abs(d[0] - c[0]) - Math.abs(b[0] - a[0]))[0] : undefined;\n if (seg) return { token, y: seg[0][1], x1: Math.min(seg[0][0], seg[1][0]), x2: Math.max(seg[0][0], seg[1][0]) };\n const owner = holders.find((h) => has(h, token));\n const t = owner ? tankOf(owner, token) : { x: 0, y: 0, w: 0, h: 0 };\n return { token, y: t.y + (portSlots[0] as number), x1: t.x, x2: t.x + t.w };\n });\n const pipes: PipeBusAt[] = stepList.flatMap((s) => buses.map((b) => ({ ...b, step: s })));\n\n // 流れた分。段ごとに、暫定と取り消しの分と、その段で確定した分を描く。同じ管を同じ段に流れた分は管の中でずらす\n const shownAt = stepList.map((s) => {\n const snap = snapOf(s);\n return moving.filter((f) => {\n if (f.step > s) return false;\n const state = snap.states.get(`f${f.id}`);\n return state === \"provisional\" || state === \"rolled\" || (state === \"final\" && snap.changed.has(`f${f.id}`));\n });\n });\n const flows: PipeFlow[] = stepList.flatMap((s) => {\n const used = new Map<number, number>();\n return (shownAt[s] ?? []).flatMap((f): PipeFlow[] => {\n const k = defOf(f);\n const pipe = valuePipes[pipeIndex.get(k) ?? -1];\n if (!pipe) return [];\n const track = used.get(k) ?? 0;\n used.set(k, track + 1);\n const shift = track === 0 ? 0 : (track % 2 === 1 ? -1 : 1) * Math.ceil(track / 2) * P.flow.track;\n const forward = pipe.from === f.from;\n const base = forward ? pipe.points : [...pipe.points].reverse();\n const points = offsetPath(base, shift);\n const longest = segs(points).sort(([a, b], [c, d]) => Math.abs(d[0] - c[0]) + Math.abs(d[1] - c[1]) - (Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1])))[0] as [Point, Point];\n const [a, b] = longest;\n const vertical = !flat(a, b);\n const dir = (vertical ? Math.sign(b[1] - a[1]) : Math.sign(b[0] - a[0])) >= 0 ? 1 : -1;\n const snap = snapOf(s);\n const changedAt = snap.changed.get(`f${f.id}`);\n return [\n {\n id: f.id,\n step: s,\n token: f.token,\n from: f.from,\n to: f.to,\n amount: f.amount,\n state: snap.states.get(`f${f.id}`) ?? \"none\",\n points,\n arrow: { x: (a[0] + b[0]) / 2, y: (a[1] + b[1]) / 2, dir, vertical },\n tone: toneOf(f.token),\n fresh: f.step === s,\n ...(changedAt !== undefined ? { event: changedAt } : {}),\n },\n ];\n });\n });\n\n // 呼び出しの管\n const widthOf = (kind: PipeCallLane[\"kind\"]): number => (kind === \"static\" ? P.call.flow / 2 : P.call.flow);\n const calls: PipeCallLane[] = shown.map((c) => {\n const points = callPath.get(`${c.from}>${c.to}`) as Point[];\n return {\n index: c.index,\n step: c.step,\n event: c.event,\n from: c.from,\n to: c.to,\n depth: c.depth,\n y: cyOf(c.from),\n kind: c.kind,\n width: widthOf(c.kind),\n points,\n lit: points,\n ...(c.value !== undefined ? { value: c.value } : {}),\n ...(c.close ? { close: c.close } : {}),\n };\n });\n const mains: PipeMain[] = [...new Set(branches.map((c) => c.from))].map((from) => ({\n from,\n y: cyOf(from),\n points: [],\n branches: branches\n .filter((c) => c.from === from)\n .map((c) => {\n const v = valves.get(`${c.from}>${c.to}`) as Point;\n return { to: c.to, points: callPath.get(`${c.from}>${c.to}`) as Point[], valve: { x: v[0], y: v[1], vertical: uprightValves.has(`${c.from}>${c.to}`), under: underValves.has(`${c.from}>${c.to}`) } };\n }),\n }));\n const lanes: PipeLane[] = stepList.flatMap((s) =>\n shown\n .filter((c) => c.step <= s && (c.close === undefined || c.close.step >= s))\n .map((c) => ({\n call: c.index,\n step: s,\n from: c.from,\n to: c.to,\n kind: c.kind,\n width: widthOf(c.kind),\n points: callPath.get(`${c.from}>${c.to}`) as Point[],\n ...(c.step === s ? { opened: c.event } : {}),\n ...(c.close?.step === s ? { shut: c.close.event } : {}),\n })),\n );\n // 呼び出しの管が値の管の下をくぐる所\n const crossings: PipeCrossing[] = [];\n for (const c of calls)\n for (const [pi, pipe] of [...valuePipes.entries(), ...stubs.map((s, i): [number, { token: string; points: Point[] }] => [-1 - i, s])]) {\n if (pi < 0) continue;\n for (const [a, b] of segs(c.points))\n for (const [u, v] of segs(pipe.points)) {\n const callFlat = flat(a, b);\n if (callFlat === flat(u, v)) continue;\n const [h1, h2, v1, v2] = callFlat ? [a, b, u, v] : [u, v, a, b];\n const x = v1[0];\n const y = h1[1];\n const inH = x > Math.min(h1[0], h2[0]) + 1e-6 && x < Math.max(h1[0], h2[0]) - 1e-6;\n const inV = y > Math.min(v1[1], v2[1]) + 1e-6 && y < Math.max(v1[1], v2[1]) - 1e-6;\n if (inH && inV) crossings.push({ call: c.index, token: pipe.token, pipe: pi, x, y, vertical: !callFlat });\n }\n }\n\n // 計器。確かめる者ごとに 1 つ、最初に確かめた段から最後の段まで置き、針と通ったかの印を残す\n const gauges: PipeGauge[] = [];\n for (const party of checkers) {\n const own = sim.checks.filter((c) => c.party === party);\n const firstStep = Math.min(...own.map((c) => c.step));\n const place = gaugeAt.get(party);\n if (!place) continue;\n const r = P.gauge.r;\n let angle: number = P.gauge.unseen;\n for (let s = firstStep; s < steps; s++) {\n const doneHere = own.filter((c) => c.step <= s);\n const latest = doneHere[doneHere.length - 1] as CheckRec;\n const here = own.filter((c) => c.step === s);\n const from = angle;\n angle = latest.ok ? P.gauge.ok : P.gauge.fail;\n const { cx, cy } = place;\n gauges.push({\n x: cx - r,\n y: cy - r,\n w: r * 2,\n h: r * 2,\n party,\n step: s,\n event: (here[0] ?? latest).event,\n ok: latest.ok,\n on: place.on,\n cx,\n cy,\n r,\n fresh: here.length > 0 && !foldSteps.has(s),\n from,\n angle,\n lamp: { x: cx + r + P.gauge.lampGap, y: cy - r + 4, r: P.gauge.lamp },\n ...(place.stem ? { stem: place.stem } : {}),\n });\n }\n }\n\n // 変換器\n const converters: PipeConverter[] = [];\n for (const h of holders) {\n const rc = converterRect(h);\n const own = sim.calcs.filter((c) => c.party === h);\n const [first] = own;\n const [ta] = (innerOf.get(h) as Inner).tanks;\n if (!rc || !first || !ta) continue;\n const left = tankOf(h, ta.token).x + tankOf(h, ta.token).w;\n const right = left + (rc.x - left) * 2 + rc.w;\n for (const s of stepList) {\n const here = own.filter((c) => c.step === s && !foldSteps.has(s));\n const shownCalc = here[0] ?? [...own].reverse().find((c) => c.step <= s) ?? first;\n converters.push({\n ...rc,\n party: h,\n step: s,\n calc: shownCalc.step,\n ...(here[0] ? { event: here[0].event } : {}),\n in: shownCalc.input,\n out: shownCalc.output,\n rate: shownCalc.rate,\n active: here.length > 0,\n cx: rc.x + rc.w / 2,\n cy: rc.y + rc.h / 2,\n r: rc.w / 2,\n left,\n right,\n });\n }\n }\n\n // 値の札。トークンの箱の値は箱の中の名前の下に、ほかは持ち主の囲いの中に置く\n const plates: PipePlate[] = [];\n for (const party of order) {\n const boxed = isBox(party);\n (platesOf.get(party) ?? []).forEach((name, i) => {\n const key = `v${keyOf(party, name)}`;\n const spot0 = boxed ? undefined : plateRect(party, name);\n if (!boxed && !spot0) return;\n if (boxed && !partyRects.has(party)) return;\n const box = rectOf(party);\n for (const s of stepList) {\n const snap = snapOf(s);\n const value = snap.values.get(keyOf(party, name)) ?? \"\";\n const state = snap.states.get(key) ?? \"none\";\n const old = state === \"none\" ? undefined : snap.was.get(key);\n const changedAt = snap.changed.get(key);\n const at = changedAt !== undefined ? { event: changedAt } : {};\n if (boxed) {\n const cx = box.x + box.w / 2;\n const keyBase = box.y + P.token.keyY + P.token.line * i;\n const base = keyBase + P.token.valueY;\n const valueW = textWidth(value, T.keyValue);\n const total = old === undefined ? valueW : textWidth(old, T.keyValue) + P.token.arrowGap * 2 + arrowW + valueW;\n const start = cx - total / 2;\n const was = old === undefined ? undefined : textAt(old, start, base, T.keyValue);\n const arrow = was ? textAt(\"→\", was.x + was.w + P.token.arrowGap, base, T.keyValue) : undefined;\n const text = textAt(value, arrow ? arrow.x + arrow.w + P.token.arrowGap : start, base, T.keyValue);\n plates.push({\n x: box.x + P.token.plateX,\n y: keyBase - T.key.size,\n w: box.w - P.token.plateX * 2,\n h: P.token.valueY + T.key.size + T.keyValue.size * 0.3,\n party,\n name,\n step: s,\n value,\n state,\n boxed,\n label: textAt(name, cx, keyBase, T.key, \"middle\"),\n text,\n ...(was && arrow ? { was, arrow, strike: { x: was.x - 1, y: was.y + was.h * 0.55, w: was.w + 2, h: 1.5 } } : {}),\n ...at,\n });\n continue;\n }\n const p = spot0 as Rect;\n const cx = p.x + p.w / 2;\n let was: PipeText | undefined;\n let strike: Rect | undefined;\n let tag: PipeText | undefined;\n if (old !== undefined && state !== \"none\") {\n // 前の値と語は槽の数字と同じ行に置く。札のすぐ下は、槽の右の口から出る管が札の下を通る所\n const base = tankTop(party) + P.tank.h + P.tank.numberY;\n const ww = textWidth(old, T.sub);\n const total = ww + PART_GAP + textWidth(words.tags[state], T.tag);\n was = textAt(old, cx - total / 2, base, T.sub);\n strike = { x: was.x - 1, y: was.y + was.h * 0.55, w: was.w + 2, h: 1.5 };\n tag = textAt(words.tags[state], was.x + was.w + PART_GAP, base, T.tag);\n }\n plates.push({\n ...p,\n party,\n name,\n step: s,\n value,\n state,\n boxed,\n // 名前は字の間を含む幅の真ん中を札の真ん中に置く (#3526)\n label: { ...textAt(name, cx, p.y + P.plate.nameY, T.tankTitle), x: cx - titleW(name) / 2, w: titleW(name) },\n text: textAt(value, cx, p.y + p.h / 2 + P.plate.valueY, T.plateValue, \"middle\"),\n ...(was && strike && tag ? { was, strike, tag } : {}),\n ...at,\n });\n }\n });\n }\n\n // ---- 図の中の札\n\n /** 札を置かない所。部品と、置いた線と、同じ段に置いた札 */\n const fixed: Rect[] = [\n ...parties.map((p) => labelOf(p.id)),\n ...tanks,\n ...holders.flatMap((h) => (tanksOf.get(h) ?? []).flatMap((t) => textRows(h, t))),\n ...holders.flatMap((h) => (platesOf.get(h) ?? []).flatMap((n) => (plateRect(h, n) ? [grow(plateRect(h, n) as Rect, 0)] : []))),\n ...holders.flatMap((h) => (converterRect(h) ? [converterRect(h) as Rect] : [])),\n // 値の札の前の値と語は、札の下の槽の数字と同じ行に在る\n ...plates.flatMap((pl) => [pl.was, pl.tag].filter((t): t is PipeText => t !== undefined)),\n ...[...gaugeAt.values()].flatMap((g) => [\n { x: g.cx - P.gauge.r, y: g.cy - P.gauge.r, w: P.gauge.r * 2, h: P.gauge.r * 2 },\n { x: g.cx + P.gauge.r + P.gauge.lampGap - P.gauge.lamp, y: g.cy - P.gauge.r + 4 - P.gauge.lamp, w: P.gauge.lamp * 2, h: P.gauge.lamp * 2 },\n ]),\n ...[...valves.values()].map(([x, y]) => ({ x: x - P.valve.r, y: y - P.valve.stem - P.valve.lever, w: P.valve.r * 2 + P.valve.lever, h: P.valve.stem + P.valve.lever + P.valve.half })),\n ];\n const lines: { points: Point[]; half: number }[] = [\n ...valuePipes.map((p) => ({ points: p.points, half: vHalf })),\n ...stubs.map((p) => ({ points: p.points, half: vHalf })),\n ...[...callPath.values()].map((p) => ({ points: p, half: cHalf })),\n ...ties.map((t) => ({ points: [[t.x, t.y1], [t.x, t.y2]] as Point[], half: 1 })),\n ...writes.map((w) => ({ points: w.points, half: 1.5 })),\n ...bays.map((b) => {\n const box = rectOf(b.home.box);\n return { points: [[box.x + box.w / 2, box.y + box.h], [box.x + box.w / 2, b.y]] as Point[], half: 2 };\n }),\n ];\n const inFigure = (r: Rect): boolean => r.x >= P.margin && r.y >= P.margin && r.x + r.w <= widthAll - P.margin && r.y + r.h <= height - P.margin;\n const clearOf = (r: Rect, placed: readonly Rect[]): boolean =>\n inFigure(r) &&\n fixed.every((o) => apart(r, o, PART_GAP)) &&\n placed.every((o) => apart(r, o, PART_GAP)) &&\n lines.every((l) => segs(l.points).every(([a, b]) => !hits(a, b, r, l.half + 4))) &&\n housings.every((hs) => apart(r, hs, PART_GAP) || (r.x >= hs.x && r.x + r.w <= hs.x + hs.w && r.y >= hs.y && r.y + r.h <= hs.y + hs.h));\n const firstClear = (tries: readonly Rect[], placed: readonly Rect[]): Rect => tries.find((r) => clearOf(r, placed)) ?? (tries[0] as Rect);\n /** `near` の周りに w × h の札を置く候補。近い順。先に挙げた候補で空きが無い時に使う */\n const around = (near: Rect, w: number, h: number): Rect[] => {\n const cx = near.x + near.w / 2;\n const cy = near.y + near.h / 2;\n const out: Rect[] = [];\n const stepX = 12;\n const stepY = h + 4;\n for (let i = -8; i <= 8; i++)\n for (let j = -6; j <= 6; j++) {\n const x = cx - w / 2 + i * (near.w / 2 + w / 2 + stepX) / 2 + Math.sign(i) * stepX * Math.max(0, Math.abs(i) - 2);\n const y = cy - h / 2 + j * stepY;\n out.push({ x, y, w, h });\n }\n return out.sort((a, b) => Math.hypot(a.x + w / 2 - cx, (a.y + h / 2 - cy) * 1.5) - Math.hypot(b.x + w / 2 - cx, (b.y + h / 2 - cy) * 1.5));\n };\n const chipOf = (kind: PipeChip[\"kind\"], text: string, r: Rect, step: number, extra: Partial<PipeChip> = {}, big = false): PipeChip => {\n const style = kind === \"io\" ? T.io : big ? bigStyle : chipStyle;\n return {\n ...r,\n kind,\n text,\n size: style.size,\n rx: P.chip.rx,\n label: textAt(text, r.x + r.w / 2, middleBase(r.y, r.h, style), style, \"middle\"),\n step,\n ...extra,\n };\n };\n const chips: PipeChip[] = [];\n const placedAt = stepList.map((): Rect[] => []);\n /** 狭い枠の、図の下の帯に出す札。置き場所は図の大きさを決めた後に決める */\n const banded: { kind: \"amount\" | \"formula\"; text: string; step: number; extra: Partial<PipeChip> }[] = [];\n\n // 入力と出力の印。始めた人が払った槽と受け取った槽の、囲いの上の余白に置く\n if (sender !== undefined)\n for (const { token, text, r } of ioMarks()) {\n for (const s of stepList) {\n chips.push(chipOf(\"io\", text, r, s, { party: sender, token }));\n placedAt[s]?.push(r);\n }\n }\n\n // 計器の式。値の管の計器は確かめた段から後も残し、呼び出しの管の計器は確かめた段だけ出す。狭い枠は確かめた段だけ\n for (const party of checkers) {\n const g = gaugeAt.get(party);\n if (!g) continue;\n const own = sim.checks.filter((c) => c.party === party);\n for (const s of stepList) {\n const here = own.filter((c) => c.step === s);\n const latest = [...own].reverse().find((c) => c.step <= s);\n const c = here[here.length - 1] ?? (g.on === \"value\" && !narrow ? latest : undefined);\n if (!c) continue;\n const text = formulaOf(c);\n if (narrow) {\n banded.push({ kind: \"formula\", text, step: s, extra: { party, ok: c.ok } });\n continue;\n }\n const w = chipW(text);\n const r = P.gauge.r;\n const tries: Rect[] = [\n ...(g.col ? [{ x: g.col.x + (g.col.w - w) / 2, y: g.cy - r - P.chip.off - chipH, w, h: chipH }] : []),\n { x: g.cx - w / 2, y: g.cy - r - P.chip.off - chipH, w, h: chipH },\n { x: g.cx - w / 2, y: g.cy + r + P.chip.off, w, h: chipH },\n { x: g.cx + r + P.gauge.lampGap + P.gauge.lamp * 2 + P.chip.off, y: g.cy - r - chipH, w, h: chipH },\n { x: g.cx - r - P.chip.off - w, y: g.cy - r - chipH, w, h: chipH },\n ...around({ x: g.cx - r, y: g.cy - r, w: r * 2, h: r * 2 }, w, chipH),\n ];\n const at = firstClear(tries, placedAt[s] ?? []);\n chips.push(chipOf(\"formula\", text, at, s, { party, ok: c.ok }));\n placedAt[s]?.push(at);\n }\n }\n\n // 流れた量。値の管の近くに、単位つきで置く。狭い枠はその段で流れた分だけ。\n // 広い枠は済んだ段の分も残すが、その段で流れた分を先に置き、管の際の空きを先に取らせる\n for (const s of stepList)\n for (const f of flows.filter((x) => x.step === s && (!narrow || x.fresh)).sort((a, b) => Number(b.fresh) - Number(a.fresh))) {\n const pipe = valuePipes[pipeIndex.get(defOf(moving.find((m) => m.id === f.id) as FlowRec)) ?? -1];\n if (!pipe) continue;\n const text = joinWords(grouped(f.amount), f.token);\n if (narrow) {\n banded.push({ kind: \"amount\", text, step: s, extra: { token: f.token, state: f.state, tone: f.tone, ...(f.event !== undefined ? { event: f.event } : {}) } });\n continue;\n }\n const w = chipW(text);\n const off = vHalf + P.chip.off;\n const tries: Rect[] = [];\n const ordered = segs(pipe.points).sort(([a, b], [c, d]) => Number(!flat(a, b)) - Number(!flat(c, d)) || Math.abs(d[0] - c[0]) + Math.abs(d[1] - c[1]) - (Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1])));\n /** 線分 a-b の割合 k の所から、管の真ん中から d 離した両脇の札の四角。横の管は下と上、縦の管は右と左の順 */\n const beside = (a: Point, b: Point, k: number, d: number): Rect[] => {\n const x = a[0] + (b[0] - a[0]) * k;\n const y = a[1] + (b[1] - a[1]) * k;\n return flat(a, b)\n ? [{ x: x - w / 2, y: y + d, w, h: chipH }, { x: x - w / 2, y: y - d - chipH, w, h: chipH }]\n : [{ x: x + d, y: y - chipH / 2, w, h: chipH }, { x: x - d - w, y: y - chipH / 2, w, h: chipH }];\n };\n for (const [a, b] of ordered) for (const k of AMOUNT_AT) tries.push(...beside(a, b, k, off));\n // 決めた割合の所が全て塞がる時は、管の際のまま線分に沿って細かくずらし、真ん中に近い所から試す (#3528)。\n // 束の外側まで離すと、札と管の間にほかの管や部品が入り、どの流れの量か読み手が取り違える\n for (const [a, b] of ordered) {\n const length = Math.abs(b[0] - a[0]) + Math.abs(b[1] - a[1]);\n const shifts = Array.from({ length: Math.floor(length / P.chip.slide) + 1 }, (_, i) => i * P.chip.slide).sort((p, q) => Math.abs(p - length / 2) - Math.abs(q - length / 2));\n for (const t of shifts) tries.push(...beside(a, b, t / length, off));\n }\n // 管の際が束ねた管で塞がる時は、束の外側まで離した所を試す\n for (const [a, b] of ordered) for (const far of [1, 2, 3, 4, 5]) for (const k of AMOUNT_AT) tries.push(...beside(a, b, k, off + far * (chipH + PART_GAP)));\n // それでも空きが無い時は、一番長い線分の真ん中の近くの空きに置く\n const [la, lb] = ordered[0] ?? [];\n if (la && lb) tries.push(...around({ x: (la[0] + lb[0]) / 2, y: (la[1] + lb[1]) / 2, w: 0, h: 0 }, w, chipH));\n const at = firstClear(tries, placedAt[s] ?? []);\n chips.push(chipOf(\"amount\", text, at, s, { token: f.token, flow: f.id, state: f.state, tone: f.tone, ...(f.event !== undefined ? { event: f.event } : {}) }));\n placedAt[s]?.push(at);\n }\n\n // イベントの札。出した者の箱の横に置く。同じ者が同じ名前のイベントを 2 つ以上出した段は 1 つにまとめる\n const events: PipeEventChip[] = [];\n if (!narrow)\n for (const s of stepList) {\n const snap = snapOf(s);\n const groups = new Map<string, EmitRec[]>();\n for (const id of snap.emitted) {\n const e = sim.emits[id] as EmitRec;\n if (!partyRects.has(e.party)) continue;\n const k = `${e.party}|${e.name}`;\n groups.set(k, [...(groups.get(k) ?? []), e]);\n }\n const besideCount = new Map<string, number>();\n for (const list of groups.values()) {\n const e = list[list.length - 1] as EmitRec;\n const merged = list.length > 1;\n const text = merged ? `${chipTextOf(e)} ×${list.length}` : chipTextOf(e);\n const args = !merged && e.step === s ? argsOf(e) : undefined;\n const w = chipW(text) + (args ? P.chip.argsGap + textWidth(args, T.args) : 0);\n const emitter = rectOf(e.party);\n const n = besideCount.get(e.party) ?? 0;\n besideCount.set(e.party, n + 1);\n const cx = emitter.x + emitter.w / 2;\n const below = isBox(e.party) ? emitter.y + emitter.h + PART_GAP + n * (chipH + 4) : emitter.y + emitter.h + PART_GAP;\n const mid = emitter.y + emitter.h / 2 - chipH / 2 + n * (chipH + 4);\n const tries: Rect[] = [\n ...(isBox(e.party) ? [{ x: cx + 6, y: below, w, h: chipH }, { x: cx - 6 - w, y: below, w, h: chipH }] : []),\n { x: emitter.x + emitter.w + P.chip.beside, y: mid, w, h: chipH },\n { x: emitter.x - P.chip.beside - w, y: mid, w, h: chipH },\n { x: cx + 6, y: emitter.y + emitter.h + PART_GAP + n * (chipH + 4), w, h: chipH },\n { x: cx - 6 - w, y: emitter.y + emitter.h + PART_GAP + n * (chipH + 4), w, h: chipH },\n ...around(emitter, w, chipH),\n ];\n const at = firstClear(tries, placedAt[s] ?? []);\n placedAt[s]?.push(at);\n const textR = textAt(text, at.x + P.chip.padX, middleBase(at.y, at.h, chipStyle), chipStyle);\n const changedAt = list.map((x) => snap.changed.get(`e${x.id}`)).find((x) => x !== undefined);\n const state = list.map((x) => snap.states.get(`e${x.id}`) ?? \"none\").reduce((a, b) => (a === \"provisional\" || b === \"provisional\" ? \"provisional\" : b));\n events.push({\n id: e.id,\n ...at,\n party: e.party,\n name: e.name,\n step: s,\n emitted: e.step,\n state,\n text: textR,\n ...(args ? { args: textAt(args, textR.x + textR.w + P.chip.argsGap, middleBase(at.y, at.h, T.args), T.args) } : {}),\n ...(changedAt !== undefined ? { event: changedAt } : {}),\n });\n chips.push(chipOf(\"event\", text, at, s, { party: e.party, state, ...(changedAt !== undefined ? { event: changedAt } : {}) }));\n }\n }\n const rings: PipeRing[] = sim.emits.filter((e) => !foldSteps.has(e.step) && visible.has(e.party)).map((e) => ({ party: e.party, step: e.step, event: e.event }));\n\n // 戻り値の札。呼ばれた側から呼び出しの管を伝って呼んだ側へ戻る\n /** 戻り値の札が着く所で避ける弁の形。呼び出しの管の弁とトークンの箱の弁の、胴と軸と閉じた取っ手と開いた取っ手 */\n const valveBlocks: Rect[] = [\n ...[...valves].flatMap(([k, [x, y]]) => valveRects(x, y, uprightValves.has(k), underValves.has(k))),\n ...buses.flatMap((b) => (b.valve ? valveRects(b.valve.x, b.valve.y, false, false) : [])),\n ];\n /** 段 `s` に戻り値の札が着く所で避ける部品。箱と名前の字、弁、その段の計器 (盤と通ったかの印と軸)、その段に置いた札 */\n const blocks = (s: number): Rect[] => [\n ...parties.map((p) => labelOf(p.id)),\n ...valveBlocks,\n ...gauges\n .filter((g) => g.step === s)\n .flatMap((g) => [\n { x: g.x, y: g.y, w: g.w, h: g.h },\n { x: g.lamp.x - g.lamp.r, y: g.lamp.y - g.lamp.r, w: g.lamp.r * 2, h: g.lamp.r * 2 },\n ...(g.stem ? [{ x: g.cx - 2, y: g.stem.y1, w: 4, h: g.stem.y2 - g.stem.y1 }] : []),\n ]),\n ...(placedAt[s] ?? []),\n ];\n if (!narrow)\n for (const ret of sim.returns) {\n const c = sim.calls[ret.call];\n if (!c || foldSteps.has(ret.step) || !ret.value) continue;\n const points = callPath.get(`${c.from}>${c.to}`);\n if (!points) continue;\n const back = [...points].reverse();\n const w = chipW(ret.value);\n // 呼ばれた側の名前の字に札がかからない所まで管に沿って進み、そこから動き出す。横から入る管では、縁の真ん中が名前の字の隣に在る\n const name = parties.find((p) => p.id === c.to)?.label;\n const rectAt = ([x, y]: Point): Rect => ({ x: x - w / 2, y: y - chipH / 2, w, h: chipH });\n let d = 0;\n while (name && d < lengthOf(back) / 2 && !apart(rectAt(along(back, d)), name, PART_GAP / 2)) d += 2;\n const started = d > 0 ? fromAlong(back, d) : back;\n // 着く所は、呼んだ側から管を遡り、箱と弁と計器とその段に置いた札のどれからも離れた最初の所にする (#3523)。\n // 呼んだ側の名札の手前には呼び出しの弁と計器が並ぶため、名札の手前で止めた札はそれらを隠していた\n const whole = lengthOf(started);\n const avoid = blocks(ret.step);\n /** 呼んだ側から遡り、どの部品からも `gap` 離れた最初の所までの長さ。無い時は `whole` */\n const backTo = (gap: number): number => {\n let at = 0;\n while (at < whole && !avoid.every((o) => apart(rectAt(along(started, whole - at)), o, gap))) at += 2;\n return at;\n };\n // 離れた所が無い短い管では、部品の縁に触れても重ならない所にする\n let e = backTo(PART_GAP / 2);\n if (e >= whole) e = backTo(0);\n // どこにも空きが無い時は、今までどおり呼んだ側の名札に札が載らない手前で止める。崩れの確かめが札と部品の重なりを知らせる\n if (e >= whole) {\n // 次の組みで、この管の2人の間を札の幅だけ広げる\n cramped.set(\n `${c.from}>${c.to}`,\n Math.max(cramped.get(`${c.from}>${c.to}`) ?? 0, w + PART_GAP),\n );\n const caller = labelOf(c.from);\n e = 0;\n while (e < whole / 2 && !apart(rectAt(along(started, whole - e)), caller, 2)) e += 2;\n }\n const path = e > 0 ? fromAlong([...started].reverse(), e).reverse() : started;\n chips.push(chipOf(\"return\", ret.value, rectAt(path[0] as Point), ret.step, { party: c.to, path, call: c.index, event: ret.event }));\n }\n\n // 畳んだ箱。呼ばれた者の下の空いた所に置く\n const foldBoxes: PipeFoldBox[] = folds.flatMap((fold) => {\n const call = sim.calls[fold.call];\n const party = call?.to ?? \"\";\n if (!partyRects.has(party)) return [];\n const count = fold.to - fold.from + 1;\n const text = words.fold(count, fold.hidden.length);\n const w = P.card.padX * 2 + P.card.icon + P.card.gap + Math.max(textWidth(words.open, T.cardTitle), textWidth(text, T.fold));\n const owner = rectOf(party);\n const cx = owner.x + owner.w / 2;\n const tries: Rect[] = [\n { x: owner.x + owner.w + P.card.top, y: owner.y + owner.h / 2 - P.card.h / 2, w, h: P.card.h },\n { x: cx - w / 2, y: owner.y + owner.h + P.card.top, w, h: P.card.h },\n { x: owner.x - P.card.top - w, y: owner.y + owner.h / 2 - P.card.h / 2, w, h: P.card.h },\n { x: cx - w / 2, y: owner.y - P.card.top - P.card.h, w, h: P.card.h },\n ];\n const at = firstClear(tries, placedAt[fold.step] ?? []);\n placedAt[fold.step]?.push(at);\n const left = at.x + P.card.padX + P.card.icon + P.card.gap;\n const title = textAt(words.open, left, at.y + P.card.titleY, T.cardTitle);\n const value = textAt(text, left, at.y + P.card.valueY, T.fold);\n return [{ ...at, party, step: fold.step, call: fold.call, steps: count, parties: fold.hidden.length, title, value, text: value }];\n });\n\n // 段ごとに関わる関係者を囲む所\n const focus = stepList.flatMap((s) => {\n const ids = [...new Set((diagram.steps[s] as Step).events.flatMap(partiesOf))].filter((id) => partyRects.has(id));\n if (ids.length === 0) return [];\n const rects = ids.map(rectOf);\n const left = Math.min(...rects.map((r) => r.x));\n const top = Math.min(...rects.map((r) => r.y));\n return [{ step: s, x: left, y: top, w: Math.max(...rects.map((r) => r.x + r.w)) - left, h: Math.max(...rects.map((r) => r.y + r.h)) - top }];\n });\n\n // 図の大きさは、置いた札と引いた管まで含める\n const all = [...chips.filter((c) => c.kind !== \"return\"), ...foldBoxes, ...gauges];\n const drawn: { points: Point[]; half: number }[] = [\n ...valuePipes.map((p) => ({ points: p.points, half: vHalf })),\n ...stubs.map((p) => ({ points: p.points, half: vHalf })),\n ...[...callPath.values()].map((points) => ({ points, half: cHalf })),\n ...writes.map((w) => ({ points: w.points, half: 1.5 })),\n ];\n const lineRight = Math.max(0, ...drawn.flatMap((l) => l.points.map((p) => p[0] + l.half + P.edge)));\n const lineBottom = Math.max(0, ...drawn.flatMap((l) => l.points.map((p) => p[1] + l.half + P.edge)));\n const widthFinal = Math.max(widthAll, lineRight, ...all.map((r) => r.x + r.w + P.margin));\n let heightFinal = Math.max(height, lineBottom, ...all.map((r) => r.y + r.h + P.margin));\n // 狭い枠は、今の段で動いた値を図の下の帯に大きな字で出す\n if (narrow && banded.length > 0) {\n const top = heightFinal - P.margin + P.narrow.gap;\n for (const s of stepList) {\n const here = banded.filter((b) => b.step === s);\n const ws = here.map((b) => chipW(b.text, bigStyle));\n let x = widthFinal / 2 - (ws.reduce((a, b) => a + b, 0) + P.chip.gap * Math.max(0, here.length - 1)) / 2;\n here.forEach((b, i) => {\n const w = ws[i] as number;\n chips.push(chipOf(b.kind, b.text, { x, y: top, w, h: bigH }, s, b.extra, true));\n x += w + P.chip.gap;\n });\n }\n heightFinal = top + bigH + P.margin;\n }\n\n return {\n kind: \"pipe\",\n arrangement: narrow ? \"fit\" : \"wide\",\n width: widthFinal,\n height: heightFinal,\n regions: [],\n boxes: [],\n lifelines: [],\n edges: [],\n labels: [],\n actions: [],\n badges: [],\n paths: [],\n ends: [],\n parties,\n columns,\n pills,\n tanks,\n glasses,\n levels,\n buses,\n pipes,\n flows,\n calls,\n mains,\n lanes,\n plates,\n writes,\n gauges,\n checks: [],\n events,\n converters,\n housings,\n ties,\n folds: foldBoxes,\n rings,\n valuePipes,\n stubs,\n crossings,\n chips,\n narrow,\n focus,\n };\n\n function spanOf(k: number): number {\n const d = defs[k] as Def;\n return Math.abs((cols.get(d.from)?.x ?? 0) - (cols.get(d.to)?.x ?? 0)) + (bandOf(d.from) === bandOf(d.to) ? 0 : 1e4);\n }\n }\n\n /** 隣どうしの囲いを結ぶ管か。同じ段で並びが隣の 2 人の間の管 */\n function isAdjacent(d: Def): boolean {\n for (const band of [band0, band1]) {\n const i = band.indexOf(d.from);\n const j = band.indexOf(d.to);\n if (i >= 0 && j >= 0 && Math.abs(i - j) === 1) return true;\n }\n return false;\n }\n}\n\n","/**\n * 配管の図 (`pipe`、#3418) の再生の部品の、図の下に置く段の動きと呼び出しの結果 (#3450)。\n *\n * 再生の部品 (`player.ts`) が見せている図の段 (畳んだ箱を開いた後は開いた図の段) を頭から当て、段ごとに矢印を作る。\n * 矢印は送る側、量か名前、受ける側と、何をしたかの札を持つ。値が動く段は動いた値を実線の矢印で出し、確かめた式と取り消しも出す。\n * 値が動かず確かめも取り消しも無い段は、呼び出しと返した値を点線の矢印で出し、計算と記録も出す。\n * 同じ段で戻った呼び出しは、返した側から返した値の矢印 1 本にまとめる。値が動く段で呼び出しを出すと、\n * 1 つの動きが「呼ぶ」「送る」「返す」の 3 本に割れて読めなくなるため。\n * 確かめは満たすかの札を式の前に置いた 1 行の枠にする。同じ理由で続けて取り消した呼び出しは、取り消した側から戻る先までの\n * 道 1 本の枠にまとめ、理由を 1 回だけ小さく出す。取り消しを矢印ごとに分けて理由を大きく出すと、携帯の幅で枠が詰まるため。\n *\n * 要点 (`gist`) を書いた段は、矢印の後ろに要点の札を置く (#3464)。札は名札と要点の文を 1 つの枠に並べ、枠の幅に関わらず同じ形で出す。\n * 配管の図は段の本文を見せないので、本文にしか無い要点が画面から消えないよう、書き手が段ごとに選んで出す。\n * 呼び出しの結果は畳んで置き、開くと先頭にいちばん外の呼び出し (取引) を、その下に今の段までに戻った内側の呼び出しを、\n * 呼ばれた側、中身、返した値の 3 列で出す。返した値が無いか `true` だけの呼び出しは、その段の矢印に値の動きとして出ているため出さない。\n * 今の段で戻った行に `data-state=\"now\"` を付ける。\n * 出来事は描く部品の並べ方と同じ手順 (`PipeRun`) に当て、当てられない出来事は図と同じく矢印にも結果にも出さない。\n * 字は渡した言葉 (`FIGURE_TEXT`) で出す。この file は配管の図の描く部品と同じ塊 (`kinds/pipe.ts`) に入り、\n * 再生の部品は配管の図を描けた後に登録簿から引いて置く。見た目は置く時に頁へ 1 度だけ入れる。\n */\nimport { FIGURE_TEXT, joinWords } from \"./figure-text\";\nimport { OP_TEXT } from \"./kinds/pipe/layout\";\nimport { LOOK, TYPE } from \"./look/values\";\nimport { checkPasses, isFault, PipeRun } from \"./pipe-run\";\nimport type { Styles } from \"./adopt-css\";\nimport { cssFont as font } from \"./render/parts\";\nimport type { DiagramModel } from \"./schema\";\nimport type { NotationLang } from \"./words\";\n\nconst px = (v: number): string => `${v}px`;\n\n/**\n * 段の動きの見た目。矢印どうしの間と矢印の上下の余白、名前と矢印の間、矢印の線の太さと先の長さ、量と線と札の間、\n * 矢印の欄と結果の間、矢印の欄と結果の最も広い幅、確かめと取り消しの枠の左右と上下の余白と角の丸みと枠どうしの間、\n * 取り消しの道の矢印の長さと名前との間、結果の 1 つの欄の上下と左右の余白、今の段の行の左の印の太さ、\n * 要点の札の上の間と上下の余白 (#3464)。\n * 広い枠でも矢印と結果を枠の全幅に伸ばさない。送る側と受ける側が離れると、どの名前がどの量に付くかを目で追えなくなるため\n */\nconst FLOWS = {\n row: 8,\n gap: 10,\n line: 2,\n head: 7,\n inner: 3,\n record: 12,\n max: 520,\n boxX: 10,\n boxY: 8,\n round: 6,\n boxGap: 4,\n link: 16,\n linkGap: 6,\n cellY: 6,\n cellX: 10,\n mark: 3,\n gist: 8,\n gistY: 7,\n} as const;\n\n/** 枠と行に敷く色の濃さ (%)。確かめを満たした枠、満たさない枠と取り消しの枠、取引の枠、今の段の行、要点の札 */\nconst TINT = { pass: 9, fail: 9, deal: 10, now: 8, gist: 8 } as const;\n\n/** 矢印の種類。値が動く、確かめる、取り消す、呼ぶ、返す、計算する、記録を出す */\nexport type FlowKind = \"move\" | \"check\" | \"revert\" | \"call\" | \"return\" | \"calc\" | \"emit\";\n\n/**\n * 段の下に出す矢印の 1 本。`line` は実線 (値が動く) か点線 (呼び出しと返した値と取り消し) か線無し (確かめと計算と記録)。\n * 取り消しは `from` が取り消した側、`to` が戻る先、`via` が道の途中で取り消しを伝えた関係者、`amount` が理由 (無い時は空)\n */\nexport interface StepFlow {\n kind: FlowKind;\n line: \"solid\" | \"dashed\" | \"none\";\n from: string;\n amount: string;\n to: string;\n tag: string;\n via?: string[];\n}\n\n/** 記録の 1 行。`step` は呼び出しを開いた段、`depth` は開いた時に開いていた呼び出しの数、`close` は閉じた段と返した値か取り消したか */\nexport interface CallRow {\n step: number;\n depth: number;\n from: string;\n to: string;\n label?: string;\n close?: { step: number; value?: string; reverted: boolean };\n}\n\n/** 記録の行と、段ごとの矢印 */\nexport interface CallList {\n rows: CallRow[];\n flows: StepFlow[][];\n}\n\n/** 図 `model` の段を頭から当て、記録の行を出てきた順に作り、段ごとの矢印を作る */\nexport function callList(model: DiagramModel, lang: NotationLang): CallList {\n const w = FIGURE_TEXT[lang];\n const names = new Map(model.boxes.map((b) => [b.id, b.name]));\n const name = (id: string): string => names.get(id) ?? id;\n const run = new PipeRun(model.boxes, model.pipe?.holds ?? []);\n const rows: CallRow[] = [];\n /** 開いている呼び出しの行の番号。手順の開いている呼び出しと同じ順に積む */\n const stack: number[] = [];\n const flows: StepFlow[][] = [];\n /** いちばん内側で開いている呼び出しの呼ばれた側。計算と記録をした者 */\n const actor = (): string => rows[stack[stack.length - 1] ?? -1]?.to ?? \"\";\n model.steps.forEach((step, s) => {\n /** 値の動きと確かめと取り消し。1 つでもあれば、この段はこれだけを出す */\n const main: StepFlow[] = [];\n /** 呼び出しと返した値と計算と記録。値が動かず確かめも取り消しも無い段に出す */\n const rest: StepFlow[] = [];\n /** この段で開いた呼び出しの行の番号から、その呼び出しの矢印の `rest` の中の位置 */\n const opened = new Map<number, number>();\n for (const e of step.events) {\n switch (e.type) {\n case \"call\":\n rows.push({ step: s, depth: stack.length, from: name(e.from), to: name(e.to), ...(e.label !== undefined ? { label: e.label } : {}) });\n if (!run.call(e)) {\n stack.push(rows.length - 1);\n opened.set(rows.length - 1, rest.length);\n rest.push({ kind: \"call\", line: \"dashed\", from: name(e.from), amount: e.label ?? w.callNone, to: name(e.to), tag: w.flowTags.call });\n }\n break;\n case \"return\":\n case \"revert\": {\n if (isFault(run.close(e.box, e.type))) break;\n const index = stack.pop() ?? -1;\n const row = rows[index];\n if (!row) break;\n if (e.type === \"revert\") {\n row.close = { step: s, reverted: true };\n const reason = e.reason ?? \"\";\n const last = main[main.length - 1];\n // 1 つ内側の取り消しが戻った先が、同じ理由で続けて取り消した時は、道を 1 人分延ばす\n if (last?.kind === \"revert\" && last.amount === reason && last.to === row.to) {\n last.via = [...(last.via ?? []), last.to];\n last.to = row.from;\n } else main.push({ kind: \"revert\", line: \"dashed\", from: row.to, amount: reason, to: row.from, tag: w.reverted, via: [] });\n break;\n }\n row.close = { step: s, ...(e.value !== undefined ? { value: e.value } : {}), reverted: false };\n const output = e.value ?? w.callNone;\n const at = opened.get(index);\n const back: StepFlow = { kind: \"return\", line: \"dashed\", from: row.to, amount: output, to: row.from, tag: at === undefined ? w.flowTags.return : w.returnOf(row.label ?? w.callNone) };\n if (at === undefined) rest.push(back);\n else rest[at] = back;\n break;\n }\n case \"move\":\n if (!run.move(e))\n main.push({ kind: \"move\", line: \"solid\", from: name(e.from), amount: joinWords(e.amount, run.tokens.get(e.box) ?? name(e.box)), to: name(e.to), tag: w.flowTags.move });\n break;\n case \"emit\":\n if (!isFault(run.emit())) rest.push({ kind: \"emit\", line: \"none\", from: actor(), amount: `${e.name}(${(e.args ?? []).join(\", \")})`, to: \"\", tag: w.flowTags.emit });\n break;\n case \"check\":\n main.push({ kind: \"check\", line: \"none\", from: \"\", amount: `${e.left} ${OP_TEXT[e.op]} ${e.right}`, to: \"\", tag: checkPasses(e) ? w.checkPass : w.checkFail });\n break;\n case \"calc\":\n rest.push({ kind: \"calc\", line: \"none\", from: actor(), amount: `${e.in} → ${e.out}`, to: \"\", tag: w.flowTags.calc });\n break;\n case \"write\":\n // 矢印にも結果にも出さないが、後の出来事を図と同じ値の上で当てるために書き替える\n run.write(e);\n break;\n default:\n break;\n }\n }\n flows.push(main.length > 0 ? main : rest);\n });\n return { rows, flows };\n}\n\n/**\n * 結果の一覧に出す内側の呼び出しか。取り消したか、`true` 以外の値を返した呼び出しを出す。\n * 返した値が無いか `true` だけの呼び出し (トークンを送るなど) は、その段の矢印に値の動きとして出ている\n */\nconst hasResult = (row: CallRow): boolean => row.close !== undefined && (row.close.reverted || (row.close.value !== undefined && row.close.value !== \"true\"));\n\n/** 書き出した頁で段の矢印と要点の札と呼び出しの結果と拡大の度合いの札が出しうる字。字の file に残す */\nexport function pipeTexts(model: DiagramModel, lang: NotationLang): string[] {\n const w = FIGURE_TEXT[lang];\n const { rows, flows } = callList(model, lang);\n return [\n w.calls,\n w.deal,\n w.waiting,\n w.reverted,\n w.gist,\n ...model.steps.flatMap((step) => (step.gist === undefined ? [] : [step.gist])),\n \"→\",\n ...rows.flatMap((row) => [row.from, row.to, row.label ?? w.callNone, row.close?.value ?? \"\"]),\n ...flows.flat().flatMap((flow) => [flow.from, flow.amount, flow.to, flow.tag, ...(flow.via ?? [])]),\n // 拡大の度合いの札 (`125%`)\n \"0123456789%\",\n ];\n}\n\n/** 段の動きと要点の札と呼び出しの結果の見た目。置く時に頁へ 1 度だけ入れる */\nfunction callsCss(): string {\n const line = `${px(FLOWS.line)} solid var(--mute)`;\n const tint = (color: string, percent: number): string => `color-mix(in srgb,var(${color}) ${percent}%,transparent)`;\n const strong = TYPE.button.weight;\n const name = TYPE.boxName.weight;\n return [\n // 矢印は送る側、量と線と札、受ける側の 3 つの欄に並べ、量が長い時は真ん中の欄の中で折る\n `.dg-fl{display:flex;flex-direction:column;max-width:${px(FLOWS.max)}}`,\n `.dg-f{display:grid;grid-template-columns:auto minmax(0,1fr) auto;align-items:center;column-gap:${px(FLOWS.gap)};padding:${px(FLOWS.row)} 0}`,\n `.dg-f+.dg-f{border-top:${px(LOOK.stroke.hair)} solid var(--hair)}`,\n `.dg-ff,.dg-ft{${font(TYPE.stepBody)};font-weight:${strong};color:var(--ink);white-space:nowrap}`,\n `.dg-fm{display:flex;flex-direction:column;align-items:center;text-align:center;gap:${px(FLOWS.inner)};min-width:0}`,\n `.dg-fa{${font(TYPE.button)};color:var(--ink);overflow-wrap:anywhere}`,\n `.dg-fx{align-self:stretch;position:relative;border-top:${line};margin-right:${px(FLOWS.head)}}`,\n `.dg-fx::after{content:\"\";position:absolute;right:-${px(FLOWS.head)};top:-${px(FLOWS.head / 2 + FLOWS.line / 2)};border:${px(FLOWS.head / 2)} solid transparent;border-left:${px(FLOWS.head)} solid var(--mute);border-right:0}`,\n `.dg-f[data-line=\"dashed\"] .dg-fx{border-top-style:dashed}`,\n `.dg-f[data-line=\"none\"] .dg-fx{display:none}`,\n `.dg-fg{${font(TYPE.fieldName)};color:var(--mute)}`,\n // 確かめと取り消しは色を薄く敷いた枠に入れ、満たすかと取り消しの札を先に置く\n `.dg-f[data-kind=\"check\"],.dg-f[data-kind=\"revert\"]{border-top:0;border-radius:${px(FLOWS.round)};padding:${px(FLOWS.boxY)} ${px(FLOWS.boxX)};margin:${px(FLOWS.boxGap)} 0}`,\n `.dg-f[data-kind=\"check\"]{display:flex;align-items:center;justify-content:space-between;gap:${px(FLOWS.gap)};background:${tint(\"--t-green\", TINT.pass)}}`,\n `.dg-f[data-kind=\"check\"][data-pass=\"false\"],.dg-f[data-kind=\"revert\"]{background:${tint(\"--t-rose\", TINT.fail)}}`,\n `.dg-f[data-kind=\"check\"] .dg-fg,.dg-f[data-kind=\"revert\"] .dg-fg{${font(TYPE.stripTitle)};color:var(--t-green);white-space:nowrap}`,\n `.dg-f[data-kind=\"check\"][data-pass=\"false\"] .dg-fg,.dg-f[data-kind=\"revert\"] .dg-fg{color:var(--t-rose)}`,\n `.dg-f[data-kind=\"check\"] .dg-fa{text-align:right;font-variant-numeric:tabular-nums}`,\n // 取り消しは札と理由を 1 行に、理由は等幅の小さな字で 1 回だけ出し、その下に取り消しが伝わった道を出す\n `.dg-f[data-kind=\"revert\"]{display:block}`,\n `.dg-fh{display:flex;flex-wrap:wrap;align-items:baseline;column-gap:${px(FLOWS.gap)}}`,\n `.dg-f[data-kind=\"revert\"] .dg-fa{${font(TYPE.label)};color:var(--t-rose);overflow-wrap:anywhere}`,\n // 道は矢印と次の名前を組にして折り、名前の途中では折らない\n `.dg-fp{display:flex;flex-wrap:wrap;align-items:center;column-gap:${px(FLOWS.linkGap)};row-gap:${px(FLOWS.inner)};margin-top:${px(FLOWS.linkGap)};${font(TYPE.stepBodyNarrow)};font-weight:${name};color:var(--ink)}`,\n `.dg-fs{display:inline-flex;align-items:center;gap:${px(FLOWS.linkGap)};white-space:nowrap}`,\n `.dg-fk{display:inline-block;position:relative;width:${px(FLOWS.link)};border-top:${px(FLOWS.line)} dashed var(--t-rose);margin-right:${px(FLOWS.head)}}`,\n `.dg-fk::after{content:\"\";position:absolute;right:-${px(FLOWS.head)};top:-${px(FLOWS.head / 2 + FLOWS.line / 2)};border:${px(FLOWS.head / 2)} solid transparent;border-left:${px(FLOWS.head)} solid var(--t-rose);border-right:0}`,\n // 要点の札は矢印の欄と同じ幅までの薄い青の枠に、太字の名札と要点の文を続けて書き、長い文は枠の中で折る\n `.dg-gs{margin-top:${px(FLOWS.gist)};max-width:${px(FLOWS.max)};padding:${px(FLOWS.gistY)} ${px(FLOWS.boxX)};border-radius:${px(FLOWS.round)};background:${tint(\"--c-blue\", TINT.gist)};${font(TYPE.stepBodyNarrow)};color:var(--ink);overflow-wrap:anywhere}`,\n `.dg-gsl{font-weight:${strong};color:var(--c-blue);margin-right:${px(FLOWS.linkGap)}}`,\n // 呼び出しの結果は畳み、開くと取引の枠と、戻った内側の呼び出しを 3 列で揃えて出す\n `.dg-cr{margin-top:${px(FLOWS.record)};max-width:${px(FLOWS.max)};${font(TYPE.stepBodyNarrow)};color:var(--ink)}`,\n `.dg-cr>summary{cursor:pointer;color:var(--c-blue)}`,\n `.dg-ctx{margin-top:${px(FLOWS.linkGap)};padding:${px(FLOWS.boxY)} ${px(FLOWS.boxX)};border-radius:${px(FLOWS.round)};background:${tint(\"--mute\", TINT.deal)}}`,\n `.dg-ctx[data-state=\"now\"]{box-shadow:inset ${px(FLOWS.mark)} 0 0 var(--c-blue)}`,\n `.dg-ctt{display:flex;justify-content:space-between;align-items:baseline;gap:${px(FLOWS.gap)}}`,\n `.dg-cdl{${font(TYPE.fieldName)};color:var(--mute);margin-right:${px(FLOWS.linkGap)}}`,\n `.dg-cn{font-weight:${name}}`,\n `.dg-ctv{color:var(--mute);white-space:nowrap}`,\n `.dg-ctx[data-result] .dg-ctv{color:var(--ink);font-weight:${strong}}`,\n `.dg-crg{display:grid;grid-template-columns:max-content minmax(0,1fr) max-content;margin-top:${px(FLOWS.linkGap)}}`,\n `.dg-crg>[data-dragon=\"call\"]{display:contents}`,\n `.dg-crg>[data-dragon=\"call\"]>span{padding:${px(FLOWS.cellY)} ${px(FLOWS.cellX)};border-top:${px(LOOK.stroke.hair)} solid var(--hair)}`,\n `.dg-crg>[data-dragon=\"call\"]:first-child>span{border-top:0}`,\n `.dg-crg>[data-dragon=\"call\"]>span:first-child{border-left:${px(FLOWS.mark)} solid transparent}`,\n `.dg-crg .dg-cw{color:var(--mute);overflow-wrap:anywhere}`,\n `.dg-crg .dg-cv{text-align:right;white-space:nowrap;font-variant-numeric:tabular-nums}`,\n `.dg-crg>[data-state=\"now\"]>span{background:${tint(\"--c-blue\", TINT.now)}}`,\n `.dg-crg>[data-state=\"now\"]>span:first-child{border-left-color:var(--c-blue)}`,\n `.dg-crg>[data-state=\"now\"] .dg-cw{color:var(--ink)}`,\n `.dg-crg>[data-state=\"now\"] .dg-cv{font-weight:${strong}}`,\n `.dg-ctx[data-result=\"reverted\"] .dg-ctv,.dg-crg>[data-result=\"reverted\"] .dg-cv{color:var(--t-rose)}`,\n ].join(\"\");\n}\n\n/** 呼び出しの見た目を入れる。口`styles`を渡された時は口で図を置いた所の根 (帯の内側) へ入れ、無い時は文書の頭へ入れる (#3695) */\nfunction ensureCallsCss(doc: Document, styles?: Styles): void {\n if (styles) return styles.adopt(\"dragon-pipe-css\", callsCss());\n if (doc.getElementById(\"dragon-pipe-css\")) return;\n const style = doc.createElement(\"style\");\n style.id = \"dragon-pipe-css\";\n style.textContent = callsCss();\n doc.head.appendChild(style);\n}\n\nexport interface PipeCalls {\n /** 図の下に置く、段の矢印と要点の札と呼び出しの結果の入れ物 */\n readonly element: HTMLElement;\n /** 図 `model` の段 `step` (0 から) の矢印と要点の札と、その段までの呼び出しの結果を出す。描き直した図を渡すと作り直す */\n show(model: DiagramModel, step: number): void;\n}\n\n/** 段の矢印と要点の札と呼び出しの結果を作る。置く所は再生の部品が決める */\nexport function mountPipeCalls(doc: Document, styles: Styles | undefined, lang: NotationLang): PipeCalls {\n ensureCallsCss(doc, styles);\n const w = FIGURE_TEXT[lang];\n const element = doc.createElement(\"div\");\n element.className = \"dg-calls\";\n element.dataset.dragon = \"calls\";\n // 置いた頁の言葉と違っても、矢印と結果を図の言葉の声で読ませる\n element.setAttribute(\"lang\", lang);\n const board = doc.createElement(\"div\");\n board.className = \"dg-fl\";\n board.dataset.dragon = \"flows\";\n const record = doc.createElement(\"details\");\n record.className = \"dg-cr\";\n record.dataset.dragon = \"call-record\";\n const summary = doc.createElement(\"summary\");\n summary.textContent = w.calls;\n const lines = doc.createElement(\"div\");\n lines.className = \"dg-crl\";\n record.append(summary, lines);\n element.append(board, record);\n\n const span = (className: string, part: string | undefined, text: string): HTMLSpanElement => {\n const el = doc.createElement(\"span\");\n el.className = className;\n if (part !== undefined) el.dataset.dragon = part;\n el.textContent = text;\n return el;\n };\n /** 取り消しの道と矢印の印。読み上げでは名前だけを読ませる */\n const link = (): HTMLElement => {\n const el = doc.createElement(\"span\");\n el.className = \"dg-fk\";\n el.setAttribute(\"aria-hidden\", \"true\");\n return el;\n };\n const arrowOf = (flow: StepFlow): HTMLElement => {\n const row = doc.createElement(\"div\");\n row.className = \"dg-f\";\n row.dataset.dragon = \"flow\";\n row.dataset.kind = flow.kind;\n row.dataset.line = flow.line;\n if (flow.kind === \"check\") {\n row.dataset.pass = String(flow.tag === w.checkPass);\n row.append(span(\"dg-fg\", \"flow-tag\", flow.tag), span(\"dg-fa\", \"flow-amount\", flow.amount));\n return row;\n }\n if (flow.kind === \"revert\") {\n const head = doc.createElement(\"div\");\n head.className = \"dg-fh\";\n head.append(span(\"dg-fg\", \"flow-tag\", flow.tag), ...(flow.amount === \"\" ? [] : [span(\"dg-fa\", \"flow-amount\", flow.amount)]));\n const path = doc.createElement(\"div\");\n path.className = \"dg-fp\";\n const hop = (part: string, who: string): HTMLElement => {\n const unit = span(\"dg-fs\", undefined, \"\");\n unit.append(link(), span(\"\", part, who));\n return unit;\n };\n path.append(span(\"\", \"flow-from\", flow.from), ...(flow.via ?? []).map((who) => hop(\"flow-via\", who)), hop(\"flow-to\", flow.to));\n row.append(head, path);\n return row;\n }\n const middle = doc.createElement(\"span\");\n middle.className = \"dg-fm\";\n const line = doc.createElement(\"span\");\n line.className = \"dg-fx\";\n line.setAttribute(\"aria-hidden\", \"true\");\n middle.append(span(\"dg-fa\", \"flow-amount\", flow.amount), line, span(\"dg-fg\", \"flow-tag\", flow.tag));\n row.append(span(\"dg-ff\", \"flow-from\", flow.from), middle, span(\"dg-ft\", \"flow-to\", flow.to));\n return row;\n };\n // 要点の札。要点を書いた段だけ、矢印と呼び出しの結果の間に置き、書かない段では外す\n const gist = doc.createElement(\"div\");\n gist.className = \"dg-gs\";\n gist.dataset.dragon = \"gist\";\n const gistText = span(\"\", \"gist-text\", \"\");\n gist.append(span(\"dg-gsl\", \"gist-label\", w.gist), gistText);\n /** 戻った呼び出しの返した値の欄の字。取り消した呼び出しは取り消しと出す */\n const valueOf = (row: CallRow): string => (row.close?.reverted ? w.reverted : (row.close?.value ?? w.callNone));\n /** いちばん外の呼び出し (取引) の枠。呼んだ側、呼ばれた側、返した値か返り待ちと、その下に中身 */\n const dealOf = (row: CallRow, returned: boolean, now: boolean): HTMLElement => {\n const el = doc.createElement(\"div\");\n el.className = \"dg-ctx\";\n el.dataset.dragon = \"call-tx\";\n if (now) el.dataset.state = \"now\";\n if (returned) el.dataset.result = row.close?.reverted ? \"reverted\" : \"returned\";\n const top = doc.createElement(\"div\");\n top.className = \"dg-ctt\";\n const who = doc.createElement(\"span\");\n who.append(span(\"dg-cdl\", undefined, w.deal), span(\"dg-cn\", \"call-from\", row.from), \" → \", span(\"dg-cn\", \"call-to\", row.to));\n top.append(who, span(\"dg-ctv\", \"call-value\", returned ? valueOf(row) : w.waiting));\n const what = doc.createElement(\"div\");\n what.dataset.dragon = \"call-what\";\n what.textContent = row.label ?? w.callNone;\n el.append(top, what);\n return el;\n };\n /** 戻った内側の呼び出しの行。呼ばれた側、中身、返した値の 3 列 */\n const resultOf = (row: CallRow, now: boolean): HTMLElement => {\n const el = doc.createElement(\"div\");\n el.dataset.dragon = \"call\";\n if (now) el.dataset.state = \"now\";\n if (row.close?.reverted) el.dataset.result = \"reverted\";\n el.append(span(\"dg-cn\", \"call-to\", row.to), span(\"dg-cw\", \"call-what\", row.label ?? w.callNone), span(\"dg-cv\", \"call-value\", valueOf(row)));\n return el;\n };\n\n let shown: DiagramModel | undefined;\n let list: CallList = { rows: [], flows: [] };\n return {\n element,\n show: (model, step) => {\n if (model !== shown) {\n shown = model;\n list = callList(model, lang);\n }\n board.replaceChildren(...(list.flows[step] ?? []).map(arrowOf));\n const point = model.steps[step]?.gist;\n if (point === undefined) gist.remove();\n else {\n gistText.textContent = point;\n if (gist.parentNode === null) record.before(gist);\n }\n // 取引ごとに枠を置き、その下にその取引の中で戻った呼び出しを並べる\n const parts: HTMLElement[] = [];\n let grid: HTMLElement | undefined;\n for (const row of list.rows) {\n if (row.step > step) continue;\n const returned = row.close !== undefined && row.close.step <= step;\n const now = returned && row.close?.step === step;\n if (row.depth === 0) {\n parts.push(dealOf(row, returned, now));\n grid = undefined;\n continue;\n }\n if (!returned || !hasResult(row)) continue;\n if (grid === undefined) {\n grid = doc.createElement(\"div\");\n grid.className = \"dg-crg\";\n parts.push(grid);\n }\n grid.append(resultOf(row, now));\n }\n lines.replaceChildren(...parts);\n },\n };\n}\n","/** 配管の図の描く部品の組 (#3389、#3656)。並べ方と畳み方は図の種類の置き場 (`kinds/pipe/layout.ts`)、描き方は `render/pipe.ts` が持つ */\nimport { drawPipe } from \"../render/pipe\";\nimport type { KindParts } from \"./parts\";\nimport { foldPipe, layoutPipe, type PipeLayout } from \"./pipe/layout\";\n\nexport const parts: KindParts<PipeLayout> = {\n // `[fold]` の呼び出しの内側の段を、開くと頼まれていなければ 1 つの段にまとめてから並べる\n fold: (model, options, lang) => foldPipe(model, options.open ?? [], lang, options.words?.pipe),\n // 幅に関わらず横に長いまま並べ、再生の部品が枠の中を横に送る (#3398)\n layout: (diagram, lang, options) =>\n layoutPipe(diagram, {\n lang,\n ...(options.words?.pipe === undefined ? {} : { words: options.words.pipe }),\n ...(options.width === undefined ? {} : { width: options.width }),\n }),\n // 段ごとに図の全てを 1 枚の絵に描くので、描き方が全ての層を持つ\n draw: (layout, _diagram, ctx) => drawPipe(layout, ctx.t, ctx),\n // その段に関わる関係者の列を見る\n focus: (layout, _diagram, step) => layout.focus.filter((f) => f.step === step),\n};\n\n/** 配管の図の再生の部品の、図の下の段の矢印と呼び出しの結果 (#3418、#3450)。再生の部品は配管の図を描けた後に、登録簿から引いて置く */\nexport { mountPipeCalls, type PipeCalls } from \"../pipe-player\";\n"]}