@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/tree-GGBX3XAZ.cjs","../../src/blocks/leaf/draw.ts","../../src/blocks/node/draw.ts","../../src/render/tree.ts","../../src/kinds/tree/layout.ts","../../src/kinds/tree.ts"],"names":[],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACA;AC7CO,SAAS,OAAA,CAAQ,CAAA,EAAe,IAAA,EAAY,EAAA,EAAY,GAAA,EAAkB;AAC/E,EAAA,MAAM,EAAA,EAAI,CAAA,EAAA,EAAK,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,CAAA,EAAI,kCAAA,CAAG,CAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,sBAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA,GAAA,EAAM,kCAAA,IAAG,CAAK,EAAA,EAAI,sBAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA;AACtB,EAAA;AACxE;AAGuE;AACtD,EAAA;AAC8B,EAAA;AACtB,EAAA;AACsE,EAAA;AACZ,EAAA;AACnF;AD6C+F;AACA;AE1DvB;AACxD,EAAA;AAC0E,EAAA;AACxE,EAAA;AAC4B,IAAA;AACqB,IAAA;AAC7B,IAAA;AACK,IAAA;AACoB,IAAA;AACX,IAAA;AACjD,EAAA;AACwF,EAAA;AAC3F;AAM8F;AAC7E,EAAA;AACA,EAAA;AAC2B,EAAA;AAEa,EAAA;AACoC,EAAA;AAClD,EAAA;AAE4B,EAAA;AAEJ,EAAA;AAE7C,EAAA;AACkB,IAAA;AAK1B,IAAA;AAM6B,IAAA;AACmD,IAAA;AAElF,EAAA;AACoB,EAAA;AAChC;AFyC+F;AACA;AGjFd;AACjE,EAAA;AACC,EAAA;AAE6C,EAAA;AAGhB,EAAA;AACJ,EAAA;AACL,EAAA;AACJ,IAAA;AACJ,MAAA;AACU,MAAA;AACoB,QAAA;AACe,QAAA;AACpE,MAAA;AACF,IAAA;AACD,EAAA;AACyD,EAAA;AACb,IAAA;AACG,IAAA;AAChD,EAAA;AAGG,EAAA;AAC+D,IAAA;AAC9D,IAAA;AACF,EAAA;AAC4E,EAAA;AAG3B,EAAA;AACU,IAAA;AACnC,IAAA;AACqB,IAAA;AACiB,IAAA;AACtC,IAAA;AACJ,MAAA;AACiB,MAAA;AACQ,MAAA;AAC7C,IAAA;AACa,IAAA;AAC8E,MAAA;AACpF,IAAA;AAC6D,MAAA;AAC1C,MAAA;AAC1B,IAAA;AACkB,IAAA;AACpB,EAAA;AACkE,EAAA;AAC1C,IAAA;AAIhB,IAAA;AAER,EAAA;AAE4F,EAAA;AAI9E,EAAA;AACyB,IAAA;AACmB,IAAA;AAEhD,EAAA;AACiF,EAAA;AAG5D,EAAA;AAEX,EAAA;AAC+D,IAAA;AACvC,IAAA;AACkD,IAAA;AACnD,IAAA;AACJ,IAAA;AACA,IAAA;AACa,IAAA;AAC7B,IAAA;AACH,IAAA;AAC4B,MAAA;AACY,MAAA;AAC7B,MAAA;AACK,MAAA;AAC6B,MAAA;AACX,MAAA;AACjD,IAAA;AACoC,IAAA;AAC9B,IAAA;AACoF,MAAA;AAC3F,IAAA;AAEM,EAAA;AAG8E,EAAA;AAI1E,EAAA;AACsB,IAAA;AAC6B,IAAA;AACb,IAAA;AACuC,IAAA;AACZ,IAAA;AAErE,EAAA;AAEkE,EAAA;AAC9E;AHwD+F;AACA;AIlFR;AACjC,EAAA;AACvB,EAAA;AACW,EAAA;AAChB,EAAA;AACW,EAAA;AACH,IAAA;AACuD,MAAA;AACG,MAAA;AACzC,MAAA;AACgD,MAAA;AAChF,MAAA;AACd,IAAA;AACF,EAAA;AACuB,EAAA;AAC1B;AAGgF;AACT,EAAA;AACjE,EAAA;AACK,IAAA;AAC8B,MAAA;AACE,MAAA;AACvC,IAAA;AACmE,EAAA;AAC9D,EAAA;AACgC,IAAA;AACF,IAAA;AACrC,EAAA;AACF;AAG0C;AACpB,EAAA;AACS,EAAA;AACe,EAAA;AAC1B,EAAA;AACW,IAAA;AAEvB,IAAA;AACmB,MAAA;AACN,MAAA;AAEb,IAAA;AACa,MAAA;AACM,MAAA;AACnB,IAAA;AACN,EAAA;AAC8B,EAAA;AACa,EAAA;AACzB,EAAA;AACW,IAAA;AAEvB,IAAA;AACmB,MAAA;AACN,MAAA;AAEb,IAAA;AACa,MAAA;AACM,MAAA;AACnB,IAAA;AACN,EAAA;AACuB,EAAA;AACA,EAAA;AAChB,EAAA;AACmC,IAAA;AACjC,IAAA;AACgC,IAAA;AACzC,EAAA;AACF;AAE8D;AACR,EAAA;AACb,EAAA;AACY,EAAA;AACb,EAAA;AACU,EAAA;AAGV,EAAA;AACQ,EAAA;AAC7B,IAAA;AAC4C,IAAA;AAC7D,EAAA;AACkC,EAAA;AAEyC,EAAA;AAC8B,EAAA;AAElC,EAAA;AACgC,EAAA;AAChC,EAAA;AAGd,EAAA;AACiC,EAAA;AACxD,EAAA;AACC,EAAA;AACyB,EAAA;AACxB,EAAA;AACX,IAAA;AACS,IAAA;AACQ,IAAA;AACoC,IAAA;AAChE,IAAA;AACL,IAAA;AACT,EAAA;AACwB,EAAA;AACuC,EAAA;AAE/B,EAAA;AACa,EAAA;AACrB,IAAA;AACO,IAAA;AACV,IAAA;AACH,IAAA;AACG,IAAA;AACW,IAAA;AACI,IAAA;AAEuC,IAAA;AAC1C,IAAA;AACgB,IAAA;AACzB,IAAA;AACJ,IAAA;AACX,IAAA;AACC,MAAA;AACE,MAAA;AACD,MAAA;AACkC,MAAA;AAC7B,MAAA;AACJ,MAAA;AACC,MAAA;AACsC,MAAA;AAC/C,MAAA;AACY,MAAA;AACA,MAAA;AACZ,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACoC,MAAA;AACpC,MAAA;AACsC,MAAA;AACmD,MAAA;AAC3F,IAAA;AACD,EAAA;AACiD,EAAA;AAGlB,EAAA;AACS,IAAA;AACd,MAAA;AACP,MAAA;AACgB,MAAA;AACR,MAAA;AACM,QAAA;AAClB,QAAA;AACA,QAAA;AACwB,QAAA;AACpC,MAAA;AACsE,MAAA;AACvE,IAAA;AACH,EAAA;AAG+B,EAAA;AAC+D,EAAA;AACtD,EAAA;AACU,EAAA;AAC8C,EAAA;AAE3C,EAAA;AACuC,EAAA;AACxC,EAAA;AACqC,EAAA;AAClE,EAAA;AAC4B,EAAA;AAE0C,IAAA;AAC1E,IAAA;AACP,IAAA;AACA,IAAA;AACY,IAAA;AACd,MAAA;AACE,MAAA;AACoC,MAAA;AACG,MAAA;AACpB,MAAA;AACxB,MAAA;AACH,MAAA;AACG,MAAA;AACY,MAAA;AACH,MAAA;AACd,IAAA;AAC8B,IAAA;AACvB,IAAA;AACR,EAAA;AACkD,EAAA;AAG1B,EAAA;AACgB,EAAA;AACI,IAAA;AACV,MAAA;AACqC,MAAA;AACJ,MAAA;AAC1C,MAAA;AACyC,MAAA;AACE,MAAA;AAC9C,MAAA;AACuC,MAAA;AAC4B,MAAA;AACR,MAAA;AAC/E,IAAA;AACH,EAAA;AACkC,EAAA;AAGyB,EAAA;AAC3C,EAAA;AACe,IAAA;AACZ,IAAA;AACnB,EAAA;AAE2B,EAAA;AACnB,IAAA;AACC,IAAA;AACC,IAAA;AACE,IAAA;AACV,IAAA;AACY,IAAA;AACZ,IAAA;AACS,IAAA;AACC,IAAA;AACD,IAAA;AACD,IAAA;AACD,IAAA;AACP,IAAA;AACA,IAAA;AACA,IAAA;AACF,EAAA;AACiD,EAAA;AACA,EAAA;AAEU,EAAA;AACW,EAAA;AAC1B,EAAA;AACyC,EAAA;AACK,EAAA;AACpB,EAAA;AACK,EAAA;AAC5D,EAAA;AACwC,EAAA;AAC7B,EAAA;AAEuB,EAAA;AAC1C,EAAA;AACT;AAO6F;AAWkB;AACnF,EAAA;AACJ,EAAA;AACE,EAAA;AACG,EAAA;AAC2E,EAAA;AAEhC,EAAA;AACV,EAAA;AAC9C,IAAA;AACiC,IAAA;AAC/C,EAAA;AACsC,EAAA;AACC,EAAA;AACJ,EAAA;AACkD,IAAA;AACxD,IAAA;AACqC,IAAA;AACvB,IAAA;AAChB,MAAA;AACC,QAAA;AACb,QAAA;AACmB,QAAA;AACb,QAAA;AACjB,MAAA;AACuD,MAAA;AACvD,MAAA;AACF,IAAA;AACgE,IAAA;AAC/B,IAAA;AACkC,MAAA;AAEH,MAAA;AACO,MAAA;AACoB,MAAA;AACpE,MAAA;AACJ,MAAA;AACI,MAAA;AACrB,MAAA;AACF,IAAA;AAC0F,IAAA;AACjF,IAAA;AACmD,MAAA;AAC1D,MAAA;AACF,IAAA;AACmE,IAAA;AAC3B,MAAA;AACI,MAAA;AAC1C,MAAA;AACF,IAAA;AACiC,IAAA;AACW,IAAA;AAC8C,IAAA;AAC3F,EAAA;AAC+F,EAAA;AACH,EAAA;AAC/F;AAGiF;AAC1D,EAAA;AACc,EAAA;AACT,EAAA;AACY,EAAA;AAC+B,IAAA;AAC/C,IAAA;AACtB,EAAA;AAC6C,EAAA;AAClB,EAAA;AAC7B;AAMyC;AACwB,EAAA;AACb,EAAA;AACpD;AAG4F;AACxD,EAAA;AAC+B,EAAA;AAEM,EAAA;AACvB,EAAA;AACL,IAAA;AACF,MAAA;AACT,MAAA;AACR,MAAA;AACtB,IAAA;AACF,EAAA;AACO,EAAA;AACT;AAOgB;AACgB,EAAA;AACoC,EAAA;AACpC,EAAA;AACwB,IAAA;AACO,IAAA;AACgC,IAAA;AAE7C,IAAA;AACvC,IAAA;AACL,MAAA;AACwF,QAAA;AACC,QAAA;AACzF,MAAA;AACF,IAAA;AACF,EAAA;AACO,EAAA;AACT;AJmB+F;AACA;AKxgBnD;AAClC,EAAA;AAAA;AAEoF,EAAA;AAC5D,EAAA;AACmB,IAAA;AAGkB,IAAA;AAC5D,IAAA;AACM,MAAA;AACD,MAAA;AACC,MAAA;AACiF,MAAA;AAC9F,IAAA;AACF,EAAA;AAAA;AAEkC,EAAA;AACoD,IAAA;AACT,IAAA;AACtC,MAAA;AACA,MAAA;AACoD,MAAA;AACxF,IAAA;AACiF,IAAA;AACpF,EAAA;AACyF,EAAA;AAC3F;ALwgB+F;AACA;AACA","file":"/Users/cardene/Desktop/projects/dragon-3711-release-0-75-0/packages/dragon/dist/light/tree-GGBX3XAZ.cjs","sourcesContent":[null,"/**\n * 葉の描き方 (#3233、#3348)。\n *\n * 値を持つ葉の下に名札の札を置き、葉より前の最初の段から出しておく。葉が出た時に、葉と札を点線で結ぶ。\n * 札と点線を薄くする動きは、木の図を描く部品 (`render/tree.ts`) が箱ごとにまとめて掛ける。\n * この file は木の図を描く部品だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport type { TreePlaced } from \"../../kinds/tree/layout\";\nimport type { Rect } from \"../../layout/scene\";\nimport { LOOK, TYPE } from \"../../look/values\";\nimport { partRadius } from \"../../render/corner\";\nimport { ALWAYS } from \"../../render/ink\";\nimport { type Ctx, r1, write } from \"../../render/parts\";\nimport { glyph } from \"../icon/draw\";\n\n/** 葉 `n` と下の札 `card` を結ぶ点線。葉が現れる時刻 `at` から出す */\nexport function leafTie(n: TreePlaced, card: Rect, at: number, ctx: Ctx): string {\n const d = `M ${r1(n.cx)} ${r1(n.y + n.h + LOOK.edge.inset)} V ${r1(card.y - LOOK.edge.inset)}`;\n return `<path class=\"dg-tree-con dg-a\" d=\"${d}\" style=\"${ctx.m.vis(at)}\"/>`;\n}\n\n/** 葉の下の名札の札。札の地と、書類の絵柄と、名札の字を左から並べる */\nexport function leafCard(c: Rect & { text: string }, ctx: Ctx): string {\n const T = LOOK.tree;\n const gx = c.x + T.card.padX + T.card.icon / 2;\n const cy = c.y + c.h / 2;\n const text = write(ctx.ink, \"dg-tree-ct\", c.x + T.card.padX + T.card.icon + T.card.gap, cy + LOOK.baseline.label, c.text, TYPE.treeCard, ALWAYS);\n return `<rect class=\"dg-tree-card\" x=\"${r1(c.x)}\" y=\"${r1(c.y)}\" width=\"${r1(c.w)}\" height=\"${c.h}\" rx=\"${partRadius(ctx.corner, T.card.radius)}\"/>${glyph(\"doc\", gx, cy, T.card.glyph, \"dg-tree-cg\")}${text}`;\n}\n","/**\n * 組んだ親の描き方 (#3233、#3348)。\n *\n * 子から親への木の線は親を書いた段で引き始め、引き終えた後も最後まで残す。\n * 木の箱は親から子への線を引き終えた時に弾んで出る。根は左に枝の絵柄を持ち、字を絵柄の右に左揃えで並べ、ほかの箱は字を真ん中に揃える。\n * 線の両端になった木の箱は、その段の間だけ縁に色を付ける。木の箱と木の線を薄くする動きと弾む動きは、木の図を描く部品 (`render/tree.ts`) が掛ける。\n * この file は木の図を描く部品だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport type { TreeLink, TreePlaced } from \"../../kinds/tree/layout\";\nimport { EASE, LOOK, TYPE } from \"../../look/values\";\nimport type { EdgeTime } from \"../../timeline\";\nimport { frameShape, partRadius } from \"../../render/corner\";\nimport { type Ctx, esc, pathOf, r1, write } from \"../../render/parts\";\nimport { glyph } from \"../icon/draw\";\n\n/** 子から親への木の線 `l`。`time` の線の時刻で引き始め、引き終えた後も最後まで残す。線の跡を重なりの数えに足す */\nexport function treeLink(l: TreeLink, time: EdgeTime, ctx: Ctx): string {\n const { m } = ctx;\n ctx.traces.push({ from: l.from, to: l.to, points: l.points, shown: [[time.start, Number.POSITIVE_INFINITY]] });\n const kf = m.kf([\n [0, { opacity: 0, \"stroke-dashoffset\": 1 }],\n [time.start, { opacity: 0, \"stroke-dashoffset\": 1 }, EASE.inOut],\n [time.start + 0.05, { opacity: 1 }],\n [time.drawn, { \"stroke-dashoffset\": 0 }],\n [m.last, { opacity: 1, \"stroke-dashoffset\": 0 }, EASE.inOut],\n [m.total, { opacity: 0, \"stroke-dashoffset\": 0 }],\n ]);\n return `<path class=\"dg-tree-l dg-a\" data-tree-link=\"${esc(l.from)}\" pathLength=\"1\" d=\"${pathOf(l.points, ctx.corner)}\" style=\"${kf}\"/>`;\n}\n\n/**\n * 木の箱 `n` の枠と根の絵柄と字。`act` は線の両端になった段の間に縁へ色を付ける動き (両端にならない箱は `undefined`)、\n * `at` は箱が現れる時刻で、字はその時刻から書く\n */\nexport function treeBox(n: TreePlaced, act: string | undefined, at: number, ctx: Ctx): string {\n const T = LOOK.tree;\n const B = LOOK.box;\n const radius = n.root ? T.root.radius : T.radius;\n const rect = (cls: string, extra = \"\"): string =>\n frameShape(ctx.corner, ` class=\"${cls}\"${extra}`, n, `<rect class=\"${cls}\" x=\"${r1(n.x)}\" y=\"${r1(n.y)}\" width=\"${r1(n.w)}\" height=\"${n.h}\" rx=\"${radius}\"${extra}/>`);\n const frame = `${act ? `<g class=\"dg-a\" style=\"${act}\">${rect(\"dg-halo\")}</g>` : \"\"}${rect(\"dg-st\", ` ${ctx.sh}`)}${act ? `<g class=\"dg-a\" style=\"${act}\">${rect(\"dg-on\")}</g>` : \"\"}`;\n const ix = n.x + T.root.iconX + B.icon / 2;\n const mark = n.root\n ? `<rect class=\"dg-ic\" x=\"${r1(ix - B.icon / 2)}\" y=\"${r1(n.cy - B.icon / 2)}\" width=\"${B.icon}\" height=\"${B.icon}\" rx=\"${partRadius(ctx.corner, B.iconRadius)}\"/>${glyph(\"tree\", ix, n.cy, B.iconScale)}`\n : \"\";\n const shown: [number, number][] = [[at, Number.POSITIVE_INFINITY]];\n const texts = n.lines\n .map((line, k) => {\n const style = n.styles[k] ?? TYPE.boxName;\n const cls =\n style === TYPE.treeHash\n ? \"dg-tree-hash\"\n : style === TYPE.treeName\n ? \"dg-tree-name\"\n : style === TYPE.rootHash\n ? \"dg-tree-rh\"\n : style === TYPE.rootName\n ? \"dg-tree-rn\"\n : \"dg-tree-one\";\n const baseline = n.baselines[k] ?? n.cy;\n return n.root ? write(ctx.ink, cls, n.x + T.root.textX, baseline, line, style, shown) : write(ctx.ink, cls, n.cx, baseline, line, style, shown, \"middle\");\n })\n .join(\"\");\n return `${frame}${mark}${texts}`;\n}\n","/**\n * 木の図 (#3233) を描く部品。見た目の元は step 2 で本人が選んだ「根を上」の試作 (`.context/propose/merkle-look/`)。\n *\n * 木の箱は書いた段で、親から子への木の線を引き終えた時に弾んで出る。木の線は親を書いた段で引き、最後まで残す。\n * 値を持つ葉の下の名札の札は、葉より前の最初の段から出しておき、葉が出た時に葉と札を点線で結ぶ。\n * 木の線を走る運ぶ物は着いた所で消え、通った木の線を運ぶ物の色で最後まで残す (`data-tree-trail`)。\n * 木の線を運ぶ物が初めて通った段から後は、それまでに運ぶ物を送るか受けた木の箱だけを濃く出し、ほかの木の箱と札と木の線を薄く出す。\n * 線の両端になった木の箱は、その段の間だけ縁に色を付ける。\n * 木の箱が現れる時刻 (`appear`) を返し、木の線を走らない線の点線はその時刻から出す (#3240)。\n */\nimport { cs } from \"../blocks/color/draw\";\nimport { leafCard, leafTie } from \"../blocks/leaf/draw\";\nimport { treeBox, treeLink } from \"../blocks/node/draw\";\nimport type { TreeLayout } from \"../kinds/tree/layout\";\nimport { EASE, LOOK, MOTION } from \"../look/values\";\nimport type { DiagramModel } from \"../schema\";\nimport type { EdgeTime, Timeline } from \"../timeline\";\nimport type { Frame } from \"./motion\";\nimport { activeKf, arrowHead, type Ctx, esc, pathOf } from \"./parts\";\n\nexport function drawTree(\n layout: TreeLayout,\n diagram: DiagramModel,\n timeline: Timeline,\n ctx: Ctx,\n): { links: string; trails: string; nodes: string; appear: Map<string, number> } {\n const { m } = ctx;\n const T = LOOK.tree;\n const timeOf = (step: number, event: number): EdgeTime | undefined =>\n timeline.edges.find((t) => t.step === step && t.event === event);\n\n // 木の箱ごとの、線の両端になる段と、運ぶ物を初めて送るか受けた段\n const active = new Map<string, Set<number>>();\n const touched = new Map<string, number>();\n diagram.steps.forEach((step, s) => {\n for (const e of step.events) {\n if (e.type !== \"edge\") continue;\n for (const id of [e.from, e.to]) {\n active.set(id, (active.get(id) ?? new Set()).add(s));\n if (e.carry.kind !== \"none\" && !touched.has(id)) touched.set(id, s);\n }\n }\n });\n const carries = (step: number, event: number): boolean => {\n const e = diagram.steps[step]?.events[event];\n return e?.type === \"edge\" && e.carry.kind !== \"none\";\n };\n const fadeStep = layout.runs\n .filter((run) => carries(run.step, run.event))\n .reduce<number | undefined>(\n (s, run) => (s === undefined ? run.step : Math.min(s, run.step)),\n undefined,\n );\n const fadeAt = fadeStep === undefined ? undefined : timeline.steps[fadeStep]?.start;\n\n /** 木の箱 `id` の薄くなる動き。薄くしない箱は `undefined` */\n const fadeOf = (id: string): string | undefined => {\n if (fadeStep === undefined || fadeAt === undefined) return undefined;\n const t = touched.get(id);\n if (t !== undefined && t <= fadeStep) return undefined;\n const back = t === undefined ? undefined : timeline.steps[t]?.start;\n const frames: Frame[] = [\n [0, { opacity: 1 }],\n [fadeAt, { opacity: 1 }, EASE.inOut],\n [fadeAt + MOTION.fade, { opacity: T.faint }],\n ];\n if (back !== undefined)\n frames.push([back, { opacity: T.faint }, EASE.inOut], [back + MOTION.fade, { opacity: 1 }]);\n frames.push(\n [m.last, { opacity: back === undefined ? T.faint : 1 }, EASE.inOut],\n [m.total, { opacity: 1 }],\n );\n return m.kf(frames);\n };\n const faded = (id: string, markup: string, attrs = \"\"): string => {\n const fade = fadeOf(id);\n return fade\n ? `<g class=\"dg-a\"${attrs} style=\"${fade}\">${markup}</g>`\n : attrs === \"\"\n ? markup\n : `<g${attrs}>${markup}</g>`;\n };\n\n const drawnAt = new Map(layout.nodes.map((n) => [n.id, timeOf(n.step, n.event)?.drawn ?? 0]));\n\n // 木の線と、葉と札を結ぶ点線。木の線は組んだ親のブロックが、点線は葉のブロックが描く (#3348)\n const links = layout.links\n .map((l) => {\n const time = timeOf(l.step, l.event);\n return time ? faded(l.from, treeLink(l, time, ctx)) : \"\";\n })\n .join(\"\");\n const ties = layout.nodes.flatMap((n) => (n.card ? [faded(n.id, leafTie(n, n.card, drawnAt.get(n.id) ?? 0, ctx))] : [])).join(\"\");\n\n // 木の線を運ぶ物が通った跡。運ぶ物が走るのに合わせて引き、最後まで残す。同じ木の線は最初に通った段の跡だけを描く\n const traced = new Set<string>();\n const trails = layout.runs\n .flatMap((run) => {\n const e = layout.edges.find((x) => x.step === run.step && x.event === run.event);\n if (!e || traced.has(run.link)) return [];\n const carried = timeline.carriers.find((c) => c.step === run.step && c.event === run.event);\n const time = timeOf(run.step, run.event);\n const a = carried?.depart ?? time?.start;\n const b = carried?.arrive ?? time?.drawn;\n if (a === undefined || b === undefined) return [];\n traced.add(run.link);\n const kf = m.kf([\n [0, { opacity: 0, \"stroke-dashoffset\": 1 }],\n [a, { opacity: 0, \"stroke-dashoffset\": 1 }, EASE.inOut],\n [a + 0.05, { opacity: 1 }],\n [b, { \"stroke-dashoffset\": 0 }],\n [m.last, { opacity: 1, \"stroke-dashoffset\": 0 }, EASE.inOut],\n [m.total, { opacity: 0, \"stroke-dashoffset\": 0 }],\n ]);\n const d = pathOf(e.points, ctx.corner);\n return [\n `<g style=\"${cs(e.color)}\"><path class=\"dg-tree-tr dg-a\" data-tree-trail=\"${esc(run.link)}\" pathLength=\"1\" d=\"${d}\" style=\"${kf}\"/><path class=\"dg-tree-h dg-a\" d=\"${arrowHead(e.points)}\" style=\"${m.vis(b)}\"/></g>`,\n ];\n })\n .join(\"\");\n\n // 葉の下の名札の札。最初の段から出しておく。札は葉のブロックが描く (#3348)\n const cards = layout.nodes.flatMap((n) => (n.card ? [faded(n.id, leafCard(n.card, ctx), ` data-tree-card=\"${esc(n.id)}\"`)] : [])).join(\"\");\n\n // 木の箱。親から子への線を引き終えた時に弾んで出る。箱は組んだ親のブロックが描く (#3348)\n const nodes = layout.nodes\n .map((n) => {\n const at = drawnAt.get(n.id) ?? 0;\n const on = [...(active.get(n.id) ?? [])].sort((x, y) => x - y);\n const act = on.length > 0 ? activeKf(ctx, on) : undefined;\n const inner = faded(n.id, treeBox(n, act, at, ctx), ` data-tree-node=\"${esc(n.id)}\"${n.root ? ` data-tree-root=\"${esc(n.id)}\"` : \"\"}`);\n return `<g class=\"dg-popc dg-a\" style=\"${cs(n.color)};${m.pop(at)}\">${inner}</g>`;\n })\n .join(\"\");\n\n return { links: links + ties, trails, nodes: cards + nodes, appear: drawnAt };\n}\n","/**\n * 木の図の置き場所 (#3233)。見た目の元は step 2 で本人が選んだ「根を上」の試作 (`.context/propose/merkle-look/`)。\n *\n * 葉 (`leaf`) と親 (`node`) の出来事を書いた順に辿り、親を持たない最後の箱を根にする。根を上に置き、根からの深さごとに段を下げて並べる。\n * 子を持たない箱 (葉) は書いた順に左から同じ間で並べ、親は最初の子と最後の子の真ん中の上に置く。\n * 子から親への木の線は、子の上端から縦に出て、子の段と親の段の間の高さで横に渡り、親の下端へ縦に入る。\n * 値を持つ葉は箱に値だけを出し、名札を葉の下の札に出す。値を持つ親は値を大きく、名札を小さく出す。値を持たない箱は名札だけを出す。\n * 根の箱は左に枝の絵柄を持ち、ほかの木の箱より大きい。\n *\n * 木でない箱 (`box`) は木の右に、根の上端の高さから縦に並べる。中身の帯は図の下に置く。\n * 親子の箱どうしの線は木の線の上を走り、ほかの線は箱の向き合う辺どうしを結ぶ。\n * 段の番号は、箱が現れる段では最初に現れた箱の左に、線を引く段では最初の線の上に置く。\n *\n * 原本の JSON が書く前の名札を子に持つ時や、もう親を持つ箱を子にする時は、その子を除いて描く。箱と同じ名札の木の箱は描かない。\n */\nimport { APART, type ColorKey, LOOK, type TextStyle, TYPE } from \"../../look/values\";\nimport type { Carry, DiagramModel, LabelSide } from \"../../schema\";\nimport { textWidth } from \"../../layout/measure\";\nimport {\n along,\n badgeBlocked,\n badgeOnPath,\n badgeRect,\n besideSameSpot,\n boxColors,\n boxWidth,\n carrierHalf,\n edgeColor,\n edgesOf,\n gapBetween,\n labelStyle,\n type Layout,\n layoutStrip,\n loopUnder,\n pathLength,\n placeLabel,\n placeSlot,\n askedSide,\n pullApart,\n lineKey,\n type Point,\n type Rect,\n type SceneBadge,\n type SceneBox,\n type SceneEdge,\n type SceneLabel,\n seatCarriers,\n shapedSize,\n slotBoxWidth,\n slotRooms,\n stripBadge,\n stripNeed,\n} from \"../../layout/scene\";\n\n/** 木の箱。`lines` は箱の中の字を上から並べた行で、`baselines` と `styles` は行ごとの基準線の高さと字の形 */\nexport interface TreePlaced extends Rect {\n id: string;\n kind: \"leaf\" | \"node\";\n /** 根からの深さ。根が 0 */\n depth: number;\n parent?: string;\n children: string[];\n /** 箱を書いた段と、段の中の出来事の番号 */\n step: number;\n event: number;\n hash?: string;\n root: boolean;\n cx: number;\n cy: number;\n color: ColorKey;\n lines: string[];\n baselines: number[];\n styles: TextStyle[];\n /** 値を持つ葉の下に置く、名札の札 */\n card?: Rect & { text: string };\n}\n\n/** 子 (`from`) から親 (`to`) への木の線。親を書いた段と出来事で現れる */\nexport interface TreeLink {\n from: string;\n to: string;\n step: number;\n event: number;\n points: Point[];\n}\n\n/** 木の線の上を走る線。`link` は走る木の線の子の名札 */\nexport interface TreeRun {\n step: number;\n event: number;\n link: string;\n}\n\nexport interface TreeLayout extends Layout {\n kind: \"tree\";\n nodes: TreePlaced[];\n links: TreeLink[];\n runs: TreeRun[];\n}\n\n\n/** 書いた順の木の箱。子は書いた後の、まだ親を持たない木の箱だけを残す */\ninterface Grown {\n id: string;\n kind: \"leaf\" | \"node\";\n children: string[];\n step: number;\n event: number;\n hash?: string;\n}\n\nfunction grow(diagram: DiagramModel): { grown: Grown[]; parents: Map<string, string> } {\n const boxes = new Set(diagram.boxes.map((b) => b.id));\n const byId = new Set<string>();\n const parents = new Map<string, string>();\n const grown: Grown[] = [];\n diagram.steps.forEach((step, s) => {\n step.events.forEach((e, k) => {\n if ((e.type !== \"leaf\" && e.type !== \"node\") || byId.has(e.id) || boxes.has(e.id)) return;\n const children = e.type === \"node\" ? [...new Set(e.children)].filter((c) => byId.has(c) && !parents.has(c)) : [];\n for (const c of children) parents.set(c, e.id);\n grown.push({ id: e.id, kind: e.type, children, step: s, event: k, ...(e.hash !== undefined ? { hash: e.hash } : {}) });\n byId.add(e.id);\n });\n });\n return { grown, parents };\n}\n\n/** 箱の中の字の行と、行ごとの字の形。根は名札を上に値を下に、ほかの箱は値を上に名札を下に置く */\nfunction linesOf(g: Grown, root: boolean): { text: string; style: TextStyle }[] {\n if (g.hash === undefined) return [{ text: g.id, style: TYPE.boxName }];\n if (root)\n return [\n { text: g.id, style: TYPE.rootName },\n { text: g.hash, style: TYPE.rootHash },\n ];\n if (g.kind === \"leaf\") return [{ text: g.hash, style: TYPE.treeHash }];\n return [\n { text: g.hash, style: TYPE.treeHash },\n { text: g.id, style: TYPE.treeName },\n ];\n}\n\n/** 箱どうしの線。縦の範囲が重なれば横に、横の範囲が重なれば縦に、どちらも重ならなければ送る側から縦に出て受ける側の高さで横に入る */\nfunction route(a: Rect, b: Rect): Point[] {\n const i = LOOK.edge.inset;\n const top = Math.max(a.y, b.y);\n const bottom = Math.min(a.y + a.h, b.y + b.h);\n if (bottom > top) {\n const y = (top + bottom) / 2;\n return b.x >= a.x + a.w\n ? [\n [a.x + a.w + i, y],\n [b.x - i, y],\n ]\n : [\n [a.x - i, y],\n [b.x + b.w + i, y],\n ];\n }\n const left = Math.max(a.x, b.x);\n const right = Math.min(a.x + a.w, b.x + b.w);\n if (right > left) {\n const x = (left + right) / 2;\n return b.y >= a.y + a.h\n ? [\n [x, a.y + a.h + i],\n [x, b.y - i],\n ]\n : [\n [x, a.y - i],\n [x, b.y + b.h + i],\n ];\n }\n const ax = a.x + a.w / 2;\n const ty = b.y + b.h / 2;\n return [\n [ax, b.y > a.y ? a.y + a.h + i : a.y - i],\n [ax, ty],\n [b.x > ax ? b.x - i : b.x + b.w + i, ty],\n ];\n}\n\nexport function layoutTree(diagram: DiagramModel): TreeLayout {\n const { margin, gap, box: B, tree: T, badge: BD } = LOOK;\n const { grown, parents } = grow(diagram);\n const tops = grown.filter((g) => !parents.has(g.id));\n const rootId = tops[tops.length - 1]?.id;\n const byId = new Map(grown.map((g) => [g.id, g]));\n\n // 根からの深さ。親を持たない箱から子へ辿る\n const depth = new Map<string, number>();\n const walk = (id: string, d: number): void => {\n depth.set(id, d);\n for (const c of byId.get(id)?.children ?? []) walk(c, d + 1);\n };\n for (const t of tops) walk(t.id, 0);\n\n const texts = new Map(grown.map((g) => [g.id, linesOf(g, g.id === rootId)]));\n const widest = (id: string): number => Math.max(0, ...(texts.get(id) ?? []).map((line) => textWidth(line.text, line.style)));\n const widthOf = (g: Grown): number =>\n g.id === rootId ? Math.max(T.root.w, T.root.textX + widest(g.id) + T.root.padR) : Math.max(T.w, widest(g.id) + T.padX * 2);\n const cardW = (g: Grown): number => Math.max(T.card.minW, T.card.padX * 2 + T.card.icon + T.card.gap + textWidth(g.id, TYPE.treeCard));\n const hasCard = (g: Grown): boolean => g.kind === \"leaf\" && g.hash !== undefined;\n\n // 子を持たない箱を書いた順に左から並べる。間は一番広い箱か札の幅に、隣の箱との間を足した長さ\n const slots = grown.filter((g) => g.children.length === 0);\n const pitch = Math.max(...grown.filter((g) => g.id !== rootId || g.children.length === 0).map((g) => Math.max(widthOf(g), hasCard(g) ? cardW(g) : 0)), T.w) + T.slotGap;\n const x0 = margin + BD.r * 2 + BD.inset;\n const xs = new Map<string, number>();\n slots.forEach((g, i) => xs.set(g.id, x0 + pitch * (i + 0.5)));\n const xOf = (id: string): number => {\n const known = xs.get(id);\n if (known !== undefined) return known;\n const kids = byId.get(id)?.children ?? [];\n const x = (xOf(kids[0] as string) + xOf(kids[kids.length - 1] as string)) / 2;\n xs.set(id, x);\n return x;\n };\n const top0 = margin + T.top;\n const yOf = (d: number): number => top0 + T.root.h / 2 + d * T.row;\n\n const colors = boxColors(diagram);\n const nodes: TreePlaced[] = grown.map((g) => {\n const root = g.id === rootId;\n const d = depth.get(g.id) ?? 0;\n const cx = xOf(g.id);\n const cy = yOf(d);\n const w = widthOf(g);\n const h = root ? T.root.h : T.h;\n const lines = texts.get(g.id) ?? [];\n const baselines =\n lines.length === 1 ? [cy + T.oneY] : root ? [cy + T.root.nameY, cy + T.root.hashY] : [cy + T.hashY, cy + T.nameY];\n const parent = parents.get(g.id);\n const color: ColorKey = root ? T.rootColor : T.color;\n colors.set(g.id, color);\n const cw = cardW(g);\n return {\n id: g.id,\n kind: g.kind,\n depth: d,\n ...(parent !== undefined ? { parent } : {}),\n children: g.children,\n step: g.step,\n event: g.event,\n ...(g.hash !== undefined ? { hash: g.hash } : {}),\n root,\n x: cx - w / 2,\n y: cy - h / 2,\n w,\n h,\n cx,\n cy,\n color,\n lines: lines.map((line) => line.text),\n baselines,\n styles: lines.map((line) => line.style),\n ...(hasCard(g) ? { card: { x: cx - cw / 2, y: cy + T.card.drop - T.card.h / 2, w: cw, h: T.card.h, text: g.id } } : {}),\n };\n });\n const placed = new Map(nodes.map((n) => [n.id, n]));\n\n // 子から親への木の線。子の段と親の段の間の高さで横に渡る\n const links: TreeLink[] = nodes.flatMap((p) =>\n p.children.flatMap((id): TreeLink[] => {\n const c = placed.get(id);\n if (!c) return [];\n const mid = (c.y + p.y + p.h) / 2;\n const points: Point[] = [\n [c.cx, c.y - LOOK.edge.inset],\n [c.cx, mid],\n [p.cx, mid],\n [p.cx, p.y + p.h + LOOK.edge.inset],\n ];\n return [{ from: c.id, to: p.id, step: p.step, event: p.event, points }];\n }),\n );\n\n // 木でない箱は、木の右に根の上端の高さから縦に並べる。根と箱の間の線に名前を書く時は、名前の分だけ根から離す\n const rooms = slotRooms(diagram);\n const treeRight = Math.max(x0, ...nodes.flatMap((n) => [n.x + n.w, ...(n.card ? [n.card.x + n.card.w] : [])]));\n const rootBox = nodes.find((n) => n.root);\n const ids = new Set(diagram.boxes.map((b) => b.id));\n const named = edgesOf(diagram).flatMap(({ edge }) => (edge.label !== undefined && (ids.has(edge.from) || ids.has(edge.to)) ? [textWidth(edge.label, labelStyle(edge.label)) + LOOK.label.padX * 2] : []));\n // 根と箱を行きと帰りで結ぶ線は離して2本引くので、2つの段の番号が運ぶ物の待つ所と着く所を避けて真ん中に並ぶ長さまで、根から離す (#3607)\n const lines = edgesOf(diagram).map(({ edge }) => edge);\n const paired = lines.flatMap((edge) => (edge.from !== edge.to && (ids.has(edge.from) || ids.has(edge.to)) && lines.some((o) => o.from === edge.to && o.to === edge.from) ? [pairReach(edge.carry)] : []));\n const rootRight = rootBox ? rootBox.x + rootBox.w : x0;\n const boxX = Math.max(treeRight + T.boxGap, rootRight + Math.max(0, ...named) + gap * 2, rootRight + Math.max(0, ...paired));\n let by = rootBox?.y ?? top0;\n const boxes: SceneBox[] = diagram.boxes.map((b) => {\n // 形を持つ箱は、中身が形の内に収まる大きさにする (#3520)\n const fit = shapedSize(diagram, b.id, Math.max(boxWidth(diagram, b.id, true), slotBoxWidth(rooms.get(b.id), b.icon !== undefined, B.padX)), true, rooms);\n const { w, h } = fit;\n const y = by;\n by += h + gap;\n const box: SceneBox = {\n id: b.id,\n name: b.name,\n ...(b.sub !== undefined ? { sub: b.sub } : {}),\n ...(b.icon !== undefined ? { icon: b.icon } : {}),\n color: colors.get(b.id) ?? \"slate\",\n x: boxX,\n y,\n ...fit,\n cx: boxX + w / 2,\n cy: y + h / 2,\n };\n placeSlot(box, rooms.get(b.id));\n return box;\n });\n const boxById = new Map(boxes.map((b) => [b.id, b]));\n\n // 線。親子の箱どうしの線は木の線の上を、向きに合わせて走る\n const runs: TreeRun[] = [];\n const edges: SceneEdge[] = diagram.steps.flatMap((step, s) =>\n step.events.flatMap((e, k): SceneEdge[] => {\n if (e.type !== \"edge\") return [];\n const a: Rect | undefined = placed.get(e.from) ?? boxById.get(e.from);\n const b: Rect | undefined = placed.get(e.to) ?? boxById.get(e.to);\n if (!a || !b) return [];\n const up = links.find((l) => l.from === e.from && l.to === e.to);\n const down = links.find((l) => l.from === e.to && l.to === e.from);\n const link = up ?? down;\n if (link) runs.push({ step: s, event: k, link: link.from });\n const points = up ? up.points : down ? [...down.points].reverse() : e.from === e.to ? loopUnder({ cx: a.x + a.w / 2, y: a.y, h: a.h }) : route(a, b);\n return [{ step: s, event: k, from: e.from, to: e.to, points, color: edgeColor(e, colors), carry: e.carry }];\n }),\n );\n seatCarriers(edges, boxById, rooms);\n // 木の線を走らない線のうち、同じ2つの箱を行きと帰りで結ぶ線は、構成図と状態遷移図と同じく離す (#3607)。木の線を走る線は木の線の上に描くので離さない\n const isRun = (e: SceneEdge): boolean =>\n runs.some((r) => r.step === e.step && r.event === e.event);\n const outward = pullApart(\n edges.filter((e) => !isRun(e)),\n askedSide(diagram),\n );\n\n const layout: TreeLayout = {\n kind: \"tree\",\n width: 0,\n height: 0,\n regions: [],\n boxes,\n lifelines: [],\n edges,\n labels: [],\n actions: [],\n badges: [],\n paths: [],\n ends: [],\n nodes,\n links,\n runs,\n };\n layout.badges = badgesOf(diagram, layout, outward);\n layout.labels = labelsOf(diagram, layout, outward);\n\n const cards = nodes.flatMap((n) => (n.card ? [n.card] : []));\n const solids: Rect[] = [...nodes, ...cards, ...boxes, ...layout.labels];\n const points = edges.flatMap((e) => e.points);\n const right = Math.max(...solids.map((r) => r.x + r.w), ...points.map(([x]) => x), x0);\n const bottom = Math.max(...solids.map((r) => r.y + r.h), ...points.map(([, y]) => y), top0);\n const width = Math.max(right + margin, stripNeed(diagram) + margin * 2);\n const strip = layoutStrip(diagram, margin, bottom + gap, width - margin * 2);\n layout.width = width;\n layout.height = (strip ? strip.y + strip.h : bottom) + margin;\n if (strip) layout.strip = strip;\n // 中身の帯だけを書き換える段の番号は帯の左上に置くので、帯を置いた後に決め直す\n layout.badges = badgesOf(diagram, layout, outward);\n return layout;\n}\n\n/**\n * 行きと帰りで離した2本の線の段の番号を、真ん中から線の出る側へ寄せる長さ (#3607)。\n * 2本は `pullApart` が `APART.line` と線の太さの分だけ離すので、真ん中に並べた2つの番号は、崩れの確かめが近すぎると数える間 (`APART.badge`) より近い。\n * 2つを反対の向きにこの長さずつ寄せると、番号の縁どうしが `APART.badge` より離れる\n */\nconst PAIR_LEAD = Math.sqrt(Math.max(0, (LOOK.badge.r * 2 + APART.badge + 0.5) ** 2 - (APART.line + LOOK.stroke.edgeOn) ** 2)) / 2;\n\n/**\n * 段の番号。箱が現れる段は最初に現れた木の箱の左に置き、左が埋まっていれば左上の角、右、右上の角の順に空きを探す。\n * 線を引く段は最初の線の上に置く。木の線を走る線は、子の側の曲がり角から横の線に沿って `LOOK.tree.badgeAlong` 進めた所に、ほかの線は真ん中に置き、\n * 運ぶ物が出発を待つ所と着いた所を空ける。同じ 2 つの箱を結ぶ線を前の段が通っていれば、前の段の番号と同じ所に置いて数字を入れ替える (#3184)。\n * どちらも無い段は、書き換える箱の左上の角か、帯の左上の角の丸みの中に置き、それも無ければ前の段の番号の所に置く。\n * 線の番号のほかで前の段の番号と同じ所に来た番号は、前の番号の脇に並べる (#3525)。\n * 行きと帰りで離した線 (`outward` が持つ線) は、真ん中から線の出る側へ `PAIR_LEAD` 寄せた所から探す。2本の真ん中は番号どうしが近すぎるので、\n * 2つの番号が真ん中の空きを分け合い、運ぶ物が待つ所と着いた所に押し出されない (#3607)\n */\nfunction badgesOf(diagram: DiagramModel, layout: TreeLayout, outward: Map<SceneEdge, LabelSide>): SceneBadge[] {\n const { r, inset } = LOOK.badge;\n const apart = r * 2 + inset;\n const taken: Point[] = [];\n const out: SceneBadge[] = [];\n const solids: Rect[] = [...layout.nodes, ...layout.nodes.flatMap((n) => (n.card ? [n.card] : [])), ...layout.boxes];\n const free = (p: Point): boolean =>\n taken.every(([x, y]) => Math.hypot(p[0] - x, p[1] - y) >= apart) && solids.every((s) => gapBetween(badgeRect(p), s) >= LOOK.label.touch);\n const put = (s: number, p: Point, color: ColorKey): void => {\n taken.push(p);\n out.push({ step: s, x: p[0], y: p[1], color });\n };\n const passed = new Map<string, Point>();\n const lineOf = new Map<number, string>();\n diagram.steps.forEach((step, s) => {\n const k = step.events.findIndex((e) => e.type === \"leaf\" || e.type === \"node\" || e.type === \"edge\");\n const first = step.events[k];\n const n = layout.nodes.find((x) => x.step === s && x.event === k);\n if (first && first.type !== \"edge\" && n) {\n const spots: Point[] = [\n [n.x - inset - r, n.cy],\n [n.x, n.y],\n [n.x + n.w + inset + r, n.cy],\n [n.x + n.w, n.y],\n ];\n put(s, spots.find(free) ?? (spots[0] as Point), n.color);\n return;\n }\n const e = layout.edges.find((x) => x.step === s && x.event === k);\n if (first?.type === \"edge\" && e) {\n const run = layout.runs.some((x) => x.step === s && x.event === k);\n // 木の線を走る線は行きも帰りも同じ木の線の上を走るので 2 つの箱の組で、離した行きと帰りの線は引いた線の形で同じ線とみなす\n const key = run ? [e.from, e.to].sort().join(\"\\n\") : lineKey(e);\n const lines = layout.edges.filter((x) => x !== e).map((x) => x.points);\n const point = passed.get(key) ?? (run ? onLink(e.points, free) : midway(e, free, outward.has(e) ? PAIR_LEAD : 0)) ?? badgeOnPath(e.points, taken, lines);\n passed.set(key, point);\n lineOf.set(s, key);\n put(s, point, e.color);\n return;\n }\n const box = step.events.flatMap((ev) => (ev.type === \"swap\" || ev.type === \"action\" ? [ev.box] : [])).flatMap((id) => layout.boxes.filter((b) => b.id === id))[0];\n if (box) {\n out.push({ step: s, x: box.x, y: box.y, color: box.color });\n return;\n }\n if (layout.strip && step.events.some((ev) => ev.type === \"strip\")) {\n const [x, y] = stripBadge(layout.strip);\n out.push({ step: s, x, y, color: \"slate\" });\n return;\n }\n const before = out[out.length - 1];\n const root = layout.nodes.find((x) => x.root);\n out.push(before ? { ...before, step: s } : { step: s, x: root?.x ?? LOOK.margin, y: root?.y ?? LOOK.margin, color: root?.color ?? \"slate\" });\n });\n const cards: Rect[] = [...layout.nodes, ...layout.nodes.flatMap((n) => (n.card ? [n.card] : []))];\n return besideSameSpot(out, badgeBlocked(layout, cards), (before, after) => lineOf.has(before.step) && lineOf.get(before.step) === lineOf.get(after.step));\n}\n\n/** 木の線の上の段の番号の点。最初の曲がり角から横の線に沿って進め、横の線が短い時は縦の線の真ん中の脇に置く */\nfunction onLink(points: Point[], free: (p: Point) => boolean): Point | undefined {\n const [p0, p1, p2] = points as [Point, Point, Point];\n const flat = Math.abs(p2[0] - p1[0]);\n const { r, inset } = LOOK.badge;\n if (flat >= LOOK.tree.badgeAlong + r) {\n const p = along(points, pathLength([p0, p1]) + LOOK.tree.badgeAlong);\n if (free(p)) return p;\n }\n const side: Point = [p1[0] + r + inset, p1[1]];\n return free(side) ? side : undefined;\n}\n\n/**\n * 根と箱を行きと帰りで結ぶ2本の線を引くのに要る、根の右の縁から箱の左の縁までの長さ (#3607)。\n * 線は両端を `LOOK.edge.inset` 空け、`midway` は運ぶ物の待つ所と着く所を空けた真ん中に、2つの番号を `PAIR_LEAD` ずつ反対の向きへ寄せて並べる\n */\nfunction pairReach(carry: Carry): number {\n const room = carrierHalf(carry)[0] + LOOK.badge.r + LOOK.badge.inset;\n return 2 * (LOOK.edge.inset + room + PAIR_LEAD) + 1;\n}\n\n/** 木の線でない線の段の番号の点。運ぶ物が待つ線の両端を空け、真ん中から外へ空きを探す。線が短くて空かない時は返さない */\nfunction midway(e: SceneEdge, free: (p: Point) => boolean, lead: number): Point | undefined {\n const length = pathLength(e.points);\n const room = carrierHalf(e.carry)[0] + LOOK.badge.r + LOOK.badge.inset;\n // 探し始める所は、真ん中から線の出る側へ `lead` 寄せた所。両端の `room` の内に収める\n const start = Math.min(Math.max(length / 2 - lead, room), length - room);\n for (let d = 0; d <= length - 2 * room; d += 1) {\n for (const at of [start - d, start + d]) {\n if (at < room || at > length - room) continue;\n const p = along(e.points, at);\n if (free(p)) return p;\n }\n }\n return undefined;\n}\n\n/** 線の名前。箱と木の箱から離し、葉の下の札と同じ段の名前に重ねず、同じ時刻に見える段の番号に食い込ませない */\nfunction labelsOf(\n diagram: DiagramModel,\n layout: TreeLayout,\n outward: Map<SceneEdge, LabelSide>,\n): SceneLabel[] {\n const labels: SceneLabel[] = [];\n const cards = layout.nodes.flatMap((n) => (n.card ? [n.card] : []));\n for (const e of layout.edges) {\n const source = diagram.steps[e.step]?.events[e.event];\n if (source?.type !== \"edge\" || source.label === undefined) continue;\n const seen = layout.badges.filter((b) => b.step <= e.step).map((b) => badgeRect([b.x, b.y]));\n // 行きと帰りで離した線の名前はずらした側に置き、反対の側 (組の相手の線の側) は探さない (#3607)\n const side = source.labelSide ?? outward.get(e);\n labels.push(\n placeLabel(\n { step: e.step, event: e.event, text: source.label, points: e.points, color: e.color, ...(side ? { side } : {}), ...(outward.has(e) ? {} : { flip: true }) },\n { hard: [...layout.nodes, ...layout.boxes], soft: [...cards, ...labels.filter((l) => l.step === e.step)], touch: seen },\n ),\n );\n }\n return labels;\n}\n","/** 木の図の描く部品の組 (#3248、#3656)。並べ方は図の種類の置き場 (`kinds/tree/layout.ts`、#3348)、木の線と通った跡と木の箱と札の描き方は `render/tree.ts` が持つ (#3233) */\nimport type { Rect } from \"../layout/scene\";\nimport { MOTION } from \"../look/values\";\nimport { drawTree } from \"../render/tree\";\nimport type { KindParts } from \"./parts\";\nimport { layoutTree, type TreeLayout } from \"./tree/layout\";\n\nexport const parts: KindParts<TreeLayout> = {\n layout: layoutTree,\n // 運ぶ物は着いた所で消える。通った跡が行き先を残し、兄弟の箱から同じ親へ着いた運ぶ物が重ならないため\n carried: (timeline) => timeline.carriers.map((time) => ({ ...time, start: time.depart, end: time.arrive + MOTION.fade })),\n draw: (layout, diagram, ctx) => {\n const tree = drawTree(layout, diagram, ctx.t, ctx);\n // 木の線を走る線は通った跡が見せるので、ほかの線と同じ線で描かない。\n // 木の箱は段ごとに現れるので、木の線を走らない線の点線は、両端の木の箱が現れてから出す (#3240)\n const runs = new Set(layout.runs.map((r) => `${r.step}/${r.event}`));\n return {\n base: tree.links,\n lit: tree.trails,\n node: tree.nodes,\n edge: (e) => (runs.has(`${e.step}/${e.event}`) ? undefined : Math.max(tree.appear.get(e.from) ?? 0, tree.appear.get(e.to) ?? 0)),\n };\n },\n // その段で現れる木の箱と木の線と、線の両端の木の箱を見る\n focus: (layout, diagram, step) => {\n const ends = new Set((diagram.steps[step]?.events ?? []).flatMap((e) => (e.type === \"edge\" ? [e.from, e.to] : [])));\n const links = layout.links.filter((l) => l.step === step).map((l): Rect => {\n const xs = l.points.map((p) => p[0]);\n const ys = l.points.map((p) => p[1]);\n return { x: Math.min(...xs), y: Math.min(...ys), w: Math.max(...xs) - Math.min(...xs), h: Math.max(...ys) - Math.min(...ys) };\n });\n return [...layout.nodes.filter((n) => n.step === step || ends.has(n.id)), ...links];\n },\n overview: (layout) => layout.nodes.map((node) => ({ rect: node, band: false, color: node.color })),\n};\n"]}
1
+ {"version":3,"sources":["/Users/cardene/Desktop/projects/dragon-3715-release-0-76-0/packages/dragon/dist/light/tree-GGBX3XAZ.cjs","../../src/blocks/leaf/draw.ts","../../src/blocks/node/draw.ts","../../src/render/tree.ts","../../src/kinds/tree/layout.ts","../../src/kinds/tree.ts"],"names":[],"mappings":"AAAA;AACE;AACA;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B;AACE;AACF,wDAA6B;AAC7B;AACE;AACA;AACA;AACA;AACA;AACF,wDAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B,gCAA6B;AAC7B;AACA;AC7CO,SAAS,OAAA,CAAQ,CAAA,EAAe,IAAA,EAAY,EAAA,EAAY,GAAA,EAAkB;AAC/E,EAAA,MAAM,EAAA,EAAI,CAAA,EAAA,EAAK,kCAAA,CAAG,CAAE,EAAE,CAAC,CAAA,CAAA,EAAI,kCAAA,CAAG,CAAE,EAAA,EAAI,CAAA,CAAE,EAAA,EAAI,sBAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA,GAAA,EAAM,kCAAA,IAAG,CAAK,EAAA,EAAI,sBAAA,CAAK,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA;AACtB,EAAA;AACxE;AAGuE;AACtD,EAAA;AAC8B,EAAA;AACtB,EAAA;AACsE,EAAA;AACZ,EAAA;AACnF;AD6C+F;AACA;AE1DvB;AACxD,EAAA;AAC0E,EAAA;AACxE,EAAA;AAC4B,IAAA;AACqB,IAAA;AAC7B,IAAA;AACK,IAAA;AACoB,IAAA;AACX,IAAA;AACjD,EAAA;AACwF,EAAA;AAC3F;AAM8F;AAC7E,EAAA;AACA,EAAA;AAC2B,EAAA;AAEa,EAAA;AACoC,EAAA;AAClD,EAAA;AAE4B,EAAA;AAEJ,EAAA;AAE7C,EAAA;AACkB,IAAA;AAK1B,IAAA;AAM6B,IAAA;AACmD,IAAA;AAElF,EAAA;AACoB,EAAA;AAChC;AFyC+F;AACA;AGjFd;AACjE,EAAA;AACC,EAAA;AAE6C,EAAA;AAGhB,EAAA;AACJ,EAAA;AACL,EAAA;AACJ,IAAA;AACJ,MAAA;AACU,MAAA;AACoB,QAAA;AACe,QAAA;AACpE,MAAA;AACF,IAAA;AACD,EAAA;AACyD,EAAA;AACb,IAAA;AACG,IAAA;AAChD,EAAA;AAGG,EAAA;AAC+D,IAAA;AAC9D,IAAA;AACF,EAAA;AAC4E,EAAA;AAG3B,EAAA;AACU,IAAA;AACnC,IAAA;AACqB,IAAA;AACiB,IAAA;AACtC,IAAA;AACJ,MAAA;AACiB,MAAA;AACQ,MAAA;AAC7C,IAAA;AACa,IAAA;AAC8E,MAAA;AACpF,IAAA;AAC6D,MAAA;AAC1C,MAAA;AAC1B,IAAA;AACkB,IAAA;AACpB,EAAA;AACkE,EAAA;AAC1C,IAAA;AAIhB,IAAA;AAER,EAAA;AAE4F,EAAA;AAI9E,EAAA;AACyB,IAAA;AACmB,IAAA;AAEhD,EAAA;AACiF,EAAA;AAG5D,EAAA;AAEX,EAAA;AAC+D,IAAA;AACvC,IAAA;AACkD,IAAA;AACnD,IAAA;AACJ,IAAA;AACA,IAAA;AACa,IAAA;AAC7B,IAAA;AACH,IAAA;AAC4B,MAAA;AACY,MAAA;AAC7B,MAAA;AACK,MAAA;AAC6B,MAAA;AACX,MAAA;AACjD,IAAA;AACoC,IAAA;AAC9B,IAAA;AACoF,MAAA;AAC3F,IAAA;AAEM,EAAA;AAG8E,EAAA;AAI1E,EAAA;AACsB,IAAA;AAC6B,IAAA;AACb,IAAA;AACuC,IAAA;AACZ,IAAA;AAErE,EAAA;AAEkE,EAAA;AAC9E;AHwD+F;AACA;AIlFR;AACjC,EAAA;AACvB,EAAA;AACW,EAAA;AAChB,EAAA;AACW,EAAA;AACH,IAAA;AACuD,MAAA;AACG,MAAA;AACzC,MAAA;AACgD,MAAA;AAChF,MAAA;AACd,IAAA;AACF,EAAA;AACuB,EAAA;AAC1B;AAGgF;AACT,EAAA;AACjE,EAAA;AACK,IAAA;AAC8B,MAAA;AACE,MAAA;AACvC,IAAA;AACmE,EAAA;AAC9D,EAAA;AACgC,IAAA;AACF,IAAA;AACrC,EAAA;AACF;AAG0C;AACpB,EAAA;AACS,EAAA;AACe,EAAA;AAC1B,EAAA;AACW,IAAA;AAEvB,IAAA;AACmB,MAAA;AACN,MAAA;AAEb,IAAA;AACa,MAAA;AACM,MAAA;AACnB,IAAA;AACN,EAAA;AAC8B,EAAA;AACa,EAAA;AACzB,EAAA;AACW,IAAA;AAEvB,IAAA;AACmB,MAAA;AACN,MAAA;AAEb,IAAA;AACa,MAAA;AACM,MAAA;AACnB,IAAA;AACN,EAAA;AACuB,EAAA;AACA,EAAA;AAChB,EAAA;AACmC,IAAA;AACjC,IAAA;AACgC,IAAA;AACzC,EAAA;AACF;AAE8D;AACR,EAAA;AACb,EAAA;AACY,EAAA;AACb,EAAA;AACU,EAAA;AAGV,EAAA;AACQ,EAAA;AAC7B,IAAA;AAC4C,IAAA;AAC7D,EAAA;AACkC,EAAA;AAEyC,EAAA;AAC8B,EAAA;AAElC,EAAA;AACgC,EAAA;AAChC,EAAA;AAGd,EAAA;AACiC,EAAA;AACxD,EAAA;AACC,EAAA;AACyB,EAAA;AACxB,EAAA;AACX,IAAA;AACS,IAAA;AACQ,IAAA;AACoC,IAAA;AAChE,IAAA;AACL,IAAA;AACT,EAAA;AACwB,EAAA;AACuC,EAAA;AAE/B,EAAA;AACa,EAAA;AACrB,IAAA;AACO,IAAA;AACV,IAAA;AACH,IAAA;AACG,IAAA;AACW,IAAA;AACI,IAAA;AAEuC,IAAA;AAC1C,IAAA;AACgB,IAAA;AACzB,IAAA;AACJ,IAAA;AACX,IAAA;AACC,MAAA;AACE,MAAA;AACD,MAAA;AACkC,MAAA;AAC7B,MAAA;AACJ,MAAA;AACC,MAAA;AACsC,MAAA;AAC/C,MAAA;AACY,MAAA;AACA,MAAA;AACZ,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACA,MAAA;AACoC,MAAA;AACpC,MAAA;AACsC,MAAA;AACmD,MAAA;AAC3F,IAAA;AACD,EAAA;AACiD,EAAA;AAGlB,EAAA;AACS,IAAA;AACd,MAAA;AACP,MAAA;AACgB,MAAA;AACR,MAAA;AACM,QAAA;AAClB,QAAA;AACA,QAAA;AACwB,QAAA;AACpC,MAAA;AACsE,MAAA;AACvE,IAAA;AACH,EAAA;AAG+B,EAAA;AAC+D,EAAA;AACtD,EAAA;AACU,EAAA;AAC8C,EAAA;AAE3C,EAAA;AACuC,EAAA;AACxC,EAAA;AACqC,EAAA;AAClE,EAAA;AAC4B,EAAA;AAE0C,IAAA;AAC1E,IAAA;AACP,IAAA;AACA,IAAA;AACY,IAAA;AACd,MAAA;AACE,MAAA;AACoC,MAAA;AACG,MAAA;AACpB,MAAA;AACxB,MAAA;AACH,MAAA;AACG,MAAA;AACY,MAAA;AACH,MAAA;AACd,IAAA;AAC8B,IAAA;AACvB,IAAA;AACR,EAAA;AACkD,EAAA;AAG1B,EAAA;AACgB,EAAA;AACI,IAAA;AACV,MAAA;AACqC,MAAA;AACJ,MAAA;AAC1C,MAAA;AACyC,MAAA;AACE,MAAA;AAC9C,MAAA;AACuC,MAAA;AAC4B,MAAA;AACR,MAAA;AAC/E,IAAA;AACH,EAAA;AACkC,EAAA;AAGyB,EAAA;AAC3C,EAAA;AACe,IAAA;AACZ,IAAA;AACnB,EAAA;AAE2B,EAAA;AACnB,IAAA;AACC,IAAA;AACC,IAAA;AACE,IAAA;AACV,IAAA;AACY,IAAA;AACZ,IAAA;AACS,IAAA;AACC,IAAA;AACD,IAAA;AACD,IAAA;AACD,IAAA;AACP,IAAA;AACA,IAAA;AACA,IAAA;AACF,EAAA;AACiD,EAAA;AACA,EAAA;AAEU,EAAA;AACW,EAAA;AAC1B,EAAA;AACyC,EAAA;AACK,EAAA;AACpB,EAAA;AACK,EAAA;AAC5D,EAAA;AACwC,EAAA;AAC7B,EAAA;AAEuB,EAAA;AAC1C,EAAA;AACT;AAO6F;AAWkB;AACnF,EAAA;AACJ,EAAA;AACE,EAAA;AACG,EAAA;AAC2E,EAAA;AAEhC,EAAA;AACV,EAAA;AAC9C,IAAA;AACiC,IAAA;AAC/C,EAAA;AACsC,EAAA;AACC,EAAA;AACJ,EAAA;AACkD,IAAA;AACxD,IAAA;AACqC,IAAA;AACvB,IAAA;AAChB,MAAA;AACC,QAAA;AACb,QAAA;AACmB,QAAA;AACb,QAAA;AACjB,MAAA;AACuD,MAAA;AACvD,MAAA;AACF,IAAA;AACgE,IAAA;AAC/B,IAAA;AACkC,MAAA;AAEH,MAAA;AACO,MAAA;AACoB,MAAA;AACpE,MAAA;AACJ,MAAA;AACI,MAAA;AACrB,MAAA;AACF,IAAA;AAC0F,IAAA;AACjF,IAAA;AACmD,MAAA;AAC1D,MAAA;AACF,IAAA;AACmE,IAAA;AAC3B,MAAA;AACI,MAAA;AAC1C,MAAA;AACF,IAAA;AACiC,IAAA;AACW,IAAA;AAC8C,IAAA;AAC3F,EAAA;AAC+F,EAAA;AACH,EAAA;AAC/F;AAGiF;AAC1D,EAAA;AACc,EAAA;AACT,EAAA;AACY,EAAA;AAC+B,IAAA;AAC/C,IAAA;AACtB,EAAA;AAC6C,EAAA;AAClB,EAAA;AAC7B;AAMyC;AACwB,EAAA;AACb,EAAA;AACpD;AAG4F;AACxD,EAAA;AAC+B,EAAA;AAEM,EAAA;AACvB,EAAA;AACL,IAAA;AACF,MAAA;AACT,MAAA;AACR,MAAA;AACtB,IAAA;AACF,EAAA;AACO,EAAA;AACT;AAOgB;AACgB,EAAA;AACoC,EAAA;AACpC,EAAA;AACwB,IAAA;AACO,IAAA;AACgC,IAAA;AAE7C,IAAA;AACvC,IAAA;AACL,MAAA;AACwF,QAAA;AACC,QAAA;AACzF,MAAA;AACF,IAAA;AACF,EAAA;AACO,EAAA;AACT;AJmB+F;AACA;AKxgBnD;AAClC,EAAA;AAAA;AAEoF,EAAA;AAC5D,EAAA;AACmB,IAAA;AAGkB,IAAA;AAC5D,IAAA;AACM,MAAA;AACD,MAAA;AACC,MAAA;AACiF,MAAA;AAC9F,IAAA;AACF,EAAA;AAAA;AAEkC,EAAA;AACoD,IAAA;AACT,IAAA;AACtC,MAAA;AACA,MAAA;AACoD,MAAA;AACxF,IAAA;AACiF,IAAA;AACpF,EAAA;AACyF,EAAA;AAC3F;ALwgB+F;AACA;AACA","file":"/Users/cardene/Desktop/projects/dragon-3715-release-0-76-0/packages/dragon/dist/light/tree-GGBX3XAZ.cjs","sourcesContent":[null,"/**\n * 葉の描き方 (#3233、#3348)。\n *\n * 値を持つ葉の下に名札の札を置き、葉より前の最初の段から出しておく。葉が出た時に、葉と札を点線で結ぶ。\n * 札と点線を薄くする動きは、木の図を描く部品 (`render/tree.ts`) が箱ごとにまとめて掛ける。\n * この file は木の図を描く部品だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport type { TreePlaced } from \"../../kinds/tree/layout\";\nimport type { Rect } from \"../../layout/scene\";\nimport { LOOK, TYPE } from \"../../look/values\";\nimport { partRadius } from \"../../render/corner\";\nimport { ALWAYS } from \"../../render/ink\";\nimport { type Ctx, r1, write } from \"../../render/parts\";\nimport { glyph } from \"../icon/draw\";\n\n/** 葉 `n` と下の札 `card` を結ぶ点線。葉が現れる時刻 `at` から出す */\nexport function leafTie(n: TreePlaced, card: Rect, at: number, ctx: Ctx): string {\n const d = `M ${r1(n.cx)} ${r1(n.y + n.h + LOOK.edge.inset)} V ${r1(card.y - LOOK.edge.inset)}`;\n return `<path class=\"dg-tree-con dg-a\" d=\"${d}\" style=\"${ctx.m.vis(at)}\"/>`;\n}\n\n/** 葉の下の名札の札。札の地と、書類の絵柄と、名札の字を左から並べる */\nexport function leafCard(c: Rect & { text: string }, ctx: Ctx): string {\n const T = LOOK.tree;\n const gx = c.x + T.card.padX + T.card.icon / 2;\n const cy = c.y + c.h / 2;\n const text = write(ctx.ink, \"dg-tree-ct\", c.x + T.card.padX + T.card.icon + T.card.gap, cy + LOOK.baseline.label, c.text, TYPE.treeCard, ALWAYS);\n return `<rect class=\"dg-tree-card\" x=\"${r1(c.x)}\" y=\"${r1(c.y)}\" width=\"${r1(c.w)}\" height=\"${c.h}\" rx=\"${partRadius(ctx.corner, T.card.radius)}\"/>${glyph(\"doc\", gx, cy, T.card.glyph, \"dg-tree-cg\")}${text}`;\n}\n","/**\n * 組んだ親の描き方 (#3233、#3348)。\n *\n * 子から親への木の線は親を書いた段で引き始め、引き終えた後も最後まで残す。\n * 木の箱は親から子への線を引き終えた時に弾んで出る。根は左に枝の絵柄を持ち、字を絵柄の右に左揃えで並べ、ほかの箱は字を真ん中に揃える。\n * 線の両端になった木の箱は、その段の間だけ縁に色を付ける。木の箱と木の線を薄くする動きと弾む動きは、木の図を描く部品 (`render/tree.ts`) が掛ける。\n * この file は木の図を描く部品だけが読み、見本帳を開いた時に読む塊に入れない (#3248)。\n */\nimport type { TreeLink, TreePlaced } from \"../../kinds/tree/layout\";\nimport { EASE, LOOK, TYPE } from \"../../look/values\";\nimport type { EdgeTime } from \"../../timeline\";\nimport { frameShape, partRadius } from \"../../render/corner\";\nimport { type Ctx, esc, pathOf, r1, write } from \"../../render/parts\";\nimport { glyph } from \"../icon/draw\";\n\n/** 子から親への木の線 `l`。`time` の線の時刻で引き始め、引き終えた後も最後まで残す。線の跡を重なりの数えに足す */\nexport function treeLink(l: TreeLink, time: EdgeTime, ctx: Ctx): string {\n const { m } = ctx;\n ctx.traces.push({ from: l.from, to: l.to, points: l.points, shown: [[time.start, Number.POSITIVE_INFINITY]] });\n const kf = m.kf([\n [0, { opacity: 0, \"stroke-dashoffset\": 1 }],\n [time.start, { opacity: 0, \"stroke-dashoffset\": 1 }, EASE.inOut],\n [time.start + 0.05, { opacity: 1 }],\n [time.drawn, { \"stroke-dashoffset\": 0 }],\n [m.last, { opacity: 1, \"stroke-dashoffset\": 0 }, EASE.inOut],\n [m.total, { opacity: 0, \"stroke-dashoffset\": 0 }],\n ]);\n return `<path class=\"dg-tree-l dg-a\" data-tree-link=\"${esc(l.from)}\" pathLength=\"1\" d=\"${pathOf(l.points, ctx.corner)}\" style=\"${kf}\"/>`;\n}\n\n/**\n * 木の箱 `n` の枠と根の絵柄と字。`act` は線の両端になった段の間に縁へ色を付ける動き (両端にならない箱は `undefined`)、\n * `at` は箱が現れる時刻で、字はその時刻から書く\n */\nexport function treeBox(n: TreePlaced, act: string | undefined, at: number, ctx: Ctx): string {\n const T = LOOK.tree;\n const B = LOOK.box;\n const radius = n.root ? T.root.radius : T.radius;\n const rect = (cls: string, extra = \"\"): string =>\n frameShape(ctx.corner, ` class=\"${cls}\"${extra}`, n, `<rect class=\"${cls}\" x=\"${r1(n.x)}\" y=\"${r1(n.y)}\" width=\"${r1(n.w)}\" height=\"${n.h}\" rx=\"${radius}\"${extra}/>`);\n const frame = `${act ? `<g class=\"dg-a\" style=\"${act}\">${rect(\"dg-halo\")}</g>` : \"\"}${rect(\"dg-st\", ` ${ctx.sh}`)}${act ? `<g class=\"dg-a\" style=\"${act}\">${rect(\"dg-on\")}</g>` : \"\"}`;\n const ix = n.x + T.root.iconX + B.icon / 2;\n const mark = n.root\n ? `<rect class=\"dg-ic\" x=\"${r1(ix - B.icon / 2)}\" y=\"${r1(n.cy - B.icon / 2)}\" width=\"${B.icon}\" height=\"${B.icon}\" rx=\"${partRadius(ctx.corner, B.iconRadius)}\"/>${glyph(\"tree\", ix, n.cy, B.iconScale)}`\n : \"\";\n const shown: [number, number][] = [[at, Number.POSITIVE_INFINITY]];\n const texts = n.lines\n .map((line, k) => {\n const style = n.styles[k] ?? TYPE.boxName;\n const cls =\n style === TYPE.treeHash\n ? \"dg-tree-hash\"\n : style === TYPE.treeName\n ? \"dg-tree-name\"\n : style === TYPE.rootHash\n ? \"dg-tree-rh\"\n : style === TYPE.rootName\n ? \"dg-tree-rn\"\n : \"dg-tree-one\";\n const baseline = n.baselines[k] ?? n.cy;\n return n.root ? write(ctx.ink, cls, n.x + T.root.textX, baseline, line, style, shown) : write(ctx.ink, cls, n.cx, baseline, line, style, shown, \"middle\");\n })\n .join(\"\");\n return `${frame}${mark}${texts}`;\n}\n","/**\n * 木の図 (#3233) を描く部品。見た目の元は step 2 で本人が選んだ「根を上」の試作 (`.context/propose/merkle-look/`)。\n *\n * 木の箱は書いた段で、親から子への木の線を引き終えた時に弾んで出る。木の線は親を書いた段で引き、最後まで残す。\n * 値を持つ葉の下の名札の札は、葉より前の最初の段から出しておき、葉が出た時に葉と札を点線で結ぶ。\n * 木の線を走る運ぶ物は着いた所で消え、通った木の線を運ぶ物の色で最後まで残す (`data-tree-trail`)。\n * 木の線を運ぶ物が初めて通った段から後は、それまでに運ぶ物を送るか受けた木の箱だけを濃く出し、ほかの木の箱と札と木の線を薄く出す。\n * 線の両端になった木の箱は、その段の間だけ縁に色を付ける。\n * 木の箱が現れる時刻 (`appear`) を返し、木の線を走らない線の点線はその時刻から出す (#3240)。\n */\nimport { cs } from \"../blocks/color/draw\";\nimport { leafCard, leafTie } from \"../blocks/leaf/draw\";\nimport { treeBox, treeLink } from \"../blocks/node/draw\";\nimport type { TreeLayout } from \"../kinds/tree/layout\";\nimport { EASE, LOOK, MOTION } from \"../look/values\";\nimport type { DiagramModel } from \"../schema\";\nimport type { EdgeTime, Timeline } from \"../timeline\";\nimport type { Frame } from \"./motion\";\nimport { activeKf, arrowHead, type Ctx, esc, pathOf } from \"./parts\";\n\nexport function drawTree(\n layout: TreeLayout,\n diagram: DiagramModel,\n timeline: Timeline,\n ctx: Ctx,\n): { links: string; trails: string; nodes: string; appear: Map<string, number> } {\n const { m } = ctx;\n const T = LOOK.tree;\n const timeOf = (step: number, event: number): EdgeTime | undefined =>\n timeline.edges.find((t) => t.step === step && t.event === event);\n\n // 木の箱ごとの、線の両端になる段と、運ぶ物を初めて送るか受けた段\n const active = new Map<string, Set<number>>();\n const touched = new Map<string, number>();\n diagram.steps.forEach((step, s) => {\n for (const e of step.events) {\n if (e.type !== \"edge\") continue;\n for (const id of [e.from, e.to]) {\n active.set(id, (active.get(id) ?? new Set()).add(s));\n if (e.carry.kind !== \"none\" && !touched.has(id)) touched.set(id, s);\n }\n }\n });\n const carries = (step: number, event: number): boolean => {\n const e = diagram.steps[step]?.events[event];\n return e?.type === \"edge\" && e.carry.kind !== \"none\";\n };\n const fadeStep = layout.runs\n .filter((run) => carries(run.step, run.event))\n .reduce<number | undefined>(\n (s, run) => (s === undefined ? run.step : Math.min(s, run.step)),\n undefined,\n );\n const fadeAt = fadeStep === undefined ? undefined : timeline.steps[fadeStep]?.start;\n\n /** 木の箱 `id` の薄くなる動き。薄くしない箱は `undefined` */\n const fadeOf = (id: string): string | undefined => {\n if (fadeStep === undefined || fadeAt === undefined) return undefined;\n const t = touched.get(id);\n if (t !== undefined && t <= fadeStep) return undefined;\n const back = t === undefined ? undefined : timeline.steps[t]?.start;\n const frames: Frame[] = [\n [0, { opacity: 1 }],\n [fadeAt, { opacity: 1 }, EASE.inOut],\n [fadeAt + MOTION.fade, { opacity: T.faint }],\n ];\n if (back !== undefined)\n frames.push([back, { opacity: T.faint }, EASE.inOut], [back + MOTION.fade, { opacity: 1 }]);\n frames.push(\n [m.last, { opacity: back === undefined ? T.faint : 1 }, EASE.inOut],\n [m.total, { opacity: 1 }],\n );\n return m.kf(frames);\n };\n const faded = (id: string, markup: string, attrs = \"\"): string => {\n const fade = fadeOf(id);\n return fade\n ? `<g class=\"dg-a\"${attrs} style=\"${fade}\">${markup}</g>`\n : attrs === \"\"\n ? markup\n : `<g${attrs}>${markup}</g>`;\n };\n\n const drawnAt = new Map(layout.nodes.map((n) => [n.id, timeOf(n.step, n.event)?.drawn ?? 0]));\n\n // 木の線と、葉と札を結ぶ点線。木の線は組んだ親のブロックが、点線は葉のブロックが描く (#3348)\n const links = layout.links\n .map((l) => {\n const time = timeOf(l.step, l.event);\n return time ? faded(l.from, treeLink(l, time, ctx)) : \"\";\n })\n .join(\"\");\n const ties = layout.nodes.flatMap((n) => (n.card ? [faded(n.id, leafTie(n, n.card, drawnAt.get(n.id) ?? 0, ctx))] : [])).join(\"\");\n\n // 木の線を運ぶ物が通った跡。運ぶ物が走るのに合わせて引き、最後まで残す。同じ木の線は最初に通った段の跡だけを描く\n const traced = new Set<string>();\n const trails = layout.runs\n .flatMap((run) => {\n const e = layout.edges.find((x) => x.step === run.step && x.event === run.event);\n if (!e || traced.has(run.link)) return [];\n const carried = timeline.carriers.find((c) => c.step === run.step && c.event === run.event);\n const time = timeOf(run.step, run.event);\n const a = carried?.depart ?? time?.start;\n const b = carried?.arrive ?? time?.drawn;\n if (a === undefined || b === undefined) return [];\n traced.add(run.link);\n const kf = m.kf([\n [0, { opacity: 0, \"stroke-dashoffset\": 1 }],\n [a, { opacity: 0, \"stroke-dashoffset\": 1 }, EASE.inOut],\n [a + 0.05, { opacity: 1 }],\n [b, { \"stroke-dashoffset\": 0 }],\n [m.last, { opacity: 1, \"stroke-dashoffset\": 0 }, EASE.inOut],\n [m.total, { opacity: 0, \"stroke-dashoffset\": 0 }],\n ]);\n const d = pathOf(e.points, ctx.corner);\n return [\n `<g style=\"${cs(e.color)}\"><path class=\"dg-tree-tr dg-a\" data-tree-trail=\"${esc(run.link)}\" pathLength=\"1\" d=\"${d}\" style=\"${kf}\"/><path class=\"dg-tree-h dg-a\" d=\"${arrowHead(e.points)}\" style=\"${m.vis(b)}\"/></g>`,\n ];\n })\n .join(\"\");\n\n // 葉の下の名札の札。最初の段から出しておく。札は葉のブロックが描く (#3348)\n const cards = layout.nodes.flatMap((n) => (n.card ? [faded(n.id, leafCard(n.card, ctx), ` data-tree-card=\"${esc(n.id)}\"`)] : [])).join(\"\");\n\n // 木の箱。親から子への線を引き終えた時に弾んで出る。箱は組んだ親のブロックが描く (#3348)\n const nodes = layout.nodes\n .map((n) => {\n const at = drawnAt.get(n.id) ?? 0;\n const on = [...(active.get(n.id) ?? [])].sort((x, y) => x - y);\n const act = on.length > 0 ? activeKf(ctx, on) : undefined;\n const inner = faded(n.id, treeBox(n, act, at, ctx), ` data-tree-node=\"${esc(n.id)}\"${n.root ? ` data-tree-root=\"${esc(n.id)}\"` : \"\"}`);\n return `<g class=\"dg-popc dg-a\" style=\"${cs(n.color)};${m.pop(at)}\">${inner}</g>`;\n })\n .join(\"\");\n\n return { links: links + ties, trails, nodes: cards + nodes, appear: drawnAt };\n}\n","/**\n * 木の図の置き場所 (#3233)。見た目の元は step 2 で本人が選んだ「根を上」の試作 (`.context/propose/merkle-look/`)。\n *\n * 葉 (`leaf`) と親 (`node`) の出来事を書いた順に辿り、親を持たない最後の箱を根にする。根を上に置き、根からの深さごとに段を下げて並べる。\n * 子を持たない箱 (葉) は書いた順に左から同じ間で並べ、親は最初の子と最後の子の真ん中の上に置く。\n * 子から親への木の線は、子の上端から縦に出て、子の段と親の段の間の高さで横に渡り、親の下端へ縦に入る。\n * 値を持つ葉は箱に値だけを出し、名札を葉の下の札に出す。値を持つ親は値を大きく、名札を小さく出す。値を持たない箱は名札だけを出す。\n * 根の箱は左に枝の絵柄を持ち、ほかの木の箱より大きい。\n *\n * 木でない箱 (`box`) は木の右に、根の上端の高さから縦に並べる。中身の帯は図の下に置く。\n * 親子の箱どうしの線は木の線の上を走り、ほかの線は箱の向き合う辺どうしを結ぶ。\n * 段の番号は、箱が現れる段では最初に現れた箱の左に、線を引く段では最初の線の上に置く。\n *\n * 原本の JSON が書く前の名札を子に持つ時や、もう親を持つ箱を子にする時は、その子を除いて描く。箱と同じ名札の木の箱は描かない。\n */\nimport { APART, type ColorKey, LOOK, type TextStyle, TYPE } from \"../../look/values\";\nimport type { Carry, DiagramModel, LabelSide } from \"../../schema\";\nimport { textWidth } from \"../../layout/measure\";\nimport {\n along,\n badgeBlocked,\n badgeOnPath,\n badgeRect,\n besideSameSpot,\n boxColors,\n boxWidth,\n carrierHalf,\n edgeColor,\n edgesOf,\n gapBetween,\n labelStyle,\n type Layout,\n layoutStrip,\n loopUnder,\n pathLength,\n placeLabel,\n placeSlot,\n askedSide,\n pullApart,\n lineKey,\n type Point,\n type Rect,\n type SceneBadge,\n type SceneBox,\n type SceneEdge,\n type SceneLabel,\n seatCarriers,\n shapedSize,\n slotBoxWidth,\n slotRooms,\n stripBadge,\n stripNeed,\n} from \"../../layout/scene\";\n\n/** 木の箱。`lines` は箱の中の字を上から並べた行で、`baselines` と `styles` は行ごとの基準線の高さと字の形 */\nexport interface TreePlaced extends Rect {\n id: string;\n kind: \"leaf\" | \"node\";\n /** 根からの深さ。根が 0 */\n depth: number;\n parent?: string;\n children: string[];\n /** 箱を書いた段と、段の中の出来事の番号 */\n step: number;\n event: number;\n hash?: string;\n root: boolean;\n cx: number;\n cy: number;\n color: ColorKey;\n lines: string[];\n baselines: number[];\n styles: TextStyle[];\n /** 値を持つ葉の下に置く、名札の札 */\n card?: Rect & { text: string };\n}\n\n/** 子 (`from`) から親 (`to`) への木の線。親を書いた段と出来事で現れる */\nexport interface TreeLink {\n from: string;\n to: string;\n step: number;\n event: number;\n points: Point[];\n}\n\n/** 木の線の上を走る線。`link` は走る木の線の子の名札 */\nexport interface TreeRun {\n step: number;\n event: number;\n link: string;\n}\n\nexport interface TreeLayout extends Layout {\n kind: \"tree\";\n nodes: TreePlaced[];\n links: TreeLink[];\n runs: TreeRun[];\n}\n\n\n/** 書いた順の木の箱。子は書いた後の、まだ親を持たない木の箱だけを残す */\ninterface Grown {\n id: string;\n kind: \"leaf\" | \"node\";\n children: string[];\n step: number;\n event: number;\n hash?: string;\n}\n\nfunction grow(diagram: DiagramModel): { grown: Grown[]; parents: Map<string, string> } {\n const boxes = new Set(diagram.boxes.map((b) => b.id));\n const byId = new Set<string>();\n const parents = new Map<string, string>();\n const grown: Grown[] = [];\n diagram.steps.forEach((step, s) => {\n step.events.forEach((e, k) => {\n if ((e.type !== \"leaf\" && e.type !== \"node\") || byId.has(e.id) || boxes.has(e.id)) return;\n const children = e.type === \"node\" ? [...new Set(e.children)].filter((c) => byId.has(c) && !parents.has(c)) : [];\n for (const c of children) parents.set(c, e.id);\n grown.push({ id: e.id, kind: e.type, children, step: s, event: k, ...(e.hash !== undefined ? { hash: e.hash } : {}) });\n byId.add(e.id);\n });\n });\n return { grown, parents };\n}\n\n/** 箱の中の字の行と、行ごとの字の形。根は名札を上に値を下に、ほかの箱は値を上に名札を下に置く */\nfunction linesOf(g: Grown, root: boolean): { text: string; style: TextStyle }[] {\n if (g.hash === undefined) return [{ text: g.id, style: TYPE.boxName }];\n if (root)\n return [\n { text: g.id, style: TYPE.rootName },\n { text: g.hash, style: TYPE.rootHash },\n ];\n if (g.kind === \"leaf\") return [{ text: g.hash, style: TYPE.treeHash }];\n return [\n { text: g.hash, style: TYPE.treeHash },\n { text: g.id, style: TYPE.treeName },\n ];\n}\n\n/** 箱どうしの線。縦の範囲が重なれば横に、横の範囲が重なれば縦に、どちらも重ならなければ送る側から縦に出て受ける側の高さで横に入る */\nfunction route(a: Rect, b: Rect): Point[] {\n const i = LOOK.edge.inset;\n const top = Math.max(a.y, b.y);\n const bottom = Math.min(a.y + a.h, b.y + b.h);\n if (bottom > top) {\n const y = (top + bottom) / 2;\n return b.x >= a.x + a.w\n ? [\n [a.x + a.w + i, y],\n [b.x - i, y],\n ]\n : [\n [a.x - i, y],\n [b.x + b.w + i, y],\n ];\n }\n const left = Math.max(a.x, b.x);\n const right = Math.min(a.x + a.w, b.x + b.w);\n if (right > left) {\n const x = (left + right) / 2;\n return b.y >= a.y + a.h\n ? [\n [x, a.y + a.h + i],\n [x, b.y - i],\n ]\n : [\n [x, a.y - i],\n [x, b.y + b.h + i],\n ];\n }\n const ax = a.x + a.w / 2;\n const ty = b.y + b.h / 2;\n return [\n [ax, b.y > a.y ? a.y + a.h + i : a.y - i],\n [ax, ty],\n [b.x > ax ? b.x - i : b.x + b.w + i, ty],\n ];\n}\n\nexport function layoutTree(diagram: DiagramModel): TreeLayout {\n const { margin, gap, box: B, tree: T, badge: BD } = LOOK;\n const { grown, parents } = grow(diagram);\n const tops = grown.filter((g) => !parents.has(g.id));\n const rootId = tops[tops.length - 1]?.id;\n const byId = new Map(grown.map((g) => [g.id, g]));\n\n // 根からの深さ。親を持たない箱から子へ辿る\n const depth = new Map<string, number>();\n const walk = (id: string, d: number): void => {\n depth.set(id, d);\n for (const c of byId.get(id)?.children ?? []) walk(c, d + 1);\n };\n for (const t of tops) walk(t.id, 0);\n\n const texts = new Map(grown.map((g) => [g.id, linesOf(g, g.id === rootId)]));\n const widest = (id: string): number => Math.max(0, ...(texts.get(id) ?? []).map((line) => textWidth(line.text, line.style)));\n const widthOf = (g: Grown): number =>\n g.id === rootId ? Math.max(T.root.w, T.root.textX + widest(g.id) + T.root.padR) : Math.max(T.w, widest(g.id) + T.padX * 2);\n const cardW = (g: Grown): number => Math.max(T.card.minW, T.card.padX * 2 + T.card.icon + T.card.gap + textWidth(g.id, TYPE.treeCard));\n const hasCard = (g: Grown): boolean => g.kind === \"leaf\" && g.hash !== undefined;\n\n // 子を持たない箱を書いた順に左から並べる。間は一番広い箱か札の幅に、隣の箱との間を足した長さ\n const slots = grown.filter((g) => g.children.length === 0);\n const pitch = Math.max(...grown.filter((g) => g.id !== rootId || g.children.length === 0).map((g) => Math.max(widthOf(g), hasCard(g) ? cardW(g) : 0)), T.w) + T.slotGap;\n const x0 = margin + BD.r * 2 + BD.inset;\n const xs = new Map<string, number>();\n slots.forEach((g, i) => xs.set(g.id, x0 + pitch * (i + 0.5)));\n const xOf = (id: string): number => {\n const known = xs.get(id);\n if (known !== undefined) return known;\n const kids = byId.get(id)?.children ?? [];\n const x = (xOf(kids[0] as string) + xOf(kids[kids.length - 1] as string)) / 2;\n xs.set(id, x);\n return x;\n };\n const top0 = margin + T.top;\n const yOf = (d: number): number => top0 + T.root.h / 2 + d * T.row;\n\n const colors = boxColors(diagram);\n const nodes: TreePlaced[] = grown.map((g) => {\n const root = g.id === rootId;\n const d = depth.get(g.id) ?? 0;\n const cx = xOf(g.id);\n const cy = yOf(d);\n const w = widthOf(g);\n const h = root ? T.root.h : T.h;\n const lines = texts.get(g.id) ?? [];\n const baselines =\n lines.length === 1 ? [cy + T.oneY] : root ? [cy + T.root.nameY, cy + T.root.hashY] : [cy + T.hashY, cy + T.nameY];\n const parent = parents.get(g.id);\n const color: ColorKey = root ? T.rootColor : T.color;\n colors.set(g.id, color);\n const cw = cardW(g);\n return {\n id: g.id,\n kind: g.kind,\n depth: d,\n ...(parent !== undefined ? { parent } : {}),\n children: g.children,\n step: g.step,\n event: g.event,\n ...(g.hash !== undefined ? { hash: g.hash } : {}),\n root,\n x: cx - w / 2,\n y: cy - h / 2,\n w,\n h,\n cx,\n cy,\n color,\n lines: lines.map((line) => line.text),\n baselines,\n styles: lines.map((line) => line.style),\n ...(hasCard(g) ? { card: { x: cx - cw / 2, y: cy + T.card.drop - T.card.h / 2, w: cw, h: T.card.h, text: g.id } } : {}),\n };\n });\n const placed = new Map(nodes.map((n) => [n.id, n]));\n\n // 子から親への木の線。子の段と親の段の間の高さで横に渡る\n const links: TreeLink[] = nodes.flatMap((p) =>\n p.children.flatMap((id): TreeLink[] => {\n const c = placed.get(id);\n if (!c) return [];\n const mid = (c.y + p.y + p.h) / 2;\n const points: Point[] = [\n [c.cx, c.y - LOOK.edge.inset],\n [c.cx, mid],\n [p.cx, mid],\n [p.cx, p.y + p.h + LOOK.edge.inset],\n ];\n return [{ from: c.id, to: p.id, step: p.step, event: p.event, points }];\n }),\n );\n\n // 木でない箱は、木の右に根の上端の高さから縦に並べる。根と箱の間の線に名前を書く時は、名前の分だけ根から離す\n const rooms = slotRooms(diagram);\n const treeRight = Math.max(x0, ...nodes.flatMap((n) => [n.x + n.w, ...(n.card ? [n.card.x + n.card.w] : [])]));\n const rootBox = nodes.find((n) => n.root);\n const ids = new Set(diagram.boxes.map((b) => b.id));\n const named = edgesOf(diagram).flatMap(({ edge }) => (edge.label !== undefined && (ids.has(edge.from) || ids.has(edge.to)) ? [textWidth(edge.label, labelStyle(edge.label)) + LOOK.label.padX * 2] : []));\n // 根と箱を行きと帰りで結ぶ線は離して2本引くので、2つの段の番号が運ぶ物の待つ所と着く所を避けて真ん中に並ぶ長さまで、根から離す (#3607)\n const lines = edgesOf(diagram).map(({ edge }) => edge);\n const paired = lines.flatMap((edge) => (edge.from !== edge.to && (ids.has(edge.from) || ids.has(edge.to)) && lines.some((o) => o.from === edge.to && o.to === edge.from) ? [pairReach(edge.carry)] : []));\n const rootRight = rootBox ? rootBox.x + rootBox.w : x0;\n const boxX = Math.max(treeRight + T.boxGap, rootRight + Math.max(0, ...named) + gap * 2, rootRight + Math.max(0, ...paired));\n let by = rootBox?.y ?? top0;\n const boxes: SceneBox[] = diagram.boxes.map((b) => {\n // 形を持つ箱は、中身が形の内に収まる大きさにする (#3520)\n const fit = shapedSize(diagram, b.id, Math.max(boxWidth(diagram, b.id, true), slotBoxWidth(rooms.get(b.id), b.icon !== undefined, B.padX)), true, rooms);\n const { w, h } = fit;\n const y = by;\n by += h + gap;\n const box: SceneBox = {\n id: b.id,\n name: b.name,\n ...(b.sub !== undefined ? { sub: b.sub } : {}),\n ...(b.icon !== undefined ? { icon: b.icon } : {}),\n color: colors.get(b.id) ?? \"slate\",\n x: boxX,\n y,\n ...fit,\n cx: boxX + w / 2,\n cy: y + h / 2,\n };\n placeSlot(box, rooms.get(b.id));\n return box;\n });\n const boxById = new Map(boxes.map((b) => [b.id, b]));\n\n // 線。親子の箱どうしの線は木の線の上を、向きに合わせて走る\n const runs: TreeRun[] = [];\n const edges: SceneEdge[] = diagram.steps.flatMap((step, s) =>\n step.events.flatMap((e, k): SceneEdge[] => {\n if (e.type !== \"edge\") return [];\n const a: Rect | undefined = placed.get(e.from) ?? boxById.get(e.from);\n const b: Rect | undefined = placed.get(e.to) ?? boxById.get(e.to);\n if (!a || !b) return [];\n const up = links.find((l) => l.from === e.from && l.to === e.to);\n const down = links.find((l) => l.from === e.to && l.to === e.from);\n const link = up ?? down;\n if (link) runs.push({ step: s, event: k, link: link.from });\n const points = up ? up.points : down ? [...down.points].reverse() : e.from === e.to ? loopUnder({ cx: a.x + a.w / 2, y: a.y, h: a.h }) : route(a, b);\n return [{ step: s, event: k, from: e.from, to: e.to, points, color: edgeColor(e, colors), carry: e.carry }];\n }),\n );\n seatCarriers(edges, boxById, rooms);\n // 木の線を走らない線のうち、同じ2つの箱を行きと帰りで結ぶ線は、構成図と状態遷移図と同じく離す (#3607)。木の線を走る線は木の線の上に描くので離さない\n const isRun = (e: SceneEdge): boolean =>\n runs.some((r) => r.step === e.step && r.event === e.event);\n const outward = pullApart(\n edges.filter((e) => !isRun(e)),\n askedSide(diagram),\n );\n\n const layout: TreeLayout = {\n kind: \"tree\",\n width: 0,\n height: 0,\n regions: [],\n boxes,\n lifelines: [],\n edges,\n labels: [],\n actions: [],\n badges: [],\n paths: [],\n ends: [],\n nodes,\n links,\n runs,\n };\n layout.badges = badgesOf(diagram, layout, outward);\n layout.labels = labelsOf(diagram, layout, outward);\n\n const cards = nodes.flatMap((n) => (n.card ? [n.card] : []));\n const solids: Rect[] = [...nodes, ...cards, ...boxes, ...layout.labels];\n const points = edges.flatMap((e) => e.points);\n const right = Math.max(...solids.map((r) => r.x + r.w), ...points.map(([x]) => x), x0);\n const bottom = Math.max(...solids.map((r) => r.y + r.h), ...points.map(([, y]) => y), top0);\n const width = Math.max(right + margin, stripNeed(diagram) + margin * 2);\n const strip = layoutStrip(diagram, margin, bottom + gap, width - margin * 2);\n layout.width = width;\n layout.height = (strip ? strip.y + strip.h : bottom) + margin;\n if (strip) layout.strip = strip;\n // 中身の帯だけを書き換える段の番号は帯の左上に置くので、帯を置いた後に決め直す\n layout.badges = badgesOf(diagram, layout, outward);\n return layout;\n}\n\n/**\n * 行きと帰りで離した2本の線の段の番号を、真ん中から線の出る側へ寄せる長さ (#3607)。\n * 2本は `pullApart` が `APART.line` と線の太さの分だけ離すので、真ん中に並べた2つの番号は、崩れの確かめが近すぎると数える間 (`APART.badge`) より近い。\n * 2つを反対の向きにこの長さずつ寄せると、番号の縁どうしが `APART.badge` より離れる\n */\nconst PAIR_LEAD = Math.sqrt(Math.max(0, (LOOK.badge.r * 2 + APART.badge + 0.5) ** 2 - (APART.line + LOOK.stroke.edgeOn) ** 2)) / 2;\n\n/**\n * 段の番号。箱が現れる段は最初に現れた木の箱の左に置き、左が埋まっていれば左上の角、右、右上の角の順に空きを探す。\n * 線を引く段は最初の線の上に置く。木の線を走る線は、子の側の曲がり角から横の線に沿って `LOOK.tree.badgeAlong` 進めた所に、ほかの線は真ん中に置き、\n * 運ぶ物が出発を待つ所と着いた所を空ける。同じ 2 つの箱を結ぶ線を前の段が通っていれば、前の段の番号と同じ所に置いて数字を入れ替える (#3184)。\n * どちらも無い段は、書き換える箱の左上の角か、帯の左上の角の丸みの中に置き、それも無ければ前の段の番号の所に置く。\n * 線の番号のほかで前の段の番号と同じ所に来た番号は、前の番号の脇に並べる (#3525)。\n * 行きと帰りで離した線 (`outward` が持つ線) は、真ん中から線の出る側へ `PAIR_LEAD` 寄せた所から探す。2本の真ん中は番号どうしが近すぎるので、\n * 2つの番号が真ん中の空きを分け合い、運ぶ物が待つ所と着いた所に押し出されない (#3607)\n */\nfunction badgesOf(diagram: DiagramModel, layout: TreeLayout, outward: Map<SceneEdge, LabelSide>): SceneBadge[] {\n const { r, inset } = LOOK.badge;\n const apart = r * 2 + inset;\n const taken: Point[] = [];\n const out: SceneBadge[] = [];\n const solids: Rect[] = [...layout.nodes, ...layout.nodes.flatMap((n) => (n.card ? [n.card] : [])), ...layout.boxes];\n const free = (p: Point): boolean =>\n taken.every(([x, y]) => Math.hypot(p[0] - x, p[1] - y) >= apart) && solids.every((s) => gapBetween(badgeRect(p), s) >= LOOK.label.touch);\n const put = (s: number, p: Point, color: ColorKey): void => {\n taken.push(p);\n out.push({ step: s, x: p[0], y: p[1], color });\n };\n const passed = new Map<string, Point>();\n const lineOf = new Map<number, string>();\n diagram.steps.forEach((step, s) => {\n const k = step.events.findIndex((e) => e.type === \"leaf\" || e.type === \"node\" || e.type === \"edge\");\n const first = step.events[k];\n const n = layout.nodes.find((x) => x.step === s && x.event === k);\n if (first && first.type !== \"edge\" && n) {\n const spots: Point[] = [\n [n.x - inset - r, n.cy],\n [n.x, n.y],\n [n.x + n.w + inset + r, n.cy],\n [n.x + n.w, n.y],\n ];\n put(s, spots.find(free) ?? (spots[0] as Point), n.color);\n return;\n }\n const e = layout.edges.find((x) => x.step === s && x.event === k);\n if (first?.type === \"edge\" && e) {\n const run = layout.runs.some((x) => x.step === s && x.event === k);\n // 木の線を走る線は行きも帰りも同じ木の線の上を走るので 2 つの箱の組で、離した行きと帰りの線は引いた線の形で同じ線とみなす\n const key = run ? [e.from, e.to].sort().join(\"\\n\") : lineKey(e);\n const lines = layout.edges.filter((x) => x !== e).map((x) => x.points);\n const point = passed.get(key) ?? (run ? onLink(e.points, free) : midway(e, free, outward.has(e) ? PAIR_LEAD : 0)) ?? badgeOnPath(e.points, taken, lines);\n passed.set(key, point);\n lineOf.set(s, key);\n put(s, point, e.color);\n return;\n }\n const box = step.events.flatMap((ev) => (ev.type === \"swap\" || ev.type === \"action\" ? [ev.box] : [])).flatMap((id) => layout.boxes.filter((b) => b.id === id))[0];\n if (box) {\n out.push({ step: s, x: box.x, y: box.y, color: box.color });\n return;\n }\n if (layout.strip && step.events.some((ev) => ev.type === \"strip\")) {\n const [x, y] = stripBadge(layout.strip);\n out.push({ step: s, x, y, color: \"slate\" });\n return;\n }\n const before = out[out.length - 1];\n const root = layout.nodes.find((x) => x.root);\n out.push(before ? { ...before, step: s } : { step: s, x: root?.x ?? LOOK.margin, y: root?.y ?? LOOK.margin, color: root?.color ?? \"slate\" });\n });\n const cards: Rect[] = [...layout.nodes, ...layout.nodes.flatMap((n) => (n.card ? [n.card] : []))];\n return besideSameSpot(out, badgeBlocked(layout, cards), (before, after) => lineOf.has(before.step) && lineOf.get(before.step) === lineOf.get(after.step));\n}\n\n/** 木の線の上の段の番号の点。最初の曲がり角から横の線に沿って進め、横の線が短い時は縦の線の真ん中の脇に置く */\nfunction onLink(points: Point[], free: (p: Point) => boolean): Point | undefined {\n const [p0, p1, p2] = points as [Point, Point, Point];\n const flat = Math.abs(p2[0] - p1[0]);\n const { r, inset } = LOOK.badge;\n if (flat >= LOOK.tree.badgeAlong + r) {\n const p = along(points, pathLength([p0, p1]) + LOOK.tree.badgeAlong);\n if (free(p)) return p;\n }\n const side: Point = [p1[0] + r + inset, p1[1]];\n return free(side) ? side : undefined;\n}\n\n/**\n * 根と箱を行きと帰りで結ぶ2本の線を引くのに要る、根の右の縁から箱の左の縁までの長さ (#3607)。\n * 線は両端を `LOOK.edge.inset` 空け、`midway` は運ぶ物の待つ所と着く所を空けた真ん中に、2つの番号を `PAIR_LEAD` ずつ反対の向きへ寄せて並べる\n */\nfunction pairReach(carry: Carry): number {\n const room = carrierHalf(carry)[0] + LOOK.badge.r + LOOK.badge.inset;\n return 2 * (LOOK.edge.inset + room + PAIR_LEAD) + 1;\n}\n\n/** 木の線でない線の段の番号の点。運ぶ物が待つ線の両端を空け、真ん中から外へ空きを探す。線が短くて空かない時は返さない */\nfunction midway(e: SceneEdge, free: (p: Point) => boolean, lead: number): Point | undefined {\n const length = pathLength(e.points);\n const room = carrierHalf(e.carry)[0] + LOOK.badge.r + LOOK.badge.inset;\n // 探し始める所は、真ん中から線の出る側へ `lead` 寄せた所。両端の `room` の内に収める\n const start = Math.min(Math.max(length / 2 - lead, room), length - room);\n for (let d = 0; d <= length - 2 * room; d += 1) {\n for (const at of [start - d, start + d]) {\n if (at < room || at > length - room) continue;\n const p = along(e.points, at);\n if (free(p)) return p;\n }\n }\n return undefined;\n}\n\n/** 線の名前。箱と木の箱から離し、葉の下の札と同じ段の名前に重ねず、同じ時刻に見える段の番号に食い込ませない */\nfunction labelsOf(\n diagram: DiagramModel,\n layout: TreeLayout,\n outward: Map<SceneEdge, LabelSide>,\n): SceneLabel[] {\n const labels: SceneLabel[] = [];\n const cards = layout.nodes.flatMap((n) => (n.card ? [n.card] : []));\n for (const e of layout.edges) {\n const source = diagram.steps[e.step]?.events[e.event];\n if (source?.type !== \"edge\" || source.label === undefined) continue;\n const seen = layout.badges.filter((b) => b.step <= e.step).map((b) => badgeRect([b.x, b.y]));\n // 行きと帰りで離した線の名前はずらした側に置き、反対の側 (組の相手の線の側) は探さない (#3607)\n const side = source.labelSide ?? outward.get(e);\n labels.push(\n placeLabel(\n { step: e.step, event: e.event, text: source.label, points: e.points, color: e.color, ...(side ? { side } : {}), ...(outward.has(e) ? {} : { flip: true }) },\n { hard: [...layout.nodes, ...layout.boxes], soft: [...cards, ...labels.filter((l) => l.step === e.step)], touch: seen },\n ),\n );\n }\n return labels;\n}\n","/** 木の図の描く部品の組 (#3248、#3656)。並べ方は図の種類の置き場 (`kinds/tree/layout.ts`、#3348)、木の線と通った跡と木の箱と札の描き方は `render/tree.ts` が持つ (#3233) */\nimport type { Rect } from \"../layout/scene\";\nimport { MOTION } from \"../look/values\";\nimport { drawTree } from \"../render/tree\";\nimport type { KindParts } from \"./parts\";\nimport { layoutTree, type TreeLayout } from \"./tree/layout\";\n\nexport const parts: KindParts<TreeLayout> = {\n layout: layoutTree,\n // 運ぶ物は着いた所で消える。通った跡が行き先を残し、兄弟の箱から同じ親へ着いた運ぶ物が重ならないため\n carried: (timeline) => timeline.carriers.map((time) => ({ ...time, start: time.depart, end: time.arrive + MOTION.fade })),\n draw: (layout, diagram, ctx) => {\n const tree = drawTree(layout, diagram, ctx.t, ctx);\n // 木の線を走る線は通った跡が見せるので、ほかの線と同じ線で描かない。\n // 木の箱は段ごとに現れるので、木の線を走らない線の点線は、両端の木の箱が現れてから出す (#3240)\n const runs = new Set(layout.runs.map((r) => `${r.step}/${r.event}`));\n return {\n base: tree.links,\n lit: tree.trails,\n node: tree.nodes,\n edge: (e) => (runs.has(`${e.step}/${e.event}`) ? undefined : Math.max(tree.appear.get(e.from) ?? 0, tree.appear.get(e.to) ?? 0)),\n };\n },\n // その段で現れる木の箱と木の線と、線の両端の木の箱を見る\n focus: (layout, diagram, step) => {\n const ends = new Set((diagram.steps[step]?.events ?? []).flatMap((e) => (e.type === \"edge\" ? [e.from, e.to] : [])));\n const links = layout.links.filter((l) => l.step === step).map((l): Rect => {\n const xs = l.points.map((p) => p[0]);\n const ys = l.points.map((p) => p[1]);\n return { x: Math.min(...xs), y: Math.min(...ys), w: Math.max(...xs) - Math.min(...xs), h: Math.max(...ys) - Math.min(...ys) };\n });\n return [...layout.nodes.filter((n) => n.step === step || ends.has(n.id)), ...links];\n },\n overview: (layout) => layout.nodes.map((node) => ({ rect: node, band: false, color: node.color })),\n};\n"]}