@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/try-OV4XRYFL.cjs","../../src/blocks/ask/draw.ts","../../src/try-text.ts","../../src/kinds/try/layout.ts","../../src/blocks/chain/draw.ts","../../src/blocks/log/draw.ts","../../src/blocks/queue/draw.ts","../../src/blocks/route/draw.ts","../../src/render/try.ts","../../src/blocks/press/draw.ts","../../src/try-player.ts","../../src/kinds/try.ts"],"names":["cls","k","parts"],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACA;AChCA,IAAM,EAAA,EAAI,0BAAA;AACV,IAAM,EAAA,EAAI,CAAA,CAAE,IAAA;AAGL,SAAS,QAAA,CAAS,CAAA,EAAiB;AACxC,EAAA,MAAM,EAAE,MAAA,EAAQ,OAAA,EAAS,GAAA,EAAK,OAAA,EAAS,KAAA,EAAO,QAAA,EAAU,MAAA,EAAQ,MAAA,EAAQ,GAAA,EAAAA,IAAAA,EAAK,IAAI,EAAA,EAAI,CAAA;AACrF,EAAA,MAAM,SAAA,EAAW,IAAI,GAAA,CAAA,kCAAK,OAAA,qBAAQ,GAAA,6BAAK,OAAA,UAAS,CAAC,GAAA,CAAA,CAAG,GAAA,CAAI,CAAC,IAAA,EAAA,GAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAC1E,EAAA,MAAM,QAAA,EAAU;AAAA,IACd,GAAG,IAAI,GAAA;AAAA,MACL,OAAA,CAAQ,OAAA,CAAQ,CAAC,EAAA,EAAA,GAAO,CAAC,GAAG,MAAA,CAAO,OAAA,CAAQ,EAAA,CAAG,KAAK,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC,EAAA,EAAI,EAAE,CAAA,EAAA,GAAO,GAAA,EAAK,CAAC,EAAE,EAAA,EAAI,CAAC,CAAE,CAAA,EAAG,GAAI,EAAA,CAAG,KAAA,EAAO,CAAC,EAAA,CAAG,IAAA,CAAK,IAAI,EAAA,EAAI,CAAC,CAAE,CAAC;AAAA,IACnI;AAAA,EACF,CAAA;AACA,EAAA,IAAA,CAAA,MAAW,GAAA,GAAM,OAAA,EAAS;AACxB,IAAA,MAAM,MAAA,EAAQ,KAAA;AAAA,MACZ,OAAA,CAAQ,GAAA,CAAI,CAAC,EAAA,EAAA,oBAAO,EAAA,CAAG,KAAA,CAAM,EAAE,CAAA,UAAK,MAAI,CAAA;AAAA,MACxC,CAACC,EAAAA,EAAAA,mBAAO,OAAA,qBAAQA,EAAC,CAAA,6BAAG,IAAA,6BAAM,OAAA,IAAS,GAAA,kBAAK,OAAA,qBAAQA,EAAC,CAAA,6BAAG,IAAA,6BAAM,SAAA,EAAS,KAAA;AAAA,IACrE,CAAA;AACA,IAAA,MAAM,KAAA,mBAAO,MAAA,CAAO,KAAA,CAAM,EAAE,CAAA,UAAK,IAAA;AACjC,IAAA,MAAM,GAAA,EAAK,0CAAA,GAAW,CAAI,MAAA,EAAQ,CAAA,CAAE,MAAM,CAAA;AAC1C,IAAA,MAAM,SAAA,EAAW,CAAA,CAAE,EAAA,EAAI,EAAA,EAAI,sBAAA,CAAK,QAAA,CAAS,GAAA;AACzC,IAAA,MAAM,SAAA,EAAW,qCAAA,KAAM,CAAA,EAAWD,IAAAA,CAAI,WAAA,EAAa,IAAI,CAAA,EAAG,CAAA,CAAE,IAAA,EAAM,QAAA,EAAU,IAAA,EAAM,sBAAA,CAAK,OAAO,CAAA;AAC9F,IAAA,MAAA;AAAA,MACE,IAAA;AAAA,MACA,uCAAA,IAAY,EAAA,EAAI,sCAAA,sBAAO,CAAK,OAAO,EAAA,EAAI,sBAAA,CAAK,OAAA;AAAA,MAC5C,KAAA,CAAM,KAAA;AAAA,MACN,CAAA,CAAE,IAAA;AAAA,MACF;AAAA,IACF,CAAA;AACA,IAAA,MAAM,MAAA,EAAQ,MAAA,CAAO,UAAA;AACrB,IAAA,MAAM,OAAA,EACJ,MAAA,IAAU,KAAA,EAAA,EAAY,CAAC,EAAA,EAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,EAAA,EAAA,oCAAO,EAAA,uBAAG,KAAA,uBAAM,KAAA,uBAAM,EAAE,CAAA,8BAAA,CAAI,KAAK,GAAA,UAAK,IAAE,CAAA;AAClF,IAAA,MAAM,UAAA,EACJ,MAAA,IAAU,KAAA,EAAA,EACN,GAAA,EACA,MAAA;AAAA,MACE,MAAA;AAAA,MACA,MAAA,CAAO,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,IAAA;AAAA,MAClB,QAAA;AAAA,MACAA,IAAAA,CAAI,WAAA,EAAa,MAAA,CAAO,IAAA,CAAK,EAAE,CAAC,CAAA;AAAA,MAChC;AAAA,IACF,CAAA;AACN,IAAA,IAAA,CAAA,MAAW,EAAA,GAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AAChC,MAAA,MAAM,MAAA,EAAQ,uCAAA,CAAQ,CAAE,KAAK,EAAA,EAAI,sCAAA,sBAAO,CAAK,YAAY,EAAA,EAAI,sBAAA,CAAK,YAAA;AAClE,MAAA,MAAA;AAAA,QACE,CAAA,CAAE,KAAA;AAAA,QACF,KAAA;AAAA,QACA,KAAA,CAAM,KAAA;AAAA,QACN,MAAA,CAAO,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,KAAA,EAAO,uCAAA,CAAQ,CAAE,KAAA,EAAO,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,CAAE,CAAA;AAAA,QACvD,QAAA;AAAA,QACA,OAAA;AAAA,QACA,CAAC,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,EAAE;AAAA,MACf,CAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,EAAO,CAAC,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AAC7B,IAAA,GAAA,CAAI,IAAA;AAAA,MACF,CAAA,2BAAA,EAA8B,mCAAA,EAAM,CAAC,CAAA,SAAA,EAAY,kCAAA,CAAG,CAAE,KAAA,CAAM,IAAI,CAAC,CAAA,CAAA,EAAI,KAAA,CAAM,KAAK,CAAA,eAAA,EAAkB,KAAA,EAAO,cAAA,EAAgB,aAAa,CAAA,SAAA,EAAY,kCAAA,MAAG,CAAO,IAAA,CAAK,CAAC,CAAC,CAAA,UAAA,EAAa,CAAA,CAAE,CAAC,CAAA,MAAA,EAAS,EAAE,CAAA,GAAA,EAAM,QAAQ,CAAA,EAAA;AAC9M,IAAA;AACF,EAAA;AACF;AD4BmN;AACA;AExClG;AAE1D;AACjD,EAAA;AACuB,IAAA;AACC,IAAA;AACE,IAAA;AACJ,IAAA;AACS,IAAA;AACF,IAAA;AACrB,IAAA;AACC,IAAA;AAC4D,IAAA;AAC/D,IAAA;AACK,IAAA;AACJ,IAAA;AACC,IAAA;AACA,IAAA;AACqC,IAAA;AACF,IAAA;AACK,IAAA;AACL,IAAA;AAC0B,IAAA;AAC7D,IAAA;AACqB,IAAA;AACjB,IAAA;AACY,IAAA;AAIK,IAAA;AACC,IAAA;AAEG,IAAA;AAEM,IAAA;AAC+C,IAAA;AAElC,IAAA;AACV,IAAA;AAEnB,IAAA;AAC3B,EAAA;AACI,EAAA;AACyB,IAAA;AACF,IAAA;AACmC,IAAA;AAC/B,IAAA;AACwC,IAAA;AAC3B,IAAA;AAChC,IAAA;AACC,IAAA;AAC4E,IAAA;AAC/E,IAAA;AACK,IAAA;AACJ,IAAA;AACC,IAAA;AACA,IAAA;AACwC,IAAA;AACC,IAAA;AACQ,IAAA;AACE,IAAA;AAC0B,IAAA;AAC7E,IAAA;AACqB,IAAA;AACjB,IAAA;AACiB,IAAA;AAImB,IAAA;AACV,IAAA;AAEgD,IAAA;AAEY,IAAA;AAEK,IAAA;AAEY,IAAA;AAC9D,IAAA;AAEnB,IAAA;AACtC,EAAA;AACF;AF0BmN;AACA;AGpJzM;AACE;AACA;AACA;AAiJkC;AAGuC;AAGH;AAQP;AAChD,EAAA;AACc,EAAA;AACd,EAAA;AACG,IAAA;AACkB,MAAA;AACgD,MAAA;AAC3F,IAAA;AACqB,EAAA;AACwB,EAAA;AAClC,IAAA;AACa,IAAA;AACG,MAAA;AACD,QAAA;AACkE,QAAA;AAClD,QAAA;AACF,QAAA;AAChB,QAAA;AACb,QAAA;AACT,MAAA;AACS,IAAA;AACd,EAAA;AACuD,EAAA;AACsB,EAAA;AACf,EAAA;AACjB,EAAA;AACqB,EAAA;AACC,EAAA;AACpB,EAAA;AACjD;AAYuB;AACkB,EAAA;AAC3B,EAAA;AACa,IAAA;AACW,MAAA;AACE,MAAA;AACf,MAAA;AACpB,IAAA;AACH,EAAA;AAC+E,EAAA;AACnD,EAAA;AACgB,EAAA;AAEA,EAAA;AACnB,EAAA;AACG,IAAA;AACwB,MAAA;AACrB,QAAA;AACuB,QAAA;AACnC,QAAA;AACO,QAAA;AACtB,MAAA;AACD,IAAA;AACkC,EAAA;AACT,EAAA;AACM,IAAA;AACC,MAAA;AACmB,MAAA;AACnD,IAAA;AAC4C,IAAA;AACmC,IAAA;AACrE,IAAA;AACkD,MAAA;AAC3D,MAAA;AACF,IAAA;AAEmC,IAAA;AAC6B,MAAA;AACnC,QAAA;AACS,QAAA;AACnC,MAAA;AAC0F,MAAA;AAC5F,IAAA;AACkH,IAAA;AAC3B,IAAA;AAC1F,EAAA;AACO,EAAA;AACT;AAea;AACgB,EAAA;AACwB,EAAA;AAChB,EAAA;AACR,EAAA;AACV,EAAA;AAI+C,EAAA;AACpC,EAAA;AACO,EAAA;AACnB,IAAA;AACoB,IAAA;AACD,MAAA;AACP,MAAA;AAIlB,MAAA;AACI,MAAA;AACF,QAAA;AACC,QAAA;AACP,QAAA;AAC6C,QAAA;AACG,QAAA;AACG,QAAA;AACN,QAAA;AAC9C,MAAA;AACF,IAAA;AACsB,IAAA;AACxB,EAAA;AAKwB,EAAA;AACE,EAAA;AACY,EAAA;AAC3B,EAAA;AACC,EAAA;AACK,EAAA;AACyC,IAAA;AACjC,MAAA;AAC0C,MAAA;AAC7C,MAAA;AAC4D,QAAA;AACjF,IAAA;AACiB,EAAA;AACf,IAAA;AACgE,IAAA;AACpE,EAAA;AACsB,EAAA;AAOT,EAAA;AACwD,EAAA;AAGG,EAAA;AAChB,EAAA;AACC,IAAA;AACjC,IAAA;AACxB,EAAA;AAE4D,EAAA;AAEyC,EAAA;AAC5C,EAAA;AAC3B,IAAA;AACgF,IAAA;AAC9G,EAAA;AAEkD,EAAA;AACc,IAAA;AAChB,IAAA;AAChD,EAAA;AAC2C,EAAA;AACd,IAAA;AACX,IAAA;AACF,IAAA;AACM,MAAA;AAC+B,QAAA;AACiC,UAAA;AACV,IAAA;AAC5C,IAAA;AACuG,MAAA;AACrI,IAAA;AACwI,IAAA;AAC7G,IAAA;AACiD,IAAA;AACkB,IAAA;AAChG,EAAA;AAC4D,EAAA;AAGhB,EAAA;AAEiF,EAAA;AAMjB,EAAA;AACpE,EAAA;AACf,IAAA;AACwB,IAAA;AACjD,EAAA;AACgF,EAAA;AAC1D,EAAA;AAE6E,EAAA;AACrE,EAAA;AAGyB,EAAA;AAC5B,IAAA;AACsE,MAAA;AAC/F,IAAA;AAC4C,IAAA;AAC9C,EAAA;AAEyE,EAAA;AAG1C,EAAA;AACwE,IAAA;AACvG,EAAA;AAC6C,EAAA;AACG,IAAA;AAC6D,IAAA;AACjB,IAAA;AAElB,IAAA;AAC+B,IAAA;AACG,IAAA;AAC3D,IAAA;AACjD,EAAA;AACoC,EAAA;AACwB,IAAA;AAC5D,EAAA;AAEoE,EAAA;AACiB,EAAA;AAEpB,EAAA;AAIxD,EAAA;AACH,IAAA;AACgD,IAAA;AACZ,IAAA;AACyB,IAAA;AAI7D,EAAA;AAC2B,EAAA;AAGkE,EAAA;AACpE,EAAA;AACD,EAAA;AACE,EAAA;AACN,IAAA;AACgB,IAAA;AACJ,IAAA;AACrB,IAAA;AACjB,EAAA;AAEkD,EAAA;AACZ,IAAA;AACoB,IAAA;AACtB,IAAA;AACmF,IAAA;AACvH,EAAA;AAEgC,EAAA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACJ,EAAA;AACZ,EAAA;AACoD,EAAA;AAC9D,IAAA;AACH,IAAA;AACoB,IAAA;AACzB,EAAA;AAC0B,EAAA;AACK,IAAA;AACjB,IAAA;AACc,IAAA;AACA,IAAA;AACL,IAAA;AACR,IAAA;AAC2B,IAAA;AACb,MAAA;AACE,MAAA;AACb,QAAA;AACkB,QAAA;AACI,QAAA;AACnB,QAAA;AACL,UAAA;AACW,YAAA;AACf,cAAA;AACuG,cAAA;AAC/F,YAAA;AACZ,UAAA;AACF,QAAA;AAIyE,QAAA;AACN,QAAA;AACpC,QAAA;AACiG,QAAA;AACtG,QAAA;AACC,UAAA;AACiH,UAAA;AAC3I,QAAA;AAE0D,QAAA;AACpB,QAAA;AACnB,UAAA;AAChB,YAAA;AACiB,YAAA;AACqB,YAAA;AACuD,YAAA;AACzC,YAAA;AACpD,UAAA;AACJ,QAAA;AAC8C,QAAA;AACjB,QAAA;AACL,QAAA;AACC,UAAA;AACD,YAAA;AAGoD,YAAA;AAEtE,cAAA;AACgB,YAAA;AACA,YAAA;AAC8B,YAAA;AACvB,YAAA;AACA,YAAA;AACd,YAAA;AACT,cAAA;AACA,cAAA;AACQ,cAAA;AACyB,gBAAA;AACA,gBAAA;AACjC,cAAA;AACD,YAAA;AACF,UAAA;AAC8D,QAAA;AACY,QAAA;AAClE,QAAA;AACA,UAAA;AACH,UAAA;AAC4C,UAAA;AACnD,QAAA;AAC+B,QAAA;AACA,MAAA;AACpB,QAAA;AACuB,QAAA;AACH,QAAA;AACD,QAAA;AACnB,QAAA;AACP,UAAA;AACA,UAAA;AAC0D,UAAA;AAC7C,UAAA;AAClB,QAAA;AACsD,QAAA;AACvC,UAAA;AACW,UAAA;AACrB,UAAA;AACE,UAAA;AACL,QAAA;AAII,QAAA;AACQ,UAAA;AACwB,UAAA;AACqB,UAAA;AACrD,QAAA;AACM,QAAA;AACD,UAAA;AACwB,UAAA;AACjC,UAAA;AACA,UAAA;AACuB,UAAA;AACxB,QAAA;AACU,QAAA;AACA,UAAA;AACH,UAAA;AACoD,UAAA;AAC1D,UAAA;AACD,QAAA;AACsC,QAAA;AACT,MAAA;AACG,QAAA;AACoC,QAAA;AAE0B,QAAA;AACpE,QAAA;AACsB,QAAA;AACsB,QAAA;AAC7B,QAAA;AACc,QAAA;AACJ,QAAA;AAGF,QAAA;AAK1B,QAAA;AAES,QAAA;AACpB,QAAA;AACa,UAAA;AACqB,YAAA;AACpB,YAAA;AACQ,cAAA;AAC9B,YAAA;AACH,UAAA;AACoG,QAAA;AAC3E,QAAA;AACG,QAAA;AAGgF,QAAA;AACrD,QAAA;AAC/C,QAAA;AACC,UAAA;AACwB,UAAA;AAC5B,UAAA;AACL,UAAA;AACA,UAAA;AACwD,UAAA;AACxB,YAAA;AACU,YAAA;AACzC,UAAA;AACD,UAAA;AACgB,UAAA;AACqB,UAAA;AACrC,UAAA;AACuC,UAAA;AACjC,UAAA;AACU,YAAA;AACkD,YAAA;AAClE,UAAA;AAC2E,UAAA;AAC7D,UAAA;AAC8D,YAAA;AAC5E,UAAA;AAEI,UAAA;AACgB,YAAA;AACO,cAAA;AACf,gBAAA;AACsI,gBAAA;AACzI,cAAA;AACH,YAAA;AAED,UAAA;AACN,QAAA;AACsE,QAAA;AACqB,QAAA;AAC5D,QAAA;AAC3B,MAAA;AACa,QAAA;AAChB,UAAA;AACqF,UAAA;AACvF,QAAA;AAC4D,QAAA;AAClB,QAAA;AACR,QAAA;AACY,QAAA;AACU,QAAA;AAChB,QAAA;AACA,QAAA;AACpB,QAAA;AAC0D,UAAA;AAC9E,QAAA;AACmB,QAAA;AACgE,UAAA;AACnF,QAAA;AACY,QAAA;AACD,UAAA;AACwB,UAAA;AAC5B,UAAA;AACL,UAAA;AACG,UAAA;AACU,UAAA;AAAuB,YAAA;AAC2C,YAAA;AAC/E,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AAAA;AAEM,UAAA;AACU,YAAA;AACkD,YAAA;AAClE,UAAA;AAC0E,UAAA;AAC5D,UAAA;AACuD,YAAA;AACrE,UAAA;AACD,QAAA;AAE4E,QAAA;AAClE,QAAA;AACA,UAAA;AACH,UAAA;AAC4C,UAAA;AACnD,QAAA;AAC+B,QAAA;AAClC,MAAA;AACiB,MAAA;AACnB,IAAA;AACI,IAAA;AACN,EAAA;AAGoD,EAAA;AACA,EAAA;AACA,EAAA;AACJ,EAAA;AACgB,EAAA;AACjB,IAAA;AACC,IAAA;AACC,IAAA;AAEgB,IAAA;AACvC,MAAA;AACkC,MAAA;AAC5B,MAAA;AAC4B,QAAA;AAC+B,QAAA;AACtF,MAAA;AACH,IAAA;AAC2D,IAAA;AACA,IAAA;AACjC,MAAA;AACE,MAAA;AACD,QAAA;AACgB,QAAA;AACxC,MAAA;AACH,IAAA;AAC2D,IAAA;AACjC,MAAA;AACgC,MAAA;AAC7B,MAAA;AAC4B,QAAA;AACmC,QAAA;AAC1D,QAAA;AACG,QAAA;AAC2C,UAAA;AAC3E,QAAA;AACF,MAAA;AACH,IAAA;AAEsF,IAAA;AACvC,IAAA;AAGJ,IAAA;AACY,MAAA;AACE,MAAA;AAElD,IAAA;AACA,IAAA;AACF,MAAA;AACH,MAAA;AACA,MAAA;AACqC,MAAA;AAGhC,MAAA;AACP,IAAA;AACD,EAAA;AAEM,EAAA;AACC,IAAA;AAC2B,IAAA;AACjC,IAAA;AACc,IAAA;AACJ,IAAA;AACF,IAAA;AACI,IAAA;AACJ,IAAA;AACC,IAAA;AACC,IAAA;AAAA;AAED,IAAA;AACD,IAAA;AACD,IAAA;AACPE,IAAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACkC,IAAA;AACT,IAAA;AACwB,IAAA;AACjD,IAAA;AACF,EAAA;AACF;AAS8F;AAC9B,EAAA;AACxB,EAAA;AACpB,EAAA;AACmB,EAAA;AAEI,EAAA;AAC8B,EAAA;AACnB,IAAA;AACL,IAAA;AACa,IAAA;AAC5D,EAAA;AACsE,EAAA;AACrB,IAAA;AACA,IAAA;AACW,IAAA;AAC5D,EAAA;AAEsB,EAAA;AACC,EAAA;AACD,EAAA;AACuC,EAAA;AACnC,IAAA;AAC1B,EAAA;AAC0D,EAAA;AACZ,IAAA;AAKtC,IAAA;AACwC,IAAA;AACjB,MAAA;AACS,MAAA;AACL,IAAA;AACuD,MAAA;AAEqC,MAAA;AAC3E,MAAA;AACf,IAAA;AACb,MAAA;AACoE,QAAA;AACxF,MAAA;AACgB,MAAA;AACyD,MAAA;AACzC,IAAA;AAEG,MAAA;AAC6C,QAAA;AACrE,MAAA;AACkE,MAAA;AACnC,MAAA;AAC1B,QAAA;AACgC,QAAA;AAG1C,QAAA;AACG,UAAA;AAG4D,YAAA;AACjE,UAAA;AACG,MAAA;AAC0C,QAAA;AACrB,UAAA;AACrB,QAAA;AACqB,QAAA;AAC5B,MAAA;AACF,IAAA;AACD,EAAA;AACiC,EAAA;AACpC;AAGmE;AAC3C,EAAA;AAC+B,EAAA;AACnC,EAAA;AACX,EAAA;AAC2D,IAAA;AAC/C,IAAA;AACS,MAAA;AAC6B,QAAA;AAC7C,QAAA;AACN,QAAA;AACA,MAAA;AACJ,IAAA;AACiB,IAAA;AACiC,MAAA;AACE,QAAA;AACsC,QAAA;AACvF,MAAA;AACH,IAAA;AACuB,IAAA;AAC2B,MAAA;AACM,QAAA;AACkC,QAAA;AACvF,MAAA;AACH,IAAA;AACF,EAAA;AACF;AHtImN;AACA;AInwBzM;AACE;AACA;AAG+B;AACH,EAAA;AACH,EAAA;AAC5B,IAAA;AAC8E,MAAA;AACnF,IAAA;AAC6B,IAAA;AAC/B,EAAA;AACF;AAG6D;AAC8B,EAAA;AAC3E,EAAA;AACE,EAAA;AAC4E,IAAA;AACtE,EAAA;AAEwC,EAAA;AAC9B,EAAA;AACgB,EAAA;AAOnC,EAAA;AACa,IAAA;AACuC,IAAA;AACX,IAAA;AACrB,IAAA;AACwD,MAAA;AAGvD,IAAA;AAElC,EAAA;AACkC,EAAA;AACA,IAAA;AAC+B,IAAA;AACd,IAAA;AACnC,IAAA;AACR,MAAA;AACyB,MAAA;AAC7B,MAAA;AACkG,MAAA;AACpG,IAAA;AACwB,IAAA;AACsC,MAAA;AAC9D,IAAA;AAIsK,IAAA;AAC7H,IAAA;AAC9B,IAAA;AACT,MAAA;AACsB,MAAA;AACpB,MAAA;AACuB,MAAA;AACzB,MAAA;AACK,MAAA;AACP,IAAA;AACA,IAAA;AACE,MAAA;AACgD,MAAA;AAC1C,MAAA;AACJ,MAAA;AACuB,MAAA;AAC3B,IAAA;AAC0E,IAAA;AACC,IAAA;AACuB,IAAA;AACT,IAAA;AACkH,IAAA;AAC5M,EAAA;AAIiD,EAAA;AACA,EAAA;AACT,EAAA;AACd,EAAA;AACS,EAAA;AACe,EAAA;AACrC,EAAA;AAER,IAAA;AACgB,MAAA;AACF,MAAA;AACE,MAAA;AACE,MAAA;AAElB,IAAA;AAC2B,MAAA;AACX,MAAA;AACA,MAAA;AACE,MAAA;AAClB,IAAA;AACA,IAAA;AACN,EAAA;AACqB,EAAA;AACkD,EAAA;AAGzD,EAAA;AACsB,IAAA;AACO,IAAA;AACb,IAAA;AACuB,MAAA;AACjD,IAAA;AAC6B,IAAA;AAC6D,IAAA;AAC9B,IAAA;AACP,IAAA;AACX,IAAA;AAChB,MAAA;AACgE,MAAA;AAI7B,MAAA;AAC7B,MAAA;AAGgG,MAAA;AAGhI,IAAA;AACoI,IAAA;AACrI,EAAA;AAGgC,EAAA;AACU,IAAA;AACP,IAAA;AACrC,EAAA;AAC4D,EAAA;AAKzC,EAAA;AACyC,IAAA;AAGnC,IAAA;AACa,IAAA;AACqB,IAAA;AACpC,IAAA;AACR,MAAA;AACiB,MAAA;AACV,MAAA;AACiC,MAAA;AAC5C,MAAA;AAC4C,MAAA;AAC7B,MAAA;AACjB,IAAA;AAC2M,IAAA;AAEpM,EAAA;AACiG,EAAA;AACpH;AJ6tBmN;AACA;AKp4BzM;AACE;AACA;AAG6B;AACD,EAAA;AACD,EAAA;AAC0D,IAAA;AACpE,IAAA;AAC3B,EAAA;AACF;AAGuD;AACqD,EAAA;AAC5F,EAAA;AACiE,EAAA;AACjC,EAAA;AAC9B,EAAA;AAC0E,IAAA;AACpE,EAAA;AAEsC,EAAA;AACtC,EAAA;AACmB,EAAA;AACX,EAAA;AAEK,EAAA;AACkD,IAAA;AACtC,IAAA;AAC/B,IAAA;AACR,MAAA;AACyB,MAAA;AAC7B,MAAA;AAC8F,MAAA;AAChG,IAAA;AAC8F,IAAA;AAI0E,IAAA;AACjI,IAAA;AACN,IAAA;AACuD,IAAA;AACU,IAAA;AAGvF,IAAA;AACO,IAAA;AACQ,IAAA;AACgB,IAAA;AAC0E,MAAA;AACvD,MAAA;AAChC,MAAA;AACD,MAAA;AACiB,MAAA;AACI,MAAA;AACM,MAAA;AAEpC,MAAA;AAC2E,QAAA;AACwB,QAAA;AACjD,QAAA;AACtC,QAAA;AACoD,UAAA;AACiC,QAAA;AAG0C,QAAA;AAIlJ,MAAA;AACZ,IAAA;AAGyG,IAAA;AAEvF,IAAA;AACuB,MAAA;AACJ,MAAA;AAC6B,MAAA;AAC6C,MAAA;AACzC,MAAA;AAChD,MAAA;AAC6E,MAAA;AAC7D,MAAA;AACwF,MAAA;AACxF,MAAA;AACkC,QAAA;AACiD,QAAA;AACrH,MAAA;AAC0L,MAAA;AAEpL,IAAA;AAG4B,IAAA;AACwB,MAAA;AACQ,MAAA;AAE7B,IAAA;AACqB,MAAA;AACwC,MAAA;AACsG,MAAA;AAGxM,IAAA;AAC0G,IAAA;AAC/G,EAAA;AAGgG,EAAA;AACpC,EAAA;AAKzC,EAAA;AACuC,IAAA;AACS,IAAA;AACH,IAAA;AAC5B,IAAA;AACqB,IAAA;AACkG,IAAA;AACyD,IAAA;AAEpM,EAAA;AACyE,EAAA;AAC5F;ALq2BmN;AACA;AMh/BzM;AACE;AAGiC;AACN,EAAA;AACF,EAAA;AACwB,IAAA;AAC7C,IAAA;AACN,MAAA;AACJ,MAAA;AACM,MAAA;AACqI,MAAA;AAC7I,IAAA;AAEI,IAAA;AACM,MAAA;AACJ,MAAA;AACW,MAAA;AACA,MAAA;AACA,MAAA;AACN,MAAA;AAEP,IAAA;AACC,IAAA;AAC6I,MAAA;AAClJ,IAAA;AACF,EAAA;AACF;AN8+BmN;AACA;AOpgCzM;AAGgC;AACuC,EAAA;AACjE,EAAA;AACqB,EAAA;AAEf,IAAA;AAC6E,MAAA;AAC3E,MAAA;AACG,MAAA;AACkL,MAAA;AAE/L,IAAA;AAEI,IAAA;AAE6D,MAAA;AACL,MAAA;AAE5D,IAAA;AAEI,IAAA;AACY,MAAA;AAC8C,MAAA;AACtD,MAAA;AACR,QAAA;AACgD,QAAA;AAClD,QAAA;AAC0D,QAAA;AAC1D,QAAA;AAC0C,QAAA;AAC5C,QAAA;AACA,QAAA;AACF,MAAA;AACmM,MAAA;AAE7L,IAAA;AACL,IAAA;AACsF,MAAA;AAC3F,IAAA;AAC6F,IAAA;AAClE,IAAA;AACQ,MAAA;AACmB,MAAA;AACwB,MAAA;AAC/B,MAAA;AACxB,QAAA;AACQ,QAAA;AAC5B,MAAA;AACsB,MAAA;AACJ,MAAA;AACf,MAAA;AAC6J,QAAA;AACjK,MAAA;AACD,IAAA;AACH,EAAA;AACF;AP6/BmN;AACA;AQrjCpM;AACA;AAMC;AACkB,EAAA;AACS,EAAA;AACsB,EAAA;AACA,EAAA;AACQ,EAAA;AACC,EAAA;AACT,EAAA;AAC/B,EAAA;AACS,EAAA;AACzC,EAAA;AACoE,EAAA;AAClC,EAAA;AACqC,EAAA;AACE,EAAA;AACzC,EAAA;AACS,EAAA;AACJ,EAAA;AACS,EAAA;AACwB,EAAA;AACnC,EAAA;AACS,EAAA;AAC0B,EAAA;AAC6B,EAAA;AACjE,EAAA;AACE,EAAA;AACpC,EAAA;AACoC,EAAA;AACuB,EAAA;AACK,EAAA;AAChC,EAAA;AACuC,EAAA;AACvC,EAAA;AACS,EAAA;AAClC;AAMO;AACyD,EAAA;AAClC,EAAA;AACS,EAAA;AACvC;AAGmE;AAGc;AAEf;AAGP;AAuDK;AACzD,EAAA;AACS,EAAA;AAC6B,EAAA;AAEH,EAAA;AACD,IAAA;AACoC,IAAA;AACzC,IAAA;AAChB,IAAA;AACyD,IAAA;AACnF,EAAA;AASyC,EAAA;AAC4B,IAAA;AACK,IAAA;AAC/C,IAAA;AACc,IAAA;AAC5B,IAAA;AACG,IAAA;AAC4B,IAAA;AACZ,MAAA;AACV,MAAA;AACA,MAAA;AACW,MAAA;AAEgD,MAAA;AACjD,MAAA;AAEP,QAAA;AAC8B,QAAA;AACE,QAAA;AAC7C,QAAA;AACsD,UAAA;AACP,UAAA;AACtD,QAAA;AAGuF,QAAA;AAClC,QAAA;AACxC,QAAA;AACmB,QAAA;AACT,UAAA;AACT,UAAA;AAC8B,YAAA;AACF,YAAA;AACvC,UAAA;AACF,QAAA;AAC+B,QAAA;AACzB,QAAA;AACL,UAAA;AACE,YAAA;AACwC,YAAA;AACnC,YAAA;AACP,UAAA;AACkE,UAAA;AACpE,QAAA;AACsB,QAAA;AACC,MAAA;AAChB,QAAA;AACqD,UAAA;AACV,UAAA;AAClD,QAAA;AACuB,MAAA;AAChB,QAAA;AACsD,UAAA;AACZ,UAAA;AACjD,QAAA;AACsB,MAAA;AACf,QAAA;AACyD,UAAA;AACd,UAAA;AAClD,QAAA;AACF,MAAA;AACU,MAAA;AACJ,MAAA;AACe,MAAA;AACvB,IAAA;AACwD,IAAA;AACjD,IAAA;AACwE,MAAA;AACrB,MAAA;AAC1D,IAAA;AACoC,IAAA;AACtC,EAAA;AAG+E,EAAA;AACtB,IAAA;AAC1B,IAAA;AACI,MAAA;AACG,MAAA;AACgB,MAAA;AAC9B,MAAA;AACkC,MAAA;AACvD,IAAA;AACM,IAAA;AACT,EAAA;AAG+D,EAAA;AAClB,IAAA;AACd,IAAA;AACe,MAAA;AACqC,MAAA;AAC1D,MAAA;AACZ,QAAA;AACwB,UAAA;AACqB,UAAA;AACpD,QAAA;AACkD,MAAA;AACtD,IAAA;AACoC,IAAA;AAClB,IAAA;AACpB,EAAA;AASa,EAAA;AACgD,IAAA;AACiD,IAAA;AACxC,IAAA;AACwF,IAAA;AAC9J,EAAA;AAWW,EAAA;AACQ,IAAA;AACM,IAAA;AACc,MAAA;AACF,MAAA;AACzB,MAAA;AACO,QAAA;AACX,UAAA;AAC2D,UAAA;AAC7C,UAAA;AACf,QAAA;AACL,IAAA;AACF,EAAA;AAEwB,EAAA;AACD,EAAA;AACC,EAAA;AACD,EAAA;AAErB,EAAA;AACM,IAAA;AACkB,IAAA;AACpB,IAAA;AACA,IAAA;AACA,IAAA;AAC6C,IAAA;AACjD,EAAA;AAC+I,EAAA;AAErI,EAAA;AACG,EAAA;AACF,EAAA;AACD,EAAA;AAED,EAAA;AACJ,EAAA;AACa,IAAA;AACF,IAAA;AACE,IAAA;AACF,IAAA;AACwF,IAAA;AAC1G,EAAA;AACF;AAMoG;AAC7E,EAAA;AACF,EAAA;AACQ,EAAA;AAG2D,EAAA;AAC/E,EAAA;AACuC,IAAA;AACA,IAAA;AAC9C,EAAA;AACF;ARk8BmN;AACA;ASjxClH;AAC0B,EAAA;AACtG,EAAA;AACZ,EAAA;AAC2C,IAAA;AACS,IAAA;AAC3D,EAAA;AACF;ATmxCmN;AACA;AUrwC7K;AACW;AAGpC;AAGM;AAGO;AACT,EAAA;AACH,EAAA;AACoB,EAAA;AAEW,EAAA;AACpC,EAAA;AAC0D,IAAA;AACkE,IAAA;AACjI,IAAA;AAC6E,IAAA;AAAA;AAAA;AAG4B,IAAA;AACzG,IAAA;AAC6B,IAAA;AAC6K,IAAA;AAC3I,IAAA;AAAA;AAE4B,IAAA;AAC+D,IAAA;AAAA;AAEqD,IAAA;AACrB,IAAA;AAC5F,IAAA;AACA,IAAA;AAC7D,IAAA;AACO,IAAA;AACxC,IAAA;AAAA;AAEA,IAAA;AACA,IAAA;AACmF,IAAA;AACK,IAAA;AACxF,IAAA;AAAA;AAE0C,IAAA;AAAA;AAE1C,IAAA;AACO,EAAA;AACX;AAG4D;AACA,EAAA;AAChB,EAAA;AACH,EAAA;AAC5B,EAAA;AACgB,EAAA;AACD,EAAA;AAC5B;AA0Ee;AACW,EAAA;AACG,EAAA;AACQ,EAAA;AAC6B,EAAA;AACU,EAAA;AAExD,EAAA;AACV,IAAA;AACsE,MAAA;AAC5E,IAAA;AACF,EAAA;AAC8B,EAAA;AAEgD,EAAA;AAEzC,EAAA;AACoD,EAAA;AAC3E,EAAA;AAED,EAAA;AAEY,EAAA;AAEd,EAAA;AAEkF,EAAA;AACvD,IAAA;AAC3B,IAAA;AACK,IAAA;AACK,IAAA;AACH,IAAA;AACT,IAAA;AACT,EAAA;AAKqC,EAAA;AACE,IAAA;AACpB,IAAA;AACsB,IAAA;AAChC,IAAA;AACT,EAAA;AAEiC,EAAA;AAK0E,EAAA;AACpE,IAAA;AACrB,IAAA;AACwB,IAAA;AACpB,IAAA;AACE,IAAA;AACM,IAAA;AACxB,IAAA;AACS,IAAA;AAC8B,MAAA;AACX,MAAA;AACQ,QAAA;AAC1B,QAAA;AACM,QAAA;AACD,QAAA;AACjB,MAAA;AACgE,MAAA;AAG1C,MAAA;AACkE,MAAA;AACiC,MAAA;AACxE,MAAA;AACzC,MAAA;AACH,IAAA;AACiC,MAAA;AAC1B,MAAA;AACQ,MAAA;AACH,MAAA;AACJ,MAAA;AACL,MAAA;AACV,IAAA;AACkB,IAAA;AACI,IAAA;AACG,IAAA;AACM,IAAA;AACJ,IAAA;AAC7B,EAAA;AAEqC,EAAA;AACnB,EAAA;AAEa,EAAA;AACM,EAAA;AACpB,EAAA;AACK,EAAA;AACJ,EAAA;AAC0B,EAAA;AACT,EAAA;AACnB,EAAA;AACD,EAAA;AACiD,EAAA;AACH,EAAA;AACzC,EAAA;AACC,IAAA;AACuB,MAAA;AACpB,MAAA;AACqB,MAAA;AAC1B,MAAA;AAChB,IAAA;AACH,EAAA;AACiE,EAAA;AAC7B,EAAA;AACjB,EAAA;AACK,EAAA;AACiB,EAAA;AAChB,EAAA;AACY,EAAA;AACnB,EAAA;AACd,EAAA;AAGkF,EAAA;AAC9D,EAAA;AACqD,IAAA;AAC7E,EAAA;AAC0C,EAAA;AAC/B,IAAA;AACL,IAAA;AACN,EAAA;AAI0D,EAAA;AAE7B,EAAA;AACF,IAAA;AACG,MAAA;AACJ,MAAA;AACZ,MAAA;AAC0E,QAAA;AACrC,QAAA;AACxC,MAAA;AACwB,QAAA;AACD,QAAA;AAC9B,MAAA;AACF,IAAA;AACF,EAAA;AAKyB,EAAA;AACP,IAAA;AAC0D,MAAA;AAClC,IAAA;AAC/B,IAAA;AAEF,IAAA;AACT,EAAA;AAGoE,EAAA;AAGG,EAAA;AAGQ,EAAA;AACrC,EAAA;AAC9B,IAAA;AACa,IAAA;AACI,IAAA;AACV,IAAA;AACK,MAAA;AAC+C,MAAA;AAErB,MAAA;AACT,MAAA;AACoD,MAAA;AAC5B,MAAA;AAClC,MAAA;AAC2B,MAAA;AACN,MAAA;AAClD,IAAA;AACyB,IAAA;AACG,MAAA;AACH,MAAA;AAEkB,MAAA;AAC8B,MAAA;AAChD,MAAA;AACT,MAAA;AAC6G,QAAA;AAC7H,IAAA;AACU,IAAA;AACD,IAAA;AACL,IAAA;AACK,IAAA;AACX,EAAA;AAE8B,EAAA;AACR,oBAAA;AACX,IAAA;AACX,EAAA;AACuD,EAAA;AAC3C,IAAA;AACwD,IAAA;AACzB,IAAA;AACpB,IAAA;AACK,IAAA;AACF,IAAA;AACF,IAAA;AAC+B,IAAA;AACd,IAAA;AACnB,IAAA;AACyC,IAAA;AACrD,IAAA;AACF,MAAA;AACoC,MAAA;AACA,MAAA;AAC1C,IAAA;AACuB,IAAA;AACY,IAAA;AAC4B,IAAA;AAC/C,IAAA;AAE0D,IAAA;AAC5E,EAAA;AAE+B,EAAA;AACO,IAAA;AACf,IAAA;AACyC,IAAA;AACpC,IAAA;AAC2C,IAAA;AACvC,IAAA;AAC1B,IAAA;AACuB,MAAA;AAC8E,MAAA;AACvE,MAAA;AACjC,IAAA;AACH,EAAA;AACgD,EAAA;AACL,IAAA;AACjC,IAAA;AACe,IAAA;AACA,IAAA;AAC4C,IAAA;AAChC,IAAA;AAC+C,IAAA;AAE5D,IAAA;AACiB,MAAA;AACjC,MAAA;AAC0B,QAAA;AACwF,QAAA;AAC7E,QAAA;AACxC,MAAA;AACD,MAAA;AACF,IAAA;AACyB,IAAA;AACqB,IAAA;AAC7B,IAAA;AACb,IAAA;AAC0B,MAAA;AACkF,MAAA;AACvE,MAAA;AACxC,IAAA;AACH,EAAA;AAC8B,EAAA;AACf,IAAA;AACiB,IAAA;AACQ,IAAA;AACY,IAAA;AACe,IAAA;AAC/C,IAAA;AACiB,MAAA;AACU,MAAA;AACe,MAAA;AAC3D,IAAA;AACoB,IAAA;AACvB,EAAA;AAGwC,EAAA;AAC6B,IAAA;AACnC,IAAA;AACc,IAAA;AAC4B,IAAA;AACrC,IAAA;AACvC,EAAA;AACyC,EAAA;AAClB,IAAA;AACiB,IAAA;AACqB,IAAA;AAC7D,EAAA;AACwC,EAAA;AAGyB,IAAA;AACwD,IAAA;AACvG,MAAA;AACd,MAAA;AACF,IAAA;AACmB,IAAA;AACV,IAAA;AACL,IAAA;AACN,EAAA;AAC8C,EAAA;AACgD,IAAA;AAC9F,EAAA;AACuC,EAAA;AACE,EAAA;AACF,EAAA;AACC,EAAA;AACD,EAAA;AACA,EAAA;AAMZ,EAAA;AACgD,IAAA;AACjB,IAAA;AACvC,IAAA;AACiE,IAAA;AAC/C,IAAA;AACmD,IAAA;AACxF,EAAA;AAEK,EAAA;AACQ,EAAA;AAGsD,EAAA;AAC3B,IAAA;AACF,IAAA;AACuC,IAAA;AACL,IAAA;AACxC,IAAA;AACE,IAAA;AAClC,EAAA;AAKI,EAAA;AAEA,EAAA;AAEmB,EAAA;AAC4B,IAAA;AAE/C,EAAA;AAEyD,EAAA;AACtC,kBAAA;AAEhB,EAAA;AACL,IAAA;AACA,IAAA;AACA,IAAA;AAC6B,IAAA;AACgE,MAAA;AACrC,MAAA;AACnC,MAAA;AACZ,MAAA;AACF,MAAA;AACP,IAAA;AACqB,IAAA;AACM,MAAA;AACkB,QAAA;AACrB,wBAAA;AACtB,MAAA;AACsB,MAAA;AACH,MAAA;AACrB,IAAA;AACqB,IAAA;AACG,MAAA;AAC0B,MAAA;AAC3B,MAAA;AAGsC,QAAA;AAC3D,MAAA;AACqD,MAAA;AACqC,QAAA;AAC5F,IAAA;AACsB,IAAA;AAC4B,MAAA;AACX,MAAA;AACM,QAAA;AACtC,MAAA;AACyD,MAAA;AACnB,MAAA;AAC7C,IAAA;AACA,IAAA;AACe,IAAA;AACO,sBAAA;AACG,sBAAA;AACmB,MAAA;AACE,MAAA;AACF,MAAA;AACA,MAAA;AACA,MAAA;AAC7B,MAAA;AACA,MAAA;AACf,IAAA;AACF,EAAA;AACF;AVmnCmN;AACA;AW9qDxK;AAC+E,EAAA;AACrD,EAAA;AAAA;AAE5D,EAAA;AAAA;AAEwE,EAAA;AAAA;AAErE,EAAA;AACZ;AXgrDmN;AACA;AACA;AACA","file":"/Users/cardene/Desktop/projects/dragon-3711-release-0-75-0/packages/dragon/dist/light/try-OV4XRYFL.cjs","sourcesContent":[null,"/**\n * 入力の帯のブロックが送るチップの描き方 (#3337、#3348)。\n *\n * チップは 1 枚につき 1 つの部品 (`data-chip`) で、中の字は名前と、待ち行列が並べる順の欄の値の 2 つだけ。\n * 出来事ごとの位置を keyframes で辿り、待ち行列の席とブロックの中の席の間を滑る。\n * 網を運ばれるチップは送る側の節で現れ、最短の道の節を順に通って作る人へ着いてから待ち行列へ入る。\n * 網の節の関門で止まったチップ (#3476) は待ち行列に席を持たず、止まった節まで運ばれてそこで薄れて消える。\n * 宣言したチップは塗り、送ったチップは縁だけで描く。入力の帯そのものは再生の部品 (`try-player.ts`) が描く。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { hasWide, textBox } from \"../../layout/measure\";\nimport { TRY_LOOK } from \"../../look/try\";\nimport { LOOK, TYPE } from \"../../look/values\";\nimport { partRadius } from \"../../render/corner\";\nimport { esc, r1, sansOf, write } from \"../../render/parts\";\nimport type { TryKit } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\n\nconst T = TRY_LOOK;\nconst C = T.chip;\n\n/** チップ。1 枚につき 1 つの部品で、名前と並べる順の欄の値だけを出す */\nexport function tryChips(k: TryKit): void {\n const { layout, diagram, ctx, moments, track, phasesOf, phased, record, cls, top } = k;\n const declared = new Set((diagram.try?.items ?? []).map((item) => item.id));\n const chipIds = [\n ...new Set(\n moments.flatMap((mo) => [...Object.entries(mo.chips).flatMap(([id, at]) => (at ? [id] : [])), ...(mo.trip ? [mo.trip.item] : [])]),\n ),\n ];\n for (const id of chipIds) {\n const moved = track(\n moments.map((mo) => mo.chips[id] ?? null),\n (k) => (moments[k]?.trip?.item === id ? moments[k]?.trip?.points : undefined),\n );\n const name = layout.names[id] ?? id;\n const rx = partRadius(ctx.corner, C.radius);\n const baseline = C.h / 2 + LOOK.baseline.tag;\n const nameText = write(undefined, cls(\"dg-try-cn\", name), C.padX, baseline, name, TYPE.tryChip);\n record(\n name,\n hasWide(name) ? sansOf(TYPE.tryChip) : TYPE.tryChip,\n moved.rests,\n C.padX,\n baseline,\n );\n const field = layout.valueField;\n const values =\n field === undefined ? [] : moments.map((mo) => mo.state.items[id]?.[field] ?? \"\");\n const valueText =\n field === undefined\n ? \"\"\n : phased(\n values,\n layout.chip.w - C.padX,\n baseline,\n cls(\"dg-try-cv\", values.join(\"\")),\n \"end\",\n );\n for (const p of phasesOf(values)) {\n const style = hasWide(p.value) ? sansOf(TYPE.tryChipValue) : TYPE.tryChipValue;\n record(\n p.value,\n style,\n moved.rests,\n layout.chip.w - C.padX - textBox(p.value, 0, 0, style).w,\n baseline,\n \"start\",\n [p.from, p.to],\n );\n }\n const sent = !declared.has(id);\n top.push(\n `<g class=\"dg-a\" data-chip=\"${esc(id)}\" style=\"${cs(T.color.part)};${moved.style}\"><rect class=\"${sent ? \"dg-try-sent\" : \"dg-try-chip\"}\" width=\"${r1(layout.chip.w)}\" height=\"${C.h}\" rx=\"${rx}\"/>${nameText}${valueText}</g>`,\n );\n }\n}\n","/**\n * 試す図 (`try`、#3337) の描く部品と再生の部品が出す字。\n *\n * 試す図を描く部品と再生の部品の操作は、軽い入口では試す図の塊 (`kinds/try.ts`) と一緒に後から読む。\n * 字もその塊にだけ入るよう、どの図でも使う字 (`figure-text.ts`) と分けて持つ。言葉の渡し方は `figure-text.ts` と同じ。\n */\nimport type { NotationLang } from \"./words\";\n\nexport interface TryText {\n /**\n * 試す図 (#3337)。ブロックの番号の字、待ち行列の取り出し方 (釦が上から何件を取り出すか)、畳んだ古いブロックの数。\n * prev と hash と SHA-256 は語の名前のまま、どちらの言葉でも書き換えない\n */\n tryBlock: (n: number) => string;\n tryTakes: (n: number) => string;\n tryFolded: (n: number) => string;\n /** 記録の列の記録の番号の字 (#3441) */\n tryRecord: (n: number) => string;\n /** 記録の列で畳んだ記録の数の字 (#3441) */\n tryFoldedRecords: (n: number) => string;\n /**\n * 関門で止まった記録 (#3476) の字。止まった節の字と、`retry` を書いた関門の「再試行できる」の印と、書かない関門の「直して送り直す」の印。\n * 送ったチップが関門で止まった段の本文\n */\n tryStoppedAt: (node: string) => string;\n tryRetry: string;\n tryResend: string;\n tryStoppedBody: (name: string, node: string, error: string) => string;\n /**\n * 試す図の再生の部品 (#3337)。入力の帯と書き換える欄の読み上げの名前、送る釦と決める釦と閉じる釦の字、書き換える欄の名前。\n * 押せない訳は、満杯の待ち行列へ送れないこと、空の待ち行列から取り出せないこと、待ち行列が受け入れない名前、\n * 集める待ち行列が足りないこと、空の欄、チップの名前に使えない字、空の書き換え。\n * 読み手が足した段の題と本文は、送った、釦を押した、書き換えたの 3 つ\n */\n tryAsk: string;\n tryEditForm: string;\n trySend: string;\n tryApply: string;\n tryClose: string;\n tryEditField: (item: string, field: string) => string;\n tryFull: (queue: string, most: number) => string;\n tryEmpty: (queue: string, press: string) => string;\n /** 待ち行列 `queue` が名前 `name` のチップを受け入れないので送れない (#3453) */\n tryRefused: (queue: string, name: string) => string;\n /** 2 つ以上の待ち行列から集める釦 `press` を、待ち行列 `queue` が `take` 件に満たないので押せない (#3453) */\n tryShort: (queue: string, press: string, take: number) => string;\n tryBlank: string;\n tryBadName: (field: string) => string;\n tryBlankEdit: string;\n trySent: (name: string) => string;\n trySentBody: (name: string, into: string, via?: string) => string;\n tryPressed: (press: string) => string;\n tryPressedBody: (count: number, from: string, block: number) => string;\n /** 釦が記録の列 `log` の記録 `record` に `from` の上から `count` 件を入れた時の段の本文 (#3441) */\n tryPressedRecordBody: (count: number, from: string, log: string, record: number) => string;\n /** 釦が 2 つ以上の待ち行列 `froms` のそれぞれの上から `count` 件ずつをブロック `block` に入れた時の段の本文 (#3453) */\n tryGatheredBody: (count: number, froms: readonly string[], block: number) => string;\n /** 釦が 2 つ以上の待ち行列 `froms` のそれぞれの上から `count` 件ずつを記録の列 `log` の記録 `record` に入れた時の段の本文 (#3453) */\n tryGatheredRecordBody: (count: number, froms: readonly string[], log: string, record: number) => string;\n tryEdited: (item: string, field: string) => string;\n tryEditedBody: (field: string, from: string, to: string) => string;\n}\n\n/** 英語の文で、名札を `,` と and でつなぐ */\nconst enList = (names: readonly string[]): string =>\n names.length <= 2 ? names.join(\" and \") : `${names.slice(0, -1).join(\", \")} and ${names[names.length - 1] ?? \"\"}`;\n\nexport const TRY_TEXT: Record<NotationLang, TryText> = {\n ja: {\n tryBlock: (n) => `ブロック${n}`,\n tryTakes: (n) => `次は上から${n}件`,\n tryFolded: (n) => `古いブロック${n}つ`,\n tryRecord: (n) => `記録${n}`,\n tryFoldedRecords: (n) => `古い記録${n}つ`,\n tryStoppedAt: (node) => `${node}で止まった`,\n tryRetry: \"再試行できる\",\n tryResend: \"直して送り直す\",\n tryStoppedBody: (name, node, error) => `${name}が${node}の関門で止まった(${error})。`,\n tryAsk: \"送る値\",\n tryEditForm: \"チップを書き換える\",\n trySend: \"送る\",\n tryApply: \"決める\",\n tryClose: \"閉じる\",\n tryEditField: (item, field) => `${item}の${field}`,\n tryFull: (queue, most) => `${queue}が満杯(${most}件)なので送れない`,\n tryEmpty: (queue, press) => `${queue}が空なので「${press}」を押せない`,\n tryRefused: (queue, name) => `${queue}は${name}を受け入れないので送れない`,\n tryShort: (queue, press, take) => `${queue}のチップが${take}件に満たないので「${press}」を押せない`,\n tryBlank: \"全ての欄を埋めてから送る\",\n tryBadName: (field) => `${field}に空白と [ ] 「 」 = : は使えない`,\n tryBlankEdit: \"値を入れてから決める\",\n trySent: (name) => `${name}を送った`,\n trySentBody: (name, into, via) =>\n via === undefined\n ? `${name}が${into}に入った。`\n : `${name}が${via}を通って${into}に入った。`,\n tryPressed: (press) => `「${press}」を押した`,\n tryPressedBody: (count, from, block) =>\n `${from}の上から${count}件がブロック${block}に入った。`,\n tryPressedRecordBody: (count, from, log, record) =>\n `${from}の上から${count}件が${log}の記録${record}に入った。`,\n tryGatheredBody: (count, froms, block) => `${froms.join(\"と\")}の上から${count}件ずつがブロック${block}に入った。`,\n tryGatheredRecordBody: (count, froms, log, record) =>\n `${froms.join(\"と\")}の上から${count}件ずつが${log}の記録${record}に入った。`,\n tryEdited: (item, field) => `${item}の${field}を書き換えた`,\n tryEditedBody: (field, from, to) =>\n `${field}を${from}から${to}にした。ブロックのhashを出し直す。`,\n },\n en: {\n tryBlock: (n) => `Block ${n}`,\n tryTakes: (n) => `Top ${n} go next`,\n tryFolded: (n) => `${n} older ${n === 1 ? \"block\" : \"blocks\"}`,\n tryRecord: (n) => `Record ${n}`,\n tryFoldedRecords: (n) => `${n} older ${n === 1 ? \"record\" : \"records\"}`,\n tryStoppedAt: (node) => `Stopped at ${node}`,\n tryRetry: \"retryable\",\n tryResend: \"fix and resend\",\n tryStoppedBody: (name, node, error) => `${name} stopped at the gate on ${node} (${error}).`,\n tryAsk: \"Values to send\",\n tryEditForm: \"Edit a chip\",\n trySend: \"Send\",\n tryApply: \"Apply\",\n tryClose: \"Close\",\n tryEditField: (item, field) => `${field} of ${item}`,\n tryFull: (queue, most) => `${queue} is full (${most}), so nothing more can be sent`,\n tryEmpty: (queue, press) => `${queue} is empty, so \"${press}\" cannot be pressed`,\n tryRefused: (queue, name) => `${queue} does not accept ${name}, so it cannot be sent`,\n tryShort: (queue, press, take) => `${queue} holds fewer than ${take} chips, so \"${press}\" cannot be pressed`,\n tryBlank: \"Fill in every field before sending\",\n tryBadName: (field) => `${field} cannot contain spaces, brackets, \"=\" or \":\"`,\n tryBlankEdit: \"Enter a value before applying\",\n trySent: (name) => `Sent ${name}`,\n trySentBody: (name, into, via) =>\n via === undefined\n ? `${name} went into ${into}.`\n : `${name} traveled through ${via} into ${into}.`,\n tryPressed: (press) => `Pressed \"${press}\"`,\n tryPressedBody: (count, from, block) =>\n `The top ${count === 1 ? \"item\" : `${count} items`} of ${from} went into block ${block}.`,\n tryPressedRecordBody: (count, from, log, record) =>\n `The top ${count === 1 ? \"item\" : `${count} items`} of ${from} went into record ${record} of ${log}.`,\n tryGatheredBody: (count, froms, block) =>\n `The top ${count === 1 ? \"item\" : `${count} items`} of each of ${enList(froms)} went into block ${block}.`,\n tryGatheredRecordBody: (count, froms, log, record) =>\n `The top ${count === 1 ? \"item\" : `${count} items`} of each of ${enList(froms)} went into record ${record} of ${log}.`,\n tryEdited: (item, field) => `Changed ${field} of ${item}`,\n tryEditedBody: (field, from, to) =>\n `Set ${field} from ${from} to ${to}. The block hash is computed again.`,\n },\n};\n","/**\n * 試す図 (`try`、#3337) の置き場所と段ごとの状態。見た目の元は承認した板 (網を上に、待ち行列と、prev と hash を `=` でつないだ機械の列を下に置く形)。\n *\n * 部品は書いた順に上から積む。網 (`route`) は節を列に並べ、送る側 (`from`) を左端、作る人 (`to`) を右端に置き、\n * ほかの節は道の中で前の節より右の列に置く (#3524)。待ち行列 (`queue`) はチップを縦に積み、縦に収まる数 (`most`) を持つ。\n * 機械の列 (`chain`) は新しい方から `TRY_LOOK.shown` 個のブロックを左から古い順に並べ、それより古いブロックは畳んだ印にまとめる。\n * 枠の幅 (`width`) を渡し、横に並べると字が `READABLE_PX` に届かない時は、枠の幅で縦に組む (#3366)。網の節は枠の幅に詰め、\n * 待ち行列は枠の幅いっぱいに置き、ブロックは上から古い順に積む。見た目の元は `docs/design/interactive/tx-block-narrow.pen` の案A。\n * 記録の列 (`log`、#3441) は機械の列と同じく新しい方から `TRY_LOOK.shown` 個の記録を並べ、記録は番号と印と、中のチップの名前と欄の値の行を持つ。\n * 横に並べた形では、ほかの部品が決めた図の幅に収まる数ずつ記録を並べて次の段へ折り返し、記録の列で図を広げない (#3478)。\n * 網の一番上の段で隣の名札とぶつかる名札は、1 つおきに節の上へ逃がし、網の節を名札 1 行ぶん下げる (#3478)。\n * 記録の中のチップは記録が行として描くので、記録の列に入ったチップは図の上に置き場所を持たない。\n * 網の節の関門 (#3476) で止まったチップは、網を止まった節まで運ばれて消え、関門の記録の列の記録になる。関門の記録は番号の横に再試行できるかの印を、\n * チップの行の下に止まった節の行とエラーの名前の行を分けて持つ (#3478)。\n * 入力の帯 (`ask`) と釦 (`press`) は頁の部品 (再生の部品) が描くので、図の上に置き場所を持たない。\n *\n * 段ごとの状態 (`states`) と出来事ごとの状態 (`moments`) は、記法を読む所と同じ手順 (`try-state.ts`) で作る。\n * 出来事ごとの状態には、その時のチップとブロックの左上の位置と、網を運ばれたチップが通る点を添え、描く部品がこれを辿って動かす。\n */\nimport { TRY_LOOK } from \"../../look/try\";\nimport { LOOK, READABLE_PX, TYPE } from \"../../look/values\";\nimport type { DiagramModel, TryPart } from \"../../schema\";\nimport { askFields, fromsOf, intoOf, type TryRecord, type TryState, TryRun } from \"../../try-state\";\nimport { TRY_TEXT } from \"../../try-text\";\nimport { DEFAULT_LANG, type NotationLang } from \"../../words\";\nimport { textWidth } from \"../../layout/measure\";\nimport type { Layout, Point, Rect } from \"../../layout/scene\";\n\nconst T = TRY_LOOK;\nconst C = T.chip;\nconst B = T.block;\nconst L = T.record;\n\n/** 図の上に置き場所を持つ部品。`most` は待ち行列だけが持つ */\nexport interface TryPartPlaced {\n id: string;\n type: \"route\" | \"queue\" | \"chain\" | \"log\";\n rect: Rect;\n most?: number;\n}\n\n/** 網の節。`end` は送る側 (`from`) か作る人 (`to`)。`label` は名札を節の上に置く時だけ持つ (#3478) */\nexport interface TryNodePlaced {\n id: string;\n x: number;\n y: number;\n end?: \"from\" | \"to\";\n label?: \"above\";\n}\n\n/** 網の節どうしの線。丸の縁から縁まで */\nexport interface TryNetLink {\n a: string;\n b: string;\n points: Point[];\n}\n\n/** 部品の題。`x` は左端、`baseline` は基準線 */\nexport interface TryTitle {\n text: string;\n x: number;\n baseline: number;\n}\n\nexport interface TryRoutePlaced {\n id: string;\n title: TryTitle;\n nodes: TryNodePlaced[];\n links: TryNetLink[];\n}\n\n/** 待ち行列。`slots` は上から順のチップの席、`hint` は釦が上から何件を取り出すかの字 */\nexport interface TryQueuePlaced {\n id: string;\n title: TryTitle;\n box: Rect;\n slots: Rect[];\n hint?: TryTitle;\n}\n\n/**\n * 機械の列。ブロックは同じ大きさで、`slots` は古い順のブロックの左上 (横に並べた形は左から、縦に組んだ形は上から)。`top` は最初のブロックの上端で、\n * `noBaseline` は番号の字の基準線、`prevY` と `hashY` は prev と hash の行の上端、`chipTop` は最初のチップの上端、`captionBaseline` は SHA-256 の字の基準線。\n * `fold` は畳んだ印の右端と上端。`labels` はブロックの番号ごとの字、`folds` は畳んだ数ごとの字\n */\nexport interface TryChainPlaced {\n id: string;\n title: TryTitle;\n top: number;\n h: number;\n w: number;\n slots: Point[];\n noBaseline: number;\n prevY: number;\n chipTop: number;\n captionBaseline: number;\n hashY: number;\n fold: { right: number; y: number };\n labels: Record<number, string>;\n folds: Record<number, string>;\n}\n\n/**\n * 記録の列 (#3441)。記録は同じ大きさで、`slots` は古い順の記録の左上 (横に並べた形は左から並べ、図の幅に収まらない分は次の段の左から (#3478)、\n * 縦に組んだ形は上から)。`top` は最初の記録の上端で、\n * `noBaseline` は番号の字の基準線、`markY` は印の札の上端、`rowTop` は最初の行の上端。`mark` は印の札の幅で、`all` を持たず関門の `into` でもない記録の列は持たない。\n * `field` は行に出す欄の位置 (`all` の欄か、待ち行列が並べる順の欄)。`fold` は畳んだ印の右端と上端。`labels` は記録の番号ごとの字、`folds` は畳んだ数ごとの字。\n * `stops` は関門で止まった記録 (#3476) の番号ごとの、止まった節の字とエラーの名前と再試行できるかの印の字で、関門で止まった記録の無い記録の列は持たない\n */\nexport interface TryLogPlaced {\n id: string;\n title: TryTitle;\n top: number;\n h: number;\n w: number;\n slots: Point[];\n noBaseline: number;\n markY: number;\n mark?: number;\n rowTop: number;\n field?: number;\n fold: { right: number; y: number };\n labels: Record<number, string>;\n folds: Record<number, string>;\n stops?: Record<number, { at: string; error: string; mark: string; retry: boolean }>;\n}\n\n/**\n * 出来事を当てた後の時点。`step` と `event` は出来事の場所で、最初の時点 (何も起きる前) は -1 を持つ。\n * `chips` はチップの左上 (出ていなければ `null`)、`blocks` は `<機械の列>/<番号>` ごとのブロックの左上 (畳んだか、まだ無ければ `null`)。\n * `trip` はこの出来事で網を運ばれたチップと、通る節の真ん中にチップを置く左上の並び、`built` はこの出来事で足したブロック。\n * `records` は `<記録の列>/<番号>` ごとの記録の左上、`logged` はこの出来事で足した記録で、記録の列を持たない図は持たない (#3441)。\n * `stop` はこの出来事で送ったチップが関門で止まった網と節 (#3476)\n */\nexport interface TryMoment {\n step: number;\n event: number;\n state: TryState;\n chips: Record<string, Point | null>;\n blocks: Record<string, Point | null>;\n records?: Record<string, Point | null>;\n trip?: { item: string; route: string; points: Point[] };\n built?: { chain: string; number: number };\n logged?: { log: string; number: number };\n stop?: { route: string; node: string };\n}\n\nexport interface TryLayout extends Layout {\n kind: \"try\";\n /** 部品を広い枠の形で並べたか (`row`)、狭い枠の形で縦に組んだか (`stack`) (#3366) */\n arrangement: \"row\" | \"stack\";\n /** 図の上に置き場所を持つ部品 (網、待ち行列、機械の列) の四角。書いた順に上から積む */\n parts: TryPartPlaced[];\n /** 段ごとの、その段の出来事を全て当てた後の状態 */\n states: TryState[];\n moments: TryMoment[];\n routes: TryRoutePlaced[];\n queues: TryQueuePlaced[];\n chains: TryChainPlaced[];\n /** 記録の列。記録の列を持たない図は持たない (#3441) */\n logs?: TryLogPlaced[];\n /** チップの大きさ */\n chip: { w: number; h: number };\n /** チップに出す値の欄の位置 (入力の帯の欄の順)。待ち行列が並べる順の欄を持たなければ持たない */\n valueField?: number;\n /** チップごとの、図に出す名前。書き手が書いた名前も読み手が打った名前も切らずに出す (#3458) */\n names: Record<string, string>;\n}\n\n/** 全体図に描く試す図の部品の四角。`band` は待ち行列の枠のような地、そうでなければ節やブロックのような札 */\nexport interface TryOverviewShape {\n rect: Rect;\n band: boolean;\n color: (typeof TRY_LOOK.color)[keyof typeof TRY_LOOK.color];\n}\n\nconst bottomOf = (r: Rect): number => r.y + r.h;\n\n/** ブロックの鍵 */\nexport const blockKey = (chain: string, number: number): string => `${chain}/${number}`;\n\n/** 記録の鍵 (#3441) */\nexport const recordKey = (log: string, number: number): string => `${log}/${number}`;\n\n/**\n * 網の節の列。送る側を 0 列、作る人を最後の列に置き、ほかの節は書いた道の中の何番目かの最も大きい番号の列に置いた上で、\n * 道の中で前の節より右の列へ送る (#3524)。送る側でない道の頭の節も 1 列より左には置かない。\n * 送る側でない節から始まる道 (`node-1 - node-3`) の次の節が頭の節と同じ列に入ると、2 つをつなぐ線が真下へ走り、頭の節の名前の上を通るため。\n * 輪になった道は前の節より右へ送り続けても収まらないので、節の数だけ回して止める\n */\nfunction columnsOf(route: Extract<TryPart, { type: \"route\" }>): string[][] {\n const order: string[] = [];\n const column = new Map<string, number>();\n for (const path of route.paths)\n path.forEach((node, i) => {\n if (!order.includes(node)) order.push(node);\n column.set(node, Math.max(column.get(node) ?? 0, node === route.from ? 0 : Math.max(1, i)));\n });\n column.set(route.from, 0);\n for (let pass = 0; pass < order.length; pass++) {\n let moved = false;\n for (const path of route.paths)\n path.forEach((node, i) => {\n const prev = path[i - 1];\n if (prev === undefined || node === route.from || node === route.to || prev === route.to) return;\n const want = (column.get(prev) ?? 0) + 1;\n if (want <= (column.get(node) ?? 0)) return;\n column.set(node, want);\n moved = true;\n });\n if (!moved) break;\n }\n const others = order.filter((node) => node !== route.to);\n const last = Math.max(1, ...others.map((node) => (column.get(node) ?? 0) + 1));\n column.set(route.to, Math.max(last, column.get(route.to) ?? 0));\n const count = Math.max(...column.values()) + 1;\n const columns: string[][] = Array.from({ length: count }, () => []);\n for (const node of order) columns[column.get(node) ?? 0]?.push(node);\n return columns.filter((list) => list.length > 0);\n}\n\n/**\n * 網の節の段。1 本の道だけが通る節はその道の段に、2 本以上の道が通る節は真ん中の段に置く。\n * 列を飛ばす線が飛ばした列の節の上を通らないように、道ごとに段を分ける。\n * 同じ列の節の段が 1 段より近づく時は、その列だけ真ん中から上下へ並べる。\n * 上下へ並べる順は、左の列で線がつながる節の段の平均の順にする (#3524)。\n * 線が短く交わらなくなり、細い枠でも急な線が節の名前の上を通らない。左につながる節の無い節は望む段で比べ、同じ値は書いた順に並べる\n */\nfunction lanesOf(\n route: Extract<TryPart, { type: \"route\" }>,\n columns: string[][],\n): Map<string, number> {\n const ways = new Map<string, number[]>();\n route.paths.forEach((path, p) =>\n path.forEach((node) => {\n const list = ways.get(node) ?? [];\n if (!list.includes(p)) list.push(p);\n ways.set(node, list);\n }),\n );\n const tall = Math.max(route.paths.length, ...columns.map((list) => list.length));\n const middle = (tall - 1) / 2;\n const shift = (tall - route.paths.length) / 2;\n /** 節ごとの、線でつながる節 */\n const linked = new Map<string, Set<string>>();\n for (const path of route.paths)\n path.forEach((node, i) => {\n for (const other of [path[i - 1], path[i + 1]]) {\n if (other === undefined) continue;\n const set = linked.get(node) ?? new Set<string>();\n set.add(other);\n linked.set(node, set);\n }\n });\n const lane = new Map<string, number>();\n for (const list of columns) {\n const wish = list.map((node) => {\n const way = ways.get(node) ?? [];\n return way.length === 1 ? shift + (way[0] ?? 0) : middle;\n });\n const sorted = [...wish].sort((a, b) => a - b);\n const apart = sorted.every((at, i) => i === 0 || at - (sorted[i - 1] ?? at) >= 1);\n if (apart) {\n list.forEach((node, k) => lane.set(node, wish[k] ?? middle));\n continue;\n }\n // 列は左から順に段を決めるので、段を持つつながる節は左の列の節\n const pull = list.map((node, k) => {\n const left = [...(linked.get(node) ?? [])].flatMap((other) => {\n const at = lane.get(other);\n return at === undefined ? [] : [at];\n });\n return left.length > 0 ? left.reduce((sum, at) => sum + at, 0) / left.length : (wish[k] ?? middle);\n });\n const ranked = list.map((node, k) => ({ node, k })).sort((a, b) => (pull[a.k] ?? 0) - (pull[b.k] ?? 0) || a.k - b.k);\n ranked.forEach(({ node }, rank) => lane.set(node, middle + rank - (list.length - 1) / 2));\n }\n return lane;\n}\n\n/** 図の上に置き場所を持つ部品 (網、待ち行列、機械の列、記録の列) */\ntype PlacedPart = Extract<TryPart, { type: \"route\" | \"queue\" | \"chain\" | \"log\" }>;\ntype LogPart = Extract<TryPart, { type: \"log\" }>;\n\n/** 試す図を並べる時の設定。`width` は描く枠の幅で、渡すと横に並べた形の字が読めない幅で縦に組む (#3366) */\nexport interface TryOptions {\n width?: number;\n}\n\nexport function layoutTry(\n diagram: DiagramModel,\n lang: NotationLang = DEFAULT_LANG,\n options: TryOptions = {},\n): TryLayout {\n const words = TRY_TEXT[lang];\n const spec = diagram.try ?? { parts: [], items: [] };\n const fields = askFields(spec.parts);\n const run = new TryRun(spec);\n const most = run.most;\n\n // 出来事を 1 つずつ当て、段ごとの状態と出来事ごとの状態を作る\n type Raw = Omit<TryMoment, \"chips\" | \"blocks\" | \"records\" | \"trip\"> & { tripItem?: string };\n const raws: Raw[] = [{ step: -1, event: -1, state: run.state() }];\n const states: TryState[] = [];\n diagram.steps.forEach((step, s) => {\n run.beginStep();\n step.events.forEach((event, k) => {\n const applied = run.apply(event);\n const state = run.state();\n const tripItem =\n applied.chip !== undefined && state.trips.some((t) => t.item === applied.chip)\n ? applied.chip\n : undefined;\n raws.push({\n step: s,\n event: k,\n state,\n ...(tripItem !== undefined ? { tripItem } : {}),\n ...(applied.block ? { built: applied.block } : {}),\n ...(applied.record ? { logged: applied.record } : {}),\n ...(applied.stop ? { stop: applied.stop } : {}),\n });\n });\n states.push(run.state());\n });\n\n // チップの名前と、待ち行列が並べる順の欄の値で、チップの幅を決める\n const orders = spec.parts\n .flatMap((p) => (p.type === \"queue\" && p.order !== undefined ? [fields.indexOf(p.order)] : []))\n .filter((at) => at >= 1);\n const valueField = orders[0];\n const names: Record<string, string> = {};\n let nameW = 0;\n let valueW = 0;\n for (const raw of raws)\n for (const [id, row] of Object.entries(raw.state.items)) {\n names[id] = row[0] ?? id;\n nameW = Math.max(nameW, textWidth(names[id] ?? \"\", TYPE.tryChip));\n if (valueField !== undefined)\n valueW = Math.max(valueW, textWidth(row[valueField] ?? \"\", TYPE.tryChipValue));\n }\n const chipW = Math.max(\n C.minW,\n C.padX * 2 + nameW + (valueField === undefined ? 0 : C.valueGap + valueW),\n );\n const pitch = C.h + C.gap;\n\n // ブロックの幅は、チップと prev と hash の行が入る幅\n const rowText =\n textWidth(\"prev\", TYPE.tryRowKey) +\n B.keyGap +\n textWidth(\"0000\", TYPE.tryRowValue) +\n B.rowPad * 2;\n const blockW = Math.max(B.w, chipW + B.padX * 2, rowText + B.padX * 2);\n\n // 記録の幅は、番号と印の札が並ぶ幅と、チップの名前と欄の値の行と、関門で止まった節の行とエラーの名前の行 (#3476、#3478) が入る幅 (#3441)\n const logParts = spec.parts.filter((p): p is LogPart => p.type === \"log\");\n const logField = (part: LogPart): number | undefined => {\n const at = part.all ? fields.indexOf(part.all.field) : -1;\n return at >= 1 ? at : valueField;\n };\n /** 関門の `into` の記録の列。記録に再試行できるかの印を出すので、印の札の場所を持つ */\n const gated = new Set((spec.checks ?? []).map((c) => c.into));\n const markTexts = (part: LogPart): string[] =>\n part.all ? [part.all.yes, part.all.no] : gated.has(part.id) ? [words.tryRetry, words.tryResend] : [];\n const markWidth = (part: LogPart): number | undefined => {\n const texts = markTexts(part);\n return texts.length > 0 ? L.markPadX * 2 + Math.max(...texts.map((t) => textWidth(t, TYPE.tryChipValue))) : undefined;\n };\n /** 記録の列の、関門で止まった記録 (#3476)。記録は足した後に変わらないので、どの時点で見ても同じ */\n const stoppedOf = (part: LogPart): TryRecord[] => {\n const last = raws[raws.length - 1]?.state.logs?.[part.id] ?? [];\n return last.filter((r) => r.node !== undefined);\n };\n const recordW = (part: LogPart): number => {\n const field = logField(part);\n let rowValueW = 0;\n if (field !== undefined)\n for (const raw of raws)\n for (const row of Object.values(raw.state.items))\n rowValueW = Math.max(rowValueW, textWidth(row[field] ?? \"\", TYPE.tryChipValue));\n const rowW = C.padX * 2 + nameW + (field === undefined ? 0 : C.valueGap + rowValueW);\n const stopW = stoppedOf(part).map(\n (r) => C.padX * 2 + Math.max(textWidth(words.tryStoppedAt(r.node ?? \"\"), TYPE.tryChip), textWidth(r.error ?? \"\", TYPE.tryChipValue)),\n );\n const labels = raws.flatMap((raw) => (raw.state.logs?.[part.id] ?? []).map((r) => textWidth(words.tryRecord(r.number), TYPE.tryBlockNo)));\n const mark = markWidth(part);\n const head = Math.max(0, ...labels) + (mark === undefined ? 0 : L.headGap + mark);\n return Math.max(L.w, rowW + B.padX * 2, ...stopW.map((w) => w + B.padX * 2), head + B.padX * 2);\n };\n const logW = new Map(logParts.map((p) => [p.id, recordW(p)]));\n const titles = spec.parts\n .filter((p) => p.type === \"route\" || p.type === \"queue\" || p.type === \"chain\" || p.type === \"log\")\n .map((p) => textWidth(p.id, TYPE.tryTitle));\n /** 記録の列を除いた部品が決める図の幅 */\n const base = Math.max(T.width, T.margin * 2 + T.shown * blockW + (T.shown - 1) * B.gap, T.margin * 2 + Math.max(0, ...titles));\n /**\n * 横に並べた形で 1 段に並べる記録の数 (#3478)。ほかの部品が決めた幅に収まる数だけ並べ、残りは次の段へ折り返す。\n * 並べる数を図の幅から決めるので、読み手が送って記録が増え、記録の幅が広がっても、図の幅は変わらない\n */\n const logColumns = (id: string): number =>\n Math.max(1, Math.min(T.shown, Math.floor((base - T.margin * 2 + L.gap) / ((logW.get(id) ?? L.w) + L.gap))));\n const logRowW = (id: string): number => {\n const n = logColumns(id);\n return n * (logW.get(id) ?? L.w) + (n - 1) * L.gap;\n };\n const wide = Math.max(base, ...logParts.map((p) => T.margin * 2 + logRowW(p.id)));\n const frame = options.width;\n /** 幅 `w` の図を枠に縮めても箱の名前の字が読める大きさに届くか。枠を渡さない時は縮めない */\n const readable = (w: number): boolean => frame === undefined || (frame / w) * TYPE.boxName.size >= READABLE_PX;\n const stacked = !readable(wide);\n\n // 待ち行列の横に出す、釦が上から何件を取り出すかの字と、その字が要る幅。2 つ以上の待ち行列から集める釦は、そのどれにも出す (#3453)\n const hintTextOf = (id: string): string | undefined => {\n const press = spec.parts.find(\n (p): p is Extract<TryPart, { type: \"press\" }> => p.type === \"press\" && fromsOf(p).includes(id),\n );\n return press ? words.tryTakes(press.take) : undefined;\n };\n const hintWidth = (text: string | undefined): number =>\n text === undefined ? 0 : T.queue.hintGap + textWidth(text, TYPE.tryHint);\n\n // side の行 (#3429)。同じ行に置いた時に部品が要る幅は、待ち行列はチップの列と字と題、機械の列は出すブロック、網は節の名札が重ならない間\n const placedParts = spec.parts.filter(\n (p): p is PlacedPart => p.type === \"route\" || p.type === \"queue\" || p.type === \"chain\" || p.type === \"log\",\n );\n const needOf = (part: PlacedPart): number => {\n const title = textWidth(part.id, TYPE.tryTitle);\n if (part.type === \"queue\") return Math.max(T.queue.padX * 2 + chipW + hintWidth(hintTextOf(part.id)), title);\n if (part.type === \"chain\") return Math.max(T.shown * blockW + (T.shown - 1) * B.gap, title);\n // 同じ行の記録の列は記録 1 つの幅だけを要る幅にし、残りの幅に入る数ずつ記録を並べる (#3506)。図全体の幅で並べる数を要ると、行が図の幅を超える\n if (part.type === \"log\") return Math.max(logW.get(part.id) ?? L.w, title);\n const labels = columnsOf(part).map((list) => Math.max(...list.map((id) => textWidth(id, TYPE.tryNode))));\n const apart = labels.slice(1).reduce((sum, w, c) => sum + ((labels[c] ?? 0) + w) / 2 + T.route.labelGap, 0);\n return Math.max(T.route.padX * 2 + apart, title);\n };\n const sideRows = (spec.sides ?? []).map((row) =>\n row.flatMap((id) => placedParts.filter((p) => p.id === id)),\n );\n const rowNeed = (row: PlacedPart[]): number =>\n row.reduce((sum, p) => sum + needOf(p), 0) + (row.length - 1) * T.gap;\n const sideWide = Math.max(wide, ...sideRows.map((row) => T.margin * 2 + rowNeed(row)));\n // 横に並べると字が読める大きさより小さくなる枠では、side の行を持たない時と同じ形にする\n const side = !stacked && sideRows.length > 0 && readable(sideWide);\n // 縦に組んだ形は枠の幅で描く。ブロックと右に回すつながりの印と部品の題が入る幅より狭い枠では、その幅で描く\n const width =\n stacked && frame !== undefined\n ? Math.max(\n frame,\n T.margin * 2 + blockW + B.side + T.link.badge / 2,\n T.margin * 2 + Math.max(0, ...titles),\n ...logParts.map((p) => T.margin * 2 + (logW.get(p.id) ?? L.w)),\n )\n : side\n ? sideWide\n : wide;\n const inner = width - T.margin * 2;\n\n // 部品を書いた順に行へまとめる。side の行の部品は、その中で最初に書いた部品の所に side の行の順で 1 つの行にまとめる\n const rowOf = new Map((side ? sideRows : []).flatMap((row) => row.map((p) => [p.id, row] as const)));\n const lines: PlacedPart[][] = [];\n const lined = new Set<string>();\n for (const part of placedParts) {\n if (lined.has(part.id)) continue;\n const line = rowOf.get(part.id) ?? [part];\n for (const p of line) lined.add(p.id);\n lines.push(line);\n }\n // 行の部品の幅。待ち行列は要る幅だけを取り、残りを網と機械の列に等しく分ける\n const spansOf = (line: PlacedPart[]): number[] => {\n if (line.length === 1) return [inner];\n const flexible = line.filter((p) => p.type !== \"queue\").length;\n const extra = inner - rowNeed(line);\n return line.map((p) => needOf(p) + (flexible === 0 ? extra / line.length : p.type === \"queue\" ? 0 : extra / flexible));\n };\n\n const parts: TryPartPlaced[] = [];\n const routes: TryRoutePlaced[] = [];\n const queues: TryQueuePlaced[] = [];\n const chains: TryChainPlaced[] = [];\n const logs: TryLogPlaced[] = [];\n let y: number = T.margin;\n const titleOf = (id: string, top: number, left: number): TryTitle => ({\n text: id,\n x: left,\n baseline: top + T.head.titleY,\n });\n for (const line of lines) {\n if (parts.length > 0) y += T.gap;\n const top = y;\n const body = top + T.head.body;\n const spans = spansOf(line);\n let left: number = T.margin;\n let lowest = top;\n for (const [k, part] of line.entries()) {\n const span = spans[k] ?? inner;\n if (part.type === \"route\") {\n const R = T.route;\n const columns = columnsOf(part);\n const lane = lanesOf(part, columns);\n const xs = new Map(\n columns.flatMap((list, c) =>\n list.map((id) => [\n id,\n columns.length === 1 ? left + span / 2 : left + R.padX + (c * (span - R.padX * 2)) / (columns.length - 1),\n ] as const),\n ),\n );\n // 一番上の段で、左の名札との間が `labelGap` より狭い名札を、左の名札が節の下に在る時だけ節の上へ逃がす (#3478)。\n // ぶつかり続ける並びは 1 つおきに上へ逃げ、ぶつからない名札は節の下のまま描く。\n // 下の段の名札は上の段の名札とぶつかるので逃がさない\n const topLane = Math.min(...[...xs.keys()].map((id) => lane.get(id) ?? 0));\n const half = (id: string): number => textWidth(id, TYPE.tryNode) / 2;\n const raised = new Set<string>();\n const topRow = [...xs.keys()].filter((id) => (lane.get(id) ?? 0) === topLane).sort((a, b) => (xs.get(a) ?? 0) - (xs.get(b) ?? 0));\n topRow.forEach((id, i) => {\n const prev = topRow[i - 1];\n if (prev !== undefined && !raised.has(prev) && (xs.get(id) ?? 0) - half(id) - (xs.get(prev) ?? 0) - half(prev) < R.labelGap) raised.add(id);\n });\n // 上へ逃がした名札が題の行とぶつからないよう、網の節を名札 1 行ぶん下げる\n const nodesTop = body + R.r + (raised.size > 0 ? R.upRow : 0);\n const nodes: TryNodePlaced[] = columns.flatMap((list) =>\n list.map((id) => ({\n id,\n x: xs.get(id) ?? left,\n y: nodesTop + (lane.get(id) ?? 0) * R.pitch,\n ...(id === part.from ? { end: \"from\" as const } : id === part.to ? { end: \"to\" as const } : {}),\n ...(raised.has(id) ? { label: \"above\" as const } : {}),\n })),\n );\n const at = new Map(nodes.map((n) => [n.id, n]));\n const links: TryNetLink[] = [];\n for (const path of part.paths)\n path.forEach((a, i) => {\n const b = path[i + 1];\n if (\n b === undefined ||\n links.some((l) => (l.a === a && l.b === b) || (l.a === b && l.b === a))\n )\n return;\n const p = at.get(a) as TryNodePlaced;\n const q = at.get(b) as TryNodePlaced;\n const len = Math.hypot(q.x - p.x, q.y - p.y) || 1;\n const ux = (q.x - p.x) / len;\n const uy = (q.y - p.y) / len;\n links.push({\n a,\n b,\n points: [\n [p.x + ux * R.r, p.y + uy * R.r],\n [q.x - ux * R.r, q.y - uy * R.r],\n ],\n });\n });\n const bottom = Math.max(...nodes.map((n) => n.y)) + R.labelY + R.bottom;\n routes.push({ id: part.id, title: titleOf(part.id, top, left), nodes, links });\n parts.push({\n id: part.id,\n type: \"route\",\n rect: { x: left, y: top, w: span, h: bottom - top },\n });\n lowest = Math.max(lowest, bottom);\n } else if (part.type === \"queue\") {\n const Q = T.queue;\n const hintText = hintTextOf(part.id);\n const hintW = hintWidth(hintText);\n const track = most * pitch - C.gap;\n const box = {\n x: left,\n y: body,\n w: stacked ? span : Math.min(span, Q.padX * 2 + chipW + hintW),\n h: Q.padY * 2 + track,\n };\n const slots = Array.from({ length: most }, (_, k) => ({\n x: box.x + Q.padX,\n y: box.y + Q.padY + k * pitch,\n w: chipW,\n h: C.h,\n }));\n const hint =\n hintText === undefined\n ? undefined\n : {\n text: hintText,\n x: box.x + Q.padX + chipW + Q.hintGap,\n baseline: box.y + Q.padY + C.h / 2 + LOOK.baseline.tag,\n };\n queues.push({\n id: part.id,\n title: titleOf(part.id, top, left),\n box,\n slots,\n ...(hint ? { hint } : {}),\n });\n parts.push({\n id: part.id,\n type: \"queue\",\n rect: { x: left, y: top, w: box.w, h: bottomOf(box) - top },\n most,\n });\n lowest = Math.max(lowest, bottomOf(box));\n } else if (part.type === \"log\") {\n const w = logW.get(part.id) ?? L.w;\n const records = raws.flatMap((raw) => raw.state.logs?.[part.id] ?? []);\n // 関門で止まった記録は、チップの行の下に止まった節の行とエラーの名前の行を持つ (#3476、#3478)\n const rows = Math.max(1, ...records.map((r) => r.items.length + (r.node === undefined ? 0 : 2)));\n const mark = markWidth(part);\n const head = mark === undefined ? B.noH : T.fold.h;\n const noBaseline = body + B.padTop + head / 2 + TYPE.tryBlockNo.size * 0.35;\n const rowTop = body + B.padTop + head + B.rowGap;\n const h = rowTop + rows * pitch - C.gap + B.padBottom - body;\n const numbers = new Set(records.map((r) => r.number));\n // 縦に組んだ形は 1 列に積み、横に並べた形は図の幅に収まる数ずつ並べて折り返す (#3478)\n // side の行に置いた記録の列は、割り当てた幅 (span) に入る数ずつ並べる (#3506)\n const inRow = (rowOf.get(part.id)?.length ?? 1) > 1;\n const columns = stacked\n ? 1\n : inRow\n ? Math.max(1, Math.min(T.shown, Math.floor((span + L.gap) / (w + L.gap))))\n : logColumns(part.id);\n // side の行の記録の列は 1 段に入る数だけを出し、それより古い記録は畳む (#3506)。段を足すと行が縦に伸び、同じ行のほかの部品の下が空く\n const keep = inRow ? columns : T.shown;\n if (keep < T.shown)\n for (const raw of raws) {\n const list = raw.state.logs?.[part.id] ?? [];\n list.forEach((r, i) => {\n r.shown = i >= list.length - keep;\n });\n }\n const folded = new Set(raws.map((raw) => Math.max(0, (raw.state.logs?.[part.id] ?? []).length - keep)));\n const field = logField(part);\n const stopped = stoppedOf(part);\n // 空ける段は、ここまでの段で一度に出た記録の数が要る分だけにする (#3506)。3 件分の段を常に空けると、記録の少ない間は記録の列の下が空く。\n // 記録がまだ 1 件も無い間は段を取らず題だけを置く\n const most = Math.max(0, ...raws.map((raw) => (raw.state.logs?.[part.id] ?? []).filter((r) => r.shown).length));\n const lines = Math.ceil(Math.min(T.shown, most) / columns);\n logs.push({\n id: part.id,\n title: titleOf(part.id, top, left),\n top: body,\n h,\n w,\n slots: Array.from({ length: T.shown }, (_, n): Point => [\n left + (n % columns) * (w + L.gap),\n body + Math.floor(n / columns) * (h + L.gap),\n ]),\n noBaseline,\n markY: body + B.padTop,\n ...(mark !== undefined ? { mark } : {}),\n rowTop,\n ...(field !== undefined ? { field } : {}),\n fold: {\n right: left + span,\n y: top + T.head.titleY - TYPE.tryTitle.size * 0.35 - T.fold.h / 2,\n },\n labels: Object.fromEntries([...numbers].map((n) => [n, words.tryRecord(n)])),\n folds: Object.fromEntries(\n [...folded].filter((n) => n > 0).map((n) => [n, words.tryFoldedRecords(n)]),\n ),\n ...(stopped.length > 0\n ? {\n stops: Object.fromEntries(\n stopped.map((r) => [\n r.number,\n { at: words.tryStoppedAt(r.node ?? \"\"), error: r.error ?? \"\", mark: r.retry ? words.tryRetry : words.tryResend, retry: r.retry === true },\n ]),\n ),\n }\n : {}),\n });\n const bottom = lines === 0 ? body : body + lines * h + (lines - 1) * L.gap;\n parts.push({ id: part.id, type: \"log\", rect: { x: left, y: top, w: span, h: bottom - top } });\n lowest = Math.max(lowest, bottom);\n } else {\n const rows = Math.max(\n 1,\n ...raws.flatMap((raw) => (raw.state.chains[part.id] ?? []).map((b) => b.items.length)),\n );\n const noBaseline = body + B.padTop + TYPE.tryBlockNo.size * 0.8;\n const prevY = body + B.padTop + B.noH + B.rowGap;\n const chipTop = prevY + B.row + B.rowGap;\n const rowsBottom = chipTop + rows * pitch - C.gap;\n const captionBaseline = rowsBottom + B.rowGap + B.sha * 0.75;\n const hashY = rowsBottom + B.rowGap + B.sha;\n const h = hashY + B.row + B.padBottom - body;\n const numbers = new Set(\n raws.flatMap((raw) => (raw.state.chains[part.id] ?? []).map((b) => b.number)),\n );\n const folded = new Set(\n raws.map((raw) => Math.max(0, (raw.state.chains[part.id] ?? []).length - T.shown)),\n );\n chains.push({\n id: part.id,\n title: titleOf(part.id, top, left),\n top: body,\n h,\n w: blockW,\n slots: Array.from({ length: T.shown }, (_, n): Point =>\n stacked ? [left, body + n * (h + B.gap)] : [left + n * (blockW + B.gap), body],\n ),\n noBaseline,\n prevY,\n chipTop,\n captionBaseline,\n hashY,\n // 畳んだ印は題の行の右端に、題の字の真ん中の高さで置く\n fold: {\n right: left + span,\n y: top + T.head.titleY - TYPE.tryTitle.size * 0.35 - T.fold.h / 2,\n },\n labels: Object.fromEntries([...numbers].map((n) => [n, words.tryBlock(n)])),\n folds: Object.fromEntries(\n [...folded].filter((n) => n > 0).map((n) => [n, words.tryFolded(n)]),\n ),\n });\n // 縦に組んだ形は出すブロックの数だけ席を積み、ブロックが足りない間も高さを変えない\n const bottom = stacked ? body + T.shown * h + (T.shown - 1) * B.gap : body + h;\n parts.push({\n id: part.id,\n type: \"chain\",\n rect: { x: left, y: top, w: span, h: bottom - top },\n });\n lowest = Math.max(lowest, bottom);\n }\n left += span + T.gap;\n }\n y = lowest;\n }\n\n // 出来事ごとのチップとブロックの左上。待ち行列の席か、出ているブロックの中の席に置く\n const queueOf = new Map(queues.map((q) => [q.id, q]));\n const chainOf = new Map(chains.map((c) => [c.id, c]));\n const routeOf = new Map(routes.map((r) => [r.id, r]));\n const logOf = new Map(logs.map((l) => [l.id, l]));\n const moments: TryMoment[] = raws.map(({ tripItem, ...raw }) => {\n const chips: Record<string, Point | null> = {};\n const blocks: Record<string, Point | null> = {};\n const records: Record<string, Point | null> = {};\n // 記録の中のチップは記録が行として描くので、チップの置き場所は持たない\n for (const [id, list] of Object.entries(raw.state.logs ?? {})) {\n const l = logOf.get(id);\n const first = list.length - list.filter((r) => r.shown).length;\n list.forEach((record, i) => {\n const slot = record.shown && l ? l.slots[i - first] : undefined;\n records[recordKey(id, record.number)] = slot === undefined ? null : [slot[0], slot[1]];\n });\n }\n for (const id of Object.keys(raw.state.items)) chips[id] = null;\n for (const [id, list] of Object.entries(raw.state.queues)) {\n const q = queueOf.get(id);\n list.forEach((item, k) => {\n const slot = q?.slots[k];\n if (slot) chips[item] = [slot.x, slot.y];\n });\n }\n for (const [id, list] of Object.entries(raw.state.chains)) {\n const c = chainOf.get(id);\n const first = list.length - list.filter((b) => b.shown).length;\n list.forEach((block, i) => {\n const slot = block.shown && c ? c.slots[i - first] : undefined;\n blocks[blockKey(id, block.number)] = slot === undefined || !c ? null : [slot[0], slot[1]];\n if (slot === undefined || !c) return;\n block.items.forEach((item, k) => {\n chips[item] = [slot[0] + B.padX, slot[1] + (c.chipTop - c.top) + k * pitch];\n });\n });\n }\n const trip =\n tripItem === undefined ? undefined : raw.state.trips.find((t) => t.item === tripItem);\n const route = trip ? routeOf.get(trip.route) : undefined;\n const points =\n trip && route\n ? trip.path.flatMap((node): Point[] => {\n const n = route.nodes.find((x) => x.id === node);\n return n ? [[n.x - chipW / 2, n.y - C.h / 2]] : [];\n })\n : [];\n return {\n ...raw,\n chips,\n blocks,\n ...(logs.length > 0 ? { records } : {}),\n ...(trip && points.length > 0\n ? { trip: { item: trip.item, route: trip.route, points } }\n : {}),\n };\n });\n\n return {\n kind: \"try\",\n arrangement: stacked ? \"stack\" : \"row\",\n width,\n height: y + T.margin,\n regions: [],\n boxes: [],\n lifelines: [],\n edges: [],\n labels: [],\n actions: [],\n // 段の番号は頁の部品 (再生の部品) が段の題と一緒に出すので、図の中には置かない\n badges: [],\n paths: [],\n ends: [],\n parts,\n states,\n moments,\n routes,\n queues,\n chains,\n ...(logs.length > 0 ? { logs } : {}),\n chip: { w: chipW, h: C.h },\n ...(valueField !== undefined ? { valueField } : {}),\n names,\n };\n}\n\n/**\n * 寄って追う窓が段 `step` で見る所 (#3337)。その段の出来事が触る部品の四角を、出来事が着く所から順に並べる。\n * 窓は最初の四角を外さずに全部を囲んだ所へ寄るので、最初の四角は読み手が結果を見る所にする。\n * 送った段は送った先の待ち行列と網、釦を押した段は作ったブロックと取り出した待ち行列 (2 つ以上なら書いた順に全て)、\n * 書き換えた段は書き換えたチップのブロックと次のブロックとのつながり、`line` は書いた待ち行列とブロック (待ち行列を先) を見る。\n * ブロックはその段の終わりの位置で見て、畳んだブロックは見ない\n */\nexport function tryFocusParts(layout: TryLayout, diagram: DiagramModel, step: number): Rect[] {\n const moments = layout.moments.filter((mo) => mo.step === step);\n const end = moments[moments.length - 1];\n if (!end) return [];\n const parts = diagram.try?.parts ?? [];\n const partRect = (id: string | undefined): Rect | undefined =>\n layout.parts.find((p) => p.id === id)?.rect;\n const blockRect = (chain: string, number: number): Rect | undefined => {\n const c = layout.chains.find((x) => x.id === chain);\n const at = end.blocks[blockKey(chain, number)];\n return c && at ? { x: at[0], y: at[1], w: c.w, h: c.h } : undefined;\n };\n const recordRect = (log: string, number: number): Rect | undefined => {\n const l = layout.logs?.find((x) => x.id === log);\n const at = end.records?.[recordKey(log, number)];\n return l && at ? { x: at[0], y: at[1], w: l.w, h: l.h } : undefined;\n };\n /** 窓から外さない所の候補、`line` がブロックに書いた所、続けて見る所 */\n const lead: Rect[] = [];\n const lines: Rect[] = [];\n const rest: Rect[] = [];\n const push = (list: Rect[], rect: Rect | undefined): void => {\n if (rect) list.push(rect);\n };\n (diagram.steps[step]?.events ?? []).forEach((event, k) => {\n const mo = moments.find((x) => x.event === k);\n const built = mo?.built\n ? blockRect(mo.built.chain, mo.built.number)\n : mo?.logged\n ? recordRect(mo.logged.log, mo.logged.number)\n : undefined;\n if (event.type === \"line\" && \"part\" in event) {\n if (built) lines.push(built);\n else push(lead, partRect(event.part));\n } else if (event.type === \"ask\") {\n const ask = parts.find((p): p is Extract<TryPart, { type: \"ask\" }> => p.type === \"ask\");\n // 関門で止まったチップ (#3476) は待ち行列に入らず、関門の記録の列の記録になる\n push(lead, mo?.stop ? built : partRect(ask ? intoOf(ask, event.values, (id) => parts.some((p) => p.id === id)) : undefined));\n if (mo?.trip) push(rest, partRect(mo.trip.route));\n } else if (event.type === \"press\") {\n const press = parts.find(\n (p): p is Extract<TryPart, { type: \"press\" }> => p.type === \"press\" && p.id === event.press,\n );\n push(lead, built);\n for (const from of press ? fromsOf(press) : []) push(rest, partRect(from));\n } else if (event.type === \"item\") {\n const [chain, block] =\n Object.entries(end.state.chains).flatMap(([id, list]) =>\n list.filter((b) => b.items.includes(event.item)).map((b) => [id, b] as const),\n )[0] ?? [];\n const here = chain !== undefined && block ? blockRect(chain, block.number) : undefined;\n if (chain !== undefined && block && here) {\n lead.push(here);\n const next = blockRect(chain, block.number + 1);\n // つながりの印は、横に並べた形ではこのブロックの右端と次のブロックの左端の間に在り、\n // 縦に組んだ形ではこのブロックの下の端と次のブロックの上の端の間の、ブロックの右に在る\n if (next)\n rest.push(\n layout.arrangement === \"stack\"\n ? { x: here.x + here.w, y: here.y + here.h, w: B.side + T.link.badge / 2, h: next.y - here.y - here.h }\n : { x: here.x + here.w, y: here.y, w: next.x - here.x - here.w, h: here.h },\n );\n } else {\n const queue = Object.entries(end.state.queues).find(([, list]) =>\n list.includes(event.item),\n )?.[0];\n push(lead, partRect(queue));\n }\n }\n });\n return [...lead, ...lines, ...rest];\n}\n\n/** 全体図に描く試す図の部品 (#3337)。網の節と待ち行列の枠と、最後の時点に出ているブロックと記録 */\nexport function tryOverview(layout: TryLayout): TryOverviewShape[] {\n const color = T.color.part;\n const last = layout.moments[layout.moments.length - 1];\n const r = T.route.r;\n return [\n ...layout.queues.map((q) => ({ rect: q.box, band: true, color })),\n ...layout.routes.flatMap((route) =>\n route.nodes.map((n) => ({\n rect: { x: n.x - r, y: n.y - r, w: r * 2, h: r * 2 },\n band: false,\n color,\n })),\n ),\n ...layout.chains.flatMap((c) =>\n (last?.state.chains[c.id] ?? []).flatMap((b) => {\n const at = last?.blocks[blockKey(c.id, b.number)];\n return at ? [{ rect: { x: at[0], y: at[1], w: c.w, h: c.h }, band: false, color }] : [];\n }),\n ),\n ...(layout.logs ?? []).flatMap((l) =>\n (last?.state.logs?.[l.id] ?? []).flatMap((r) => {\n const at = last?.records?.[recordKey(l.id, r.number)];\n return at ? [{ rect: { x: at[0], y: at[1], w: l.w, h: l.h }, band: false, color }] : [];\n }),\n ),\n ];\n}\n","/**\n * 機械の列の描き方 (#3337、#3348)。\n *\n * ブロックは新しい方から 3 つを左から古い順に並べ、ブロックが足されると左へ滑り、古いブロックは消えて畳んだ印に数える。\n * 狭い枠で縦に組んだ形 (#3366) は上から古い順に積み、ブロックが足されると上へ滑る。つながりはブロックの右を回して引く。\n * ブロックの中の字は番号と prev と hash の頭の 4 字で、hash は書き換えた段から新しい値に替わる。\n * ブロックの間のつながりは prev が前のブロックの今の hash と同じ間は `=`、違う間は橙の `≠` を出す。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { blockKey, type TryChainPlaced, type TryMoment } from \"../../kinds/try/layout\";\nimport { hasWide, textBox } from \"../../layout/measure\";\nimport { TRY_LOOK } from \"../../look/try\";\nimport { LOOK, TYPE } from \"../../look/values\";\nimport { frameShape, partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { esc, pathOf, r1, sansOf, write } from \"../../render/parts\";\nimport type { TryKit, TryRest, TryWindow } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\n\nconst T = TRY_LOOK;\nconst B = T.block;\nconst C = T.chip;\n\n/** 機械の列ごとの題と、ブロックとつながりと畳んだ印 */\nexport function chainRows(k: TryKit): void {\n const { layout, title, base, node } = k;\n for (const chain of layout.chains) {\n base.push(\n `<g data-part=\"${esc(chain.id)}\" style=\"${cs(T.color.part)}\">${title(chain.title)}</g>`,\n );\n node.push(drawChain(k, chain));\n }\n}\n\n/** 機械の列 1 つ。ブロックは左上を原点に描いて出来事ごとの位置へ動かし、つながりは後ろのブロックと一緒に動く */\nfunction drawChain(k: TryKit, chain: TryChainPlaced): string {\n const { ctx, moments, windows, spanOf, track, phasesOf, shownKf, phased, record, cls } = k;\n const { m } = ctx;\n const numbers = [\n ...new Set(moments.flatMap((mo) => (mo.state.chains[chain.id] ?? []).map((b) => b.number))),\n ].sort((a, b) => a - b);\n const blockOf = (mo: TryMoment, n: number) =>\n (mo.state.chains[chain.id] ?? []).find((b) => b.number === n);\n const rowW = chain.w - B.padX * 2;\n const rowText = B.row / 2 + LOOK.baseline.tag + 1;\n const row = (\n y: number,\n key: string,\n values: string[],\n strong: boolean,\n rests: TryRest[],\n ): string => {\n const keyX = B.padX + B.rowPad;\n const valueX = keyX + textBox(key, 0, 0, TYPE.tryRowKey).w + B.keyGap;\n record(key, TYPE.tryRowKey, rests, keyX, y + rowText);\n for (const p of phasesOf(values))\n record(p.value, TYPE.tryRowValue, rests, valueX, y + rowText, \"start\", [p.from, p.to]);\n return (\n `<rect class=\"${strong ? \"dg-try-hrow\" : \"dg-try-row\"}\" x=\"${B.padX}\" y=\"${r1(y)}\" width=\"${r1(rowW)}\" height=\"${B.row}\" rx=\"${partRadius(ctx.corner, B.rowRadius)}\"/>` +\n `<text class=\"dg-try-rk\" x=\"${r1(keyX)}\" y=\"${r1(y + rowText)}\">${key}</text>${phased(values, valueX, y + rowText, strong ? \"dg-try-rv dg-try-hv\" : \"dg-try-rv\")}`\n );\n };\n const blocks = numbers.map((n) => {\n const key = blockKey(chain.id, n);\n const moved = track(moments.map((mo) => mo.blocks[key] ?? null));\n const box = { x: 0, y: 0, w: chain.w, h: chain.h };\n const frame = frameShape(\n ctx.corner,\n ` class=\"dg-try-blk\" ${ctx.sh}`,\n box,\n `<rect class=\"dg-try-blk\" width=\"${r1(chain.w)}\" height=\"${r1(chain.h)}\" rx=\"${B.radius}\" ${ctx.sh}/>`,\n );\n const builtAt = moments.findIndex(\n (mo) => mo.built?.chain === chain.id && mo.built.number === n,\n );\n const ring =\n builtAt < 0\n ? \"\"\n : `<g class=\"dg-a\" style=\"${m.vis((windows[builtAt] as TryWindow).b, spanOf(moments[builtAt]?.step ?? 0).end)}\">${frameShape(ctx.corner, ' class=\"dg-halo\"', box, `<rect class=\"dg-halo\" width=\"${r1(chain.w)}\" height=\"${r1(chain.h)}\" rx=\"${B.radius}\"/>`)}${frameShape(ctx.corner, ' class=\"dg-on\"', box, `<rect class=\"dg-on\" width=\"${r1(chain.w)}\" height=\"${r1(chain.h)}\" rx=\"${B.radius}\"/>`)}</g>`;\n const label = chain.labels[n] ?? String(n);\n const no = write(\n undefined,\n cls(\"dg-try-no\", label),\n B.padX,\n chain.noBaseline - chain.top,\n label,\n TYPE.tryBlockNo,\n );\n record(\n label,\n hasWide(label) ? sansOf(TYPE.tryBlockNo) : TYPE.tryBlockNo,\n moved.rests,\n B.padX,\n chain.noBaseline - chain.top,\n );\n const prevs = moments.map((mo) => (blockOf(mo, n)?.prev ?? \"\").slice(0, 4));\n const hashes = moments.map((mo) => (blockOf(mo, n)?.hash ?? \"\").slice(0, 4));\n const caption = `<text class=\"dg-try-cap\" x=\"${B.padX}\" y=\"${r1(chain.captionBaseline - chain.top)}\">SHA-256</text>`;\n record(\"SHA-256\", TYPE.tryCaption, moved.rests, B.padX, chain.captionBaseline - chain.top);\n return `<g class=\"dg-a\" data-block=\"${n}\" data-chain=\"${esc(chain.id)}\" style=\"${moved.style}\">${frame}${ring}${no}${row(chain.prevY - chain.top, \"prev\", prevs, false, moved.rests)}${caption}${row(chain.hashY - chain.top, \"hash\", hashes, true, moved.rests)}</g>`;\n });\n\n // つながり。後ろのブロックの左上を原点に、前のブロックの hash の行の右端から後ろのブロックの prev の行まで引く。\n // 横に並べた形は 2 つのブロックの間を通って prev の行の左端へ、縦に組んだ形はブロックの右を回って prev の行の右端へ引く\n const hashMid = chain.hashY - chain.top + B.row / 2;\n const prevMid = chain.prevY - chain.top + B.row / 2;\n const stacked = k.layout.arrangement === \"stack\";\n const rowEnd = chain.w - B.padX;\n const above = hashMid - chain.h - B.gap;\n const midX = stacked ? chain.w + B.side : -B.gap / 2;\n const elbow = pathOf(\n stacked\n ? [\n [rowEnd, above],\n [midX, above],\n [midX, prevMid],\n [rowEnd, prevMid],\n ]\n : [\n [-B.gap - B.padX, hashMid],\n [midX, hashMid],\n [midX, prevMid],\n [B.padX, prevMid],\n ],\n ctx.corner,\n );\n const badge = T.link.badge;\n const badgeY = stacked ? (above + prevMid) / 2 : (hashMid + prevMid) / 2;\n const links = numbers\n .filter((n) => n > 1)\n .map((n) => {\n const key = blockKey(chain.id, n);\n const before = blockKey(chain.id, n - 1);\n const positions = moments.map((mo) =>\n mo.blocks[before] ? (mo.blocks[key] ?? null) : null,\n );\n const moved = track(positions);\n const status = moments.map((mo, k) => (positions[k] ? (blockOf(mo, n)?.link ?? \"ok\") : \"\"));\n const phases = phasesOf(status).filter((p) => p.value !== \"\");\n const kinds = [...new Set(phases.map((p) => p.value))];\n const variant = (kind: string): string => {\n const broken = kind === \"broken\";\n const ranges: Shown[] = phases.filter((p) => p.value === kind).map((p) => [p.from, p.to]);\n const anim =\n kinds.length > 1\n ? ` class=\"dg-a\" style=\"${cs(broken ? T.color.broken : T.color.part)};${shownKf(ranges)}\"`\n : ` style=\"${cs(broken ? T.color.broken : T.color.part)}\"`;\n const symbol = broken ? \"≠\" : \"=\";\n return (\n `<g data-link-state=\"${kind}\"${anim}><path class=\"dg-try-ln\" d=\"${elbow}\"/>` +\n `<rect class=\"dg-try-lb\" x=\"${r1(midX - badge / 2)}\" y=\"${r1(badgeY - badge / 2)}\" width=\"${badge}\" height=\"${badge}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>` +\n `<text class=\"dg-try-lt\" x=\"${r1(midX)}\" y=\"${r1(badgeY + LOOK.baseline.label)}\" text-anchor=\"middle\">${symbol}</text></g>`\n );\n };\n return `<g class=\"dg-a\" data-link=\"${n - 1}-${n}\" data-chain=\"${esc(chain.id)}\" style=\"${moved.style}\">${kinds.map(variant).join(\"\")}</g>`;\n });\n\n // 畳んだ印。畳んだ数ごとに字を替え、畳んだブロックが無い間は出さない\n const counts = moments.map((mo) => {\n const list = mo.state.chains[chain.id] ?? [];\n return list.filter((b) => !b.shown).length;\n });\n const foldPhases = phasesOf(counts).filter((p) => p.value > 0);\n const fold =\n foldPhases.length === 0\n ? \"\"\n : `<g data-fold=\"${esc(chain.id)}\">${foldPhases\n .map((p) => {\n const text = chain.folds[p.value] ?? String(p.value);\n const w =\n textBox(text, 0, 0, hasWide(text) ? sansOf(TYPE.tryHint) : TYPE.tryHint).w +\n T.fold.padX * 2;\n const x = chain.fold.right - w;\n const rect = { x, y: chain.fold.y, w, h: T.fold.h };\n const label = write(\n ctx.ink,\n cls(\"dg-try-ft\", text),\n x + T.fold.padX,\n chain.fold.y + T.fold.h / 2 + LOOK.baseline.tag,\n text,\n hasWide(text) ? sansOf(TYPE.tryHint) : TYPE.tryHint,\n [[p.from, p.to]],\n );\n return `<g class=\"dg-a\" style=\"${shownKf([[p.from, p.to]])}\">${frameShape(ctx.corner, ' class=\"dg-try-fold\"', rect, `<rect class=\"dg-try-fold\" x=\"${r1(x)}\" y=\"${r1(rect.y)}\" width=\"${r1(w)}\" height=\"${T.fold.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>`)}${label}</g>`;\n })\n .join(\"\")}</g>`;\n return `<g data-chain-row=\"${esc(chain.id)}\" style=\"${cs(T.color.part)}\">${blocks.join(\"\")}${links.join(\"\")}${fold}</g>`;\n}\n","/**\n * 記録の列の描き方 (#3441)。\n *\n * 記録は新しい方から 3 つを左から古い順に並べ、記録が足されると左へ滑り、古い記録は消えて畳んだ印に数える。\n * 狭い枠で縦に組んだ形は上から古い順に積み、記録が足されると上へ滑る。機械の列と違って、記録の間につながりを引かない。\n * 記録の中の字は番号と、`all` を書いた記録の列の印と、中のチップの名前と欄の値の行だけで、prev と hash と SHA-256 を出さない。\n * 印と欄の値は、書き換えた段から新しい値に替わる。印は `yes` の印を部品の色、`no` の印を橙で出す。\n * 網の節の関門で止まった記録 (#3476) は、印の札に再試行できるかの印 (再試行できるは橙、直して送り直すは止まった色) を出し、\n * チップの行の下に止まった節の行とエラーの名前の行を分けて止まった色で出す (#3478)。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない。\n */\nimport { recordKey, type TryLogPlaced, type TryMoment } from \"../../kinds/try/layout\";\nimport { hasWide, textBox } from \"../../layout/measure\";\nimport { TRY_LOOK } from \"../../look/try\";\nimport { LOOK, TYPE } from \"../../look/values\";\nimport { frameShape, partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { esc, r1, sansOf, write } from \"../../render/parts\";\nimport type { TryKit, TryWindow } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\n\nconst T = TRY_LOOK;\nconst B = T.block;\nconst C = T.chip;\n\n/** 記録の列ごとの題と、記録と畳んだ印 */\nexport function logRows(k: TryKit): void {\n const { layout, title, base, node } = k;\n for (const log of layout.logs ?? []) {\n base.push(`<g data-part=\"${esc(log.id)}\" style=\"${cs(T.color.part)}\">${title(log.title)}</g>`);\n node.push(drawLog(k, log));\n }\n}\n\n/** 記録の列 1 つ。記録は左上を原点に描いて出来事ごとの位置へ動かす */\nfunction drawLog(k: TryKit, log: TryLogPlaced): string {\n const { ctx, layout, diagram, moments, windows, spanOf, track, phasesOf, shownKf, phased, record, cls } = k;\n const { m } = ctx;\n const part = diagram.try?.parts.find((p) => p.type === \"log\" && p.id === log.id);\n const all = part?.type === \"log\" ? part.all : undefined;\n const numbers = [\n ...new Set(moments.flatMap((mo) => (mo.state.logs?.[log.id] ?? []).map((r) => r.number))),\n ].sort((a, b) => a - b);\n const recordOf = (mo: TryMoment, n: number) =>\n (mo.state.logs?.[log.id] ?? []).find((r) => r.number === n);\n const pitch = C.h + C.gap;\n const baseline = C.h / 2 + LOOK.baseline.tag;\n const rowW = log.w - B.padX * 2;\n\n const records = numbers.map((n) => {\n const moved = track(moments.map((mo) => mo.records?.[recordKey(log.id, n)] ?? null));\n const box = { x: 0, y: 0, w: log.w, h: log.h };\n const frame = frameShape(\n ctx.corner,\n ` class=\"dg-try-blk\" ${ctx.sh}`,\n box,\n `<rect class=\"dg-try-blk\" width=\"${r1(log.w)}\" height=\"${r1(log.h)}\" rx=\"${B.radius}\" ${ctx.sh}/>`,\n );\n const loggedAt = moments.findIndex((mo) => mo.logged?.log === log.id && mo.logged.number === n);\n const ring =\n loggedAt < 0\n ? \"\"\n : `<g class=\"dg-a\" style=\"${m.vis((windows[loggedAt] as TryWindow).b, spanOf(moments[loggedAt]?.step ?? 0).end)}\">${frameShape(ctx.corner, ' class=\"dg-halo\"', box, `<rect class=\"dg-halo\" width=\"${r1(log.w)}\" height=\"${r1(log.h)}\" rx=\"${B.radius}\"/>`)}${frameShape(ctx.corner, ' class=\"dg-on\"', box, `<rect class=\"dg-on\" width=\"${r1(log.w)}\" height=\"${r1(log.h)}\" rx=\"${B.radius}\"/>`)}</g>`;\n const label = log.labels[n] ?? String(n);\n const noY = log.noBaseline - log.top;\n const no = write(undefined, cls(\"dg-try-no\", label), B.padX, noY, label, TYPE.tryBlockNo);\n record(label, hasWide(label) ? sansOf(TYPE.tryBlockNo) : TYPE.tryBlockNo, moved.rests, B.padX, noY);\n\n // 印の札。印が替わる時刻で区切り、yes の印と no の印で色を替える。関門で止まった記録は再試行できるかの印を出す (#3476)\n let mark = \"\";\n const markW = log.mark;\n const stop = log.stops?.[n];\n if ((all || stop) && markW !== undefined) {\n const marks = moments.map((mo) => (all ? (recordOf(mo, n)?.mark ?? \"\") : recordOf(mo, n) && stop ? stop.mark : \"\"));\n const phases = phasesOf(marks).filter((p) => p.value !== \"\");\n const x = log.w - B.padX - markW;\n const y = log.markY - log.top;\n const rect = { x, y, w: markW, h: T.fold.h };\n const textY = y + T.fold.h / 2 + LOOK.baseline.tag;\n const kinds = [...new Set(phases.map((p) => p.value))];\n mark = kinds\n .map((kind) => {\n const ranges: Shown[] = phases.filter((p) => p.value === kind).map((p) => [p.from, p.to]);\n const color = all ? (kind === all.yes ? T.color.part : T.color.broken) : stop?.retry ? T.color.broken : T.color.stop;\n const style = hasWide(kind) ? sansOf(TYPE.tryChipValue) : TYPE.tryChipValue;\n for (const [from, to] of ranges)\n record(kind, style, moved.rests, x + markW / 2, textY, \"middle\", [from, to]);\n const anim = kinds.length > 1 ? ` class=\"dg-a\" style=\"${cs(color)};${shownKf(ranges)}\"` : ` style=\"${cs(color)}\"`;\n return (\n `<g data-mark=\"${esc(kind)}\"${anim}>` +\n frameShape(ctx.corner, ' class=\"dg-try-mb\"', rect, `<rect class=\"dg-try-mb\" x=\"${r1(x)}\" y=\"${r1(y)}\" width=\"${r1(markW)}\" height=\"${T.fold.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>`) +\n `<text class=\"${cls(\"dg-try-mk\", kind)}\" x=\"${r1(x + markW / 2)}\" y=\"${r1(textY)}\" text-anchor=\"middle\">${esc(kind)}</text></g>`\n );\n })\n .join(\"\");\n }\n\n // 中のチップの行。名前を左に、欄の値を右に出す。記録の中身は作った後に変わらず、欄の値だけが書き換えで替わる\n const items = recordOf(moments.find((mo) => recordOf(mo, n)) ?? (moments[0] as TryMoment), n)?.items ?? [];\n const rows = items\n .map((id, i) => {\n const y = log.rowTop - log.top + i * pitch;\n const name = layout.names[id] ?? id;\n const nameStyle = hasWide(name) ? sansOf(TYPE.tryChip) : TYPE.tryChip;\n const nameText = write(undefined, cls(\"dg-try-cn\", name), B.padX + C.padX, y + baseline, name, TYPE.tryChip);\n record(name, nameStyle, moved.rests, B.padX + C.padX, y + baseline);\n const field = log.field;\n const values = field === undefined ? [] : moments.map((mo) => mo.state.items[id]?.[field] ?? \"\");\n const valueX = log.w - B.padX - C.padX;\n const valueText = field === undefined ? \"\" : phased(values, valueX, y + baseline, cls(\"dg-try-cv\", values.join(\"\")), \"end\");\n for (const p of phasesOf(values)) {\n const style = hasWide(p.value) ? sansOf(TYPE.tryChipValue) : TYPE.tryChipValue;\n record(p.value, style, moved.rests, valueX - textBox(p.value, 0, 0, style).w, y + baseline, \"start\", [p.from, p.to]);\n }\n return `<g data-item=\"${esc(id)}\"><rect class=\"dg-try-row\" x=\"${B.padX}\" y=\"${r1(y)}\" width=\"${r1(rowW)}\" height=\"${C.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>${nameText}${valueText}</g>`;\n })\n .join(\"\");\n // 関門で止まった記録の、止まった節の行とエラーの名前の行。チップの行の下に 1 行ずつ分けて止まった色で出す (#3476、#3478)\n const stopRows = stop\n ? `<g style=\"${cs(T.color.stop)}\">${[\n { text: stop.at, base: \"dg-try-cn\", style: TYPE.tryChip },\n { text: stop.error, base: \"dg-try-cv\", style: TYPE.tryChipValue },\n ]\n .map(({ text, base, style }, k) => {\n const y = log.rowTop - log.top + (items.length + k) * pitch;\n record(text, hasWide(text) ? sansOf(style) : style, moved.rests, B.padX + C.padX, y + baseline);\n return `<rect class=\"dg-try-hrow\" x=\"${B.padX}\" y=\"${r1(y)}\" width=\"${r1(rowW)}\" height=\"${C.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>${write(undefined, cls(base, text), B.padX + C.padX, y + baseline, text, style)}`;\n })\n .join(\"\")}</g>`\n : \"\";\n return `<g class=\"dg-a\" data-record=\"${n}\" style=\"${moved.style}\">${frame}${ring}${no}${mark}${rows}${stopRows}</g>`;\n });\n\n // 畳んだ印。畳んだ数ごとに字を替え、畳んだ記録が無い間は出さない\n const counts = moments.map((mo) => (mo.state.logs?.[log.id] ?? []).filter((r) => !r.shown).length);\n const foldPhases = phasesOf(counts).filter((p) => p.value > 0);\n const fold =\n foldPhases.length === 0\n ? \"\"\n : `<g data-fold=\"${esc(log.id)}\">${foldPhases\n .map((p) => {\n const text = log.folds[p.value] ?? String(p.value);\n const style = hasWide(text) ? sansOf(TYPE.tryHint) : TYPE.tryHint;\n const w = textBox(text, 0, 0, style).w + T.fold.padX * 2;\n const x = log.fold.right - w;\n const rect = { x, y: log.fold.y, w, h: T.fold.h };\n const label = write(ctx.ink, cls(\"dg-try-ft\", text), x + T.fold.padX, log.fold.y + T.fold.h / 2 + LOOK.baseline.tag, text, style, [[p.from, p.to]]);\n return `<g class=\"dg-a\" style=\"${shownKf([[p.from, p.to]])}\">${frameShape(ctx.corner, ' class=\"dg-try-fold\"', rect, `<rect class=\"dg-try-fold\" x=\"${r1(x)}\" y=\"${r1(rect.y)}\" width=\"${r1(w)}\" height=\"${T.fold.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>`)}${label}</g>`;\n })\n .join(\"\")}</g>`;\n return `<g data-log=\"${esc(log.id)}\" style=\"${cs(T.color.part)}\">${records.join(\"\")}${fold}</g>`;\n}\n","/**\n * 待ち行列の描き方 (#3337、#3348)。\n *\n * 待ち行列の題と枠と、釦が上から何件を取り出すかの字を、動かさずに描く。中で待つチップは入力の帯のブロックの描き方が描く。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { TRY_LOOK } from \"../../look/try\";\nimport { TYPE } from \"../../look/values\";\nimport { frameShape } from \"../../render/corner\";\nimport { esc, r1, write } from \"../../render/parts\";\nimport type { TryKit } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\n\nconst T = TRY_LOOK;\nconst B = T.block;\n\n/** 待ち行列ごとの題と枠と、釦が上から何件を取り出すかの字 */\nexport function queueFrames(k: TryKit): void {\n const { layout, ctx, title, base } = k;\n for (const queue of layout.queues) {\n const placed = layout.parts.find((p) => p.id === queue.id);\n const box = frameShape(\n ctx.corner,\n ` class=\"dg-try-q\"`,\n queue.box,\n `<rect class=\"dg-try-q\" x=\"${r1(queue.box.x)}\" y=\"${r1(queue.box.y)}\" width=\"${r1(queue.box.w)}\" height=\"${r1(queue.box.h)}\" rx=\"${B.radius}\"/>`,\n );\n const hint = queue.hint\n ? write(\n ctx.ink,\n \"dg-try-hint\",\n queue.hint.x,\n queue.hint.baseline,\n queue.hint.text,\n TYPE.tryHint,\n )\n : \"\";\n base.push(\n `<g data-part=\"${esc(queue.id)}\" data-most=\"${placed?.most ?? queue.slots.length}\" style=\"${cs(T.color.part)}\">${title(queue.title)}${box}${hint}</g>`,\n );\n }\n}\n","/**\n * 網の描き方 (#3337、#3348)。\n *\n * 部品の題と網の線と節は動かさずに描き、送る側 (`from`) の節は人の絵、作る人 (`to`) の節は箱の絵、ほかの節は機械の絵を丸に載せる。\n * 名札は節の下に描き、隣の名札とぶつかるので上へ逃がした節 (#3478) だけ節の上に描く。\n * 網の線は描いた線の記録 (`traces`) にも足し、線が名札を横切ると字の重なりと崩れの確かめが知らせる (#3524)。\n * 網を運ばれたチップが通った線は、送った段の間だけ強める。\n * 関門で止まったチップ (#3476) の節には、チップが着いた時刻 (`move`) から段の終わりまで輪の印 (`data-stop`) を出す。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { hasWide } from \"../../layout/measure\";\nimport type { Point } from \"../../layout/scene\";\nimport { TRY_LOOK } from \"../../look/try\";\nimport { TYPE } from \"../../look/values\";\nimport { ALWAYS } from \"../../render/ink\";\nimport { esc, pathOf, r1, sansOf, write } from \"../../render/parts\";\nimport type { TryKit, TryWindow } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\nimport { glyph } from \"../icon/draw\";\n\nconst T = TRY_LOOK;\n\n/** 網ごとの題と線と節と、送った段の間だけ強める通った線と、関門で止まった節の印 */\nexport function routeNet(k: TryKit): void {\n const { layout, ctx, moments, windows, spanOf, title, cls, base, lit, node } = k;\n const { m } = ctx;\n for (const route of layout.routes) {\n const stops = moments\n .map((mo, k) => {\n const at = mo.stop?.route === route.id ? route.nodes.find((n) => n.id === mo.stop?.node) : undefined;\n if (!at) return \"\";\n const w = windows[k] as TryWindow;\n return `<g class=\"dg-a\" data-stop=\"${esc(at.id)}\" style=\"${cs(T.color.stop)};${m.vis(w.move, spanOf(mo.step).end)}\"><circle class=\"dg-try-stop\" cx=\"${r1(at.x)}\" cy=\"${r1(at.y)}\" r=\"${T.route.r + T.route.stop}\"/></g>`;\n })\n .join(\"\");\n const links = route.links\n .map((l) => {\n // 線の両端は節の名前で呼ぶ。網の線は初めから最後まで見えている\n ctx.traces.push({ from: l.a, to: l.b, points: l.points, shown: ALWAYS });\n return `<path class=\"dg-try-net\" d=\"${pathOf(l.points, ctx.corner)}\"/>`;\n })\n .join(\"\");\n const nodes = route.nodes\n .map((n) => {\n const end = n.end !== undefined;\n const icon = n.end === \"from\" ? \"user\" : n.end === \"to\" ? \"block\" : \"server\";\n const label = write(\n ctx.ink,\n `${cls(\"dg-try-nt\", n.id)}${end ? \" dg-try-nte\" : \"\"}`,\n n.x,\n n.label === \"above\" ? n.y - T.route.labelUp : n.y + T.route.labelY,\n n.id,\n hasWide(n.id) ? sansOf(TYPE.tryNode) : TYPE.tryNode,\n ALWAYS,\n \"middle\",\n );\n return `<g data-node=\"${esc(n.id)}\"><circle class=\"${end ? \"dg-try-end\" : \"dg-try-node\"}\" cx=\"${r1(n.x)}\" cy=\"${r1(n.y)}\" r=\"${T.route.r}\"/>${glyph(icon, n.x, n.y, T.route.glyph, end ? \"dg-gl\" : \"dg-try-ng\")}${label}</g>`;\n })\n .join(\"\");\n base.push(\n `<g data-part=\"${esc(route.id)}\" style=\"${cs(T.color.part)}\">${title(route.title)}${links}</g>`,\n );\n node.push(`<g data-route=\"${esc(route.id)}\" style=\"${cs(T.color.part)}\">${nodes}${stops}</g>`);\n moments.forEach((mo, k) => {\n if (mo.trip?.route !== route.id) return;\n const at = new Map(route.nodes.map((n) => [n.id, n]));\n const path = mo.state.trips.find((t) => t.item === mo.trip?.item)?.path ?? [];\n const points = path.flatMap((id): Point[] => {\n const n = at.get(id);\n return n ? [[n.x, n.y]] : [];\n });\n if (points.length < 2) return;\n const w = windows[k] as TryWindow;\n lit.push(\n `<path class=\"dg-try-trip dg-a\" data-trip=\"${esc(mo.trip.item)}\" d=\"${pathOf(points, ctx.corner)}\" style=\"${cs(T.color.part)};${m.vis(w.a, spanOf(mo.step).end)}\"/>`,\n );\n });\n }\n}\n","/**\n * 試す図 (#3337) を描く部品。見た目の元は承認した板 (網を上に、待ち行列と、prev と hash を `=` でつないだ機械の列を下に置く形)。\n *\n * 出来事ごとの時刻と、出来事ごとの位置を辿る動きと、時点ごとに替わる字を描く状態 (`TryKit`) に組み、\n * 網、待ち行列、機械の列、入力の帯のブロックの描き方 (`blocks/<名前>/draw.ts`) を層の順に呼ぶ (#3348)。\n * 呼ぶ順は網、待ち行列、機械の列、チップ、記録の列で、この順が動きの名前の番号を決める。見た目の規則 (`TRY_CSS`) は試す図の SVG にだけ書く。\n * 書き手の段を全て描くので、書き出しと印刷は書き手の例の段を描く。最後の段の止め絵は最後の段の状態。\n */\nimport { tryChips } from \"../blocks/ask/draw\";\nimport { chainRows } from \"../blocks/chain/draw\";\nimport { logRows } from \"../blocks/log/draw\";\nimport { queueFrames } from \"../blocks/queue/draw\";\nimport { routeNet } from \"../blocks/route/draw\";\nimport { hasWide, textBox } from \"../layout/measure\";\nimport { type Point, type Rect, unionRect } from \"../layout/scene\";\nimport type { TryLayout, TryMoment } from \"../kinds/try/layout\";\nimport { EASE, LOOK, MOTION, type TextStyle, TYPE } from \"../look/values\";\nimport type { DiagramModel } from \"../schema\";\nimport type { Span, Timeline } from \"../timeline\";\nimport type { Shown } from \"./ink\";\nimport type { Frame } from \"./motion\";\nimport { type Ctx, cssFont as font, cssMix as mix, esc, r1, sansOf, write } from \"./parts\";\n\nconst S = LOOK.stroke;\nconst X = LOOK.mix;\n\n/**\n * 試す図の部品の見た目。どの値も値の表から読む。試す図の SVG にだけ書き、ほかの図の SVG と頁が最初に読む script に入れない。\n * 末尾に j を付けた class は、和文を含む字を同じ大きさと太さの和文の字で描く\n */\nconst TRY_CSS = [\n `.dg-try-t{${font(TYPE.tryTitle)};fill:var(--ct)}`,\n `.dg-try-tj{${font(sansOf(TYPE.tryTitle))}}`,\n `.dg-try-net{fill:none;stroke:var(--line);stroke-width:${S.edge};stroke-linecap:round}`,\n `.dg-try-trip{fill:none;stroke:var(--c);stroke-width:${S.edgeOn};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-try-node{fill:var(--surf);stroke:var(--line);stroke-width:${S.slot}}`,\n `.dg-try-end{fill:${mix(X.chipTint)};stroke:var(--c);stroke-width:${S.on}}`,\n `.dg-try-ng{fill:none;stroke:var(--mute);stroke-width:${S.glyph};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-try-nt{${font(TYPE.tryNode)};fill:var(--mute)}`,\n `.dg-try-ntj{${font(sansOf(TYPE.tryNode))}}`,\n \".dg-try-nte{fill:var(--ink)}\",\n `.dg-try-q{fill:var(--surf);stroke:var(--hair);stroke-width:${S.hair}}`,\n `.dg-try-hint{${font(TYPE.tryHint)};fill:var(--ct)}`,\n `.dg-try-chip{fill:var(--surf);stroke:var(--line);stroke-width:${S.hair}}`,\n `.dg-try-sent{fill:${mix(X.chipTint)};stroke:var(--c);stroke-width:${S.on}}`,\n `.dg-try-cn{${font(TYPE.tryChip)};fill:var(--ink)}`,\n `.dg-try-cnj{${font(sansOf(TYPE.tryChip))}}`,\n `.dg-try-cv{${font(TYPE.tryChipValue)};fill:var(--ct)}`,\n `.dg-try-cvj{${font(sansOf(TYPE.tryChipValue))}}`,\n `.dg-try-blk{fill:var(--surf);stroke:var(--hair);stroke-width:${S.hair}}`,\n `.dg-try-no{${font(TYPE.tryBlockNo)};fill:var(--mute)}`,\n `.dg-try-noj{${font(sansOf(TYPE.tryBlockNo))}}`,\n `.dg-try-row{fill:var(--sunk);stroke:var(--hair);stroke-width:${S.hair}}`,\n `.dg-try-hrow{fill:${mix(X.chipTint)};stroke:${mix(X.capEdge, \"transparent\")};stroke-width:${S.hair}}`,\n `.dg-try-rk{${font(TYPE.tryRowKey)};fill:var(--mute)}`,\n `.dg-try-rv{${font(TYPE.tryRowValue)};fill:var(--ink)}`,\n \".dg-try-hv{fill:var(--ct)}\",\n `.dg-try-cap{${font(TYPE.tryCaption)};fill:var(--mute)}`,\n `.dg-try-ln{fill:none;stroke:var(--c);stroke-width:${S.edge};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-try-lb{fill:var(--surf);stroke:var(--c);stroke-width:${S.on}}`,\n `.dg-try-lt{${font(TYPE.tryLink)};fill:var(--ct)}`,\n `.dg-try-fold{fill:var(--surf);stroke:var(--hair);stroke-width:${S.hair};stroke-dasharray:3 3}`,\n `.dg-try-ft{${font(TYPE.tryHint)};fill:var(--mute)}`,\n `.dg-try-ftj{${font(sansOf(TYPE.tryHint))}}`,\n].join(\"\");\n\n/**\n * 記録の列 (#3441) だけが使う見た目。記録の列を持つ図の SVG にだけ書き、記録の列を持たない図の SVG を変えない。\n * 印の札は色の役の色で縁を引き、印の字は色の役の字の色で書く\n */\nconst LOG_CSS = [\n `.dg-try-mb{fill:${mix(X.chipTint)};stroke:var(--c);stroke-width:${S.on}}`,\n `.dg-try-mk{${font(TYPE.tryChipValue)};fill:var(--ct)}`,\n `.dg-try-mkj{${font(sansOf(TYPE.tryChipValue))}}`,\n].join(\"\");\n\n/** 網の節の関門 (#3476) を持つ図だけが使う見た目。関門で止まった節の輪を止まった色で引く。関門を持たない図の SVG を変えない */\nconst GATE_CSS = `.dg-try-stop{fill:none;stroke:var(--c);stroke-width:${S.on}}`;\n\n/** 和文を含む字に、和文の字の class を足す */\nconst cls = (base: string, text: string): string => (hasWide(text) ? `${base} ${base}j` : base);\n\nconst translate = (p: Point): string => `translate(${r1(p[0])}px,${r1(p[1])}px)`;\n\nconst same = (a: Point | null, b: Point | null): boolean =>\n a === null || b === null ? a === b : a[0] === b[0] && a[1] === b[1];\n\n/** 止まって見えている間と、その時の左上。字の重なりを数える時に、止まっている字だけを記録する */\nexport interface TryRest {\n at: Point;\n from: number;\n to: number;\n}\n\n/** 出来事の時刻。`a` で始め、`b` で終え、`move` は網を運ばれるチップが待ち行列へ入り始める時刻 (ほかのチップが席を詰め始める時刻) */\nexport interface TryWindow {\n a: number;\n b: number;\n move: number;\n}\n\n/**\n * 試す図のブロックの描き方 (網、待ち行列、機械の列、入力の帯) が受ける、描く状態 (#3348)。\n * 描き方は描いた物を層 (`base`、`lit`、`node`、`top`) に積み、呼ぶ順が動きの名前の番号を決める\n */\nexport interface TryKit {\n readonly layout: TryLayout;\n readonly diagram: DiagramModel;\n readonly ctx: Ctx;\n /** 出来事ごとの状態と、出来事ごとの時刻。最初の時点 (何も起きる前) を含む */\n readonly moments: TryMoment[];\n readonly windows: TryWindow[];\n /** 段 `s` の時刻 */\n readonly spanOf: (s: number) => Span;\n /** 出来事ごとの位置 (出ていなければ `null`) を辿る動きと、止まって見えている間。`trip` を返す時点は、その点を順に辿ってから席へ入る */\n readonly track: (positions: (Point | null)[], trip?: (k: number) => Point[] | undefined) => { style: string; rests: TryRest[] };\n /** 出来事ごとの値が替わる時刻で区切った値の並び */\n readonly phasesOf: <V>(values: V[]) => { value: V; from: number; to: number }[];\n /** `from` から `to` まで見える動き。`prop` は変える性質 */\n readonly shownKf: (ranges: Shown[], prop?: string) => string;\n /** 時点ごとに替わる字 */\n readonly phased: (texts: string[], x: number, y: number, className: string, anchor?: \"middle\" | \"end\") => string;\n /** 止まって見えている字を、字の重なりを数える記録に足す */\n readonly record: (text: string, style: TextStyle, rests: TryRest[], x: number, y: number, anchor?: \"start\" | \"middle\", shown?: Shown) => void;\n /** 部品の題 */\n readonly title: (t: { text: string; x: number; baseline: number }) => string;\n /** 和文を含む字に、同じ大きさと太さの和文の字の class を足す */\n readonly cls: (base: string, text: string) => string;\n /** 層。下から、地と題と枠 (`base`)、通った線 (`lit`)、網の節とブロック (`node`)、チップ (`top`) */\n readonly base: string[];\n readonly lit: string[];\n readonly node: string[];\n readonly top: string[];\n}\n\nexport function drawTry(\n layout: TryLayout,\n diagram: DiagramModel,\n timeline: Timeline,\n ctx: Ctx,\n): { base: string; lit: string; node: string; top: string; css: string } {\n const { m } = ctx;\n const moments = layout.moments;\n const spanOf = (s: number): Span => timeline.steps[s] as Span;\n /** 出来事ごとの時刻。最初の時点 (何も起きる前) は 0 */\n const windows: TryWindow[] = moments.map((mo) => {\n if (mo.step < 0) return { a: 0, b: 0, move: 0 };\n const time = timeline.edges.find((t) => t.step === mo.step && t.event === mo.event);\n const a = time?.start ?? spanOf(mo.step).start;\n const b = time?.drawn ?? a;\n return { a, b, move: mo.trip !== undefined ? Math.min(b, a + MOTION.try.trip) : a };\n });\n\n /**\n * 出来事ごとの位置 `positions` (出ていなければ `null`) を辿る動き。現れる時は席で浮かび、消える時は席で薄れ、別の席へは滑る。\n * `trip` を返す時点は、その点を順に辿ってから席へ入る。席の無い時点 (関門で止まったチップ、#3476) は最後の点で薄れて消える。繰り返す前に消える\n */\n const track = (\n positions: (Point | null)[],\n trip: (k: number) => Point[] | undefined = () => undefined,\n ): { style: string; rests: TryRest[] } => {\n const first = positions.find((p): p is Point => p !== null) ?? [0, 0];\n const frames: Frame[] = [[0, { opacity: 0, transform: translate(first) }]];\n const rests: TryRest[] = [];\n let cur: Point | null = positions[0] ?? null;\n let since = 0;\n let lastSeen = first;\n for (let k = 1; k < positions.length; k++) {\n const next = positions[k] ?? null;\n const w = windows[k] as TryWindow;\n const path = trip(k);\n if (same(cur, next) && !path) continue;\n // 止まっていた間は、動き出す時刻まで。席から席へ滑るチップは、網を運ばれるチップが待ち行列へ入り始めるまで止まっている\n if (cur) rests.push({ at: cur, from: since, to: next && !path ? w.move : w.a });\n if (path && path.length > 0) {\n // 送る側の節で現れ、道の長さに比べた時間で節を順に通り、作る人から待ち行列の席へ入る\n const start = path[0] as Point;\n const arrive = Math.min(w.b, w.a + MOTION.try.trip);\n const appear = Math.min(arrive, w.a + MOTION.popFade);\n frames.push(\n [w.a, { opacity: 0, transform: translate(start) }, EASE.out],\n [appear, { opacity: 1, transform: translate(start) }],\n );\n const legs = path\n .slice(1)\n .map((p, i) => Math.hypot(p[0] - (path[i] as Point)[0], p[1] - (path[i] as Point)[1]));\n const total = legs.reduce((sum, l) => sum + l, 0) || 1;\n let walked = 0;\n path.slice(1).forEach((p, i) => {\n walked += legs[i] ?? 0;\n frames.push([\n appear + ((arrive - appear) * walked) / total,\n { opacity: 1, transform: translate(p) },\n ]);\n });\n const end = path[path.length - 1] as Point;\n frames.push(\n [\n arrive,\n { opacity: 1, transform: translate(end) },\n EASE.inOut,\n ],\n [w.b, { opacity: next ? 1 : 0, transform: translate(next ?? end) }],\n );\n if (!next) lastSeen = end;\n } else if (!cur && next) {\n frames.push(\n [w.a, { opacity: 0, transform: translate(next) }, EASE.out],\n [w.b, { opacity: 1, transform: translate(next) }],\n );\n } else if (cur && !next) {\n frames.push(\n [w.a, { opacity: 1, transform: translate(cur) }, EASE.inOut],\n [w.b, { opacity: 0, transform: translate(cur) }],\n );\n } else if (cur && next) {\n frames.push(\n [w.move, { opacity: 1, transform: translate(cur) }, EASE.inOut],\n [w.b, { opacity: 1, transform: translate(next) }],\n );\n }\n since = w.b;\n cur = next;\n if (next) lastSeen = next;\n }\n if (cur) rests.push({ at: cur, from: since, to: m.last });\n frames.push(\n [m.last, { opacity: cur ? 1 : 0, transform: translate(lastSeen) }, EASE.inOut],\n [m.total, { opacity: 0, transform: translate(lastSeen) }],\n );\n return { style: m.kf(frames), rests };\n };\n\n /** 出来事ごとの値 `values` が替わる時刻で区切った値の並び。最初の値は初めから */\n const phasesOf = <V>(values: V[]): { value: V; from: number; to: number }[] => {\n const out: { value: V; from: number; to: number }[] = [];\n values.forEach((value, k) => {\n const last = out[out.length - 1];\n if (last && last.value === value) return;\n const from = last ? (windows[k] as TryWindow).b : 0;\n if (last) last.to = from;\n out.push({ value, from, to: Number.POSITIVE_INFINITY });\n });\n return out;\n };\n\n /** `from` から `to` まで見える動き。`prop` は変える性質 (字の一部は `fill-opacity` で消す) */\n const shownKf = (ranges: Shown[], prop = \"opacity\"): string => {\n const frames: Frame[] = [[0, { [prop]: 0 }]];\n for (const [a, b] of ranges) {\n if (a <= 0) frames.push([0, { [prop]: 1 }]);\n else frames.push([a, { [prop]: 0 }, EASE.out], [a + MOTION.fade, { [prop]: 1 }]);\n if (Number.isFinite(b))\n frames.push(\n [b, { [prop]: 1 }, EASE.inOut],\n [Math.min(b + MOTION.fade, m.total), { [prop]: 0 }],\n );\n else frames.push([m.last, { [prop]: 1 }, EASE.inOut]);\n }\n frames.push([m.total, { [prop]: 0 }]);\n return m.kf(frames);\n };\n\n /** 時点ごとに替わる字。替わらなければ 1 つの字、替われば替わる時刻ごとに薄れて入れ替わる字の並び */\n const phased = (\n texts: string[],\n x: number,\n y: number,\n className: string,\n anchor?: \"middle\" | \"end\",\n ): string => {\n const phases = phasesOf(texts).filter((p) => p.value !== \"\");\n const head = `<text class=\"${className}\" x=\"${r1(x)}\" y=\"${r1(y)}\"${anchor ? ` text-anchor=\"${anchor}\"` : \"\"}>`;\n if (phases.length <= 1) return `${head}${esc(phases[0]?.value ?? \"\")}</text>`;\n return `${head}${phases.map((p) => `<tspan class=\"dg-a\" x=\"${r1(x)}\" style=\"${shownKf([[p.from, p.to]], \"fill-opacity\")}\">${esc(p.value)}</tspan>`).join(\"\")}</text>`;\n };\n\n /** 止まって見えている字を、字の重なりを数える記録に足す */\n const record = (\n text: string,\n style: TextStyle,\n rests: TryRest[],\n x: number,\n y: number,\n anchor?: \"start\" | \"middle\",\n shown: Shown = [0, Number.POSITIVE_INFINITY],\n ): void => {\n if (text === \"\") return;\n for (const r of rests) {\n const a = Math.max(r.from, shown[0]);\n const b = Math.min(r.to, shown[1]);\n if (a < b)\n ctx.ink.push({\n text,\n rect: textBox(text, r.at[0] + x, r.at[1] + y, style, anchor),\n shown: [[a, b]],\n });\n }\n };\n\n const base: string[] = [];\n const lit: string[] = [];\n const node: string[] = [];\n const top: string[] = [];\n const title = (t: { text: string; x: number; baseline: number }): string =>\n write(\n ctx.ink,\n cls(\"dg-try-t\", t.text),\n t.x,\n t.baseline,\n t.text,\n hasWide(t.text) ? sansOf(TYPE.tryTitle) : TYPE.tryTitle,\n );\n const kit: TryKit = { layout, diagram, ctx, moments, windows, spanOf, track, phasesOf, shownKf, phased, record, title, cls, base, lit, node, top };\n // 呼ぶ順が動きの名前の番号を決めるので、移す前の順のまま呼ぶ\n routeNet(kit);\n queueFrames(kit);\n chainRows(kit);\n tryChips(kit);\n // 記録の列はチップの後に呼び、記録の列を持たない図の動きの名前の番号を変えない\n logRows(kit);\n return {\n base: base.join(\"\"),\n lit: lit.join(\"\"),\n node: node.join(\"\"),\n top: top.join(\"\"),\n css: (layout.logs ? TRY_CSS + LOG_CSS : TRY_CSS) + ((diagram.try?.checks ?? []).length > 0 ? GATE_CSS : \"\"),\n };\n}\n\n/**\n * 寄って追う窓が寄せる所 (#3337)。動く物を全部囲んだ所の真ん中で、囲んだ所が窓 (`vw` × `vh`) より大きい時は、最初の物が窓から外れない所までに留める。\n * 網は図の幅いっぱいに広がるので、全部を囲んだ所の真ん中へ寄せると、狭い窓では送った先の待ち行列が窓から外れる。動く物が無ければ `undefined`\n */\nexport function anchoredCenter(parts: Rect[], vw: number, vh: number): [number, number] | undefined {\n const first = parts[0];\n if (!first) return undefined;\n const all = unionRect(parts);\n // 窓の幅 `size` で `[lo, lo + len]` を外さない真ん中の範囲に、全部を囲んだ所の真ん中 `c` を収める。窓より大きい物は真ん中に置く\n const keep = (c: number, lo: number, len: number, size: number): number =>\n len > size ? lo + len / 2 : Math.min(lo + size / 2, Math.max(lo + len - size / 2, c));\n return [\n keep(all.x + all.w / 2, first.x, first.w, vw),\n keep(all.y + all.h / 2, first.y, first.h, vh),\n ];\n}\n","/**\n * 釦の描き方 (#3337、#3348)。\n *\n * 釦は図の上に描かず、再生の部品 (`try-player.ts`) が頁の釦として置く。置き場 (`at`) を書いた釦は、その部品の題の右に重ねて置く。\n * この file は釦を重ねる図の上の所を、並べた部品の題から求める。再生の部品だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport type { TryLayout } from \"../../kinds/try/layout\";\nimport { textWidth } from \"../../layout/measure\";\nimport { LOOK, TYPE } from \"../../look/values\";\n\n/** 部品 `part` の題の右の、図の上の釦を置く所 (図の座標)。題を持たない部品は `undefined` */\nexport function pressSpot(layout: TryLayout, part: string): { x: number; y: number } | undefined {\n const title = [...layout.routes, ...layout.queues, ...layout.chains, ...(layout.logs ?? [])].find((p) => p.id === part)?.title;\n if (!title) return undefined;\n return {\n x: title.x + textWidth(title.text, TYPE.tryTitle),\n y: title.baseline - TYPE.tryTitle.size * LOOK.player.ask.mid,\n };\n}\n","/**\n * 試す図 (`try`、#3337) の再生の部品の操作。\n *\n * 再生の部品 (`player.ts`) は試す図を、書き手の最初の段だけを持つ原本 (今の原本) で描き、この file の操作を図の下と図の上に置く。\n * 図の下の入力の帯 (`form[data-dragon=\"ask\"]`) には、欄ごとの入力と送る釦と、置き場 (`at`) を書かない釦 (`press`) を並べる。\n * 選択肢を持たない文字の欄は `TYPED_MOST` 字までしか打てず、図は打った名前を切らずに出す (#3458)。\n * 置き場を書いた釦は図の上のその部品の題の右に置き、寄って追う図か、帯の中身の幅が `LOOK.player.narrow` より狭い時は帯へ移す。\n * 空の待ち行列から取り出す釦と、満杯の待ち行列へ送る送る釦は押せなくし、押せない訳を `[data-dragon=\"reason\"]` に出す。\n * 送る先の待ち行列が `accept` に書いていない名前を入れた送る釦と、2 つ以上の待ち行列のどれかが `take` 件に満たない釦も同じく押せなくする (#3453)。\n * 網の節の関門 (#3476) で止まる値は待ち行列に入らないので、送る先が満杯か受け入れないかを問わずに送れる。止まった段の本文は止まった節とエラーの名前を書く。\n * 機械の列が `edit` を持つ時、ブロックの中のチップを押すと書き換える欄 (`form[data-dragon=\"edit\"]`) を出す。\n * 送る、押す、書き換えるたびに、記法と同じ出来事を 1 つ持つ段を渡した言葉の題と本文で作り、再生の部品へ渡す。\n * 押せるかと訳は今の原本の最後の段の状態 (`layout.states`) から読む。読み手の値はどこにも保存しない。\n * 操作の要素は描き直しても作り直さず、押した物は帯と図の上の層の 2 か所で受けるので、釦を移しても受け方は変わらない。\n * この file は試す図の描く部品と同じ塊 (`kinds/try.ts`) に入り、軽い入口では試す図を読んだ時に届く。\n * 再生の部品は試す図を描けた後にだけ操作を置くので、操作を置く時には塊が届いている。見た目は操作を置く時に頁へ 1 度だけ入れる。\n */\nimport { pressSpot } from \"./blocks/press/draw\";\nimport type { TryLayout } from \"./kinds/try/layout\";\nimport { textWidth } from \"./layout/measure\";\nimport { TRY_LOOK } from \"./look/try\";\nimport { LOOK, TYPE } from \"./look/values\";\nimport { cssFont as font } from \"./render/parts\";\nimport type { DiagramModel, Step, TryPart } from \"./schema\";\nimport { accepts, askFields, fromsOf, intoOf, stopOf, type TryState } from \"./try-state\";\nimport type { Styles } from \"./adopt-css\";\nimport { TRY_TEXT } from \"./try-text\";\nimport type { NotationLang } from \"./words\";\n\ntype Part<T extends TryPart[\"type\"]> = Extract<TryPart, { type: T }>;\n/** 入力の帯と書き換えの欄。選択肢を持つ欄は選ぶ欄、持たない欄は文字の欄 (#3422) */\ntype FieldInput = HTMLInputElement | HTMLSelectElement;\n\nconst px = (v: number): string => `${v}px`;\nconst percent = (v: number): string => `${v * 100}%`;\n\n/** チップの名前に使える字。原本はチップを名札で名指すので、名札に使えない字 (空白、`[`、`]`、`「`、`」`、`=`、`:`) を断る */\nconst NAME = /^[^\\s[\\]「」=:]+$/u;\n\n/** 文字の欄に打てる字数。図はチップの名前を切らずに出すので、読み手が打つ値をここで限る (#3458) */\nconst TYPED_MOST = 12;\n\n/** 入力の帯と書き換える欄と、図の上の釦の見た目。操作を置く時に頁へ 1 度だけ入れる */\nfunction tryCss(): string {\n const P = LOOK.player;\n const A = P.ask;\n const hair = px(LOOK.stroke.hair);\n // 送る釦と決める釦と入力の縁は、図のチップとブロックと同じ色で塗る\n const tint = `var(--c-${TRY_LOOK.color.part})`;\n return [\n `.dg-try{display:flex;flex-direction:column;gap:${px(P.gap / 2)}}`,\n `.dg-ask{container:dg-ask/inline-size;margin:0;padding:${px(A.pad)};border:${hair} solid var(--hair);border-radius:${px(P.radius)};background:var(--sunk)}`,\n \".dg-ask[hidden]{display:none}\",\n `.dg-ask-row{display:flex;flex-wrap:wrap;align-items:flex-end;gap:${px(P.gap)}}`,\n // 選ぶ欄は一番長い候補が収まる幅 (--dg-field-min) より縮めず、1 行に入らない欄は次の行へ送る (#3485)。打つ欄は今どおり縮める。\n // 次の行へ送った欄 (data-wrap) は伸ばさず、1 行目の欄だけが伸びて行を埋める (#3492)\n `.dg-field{position:relative;display:flex;flex-direction:column;gap:${px(A.label)};flex:1 1 ${px(A.field)};min-width:var(--dg-field-min,0px)}`,\n \".dg-field[data-wrap]{flex-grow:0}\",\n `.dg-fl{${font(TYPE.askLabel)};color:var(--mute);overflow:hidden;text-overflow:ellipsis;white-space:nowrap}`,\n `.dg-in{box-sizing:border-box;width:100%;height:${px(P.touch)};margin:0;padding:0 ${px(A.inset)};border:${hair} solid var(--line);border-radius:${px(A.radius)};background:var(--surf);color:var(--ink);${font(TYPE.askInput)}}`,\n `.dg-in:focus{outline:${hair} solid ${tint};border-color:${tint}}`,\n // 選ぶ欄はブラウザの矢印を描かず、右に矢印の場所を空けて、dragon が描く矢印 (.dg-caret) を右の縁から字と同じ余白で置く (#3492)\n `select.dg-in{appearance:none;-webkit-appearance:none;padding-right:${px(A.inset + A.arrow)}}`,\n `.dg-caret{position:absolute;right:${px(A.inset + LOOK.stroke.hair)};bottom:${px((P.touch - A.caret.h) / 2)};width:${px(A.caret.w)};height:${px(A.caret.h)};margin:0;padding:0;border:0;color:var(--mute);pointer-events:none}`,\n // 矢印の山形は、対角が矢印の幅になる正方形の右と下の縁を 45 度回して描く (#3499)。左右の角が枠の左右の端に、下の角が枠の下の端に来る\n `.dg-caret::before{content:\"\";position:absolute;left:50%;top:${px(A.caret.h - A.caret.w / 2)};width:${px(A.caret.w / Math.SQRT2)};height:${px(A.caret.w / Math.SQRT2)};box-sizing:border-box;border-right:${px(A.caret.line)} solid currentColor;border-bottom:${px(A.caret.line)} solid currentColor;transform:translate(-50%,-50%) rotate(45deg)}`,\n `.dg-act{box-sizing:border-box;flex:none;min-width:${px(P.touch)};min-height:${px(P.touch)};margin:0;padding:0 ${px(A.side)};border:${hair} solid var(--line);border-radius:${px(A.radius)};background:var(--surf);color:var(--ink);${font(TYPE.button)};cursor:pointer}`,\n `.dg-act:focus-visible{outline:${px(P.focus)} solid var(--c-blue);outline-offset:${px(P.focus)}}`,\n `.dg-act:is([data-dragon=\"send\"],[data-dragon=\"apply\"]){border-color:${tint};background:${tint};color:var(--on-c)}`,\n `.dg-act:disabled{opacity:${A.dim};cursor:not-allowed}`,\n `.dg-why{margin:0;${font(TYPE.askReason)};color:var(--t-amber);white-space:pre-line}`,\n \".dg-why:empty{display:none}\",\n // 図の上の釦の層は図 (SVG) と同じ所と大きさに置き、釦の位置を図の寸法の割合で決める。層は図のチップへの押下を遮らない\n \".dg-player[data-try] .dg-frame{position:relative}\",\n \".dg-ats{position:absolute;left:0;top:0;pointer-events:none}\",\n `.dg-ats .dg-act{position:absolute;min-height:${px(P.button)};height:${px(P.button)};transform:translateY(-50%);pointer-events:auto;white-space:nowrap}`,\n `@media (pointer: coarse){.dg-ats .dg-act{min-height:${px(P.touch)};height:${px(P.touch)}}}`,\n \".dg-player [data-chip][data-editable]{cursor:pointer}\",\n // 狭い帯 (携帯の幅) では欄と釦を 2 列の升に並べ、どれも帯の幅に収める\n `@container dg-ask (width < ${px(P.narrow)}){.dg-ask-row{display:grid;grid-template-columns:repeat(2,minmax(0,1fr));align-items:end}.dg-field{min-width:0;max-width:none}.dg-act{width:100%;min-width:0}}`,\n // 角を落とす色味は、帯と入力と釦の角を丸めない (#3344)\n '.dg-player[data-corner=\"cut\"] :is(.dg-ask,.dg-in,.dg-act){border-radius:0}',\n ].join(\"\");\n}\n\n/** 見た目を入れる。再生の部品の見た目 (`dragon-player-css`) の後ろに置く。口`styles`を渡された時は口で図を置いた所の根へ入れる (#3695) */\nfunction ensureTryCss(doc: Document, styles?: Styles): void {\n if (styles) return styles.adopt(\"dragon-try-css\", tryCss());\n if (doc.getElementById(\"dragon-try-css\")) return;\n const style = doc.createElement(\"style\");\n style.id = \"dragon-try-css\";\n style.textContent = tryCss();\n doc.head.appendChild(style);\n}\n\n/** 書き出した頁で試す図の操作が出しうる字。字の file に残す */\nexport function tryTexts(model: DiagramModel, lang: NotationLang): string[] {\n const w = TRY_TEXT[lang];\n const parts = model.try?.parts ?? [];\n return [\n ...parts.map((p) => p.id),\n ...askFields(parts),\n \"0123456789\",\n w.trySend,\n w.tryApply,\n w.tryClose,\n w.tryBlank,\n w.tryBlankEdit,\n w.tryFull(\"\", 0),\n w.tryEmpty(\"\", \"\"),\n // 待ち行列の accept と、2 つ以上の待ち行列から集める釦 (#3453) の、押せない訳と押した段の本文\n ...(parts.some((p) => p.type === \"queue\" && p.accept !== undefined) ? [w.tryRefused(\"\", \"\")] : []),\n ...(parts.some((p) => p.type === \"press\" && fromsOf(p).length > 1)\n ? [w.tryShort(\"\", \"\", 0), w.tryGatheredBody(1, [\"\", \"\"], 0), w.tryGatheredBody(2, [\"\", \"\"], 0), w.tryGatheredRecordBody(1, [\"\", \"\"], \"\", 0), w.tryGatheredRecordBody(2, [\"\", \"\"], \"\", 0)]\n : []),\n // 網の節の関門 (#3476) の、止まった記録の字と止まった段の本文\n ...(model.try?.checks ?? []).flatMap((c) => [c.node, c.no, w.tryStoppedAt(c.node), w.tryStoppedBody(\"\", c.node, c.no), c.retry ? w.tryRetry : w.tryResend]),\n w.tryBadName(\"\"),\n w.tryEditField(\"\", \"\"),\n w.trySent(\"\"),\n w.trySentBody(\"\", \"\", \"\"),\n w.trySentBody(\"\", \"\"),\n w.tryPressed(\"\"),\n w.tryPressedBody(1, \"\", 0),\n w.tryPressedBody(2, \"\", 0),\n // 記録の列 (#3441) の、読み手が足す記録の番号と印と、押した段の本文\n ...parts.flatMap((p) =>\n p.type === \"log\"\n ? [w.tryRecord(0), w.tryFoldedRecords(1), w.tryFoldedRecords(2), w.tryPressedRecordBody(1, \"\", \"\", 0), w.tryPressedRecordBody(2, \"\", \"\", 0), ...(p.all ? [p.all.yes, p.all.no] : [])]\n : [],\n ),\n w.tryEdited(\"\", \"\"),\n w.tryEditedBody(\"\", \"\", \"\"),\n ];\n}\n\nexport interface TryControls {\n /** 図の下に置く帯。入力の帯と、開いている間の書き換える欄と、押せない訳を持つ */\n readonly tools: HTMLElement;\n /** 図の上に置く釦の層。図の枠の中に置く */\n readonly layer: HTMLElement;\n /** 今の原本を描いた置き場所で、押せるかと押せない訳と、図の上の釦の位置を決め直す */\n update(layout: TryLayout): void;\n /** 置き場を書いた釦を図の上と帯のどちらに置くかを選ぶ。`fallback` は帯の幅を測れない時に使う幅 */\n arrange(view: string, fallback: number): void;\n /** 図の上の釦の層を、図 (SVG) と同じ所と大きさにする */\n fit(frame: HTMLElement, svg: SVGSVGElement): void;\n /** 段 `step` の図で、書き換えられるチップ (ブロックの中のチップ) に印を付ける */\n mark(svg: SVGSVGElement, step: number): void;\n /** 図のチップ `item` を押した。段 `step` でブロックの中に居るチップなら書き換える欄を出す */\n pick(item: string, step: number): void;\n /** 段を足せなかった訳を出す */\n refuse(message: string): void;\n destroy(): void;\n}\n\n/**\n * 試す図の操作を作る。`model` は今の原本を描いた形、`layout` はその置き場所。\n * `add` は読み手の操作で作った段を受け取り、今の原本に足して描き直せた時に真を返す\n */\nexport function mountTryControls(\n doc: Document,\n styles: Styles | undefined,\n model: DiagramModel,\n layout: TryLayout,\n lang: NotationLang,\n add: (step: Step) => boolean,\n): TryControls {\n ensureTryCss(doc, styles);\n const words = TRY_TEXT[lang];\n const parts = model.try?.parts ?? [];\n const ask = parts.find((p): p is Part<\"ask\"> => p.type === \"ask\");\n const presses = parts.filter((p): p is Part<\"press\"> => p.type === \"press\");\n /** 機械の列ごとの、読み手が書き換えられる欄 */\n const edits = new Map(\n parts.flatMap((p) =>\n p.type === \"chain\" && p.edit !== undefined ? [[p.id, p.edit] as const] : [],\n ),\n );\n const fields = askFields(parts);\n /** 送る先を受け入れる名前で限る待ち行列が在るか (#3453)。在れば、名前の欄を打ち直すたびに送れるかを決め直す */\n const limited = parts.some((p) => p.type === \"queue\" && p.accept !== undefined);\n /** 網の節の関門 (#3476) と、関門を置く入力の帯の網。関門を持つ図は、どの欄を打ち直しても送れるかを決め直す */\n const checks = model.try?.checks ?? [];\n const via = parts.find((p): p is Part<\"route\"> => p.type === \"route\" && p.id === ask?.via);\n let current = layout;\n /** 押した時の断り (空の欄など)。次に描き直すか打ち込むまで出す */\n let notice = \"\";\n /** 押せない釦の訳 */\n let blocked: string[] = [];\n /** 置き場を書いた釦を図の上に置いているか */\n let over = false;\n\n const button = (role: string, text: string, type: \"submit\" | \"button\"): HTMLButtonElement => {\n const b = doc.createElement(\"button\");\n b.type = type;\n b.className = \"dg-act\";\n b.dataset.dragon = role;\n b.textContent = text;\n return b;\n };\n /**\n * 選ぶ欄の右に置く下向きの矢印 (#3492)。見た目だけの印で、押した時は下の選ぶ欄が開く。\n * 形は CSS (`.dg-caret::before`) が描き、svg を使わない。図を置いた頁が svg に当てる幅や高さの規則で膨らまない (#3499)\n */\n const caret = (): HTMLSpanElement => {\n const mark = doc.createElement(\"span\");\n mark.className = \"dg-caret\";\n mark.setAttribute(\"aria-hidden\", \"true\");\n return mark;\n };\n /** 欄ごとの選択肢 (#3422)。選択肢を持つ欄は打たせず選ばせる */\n const choices = ask?.choices ?? {};\n /**\n * 欄 `name` の札と欄。選択肢を持つ欄は選択肢を書いた順に並べた選ぶ欄で、`value` が選択肢に無ければ最初の選択肢を選ぶ。\n * 選択肢を持たない欄は `TYPED_MOST` 字まで打てる文字の欄\n */\n const field = (name: string, label: string, value = \"\"): { label: HTMLLabelElement; input: FieldInput } => {\n const box = doc.createElement(\"label\");\n box.className = \"dg-field\";\n const caption = doc.createElement(\"span\");\n caption.className = \"dg-fl\";\n caption.textContent = label;\n const options = choices[name];\n let input: FieldInput;\n if (options) {\n const select = doc.createElement(\"select\");\n for (const option of options) {\n const o = doc.createElement(\"option\");\n o.value = option;\n o.textContent = option;\n select.append(o);\n }\n select.value = options.includes(value) ? value : (options[0] ?? \"\");\n // 一番長い候補の字と左右の余白と矢印と縁が収まる幅を、欄の幅の下限にする (#3485)。選んだ値の字を欄の幅で切らない。\n // 欄の名前の字の幅も下回らないので、次の行へ送って伸ばさない欄でも名前を「…」で切らない (#3492)\n const A = LOOK.player.ask;\n const longest = Math.max(0, ...options.map((option) => textWidth(option, TYPE.askInput)));\n const least = Math.ceil(Math.max(longest + 2 * A.inset + A.arrow + 2 * LOOK.stroke.hair, textWidth(label, TYPE.askLabel)));\n box.style.setProperty(\"--dg-field-min\", px(least));\n input = select;\n } else {\n const text = doc.createElement(\"input\");\n text.type = \"text\";\n text.autocomplete = \"off\";\n text.maxLength = TYPED_MOST;\n text.value = value;\n input = text;\n }\n input.className = \"dg-in\";\n input.dataset.field = name;\n box.append(caption, input);\n if (options) box.append(caret());\n return { label: box, input };\n };\n\n const tools = doc.createElement(\"div\");\n tools.className = \"dg-try\";\n // 置いた頁の言葉と違っても、釦の字と押せない訳を渡した言葉の声で読ませる\n tools.setAttribute(\"lang\", lang);\n const form = doc.createElement(\"form\");\n form.className = \"dg-ask\";\n form.dataset.dragon = \"ask\";\n form.noValidate = true;\n form.setAttribute(\"aria-label\", words.tryAsk);\n const row = doc.createElement(\"div\");\n row.className = \"dg-ask-row\";\n form.append(row);\n const inputs = ask ? fields.map((name) => field(name, name)) : [];\n const send = ask ? button(\"send\", words.trySend, \"submit\") : undefined;\n const pressed = new Map(\n presses.map((p) => {\n const b = button(\"press\", p.id, \"button\");\n b.dataset.press = p.id;\n if (p.at !== undefined) b.dataset.at = p.at;\n return [p.id, b] as const;\n }),\n );\n row.append(...inputs.map((i) => i.label), ...(send ? [send] : []));\n const reason = doc.createElement(\"p\");\n reason.className = \"dg-why\";\n reason.dataset.dragon = \"reason\";\n reason.setAttribute(\"aria-live\", \"polite\");\n tools.append(form, reason);\n const layer = doc.createElement(\"div\");\n layer.className = \"dg-ats\";\n let editor:\n { form: HTMLFormElement; input: FieldInput; item: string; field: string } | undefined;\n\n const lastState = (): TryState | undefined => current.states[current.states.length - 1];\n const say = (): void => {\n reason.textContent = [notice, ...blocked].filter((t) => t !== \"\").join(\"\\n\");\n };\n const refuse = (message: string): void => {\n notice = message;\n say();\n };\n\n /** 釦を置く図の上の所。図の上に置かない釦 (置き場を書かない釦、題を持たない部品に置く釦、帯へ移した釦) は `undefined` */\n const spotFor = (p: Part<\"press\">): { x: number; y: number } | undefined =>\n over && p.at !== undefined ? pressSpot(current, p.at) : undefined;\n /** 図の上の釦を、置き場の部品の題の右に置く。置き場所は描き直すと変わりうるので、描き直すたびに決め直す */\n const position = (): void => {\n for (const p of presses) {\n const b = pressed.get(p.id) as HTMLButtonElement;\n const spot = spotFor(p);\n if (spot) {\n b.style.left = `calc(${percent(spot.x / current.width)} + ${px(LOOK.player.ask.at)})`;\n b.style.top = percent(spot.y / current.height);\n } else {\n b.style.removeProperty(\"left\");\n b.style.removeProperty(\"top\");\n }\n }\n };\n /**\n * 釦を書いた順に帯か図の上の層へ並べる。並べる所が変わった時 (幅が変わった時) だけ呼び、\n * 描き直すたびには動かさない。押した釦と打ち込み中の欄から、押したり打ち込んだりする先 (focus) を外さないため\n */\n const move = (): void => {\n for (const p of presses)\n (spotFor(p) ? layer : row).append(pressed.get(p.id) as HTMLButtonElement);\n form.hidden = row.childElementCount === 0;\n position();\n // 釦を帯へ移すと行の並びが変わるので、次の行へ送った欄を決め直す (#3492)\n settle();\n };\n\n /** 入力の帯の今の値 */\n const typed = (): string[] => inputs.map((i) => i.input.value.trim());\n /** 送る先の待ち行列。`into` に欄を書いた入力の帯は、その欄に今選んでいる値の待ち行列 (#3441) */\n const target = (): string =>\n ask ? intoOf(ask, typed(), (id) => parts.some((p) => p.id === id)) : \"\";\n /** 今の値のチップが止まる関門 (#3476)。空の欄がある間は決めない */\n const stopped = (values: readonly string[]) =>\n via && values.every((v) => v !== \"\") ? stopOf(checks, via, fields, values) : undefined;\n const update = (next: TryLayout): void => {\n current = next;\n const last = lastState();\n const reasons: string[] = [];\n if (ask && send) {\n const into = target();\n const most = next.parts.find((p) => p.id === into)?.most ?? Number.POSITIVE_INFINITY;\n // 名前を入れる前は受け入れるかを問わない。空の欄は送る時に断る。関門で止まる値は待ち行列に入らないので、受け入れと満杯を問わない (#3476)\n const name = inputs[0]?.input.value.trim() ?? \"\";\n const passing = stopped(typed()) === undefined;\n const refused = passing && name !== \"\" && !accepts(parts.find((p) => p.id === into), name);\n const full = passing && (last?.queues[into]?.length ?? 0) >= most;\n send.disabled = refused || full;\n if (refused) reasons.push(words.tryRefused(into, name));\n if (full) reasons.push(words.tryFull(into, most));\n }\n for (const p of presses) {\n const b = pressed.get(p.id) as HTMLButtonElement;\n const froms = fromsOf(p);\n // 1 つの待ち行列から取り出す釦は 1 件でもあれば押せ、2 つ以上から集める釦はどれにも take 件要る (#3453)\n const need = froms.length > 1 ? p.take : 1;\n const short = froms.find((id) => (last?.queues[id]?.length ?? 0) < need);\n b.disabled = short !== undefined;\n if (short !== undefined)\n reasons.push((last?.queues[short]?.length ?? 0) === 0 ? words.tryEmpty(short, p.id) : words.tryShort(short, p.id, p.take));\n }\n blocked = reasons;\n notice = \"\";\n say();\n position();\n };\n\n const closeEdit = (): void => {\n editor?.form.remove();\n editor = undefined;\n };\n const openEdit = (item: string, name: string): void => {\n closeEdit();\n const value = lastState()?.items[item]?.[fields.indexOf(name)] ?? \"\";\n const editForm = doc.createElement(\"form\");\n editForm.className = \"dg-ask\";\n editForm.dataset.dragon = \"edit\";\n editForm.dataset.item = item;\n editForm.noValidate = true;\n editForm.setAttribute(\"aria-label\", words.tryEditForm);\n const editRow = doc.createElement(\"div\");\n editRow.className = \"dg-ask-row\";\n const box = field(name, words.tryEditField(item, name), value);\n editRow.append(\n box.label,\n button(\"apply\", words.tryApply, \"submit\"),\n button(\"close\", words.tryClose, \"button\"),\n );\n editForm.append(editRow);\n tools.insertBefore(editForm, reason);\n editor = { form: editForm, input: box.input, item, field: name };\n box.input.focus();\n // 文字の欄は今の値を選んだ状態にして打ち直させる。選ぶ欄は今の値を選んで開く\n if (box.input.tagName === \"INPUT\") (box.input as HTMLInputElement).select();\n };\n\n const sendValues = (): void => {\n if (!ask || !send || send.disabled) return;\n const values = typed();\n if (values.some((v) => v === \"\")) return refuse(words.tryBlank);\n const name = values[0] ?? \"\";\n if (!NAME.test(name)) return refuse(words.tryBadName(fields[0] ?? \"\"));\n const stop = stopped(values)?.check;\n add({\n title: words.trySent(name),\n body: stop ? words.tryStoppedBody(name, stop.node, stop.no) : words.trySentBody(name, target(), ask.via),\n events: [{ type: \"ask\", values }],\n });\n };\n const press = (id: string | undefined): void => {\n const p = presses.find((x) => x.id === id);\n if (!p) return;\n const last = lastState();\n const froms = fromsOf(p);\n const waiting = froms.map((from) => last?.queues[from]?.length ?? 0);\n const records = last?.logs?.[p.into];\n const next = records ? records.length + 1 : (last?.chains[p.into]?.length ?? 0) + 1;\n // 2 つ以上の待ち行列から集める釦は、どの待ち行列にも take 件ある時だけ押せる (#3453)\n if (froms.length > 1) {\n if (waiting.some((n) => n < p.take)) return;\n add({\n title: words.tryPressed(p.id),\n body: records ? words.tryGatheredRecordBody(p.take, froms, p.into, next) : words.tryGatheredBody(p.take, froms, next),\n events: [{ type: \"press\", press: p.id }],\n });\n return;\n }\n const from = froms[0] ?? \"\";\n const count = Math.min(p.take, waiting[0] ?? 0);\n if (count === 0) return;\n add({\n title: words.tryPressed(p.id),\n body: records ? words.tryPressedRecordBody(count, from, p.into, next) : words.tryPressedBody(count, from, next),\n events: [{ type: \"press\", press: p.id }],\n });\n };\n const applyEdit = (): void => {\n if (!editor) return;\n const { item, field: name } = editor;\n const value = editor.input.value.trim();\n if (value === \"\") return refuse(words.tryBlankEdit);\n const from = lastState()?.items[item]?.[fields.indexOf(name)] ?? \"\";\n const added = add({\n title: words.tryEdited(item, name),\n body: words.tryEditedBody(name, from, value),\n events: [{ type: \"item\", item, values: { [name]: value } }],\n });\n if (added) closeEdit();\n };\n\n // 押した物は帯と図の上の層で受ける。釦を帯と層の間で移しても、描き直しても受け方が変わらない\n const onClick = (event: Event): void => {\n const target = (event.target as Element | null)?.closest?.(\"button\");\n if (!target || target.disabled) return;\n const role = target.getAttribute(\"data-dragon\");\n if (role === \"press\") press(target.getAttribute(\"data-press\") ?? undefined);\n else if (role === \"close\") closeEdit();\n };\n const onSubmit = (event: Event): void => {\n event.preventDefault();\n if (event.target === form) sendValues();\n else if (editor && event.target === editor.form) applyEdit();\n };\n const onInput = (event: Event): void => {\n // into に書いた欄を選び直すと送る先の待ち行列が替わるので、送れるかを決め直す (#3441)。\n // 受け入れる名前を限る待ち行列が在る図は、名前の欄を打ち直しても決め直す (#3453)。関門を持つ図は、どの欄を打ち直しても決め直す (#3476)\n const changed = (event.target as HTMLElement | null)?.dataset?.field;\n if (ask && changed !== undefined && (changed === ask.into || (limited && changed === fields[0]) || checks.length > 0)) {\n update(current);\n return;\n }\n if (notice === \"\") return;\n notice = \"\";\n say();\n };\n const onKey = (event: KeyboardEvent): void => {\n if (event.key === \"Escape\" && editor?.form.contains(event.target as Node | null)) closeEdit();\n };\n tools.addEventListener(\"click\", onClick);\n tools.addEventListener(\"submit\", onSubmit);\n tools.addEventListener(\"input\", onInput);\n tools.addEventListener(\"change\", onInput);\n tools.addEventListener(\"keydown\", onKey);\n layer.addEventListener(\"click\", onClick);\n\n /**\n * 帯の 2 行目より下へ送った欄に `data-wrap` を付け、伸ばさない (#3492)。印は伸びる幅だけを変え、どの欄がどの行に入るかは変えないので、\n * 1 度の判定で落ち着く。2 列の升 (細い帯) では行の並びを升が決めるので印を外す。帯の大きさが変わるたびに判定し直す\n */\n const settle = (): void => {\n const boxes = [...row.querySelectorAll<HTMLElement>(\":scope > .dg-field\")];\n for (const box of boxes) box.removeAttribute(\"data-wrap\");\n const view = doc.defaultView;\n if (boxes.length === 0 || !view || view.getComputedStyle(row).display !== \"flex\") return;\n const top = boxes[0]?.offsetTop ?? 0;\n for (const box of boxes) if (box.offsetTop > top + 1) box.setAttribute(\"data-wrap\", \"\");\n };\n\n move();\n update(layout);\n\n /** 釦の層を図 (SVG) と同じ所と大きさにする */\n const fitLayer = (frame: HTMLElement, svg: SVGSVGElement): void => {\n const f = frame.getBoundingClientRect();\n const s = svg.getBoundingClientRect();\n layer.style.left = px(s.left - f.left - frame.clientLeft + frame.scrollLeft);\n layer.style.top = px(s.top - f.top - frame.clientTop + frame.scrollTop);\n layer.style.width = px(s.width);\n layer.style.height = px(s.height);\n };\n /**\n * 合わせた図。頁が図の幅だけを替えて縮める時 (見本帳の枠に合わせた倍率など) は枠の大きさが変わらず、\n * 再生の部品は合わせ直さない。図の大きさが替わるたびに層を合わせ直し、元の大きさの層が枠からはみ出さないようにする\n */\n let fitted: { frame: HTMLElement; svg: SVGSVGElement } | undefined;\n const Observer = (doc.defaultView as (Window & { ResizeObserver?: typeof ResizeObserver }) | null)\n ?.ResizeObserver;\n const resized = Observer\n ? new Observer(() => {\n if (fitted) fitLayer(fitted.frame, fitted.svg);\n })\n : undefined;\n /** 入力の帯の行の大きさが変わったら、次の行へ送った欄を決め直す (#3492) */\n const rowResized = Observer ? new Observer(() => settle()) : undefined;\n rowResized?.observe(row);\n\n return {\n tools,\n layer,\n update,\n arrange: (view, fallback) => {\n const inner = (tools.clientWidth || fallback) - (LOOK.player.ask.pad + LOOK.stroke.hair) * 2;\n const next = view === \"fixed\" && inner >= LOOK.player.narrow;\n if (next === over) return;\n over = next;\n move();\n },\n fit: (frame, svg) => {\n if (fitted?.svg !== svg) {\n if (fitted) resized?.unobserve(fitted.svg);\n resized?.observe(svg);\n }\n fitted = { frame, svg };\n fitLayer(frame, svg);\n },\n mark: (svg, step) => {\n if (edits.size === 0) return;\n const chains = current.states[step]?.chains ?? {};\n const editable = new Set(\n Object.entries(chains)\n .filter(([id]) => edits.has(id))\n .flatMap(([, blocks]) => blocks.flatMap((b) => b.items)),\n );\n for (const chip of svg.querySelectorAll(\"[data-chip]\"))\n chip.toggleAttribute(\"data-editable\", editable.has(chip.getAttribute(\"data-chip\") ?? \"\"));\n },\n pick: (item, step) => {\n const chains = current.states[step]?.chains ?? {};\n const chain = Object.entries(chains).find(([, blocks]) =>\n blocks.some((b) => b.items.includes(item)),\n )?.[0];\n const name = chain === undefined ? undefined : edits.get(chain);\n if (name !== undefined) openEdit(item, name);\n },\n refuse,\n destroy: () => {\n resized?.disconnect();\n rowResized?.disconnect();\n tools.removeEventListener(\"click\", onClick);\n tools.removeEventListener(\"submit\", onSubmit);\n tools.removeEventListener(\"input\", onInput);\n tools.removeEventListener(\"keydown\", onKey);\n layer.removeEventListener(\"click\", onClick);\n tools.remove();\n layer.remove();\n },\n };\n}\n","/**\n * 試す図の描く部品の組 (#3337、#3656)。並べ方と、寄って追う窓が段ごとに見る所と、全体図に描く部品は図の種類の置き場 (`kinds/try/layout.ts`)、\n * 網と待ち行列と機械の列とチップの描き方と、窓を寄せる所は `render/try.ts` が持つ\n */\nimport { anchoredCenter, drawTry } from \"../render/try\";\nimport type { KindParts } from \"./parts\";\nimport { layoutTry, type TryLayout, tryFocusParts, tryOverview } from \"./try/layout\";\n\nexport const parts: KindParts<TryLayout> = {\n layout: (diagram, lang, options) => layoutTry(diagram, lang, options.width === undefined ? {} : { width: options.width }),\n draw: (layout, diagram, ctx) => drawTry(layout, diagram, ctx.t, ctx),\n // その段の出来事が触る部品を、出来事が着く所から順に見る\n focus: tryFocusParts,\n // 出来事が着く所 (送った先の待ち行列、作ったブロック、書き換えたブロック) を窓から外さずに寄せる\n aim: (_layout, _timeline, _step, rects, vw, vh) => anchoredCenter(rects, vw, vh),\n // 待ち行列の枠を地に、網の節と出ているブロックを札に描く\n overview: tryOverview,\n};\n\n/** 試す図の再生の部品の操作 (#3337)。再生の部品は試す図を描けた後に、登録簿から引いて置く */\nexport { mountTryControls, type TryControls } from \"../try-player\";\n"]}
1
+ {"version":3,"sources":["/Users/cardene/Desktop/projects/dragon-3715-release-0-76-0/packages/dragon/dist/light/try-OV4XRYFL.cjs","../../src/blocks/ask/draw.ts","../../src/try-text.ts","../../src/kinds/try/layout.ts","../../src/blocks/chain/draw.ts","../../src/blocks/log/draw.ts","../../src/blocks/queue/draw.ts","../../src/blocks/route/draw.ts","../../src/render/try.ts","../../src/blocks/press/draw.ts","../../src/try-player.ts","../../src/kinds/try.ts"],"names":["cls","k","parts"],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACA;AChCA,IAAM,EAAA,EAAI,0BAAA;AACV,IAAM,EAAA,EAAI,CAAA,CAAE,IAAA;AAGL,SAAS,QAAA,CAAS,CAAA,EAAiB;AACxC,EAAA,MAAM,EAAE,MAAA,EAAQ,OAAA,EAAS,GAAA,EAAK,OAAA,EAAS,KAAA,EAAO,QAAA,EAAU,MAAA,EAAQ,MAAA,EAAQ,GAAA,EAAAA,IAAAA,EAAK,IAAI,EAAA,EAAI,CAAA;AACrF,EAAA,MAAM,SAAA,EAAW,IAAI,GAAA,CAAA,kCAAK,OAAA,qBAAQ,GAAA,6BAAK,OAAA,UAAS,CAAC,GAAA,CAAA,CAAG,GAAA,CAAI,CAAC,IAAA,EAAA,GAAS,IAAA,CAAK,EAAE,CAAC,CAAA;AAC1E,EAAA,MAAM,QAAA,EAAU;AAAA,IACd,GAAG,IAAI,GAAA;AAAA,MACL,OAAA,CAAQ,OAAA,CAAQ,CAAC,EAAA,EAAA,GAAO,CAAC,GAAG,MAAA,CAAO,OAAA,CAAQ,EAAA,CAAG,KAAK,CAAA,CAAE,OAAA,CAAQ,CAAC,CAAC,EAAA,EAAI,EAAE,CAAA,EAAA,GAAO,GAAA,EAAK,CAAC,EAAE,EAAA,EAAI,CAAC,CAAE,CAAA,EAAG,GAAI,EAAA,CAAG,KAAA,EAAO,CAAC,EAAA,CAAG,IAAA,CAAK,IAAI,EAAA,EAAI,CAAC,CAAE,CAAC;AAAA,IACnI;AAAA,EACF,CAAA;AACA,EAAA,IAAA,CAAA,MAAW,GAAA,GAAM,OAAA,EAAS;AACxB,IAAA,MAAM,MAAA,EAAQ,KAAA;AAAA,MACZ,OAAA,CAAQ,GAAA,CAAI,CAAC,EAAA,EAAA,oBAAO,EAAA,CAAG,KAAA,CAAM,EAAE,CAAA,UAAK,MAAI,CAAA;AAAA,MACxC,CAACC,EAAAA,EAAAA,mBAAO,OAAA,qBAAQA,EAAC,CAAA,6BAAG,IAAA,6BAAM,OAAA,IAAS,GAAA,kBAAK,OAAA,qBAAQA,EAAC,CAAA,6BAAG,IAAA,6BAAM,SAAA,EAAS,KAAA;AAAA,IACrE,CAAA;AACA,IAAA,MAAM,KAAA,mBAAO,MAAA,CAAO,KAAA,CAAM,EAAE,CAAA,UAAK,IAAA;AACjC,IAAA,MAAM,GAAA,EAAK,0CAAA,GAAW,CAAI,MAAA,EAAQ,CAAA,CAAE,MAAM,CAAA;AAC1C,IAAA,MAAM,SAAA,EAAW,CAAA,CAAE,EAAA,EAAI,EAAA,EAAI,sBAAA,CAAK,QAAA,CAAS,GAAA;AACzC,IAAA,MAAM,SAAA,EAAW,qCAAA,KAAM,CAAA,EAAWD,IAAAA,CAAI,WAAA,EAAa,IAAI,CAAA,EAAG,CAAA,CAAE,IAAA,EAAM,QAAA,EAAU,IAAA,EAAM,sBAAA,CAAK,OAAO,CAAA;AAC9F,IAAA,MAAA;AAAA,MACE,IAAA;AAAA,MACA,uCAAA,IAAY,EAAA,EAAI,sCAAA,sBAAO,CAAK,OAAO,EAAA,EAAI,sBAAA,CAAK,OAAA;AAAA,MAC5C,KAAA,CAAM,KAAA;AAAA,MACN,CAAA,CAAE,IAAA;AAAA,MACF;AAAA,IACF,CAAA;AACA,IAAA,MAAM,MAAA,EAAQ,MAAA,CAAO,UAAA;AACrB,IAAA,MAAM,OAAA,EACJ,MAAA,IAAU,KAAA,EAAA,EAAY,CAAC,EAAA,EAAI,OAAA,CAAQ,GAAA,CAAI,CAAC,EAAA,EAAA,oCAAO,EAAA,uBAAG,KAAA,uBAAM,KAAA,uBAAM,EAAE,CAAA,8BAAA,CAAI,KAAK,GAAA,UAAK,IAAE,CAAA;AAClF,IAAA,MAAM,UAAA,EACJ,MAAA,IAAU,KAAA,EAAA,EACN,GAAA,EACA,MAAA;AAAA,MACE,MAAA;AAAA,MACA,MAAA,CAAO,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,IAAA;AAAA,MAClB,QAAA;AAAA,MACAA,IAAAA,CAAI,WAAA,EAAa,MAAA,CAAO,IAAA,CAAK,EAAE,CAAC,CAAA;AAAA,MAChC;AAAA,IACF,CAAA;AACN,IAAA,IAAA,CAAA,MAAW,EAAA,GAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AAChC,MAAA,MAAM,MAAA,EAAQ,uCAAA,CAAQ,CAAE,KAAK,EAAA,EAAI,sCAAA,sBAAO,CAAK,YAAY,EAAA,EAAI,sBAAA,CAAK,YAAA;AAClE,MAAA,MAAA;AAAA,QACE,CAAA,CAAE,KAAA;AAAA,QACF,KAAA;AAAA,QACA,KAAA,CAAM,KAAA;AAAA,QACN,MAAA,CAAO,IAAA,CAAK,EAAA,EAAI,CAAA,CAAE,KAAA,EAAO,uCAAA,CAAQ,CAAE,KAAA,EAAO,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,CAAE,CAAA;AAAA,QACvD,QAAA;AAAA,QACA,OAAA;AAAA,QACA,CAAC,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,EAAE;AAAA,MACf,CAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,EAAO,CAAC,QAAA,CAAS,GAAA,CAAI,EAAE,CAAA;AAC7B,IAAA,GAAA,CAAI,IAAA;AAAA,MACF,CAAA,2BAAA,EAA8B,mCAAA,EAAM,CAAC,CAAA,SAAA,EAAY,kCAAA,CAAG,CAAE,KAAA,CAAM,IAAI,CAAC,CAAA,CAAA,EAAI,KAAA,CAAM,KAAK,CAAA,eAAA,EAAkB,KAAA,EAAO,cAAA,EAAgB,aAAa,CAAA,SAAA,EAAY,kCAAA,MAAG,CAAO,IAAA,CAAK,CAAC,CAAC,CAAA,UAAA,EAAa,CAAA,CAAE,CAAC,CAAA,MAAA,EAAS,EAAE,CAAA,GAAA,EAAM,QAAQ,CAAA,EAAA;AAC9M,IAAA;AACF,EAAA;AACF;AD4BmN;AACA;AExClG;AAE1D;AACjD,EAAA;AACuB,IAAA;AACC,IAAA;AACE,IAAA;AACJ,IAAA;AACS,IAAA;AACF,IAAA;AACrB,IAAA;AACC,IAAA;AAC4D,IAAA;AAC/D,IAAA;AACK,IAAA;AACJ,IAAA;AACC,IAAA;AACA,IAAA;AACqC,IAAA;AACF,IAAA;AACK,IAAA;AACL,IAAA;AAC0B,IAAA;AAC7D,IAAA;AACqB,IAAA;AACjB,IAAA;AACY,IAAA;AAIK,IAAA;AACC,IAAA;AAEG,IAAA;AAEM,IAAA;AAC+C,IAAA;AAElC,IAAA;AACV,IAAA;AAEnB,IAAA;AAC3B,EAAA;AACI,EAAA;AACyB,IAAA;AACF,IAAA;AACmC,IAAA;AAC/B,IAAA;AACwC,IAAA;AAC3B,IAAA;AAChC,IAAA;AACC,IAAA;AAC4E,IAAA;AAC/E,IAAA;AACK,IAAA;AACJ,IAAA;AACC,IAAA;AACA,IAAA;AACwC,IAAA;AACC,IAAA;AACQ,IAAA;AACE,IAAA;AAC0B,IAAA;AAC7E,IAAA;AACqB,IAAA;AACjB,IAAA;AACiB,IAAA;AAImB,IAAA;AACV,IAAA;AAEgD,IAAA;AAEY,IAAA;AAEK,IAAA;AAEY,IAAA;AAC9D,IAAA;AAEnB,IAAA;AACtC,EAAA;AACF;AF0BmN;AACA;AGpJzM;AACE;AACA;AACA;AAiJkC;AAGuC;AAGH;AAQP;AAChD,EAAA;AACc,EAAA;AACd,EAAA;AACG,IAAA;AACkB,MAAA;AACgD,MAAA;AAC3F,IAAA;AACqB,EAAA;AACwB,EAAA;AAClC,IAAA;AACa,IAAA;AACG,MAAA;AACD,QAAA;AACkE,QAAA;AAClD,QAAA;AACF,QAAA;AAChB,QAAA;AACb,QAAA;AACT,MAAA;AACS,IAAA;AACd,EAAA;AACuD,EAAA;AACsB,EAAA;AACf,EAAA;AACjB,EAAA;AACqB,EAAA;AACC,EAAA;AACpB,EAAA;AACjD;AAYuB;AACkB,EAAA;AAC3B,EAAA;AACa,IAAA;AACW,MAAA;AACE,MAAA;AACf,MAAA;AACpB,IAAA;AACH,EAAA;AAC+E,EAAA;AACnD,EAAA;AACgB,EAAA;AAEA,EAAA;AACnB,EAAA;AACG,IAAA;AACwB,MAAA;AACrB,QAAA;AACuB,QAAA;AACnC,QAAA;AACO,QAAA;AACtB,MAAA;AACD,IAAA;AACkC,EAAA;AACT,EAAA;AACM,IAAA;AACC,MAAA;AACmB,MAAA;AACnD,IAAA;AAC4C,IAAA;AACmC,IAAA;AACrE,IAAA;AACkD,MAAA;AAC3D,MAAA;AACF,IAAA;AAEmC,IAAA;AAC6B,MAAA;AACnC,QAAA;AACS,QAAA;AACnC,MAAA;AAC0F,MAAA;AAC5F,IAAA;AACkH,IAAA;AAC3B,IAAA;AAC1F,EAAA;AACO,EAAA;AACT;AAea;AACgB,EAAA;AACwB,EAAA;AAChB,EAAA;AACR,EAAA;AACV,EAAA;AAI+C,EAAA;AACpC,EAAA;AACO,EAAA;AACnB,IAAA;AACoB,IAAA;AACD,MAAA;AACP,MAAA;AAIlB,MAAA;AACI,MAAA;AACF,QAAA;AACC,QAAA;AACP,QAAA;AAC6C,QAAA;AACG,QAAA;AACG,QAAA;AACN,QAAA;AAC9C,MAAA;AACF,IAAA;AACsB,IAAA;AACxB,EAAA;AAKwB,EAAA;AACE,EAAA;AACY,EAAA;AAC3B,EAAA;AACC,EAAA;AACK,EAAA;AACyC,IAAA;AACjC,MAAA;AAC0C,MAAA;AAC7C,MAAA;AAC4D,QAAA;AACjF,IAAA;AACiB,EAAA;AACf,IAAA;AACgE,IAAA;AACpE,EAAA;AACsB,EAAA;AAOT,EAAA;AACwD,EAAA;AAGG,EAAA;AAChB,EAAA;AACC,IAAA;AACjC,IAAA;AACxB,EAAA;AAE4D,EAAA;AAEyC,EAAA;AAC5C,EAAA;AAC3B,IAAA;AACgF,IAAA;AAC9G,EAAA;AAEkD,EAAA;AACc,IAAA;AAChB,IAAA;AAChD,EAAA;AAC2C,EAAA;AACd,IAAA;AACX,IAAA;AACF,IAAA;AACM,MAAA;AAC+B,QAAA;AACiC,UAAA;AACV,IAAA;AAC5C,IAAA;AACuG,MAAA;AACrI,IAAA;AACwI,IAAA;AAC7G,IAAA;AACiD,IAAA;AACkB,IAAA;AAChG,EAAA;AAC4D,EAAA;AAGhB,EAAA;AAEiF,EAAA;AAMjB,EAAA;AACpE,EAAA;AACf,IAAA;AACwB,IAAA;AACjD,EAAA;AACgF,EAAA;AAC1D,EAAA;AAE6E,EAAA;AACrE,EAAA;AAGyB,EAAA;AAC5B,IAAA;AACsE,MAAA;AAC/F,IAAA;AAC4C,IAAA;AAC9C,EAAA;AAEyE,EAAA;AAG1C,EAAA;AACwE,IAAA;AACvG,EAAA;AAC6C,EAAA;AACG,IAAA;AAC6D,IAAA;AACjB,IAAA;AAElB,IAAA;AAC+B,IAAA;AACG,IAAA;AAC3D,IAAA;AACjD,EAAA;AACoC,EAAA;AACwB,IAAA;AAC5D,EAAA;AAEoE,EAAA;AACiB,EAAA;AAEpB,EAAA;AAIxD,EAAA;AACH,IAAA;AACgD,IAAA;AACZ,IAAA;AACyB,IAAA;AAI7D,EAAA;AAC2B,EAAA;AAGkE,EAAA;AACpE,EAAA;AACD,EAAA;AACE,EAAA;AACN,IAAA;AACgB,IAAA;AACJ,IAAA;AACrB,IAAA;AACjB,EAAA;AAEkD,EAAA;AACZ,IAAA;AACoB,IAAA;AACtB,IAAA;AACmF,IAAA;AACvH,EAAA;AAEgC,EAAA;AACE,EAAA;AACA,EAAA;AACA,EAAA;AACJ,EAAA;AACZ,EAAA;AACoD,EAAA;AAC9D,IAAA;AACH,IAAA;AACoB,IAAA;AACzB,EAAA;AAC0B,EAAA;AACK,IAAA;AACjB,IAAA;AACc,IAAA;AACA,IAAA;AACL,IAAA;AACR,IAAA;AAC2B,IAAA;AACb,MAAA;AACE,MAAA;AACb,QAAA;AACkB,QAAA;AACI,QAAA;AACnB,QAAA;AACL,UAAA;AACW,YAAA;AACf,cAAA;AACuG,cAAA;AAC/F,YAAA;AACZ,UAAA;AACF,QAAA;AAIyE,QAAA;AACN,QAAA;AACpC,QAAA;AACiG,QAAA;AACtG,QAAA;AACC,UAAA;AACiH,UAAA;AAC3I,QAAA;AAE0D,QAAA;AACpB,QAAA;AACnB,UAAA;AAChB,YAAA;AACiB,YAAA;AACqB,YAAA;AACuD,YAAA;AACzC,YAAA;AACpD,UAAA;AACJ,QAAA;AAC8C,QAAA;AACjB,QAAA;AACL,QAAA;AACC,UAAA;AACD,YAAA;AAGoD,YAAA;AAEtE,cAAA;AACgB,YAAA;AACA,YAAA;AAC8B,YAAA;AACvB,YAAA;AACA,YAAA;AACd,YAAA;AACT,cAAA;AACA,cAAA;AACQ,cAAA;AACyB,gBAAA;AACA,gBAAA;AACjC,cAAA;AACD,YAAA;AACF,UAAA;AAC8D,QAAA;AACY,QAAA;AAClE,QAAA;AACA,UAAA;AACH,UAAA;AAC4C,UAAA;AACnD,QAAA;AAC+B,QAAA;AACA,MAAA;AACpB,QAAA;AACuB,QAAA;AACH,QAAA;AACD,QAAA;AACnB,QAAA;AACP,UAAA;AACA,UAAA;AAC0D,UAAA;AAC7C,UAAA;AAClB,QAAA;AACsD,QAAA;AACvC,UAAA;AACW,UAAA;AACrB,UAAA;AACE,UAAA;AACL,QAAA;AAII,QAAA;AACQ,UAAA;AACwB,UAAA;AACqB,UAAA;AACrD,QAAA;AACM,QAAA;AACD,UAAA;AACwB,UAAA;AACjC,UAAA;AACA,UAAA;AACuB,UAAA;AACxB,QAAA;AACU,QAAA;AACA,UAAA;AACH,UAAA;AACoD,UAAA;AAC1D,UAAA;AACD,QAAA;AACsC,QAAA;AACT,MAAA;AACG,QAAA;AACoC,QAAA;AAE0B,QAAA;AACpE,QAAA;AACsB,QAAA;AACsB,QAAA;AAC7B,QAAA;AACc,QAAA;AACJ,QAAA;AAGF,QAAA;AAK1B,QAAA;AAES,QAAA;AACpB,QAAA;AACa,UAAA;AACqB,YAAA;AACpB,YAAA;AACQ,cAAA;AAC9B,YAAA;AACH,UAAA;AACoG,QAAA;AAC3E,QAAA;AACG,QAAA;AAGgF,QAAA;AACrD,QAAA;AAC/C,QAAA;AACC,UAAA;AACwB,UAAA;AAC5B,UAAA;AACL,UAAA;AACA,UAAA;AACwD,UAAA;AACxB,YAAA;AACU,YAAA;AACzC,UAAA;AACD,UAAA;AACgB,UAAA;AACqB,UAAA;AACrC,UAAA;AACuC,UAAA;AACjC,UAAA;AACU,YAAA;AACkD,YAAA;AAClE,UAAA;AAC2E,UAAA;AAC7D,UAAA;AAC8D,YAAA;AAC5E,UAAA;AAEI,UAAA;AACgB,YAAA;AACO,cAAA;AACf,gBAAA;AACsI,gBAAA;AACzI,cAAA;AACH,YAAA;AAED,UAAA;AACN,QAAA;AACsE,QAAA;AACqB,QAAA;AAC5D,QAAA;AAC3B,MAAA;AACa,QAAA;AAChB,UAAA;AACqF,UAAA;AACvF,QAAA;AAC4D,QAAA;AAClB,QAAA;AACR,QAAA;AACY,QAAA;AACU,QAAA;AAChB,QAAA;AACA,QAAA;AACpB,QAAA;AAC0D,UAAA;AAC9E,QAAA;AACmB,QAAA;AACgE,UAAA;AACnF,QAAA;AACY,QAAA;AACD,UAAA;AACwB,UAAA;AAC5B,UAAA;AACL,UAAA;AACG,UAAA;AACU,UAAA;AAAuB,YAAA;AAC2C,YAAA;AAC/E,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AACA,UAAA;AAAA;AAEM,UAAA;AACU,YAAA;AACkD,YAAA;AAClE,UAAA;AAC0E,UAAA;AAC5D,UAAA;AACuD,YAAA;AACrE,UAAA;AACD,QAAA;AAE4E,QAAA;AAClE,QAAA;AACA,UAAA;AACH,UAAA;AAC4C,UAAA;AACnD,QAAA;AAC+B,QAAA;AAClC,MAAA;AACiB,MAAA;AACnB,IAAA;AACI,IAAA;AACN,EAAA;AAGoD,EAAA;AACA,EAAA;AACA,EAAA;AACJ,EAAA;AACgB,EAAA;AACjB,IAAA;AACC,IAAA;AACC,IAAA;AAEgB,IAAA;AACvC,MAAA;AACkC,MAAA;AAC5B,MAAA;AAC4B,QAAA;AAC+B,QAAA;AACtF,MAAA;AACH,IAAA;AAC2D,IAAA;AACA,IAAA;AACjC,MAAA;AACE,MAAA;AACD,QAAA;AACgB,QAAA;AACxC,MAAA;AACH,IAAA;AAC2D,IAAA;AACjC,MAAA;AACgC,MAAA;AAC7B,MAAA;AAC4B,QAAA;AACmC,QAAA;AAC1D,QAAA;AACG,QAAA;AAC2C,UAAA;AAC3E,QAAA;AACF,MAAA;AACH,IAAA;AAEsF,IAAA;AACvC,IAAA;AAGJ,IAAA;AACY,MAAA;AACE,MAAA;AAElD,IAAA;AACA,IAAA;AACF,MAAA;AACH,MAAA;AACA,MAAA;AACqC,MAAA;AAGhC,MAAA;AACP,IAAA;AACD,EAAA;AAEM,EAAA;AACC,IAAA;AAC2B,IAAA;AACjC,IAAA;AACc,IAAA;AACJ,IAAA;AACF,IAAA;AACI,IAAA;AACJ,IAAA;AACC,IAAA;AACC,IAAA;AAAA;AAED,IAAA;AACD,IAAA;AACD,IAAA;AACPE,IAAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACA,IAAA;AACkC,IAAA;AACT,IAAA;AACwB,IAAA;AACjD,IAAA;AACF,EAAA;AACF;AAS8F;AAC9B,EAAA;AACxB,EAAA;AACpB,EAAA;AACmB,EAAA;AAEI,EAAA;AAC8B,EAAA;AACnB,IAAA;AACL,IAAA;AACa,IAAA;AAC5D,EAAA;AACsE,EAAA;AACrB,IAAA;AACA,IAAA;AACW,IAAA;AAC5D,EAAA;AAEsB,EAAA;AACC,EAAA;AACD,EAAA;AACuC,EAAA;AACnC,IAAA;AAC1B,EAAA;AAC0D,EAAA;AACZ,IAAA;AAKtC,IAAA;AACwC,IAAA;AACjB,MAAA;AACS,MAAA;AACL,IAAA;AACuD,MAAA;AAEqC,MAAA;AAC3E,MAAA;AACf,IAAA;AACb,MAAA;AACoE,QAAA;AACxF,MAAA;AACgB,MAAA;AACyD,MAAA;AACzC,IAAA;AAEG,MAAA;AAC6C,QAAA;AACrE,MAAA;AACkE,MAAA;AACnC,MAAA;AAC1B,QAAA;AACgC,QAAA;AAG1C,QAAA;AACG,UAAA;AAG4D,YAAA;AACjE,UAAA;AACG,MAAA;AAC0C,QAAA;AACrB,UAAA;AACrB,QAAA;AACqB,QAAA;AAC5B,MAAA;AACF,IAAA;AACD,EAAA;AACiC,EAAA;AACpC;AAGmE;AAC3C,EAAA;AAC+B,EAAA;AACnC,EAAA;AACX,EAAA;AAC2D,IAAA;AAC/C,IAAA;AACS,MAAA;AAC6B,QAAA;AAC7C,QAAA;AACN,QAAA;AACA,MAAA;AACJ,IAAA;AACiB,IAAA;AACiC,MAAA;AACE,QAAA;AACsC,QAAA;AACvF,MAAA;AACH,IAAA;AACuB,IAAA;AAC2B,MAAA;AACM,QAAA;AACkC,QAAA;AACvF,MAAA;AACH,IAAA;AACF,EAAA;AACF;AHtImN;AACA;AInwBzM;AACE;AACA;AAG+B;AACH,EAAA;AACH,EAAA;AAC5B,IAAA;AAC8E,MAAA;AACnF,IAAA;AAC6B,IAAA;AAC/B,EAAA;AACF;AAG6D;AAC8B,EAAA;AAC3E,EAAA;AACE,EAAA;AAC4E,IAAA;AACtE,EAAA;AAEwC,EAAA;AAC9B,EAAA;AACgB,EAAA;AAOnC,EAAA;AACa,IAAA;AACuC,IAAA;AACX,IAAA;AACrB,IAAA;AACwD,MAAA;AAGvD,IAAA;AAElC,EAAA;AACkC,EAAA;AACA,IAAA;AAC+B,IAAA;AACd,IAAA;AACnC,IAAA;AACR,MAAA;AACyB,MAAA;AAC7B,MAAA;AACkG,MAAA;AACpG,IAAA;AACwB,IAAA;AACsC,MAAA;AAC9D,IAAA;AAIsK,IAAA;AAC7H,IAAA;AAC9B,IAAA;AACT,MAAA;AACsB,MAAA;AACpB,MAAA;AACuB,MAAA;AACzB,MAAA;AACK,MAAA;AACP,IAAA;AACA,IAAA;AACE,MAAA;AACgD,MAAA;AAC1C,MAAA;AACJ,MAAA;AACuB,MAAA;AAC3B,IAAA;AAC0E,IAAA;AACC,IAAA;AACuB,IAAA;AACT,IAAA;AACkH,IAAA;AAC5M,EAAA;AAIiD,EAAA;AACA,EAAA;AACT,EAAA;AACd,EAAA;AACS,EAAA;AACe,EAAA;AACrC,EAAA;AAER,IAAA;AACgB,MAAA;AACF,MAAA;AACE,MAAA;AACE,MAAA;AAElB,IAAA;AAC2B,MAAA;AACX,MAAA;AACA,MAAA;AACE,MAAA;AAClB,IAAA;AACA,IAAA;AACN,EAAA;AACqB,EAAA;AACkD,EAAA;AAGzD,EAAA;AACsB,IAAA;AACO,IAAA;AACb,IAAA;AACuB,MAAA;AACjD,IAAA;AAC6B,IAAA;AAC6D,IAAA;AAC9B,IAAA;AACP,IAAA;AACX,IAAA;AAChB,MAAA;AACgE,MAAA;AAI7B,MAAA;AAC7B,MAAA;AAGgG,MAAA;AAGhI,IAAA;AACoI,IAAA;AACrI,EAAA;AAGgC,EAAA;AACU,IAAA;AACP,IAAA;AACrC,EAAA;AAC4D,EAAA;AAKzC,EAAA;AACyC,IAAA;AAGnC,IAAA;AACa,IAAA;AACqB,IAAA;AACpC,IAAA;AACR,MAAA;AACiB,MAAA;AACV,MAAA;AACiC,MAAA;AAC5C,MAAA;AAC4C,MAAA;AAC7B,MAAA;AACjB,IAAA;AAC2M,IAAA;AAEpM,EAAA;AACiG,EAAA;AACpH;AJ6tBmN;AACA;AKp4BzM;AACE;AACA;AAG6B;AACD,EAAA;AACD,EAAA;AAC0D,IAAA;AACpE,IAAA;AAC3B,EAAA;AACF;AAGuD;AACqD,EAAA;AAC5F,EAAA;AACiE,EAAA;AACjC,EAAA;AAC9B,EAAA;AAC0E,IAAA;AACpE,EAAA;AAEsC,EAAA;AACtC,EAAA;AACmB,EAAA;AACX,EAAA;AAEK,EAAA;AACkD,IAAA;AACtC,IAAA;AAC/B,IAAA;AACR,MAAA;AACyB,MAAA;AAC7B,MAAA;AAC8F,MAAA;AAChG,IAAA;AAC8F,IAAA;AAI0E,IAAA;AACjI,IAAA;AACN,IAAA;AACuD,IAAA;AACU,IAAA;AAGvF,IAAA;AACO,IAAA;AACQ,IAAA;AACgB,IAAA;AAC0E,MAAA;AACvD,MAAA;AAChC,MAAA;AACD,MAAA;AACiB,MAAA;AACI,MAAA;AACM,MAAA;AAEpC,MAAA;AAC2E,QAAA;AACwB,QAAA;AACjD,QAAA;AACtC,QAAA;AACoD,UAAA;AACiC,QAAA;AAG0C,QAAA;AAIlJ,MAAA;AACZ,IAAA;AAGyG,IAAA;AAEvF,IAAA;AACuB,MAAA;AACJ,MAAA;AAC6B,MAAA;AAC6C,MAAA;AACzC,MAAA;AAChD,MAAA;AAC6E,MAAA;AAC7D,MAAA;AACwF,MAAA;AACxF,MAAA;AACkC,QAAA;AACiD,QAAA;AACrH,MAAA;AAC0L,MAAA;AAEpL,IAAA;AAG4B,IAAA;AACwB,MAAA;AACQ,MAAA;AAE7B,IAAA;AACqB,MAAA;AACwC,MAAA;AACsG,MAAA;AAGxM,IAAA;AAC0G,IAAA;AAC/G,EAAA;AAGgG,EAAA;AACpC,EAAA;AAKzC,EAAA;AACuC,IAAA;AACS,IAAA;AACH,IAAA;AAC5B,IAAA;AACqB,IAAA;AACkG,IAAA;AACyD,IAAA;AAEpM,EAAA;AACyE,EAAA;AAC5F;ALq2BmN;AACA;AMh/BzM;AACE;AAGiC;AACN,EAAA;AACF,EAAA;AACwB,IAAA;AAC7C,IAAA;AACN,MAAA;AACJ,MAAA;AACM,MAAA;AACqI,MAAA;AAC7I,IAAA;AAEI,IAAA;AACM,MAAA;AACJ,MAAA;AACW,MAAA;AACA,MAAA;AACA,MAAA;AACN,MAAA;AAEP,IAAA;AACC,IAAA;AAC6I,MAAA;AAClJ,IAAA;AACF,EAAA;AACF;AN8+BmN;AACA;AOpgCzM;AAGgC;AACuC,EAAA;AACjE,EAAA;AACqB,EAAA;AAEf,IAAA;AAC6E,MAAA;AAC3E,MAAA;AACG,MAAA;AACkL,MAAA;AAE/L,IAAA;AAEI,IAAA;AAE6D,MAAA;AACL,MAAA;AAE5D,IAAA;AAEI,IAAA;AACY,MAAA;AAC8C,MAAA;AACtD,MAAA;AACR,QAAA;AACgD,QAAA;AAClD,QAAA;AAC0D,QAAA;AAC1D,QAAA;AAC0C,QAAA;AAC5C,QAAA;AACA,QAAA;AACF,MAAA;AACmM,MAAA;AAE7L,IAAA;AACL,IAAA;AACsF,MAAA;AAC3F,IAAA;AAC6F,IAAA;AAClE,IAAA;AACQ,MAAA;AACmB,MAAA;AACwB,MAAA;AAC/B,MAAA;AACxB,QAAA;AACQ,QAAA;AAC5B,MAAA;AACsB,MAAA;AACJ,MAAA;AACf,MAAA;AAC6J,QAAA;AACjK,MAAA;AACD,IAAA;AACH,EAAA;AACF;AP6/BmN;AACA;AQrjCpM;AACA;AAMC;AACkB,EAAA;AACS,EAAA;AACsB,EAAA;AACA,EAAA;AACQ,EAAA;AACC,EAAA;AACT,EAAA;AAC/B,EAAA;AACS,EAAA;AACzC,EAAA;AACoE,EAAA;AAClC,EAAA;AACqC,EAAA;AACE,EAAA;AACzC,EAAA;AACS,EAAA;AACJ,EAAA;AACS,EAAA;AACwB,EAAA;AACnC,EAAA;AACS,EAAA;AAC0B,EAAA;AAC6B,EAAA;AACjE,EAAA;AACE,EAAA;AACpC,EAAA;AACoC,EAAA;AACuB,EAAA;AACK,EAAA;AAChC,EAAA;AACuC,EAAA;AACvC,EAAA;AACS,EAAA;AAClC;AAMO;AACyD,EAAA;AAClC,EAAA;AACS,EAAA;AACvC;AAGmE;AAGc;AAEf;AAGP;AAuDK;AACzD,EAAA;AACS,EAAA;AAC6B,EAAA;AAEH,EAAA;AACD,IAAA;AACoC,IAAA;AACzC,IAAA;AAChB,IAAA;AACyD,IAAA;AACnF,EAAA;AASyC,EAAA;AAC4B,IAAA;AACK,IAAA;AAC/C,IAAA;AACc,IAAA;AAC5B,IAAA;AACG,IAAA;AAC4B,IAAA;AACZ,MAAA;AACV,MAAA;AACA,MAAA;AACW,MAAA;AAEgD,MAAA;AACjD,MAAA;AAEP,QAAA;AAC8B,QAAA;AACE,QAAA;AAC7C,QAAA;AACsD,UAAA;AACP,UAAA;AACtD,QAAA;AAGuF,QAAA;AAClC,QAAA;AACxC,QAAA;AACmB,QAAA;AACT,UAAA;AACT,UAAA;AAC8B,YAAA;AACF,YAAA;AACvC,UAAA;AACF,QAAA;AAC+B,QAAA;AACzB,QAAA;AACL,UAAA;AACE,YAAA;AACwC,YAAA;AACnC,YAAA;AACP,UAAA;AACkE,UAAA;AACpE,QAAA;AACsB,QAAA;AACC,MAAA;AAChB,QAAA;AACqD,UAAA;AACV,UAAA;AAClD,QAAA;AACuB,MAAA;AAChB,QAAA;AACsD,UAAA;AACZ,UAAA;AACjD,QAAA;AACsB,MAAA;AACf,QAAA;AACyD,UAAA;AACd,UAAA;AAClD,QAAA;AACF,MAAA;AACU,MAAA;AACJ,MAAA;AACe,MAAA;AACvB,IAAA;AACwD,IAAA;AACjD,IAAA;AACwE,MAAA;AACrB,MAAA;AAC1D,IAAA;AACoC,IAAA;AACtC,EAAA;AAG+E,EAAA;AACtB,IAAA;AAC1B,IAAA;AACI,MAAA;AACG,MAAA;AACgB,MAAA;AAC9B,MAAA;AACkC,MAAA;AACvD,IAAA;AACM,IAAA;AACT,EAAA;AAG+D,EAAA;AAClB,IAAA;AACd,IAAA;AACe,MAAA;AACqC,MAAA;AAC1D,MAAA;AACZ,QAAA;AACwB,UAAA;AACqB,UAAA;AACpD,QAAA;AACkD,MAAA;AACtD,IAAA;AACoC,IAAA;AAClB,IAAA;AACpB,EAAA;AASa,EAAA;AACgD,IAAA;AACiD,IAAA;AACxC,IAAA;AACwF,IAAA;AAC9J,EAAA;AAWW,EAAA;AACQ,IAAA;AACM,IAAA;AACc,MAAA;AACF,MAAA;AACzB,MAAA;AACO,QAAA;AACX,UAAA;AAC2D,UAAA;AAC7C,UAAA;AACf,QAAA;AACL,IAAA;AACF,EAAA;AAEwB,EAAA;AACD,EAAA;AACC,EAAA;AACD,EAAA;AAErB,EAAA;AACM,IAAA;AACkB,IAAA;AACpB,IAAA;AACA,IAAA;AACA,IAAA;AAC6C,IAAA;AACjD,EAAA;AAC+I,EAAA;AAErI,EAAA;AACG,EAAA;AACF,EAAA;AACD,EAAA;AAED,EAAA;AACJ,EAAA;AACa,IAAA;AACF,IAAA;AACE,IAAA;AACF,IAAA;AACwF,IAAA;AAC1G,EAAA;AACF;AAMoG;AAC7E,EAAA;AACF,EAAA;AACQ,EAAA;AAG2D,EAAA;AAC/E,EAAA;AACuC,IAAA;AACA,IAAA;AAC9C,EAAA;AACF;ARk8BmN;AACA;ASjxClH;AAC0B,EAAA;AACtG,EAAA;AACZ,EAAA;AAC2C,IAAA;AACS,IAAA;AAC3D,EAAA;AACF;ATmxCmN;AACA;AUrwC7K;AACW;AAGpC;AAGM;AAGO;AACT,EAAA;AACH,EAAA;AACoB,EAAA;AAEW,EAAA;AACpC,EAAA;AAC0D,IAAA;AACkE,IAAA;AACjI,IAAA;AAC6E,IAAA;AAAA;AAAA;AAG4B,IAAA;AACzG,IAAA;AAC6B,IAAA;AAC6K,IAAA;AAC3I,IAAA;AAAA;AAE4B,IAAA;AAC+D,IAAA;AAAA;AAEqD,IAAA;AACrB,IAAA;AAC5F,IAAA;AACA,IAAA;AAC7D,IAAA;AACO,IAAA;AACxC,IAAA;AAAA;AAEA,IAAA;AACA,IAAA;AACmF,IAAA;AACK,IAAA;AACxF,IAAA;AAAA;AAE0C,IAAA;AAAA;AAE1C,IAAA;AACO,EAAA;AACX;AAG4D;AACA,EAAA;AAChB,EAAA;AACH,EAAA;AAC5B,EAAA;AACgB,EAAA;AACD,EAAA;AAC5B;AA0Ee;AACW,EAAA;AACG,EAAA;AACQ,EAAA;AAC6B,EAAA;AACU,EAAA;AAExD,EAAA;AACV,IAAA;AACsE,MAAA;AAC5E,IAAA;AACF,EAAA;AAC8B,EAAA;AAEgD,EAAA;AAEzC,EAAA;AACoD,EAAA;AAC3E,EAAA;AAED,EAAA;AAEY,EAAA;AAEd,EAAA;AAEkF,EAAA;AACvD,IAAA;AAC3B,IAAA;AACK,IAAA;AACK,IAAA;AACH,IAAA;AACT,IAAA;AACT,EAAA;AAKqC,EAAA;AACE,IAAA;AACpB,IAAA;AACsB,IAAA;AAChC,IAAA;AACT,EAAA;AAEiC,EAAA;AAK0E,EAAA;AACpE,IAAA;AACrB,IAAA;AACwB,IAAA;AACpB,IAAA;AACE,IAAA;AACM,IAAA;AACxB,IAAA;AACS,IAAA;AAC8B,MAAA;AACX,MAAA;AACQ,QAAA;AAC1B,QAAA;AACM,QAAA;AACD,QAAA;AACjB,MAAA;AACgE,MAAA;AAG1C,MAAA;AACkE,MAAA;AACiC,MAAA;AACxE,MAAA;AACzC,MAAA;AACH,IAAA;AACiC,MAAA;AAC1B,MAAA;AACQ,MAAA;AACH,MAAA;AACJ,MAAA;AACL,MAAA;AACV,IAAA;AACkB,IAAA;AACI,IAAA;AACG,IAAA;AACM,IAAA;AACJ,IAAA;AAC7B,EAAA;AAEqC,EAAA;AACnB,EAAA;AAEa,EAAA;AACM,EAAA;AACpB,EAAA;AACK,EAAA;AACJ,EAAA;AAC0B,EAAA;AACT,EAAA;AACnB,EAAA;AACD,EAAA;AACiD,EAAA;AACH,EAAA;AACzC,EAAA;AACC,IAAA;AACuB,MAAA;AACpB,MAAA;AACqB,MAAA;AAC1B,MAAA;AAChB,IAAA;AACH,EAAA;AACiE,EAAA;AAC7B,EAAA;AACjB,EAAA;AACK,EAAA;AACiB,EAAA;AAChB,EAAA;AACY,EAAA;AACnB,EAAA;AACd,EAAA;AAGkF,EAAA;AAC9D,EAAA;AACqD,IAAA;AAC7E,EAAA;AAC0C,EAAA;AAC/B,IAAA;AACL,IAAA;AACN,EAAA;AAI0D,EAAA;AAE7B,EAAA;AACF,IAAA;AACG,MAAA;AACJ,MAAA;AACZ,MAAA;AAC0E,QAAA;AACrC,QAAA;AACxC,MAAA;AACwB,QAAA;AACD,QAAA;AAC9B,MAAA;AACF,IAAA;AACF,EAAA;AAKyB,EAAA;AACP,IAAA;AAC0D,MAAA;AAClC,IAAA;AAC/B,IAAA;AAEF,IAAA;AACT,EAAA;AAGoE,EAAA;AAGG,EAAA;AAGQ,EAAA;AACrC,EAAA;AAC9B,IAAA;AACa,IAAA;AACI,IAAA;AACV,IAAA;AACK,MAAA;AAC+C,MAAA;AAErB,MAAA;AACT,MAAA;AACoD,MAAA;AAC5B,MAAA;AAClC,MAAA;AAC2B,MAAA;AACN,MAAA;AAClD,IAAA;AACyB,IAAA;AACG,MAAA;AACH,MAAA;AAEkB,MAAA;AAC8B,MAAA;AAChD,MAAA;AACT,MAAA;AAC6G,QAAA;AAC7H,IAAA;AACU,IAAA;AACD,IAAA;AACL,IAAA;AACK,IAAA;AACX,EAAA;AAE8B,EAAA;AACR,oBAAA;AACX,IAAA;AACX,EAAA;AACuD,EAAA;AAC3C,IAAA;AACwD,IAAA;AACzB,IAAA;AACpB,IAAA;AACK,IAAA;AACF,IAAA;AACF,IAAA;AAC+B,IAAA;AACd,IAAA;AACnB,IAAA;AACyC,IAAA;AACrD,IAAA;AACF,MAAA;AACoC,MAAA;AACA,MAAA;AAC1C,IAAA;AACuB,IAAA;AACY,IAAA;AAC4B,IAAA;AAC/C,IAAA;AAE0D,IAAA;AAC5E,EAAA;AAE+B,EAAA;AACO,IAAA;AACf,IAAA;AACyC,IAAA;AACpC,IAAA;AAC2C,IAAA;AACvC,IAAA;AAC1B,IAAA;AACuB,MAAA;AAC8E,MAAA;AACvE,MAAA;AACjC,IAAA;AACH,EAAA;AACgD,EAAA;AACL,IAAA;AACjC,IAAA;AACe,IAAA;AACA,IAAA;AAC4C,IAAA;AAChC,IAAA;AAC+C,IAAA;AAE5D,IAAA;AACiB,MAAA;AACjC,MAAA;AAC0B,QAAA;AACwF,QAAA;AAC7E,QAAA;AACxC,MAAA;AACD,MAAA;AACF,IAAA;AACyB,IAAA;AACqB,IAAA;AAC7B,IAAA;AACb,IAAA;AAC0B,MAAA;AACkF,MAAA;AACvE,MAAA;AACxC,IAAA;AACH,EAAA;AAC8B,EAAA;AACf,IAAA;AACiB,IAAA;AACQ,IAAA;AACY,IAAA;AACe,IAAA;AAC/C,IAAA;AACiB,MAAA;AACU,MAAA;AACe,MAAA;AAC3D,IAAA;AACoB,IAAA;AACvB,EAAA;AAGwC,EAAA;AAC6B,IAAA;AACnC,IAAA;AACc,IAAA;AAC4B,IAAA;AACrC,IAAA;AACvC,EAAA;AACyC,EAAA;AAClB,IAAA;AACiB,IAAA;AACqB,IAAA;AAC7D,EAAA;AACwC,EAAA;AAGyB,IAAA;AACwD,IAAA;AACvG,MAAA;AACd,MAAA;AACF,IAAA;AACmB,IAAA;AACV,IAAA;AACL,IAAA;AACN,EAAA;AAC8C,EAAA;AACgD,IAAA;AAC9F,EAAA;AACuC,EAAA;AACE,EAAA;AACF,EAAA;AACC,EAAA;AACD,EAAA;AACA,EAAA;AAMZ,EAAA;AACgD,IAAA;AACjB,IAAA;AACvC,IAAA;AACiE,IAAA;AAC/C,IAAA;AACmD,IAAA;AACxF,EAAA;AAEK,EAAA;AACQ,EAAA;AAGsD,EAAA;AAC3B,IAAA;AACF,IAAA;AACuC,IAAA;AACL,IAAA;AACxC,IAAA;AACE,IAAA;AAClC,EAAA;AAKI,EAAA;AAEA,EAAA;AAEmB,EAAA;AAC4B,IAAA;AAE/C,EAAA;AAEyD,EAAA;AACtC,kBAAA;AAEhB,EAAA;AACL,IAAA;AACA,IAAA;AACA,IAAA;AAC6B,IAAA;AACgE,MAAA;AACrC,MAAA;AACnC,MAAA;AACZ,MAAA;AACF,MAAA;AACP,IAAA;AACqB,IAAA;AACM,MAAA;AACkB,QAAA;AACrB,wBAAA;AACtB,MAAA;AACsB,MAAA;AACH,MAAA;AACrB,IAAA;AACqB,IAAA;AACG,MAAA;AAC0B,MAAA;AAC3B,MAAA;AAGsC,QAAA;AAC3D,MAAA;AACqD,MAAA;AACqC,QAAA;AAC5F,IAAA;AACsB,IAAA;AAC4B,MAAA;AACX,MAAA;AACM,QAAA;AACtC,MAAA;AACyD,MAAA;AACnB,MAAA;AAC7C,IAAA;AACA,IAAA;AACe,IAAA;AACO,sBAAA;AACG,sBAAA;AACmB,MAAA;AACE,MAAA;AACF,MAAA;AACA,MAAA;AACA,MAAA;AAC7B,MAAA;AACA,MAAA;AACf,IAAA;AACF,EAAA;AACF;AVmnCmN;AACA;AW9qDxK;AAC+E,EAAA;AACrD,EAAA;AAAA;AAE5D,EAAA;AAAA;AAEwE,EAAA;AAAA;AAErE,EAAA;AACZ;AXgrDmN;AACA;AACA;AACA","file":"/Users/cardene/Desktop/projects/dragon-3715-release-0-76-0/packages/dragon/dist/light/try-OV4XRYFL.cjs","sourcesContent":[null,"/**\n * 入力の帯のブロックが送るチップの描き方 (#3337、#3348)。\n *\n * チップは 1 枚につき 1 つの部品 (`data-chip`) で、中の字は名前と、待ち行列が並べる順の欄の値の 2 つだけ。\n * 出来事ごとの位置を keyframes で辿り、待ち行列の席とブロックの中の席の間を滑る。\n * 網を運ばれるチップは送る側の節で現れ、最短の道の節を順に通って作る人へ着いてから待ち行列へ入る。\n * 網の節の関門で止まったチップ (#3476) は待ち行列に席を持たず、止まった節まで運ばれてそこで薄れて消える。\n * 宣言したチップは塗り、送ったチップは縁だけで描く。入力の帯そのものは再生の部品 (`try-player.ts`) が描く。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { hasWide, textBox } from \"../../layout/measure\";\nimport { TRY_LOOK } from \"../../look/try\";\nimport { LOOK, TYPE } from \"../../look/values\";\nimport { partRadius } from \"../../render/corner\";\nimport { esc, r1, sansOf, write } from \"../../render/parts\";\nimport type { TryKit } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\n\nconst T = TRY_LOOK;\nconst C = T.chip;\n\n/** チップ。1 枚につき 1 つの部品で、名前と並べる順の欄の値だけを出す */\nexport function tryChips(k: TryKit): void {\n const { layout, diagram, ctx, moments, track, phasesOf, phased, record, cls, top } = k;\n const declared = new Set((diagram.try?.items ?? []).map((item) => item.id));\n const chipIds = [\n ...new Set(\n moments.flatMap((mo) => [...Object.entries(mo.chips).flatMap(([id, at]) => (at ? [id] : [])), ...(mo.trip ? [mo.trip.item] : [])]),\n ),\n ];\n for (const id of chipIds) {\n const moved = track(\n moments.map((mo) => mo.chips[id] ?? null),\n (k) => (moments[k]?.trip?.item === id ? moments[k]?.trip?.points : undefined),\n );\n const name = layout.names[id] ?? id;\n const rx = partRadius(ctx.corner, C.radius);\n const baseline = C.h / 2 + LOOK.baseline.tag;\n const nameText = write(undefined, cls(\"dg-try-cn\", name), C.padX, baseline, name, TYPE.tryChip);\n record(\n name,\n hasWide(name) ? sansOf(TYPE.tryChip) : TYPE.tryChip,\n moved.rests,\n C.padX,\n baseline,\n );\n const field = layout.valueField;\n const values =\n field === undefined ? [] : moments.map((mo) => mo.state.items[id]?.[field] ?? \"\");\n const valueText =\n field === undefined\n ? \"\"\n : phased(\n values,\n layout.chip.w - C.padX,\n baseline,\n cls(\"dg-try-cv\", values.join(\"\")),\n \"end\",\n );\n for (const p of phasesOf(values)) {\n const style = hasWide(p.value) ? sansOf(TYPE.tryChipValue) : TYPE.tryChipValue;\n record(\n p.value,\n style,\n moved.rests,\n layout.chip.w - C.padX - textBox(p.value, 0, 0, style).w,\n baseline,\n \"start\",\n [p.from, p.to],\n );\n }\n const sent = !declared.has(id);\n top.push(\n `<g class=\"dg-a\" data-chip=\"${esc(id)}\" style=\"${cs(T.color.part)};${moved.style}\"><rect class=\"${sent ? \"dg-try-sent\" : \"dg-try-chip\"}\" width=\"${r1(layout.chip.w)}\" height=\"${C.h}\" rx=\"${rx}\"/>${nameText}${valueText}</g>`,\n );\n }\n}\n","/**\n * 試す図 (`try`、#3337) の描く部品と再生の部品が出す字。\n *\n * 試す図を描く部品と再生の部品の操作は、軽い入口では試す図の塊 (`kinds/try.ts`) と一緒に後から読む。\n * 字もその塊にだけ入るよう、どの図でも使う字 (`figure-text.ts`) と分けて持つ。言葉の渡し方は `figure-text.ts` と同じ。\n */\nimport type { NotationLang } from \"./words\";\n\nexport interface TryText {\n /**\n * 試す図 (#3337)。ブロックの番号の字、待ち行列の取り出し方 (釦が上から何件を取り出すか)、畳んだ古いブロックの数。\n * prev と hash と SHA-256 は語の名前のまま、どちらの言葉でも書き換えない\n */\n tryBlock: (n: number) => string;\n tryTakes: (n: number) => string;\n tryFolded: (n: number) => string;\n /** 記録の列の記録の番号の字 (#3441) */\n tryRecord: (n: number) => string;\n /** 記録の列で畳んだ記録の数の字 (#3441) */\n tryFoldedRecords: (n: number) => string;\n /**\n * 関門で止まった記録 (#3476) の字。止まった節の字と、`retry` を書いた関門の「再試行できる」の印と、書かない関門の「直して送り直す」の印。\n * 送ったチップが関門で止まった段の本文\n */\n tryStoppedAt: (node: string) => string;\n tryRetry: string;\n tryResend: string;\n tryStoppedBody: (name: string, node: string, error: string) => string;\n /**\n * 試す図の再生の部品 (#3337)。入力の帯と書き換える欄の読み上げの名前、送る釦と決める釦と閉じる釦の字、書き換える欄の名前。\n * 押せない訳は、満杯の待ち行列へ送れないこと、空の待ち行列から取り出せないこと、待ち行列が受け入れない名前、\n * 集める待ち行列が足りないこと、空の欄、チップの名前に使えない字、空の書き換え。\n * 読み手が足した段の題と本文は、送った、釦を押した、書き換えたの 3 つ\n */\n tryAsk: string;\n tryEditForm: string;\n trySend: string;\n tryApply: string;\n tryClose: string;\n tryEditField: (item: string, field: string) => string;\n tryFull: (queue: string, most: number) => string;\n tryEmpty: (queue: string, press: string) => string;\n /** 待ち行列 `queue` が名前 `name` のチップを受け入れないので送れない (#3453) */\n tryRefused: (queue: string, name: string) => string;\n /** 2 つ以上の待ち行列から集める釦 `press` を、待ち行列 `queue` が `take` 件に満たないので押せない (#3453) */\n tryShort: (queue: string, press: string, take: number) => string;\n tryBlank: string;\n tryBadName: (field: string) => string;\n tryBlankEdit: string;\n trySent: (name: string) => string;\n trySentBody: (name: string, into: string, via?: string) => string;\n tryPressed: (press: string) => string;\n tryPressedBody: (count: number, from: string, block: number) => string;\n /** 釦が記録の列 `log` の記録 `record` に `from` の上から `count` 件を入れた時の段の本文 (#3441) */\n tryPressedRecordBody: (count: number, from: string, log: string, record: number) => string;\n /** 釦が 2 つ以上の待ち行列 `froms` のそれぞれの上から `count` 件ずつをブロック `block` に入れた時の段の本文 (#3453) */\n tryGatheredBody: (count: number, froms: readonly string[], block: number) => string;\n /** 釦が 2 つ以上の待ち行列 `froms` のそれぞれの上から `count` 件ずつを記録の列 `log` の記録 `record` に入れた時の段の本文 (#3453) */\n tryGatheredRecordBody: (count: number, froms: readonly string[], log: string, record: number) => string;\n tryEdited: (item: string, field: string) => string;\n tryEditedBody: (field: string, from: string, to: string) => string;\n}\n\n/** 英語の文で、名札を `,` と and でつなぐ */\nconst enList = (names: readonly string[]): string =>\n names.length <= 2 ? names.join(\" and \") : `${names.slice(0, -1).join(\", \")} and ${names[names.length - 1] ?? \"\"}`;\n\nexport const TRY_TEXT: Record<NotationLang, TryText> = {\n ja: {\n tryBlock: (n) => `ブロック${n}`,\n tryTakes: (n) => `次は上から${n}件`,\n tryFolded: (n) => `古いブロック${n}つ`,\n tryRecord: (n) => `記録${n}`,\n tryFoldedRecords: (n) => `古い記録${n}つ`,\n tryStoppedAt: (node) => `${node}で止まった`,\n tryRetry: \"再試行できる\",\n tryResend: \"直して送り直す\",\n tryStoppedBody: (name, node, error) => `${name}が${node}の関門で止まった(${error})。`,\n tryAsk: \"送る値\",\n tryEditForm: \"チップを書き換える\",\n trySend: \"送る\",\n tryApply: \"決める\",\n tryClose: \"閉じる\",\n tryEditField: (item, field) => `${item}の${field}`,\n tryFull: (queue, most) => `${queue}が満杯(${most}件)なので送れない`,\n tryEmpty: (queue, press) => `${queue}が空なので「${press}」を押せない`,\n tryRefused: (queue, name) => `${queue}は${name}を受け入れないので送れない`,\n tryShort: (queue, press, take) => `${queue}のチップが${take}件に満たないので「${press}」を押せない`,\n tryBlank: \"全ての欄を埋めてから送る\",\n tryBadName: (field) => `${field}に空白と [ ] 「 」 = : は使えない`,\n tryBlankEdit: \"値を入れてから決める\",\n trySent: (name) => `${name}を送った`,\n trySentBody: (name, into, via) =>\n via === undefined\n ? `${name}が${into}に入った。`\n : `${name}が${via}を通って${into}に入った。`,\n tryPressed: (press) => `「${press}」を押した`,\n tryPressedBody: (count, from, block) =>\n `${from}の上から${count}件がブロック${block}に入った。`,\n tryPressedRecordBody: (count, from, log, record) =>\n `${from}の上から${count}件が${log}の記録${record}に入った。`,\n tryGatheredBody: (count, froms, block) => `${froms.join(\"と\")}の上から${count}件ずつがブロック${block}に入った。`,\n tryGatheredRecordBody: (count, froms, log, record) =>\n `${froms.join(\"と\")}の上から${count}件ずつが${log}の記録${record}に入った。`,\n tryEdited: (item, field) => `${item}の${field}を書き換えた`,\n tryEditedBody: (field, from, to) =>\n `${field}を${from}から${to}にした。ブロックのhashを出し直す。`,\n },\n en: {\n tryBlock: (n) => `Block ${n}`,\n tryTakes: (n) => `Top ${n} go next`,\n tryFolded: (n) => `${n} older ${n === 1 ? \"block\" : \"blocks\"}`,\n tryRecord: (n) => `Record ${n}`,\n tryFoldedRecords: (n) => `${n} older ${n === 1 ? \"record\" : \"records\"}`,\n tryStoppedAt: (node) => `Stopped at ${node}`,\n tryRetry: \"retryable\",\n tryResend: \"fix and resend\",\n tryStoppedBody: (name, node, error) => `${name} stopped at the gate on ${node} (${error}).`,\n tryAsk: \"Values to send\",\n tryEditForm: \"Edit a chip\",\n trySend: \"Send\",\n tryApply: \"Apply\",\n tryClose: \"Close\",\n tryEditField: (item, field) => `${field} of ${item}`,\n tryFull: (queue, most) => `${queue} is full (${most}), so nothing more can be sent`,\n tryEmpty: (queue, press) => `${queue} is empty, so \"${press}\" cannot be pressed`,\n tryRefused: (queue, name) => `${queue} does not accept ${name}, so it cannot be sent`,\n tryShort: (queue, press, take) => `${queue} holds fewer than ${take} chips, so \"${press}\" cannot be pressed`,\n tryBlank: \"Fill in every field before sending\",\n tryBadName: (field) => `${field} cannot contain spaces, brackets, \"=\" or \":\"`,\n tryBlankEdit: \"Enter a value before applying\",\n trySent: (name) => `Sent ${name}`,\n trySentBody: (name, into, via) =>\n via === undefined\n ? `${name} went into ${into}.`\n : `${name} traveled through ${via} into ${into}.`,\n tryPressed: (press) => `Pressed \"${press}\"`,\n tryPressedBody: (count, from, block) =>\n `The top ${count === 1 ? \"item\" : `${count} items`} of ${from} went into block ${block}.`,\n tryPressedRecordBody: (count, from, log, record) =>\n `The top ${count === 1 ? \"item\" : `${count} items`} of ${from} went into record ${record} of ${log}.`,\n tryGatheredBody: (count, froms, block) =>\n `The top ${count === 1 ? \"item\" : `${count} items`} of each of ${enList(froms)} went into block ${block}.`,\n tryGatheredRecordBody: (count, froms, log, record) =>\n `The top ${count === 1 ? \"item\" : `${count} items`} of each of ${enList(froms)} went into record ${record} of ${log}.`,\n tryEdited: (item, field) => `Changed ${field} of ${item}`,\n tryEditedBody: (field, from, to) =>\n `Set ${field} from ${from} to ${to}. The block hash is computed again.`,\n },\n};\n","/**\n * 試す図 (`try`、#3337) の置き場所と段ごとの状態。見た目の元は承認した板 (網を上に、待ち行列と、prev と hash を `=` でつないだ機械の列を下に置く形)。\n *\n * 部品は書いた順に上から積む。網 (`route`) は節を列に並べ、送る側 (`from`) を左端、作る人 (`to`) を右端に置き、\n * ほかの節は道の中で前の節より右の列に置く (#3524)。待ち行列 (`queue`) はチップを縦に積み、縦に収まる数 (`most`) を持つ。\n * 機械の列 (`chain`) は新しい方から `TRY_LOOK.shown` 個のブロックを左から古い順に並べ、それより古いブロックは畳んだ印にまとめる。\n * 枠の幅 (`width`) を渡し、横に並べると字が `READABLE_PX` に届かない時は、枠の幅で縦に組む (#3366)。網の節は枠の幅に詰め、\n * 待ち行列は枠の幅いっぱいに置き、ブロックは上から古い順に積む。見た目の元は `docs/design/interactive/tx-block-narrow.pen` の案A。\n * 記録の列 (`log`、#3441) は機械の列と同じく新しい方から `TRY_LOOK.shown` 個の記録を並べ、記録は番号と印と、中のチップの名前と欄の値の行を持つ。\n * 横に並べた形では、ほかの部品が決めた図の幅に収まる数ずつ記録を並べて次の段へ折り返し、記録の列で図を広げない (#3478)。\n * 網の一番上の段で隣の名札とぶつかる名札は、1 つおきに節の上へ逃がし、網の節を名札 1 行ぶん下げる (#3478)。\n * 記録の中のチップは記録が行として描くので、記録の列に入ったチップは図の上に置き場所を持たない。\n * 網の節の関門 (#3476) で止まったチップは、網を止まった節まで運ばれて消え、関門の記録の列の記録になる。関門の記録は番号の横に再試行できるかの印を、\n * チップの行の下に止まった節の行とエラーの名前の行を分けて持つ (#3478)。\n * 入力の帯 (`ask`) と釦 (`press`) は頁の部品 (再生の部品) が描くので、図の上に置き場所を持たない。\n *\n * 段ごとの状態 (`states`) と出来事ごとの状態 (`moments`) は、記法を読む所と同じ手順 (`try-state.ts`) で作る。\n * 出来事ごとの状態には、その時のチップとブロックの左上の位置と、網を運ばれたチップが通る点を添え、描く部品がこれを辿って動かす。\n */\nimport { TRY_LOOK } from \"../../look/try\";\nimport { LOOK, READABLE_PX, TYPE } from \"../../look/values\";\nimport type { DiagramModel, TryPart } from \"../../schema\";\nimport { askFields, fromsOf, intoOf, type TryRecord, type TryState, TryRun } from \"../../try-state\";\nimport { TRY_TEXT } from \"../../try-text\";\nimport { DEFAULT_LANG, type NotationLang } from \"../../words\";\nimport { textWidth } from \"../../layout/measure\";\nimport type { Layout, Point, Rect } from \"../../layout/scene\";\n\nconst T = TRY_LOOK;\nconst C = T.chip;\nconst B = T.block;\nconst L = T.record;\n\n/** 図の上に置き場所を持つ部品。`most` は待ち行列だけが持つ */\nexport interface TryPartPlaced {\n id: string;\n type: \"route\" | \"queue\" | \"chain\" | \"log\";\n rect: Rect;\n most?: number;\n}\n\n/** 網の節。`end` は送る側 (`from`) か作る人 (`to`)。`label` は名札を節の上に置く時だけ持つ (#3478) */\nexport interface TryNodePlaced {\n id: string;\n x: number;\n y: number;\n end?: \"from\" | \"to\";\n label?: \"above\";\n}\n\n/** 網の節どうしの線。丸の縁から縁まで */\nexport interface TryNetLink {\n a: string;\n b: string;\n points: Point[];\n}\n\n/** 部品の題。`x` は左端、`baseline` は基準線 */\nexport interface TryTitle {\n text: string;\n x: number;\n baseline: number;\n}\n\nexport interface TryRoutePlaced {\n id: string;\n title: TryTitle;\n nodes: TryNodePlaced[];\n links: TryNetLink[];\n}\n\n/** 待ち行列。`slots` は上から順のチップの席、`hint` は釦が上から何件を取り出すかの字 */\nexport interface TryQueuePlaced {\n id: string;\n title: TryTitle;\n box: Rect;\n slots: Rect[];\n hint?: TryTitle;\n}\n\n/**\n * 機械の列。ブロックは同じ大きさで、`slots` は古い順のブロックの左上 (横に並べた形は左から、縦に組んだ形は上から)。`top` は最初のブロックの上端で、\n * `noBaseline` は番号の字の基準線、`prevY` と `hashY` は prev と hash の行の上端、`chipTop` は最初のチップの上端、`captionBaseline` は SHA-256 の字の基準線。\n * `fold` は畳んだ印の右端と上端。`labels` はブロックの番号ごとの字、`folds` は畳んだ数ごとの字\n */\nexport interface TryChainPlaced {\n id: string;\n title: TryTitle;\n top: number;\n h: number;\n w: number;\n slots: Point[];\n noBaseline: number;\n prevY: number;\n chipTop: number;\n captionBaseline: number;\n hashY: number;\n fold: { right: number; y: number };\n labels: Record<number, string>;\n folds: Record<number, string>;\n}\n\n/**\n * 記録の列 (#3441)。記録は同じ大きさで、`slots` は古い順の記録の左上 (横に並べた形は左から並べ、図の幅に収まらない分は次の段の左から (#3478)、\n * 縦に組んだ形は上から)。`top` は最初の記録の上端で、\n * `noBaseline` は番号の字の基準線、`markY` は印の札の上端、`rowTop` は最初の行の上端。`mark` は印の札の幅で、`all` を持たず関門の `into` でもない記録の列は持たない。\n * `field` は行に出す欄の位置 (`all` の欄か、待ち行列が並べる順の欄)。`fold` は畳んだ印の右端と上端。`labels` は記録の番号ごとの字、`folds` は畳んだ数ごとの字。\n * `stops` は関門で止まった記録 (#3476) の番号ごとの、止まった節の字とエラーの名前と再試行できるかの印の字で、関門で止まった記録の無い記録の列は持たない\n */\nexport interface TryLogPlaced {\n id: string;\n title: TryTitle;\n top: number;\n h: number;\n w: number;\n slots: Point[];\n noBaseline: number;\n markY: number;\n mark?: number;\n rowTop: number;\n field?: number;\n fold: { right: number; y: number };\n labels: Record<number, string>;\n folds: Record<number, string>;\n stops?: Record<number, { at: string; error: string; mark: string; retry: boolean }>;\n}\n\n/**\n * 出来事を当てた後の時点。`step` と `event` は出来事の場所で、最初の時点 (何も起きる前) は -1 を持つ。\n * `chips` はチップの左上 (出ていなければ `null`)、`blocks` は `<機械の列>/<番号>` ごとのブロックの左上 (畳んだか、まだ無ければ `null`)。\n * `trip` はこの出来事で網を運ばれたチップと、通る節の真ん中にチップを置く左上の並び、`built` はこの出来事で足したブロック。\n * `records` は `<記録の列>/<番号>` ごとの記録の左上、`logged` はこの出来事で足した記録で、記録の列を持たない図は持たない (#3441)。\n * `stop` はこの出来事で送ったチップが関門で止まった網と節 (#3476)\n */\nexport interface TryMoment {\n step: number;\n event: number;\n state: TryState;\n chips: Record<string, Point | null>;\n blocks: Record<string, Point | null>;\n records?: Record<string, Point | null>;\n trip?: { item: string; route: string; points: Point[] };\n built?: { chain: string; number: number };\n logged?: { log: string; number: number };\n stop?: { route: string; node: string };\n}\n\nexport interface TryLayout extends Layout {\n kind: \"try\";\n /** 部品を広い枠の形で並べたか (`row`)、狭い枠の形で縦に組んだか (`stack`) (#3366) */\n arrangement: \"row\" | \"stack\";\n /** 図の上に置き場所を持つ部品 (網、待ち行列、機械の列) の四角。書いた順に上から積む */\n parts: TryPartPlaced[];\n /** 段ごとの、その段の出来事を全て当てた後の状態 */\n states: TryState[];\n moments: TryMoment[];\n routes: TryRoutePlaced[];\n queues: TryQueuePlaced[];\n chains: TryChainPlaced[];\n /** 記録の列。記録の列を持たない図は持たない (#3441) */\n logs?: TryLogPlaced[];\n /** チップの大きさ */\n chip: { w: number; h: number };\n /** チップに出す値の欄の位置 (入力の帯の欄の順)。待ち行列が並べる順の欄を持たなければ持たない */\n valueField?: number;\n /** チップごとの、図に出す名前。書き手が書いた名前も読み手が打った名前も切らずに出す (#3458) */\n names: Record<string, string>;\n}\n\n/** 全体図に描く試す図の部品の四角。`band` は待ち行列の枠のような地、そうでなければ節やブロックのような札 */\nexport interface TryOverviewShape {\n rect: Rect;\n band: boolean;\n color: (typeof TRY_LOOK.color)[keyof typeof TRY_LOOK.color];\n}\n\nconst bottomOf = (r: Rect): number => r.y + r.h;\n\n/** ブロックの鍵 */\nexport const blockKey = (chain: string, number: number): string => `${chain}/${number}`;\n\n/** 記録の鍵 (#3441) */\nexport const recordKey = (log: string, number: number): string => `${log}/${number}`;\n\n/**\n * 網の節の列。送る側を 0 列、作る人を最後の列に置き、ほかの節は書いた道の中の何番目かの最も大きい番号の列に置いた上で、\n * 道の中で前の節より右の列へ送る (#3524)。送る側でない道の頭の節も 1 列より左には置かない。\n * 送る側でない節から始まる道 (`node-1 - node-3`) の次の節が頭の節と同じ列に入ると、2 つをつなぐ線が真下へ走り、頭の節の名前の上を通るため。\n * 輪になった道は前の節より右へ送り続けても収まらないので、節の数だけ回して止める\n */\nfunction columnsOf(route: Extract<TryPart, { type: \"route\" }>): string[][] {\n const order: string[] = [];\n const column = new Map<string, number>();\n for (const path of route.paths)\n path.forEach((node, i) => {\n if (!order.includes(node)) order.push(node);\n column.set(node, Math.max(column.get(node) ?? 0, node === route.from ? 0 : Math.max(1, i)));\n });\n column.set(route.from, 0);\n for (let pass = 0; pass < order.length; pass++) {\n let moved = false;\n for (const path of route.paths)\n path.forEach((node, i) => {\n const prev = path[i - 1];\n if (prev === undefined || node === route.from || node === route.to || prev === route.to) return;\n const want = (column.get(prev) ?? 0) + 1;\n if (want <= (column.get(node) ?? 0)) return;\n column.set(node, want);\n moved = true;\n });\n if (!moved) break;\n }\n const others = order.filter((node) => node !== route.to);\n const last = Math.max(1, ...others.map((node) => (column.get(node) ?? 0) + 1));\n column.set(route.to, Math.max(last, column.get(route.to) ?? 0));\n const count = Math.max(...column.values()) + 1;\n const columns: string[][] = Array.from({ length: count }, () => []);\n for (const node of order) columns[column.get(node) ?? 0]?.push(node);\n return columns.filter((list) => list.length > 0);\n}\n\n/**\n * 網の節の段。1 本の道だけが通る節はその道の段に、2 本以上の道が通る節は真ん中の段に置く。\n * 列を飛ばす線が飛ばした列の節の上を通らないように、道ごとに段を分ける。\n * 同じ列の節の段が 1 段より近づく時は、その列だけ真ん中から上下へ並べる。\n * 上下へ並べる順は、左の列で線がつながる節の段の平均の順にする (#3524)。\n * 線が短く交わらなくなり、細い枠でも急な線が節の名前の上を通らない。左につながる節の無い節は望む段で比べ、同じ値は書いた順に並べる\n */\nfunction lanesOf(\n route: Extract<TryPart, { type: \"route\" }>,\n columns: string[][],\n): Map<string, number> {\n const ways = new Map<string, number[]>();\n route.paths.forEach((path, p) =>\n path.forEach((node) => {\n const list = ways.get(node) ?? [];\n if (!list.includes(p)) list.push(p);\n ways.set(node, list);\n }),\n );\n const tall = Math.max(route.paths.length, ...columns.map((list) => list.length));\n const middle = (tall - 1) / 2;\n const shift = (tall - route.paths.length) / 2;\n /** 節ごとの、線でつながる節 */\n const linked = new Map<string, Set<string>>();\n for (const path of route.paths)\n path.forEach((node, i) => {\n for (const other of [path[i - 1], path[i + 1]]) {\n if (other === undefined) continue;\n const set = linked.get(node) ?? new Set<string>();\n set.add(other);\n linked.set(node, set);\n }\n });\n const lane = new Map<string, number>();\n for (const list of columns) {\n const wish = list.map((node) => {\n const way = ways.get(node) ?? [];\n return way.length === 1 ? shift + (way[0] ?? 0) : middle;\n });\n const sorted = [...wish].sort((a, b) => a - b);\n const apart = sorted.every((at, i) => i === 0 || at - (sorted[i - 1] ?? at) >= 1);\n if (apart) {\n list.forEach((node, k) => lane.set(node, wish[k] ?? middle));\n continue;\n }\n // 列は左から順に段を決めるので、段を持つつながる節は左の列の節\n const pull = list.map((node, k) => {\n const left = [...(linked.get(node) ?? [])].flatMap((other) => {\n const at = lane.get(other);\n return at === undefined ? [] : [at];\n });\n return left.length > 0 ? left.reduce((sum, at) => sum + at, 0) / left.length : (wish[k] ?? middle);\n });\n const ranked = list.map((node, k) => ({ node, k })).sort((a, b) => (pull[a.k] ?? 0) - (pull[b.k] ?? 0) || a.k - b.k);\n ranked.forEach(({ node }, rank) => lane.set(node, middle + rank - (list.length - 1) / 2));\n }\n return lane;\n}\n\n/** 図の上に置き場所を持つ部品 (網、待ち行列、機械の列、記録の列) */\ntype PlacedPart = Extract<TryPart, { type: \"route\" | \"queue\" | \"chain\" | \"log\" }>;\ntype LogPart = Extract<TryPart, { type: \"log\" }>;\n\n/** 試す図を並べる時の設定。`width` は描く枠の幅で、渡すと横に並べた形の字が読めない幅で縦に組む (#3366) */\nexport interface TryOptions {\n width?: number;\n}\n\nexport function layoutTry(\n diagram: DiagramModel,\n lang: NotationLang = DEFAULT_LANG,\n options: TryOptions = {},\n): TryLayout {\n const words = TRY_TEXT[lang];\n const spec = diagram.try ?? { parts: [], items: [] };\n const fields = askFields(spec.parts);\n const run = new TryRun(spec);\n const most = run.most;\n\n // 出来事を 1 つずつ当て、段ごとの状態と出来事ごとの状態を作る\n type Raw = Omit<TryMoment, \"chips\" | \"blocks\" | \"records\" | \"trip\"> & { tripItem?: string };\n const raws: Raw[] = [{ step: -1, event: -1, state: run.state() }];\n const states: TryState[] = [];\n diagram.steps.forEach((step, s) => {\n run.beginStep();\n step.events.forEach((event, k) => {\n const applied = run.apply(event);\n const state = run.state();\n const tripItem =\n applied.chip !== undefined && state.trips.some((t) => t.item === applied.chip)\n ? applied.chip\n : undefined;\n raws.push({\n step: s,\n event: k,\n state,\n ...(tripItem !== undefined ? { tripItem } : {}),\n ...(applied.block ? { built: applied.block } : {}),\n ...(applied.record ? { logged: applied.record } : {}),\n ...(applied.stop ? { stop: applied.stop } : {}),\n });\n });\n states.push(run.state());\n });\n\n // チップの名前と、待ち行列が並べる順の欄の値で、チップの幅を決める\n const orders = spec.parts\n .flatMap((p) => (p.type === \"queue\" && p.order !== undefined ? [fields.indexOf(p.order)] : []))\n .filter((at) => at >= 1);\n const valueField = orders[0];\n const names: Record<string, string> = {};\n let nameW = 0;\n let valueW = 0;\n for (const raw of raws)\n for (const [id, row] of Object.entries(raw.state.items)) {\n names[id] = row[0] ?? id;\n nameW = Math.max(nameW, textWidth(names[id] ?? \"\", TYPE.tryChip));\n if (valueField !== undefined)\n valueW = Math.max(valueW, textWidth(row[valueField] ?? \"\", TYPE.tryChipValue));\n }\n const chipW = Math.max(\n C.minW,\n C.padX * 2 + nameW + (valueField === undefined ? 0 : C.valueGap + valueW),\n );\n const pitch = C.h + C.gap;\n\n // ブロックの幅は、チップと prev と hash の行が入る幅\n const rowText =\n textWidth(\"prev\", TYPE.tryRowKey) +\n B.keyGap +\n textWidth(\"0000\", TYPE.tryRowValue) +\n B.rowPad * 2;\n const blockW = Math.max(B.w, chipW + B.padX * 2, rowText + B.padX * 2);\n\n // 記録の幅は、番号と印の札が並ぶ幅と、チップの名前と欄の値の行と、関門で止まった節の行とエラーの名前の行 (#3476、#3478) が入る幅 (#3441)\n const logParts = spec.parts.filter((p): p is LogPart => p.type === \"log\");\n const logField = (part: LogPart): number | undefined => {\n const at = part.all ? fields.indexOf(part.all.field) : -1;\n return at >= 1 ? at : valueField;\n };\n /** 関門の `into` の記録の列。記録に再試行できるかの印を出すので、印の札の場所を持つ */\n const gated = new Set((spec.checks ?? []).map((c) => c.into));\n const markTexts = (part: LogPart): string[] =>\n part.all ? [part.all.yes, part.all.no] : gated.has(part.id) ? [words.tryRetry, words.tryResend] : [];\n const markWidth = (part: LogPart): number | undefined => {\n const texts = markTexts(part);\n return texts.length > 0 ? L.markPadX * 2 + Math.max(...texts.map((t) => textWidth(t, TYPE.tryChipValue))) : undefined;\n };\n /** 記録の列の、関門で止まった記録 (#3476)。記録は足した後に変わらないので、どの時点で見ても同じ */\n const stoppedOf = (part: LogPart): TryRecord[] => {\n const last = raws[raws.length - 1]?.state.logs?.[part.id] ?? [];\n return last.filter((r) => r.node !== undefined);\n };\n const recordW = (part: LogPart): number => {\n const field = logField(part);\n let rowValueW = 0;\n if (field !== undefined)\n for (const raw of raws)\n for (const row of Object.values(raw.state.items))\n rowValueW = Math.max(rowValueW, textWidth(row[field] ?? \"\", TYPE.tryChipValue));\n const rowW = C.padX * 2 + nameW + (field === undefined ? 0 : C.valueGap + rowValueW);\n const stopW = stoppedOf(part).map(\n (r) => C.padX * 2 + Math.max(textWidth(words.tryStoppedAt(r.node ?? \"\"), TYPE.tryChip), textWidth(r.error ?? \"\", TYPE.tryChipValue)),\n );\n const labels = raws.flatMap((raw) => (raw.state.logs?.[part.id] ?? []).map((r) => textWidth(words.tryRecord(r.number), TYPE.tryBlockNo)));\n const mark = markWidth(part);\n const head = Math.max(0, ...labels) + (mark === undefined ? 0 : L.headGap + mark);\n return Math.max(L.w, rowW + B.padX * 2, ...stopW.map((w) => w + B.padX * 2), head + B.padX * 2);\n };\n const logW = new Map(logParts.map((p) => [p.id, recordW(p)]));\n const titles = spec.parts\n .filter((p) => p.type === \"route\" || p.type === \"queue\" || p.type === \"chain\" || p.type === \"log\")\n .map((p) => textWidth(p.id, TYPE.tryTitle));\n /** 記録の列を除いた部品が決める図の幅 */\n const base = Math.max(T.width, T.margin * 2 + T.shown * blockW + (T.shown - 1) * B.gap, T.margin * 2 + Math.max(0, ...titles));\n /**\n * 横に並べた形で 1 段に並べる記録の数 (#3478)。ほかの部品が決めた幅に収まる数だけ並べ、残りは次の段へ折り返す。\n * 並べる数を図の幅から決めるので、読み手が送って記録が増え、記録の幅が広がっても、図の幅は変わらない\n */\n const logColumns = (id: string): number =>\n Math.max(1, Math.min(T.shown, Math.floor((base - T.margin * 2 + L.gap) / ((logW.get(id) ?? L.w) + L.gap))));\n const logRowW = (id: string): number => {\n const n = logColumns(id);\n return n * (logW.get(id) ?? L.w) + (n - 1) * L.gap;\n };\n const wide = Math.max(base, ...logParts.map((p) => T.margin * 2 + logRowW(p.id)));\n const frame = options.width;\n /** 幅 `w` の図を枠に縮めても箱の名前の字が読める大きさに届くか。枠を渡さない時は縮めない */\n const readable = (w: number): boolean => frame === undefined || (frame / w) * TYPE.boxName.size >= READABLE_PX;\n const stacked = !readable(wide);\n\n // 待ち行列の横に出す、釦が上から何件を取り出すかの字と、その字が要る幅。2 つ以上の待ち行列から集める釦は、そのどれにも出す (#3453)\n const hintTextOf = (id: string): string | undefined => {\n const press = spec.parts.find(\n (p): p is Extract<TryPart, { type: \"press\" }> => p.type === \"press\" && fromsOf(p).includes(id),\n );\n return press ? words.tryTakes(press.take) : undefined;\n };\n const hintWidth = (text: string | undefined): number =>\n text === undefined ? 0 : T.queue.hintGap + textWidth(text, TYPE.tryHint);\n\n // side の行 (#3429)。同じ行に置いた時に部品が要る幅は、待ち行列はチップの列と字と題、機械の列は出すブロック、網は節の名札が重ならない間\n const placedParts = spec.parts.filter(\n (p): p is PlacedPart => p.type === \"route\" || p.type === \"queue\" || p.type === \"chain\" || p.type === \"log\",\n );\n const needOf = (part: PlacedPart): number => {\n const title = textWidth(part.id, TYPE.tryTitle);\n if (part.type === \"queue\") return Math.max(T.queue.padX * 2 + chipW + hintWidth(hintTextOf(part.id)), title);\n if (part.type === \"chain\") return Math.max(T.shown * blockW + (T.shown - 1) * B.gap, title);\n // 同じ行の記録の列は記録 1 つの幅だけを要る幅にし、残りの幅に入る数ずつ記録を並べる (#3506)。図全体の幅で並べる数を要ると、行が図の幅を超える\n if (part.type === \"log\") return Math.max(logW.get(part.id) ?? L.w, title);\n const labels = columnsOf(part).map((list) => Math.max(...list.map((id) => textWidth(id, TYPE.tryNode))));\n const apart = labels.slice(1).reduce((sum, w, c) => sum + ((labels[c] ?? 0) + w) / 2 + T.route.labelGap, 0);\n return Math.max(T.route.padX * 2 + apart, title);\n };\n const sideRows = (spec.sides ?? []).map((row) =>\n row.flatMap((id) => placedParts.filter((p) => p.id === id)),\n );\n const rowNeed = (row: PlacedPart[]): number =>\n row.reduce((sum, p) => sum + needOf(p), 0) + (row.length - 1) * T.gap;\n const sideWide = Math.max(wide, ...sideRows.map((row) => T.margin * 2 + rowNeed(row)));\n // 横に並べると字が読める大きさより小さくなる枠では、side の行を持たない時と同じ形にする\n const side = !stacked && sideRows.length > 0 && readable(sideWide);\n // 縦に組んだ形は枠の幅で描く。ブロックと右に回すつながりの印と部品の題が入る幅より狭い枠では、その幅で描く\n const width =\n stacked && frame !== undefined\n ? Math.max(\n frame,\n T.margin * 2 + blockW + B.side + T.link.badge / 2,\n T.margin * 2 + Math.max(0, ...titles),\n ...logParts.map((p) => T.margin * 2 + (logW.get(p.id) ?? L.w)),\n )\n : side\n ? sideWide\n : wide;\n const inner = width - T.margin * 2;\n\n // 部品を書いた順に行へまとめる。side の行の部品は、その中で最初に書いた部品の所に side の行の順で 1 つの行にまとめる\n const rowOf = new Map((side ? sideRows : []).flatMap((row) => row.map((p) => [p.id, row] as const)));\n const lines: PlacedPart[][] = [];\n const lined = new Set<string>();\n for (const part of placedParts) {\n if (lined.has(part.id)) continue;\n const line = rowOf.get(part.id) ?? [part];\n for (const p of line) lined.add(p.id);\n lines.push(line);\n }\n // 行の部品の幅。待ち行列は要る幅だけを取り、残りを網と機械の列に等しく分ける\n const spansOf = (line: PlacedPart[]): number[] => {\n if (line.length === 1) return [inner];\n const flexible = line.filter((p) => p.type !== \"queue\").length;\n const extra = inner - rowNeed(line);\n return line.map((p) => needOf(p) + (flexible === 0 ? extra / line.length : p.type === \"queue\" ? 0 : extra / flexible));\n };\n\n const parts: TryPartPlaced[] = [];\n const routes: TryRoutePlaced[] = [];\n const queues: TryQueuePlaced[] = [];\n const chains: TryChainPlaced[] = [];\n const logs: TryLogPlaced[] = [];\n let y: number = T.margin;\n const titleOf = (id: string, top: number, left: number): TryTitle => ({\n text: id,\n x: left,\n baseline: top + T.head.titleY,\n });\n for (const line of lines) {\n if (parts.length > 0) y += T.gap;\n const top = y;\n const body = top + T.head.body;\n const spans = spansOf(line);\n let left: number = T.margin;\n let lowest = top;\n for (const [k, part] of line.entries()) {\n const span = spans[k] ?? inner;\n if (part.type === \"route\") {\n const R = T.route;\n const columns = columnsOf(part);\n const lane = lanesOf(part, columns);\n const xs = new Map(\n columns.flatMap((list, c) =>\n list.map((id) => [\n id,\n columns.length === 1 ? left + span / 2 : left + R.padX + (c * (span - R.padX * 2)) / (columns.length - 1),\n ] as const),\n ),\n );\n // 一番上の段で、左の名札との間が `labelGap` より狭い名札を、左の名札が節の下に在る時だけ節の上へ逃がす (#3478)。\n // ぶつかり続ける並びは 1 つおきに上へ逃げ、ぶつからない名札は節の下のまま描く。\n // 下の段の名札は上の段の名札とぶつかるので逃がさない\n const topLane = Math.min(...[...xs.keys()].map((id) => lane.get(id) ?? 0));\n const half = (id: string): number => textWidth(id, TYPE.tryNode) / 2;\n const raised = new Set<string>();\n const topRow = [...xs.keys()].filter((id) => (lane.get(id) ?? 0) === topLane).sort((a, b) => (xs.get(a) ?? 0) - (xs.get(b) ?? 0));\n topRow.forEach((id, i) => {\n const prev = topRow[i - 1];\n if (prev !== undefined && !raised.has(prev) && (xs.get(id) ?? 0) - half(id) - (xs.get(prev) ?? 0) - half(prev) < R.labelGap) raised.add(id);\n });\n // 上へ逃がした名札が題の行とぶつからないよう、網の節を名札 1 行ぶん下げる\n const nodesTop = body + R.r + (raised.size > 0 ? R.upRow : 0);\n const nodes: TryNodePlaced[] = columns.flatMap((list) =>\n list.map((id) => ({\n id,\n x: xs.get(id) ?? left,\n y: nodesTop + (lane.get(id) ?? 0) * R.pitch,\n ...(id === part.from ? { end: \"from\" as const } : id === part.to ? { end: \"to\" as const } : {}),\n ...(raised.has(id) ? { label: \"above\" as const } : {}),\n })),\n );\n const at = new Map(nodes.map((n) => [n.id, n]));\n const links: TryNetLink[] = [];\n for (const path of part.paths)\n path.forEach((a, i) => {\n const b = path[i + 1];\n if (\n b === undefined ||\n links.some((l) => (l.a === a && l.b === b) || (l.a === b && l.b === a))\n )\n return;\n const p = at.get(a) as TryNodePlaced;\n const q = at.get(b) as TryNodePlaced;\n const len = Math.hypot(q.x - p.x, q.y - p.y) || 1;\n const ux = (q.x - p.x) / len;\n const uy = (q.y - p.y) / len;\n links.push({\n a,\n b,\n points: [\n [p.x + ux * R.r, p.y + uy * R.r],\n [q.x - ux * R.r, q.y - uy * R.r],\n ],\n });\n });\n const bottom = Math.max(...nodes.map((n) => n.y)) + R.labelY + R.bottom;\n routes.push({ id: part.id, title: titleOf(part.id, top, left), nodes, links });\n parts.push({\n id: part.id,\n type: \"route\",\n rect: { x: left, y: top, w: span, h: bottom - top },\n });\n lowest = Math.max(lowest, bottom);\n } else if (part.type === \"queue\") {\n const Q = T.queue;\n const hintText = hintTextOf(part.id);\n const hintW = hintWidth(hintText);\n const track = most * pitch - C.gap;\n const box = {\n x: left,\n y: body,\n w: stacked ? span : Math.min(span, Q.padX * 2 + chipW + hintW),\n h: Q.padY * 2 + track,\n };\n const slots = Array.from({ length: most }, (_, k) => ({\n x: box.x + Q.padX,\n y: box.y + Q.padY + k * pitch,\n w: chipW,\n h: C.h,\n }));\n const hint =\n hintText === undefined\n ? undefined\n : {\n text: hintText,\n x: box.x + Q.padX + chipW + Q.hintGap,\n baseline: box.y + Q.padY + C.h / 2 + LOOK.baseline.tag,\n };\n queues.push({\n id: part.id,\n title: titleOf(part.id, top, left),\n box,\n slots,\n ...(hint ? { hint } : {}),\n });\n parts.push({\n id: part.id,\n type: \"queue\",\n rect: { x: left, y: top, w: box.w, h: bottomOf(box) - top },\n most,\n });\n lowest = Math.max(lowest, bottomOf(box));\n } else if (part.type === \"log\") {\n const w = logW.get(part.id) ?? L.w;\n const records = raws.flatMap((raw) => raw.state.logs?.[part.id] ?? []);\n // 関門で止まった記録は、チップの行の下に止まった節の行とエラーの名前の行を持つ (#3476、#3478)\n const rows = Math.max(1, ...records.map((r) => r.items.length + (r.node === undefined ? 0 : 2)));\n const mark = markWidth(part);\n const head = mark === undefined ? B.noH : T.fold.h;\n const noBaseline = body + B.padTop + head / 2 + TYPE.tryBlockNo.size * 0.35;\n const rowTop = body + B.padTop + head + B.rowGap;\n const h = rowTop + rows * pitch - C.gap + B.padBottom - body;\n const numbers = new Set(records.map((r) => r.number));\n // 縦に組んだ形は 1 列に積み、横に並べた形は図の幅に収まる数ずつ並べて折り返す (#3478)\n // side の行に置いた記録の列は、割り当てた幅 (span) に入る数ずつ並べる (#3506)\n const inRow = (rowOf.get(part.id)?.length ?? 1) > 1;\n const columns = stacked\n ? 1\n : inRow\n ? Math.max(1, Math.min(T.shown, Math.floor((span + L.gap) / (w + L.gap))))\n : logColumns(part.id);\n // side の行の記録の列は 1 段に入る数だけを出し、それより古い記録は畳む (#3506)。段を足すと行が縦に伸び、同じ行のほかの部品の下が空く\n const keep = inRow ? columns : T.shown;\n if (keep < T.shown)\n for (const raw of raws) {\n const list = raw.state.logs?.[part.id] ?? [];\n list.forEach((r, i) => {\n r.shown = i >= list.length - keep;\n });\n }\n const folded = new Set(raws.map((raw) => Math.max(0, (raw.state.logs?.[part.id] ?? []).length - keep)));\n const field = logField(part);\n const stopped = stoppedOf(part);\n // 空ける段は、ここまでの段で一度に出た記録の数が要る分だけにする (#3506)。3 件分の段を常に空けると、記録の少ない間は記録の列の下が空く。\n // 記録がまだ 1 件も無い間は段を取らず題だけを置く\n const most = Math.max(0, ...raws.map((raw) => (raw.state.logs?.[part.id] ?? []).filter((r) => r.shown).length));\n const lines = Math.ceil(Math.min(T.shown, most) / columns);\n logs.push({\n id: part.id,\n title: titleOf(part.id, top, left),\n top: body,\n h,\n w,\n slots: Array.from({ length: T.shown }, (_, n): Point => [\n left + (n % columns) * (w + L.gap),\n body + Math.floor(n / columns) * (h + L.gap),\n ]),\n noBaseline,\n markY: body + B.padTop,\n ...(mark !== undefined ? { mark } : {}),\n rowTop,\n ...(field !== undefined ? { field } : {}),\n fold: {\n right: left + span,\n y: top + T.head.titleY - TYPE.tryTitle.size * 0.35 - T.fold.h / 2,\n },\n labels: Object.fromEntries([...numbers].map((n) => [n, words.tryRecord(n)])),\n folds: Object.fromEntries(\n [...folded].filter((n) => n > 0).map((n) => [n, words.tryFoldedRecords(n)]),\n ),\n ...(stopped.length > 0\n ? {\n stops: Object.fromEntries(\n stopped.map((r) => [\n r.number,\n { at: words.tryStoppedAt(r.node ?? \"\"), error: r.error ?? \"\", mark: r.retry ? words.tryRetry : words.tryResend, retry: r.retry === true },\n ]),\n ),\n }\n : {}),\n });\n const bottom = lines === 0 ? body : body + lines * h + (lines - 1) * L.gap;\n parts.push({ id: part.id, type: \"log\", rect: { x: left, y: top, w: span, h: bottom - top } });\n lowest = Math.max(lowest, bottom);\n } else {\n const rows = Math.max(\n 1,\n ...raws.flatMap((raw) => (raw.state.chains[part.id] ?? []).map((b) => b.items.length)),\n );\n const noBaseline = body + B.padTop + TYPE.tryBlockNo.size * 0.8;\n const prevY = body + B.padTop + B.noH + B.rowGap;\n const chipTop = prevY + B.row + B.rowGap;\n const rowsBottom = chipTop + rows * pitch - C.gap;\n const captionBaseline = rowsBottom + B.rowGap + B.sha * 0.75;\n const hashY = rowsBottom + B.rowGap + B.sha;\n const h = hashY + B.row + B.padBottom - body;\n const numbers = new Set(\n raws.flatMap((raw) => (raw.state.chains[part.id] ?? []).map((b) => b.number)),\n );\n const folded = new Set(\n raws.map((raw) => Math.max(0, (raw.state.chains[part.id] ?? []).length - T.shown)),\n );\n chains.push({\n id: part.id,\n title: titleOf(part.id, top, left),\n top: body,\n h,\n w: blockW,\n slots: Array.from({ length: T.shown }, (_, n): Point =>\n stacked ? [left, body + n * (h + B.gap)] : [left + n * (blockW + B.gap), body],\n ),\n noBaseline,\n prevY,\n chipTop,\n captionBaseline,\n hashY,\n // 畳んだ印は題の行の右端に、題の字の真ん中の高さで置く\n fold: {\n right: left + span,\n y: top + T.head.titleY - TYPE.tryTitle.size * 0.35 - T.fold.h / 2,\n },\n labels: Object.fromEntries([...numbers].map((n) => [n, words.tryBlock(n)])),\n folds: Object.fromEntries(\n [...folded].filter((n) => n > 0).map((n) => [n, words.tryFolded(n)]),\n ),\n });\n // 縦に組んだ形は出すブロックの数だけ席を積み、ブロックが足りない間も高さを変えない\n const bottom = stacked ? body + T.shown * h + (T.shown - 1) * B.gap : body + h;\n parts.push({\n id: part.id,\n type: \"chain\",\n rect: { x: left, y: top, w: span, h: bottom - top },\n });\n lowest = Math.max(lowest, bottom);\n }\n left += span + T.gap;\n }\n y = lowest;\n }\n\n // 出来事ごとのチップとブロックの左上。待ち行列の席か、出ているブロックの中の席に置く\n const queueOf = new Map(queues.map((q) => [q.id, q]));\n const chainOf = new Map(chains.map((c) => [c.id, c]));\n const routeOf = new Map(routes.map((r) => [r.id, r]));\n const logOf = new Map(logs.map((l) => [l.id, l]));\n const moments: TryMoment[] = raws.map(({ tripItem, ...raw }) => {\n const chips: Record<string, Point | null> = {};\n const blocks: Record<string, Point | null> = {};\n const records: Record<string, Point | null> = {};\n // 記録の中のチップは記録が行として描くので、チップの置き場所は持たない\n for (const [id, list] of Object.entries(raw.state.logs ?? {})) {\n const l = logOf.get(id);\n const first = list.length - list.filter((r) => r.shown).length;\n list.forEach((record, i) => {\n const slot = record.shown && l ? l.slots[i - first] : undefined;\n records[recordKey(id, record.number)] = slot === undefined ? null : [slot[0], slot[1]];\n });\n }\n for (const id of Object.keys(raw.state.items)) chips[id] = null;\n for (const [id, list] of Object.entries(raw.state.queues)) {\n const q = queueOf.get(id);\n list.forEach((item, k) => {\n const slot = q?.slots[k];\n if (slot) chips[item] = [slot.x, slot.y];\n });\n }\n for (const [id, list] of Object.entries(raw.state.chains)) {\n const c = chainOf.get(id);\n const first = list.length - list.filter((b) => b.shown).length;\n list.forEach((block, i) => {\n const slot = block.shown && c ? c.slots[i - first] : undefined;\n blocks[blockKey(id, block.number)] = slot === undefined || !c ? null : [slot[0], slot[1]];\n if (slot === undefined || !c) return;\n block.items.forEach((item, k) => {\n chips[item] = [slot[0] + B.padX, slot[1] + (c.chipTop - c.top) + k * pitch];\n });\n });\n }\n const trip =\n tripItem === undefined ? undefined : raw.state.trips.find((t) => t.item === tripItem);\n const route = trip ? routeOf.get(trip.route) : undefined;\n const points =\n trip && route\n ? trip.path.flatMap((node): Point[] => {\n const n = route.nodes.find((x) => x.id === node);\n return n ? [[n.x - chipW / 2, n.y - C.h / 2]] : [];\n })\n : [];\n return {\n ...raw,\n chips,\n blocks,\n ...(logs.length > 0 ? { records } : {}),\n ...(trip && points.length > 0\n ? { trip: { item: trip.item, route: trip.route, points } }\n : {}),\n };\n });\n\n return {\n kind: \"try\",\n arrangement: stacked ? \"stack\" : \"row\",\n width,\n height: y + T.margin,\n regions: [],\n boxes: [],\n lifelines: [],\n edges: [],\n labels: [],\n actions: [],\n // 段の番号は頁の部品 (再生の部品) が段の題と一緒に出すので、図の中には置かない\n badges: [],\n paths: [],\n ends: [],\n parts,\n states,\n moments,\n routes,\n queues,\n chains,\n ...(logs.length > 0 ? { logs } : {}),\n chip: { w: chipW, h: C.h },\n ...(valueField !== undefined ? { valueField } : {}),\n names,\n };\n}\n\n/**\n * 寄って追う窓が段 `step` で見る所 (#3337)。その段の出来事が触る部品の四角を、出来事が着く所から順に並べる。\n * 窓は最初の四角を外さずに全部を囲んだ所へ寄るので、最初の四角は読み手が結果を見る所にする。\n * 送った段は送った先の待ち行列と網、釦を押した段は作ったブロックと取り出した待ち行列 (2 つ以上なら書いた順に全て)、\n * 書き換えた段は書き換えたチップのブロックと次のブロックとのつながり、`line` は書いた待ち行列とブロック (待ち行列を先) を見る。\n * ブロックはその段の終わりの位置で見て、畳んだブロックは見ない\n */\nexport function tryFocusParts(layout: TryLayout, diagram: DiagramModel, step: number): Rect[] {\n const moments = layout.moments.filter((mo) => mo.step === step);\n const end = moments[moments.length - 1];\n if (!end) return [];\n const parts = diagram.try?.parts ?? [];\n const partRect = (id: string | undefined): Rect | undefined =>\n layout.parts.find((p) => p.id === id)?.rect;\n const blockRect = (chain: string, number: number): Rect | undefined => {\n const c = layout.chains.find((x) => x.id === chain);\n const at = end.blocks[blockKey(chain, number)];\n return c && at ? { x: at[0], y: at[1], w: c.w, h: c.h } : undefined;\n };\n const recordRect = (log: string, number: number): Rect | undefined => {\n const l = layout.logs?.find((x) => x.id === log);\n const at = end.records?.[recordKey(log, number)];\n return l && at ? { x: at[0], y: at[1], w: l.w, h: l.h } : undefined;\n };\n /** 窓から外さない所の候補、`line` がブロックに書いた所、続けて見る所 */\n const lead: Rect[] = [];\n const lines: Rect[] = [];\n const rest: Rect[] = [];\n const push = (list: Rect[], rect: Rect | undefined): void => {\n if (rect) list.push(rect);\n };\n (diagram.steps[step]?.events ?? []).forEach((event, k) => {\n const mo = moments.find((x) => x.event === k);\n const built = mo?.built\n ? blockRect(mo.built.chain, mo.built.number)\n : mo?.logged\n ? recordRect(mo.logged.log, mo.logged.number)\n : undefined;\n if (event.type === \"line\" && \"part\" in event) {\n if (built) lines.push(built);\n else push(lead, partRect(event.part));\n } else if (event.type === \"ask\") {\n const ask = parts.find((p): p is Extract<TryPart, { type: \"ask\" }> => p.type === \"ask\");\n // 関門で止まったチップ (#3476) は待ち行列に入らず、関門の記録の列の記録になる\n push(lead, mo?.stop ? built : partRect(ask ? intoOf(ask, event.values, (id) => parts.some((p) => p.id === id)) : undefined));\n if (mo?.trip) push(rest, partRect(mo.trip.route));\n } else if (event.type === \"press\") {\n const press = parts.find(\n (p): p is Extract<TryPart, { type: \"press\" }> => p.type === \"press\" && p.id === event.press,\n );\n push(lead, built);\n for (const from of press ? fromsOf(press) : []) push(rest, partRect(from));\n } else if (event.type === \"item\") {\n const [chain, block] =\n Object.entries(end.state.chains).flatMap(([id, list]) =>\n list.filter((b) => b.items.includes(event.item)).map((b) => [id, b] as const),\n )[0] ?? [];\n const here = chain !== undefined && block ? blockRect(chain, block.number) : undefined;\n if (chain !== undefined && block && here) {\n lead.push(here);\n const next = blockRect(chain, block.number + 1);\n // つながりの印は、横に並べた形ではこのブロックの右端と次のブロックの左端の間に在り、\n // 縦に組んだ形ではこのブロックの下の端と次のブロックの上の端の間の、ブロックの右に在る\n if (next)\n rest.push(\n layout.arrangement === \"stack\"\n ? { x: here.x + here.w, y: here.y + here.h, w: B.side + T.link.badge / 2, h: next.y - here.y - here.h }\n : { x: here.x + here.w, y: here.y, w: next.x - here.x - here.w, h: here.h },\n );\n } else {\n const queue = Object.entries(end.state.queues).find(([, list]) =>\n list.includes(event.item),\n )?.[0];\n push(lead, partRect(queue));\n }\n }\n });\n return [...lead, ...lines, ...rest];\n}\n\n/** 全体図に描く試す図の部品 (#3337)。網の節と待ち行列の枠と、最後の時点に出ているブロックと記録 */\nexport function tryOverview(layout: TryLayout): TryOverviewShape[] {\n const color = T.color.part;\n const last = layout.moments[layout.moments.length - 1];\n const r = T.route.r;\n return [\n ...layout.queues.map((q) => ({ rect: q.box, band: true, color })),\n ...layout.routes.flatMap((route) =>\n route.nodes.map((n) => ({\n rect: { x: n.x - r, y: n.y - r, w: r * 2, h: r * 2 },\n band: false,\n color,\n })),\n ),\n ...layout.chains.flatMap((c) =>\n (last?.state.chains[c.id] ?? []).flatMap((b) => {\n const at = last?.blocks[blockKey(c.id, b.number)];\n return at ? [{ rect: { x: at[0], y: at[1], w: c.w, h: c.h }, band: false, color }] : [];\n }),\n ),\n ...(layout.logs ?? []).flatMap((l) =>\n (last?.state.logs?.[l.id] ?? []).flatMap((r) => {\n const at = last?.records?.[recordKey(l.id, r.number)];\n return at ? [{ rect: { x: at[0], y: at[1], w: l.w, h: l.h }, band: false, color }] : [];\n }),\n ),\n ];\n}\n","/**\n * 機械の列の描き方 (#3337、#3348)。\n *\n * ブロックは新しい方から 3 つを左から古い順に並べ、ブロックが足されると左へ滑り、古いブロックは消えて畳んだ印に数える。\n * 狭い枠で縦に組んだ形 (#3366) は上から古い順に積み、ブロックが足されると上へ滑る。つながりはブロックの右を回して引く。\n * ブロックの中の字は番号と prev と hash の頭の 4 字で、hash は書き換えた段から新しい値に替わる。\n * ブロックの間のつながりは prev が前のブロックの今の hash と同じ間は `=`、違う間は橙の `≠` を出す。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { blockKey, type TryChainPlaced, type TryMoment } from \"../../kinds/try/layout\";\nimport { hasWide, textBox } from \"../../layout/measure\";\nimport { TRY_LOOK } from \"../../look/try\";\nimport { LOOK, TYPE } from \"../../look/values\";\nimport { frameShape, partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { esc, pathOf, r1, sansOf, write } from \"../../render/parts\";\nimport type { TryKit, TryRest, TryWindow } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\n\nconst T = TRY_LOOK;\nconst B = T.block;\nconst C = T.chip;\n\n/** 機械の列ごとの題と、ブロックとつながりと畳んだ印 */\nexport function chainRows(k: TryKit): void {\n const { layout, title, base, node } = k;\n for (const chain of layout.chains) {\n base.push(\n `<g data-part=\"${esc(chain.id)}\" style=\"${cs(T.color.part)}\">${title(chain.title)}</g>`,\n );\n node.push(drawChain(k, chain));\n }\n}\n\n/** 機械の列 1 つ。ブロックは左上を原点に描いて出来事ごとの位置へ動かし、つながりは後ろのブロックと一緒に動く */\nfunction drawChain(k: TryKit, chain: TryChainPlaced): string {\n const { ctx, moments, windows, spanOf, track, phasesOf, shownKf, phased, record, cls } = k;\n const { m } = ctx;\n const numbers = [\n ...new Set(moments.flatMap((mo) => (mo.state.chains[chain.id] ?? []).map((b) => b.number))),\n ].sort((a, b) => a - b);\n const blockOf = (mo: TryMoment, n: number) =>\n (mo.state.chains[chain.id] ?? []).find((b) => b.number === n);\n const rowW = chain.w - B.padX * 2;\n const rowText = B.row / 2 + LOOK.baseline.tag + 1;\n const row = (\n y: number,\n key: string,\n values: string[],\n strong: boolean,\n rests: TryRest[],\n ): string => {\n const keyX = B.padX + B.rowPad;\n const valueX = keyX + textBox(key, 0, 0, TYPE.tryRowKey).w + B.keyGap;\n record(key, TYPE.tryRowKey, rests, keyX, y + rowText);\n for (const p of phasesOf(values))\n record(p.value, TYPE.tryRowValue, rests, valueX, y + rowText, \"start\", [p.from, p.to]);\n return (\n `<rect class=\"${strong ? \"dg-try-hrow\" : \"dg-try-row\"}\" x=\"${B.padX}\" y=\"${r1(y)}\" width=\"${r1(rowW)}\" height=\"${B.row}\" rx=\"${partRadius(ctx.corner, B.rowRadius)}\"/>` +\n `<text class=\"dg-try-rk\" x=\"${r1(keyX)}\" y=\"${r1(y + rowText)}\">${key}</text>${phased(values, valueX, y + rowText, strong ? \"dg-try-rv dg-try-hv\" : \"dg-try-rv\")}`\n );\n };\n const blocks = numbers.map((n) => {\n const key = blockKey(chain.id, n);\n const moved = track(moments.map((mo) => mo.blocks[key] ?? null));\n const box = { x: 0, y: 0, w: chain.w, h: chain.h };\n const frame = frameShape(\n ctx.corner,\n ` class=\"dg-try-blk\" ${ctx.sh}`,\n box,\n `<rect class=\"dg-try-blk\" width=\"${r1(chain.w)}\" height=\"${r1(chain.h)}\" rx=\"${B.radius}\" ${ctx.sh}/>`,\n );\n const builtAt = moments.findIndex(\n (mo) => mo.built?.chain === chain.id && mo.built.number === n,\n );\n const ring =\n builtAt < 0\n ? \"\"\n : `<g class=\"dg-a\" style=\"${m.vis((windows[builtAt] as TryWindow).b, spanOf(moments[builtAt]?.step ?? 0).end)}\">${frameShape(ctx.corner, ' class=\"dg-halo\"', box, `<rect class=\"dg-halo\" width=\"${r1(chain.w)}\" height=\"${r1(chain.h)}\" rx=\"${B.radius}\"/>`)}${frameShape(ctx.corner, ' class=\"dg-on\"', box, `<rect class=\"dg-on\" width=\"${r1(chain.w)}\" height=\"${r1(chain.h)}\" rx=\"${B.radius}\"/>`)}</g>`;\n const label = chain.labels[n] ?? String(n);\n const no = write(\n undefined,\n cls(\"dg-try-no\", label),\n B.padX,\n chain.noBaseline - chain.top,\n label,\n TYPE.tryBlockNo,\n );\n record(\n label,\n hasWide(label) ? sansOf(TYPE.tryBlockNo) : TYPE.tryBlockNo,\n moved.rests,\n B.padX,\n chain.noBaseline - chain.top,\n );\n const prevs = moments.map((mo) => (blockOf(mo, n)?.prev ?? \"\").slice(0, 4));\n const hashes = moments.map((mo) => (blockOf(mo, n)?.hash ?? \"\").slice(0, 4));\n const caption = `<text class=\"dg-try-cap\" x=\"${B.padX}\" y=\"${r1(chain.captionBaseline - chain.top)}\">SHA-256</text>`;\n record(\"SHA-256\", TYPE.tryCaption, moved.rests, B.padX, chain.captionBaseline - chain.top);\n return `<g class=\"dg-a\" data-block=\"${n}\" data-chain=\"${esc(chain.id)}\" style=\"${moved.style}\">${frame}${ring}${no}${row(chain.prevY - chain.top, \"prev\", prevs, false, moved.rests)}${caption}${row(chain.hashY - chain.top, \"hash\", hashes, true, moved.rests)}</g>`;\n });\n\n // つながり。後ろのブロックの左上を原点に、前のブロックの hash の行の右端から後ろのブロックの prev の行まで引く。\n // 横に並べた形は 2 つのブロックの間を通って prev の行の左端へ、縦に組んだ形はブロックの右を回って prev の行の右端へ引く\n const hashMid = chain.hashY - chain.top + B.row / 2;\n const prevMid = chain.prevY - chain.top + B.row / 2;\n const stacked = k.layout.arrangement === \"stack\";\n const rowEnd = chain.w - B.padX;\n const above = hashMid - chain.h - B.gap;\n const midX = stacked ? chain.w + B.side : -B.gap / 2;\n const elbow = pathOf(\n stacked\n ? [\n [rowEnd, above],\n [midX, above],\n [midX, prevMid],\n [rowEnd, prevMid],\n ]\n : [\n [-B.gap - B.padX, hashMid],\n [midX, hashMid],\n [midX, prevMid],\n [B.padX, prevMid],\n ],\n ctx.corner,\n );\n const badge = T.link.badge;\n const badgeY = stacked ? (above + prevMid) / 2 : (hashMid + prevMid) / 2;\n const links = numbers\n .filter((n) => n > 1)\n .map((n) => {\n const key = blockKey(chain.id, n);\n const before = blockKey(chain.id, n - 1);\n const positions = moments.map((mo) =>\n mo.blocks[before] ? (mo.blocks[key] ?? null) : null,\n );\n const moved = track(positions);\n const status = moments.map((mo, k) => (positions[k] ? (blockOf(mo, n)?.link ?? \"ok\") : \"\"));\n const phases = phasesOf(status).filter((p) => p.value !== \"\");\n const kinds = [...new Set(phases.map((p) => p.value))];\n const variant = (kind: string): string => {\n const broken = kind === \"broken\";\n const ranges: Shown[] = phases.filter((p) => p.value === kind).map((p) => [p.from, p.to]);\n const anim =\n kinds.length > 1\n ? ` class=\"dg-a\" style=\"${cs(broken ? T.color.broken : T.color.part)};${shownKf(ranges)}\"`\n : ` style=\"${cs(broken ? T.color.broken : T.color.part)}\"`;\n const symbol = broken ? \"≠\" : \"=\";\n return (\n `<g data-link-state=\"${kind}\"${anim}><path class=\"dg-try-ln\" d=\"${elbow}\"/>` +\n `<rect class=\"dg-try-lb\" x=\"${r1(midX - badge / 2)}\" y=\"${r1(badgeY - badge / 2)}\" width=\"${badge}\" height=\"${badge}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>` +\n `<text class=\"dg-try-lt\" x=\"${r1(midX)}\" y=\"${r1(badgeY + LOOK.baseline.label)}\" text-anchor=\"middle\">${symbol}</text></g>`\n );\n };\n return `<g class=\"dg-a\" data-link=\"${n - 1}-${n}\" data-chain=\"${esc(chain.id)}\" style=\"${moved.style}\">${kinds.map(variant).join(\"\")}</g>`;\n });\n\n // 畳んだ印。畳んだ数ごとに字を替え、畳んだブロックが無い間は出さない\n const counts = moments.map((mo) => {\n const list = mo.state.chains[chain.id] ?? [];\n return list.filter((b) => !b.shown).length;\n });\n const foldPhases = phasesOf(counts).filter((p) => p.value > 0);\n const fold =\n foldPhases.length === 0\n ? \"\"\n : `<g data-fold=\"${esc(chain.id)}\">${foldPhases\n .map((p) => {\n const text = chain.folds[p.value] ?? String(p.value);\n const w =\n textBox(text, 0, 0, hasWide(text) ? sansOf(TYPE.tryHint) : TYPE.tryHint).w +\n T.fold.padX * 2;\n const x = chain.fold.right - w;\n const rect = { x, y: chain.fold.y, w, h: T.fold.h };\n const label = write(\n ctx.ink,\n cls(\"dg-try-ft\", text),\n x + T.fold.padX,\n chain.fold.y + T.fold.h / 2 + LOOK.baseline.tag,\n text,\n hasWide(text) ? sansOf(TYPE.tryHint) : TYPE.tryHint,\n [[p.from, p.to]],\n );\n return `<g class=\"dg-a\" style=\"${shownKf([[p.from, p.to]])}\">${frameShape(ctx.corner, ' class=\"dg-try-fold\"', rect, `<rect class=\"dg-try-fold\" x=\"${r1(x)}\" y=\"${r1(rect.y)}\" width=\"${r1(w)}\" height=\"${T.fold.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>`)}${label}</g>`;\n })\n .join(\"\")}</g>`;\n return `<g data-chain-row=\"${esc(chain.id)}\" style=\"${cs(T.color.part)}\">${blocks.join(\"\")}${links.join(\"\")}${fold}</g>`;\n}\n","/**\n * 記録の列の描き方 (#3441)。\n *\n * 記録は新しい方から 3 つを左から古い順に並べ、記録が足されると左へ滑り、古い記録は消えて畳んだ印に数える。\n * 狭い枠で縦に組んだ形は上から古い順に積み、記録が足されると上へ滑る。機械の列と違って、記録の間につながりを引かない。\n * 記録の中の字は番号と、`all` を書いた記録の列の印と、中のチップの名前と欄の値の行だけで、prev と hash と SHA-256 を出さない。\n * 印と欄の値は、書き換えた段から新しい値に替わる。印は `yes` の印を部品の色、`no` の印を橙で出す。\n * 網の節の関門で止まった記録 (#3476) は、印の札に再試行できるかの印 (再試行できるは橙、直して送り直すは止まった色) を出し、\n * チップの行の下に止まった節の行とエラーの名前の行を分けて止まった色で出す (#3478)。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない。\n */\nimport { recordKey, type TryLogPlaced, type TryMoment } from \"../../kinds/try/layout\";\nimport { hasWide, textBox } from \"../../layout/measure\";\nimport { TRY_LOOK } from \"../../look/try\";\nimport { LOOK, TYPE } from \"../../look/values\";\nimport { frameShape, partRadius } from \"../../render/corner\";\nimport type { Shown } from \"../../render/ink\";\nimport { esc, r1, sansOf, write } from \"../../render/parts\";\nimport type { TryKit, TryWindow } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\n\nconst T = TRY_LOOK;\nconst B = T.block;\nconst C = T.chip;\n\n/** 記録の列ごとの題と、記録と畳んだ印 */\nexport function logRows(k: TryKit): void {\n const { layout, title, base, node } = k;\n for (const log of layout.logs ?? []) {\n base.push(`<g data-part=\"${esc(log.id)}\" style=\"${cs(T.color.part)}\">${title(log.title)}</g>`);\n node.push(drawLog(k, log));\n }\n}\n\n/** 記録の列 1 つ。記録は左上を原点に描いて出来事ごとの位置へ動かす */\nfunction drawLog(k: TryKit, log: TryLogPlaced): string {\n const { ctx, layout, diagram, moments, windows, spanOf, track, phasesOf, shownKf, phased, record, cls } = k;\n const { m } = ctx;\n const part = diagram.try?.parts.find((p) => p.type === \"log\" && p.id === log.id);\n const all = part?.type === \"log\" ? part.all : undefined;\n const numbers = [\n ...new Set(moments.flatMap((mo) => (mo.state.logs?.[log.id] ?? []).map((r) => r.number))),\n ].sort((a, b) => a - b);\n const recordOf = (mo: TryMoment, n: number) =>\n (mo.state.logs?.[log.id] ?? []).find((r) => r.number === n);\n const pitch = C.h + C.gap;\n const baseline = C.h / 2 + LOOK.baseline.tag;\n const rowW = log.w - B.padX * 2;\n\n const records = numbers.map((n) => {\n const moved = track(moments.map((mo) => mo.records?.[recordKey(log.id, n)] ?? null));\n const box = { x: 0, y: 0, w: log.w, h: log.h };\n const frame = frameShape(\n ctx.corner,\n ` class=\"dg-try-blk\" ${ctx.sh}`,\n box,\n `<rect class=\"dg-try-blk\" width=\"${r1(log.w)}\" height=\"${r1(log.h)}\" rx=\"${B.radius}\" ${ctx.sh}/>`,\n );\n const loggedAt = moments.findIndex((mo) => mo.logged?.log === log.id && mo.logged.number === n);\n const ring =\n loggedAt < 0\n ? \"\"\n : `<g class=\"dg-a\" style=\"${m.vis((windows[loggedAt] as TryWindow).b, spanOf(moments[loggedAt]?.step ?? 0).end)}\">${frameShape(ctx.corner, ' class=\"dg-halo\"', box, `<rect class=\"dg-halo\" width=\"${r1(log.w)}\" height=\"${r1(log.h)}\" rx=\"${B.radius}\"/>`)}${frameShape(ctx.corner, ' class=\"dg-on\"', box, `<rect class=\"dg-on\" width=\"${r1(log.w)}\" height=\"${r1(log.h)}\" rx=\"${B.radius}\"/>`)}</g>`;\n const label = log.labels[n] ?? String(n);\n const noY = log.noBaseline - log.top;\n const no = write(undefined, cls(\"dg-try-no\", label), B.padX, noY, label, TYPE.tryBlockNo);\n record(label, hasWide(label) ? sansOf(TYPE.tryBlockNo) : TYPE.tryBlockNo, moved.rests, B.padX, noY);\n\n // 印の札。印が替わる時刻で区切り、yes の印と no の印で色を替える。関門で止まった記録は再試行できるかの印を出す (#3476)\n let mark = \"\";\n const markW = log.mark;\n const stop = log.stops?.[n];\n if ((all || stop) && markW !== undefined) {\n const marks = moments.map((mo) => (all ? (recordOf(mo, n)?.mark ?? \"\") : recordOf(mo, n) && stop ? stop.mark : \"\"));\n const phases = phasesOf(marks).filter((p) => p.value !== \"\");\n const x = log.w - B.padX - markW;\n const y = log.markY - log.top;\n const rect = { x, y, w: markW, h: T.fold.h };\n const textY = y + T.fold.h / 2 + LOOK.baseline.tag;\n const kinds = [...new Set(phases.map((p) => p.value))];\n mark = kinds\n .map((kind) => {\n const ranges: Shown[] = phases.filter((p) => p.value === kind).map((p) => [p.from, p.to]);\n const color = all ? (kind === all.yes ? T.color.part : T.color.broken) : stop?.retry ? T.color.broken : T.color.stop;\n const style = hasWide(kind) ? sansOf(TYPE.tryChipValue) : TYPE.tryChipValue;\n for (const [from, to] of ranges)\n record(kind, style, moved.rests, x + markW / 2, textY, \"middle\", [from, to]);\n const anim = kinds.length > 1 ? ` class=\"dg-a\" style=\"${cs(color)};${shownKf(ranges)}\"` : ` style=\"${cs(color)}\"`;\n return (\n `<g data-mark=\"${esc(kind)}\"${anim}>` +\n frameShape(ctx.corner, ' class=\"dg-try-mb\"', rect, `<rect class=\"dg-try-mb\" x=\"${r1(x)}\" y=\"${r1(y)}\" width=\"${r1(markW)}\" height=\"${T.fold.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>`) +\n `<text class=\"${cls(\"dg-try-mk\", kind)}\" x=\"${r1(x + markW / 2)}\" y=\"${r1(textY)}\" text-anchor=\"middle\">${esc(kind)}</text></g>`\n );\n })\n .join(\"\");\n }\n\n // 中のチップの行。名前を左に、欄の値を右に出す。記録の中身は作った後に変わらず、欄の値だけが書き換えで替わる\n const items = recordOf(moments.find((mo) => recordOf(mo, n)) ?? (moments[0] as TryMoment), n)?.items ?? [];\n const rows = items\n .map((id, i) => {\n const y = log.rowTop - log.top + i * pitch;\n const name = layout.names[id] ?? id;\n const nameStyle = hasWide(name) ? sansOf(TYPE.tryChip) : TYPE.tryChip;\n const nameText = write(undefined, cls(\"dg-try-cn\", name), B.padX + C.padX, y + baseline, name, TYPE.tryChip);\n record(name, nameStyle, moved.rests, B.padX + C.padX, y + baseline);\n const field = log.field;\n const values = field === undefined ? [] : moments.map((mo) => mo.state.items[id]?.[field] ?? \"\");\n const valueX = log.w - B.padX - C.padX;\n const valueText = field === undefined ? \"\" : phased(values, valueX, y + baseline, cls(\"dg-try-cv\", values.join(\"\")), \"end\");\n for (const p of phasesOf(values)) {\n const style = hasWide(p.value) ? sansOf(TYPE.tryChipValue) : TYPE.tryChipValue;\n record(p.value, style, moved.rests, valueX - textBox(p.value, 0, 0, style).w, y + baseline, \"start\", [p.from, p.to]);\n }\n return `<g data-item=\"${esc(id)}\"><rect class=\"dg-try-row\" x=\"${B.padX}\" y=\"${r1(y)}\" width=\"${r1(rowW)}\" height=\"${C.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>${nameText}${valueText}</g>`;\n })\n .join(\"\");\n // 関門で止まった記録の、止まった節の行とエラーの名前の行。チップの行の下に 1 行ずつ分けて止まった色で出す (#3476、#3478)\n const stopRows = stop\n ? `<g style=\"${cs(T.color.stop)}\">${[\n { text: stop.at, base: \"dg-try-cn\", style: TYPE.tryChip },\n { text: stop.error, base: \"dg-try-cv\", style: TYPE.tryChipValue },\n ]\n .map(({ text, base, style }, k) => {\n const y = log.rowTop - log.top + (items.length + k) * pitch;\n record(text, hasWide(text) ? sansOf(style) : style, moved.rests, B.padX + C.padX, y + baseline);\n return `<rect class=\"dg-try-hrow\" x=\"${B.padX}\" y=\"${r1(y)}\" width=\"${r1(rowW)}\" height=\"${C.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>${write(undefined, cls(base, text), B.padX + C.padX, y + baseline, text, style)}`;\n })\n .join(\"\")}</g>`\n : \"\";\n return `<g class=\"dg-a\" data-record=\"${n}\" style=\"${moved.style}\">${frame}${ring}${no}${mark}${rows}${stopRows}</g>`;\n });\n\n // 畳んだ印。畳んだ数ごとに字を替え、畳んだ記録が無い間は出さない\n const counts = moments.map((mo) => (mo.state.logs?.[log.id] ?? []).filter((r) => !r.shown).length);\n const foldPhases = phasesOf(counts).filter((p) => p.value > 0);\n const fold =\n foldPhases.length === 0\n ? \"\"\n : `<g data-fold=\"${esc(log.id)}\">${foldPhases\n .map((p) => {\n const text = log.folds[p.value] ?? String(p.value);\n const style = hasWide(text) ? sansOf(TYPE.tryHint) : TYPE.tryHint;\n const w = textBox(text, 0, 0, style).w + T.fold.padX * 2;\n const x = log.fold.right - w;\n const rect = { x, y: log.fold.y, w, h: T.fold.h };\n const label = write(ctx.ink, cls(\"dg-try-ft\", text), x + T.fold.padX, log.fold.y + T.fold.h / 2 + LOOK.baseline.tag, text, style, [[p.from, p.to]]);\n return `<g class=\"dg-a\" style=\"${shownKf([[p.from, p.to]])}\">${frameShape(ctx.corner, ' class=\"dg-try-fold\"', rect, `<rect class=\"dg-try-fold\" x=\"${r1(x)}\" y=\"${r1(rect.y)}\" width=\"${r1(w)}\" height=\"${T.fold.h}\" rx=\"${partRadius(ctx.corner, C.radius)}\"/>`)}${label}</g>`;\n })\n .join(\"\")}</g>`;\n return `<g data-log=\"${esc(log.id)}\" style=\"${cs(T.color.part)}\">${records.join(\"\")}${fold}</g>`;\n}\n","/**\n * 待ち行列の描き方 (#3337、#3348)。\n *\n * 待ち行列の題と枠と、釦が上から何件を取り出すかの字を、動かさずに描く。中で待つチップは入力の帯のブロックの描き方が描く。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { TRY_LOOK } from \"../../look/try\";\nimport { TYPE } from \"../../look/values\";\nimport { frameShape } from \"../../render/corner\";\nimport { esc, r1, write } from \"../../render/parts\";\nimport type { TryKit } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\n\nconst T = TRY_LOOK;\nconst B = T.block;\n\n/** 待ち行列ごとの題と枠と、釦が上から何件を取り出すかの字 */\nexport function queueFrames(k: TryKit): void {\n const { layout, ctx, title, base } = k;\n for (const queue of layout.queues) {\n const placed = layout.parts.find((p) => p.id === queue.id);\n const box = frameShape(\n ctx.corner,\n ` class=\"dg-try-q\"`,\n queue.box,\n `<rect class=\"dg-try-q\" x=\"${r1(queue.box.x)}\" y=\"${r1(queue.box.y)}\" width=\"${r1(queue.box.w)}\" height=\"${r1(queue.box.h)}\" rx=\"${B.radius}\"/>`,\n );\n const hint = queue.hint\n ? write(\n ctx.ink,\n \"dg-try-hint\",\n queue.hint.x,\n queue.hint.baseline,\n queue.hint.text,\n TYPE.tryHint,\n )\n : \"\";\n base.push(\n `<g data-part=\"${esc(queue.id)}\" data-most=\"${placed?.most ?? queue.slots.length}\" style=\"${cs(T.color.part)}\">${title(queue.title)}${box}${hint}</g>`,\n );\n }\n}\n","/**\n * 網の描き方 (#3337、#3348)。\n *\n * 部品の題と網の線と節は動かさずに描き、送る側 (`from`) の節は人の絵、作る人 (`to`) の節は箱の絵、ほかの節は機械の絵を丸に載せる。\n * 名札は節の下に描き、隣の名札とぶつかるので上へ逃がした節 (#3478) だけ節の上に描く。\n * 網の線は描いた線の記録 (`traces`) にも足し、線が名札を横切ると字の重なりと崩れの確かめが知らせる (#3524)。\n * 網を運ばれたチップが通った線は、送った段の間だけ強める。\n * 関門で止まったチップ (#3476) の節には、チップが着いた時刻 (`move`) から段の終わりまで輪の印 (`data-stop`) を出す。\n * この file は試す図を描く部品 (`render/try.ts`) だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport { hasWide } from \"../../layout/measure\";\nimport type { Point } from \"../../layout/scene\";\nimport { TRY_LOOK } from \"../../look/try\";\nimport { TYPE } from \"../../look/values\";\nimport { ALWAYS } from \"../../render/ink\";\nimport { esc, pathOf, r1, sansOf, write } from \"../../render/parts\";\nimport type { TryKit, TryWindow } from \"../../render/try\";\nimport { cs } from \"../color/draw\";\nimport { glyph } from \"../icon/draw\";\n\nconst T = TRY_LOOK;\n\n/** 網ごとの題と線と節と、送った段の間だけ強める通った線と、関門で止まった節の印 */\nexport function routeNet(k: TryKit): void {\n const { layout, ctx, moments, windows, spanOf, title, cls, base, lit, node } = k;\n const { m } = ctx;\n for (const route of layout.routes) {\n const stops = moments\n .map((mo, k) => {\n const at = mo.stop?.route === route.id ? route.nodes.find((n) => n.id === mo.stop?.node) : undefined;\n if (!at) return \"\";\n const w = windows[k] as TryWindow;\n return `<g class=\"dg-a\" data-stop=\"${esc(at.id)}\" style=\"${cs(T.color.stop)};${m.vis(w.move, spanOf(mo.step).end)}\"><circle class=\"dg-try-stop\" cx=\"${r1(at.x)}\" cy=\"${r1(at.y)}\" r=\"${T.route.r + T.route.stop}\"/></g>`;\n })\n .join(\"\");\n const links = route.links\n .map((l) => {\n // 線の両端は節の名前で呼ぶ。網の線は初めから最後まで見えている\n ctx.traces.push({ from: l.a, to: l.b, points: l.points, shown: ALWAYS });\n return `<path class=\"dg-try-net\" d=\"${pathOf(l.points, ctx.corner)}\"/>`;\n })\n .join(\"\");\n const nodes = route.nodes\n .map((n) => {\n const end = n.end !== undefined;\n const icon = n.end === \"from\" ? \"user\" : n.end === \"to\" ? \"block\" : \"server\";\n const label = write(\n ctx.ink,\n `${cls(\"dg-try-nt\", n.id)}${end ? \" dg-try-nte\" : \"\"}`,\n n.x,\n n.label === \"above\" ? n.y - T.route.labelUp : n.y + T.route.labelY,\n n.id,\n hasWide(n.id) ? sansOf(TYPE.tryNode) : TYPE.tryNode,\n ALWAYS,\n \"middle\",\n );\n return `<g data-node=\"${esc(n.id)}\"><circle class=\"${end ? \"dg-try-end\" : \"dg-try-node\"}\" cx=\"${r1(n.x)}\" cy=\"${r1(n.y)}\" r=\"${T.route.r}\"/>${glyph(icon, n.x, n.y, T.route.glyph, end ? \"dg-gl\" : \"dg-try-ng\")}${label}</g>`;\n })\n .join(\"\");\n base.push(\n `<g data-part=\"${esc(route.id)}\" style=\"${cs(T.color.part)}\">${title(route.title)}${links}</g>`,\n );\n node.push(`<g data-route=\"${esc(route.id)}\" style=\"${cs(T.color.part)}\">${nodes}${stops}</g>`);\n moments.forEach((mo, k) => {\n if (mo.trip?.route !== route.id) return;\n const at = new Map(route.nodes.map((n) => [n.id, n]));\n const path = mo.state.trips.find((t) => t.item === mo.trip?.item)?.path ?? [];\n const points = path.flatMap((id): Point[] => {\n const n = at.get(id);\n return n ? [[n.x, n.y]] : [];\n });\n if (points.length < 2) return;\n const w = windows[k] as TryWindow;\n lit.push(\n `<path class=\"dg-try-trip dg-a\" data-trip=\"${esc(mo.trip.item)}\" d=\"${pathOf(points, ctx.corner)}\" style=\"${cs(T.color.part)};${m.vis(w.a, spanOf(mo.step).end)}\"/>`,\n );\n });\n }\n}\n","/**\n * 試す図 (#3337) を描く部品。見た目の元は承認した板 (網を上に、待ち行列と、prev と hash を `=` でつないだ機械の列を下に置く形)。\n *\n * 出来事ごとの時刻と、出来事ごとの位置を辿る動きと、時点ごとに替わる字を描く状態 (`TryKit`) に組み、\n * 網、待ち行列、機械の列、入力の帯のブロックの描き方 (`blocks/<名前>/draw.ts`) を層の順に呼ぶ (#3348)。\n * 呼ぶ順は網、待ち行列、機械の列、チップ、記録の列で、この順が動きの名前の番号を決める。見た目の規則 (`TRY_CSS`) は試す図の SVG にだけ書く。\n * 書き手の段を全て描くので、書き出しと印刷は書き手の例の段を描く。最後の段の止め絵は最後の段の状態。\n */\nimport { tryChips } from \"../blocks/ask/draw\";\nimport { chainRows } from \"../blocks/chain/draw\";\nimport { logRows } from \"../blocks/log/draw\";\nimport { queueFrames } from \"../blocks/queue/draw\";\nimport { routeNet } from \"../blocks/route/draw\";\nimport { hasWide, textBox } from \"../layout/measure\";\nimport { type Point, type Rect, unionRect } from \"../layout/scene\";\nimport type { TryLayout, TryMoment } from \"../kinds/try/layout\";\nimport { EASE, LOOK, MOTION, type TextStyle, TYPE } from \"../look/values\";\nimport type { DiagramModel } from \"../schema\";\nimport type { Span, Timeline } from \"../timeline\";\nimport type { Shown } from \"./ink\";\nimport type { Frame } from \"./motion\";\nimport { type Ctx, cssFont as font, cssMix as mix, esc, r1, sansOf, write } from \"./parts\";\n\nconst S = LOOK.stroke;\nconst X = LOOK.mix;\n\n/**\n * 試す図の部品の見た目。どの値も値の表から読む。試す図の SVG にだけ書き、ほかの図の SVG と頁が最初に読む script に入れない。\n * 末尾に j を付けた class は、和文を含む字を同じ大きさと太さの和文の字で描く\n */\nconst TRY_CSS = [\n `.dg-try-t{${font(TYPE.tryTitle)};fill:var(--ct)}`,\n `.dg-try-tj{${font(sansOf(TYPE.tryTitle))}}`,\n `.dg-try-net{fill:none;stroke:var(--line);stroke-width:${S.edge};stroke-linecap:round}`,\n `.dg-try-trip{fill:none;stroke:var(--c);stroke-width:${S.edgeOn};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-try-node{fill:var(--surf);stroke:var(--line);stroke-width:${S.slot}}`,\n `.dg-try-end{fill:${mix(X.chipTint)};stroke:var(--c);stroke-width:${S.on}}`,\n `.dg-try-ng{fill:none;stroke:var(--mute);stroke-width:${S.glyph};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-try-nt{${font(TYPE.tryNode)};fill:var(--mute)}`,\n `.dg-try-ntj{${font(sansOf(TYPE.tryNode))}}`,\n \".dg-try-nte{fill:var(--ink)}\",\n `.dg-try-q{fill:var(--surf);stroke:var(--hair);stroke-width:${S.hair}}`,\n `.dg-try-hint{${font(TYPE.tryHint)};fill:var(--ct)}`,\n `.dg-try-chip{fill:var(--surf);stroke:var(--line);stroke-width:${S.hair}}`,\n `.dg-try-sent{fill:${mix(X.chipTint)};stroke:var(--c);stroke-width:${S.on}}`,\n `.dg-try-cn{${font(TYPE.tryChip)};fill:var(--ink)}`,\n `.dg-try-cnj{${font(sansOf(TYPE.tryChip))}}`,\n `.dg-try-cv{${font(TYPE.tryChipValue)};fill:var(--ct)}`,\n `.dg-try-cvj{${font(sansOf(TYPE.tryChipValue))}}`,\n `.dg-try-blk{fill:var(--surf);stroke:var(--hair);stroke-width:${S.hair}}`,\n `.dg-try-no{${font(TYPE.tryBlockNo)};fill:var(--mute)}`,\n `.dg-try-noj{${font(sansOf(TYPE.tryBlockNo))}}`,\n `.dg-try-row{fill:var(--sunk);stroke:var(--hair);stroke-width:${S.hair}}`,\n `.dg-try-hrow{fill:${mix(X.chipTint)};stroke:${mix(X.capEdge, \"transparent\")};stroke-width:${S.hair}}`,\n `.dg-try-rk{${font(TYPE.tryRowKey)};fill:var(--mute)}`,\n `.dg-try-rv{${font(TYPE.tryRowValue)};fill:var(--ink)}`,\n \".dg-try-hv{fill:var(--ct)}\",\n `.dg-try-cap{${font(TYPE.tryCaption)};fill:var(--mute)}`,\n `.dg-try-ln{fill:none;stroke:var(--c);stroke-width:${S.edge};stroke-linecap:round;stroke-linejoin:round}`,\n `.dg-try-lb{fill:var(--surf);stroke:var(--c);stroke-width:${S.on}}`,\n `.dg-try-lt{${font(TYPE.tryLink)};fill:var(--ct)}`,\n `.dg-try-fold{fill:var(--surf);stroke:var(--hair);stroke-width:${S.hair};stroke-dasharray:3 3}`,\n `.dg-try-ft{${font(TYPE.tryHint)};fill:var(--mute)}`,\n `.dg-try-ftj{${font(sansOf(TYPE.tryHint))}}`,\n].join(\"\");\n\n/**\n * 記録の列 (#3441) だけが使う見た目。記録の列を持つ図の SVG にだけ書き、記録の列を持たない図の SVG を変えない。\n * 印の札は色の役の色で縁を引き、印の字は色の役の字の色で書く\n */\nconst LOG_CSS = [\n `.dg-try-mb{fill:${mix(X.chipTint)};stroke:var(--c);stroke-width:${S.on}}`,\n `.dg-try-mk{${font(TYPE.tryChipValue)};fill:var(--ct)}`,\n `.dg-try-mkj{${font(sansOf(TYPE.tryChipValue))}}`,\n].join(\"\");\n\n/** 網の節の関門 (#3476) を持つ図だけが使う見た目。関門で止まった節の輪を止まった色で引く。関門を持たない図の SVG を変えない */\nconst GATE_CSS = `.dg-try-stop{fill:none;stroke:var(--c);stroke-width:${S.on}}`;\n\n/** 和文を含む字に、和文の字の class を足す */\nconst cls = (base: string, text: string): string => (hasWide(text) ? `${base} ${base}j` : base);\n\nconst translate = (p: Point): string => `translate(${r1(p[0])}px,${r1(p[1])}px)`;\n\nconst same = (a: Point | null, b: Point | null): boolean =>\n a === null || b === null ? a === b : a[0] === b[0] && a[1] === b[1];\n\n/** 止まって見えている間と、その時の左上。字の重なりを数える時に、止まっている字だけを記録する */\nexport interface TryRest {\n at: Point;\n from: number;\n to: number;\n}\n\n/** 出来事の時刻。`a` で始め、`b` で終え、`move` は網を運ばれるチップが待ち行列へ入り始める時刻 (ほかのチップが席を詰め始める時刻) */\nexport interface TryWindow {\n a: number;\n b: number;\n move: number;\n}\n\n/**\n * 試す図のブロックの描き方 (網、待ち行列、機械の列、入力の帯) が受ける、描く状態 (#3348)。\n * 描き方は描いた物を層 (`base`、`lit`、`node`、`top`) に積み、呼ぶ順が動きの名前の番号を決める\n */\nexport interface TryKit {\n readonly layout: TryLayout;\n readonly diagram: DiagramModel;\n readonly ctx: Ctx;\n /** 出来事ごとの状態と、出来事ごとの時刻。最初の時点 (何も起きる前) を含む */\n readonly moments: TryMoment[];\n readonly windows: TryWindow[];\n /** 段 `s` の時刻 */\n readonly spanOf: (s: number) => Span;\n /** 出来事ごとの位置 (出ていなければ `null`) を辿る動きと、止まって見えている間。`trip` を返す時点は、その点を順に辿ってから席へ入る */\n readonly track: (positions: (Point | null)[], trip?: (k: number) => Point[] | undefined) => { style: string; rests: TryRest[] };\n /** 出来事ごとの値が替わる時刻で区切った値の並び */\n readonly phasesOf: <V>(values: V[]) => { value: V; from: number; to: number }[];\n /** `from` から `to` まで見える動き。`prop` は変える性質 */\n readonly shownKf: (ranges: Shown[], prop?: string) => string;\n /** 時点ごとに替わる字 */\n readonly phased: (texts: string[], x: number, y: number, className: string, anchor?: \"middle\" | \"end\") => string;\n /** 止まって見えている字を、字の重なりを数える記録に足す */\n readonly record: (text: string, style: TextStyle, rests: TryRest[], x: number, y: number, anchor?: \"start\" | \"middle\", shown?: Shown) => void;\n /** 部品の題 */\n readonly title: (t: { text: string; x: number; baseline: number }) => string;\n /** 和文を含む字に、同じ大きさと太さの和文の字の class を足す */\n readonly cls: (base: string, text: string) => string;\n /** 層。下から、地と題と枠 (`base`)、通った線 (`lit`)、網の節とブロック (`node`)、チップ (`top`) */\n readonly base: string[];\n readonly lit: string[];\n readonly node: string[];\n readonly top: string[];\n}\n\nexport function drawTry(\n layout: TryLayout,\n diagram: DiagramModel,\n timeline: Timeline,\n ctx: Ctx,\n): { base: string; lit: string; node: string; top: string; css: string } {\n const { m } = ctx;\n const moments = layout.moments;\n const spanOf = (s: number): Span => timeline.steps[s] as Span;\n /** 出来事ごとの時刻。最初の時点 (何も起きる前) は 0 */\n const windows: TryWindow[] = moments.map((mo) => {\n if (mo.step < 0) return { a: 0, b: 0, move: 0 };\n const time = timeline.edges.find((t) => t.step === mo.step && t.event === mo.event);\n const a = time?.start ?? spanOf(mo.step).start;\n const b = time?.drawn ?? a;\n return { a, b, move: mo.trip !== undefined ? Math.min(b, a + MOTION.try.trip) : a };\n });\n\n /**\n * 出来事ごとの位置 `positions` (出ていなければ `null`) を辿る動き。現れる時は席で浮かび、消える時は席で薄れ、別の席へは滑る。\n * `trip` を返す時点は、その点を順に辿ってから席へ入る。席の無い時点 (関門で止まったチップ、#3476) は最後の点で薄れて消える。繰り返す前に消える\n */\n const track = (\n positions: (Point | null)[],\n trip: (k: number) => Point[] | undefined = () => undefined,\n ): { style: string; rests: TryRest[] } => {\n const first = positions.find((p): p is Point => p !== null) ?? [0, 0];\n const frames: Frame[] = [[0, { opacity: 0, transform: translate(first) }]];\n const rests: TryRest[] = [];\n let cur: Point | null = positions[0] ?? null;\n let since = 0;\n let lastSeen = first;\n for (let k = 1; k < positions.length; k++) {\n const next = positions[k] ?? null;\n const w = windows[k] as TryWindow;\n const path = trip(k);\n if (same(cur, next) && !path) continue;\n // 止まっていた間は、動き出す時刻まで。席から席へ滑るチップは、網を運ばれるチップが待ち行列へ入り始めるまで止まっている\n if (cur) rests.push({ at: cur, from: since, to: next && !path ? w.move : w.a });\n if (path && path.length > 0) {\n // 送る側の節で現れ、道の長さに比べた時間で節を順に通り、作る人から待ち行列の席へ入る\n const start = path[0] as Point;\n const arrive = Math.min(w.b, w.a + MOTION.try.trip);\n const appear = Math.min(arrive, w.a + MOTION.popFade);\n frames.push(\n [w.a, { opacity: 0, transform: translate(start) }, EASE.out],\n [appear, { opacity: 1, transform: translate(start) }],\n );\n const legs = path\n .slice(1)\n .map((p, i) => Math.hypot(p[0] - (path[i] as Point)[0], p[1] - (path[i] as Point)[1]));\n const total = legs.reduce((sum, l) => sum + l, 0) || 1;\n let walked = 0;\n path.slice(1).forEach((p, i) => {\n walked += legs[i] ?? 0;\n frames.push([\n appear + ((arrive - appear) * walked) / total,\n { opacity: 1, transform: translate(p) },\n ]);\n });\n const end = path[path.length - 1] as Point;\n frames.push(\n [\n arrive,\n { opacity: 1, transform: translate(end) },\n EASE.inOut,\n ],\n [w.b, { opacity: next ? 1 : 0, transform: translate(next ?? end) }],\n );\n if (!next) lastSeen = end;\n } else if (!cur && next) {\n frames.push(\n [w.a, { opacity: 0, transform: translate(next) }, EASE.out],\n [w.b, { opacity: 1, transform: translate(next) }],\n );\n } else if (cur && !next) {\n frames.push(\n [w.a, { opacity: 1, transform: translate(cur) }, EASE.inOut],\n [w.b, { opacity: 0, transform: translate(cur) }],\n );\n } else if (cur && next) {\n frames.push(\n [w.move, { opacity: 1, transform: translate(cur) }, EASE.inOut],\n [w.b, { opacity: 1, transform: translate(next) }],\n );\n }\n since = w.b;\n cur = next;\n if (next) lastSeen = next;\n }\n if (cur) rests.push({ at: cur, from: since, to: m.last });\n frames.push(\n [m.last, { opacity: cur ? 1 : 0, transform: translate(lastSeen) }, EASE.inOut],\n [m.total, { opacity: 0, transform: translate(lastSeen) }],\n );\n return { style: m.kf(frames), rests };\n };\n\n /** 出来事ごとの値 `values` が替わる時刻で区切った値の並び。最初の値は初めから */\n const phasesOf = <V>(values: V[]): { value: V; from: number; to: number }[] => {\n const out: { value: V; from: number; to: number }[] = [];\n values.forEach((value, k) => {\n const last = out[out.length - 1];\n if (last && last.value === value) return;\n const from = last ? (windows[k] as TryWindow).b : 0;\n if (last) last.to = from;\n out.push({ value, from, to: Number.POSITIVE_INFINITY });\n });\n return out;\n };\n\n /** `from` から `to` まで見える動き。`prop` は変える性質 (字の一部は `fill-opacity` で消す) */\n const shownKf = (ranges: Shown[], prop = \"opacity\"): string => {\n const frames: Frame[] = [[0, { [prop]: 0 }]];\n for (const [a, b] of ranges) {\n if (a <= 0) frames.push([0, { [prop]: 1 }]);\n else frames.push([a, { [prop]: 0 }, EASE.out], [a + MOTION.fade, { [prop]: 1 }]);\n if (Number.isFinite(b))\n frames.push(\n [b, { [prop]: 1 }, EASE.inOut],\n [Math.min(b + MOTION.fade, m.total), { [prop]: 0 }],\n );\n else frames.push([m.last, { [prop]: 1 }, EASE.inOut]);\n }\n frames.push([m.total, { [prop]: 0 }]);\n return m.kf(frames);\n };\n\n /** 時点ごとに替わる字。替わらなければ 1 つの字、替われば替わる時刻ごとに薄れて入れ替わる字の並び */\n const phased = (\n texts: string[],\n x: number,\n y: number,\n className: string,\n anchor?: \"middle\" | \"end\",\n ): string => {\n const phases = phasesOf(texts).filter((p) => p.value !== \"\");\n const head = `<text class=\"${className}\" x=\"${r1(x)}\" y=\"${r1(y)}\"${anchor ? ` text-anchor=\"${anchor}\"` : \"\"}>`;\n if (phases.length <= 1) return `${head}${esc(phases[0]?.value ?? \"\")}</text>`;\n return `${head}${phases.map((p) => `<tspan class=\"dg-a\" x=\"${r1(x)}\" style=\"${shownKf([[p.from, p.to]], \"fill-opacity\")}\">${esc(p.value)}</tspan>`).join(\"\")}</text>`;\n };\n\n /** 止まって見えている字を、字の重なりを数える記録に足す */\n const record = (\n text: string,\n style: TextStyle,\n rests: TryRest[],\n x: number,\n y: number,\n anchor?: \"start\" | \"middle\",\n shown: Shown = [0, Number.POSITIVE_INFINITY],\n ): void => {\n if (text === \"\") return;\n for (const r of rests) {\n const a = Math.max(r.from, shown[0]);\n const b = Math.min(r.to, shown[1]);\n if (a < b)\n ctx.ink.push({\n text,\n rect: textBox(text, r.at[0] + x, r.at[1] + y, style, anchor),\n shown: [[a, b]],\n });\n }\n };\n\n const base: string[] = [];\n const lit: string[] = [];\n const node: string[] = [];\n const top: string[] = [];\n const title = (t: { text: string; x: number; baseline: number }): string =>\n write(\n ctx.ink,\n cls(\"dg-try-t\", t.text),\n t.x,\n t.baseline,\n t.text,\n hasWide(t.text) ? sansOf(TYPE.tryTitle) : TYPE.tryTitle,\n );\n const kit: TryKit = { layout, diagram, ctx, moments, windows, spanOf, track, phasesOf, shownKf, phased, record, title, cls, base, lit, node, top };\n // 呼ぶ順が動きの名前の番号を決めるので、移す前の順のまま呼ぶ\n routeNet(kit);\n queueFrames(kit);\n chainRows(kit);\n tryChips(kit);\n // 記録の列はチップの後に呼び、記録の列を持たない図の動きの名前の番号を変えない\n logRows(kit);\n return {\n base: base.join(\"\"),\n lit: lit.join(\"\"),\n node: node.join(\"\"),\n top: top.join(\"\"),\n css: (layout.logs ? TRY_CSS + LOG_CSS : TRY_CSS) + ((diagram.try?.checks ?? []).length > 0 ? GATE_CSS : \"\"),\n };\n}\n\n/**\n * 寄って追う窓が寄せる所 (#3337)。動く物を全部囲んだ所の真ん中で、囲んだ所が窓 (`vw` × `vh`) より大きい時は、最初の物が窓から外れない所までに留める。\n * 網は図の幅いっぱいに広がるので、全部を囲んだ所の真ん中へ寄せると、狭い窓では送った先の待ち行列が窓から外れる。動く物が無ければ `undefined`\n */\nexport function anchoredCenter(parts: Rect[], vw: number, vh: number): [number, number] | undefined {\n const first = parts[0];\n if (!first) return undefined;\n const all = unionRect(parts);\n // 窓の幅 `size` で `[lo, lo + len]` を外さない真ん中の範囲に、全部を囲んだ所の真ん中 `c` を収める。窓より大きい物は真ん中に置く\n const keep = (c: number, lo: number, len: number, size: number): number =>\n len > size ? lo + len / 2 : Math.min(lo + size / 2, Math.max(lo + len - size / 2, c));\n return [\n keep(all.x + all.w / 2, first.x, first.w, vw),\n keep(all.y + all.h / 2, first.y, first.h, vh),\n ];\n}\n","/**\n * 釦の描き方 (#3337、#3348)。\n *\n * 釦は図の上に描かず、再生の部品 (`try-player.ts`) が頁の釦として置く。置き場 (`at`) を書いた釦は、その部品の題の右に重ねて置く。\n * この file は釦を重ねる図の上の所を、並べた部品の題から求める。再生の部品だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport type { TryLayout } from \"../../kinds/try/layout\";\nimport { textWidth } from \"../../layout/measure\";\nimport { LOOK, TYPE } from \"../../look/values\";\n\n/** 部品 `part` の題の右の、図の上の釦を置く所 (図の座標)。題を持たない部品は `undefined` */\nexport function pressSpot(layout: TryLayout, part: string): { x: number; y: number } | undefined {\n const title = [...layout.routes, ...layout.queues, ...layout.chains, ...(layout.logs ?? [])].find((p) => p.id === part)?.title;\n if (!title) return undefined;\n return {\n x: title.x + textWidth(title.text, TYPE.tryTitle),\n y: title.baseline - TYPE.tryTitle.size * LOOK.player.ask.mid,\n };\n}\n","/**\n * 試す図 (`try`、#3337) の再生の部品の操作。\n *\n * 再生の部品 (`player.ts`) は試す図を、書き手の最初の段だけを持つ原本 (今の原本) で描き、この file の操作を図の下と図の上に置く。\n * 図の下の入力の帯 (`form[data-dragon=\"ask\"]`) には、欄ごとの入力と送る釦と、置き場 (`at`) を書かない釦 (`press`) を並べる。\n * 選択肢を持たない文字の欄は `TYPED_MOST` 字までしか打てず、図は打った名前を切らずに出す (#3458)。\n * 置き場を書いた釦は図の上のその部品の題の右に置き、寄って追う図か、帯の中身の幅が `LOOK.player.narrow` より狭い時は帯へ移す。\n * 空の待ち行列から取り出す釦と、満杯の待ち行列へ送る送る釦は押せなくし、押せない訳を `[data-dragon=\"reason\"]` に出す。\n * 送る先の待ち行列が `accept` に書いていない名前を入れた送る釦と、2 つ以上の待ち行列のどれかが `take` 件に満たない釦も同じく押せなくする (#3453)。\n * 網の節の関門 (#3476) で止まる値は待ち行列に入らないので、送る先が満杯か受け入れないかを問わずに送れる。止まった段の本文は止まった節とエラーの名前を書く。\n * 機械の列が `edit` を持つ時、ブロックの中のチップを押すと書き換える欄 (`form[data-dragon=\"edit\"]`) を出す。\n * 送る、押す、書き換えるたびに、記法と同じ出来事を 1 つ持つ段を渡した言葉の題と本文で作り、再生の部品へ渡す。\n * 押せるかと訳は今の原本の最後の段の状態 (`layout.states`) から読む。読み手の値はどこにも保存しない。\n * 操作の要素は描き直しても作り直さず、押した物は帯と図の上の層の 2 か所で受けるので、釦を移しても受け方は変わらない。\n * この file は試す図の描く部品と同じ塊 (`kinds/try.ts`) に入り、軽い入口では試す図を読んだ時に届く。\n * 再生の部品は試す図を描けた後にだけ操作を置くので、操作を置く時には塊が届いている。見た目は操作を置く時に頁へ 1 度だけ入れる。\n */\nimport { pressSpot } from \"./blocks/press/draw\";\nimport type { TryLayout } from \"./kinds/try/layout\";\nimport { textWidth } from \"./layout/measure\";\nimport { TRY_LOOK } from \"./look/try\";\nimport { LOOK, TYPE } from \"./look/values\";\nimport { cssFont as font } from \"./render/parts\";\nimport type { DiagramModel, Step, TryPart } from \"./schema\";\nimport { accepts, askFields, fromsOf, intoOf, stopOf, type TryState } from \"./try-state\";\nimport type { Styles } from \"./adopt-css\";\nimport { TRY_TEXT } from \"./try-text\";\nimport type { NotationLang } from \"./words\";\n\ntype Part<T extends TryPart[\"type\"]> = Extract<TryPart, { type: T }>;\n/** 入力の帯と書き換えの欄。選択肢を持つ欄は選ぶ欄、持たない欄は文字の欄 (#3422) */\ntype FieldInput = HTMLInputElement | HTMLSelectElement;\n\nconst px = (v: number): string => `${v}px`;\nconst percent = (v: number): string => `${v * 100}%`;\n\n/** チップの名前に使える字。原本はチップを名札で名指すので、名札に使えない字 (空白、`[`、`]`、`「`、`」`、`=`、`:`) を断る */\nconst NAME = /^[^\\s[\\]「」=:]+$/u;\n\n/** 文字の欄に打てる字数。図はチップの名前を切らずに出すので、読み手が打つ値をここで限る (#3458) */\nconst TYPED_MOST = 12;\n\n/** 入力の帯と書き換える欄と、図の上の釦の見た目。操作を置く時に頁へ 1 度だけ入れる */\nfunction tryCss(): string {\n const P = LOOK.player;\n const A = P.ask;\n const hair = px(LOOK.stroke.hair);\n // 送る釦と決める釦と入力の縁は、図のチップとブロックと同じ色で塗る\n const tint = `var(--c-${TRY_LOOK.color.part})`;\n return [\n `.dg-try{display:flex;flex-direction:column;gap:${px(P.gap / 2)}}`,\n `.dg-ask{container:dg-ask/inline-size;margin:0;padding:${px(A.pad)};border:${hair} solid var(--hair);border-radius:${px(P.radius)};background:var(--sunk)}`,\n \".dg-ask[hidden]{display:none}\",\n `.dg-ask-row{display:flex;flex-wrap:wrap;align-items:flex-end;gap:${px(P.gap)}}`,\n // 選ぶ欄は一番長い候補が収まる幅 (--dg-field-min) より縮めず、1 行に入らない欄は次の行へ送る (#3485)。打つ欄は今どおり縮める。\n // 次の行へ送った欄 (data-wrap) は伸ばさず、1 行目の欄だけが伸びて行を埋める (#3492)\n `.dg-field{position:relative;display:flex;flex-direction:column;gap:${px(A.label)};flex:1 1 ${px(A.field)};min-width:var(--dg-field-min,0px)}`,\n \".dg-field[data-wrap]{flex-grow:0}\",\n `.dg-fl{${font(TYPE.askLabel)};color:var(--mute);overflow:hidden;text-overflow:ellipsis;white-space:nowrap}`,\n `.dg-in{box-sizing:border-box;width:100%;height:${px(P.touch)};margin:0;padding:0 ${px(A.inset)};border:${hair} solid var(--line);border-radius:${px(A.radius)};background:var(--surf);color:var(--ink);${font(TYPE.askInput)}}`,\n `.dg-in:focus{outline:${hair} solid ${tint};border-color:${tint}}`,\n // 選ぶ欄はブラウザの矢印を描かず、右に矢印の場所を空けて、dragon が描く矢印 (.dg-caret) を右の縁から字と同じ余白で置く (#3492)\n `select.dg-in{appearance:none;-webkit-appearance:none;padding-right:${px(A.inset + A.arrow)}}`,\n `.dg-caret{position:absolute;right:${px(A.inset + LOOK.stroke.hair)};bottom:${px((P.touch - A.caret.h) / 2)};width:${px(A.caret.w)};height:${px(A.caret.h)};margin:0;padding:0;border:0;color:var(--mute);pointer-events:none}`,\n // 矢印の山形は、対角が矢印の幅になる正方形の右と下の縁を 45 度回して描く (#3499)。左右の角が枠の左右の端に、下の角が枠の下の端に来る\n `.dg-caret::before{content:\"\";position:absolute;left:50%;top:${px(A.caret.h - A.caret.w / 2)};width:${px(A.caret.w / Math.SQRT2)};height:${px(A.caret.w / Math.SQRT2)};box-sizing:border-box;border-right:${px(A.caret.line)} solid currentColor;border-bottom:${px(A.caret.line)} solid currentColor;transform:translate(-50%,-50%) rotate(45deg)}`,\n `.dg-act{box-sizing:border-box;flex:none;min-width:${px(P.touch)};min-height:${px(P.touch)};margin:0;padding:0 ${px(A.side)};border:${hair} solid var(--line);border-radius:${px(A.radius)};background:var(--surf);color:var(--ink);${font(TYPE.button)};cursor:pointer}`,\n `.dg-act:focus-visible{outline:${px(P.focus)} solid var(--c-blue);outline-offset:${px(P.focus)}}`,\n `.dg-act:is([data-dragon=\"send\"],[data-dragon=\"apply\"]){border-color:${tint};background:${tint};color:var(--on-c)}`,\n `.dg-act:disabled{opacity:${A.dim};cursor:not-allowed}`,\n `.dg-why{margin:0;${font(TYPE.askReason)};color:var(--t-amber);white-space:pre-line}`,\n \".dg-why:empty{display:none}\",\n // 図の上の釦の層は図 (SVG) と同じ所と大きさに置き、釦の位置を図の寸法の割合で決める。層は図のチップへの押下を遮らない\n \".dg-player[data-try] .dg-frame{position:relative}\",\n \".dg-ats{position:absolute;left:0;top:0;pointer-events:none}\",\n `.dg-ats .dg-act{position:absolute;min-height:${px(P.button)};height:${px(P.button)};transform:translateY(-50%);pointer-events:auto;white-space:nowrap}`,\n `@media (pointer: coarse){.dg-ats .dg-act{min-height:${px(P.touch)};height:${px(P.touch)}}}`,\n \".dg-player [data-chip][data-editable]{cursor:pointer}\",\n // 狭い帯 (携帯の幅) では欄と釦を 2 列の升に並べ、どれも帯の幅に収める\n `@container dg-ask (width < ${px(P.narrow)}){.dg-ask-row{display:grid;grid-template-columns:repeat(2,minmax(0,1fr));align-items:end}.dg-field{min-width:0;max-width:none}.dg-act{width:100%;min-width:0}}`,\n // 角を落とす色味は、帯と入力と釦の角を丸めない (#3344)\n '.dg-player[data-corner=\"cut\"] :is(.dg-ask,.dg-in,.dg-act){border-radius:0}',\n ].join(\"\");\n}\n\n/** 見た目を入れる。再生の部品の見た目 (`dragon-player-css`) の後ろに置く。口`styles`を渡された時は口で図を置いた所の根へ入れる (#3695) */\nfunction ensureTryCss(doc: Document, styles?: Styles): void {\n if (styles) return styles.adopt(\"dragon-try-css\", tryCss());\n if (doc.getElementById(\"dragon-try-css\")) return;\n const style = doc.createElement(\"style\");\n style.id = \"dragon-try-css\";\n style.textContent = tryCss();\n doc.head.appendChild(style);\n}\n\n/** 書き出した頁で試す図の操作が出しうる字。字の file に残す */\nexport function tryTexts(model: DiagramModel, lang: NotationLang): string[] {\n const w = TRY_TEXT[lang];\n const parts = model.try?.parts ?? [];\n return [\n ...parts.map((p) => p.id),\n ...askFields(parts),\n \"0123456789\",\n w.trySend,\n w.tryApply,\n w.tryClose,\n w.tryBlank,\n w.tryBlankEdit,\n w.tryFull(\"\", 0),\n w.tryEmpty(\"\", \"\"),\n // 待ち行列の accept と、2 つ以上の待ち行列から集める釦 (#3453) の、押せない訳と押した段の本文\n ...(parts.some((p) => p.type === \"queue\" && p.accept !== undefined) ? [w.tryRefused(\"\", \"\")] : []),\n ...(parts.some((p) => p.type === \"press\" && fromsOf(p).length > 1)\n ? [w.tryShort(\"\", \"\", 0), w.tryGatheredBody(1, [\"\", \"\"], 0), w.tryGatheredBody(2, [\"\", \"\"], 0), w.tryGatheredRecordBody(1, [\"\", \"\"], \"\", 0), w.tryGatheredRecordBody(2, [\"\", \"\"], \"\", 0)]\n : []),\n // 網の節の関門 (#3476) の、止まった記録の字と止まった段の本文\n ...(model.try?.checks ?? []).flatMap((c) => [c.node, c.no, w.tryStoppedAt(c.node), w.tryStoppedBody(\"\", c.node, c.no), c.retry ? w.tryRetry : w.tryResend]),\n w.tryBadName(\"\"),\n w.tryEditField(\"\", \"\"),\n w.trySent(\"\"),\n w.trySentBody(\"\", \"\", \"\"),\n w.trySentBody(\"\", \"\"),\n w.tryPressed(\"\"),\n w.tryPressedBody(1, \"\", 0),\n w.tryPressedBody(2, \"\", 0),\n // 記録の列 (#3441) の、読み手が足す記録の番号と印と、押した段の本文\n ...parts.flatMap((p) =>\n p.type === \"log\"\n ? [w.tryRecord(0), w.tryFoldedRecords(1), w.tryFoldedRecords(2), w.tryPressedRecordBody(1, \"\", \"\", 0), w.tryPressedRecordBody(2, \"\", \"\", 0), ...(p.all ? [p.all.yes, p.all.no] : [])]\n : [],\n ),\n w.tryEdited(\"\", \"\"),\n w.tryEditedBody(\"\", \"\", \"\"),\n ];\n}\n\nexport interface TryControls {\n /** 図の下に置く帯。入力の帯と、開いている間の書き換える欄と、押せない訳を持つ */\n readonly tools: HTMLElement;\n /** 図の上に置く釦の層。図の枠の中に置く */\n readonly layer: HTMLElement;\n /** 今の原本を描いた置き場所で、押せるかと押せない訳と、図の上の釦の位置を決め直す */\n update(layout: TryLayout): void;\n /** 置き場を書いた釦を図の上と帯のどちらに置くかを選ぶ。`fallback` は帯の幅を測れない時に使う幅 */\n arrange(view: string, fallback: number): void;\n /** 図の上の釦の層を、図 (SVG) と同じ所と大きさにする */\n fit(frame: HTMLElement, svg: SVGSVGElement): void;\n /** 段 `step` の図で、書き換えられるチップ (ブロックの中のチップ) に印を付ける */\n mark(svg: SVGSVGElement, step: number): void;\n /** 図のチップ `item` を押した。段 `step` でブロックの中に居るチップなら書き換える欄を出す */\n pick(item: string, step: number): void;\n /** 段を足せなかった訳を出す */\n refuse(message: string): void;\n destroy(): void;\n}\n\n/**\n * 試す図の操作を作る。`model` は今の原本を描いた形、`layout` はその置き場所。\n * `add` は読み手の操作で作った段を受け取り、今の原本に足して描き直せた時に真を返す\n */\nexport function mountTryControls(\n doc: Document,\n styles: Styles | undefined,\n model: DiagramModel,\n layout: TryLayout,\n lang: NotationLang,\n add: (step: Step) => boolean,\n): TryControls {\n ensureTryCss(doc, styles);\n const words = TRY_TEXT[lang];\n const parts = model.try?.parts ?? [];\n const ask = parts.find((p): p is Part<\"ask\"> => p.type === \"ask\");\n const presses = parts.filter((p): p is Part<\"press\"> => p.type === \"press\");\n /** 機械の列ごとの、読み手が書き換えられる欄 */\n const edits = new Map(\n parts.flatMap((p) =>\n p.type === \"chain\" && p.edit !== undefined ? [[p.id, p.edit] as const] : [],\n ),\n );\n const fields = askFields(parts);\n /** 送る先を受け入れる名前で限る待ち行列が在るか (#3453)。在れば、名前の欄を打ち直すたびに送れるかを決め直す */\n const limited = parts.some((p) => p.type === \"queue\" && p.accept !== undefined);\n /** 網の節の関門 (#3476) と、関門を置く入力の帯の網。関門を持つ図は、どの欄を打ち直しても送れるかを決め直す */\n const checks = model.try?.checks ?? [];\n const via = parts.find((p): p is Part<\"route\"> => p.type === \"route\" && p.id === ask?.via);\n let current = layout;\n /** 押した時の断り (空の欄など)。次に描き直すか打ち込むまで出す */\n let notice = \"\";\n /** 押せない釦の訳 */\n let blocked: string[] = [];\n /** 置き場を書いた釦を図の上に置いているか */\n let over = false;\n\n const button = (role: string, text: string, type: \"submit\" | \"button\"): HTMLButtonElement => {\n const b = doc.createElement(\"button\");\n b.type = type;\n b.className = \"dg-act\";\n b.dataset.dragon = role;\n b.textContent = text;\n return b;\n };\n /**\n * 選ぶ欄の右に置く下向きの矢印 (#3492)。見た目だけの印で、押した時は下の選ぶ欄が開く。\n * 形は CSS (`.dg-caret::before`) が描き、svg を使わない。図を置いた頁が svg に当てる幅や高さの規則で膨らまない (#3499)\n */\n const caret = (): HTMLSpanElement => {\n const mark = doc.createElement(\"span\");\n mark.className = \"dg-caret\";\n mark.setAttribute(\"aria-hidden\", \"true\");\n return mark;\n };\n /** 欄ごとの選択肢 (#3422)。選択肢を持つ欄は打たせず選ばせる */\n const choices = ask?.choices ?? {};\n /**\n * 欄 `name` の札と欄。選択肢を持つ欄は選択肢を書いた順に並べた選ぶ欄で、`value` が選択肢に無ければ最初の選択肢を選ぶ。\n * 選択肢を持たない欄は `TYPED_MOST` 字まで打てる文字の欄\n */\n const field = (name: string, label: string, value = \"\"): { label: HTMLLabelElement; input: FieldInput } => {\n const box = doc.createElement(\"label\");\n box.className = \"dg-field\";\n const caption = doc.createElement(\"span\");\n caption.className = \"dg-fl\";\n caption.textContent = label;\n const options = choices[name];\n let input: FieldInput;\n if (options) {\n const select = doc.createElement(\"select\");\n for (const option of options) {\n const o = doc.createElement(\"option\");\n o.value = option;\n o.textContent = option;\n select.append(o);\n }\n select.value = options.includes(value) ? value : (options[0] ?? \"\");\n // 一番長い候補の字と左右の余白と矢印と縁が収まる幅を、欄の幅の下限にする (#3485)。選んだ値の字を欄の幅で切らない。\n // 欄の名前の字の幅も下回らないので、次の行へ送って伸ばさない欄でも名前を「…」で切らない (#3492)\n const A = LOOK.player.ask;\n const longest = Math.max(0, ...options.map((option) => textWidth(option, TYPE.askInput)));\n const least = Math.ceil(Math.max(longest + 2 * A.inset + A.arrow + 2 * LOOK.stroke.hair, textWidth(label, TYPE.askLabel)));\n box.style.setProperty(\"--dg-field-min\", px(least));\n input = select;\n } else {\n const text = doc.createElement(\"input\");\n text.type = \"text\";\n text.autocomplete = \"off\";\n text.maxLength = TYPED_MOST;\n text.value = value;\n input = text;\n }\n input.className = \"dg-in\";\n input.dataset.field = name;\n box.append(caption, input);\n if (options) box.append(caret());\n return { label: box, input };\n };\n\n const tools = doc.createElement(\"div\");\n tools.className = \"dg-try\";\n // 置いた頁の言葉と違っても、釦の字と押せない訳を渡した言葉の声で読ませる\n tools.setAttribute(\"lang\", lang);\n const form = doc.createElement(\"form\");\n form.className = \"dg-ask\";\n form.dataset.dragon = \"ask\";\n form.noValidate = true;\n form.setAttribute(\"aria-label\", words.tryAsk);\n const row = doc.createElement(\"div\");\n row.className = \"dg-ask-row\";\n form.append(row);\n const inputs = ask ? fields.map((name) => field(name, name)) : [];\n const send = ask ? button(\"send\", words.trySend, \"submit\") : undefined;\n const pressed = new Map(\n presses.map((p) => {\n const b = button(\"press\", p.id, \"button\");\n b.dataset.press = p.id;\n if (p.at !== undefined) b.dataset.at = p.at;\n return [p.id, b] as const;\n }),\n );\n row.append(...inputs.map((i) => i.label), ...(send ? [send] : []));\n const reason = doc.createElement(\"p\");\n reason.className = \"dg-why\";\n reason.dataset.dragon = \"reason\";\n reason.setAttribute(\"aria-live\", \"polite\");\n tools.append(form, reason);\n const layer = doc.createElement(\"div\");\n layer.className = \"dg-ats\";\n let editor:\n { form: HTMLFormElement; input: FieldInput; item: string; field: string } | undefined;\n\n const lastState = (): TryState | undefined => current.states[current.states.length - 1];\n const say = (): void => {\n reason.textContent = [notice, ...blocked].filter((t) => t !== \"\").join(\"\\n\");\n };\n const refuse = (message: string): void => {\n notice = message;\n say();\n };\n\n /** 釦を置く図の上の所。図の上に置かない釦 (置き場を書かない釦、題を持たない部品に置く釦、帯へ移した釦) は `undefined` */\n const spotFor = (p: Part<\"press\">): { x: number; y: number } | undefined =>\n over && p.at !== undefined ? pressSpot(current, p.at) : undefined;\n /** 図の上の釦を、置き場の部品の題の右に置く。置き場所は描き直すと変わりうるので、描き直すたびに決め直す */\n const position = (): void => {\n for (const p of presses) {\n const b = pressed.get(p.id) as HTMLButtonElement;\n const spot = spotFor(p);\n if (spot) {\n b.style.left = `calc(${percent(spot.x / current.width)} + ${px(LOOK.player.ask.at)})`;\n b.style.top = percent(spot.y / current.height);\n } else {\n b.style.removeProperty(\"left\");\n b.style.removeProperty(\"top\");\n }\n }\n };\n /**\n * 釦を書いた順に帯か図の上の層へ並べる。並べる所が変わった時 (幅が変わった時) だけ呼び、\n * 描き直すたびには動かさない。押した釦と打ち込み中の欄から、押したり打ち込んだりする先 (focus) を外さないため\n */\n const move = (): void => {\n for (const p of presses)\n (spotFor(p) ? layer : row).append(pressed.get(p.id) as HTMLButtonElement);\n form.hidden = row.childElementCount === 0;\n position();\n // 釦を帯へ移すと行の並びが変わるので、次の行へ送った欄を決め直す (#3492)\n settle();\n };\n\n /** 入力の帯の今の値 */\n const typed = (): string[] => inputs.map((i) => i.input.value.trim());\n /** 送る先の待ち行列。`into` に欄を書いた入力の帯は、その欄に今選んでいる値の待ち行列 (#3441) */\n const target = (): string =>\n ask ? intoOf(ask, typed(), (id) => parts.some((p) => p.id === id)) : \"\";\n /** 今の値のチップが止まる関門 (#3476)。空の欄がある間は決めない */\n const stopped = (values: readonly string[]) =>\n via && values.every((v) => v !== \"\") ? stopOf(checks, via, fields, values) : undefined;\n const update = (next: TryLayout): void => {\n current = next;\n const last = lastState();\n const reasons: string[] = [];\n if (ask && send) {\n const into = target();\n const most = next.parts.find((p) => p.id === into)?.most ?? Number.POSITIVE_INFINITY;\n // 名前を入れる前は受け入れるかを問わない。空の欄は送る時に断る。関門で止まる値は待ち行列に入らないので、受け入れと満杯を問わない (#3476)\n const name = inputs[0]?.input.value.trim() ?? \"\";\n const passing = stopped(typed()) === undefined;\n const refused = passing && name !== \"\" && !accepts(parts.find((p) => p.id === into), name);\n const full = passing && (last?.queues[into]?.length ?? 0) >= most;\n send.disabled = refused || full;\n if (refused) reasons.push(words.tryRefused(into, name));\n if (full) reasons.push(words.tryFull(into, most));\n }\n for (const p of presses) {\n const b = pressed.get(p.id) as HTMLButtonElement;\n const froms = fromsOf(p);\n // 1 つの待ち行列から取り出す釦は 1 件でもあれば押せ、2 つ以上から集める釦はどれにも take 件要る (#3453)\n const need = froms.length > 1 ? p.take : 1;\n const short = froms.find((id) => (last?.queues[id]?.length ?? 0) < need);\n b.disabled = short !== undefined;\n if (short !== undefined)\n reasons.push((last?.queues[short]?.length ?? 0) === 0 ? words.tryEmpty(short, p.id) : words.tryShort(short, p.id, p.take));\n }\n blocked = reasons;\n notice = \"\";\n say();\n position();\n };\n\n const closeEdit = (): void => {\n editor?.form.remove();\n editor = undefined;\n };\n const openEdit = (item: string, name: string): void => {\n closeEdit();\n const value = lastState()?.items[item]?.[fields.indexOf(name)] ?? \"\";\n const editForm = doc.createElement(\"form\");\n editForm.className = \"dg-ask\";\n editForm.dataset.dragon = \"edit\";\n editForm.dataset.item = item;\n editForm.noValidate = true;\n editForm.setAttribute(\"aria-label\", words.tryEditForm);\n const editRow = doc.createElement(\"div\");\n editRow.className = \"dg-ask-row\";\n const box = field(name, words.tryEditField(item, name), value);\n editRow.append(\n box.label,\n button(\"apply\", words.tryApply, \"submit\"),\n button(\"close\", words.tryClose, \"button\"),\n );\n editForm.append(editRow);\n tools.insertBefore(editForm, reason);\n editor = { form: editForm, input: box.input, item, field: name };\n box.input.focus();\n // 文字の欄は今の値を選んだ状態にして打ち直させる。選ぶ欄は今の値を選んで開く\n if (box.input.tagName === \"INPUT\") (box.input as HTMLInputElement).select();\n };\n\n const sendValues = (): void => {\n if (!ask || !send || send.disabled) return;\n const values = typed();\n if (values.some((v) => v === \"\")) return refuse(words.tryBlank);\n const name = values[0] ?? \"\";\n if (!NAME.test(name)) return refuse(words.tryBadName(fields[0] ?? \"\"));\n const stop = stopped(values)?.check;\n add({\n title: words.trySent(name),\n body: stop ? words.tryStoppedBody(name, stop.node, stop.no) : words.trySentBody(name, target(), ask.via),\n events: [{ type: \"ask\", values }],\n });\n };\n const press = (id: string | undefined): void => {\n const p = presses.find((x) => x.id === id);\n if (!p) return;\n const last = lastState();\n const froms = fromsOf(p);\n const waiting = froms.map((from) => last?.queues[from]?.length ?? 0);\n const records = last?.logs?.[p.into];\n const next = records ? records.length + 1 : (last?.chains[p.into]?.length ?? 0) + 1;\n // 2 つ以上の待ち行列から集める釦は、どの待ち行列にも take 件ある時だけ押せる (#3453)\n if (froms.length > 1) {\n if (waiting.some((n) => n < p.take)) return;\n add({\n title: words.tryPressed(p.id),\n body: records ? words.tryGatheredRecordBody(p.take, froms, p.into, next) : words.tryGatheredBody(p.take, froms, next),\n events: [{ type: \"press\", press: p.id }],\n });\n return;\n }\n const from = froms[0] ?? \"\";\n const count = Math.min(p.take, waiting[0] ?? 0);\n if (count === 0) return;\n add({\n title: words.tryPressed(p.id),\n body: records ? words.tryPressedRecordBody(count, from, p.into, next) : words.tryPressedBody(count, from, next),\n events: [{ type: \"press\", press: p.id }],\n });\n };\n const applyEdit = (): void => {\n if (!editor) return;\n const { item, field: name } = editor;\n const value = editor.input.value.trim();\n if (value === \"\") return refuse(words.tryBlankEdit);\n const from = lastState()?.items[item]?.[fields.indexOf(name)] ?? \"\";\n const added = add({\n title: words.tryEdited(item, name),\n body: words.tryEditedBody(name, from, value),\n events: [{ type: \"item\", item, values: { [name]: value } }],\n });\n if (added) closeEdit();\n };\n\n // 押した物は帯と図の上の層で受ける。釦を帯と層の間で移しても、描き直しても受け方が変わらない\n const onClick = (event: Event): void => {\n const target = (event.target as Element | null)?.closest?.(\"button\");\n if (!target || target.disabled) return;\n const role = target.getAttribute(\"data-dragon\");\n if (role === \"press\") press(target.getAttribute(\"data-press\") ?? undefined);\n else if (role === \"close\") closeEdit();\n };\n const onSubmit = (event: Event): void => {\n event.preventDefault();\n if (event.target === form) sendValues();\n else if (editor && event.target === editor.form) applyEdit();\n };\n const onInput = (event: Event): void => {\n // into に書いた欄を選び直すと送る先の待ち行列が替わるので、送れるかを決め直す (#3441)。\n // 受け入れる名前を限る待ち行列が在る図は、名前の欄を打ち直しても決め直す (#3453)。関門を持つ図は、どの欄を打ち直しても決め直す (#3476)\n const changed = (event.target as HTMLElement | null)?.dataset?.field;\n if (ask && changed !== undefined && (changed === ask.into || (limited && changed === fields[0]) || checks.length > 0)) {\n update(current);\n return;\n }\n if (notice === \"\") return;\n notice = \"\";\n say();\n };\n const onKey = (event: KeyboardEvent): void => {\n if (event.key === \"Escape\" && editor?.form.contains(event.target as Node | null)) closeEdit();\n };\n tools.addEventListener(\"click\", onClick);\n tools.addEventListener(\"submit\", onSubmit);\n tools.addEventListener(\"input\", onInput);\n tools.addEventListener(\"change\", onInput);\n tools.addEventListener(\"keydown\", onKey);\n layer.addEventListener(\"click\", onClick);\n\n /**\n * 帯の 2 行目より下へ送った欄に `data-wrap` を付け、伸ばさない (#3492)。印は伸びる幅だけを変え、どの欄がどの行に入るかは変えないので、\n * 1 度の判定で落ち着く。2 列の升 (細い帯) では行の並びを升が決めるので印を外す。帯の大きさが変わるたびに判定し直す\n */\n const settle = (): void => {\n const boxes = [...row.querySelectorAll<HTMLElement>(\":scope > .dg-field\")];\n for (const box of boxes) box.removeAttribute(\"data-wrap\");\n const view = doc.defaultView;\n if (boxes.length === 0 || !view || view.getComputedStyle(row).display !== \"flex\") return;\n const top = boxes[0]?.offsetTop ?? 0;\n for (const box of boxes) if (box.offsetTop > top + 1) box.setAttribute(\"data-wrap\", \"\");\n };\n\n move();\n update(layout);\n\n /** 釦の層を図 (SVG) と同じ所と大きさにする */\n const fitLayer = (frame: HTMLElement, svg: SVGSVGElement): void => {\n const f = frame.getBoundingClientRect();\n const s = svg.getBoundingClientRect();\n layer.style.left = px(s.left - f.left - frame.clientLeft + frame.scrollLeft);\n layer.style.top = px(s.top - f.top - frame.clientTop + frame.scrollTop);\n layer.style.width = px(s.width);\n layer.style.height = px(s.height);\n };\n /**\n * 合わせた図。頁が図の幅だけを替えて縮める時 (見本帳の枠に合わせた倍率など) は枠の大きさが変わらず、\n * 再生の部品は合わせ直さない。図の大きさが替わるたびに層を合わせ直し、元の大きさの層が枠からはみ出さないようにする\n */\n let fitted: { frame: HTMLElement; svg: SVGSVGElement } | undefined;\n const Observer = (doc.defaultView as (Window & { ResizeObserver?: typeof ResizeObserver }) | null)\n ?.ResizeObserver;\n const resized = Observer\n ? new Observer(() => {\n if (fitted) fitLayer(fitted.frame, fitted.svg);\n })\n : undefined;\n /** 入力の帯の行の大きさが変わったら、次の行へ送った欄を決め直す (#3492) */\n const rowResized = Observer ? new Observer(() => settle()) : undefined;\n rowResized?.observe(row);\n\n return {\n tools,\n layer,\n update,\n arrange: (view, fallback) => {\n const inner = (tools.clientWidth || fallback) - (LOOK.player.ask.pad + LOOK.stroke.hair) * 2;\n const next = view === \"fixed\" && inner >= LOOK.player.narrow;\n if (next === over) return;\n over = next;\n move();\n },\n fit: (frame, svg) => {\n if (fitted?.svg !== svg) {\n if (fitted) resized?.unobserve(fitted.svg);\n resized?.observe(svg);\n }\n fitted = { frame, svg };\n fitLayer(frame, svg);\n },\n mark: (svg, step) => {\n if (edits.size === 0) return;\n const chains = current.states[step]?.chains ?? {};\n const editable = new Set(\n Object.entries(chains)\n .filter(([id]) => edits.has(id))\n .flatMap(([, blocks]) => blocks.flatMap((b) => b.items)),\n );\n for (const chip of svg.querySelectorAll(\"[data-chip]\"))\n chip.toggleAttribute(\"data-editable\", editable.has(chip.getAttribute(\"data-chip\") ?? \"\"));\n },\n pick: (item, step) => {\n const chains = current.states[step]?.chains ?? {};\n const chain = Object.entries(chains).find(([, blocks]) =>\n blocks.some((b) => b.items.includes(item)),\n )?.[0];\n const name = chain === undefined ? undefined : edits.get(chain);\n if (name !== undefined) openEdit(item, name);\n },\n refuse,\n destroy: () => {\n resized?.disconnect();\n rowResized?.disconnect();\n tools.removeEventListener(\"click\", onClick);\n tools.removeEventListener(\"submit\", onSubmit);\n tools.removeEventListener(\"input\", onInput);\n tools.removeEventListener(\"keydown\", onKey);\n layer.removeEventListener(\"click\", onClick);\n tools.remove();\n layer.remove();\n },\n };\n}\n","/**\n * 試す図の描く部品の組 (#3337、#3656)。並べ方と、寄って追う窓が段ごとに見る所と、全体図に描く部品は図の種類の置き場 (`kinds/try/layout.ts`)、\n * 網と待ち行列と機械の列とチップの描き方と、窓を寄せる所は `render/try.ts` が持つ\n */\nimport { anchoredCenter, drawTry } from \"../render/try\";\nimport type { KindParts } from \"./parts\";\nimport { layoutTry, type TryLayout, tryFocusParts, tryOverview } from \"./try/layout\";\n\nexport const parts: KindParts<TryLayout> = {\n layout: (diagram, lang, options) => layoutTry(diagram, lang, options.width === undefined ? {} : { width: options.width }),\n draw: (layout, diagram, ctx) => drawTry(layout, diagram, ctx.t, ctx),\n // その段の出来事が触る部品を、出来事が着く所から順に見る\n focus: tryFocusParts,\n // 出来事が着く所 (送った先の待ち行列、作ったブロック、書き換えたブロック) を窓から外さずに寄せる\n aim: (_layout, _timeline, _step, rects, vw, vh) => anchoredCenter(rects, vw, vh),\n // 待ち行列の枠を地に、網の節と出ているブロックを札に描く\n overview: tryOverview,\n};\n\n/** 試す図の再生の部品の操作 (#3337)。再生の部品は試す図を描けた後に、登録簿から引いて置く */\nexport { mountTryControls, type TryControls } from \"../try-player\";\n"]}